{"meta":{"query_hash":"a544a3ad79b2","filters":{"topic":"Tensor decomposition and applications"},"cohort_total":314,"direct_labels_cover":0,"predictions_cover":314,"exported":314,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a544a3ad79b2","api":"https://metacan.xera.ac/api/v1/cohort?topic=Tensor+decomposition+and+applications"},"results":[{"id":"W1501282291","doi":"10.22329/amr.v13i1.2833","title":"Analysing Three-way Profile Data Using the Parafac and Tucker3 Models Illustrated with Views on Parenting","year":2009,"lang":"en","type":"article","venue":"Applied Multivariate Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Style (visual arts); Parenting styles; Psychology; Curse of dimensionality; Developmental psychology; Control (management); Social psychology; Point (geometry); Computer science; Artificial intelligence; Mathematics","score_opus":0.5522684246707468,"score_gpt":0.4895521336071181,"score_spread":0.06271629106362869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501282291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03383561,0.00029007503,0.9612757,0.0006501045,0.000077958044,0.0002066196,0.00037038265,0.00063036004,0.002663262],"genre_scores_gemma":[0.3991319,0.0008164576,0.59386533,0.0002704149,0.00009482611,0.0008820313,0.00083724264,0.00029135,0.0038104677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927254,0.0046107797,0.00025851736,0.0010703655,0.0009859015,0.00034914113],"domain_scores_gemma":[0.98044133,0.012522155,0.0018923845,0.0030792987,0.0017164951,0.00034843874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0109954495,0.0019637165,0.0010896719,0.002465601,0.0013099462,0.0031858513,0.0014120182,0.0015055822,0.0058606975],"category_scores_gemma":[0.03972558,0.00062448875,0.0028407963,0.0037565269,0.0022210015,0.0031067482,0.0021545773,0.0027402889,0.0017156082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060566055,0.00029989952,0.06361091,0.00063145626,0.0005455982,0.0011427109,0.0112713,0.17011607,0.007696359,0.23262773,0.010419456,0.5010329],"study_design_scores_gemma":[0.00003684292,0.00045952466,0.027531754,0.00024631593,0.00010741516,0.001046636,0.0029557124,0.7191817,0.0028997906,0.23160422,0.013646042,0.0002840114],"about_ca_topic_score_codex":0.010433058,"about_ca_topic_score_gemma":0.008705799,"teacher_disagreement_score":0.0109954495,"about_ca_system_score_codex":0.0012482497,"about_ca_system_score_gemma":0.0018243933,"threshold_uncertainty_score":0.058150172},"labels":[],"label_agreement":null},{"id":"W1546510688","doi":"10.5220/0002982000800084","title":"MULTIMETRIC NETWORK TOMOGRAPHY","year":2010,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Network tomography; Metric (unit); Computer science; Path (computing); Algorithm; Factorization; Link (geometry); Network packet; Tomography; Artificial intelligence; Computer network; Physics; Optics","score_opus":0.026871061522596197,"score_gpt":0.31311952541448407,"score_spread":0.28624846389188785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546510688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003371691,0.0002113363,0.9938479,0.00021897172,0.000052983833,0.000024289733,0.000088689674,0.000121866695,0.0020621303],"genre_scores_gemma":[0.38810468,0.0014596065,0.6035236,0.00046759687,0.0002596559,0.00023311224,0.0004176313,0.00015825432,0.005375805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988563,0.00045431935,0.00003888146,0.00023105291,0.00033500223,0.000084460655],"domain_scores_gemma":[0.99853957,0.0004985325,0.0002717041,0.0003341132,0.00027497165,0.000081016864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011142488,0.0010036783,0.0007003533,0.0015693421,0.00048208103,0.0015163298,0.0012610134,0.0011710324,0.0017303211],"category_scores_gemma":[0.0046377587,0.00046784992,0.00062109175,0.0013865286,0.001555841,0.0034914082,0.0020233796,0.0015709746,0.00035914022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013540692,0.00006304331,0.0039112633,0.00028414425,0.00011061175,0.0005379927,0.00037779156,0.40672138,0.022727301,0.4490875,0.0047282754,0.111315355],"study_design_scores_gemma":[0.000006825742,0.000033175224,0.00051211816,0.000018211163,0.000012400767,0.00039548695,0.000053888263,0.91193753,0.0031197777,0.076895386,0.0069871973,0.00002799854],"about_ca_topic_score_codex":0.0020207218,"about_ca_topic_score_gemma":0.0014228122,"teacher_disagreement_score":0.0020207218,"about_ca_system_score_codex":0.0012342175,"about_ca_system_score_gemma":0.0008598874,"threshold_uncertainty_score":0.008954942},"labels":[],"label_agreement":null},{"id":"W1550321157","doi":"10.5539/jmr.v7n2p175","title":"A Shifted Power Method for Homogenous Polynomial Optimization over Unit Spheres","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; SPHERES; Convergence (economics); Polynomial; Unit (ring theory); Scope (computer science); Mathematical optimization; Power (physics); Global optimization; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.29759129457076805,"score_gpt":0.5054339490502334,"score_spread":0.20784265447946537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550321157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026377093,0.000114025024,0.9947291,0.000073265895,0.00004773085,0.000018362578,0.000013613594,0.00005455933,0.0023116288],"genre_scores_gemma":[0.1738424,0.0008116603,0.8106506,0.00025641528,0.00023847618,0.00019145751,0.00012902891,0.0005260221,0.013353957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955887,0.00017342572,0.000020871157,0.00007992466,0.00013069216,0.000036247355],"domain_scores_gemma":[0.99944454,0.00021430358,0.000035709563,0.000105236286,0.00014271557,0.000057471585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945842,0.0008616438,0.0008129044,0.0007213362,0.00047278905,0.0007764143,0.0012467162,0.00096485694,0.006479512],"category_scores_gemma":[0.0025386214,0.0003055883,0.0006618419,0.00069498405,0.0012028499,0.0022270235,0.0020532822,0.0018179647,0.0018273123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016419635,0.00009228657,0.00038035537,0.00035633007,0.000060278944,0.00019738465,0.0001974225,0.16878758,0.020936051,0.5992514,0.005632031,0.20394471],"study_design_scores_gemma":[0.000018005385,0.000063826046,0.000059896447,0.000013920982,0.000009817536,0.00005851887,0.000022282376,0.9037344,0.0027260939,0.087765515,0.0055135796,0.000014151037],"about_ca_topic_score_codex":0.0011664589,"about_ca_topic_score_gemma":0.0012837088,"teacher_disagreement_score":0.006479512,"about_ca_system_score_codex":0.0005545349,"about_ca_system_score_gemma":0.0008146131,"threshold_uncertainty_score":0.021676064},"labels":[],"label_agreement":null},{"id":"W1576571322","doi":"10.48550/arxiv.1407.5183","title":"A Nonlinearly Preconditioned Conjugate Gradient Algorithm for Rank-R Canonical Tensor Approximation","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preconditioner; Conjugate gradient method; Convergence (economics); Rank (graph theory); Nonlinear conjugate gradient method; Tensor (intrinsic definition); Acceleration; Mathematics; Nonlinear system; Applied mathematics; Algorithm; Mathematical optimization; Computer science; Iterative method; Gradient descent; Pure mathematics; Physics; Artificial intelligence; Combinatorics; Artificial neural network","score_opus":0.09412979962344337,"score_gpt":0.24672262033258843,"score_spread":0.15259282070914507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576571322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001693897,0.00009337536,0.99651283,0.00011525019,0.000044551845,0.000036975976,0.00002937906,0.00040964014,0.001064098],"genre_scores_gemma":[0.048160683,0.00027232032,0.9463865,0.00013568735,0.00007756053,0.00015614438,0.00025747364,0.0003304273,0.0042233146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991579,0.00030456015,0.000050624418,0.00015476157,0.00026487533,0.00006726259],"domain_scores_gemma":[0.99881697,0.00045790587,0.00011633289,0.000223778,0.00032043378,0.0000646003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012438281,0.0013063891,0.0009355716,0.00066835765,0.0006188818,0.0010086356,0.0011273157,0.0012685148,0.005378108],"category_scores_gemma":[0.004414055,0.00046510133,0.0009096634,0.00095150515,0.001213188,0.0012894382,0.0015971207,0.0021789353,0.0036151614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020302448,0.00011928241,0.0010188627,0.0003493221,0.00009898011,0.0002214278,0.00027207425,0.4919209,0.021269044,0.11794545,0.013303653,0.35327792],"study_design_scores_gemma":[0.000017652448,0.000040032268,0.0000936164,0.00001215455,0.0000067001324,0.00006453254,0.000014648746,0.9783895,0.0032888614,0.012535158,0.0055216565,0.000015408195],"about_ca_topic_score_codex":0.0046407185,"about_ca_topic_score_gemma":0.0059982967,"teacher_disagreement_score":0.005378108,"about_ca_system_score_codex":0.00061458466,"about_ca_system_score_gemma":0.002496299,"threshold_uncertainty_score":0.017991543},"labels":[],"label_agreement":null},{"id":"W1600006467","doi":"10.1007/978-1-4939-0626-0_2","title":"Four Lectures on Secant Varieties","year":2014,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"","keywords":"Algebra over a field; Mathematics education; Computer science; Mathematics; Calculus (dental); Pure mathematics; Medicine","score_opus":0.045412482778699984,"score_gpt":0.2926905192322903,"score_spread":0.2472780364535903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600006467","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005490864,0.05720457,0.023673305,0.010172242,0.01949283,0.000038309125,0.00075336726,0.00069496565,0.88247955],"genre_scores_gemma":[0.026770836,0.021854388,0.0062809247,0.00072606996,0.005638712,0.00004087013,0.0005149942,0.0006189914,0.93755424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966216,0.000062215855,0.000013734326,0.00004604797,0.00017160321,0.00004432142],"domain_scores_gemma":[0.99969804,0.000050876613,0.00001639312,0.000039628794,0.000090936934,0.00010413818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005160096,0.0016325278,0.0007695181,0.0027963945,0.0010397002,0.0026467307,0.0005912982,0.000808025,0.053317245],"category_scores_gemma":[0.00086616504,0.0004917645,0.0005840214,0.0024427255,0.0013252691,0.0032584886,0.0019537832,0.0028420489,0.017973782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029005916,0.00004907923,0.00016796183,0.00018646779,0.000011577634,0.000066592664,0.00033991085,0.00075300795,0.0012479275,0.54839116,0.32646897,0.12228825],"study_design_scores_gemma":[0.000004511954,0.000018066637,0.00041205017,0.00018861992,0.000006383564,0.00015068927,0.00008623979,0.00053856964,0.00040562096,0.19089064,0.80728203,0.000016557959],"about_ca_topic_score_codex":0.0007837845,"about_ca_topic_score_gemma":0.0021014512,"teacher_disagreement_score":0.053317245,"about_ca_system_score_codex":0.0019949991,"about_ca_system_score_gemma":0.0011217532,"threshold_uncertainty_score":0.17836398},"labels":[],"label_agreement":null},{"id":"W1605320307","doi":"10.22329/amr.v13i1.2834","title":"Three-way Hierarchical Classes: A Comparison of the Indclas and Tucker3-Hiclas Models","year":2009,"lang":"en","type":"article","venue":"Applied Multivariate Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mode (computer interface); Computer science; Relation (database); Binary number; Hierarchical database model; Theoretical computer science; Data mining; Mathematics; Arithmetic","score_opus":0.21472050808779775,"score_gpt":0.45144523439945616,"score_spread":0.23672472631165842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605320307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077693984,0.0016394773,0.8961079,0.006621959,0.0002215368,0.0004320747,0.0013059676,0.000658292,0.015318767],"genre_scores_gemma":[0.75891477,0.0012616784,0.22460851,0.0011722625,0.00048641616,0.0012489134,0.0017169563,0.0003423557,0.010248173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9843239,0.009767713,0.00051814143,0.0019906978,0.0024791756,0.000920326],"domain_scores_gemma":[0.9386626,0.039469656,0.0049325754,0.009114563,0.0059961206,0.0018245257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027018264,0.0013061994,0.0017740264,0.003940403,0.0021489698,0.005342575,0.0062430603,0.0024410668,0.008546985],"category_scores_gemma":[0.05720486,0.0009480371,0.004473633,0.00523482,0.0061248993,0.008219051,0.004121071,0.0047202795,0.0013477902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002774715,0.00013190087,0.0084700165,0.0001402335,0.00022600715,0.0000842573,0.0021077127,0.03193678,0.00017725215,0.88681513,0.005937444,0.06369574],"study_design_scores_gemma":[0.000049214366,0.00007530197,0.0038498922,0.000087326,0.00007625706,0.00010908299,0.00041585736,0.3628114,0.00014785101,0.6277763,0.0045280177,0.00007346646],"about_ca_topic_score_codex":0.01682924,"about_ca_topic_score_gemma":0.017559411,"teacher_disagreement_score":0.027018264,"about_ca_system_score_codex":0.0059133726,"about_ca_system_score_gemma":0.0035216978,"threshold_uncertainty_score":0.14288795},"labels":[],"label_agreement":null},{"id":"W1608676567","doi":"10.1002/9780470689646.ch2","title":"Algebraic Techniques for Multilingual Document Clustering","year":2010,"lang":"en","type":"other","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sandia National Laboratories; National Nuclear Security Administration; McGill University","keywords":"Cluster analysis; Algebraic number; Computer science; Information retrieval; Document clustering; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.032267963136136786,"score_gpt":0.36689166341004936,"score_spread":0.3346237002739126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608676567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003287578,0.0018015995,0.9859505,0.00040520992,0.00016150526,0.00003626735,0.00043530203,0.0016830761,0.0062389765],"genre_scores_gemma":[0.07946984,0.002497725,0.8969334,0.00014069259,0.00056147896,0.00013122284,0.0029194958,0.00093720533,0.016408937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980077,0.00062782073,0.00015759337,0.0004142797,0.0007023099,0.00009023876],"domain_scores_gemma":[0.99721706,0.0007777109,0.0001939959,0.0008991993,0.00081095926,0.0001010154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016258507,0.0011836906,0.0011253977,0.0033776239,0.0012438121,0.0025749588,0.0014598875,0.000598648,0.008477191],"category_scores_gemma":[0.0058506154,0.0004873433,0.0011751697,0.0062998016,0.00083630113,0.004741283,0.0025374189,0.00223861,0.004775356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011466685,0.00009973218,0.00049981935,0.0003078603,0.00010783652,0.00008285683,0.00030369122,0.021180533,0.0036537063,0.20334522,0.03881319,0.7314909],"study_design_scores_gemma":[0.000035502802,0.00003961296,0.0008309729,0.00007519277,0.00006660358,0.00040131065,0.00019313201,0.38408086,0.006490587,0.52730703,0.0804208,0.000058414444],"about_ca_topic_score_codex":0.0032572418,"about_ca_topic_score_gemma":0.0045923702,"teacher_disagreement_score":0.008477191,"about_ca_system_score_codex":0.001028204,"about_ca_system_score_gemma":0.0012947164,"threshold_uncertainty_score":0.028358996},"labels":[],"label_agreement":null},{"id":"W1780038108","doi":"10.1090/s0002-9939-01-06251-7","title":"On the secant varieties to the tangential varieties of a Veronesean","year":2001,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Università di Bologna","keywords":"Mathematics; Tangent; Pure mathematics; Infinitesimal; Conjecture; Line (geometry); Quadratic equation; Mathematical analysis; Geometry","score_opus":0.03045666333862183,"score_gpt":0.29416563218783864,"score_spread":0.2637089688492168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780038108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9626584,0.00065031846,0.013470589,0.00036516492,0.000102951664,0.00001915825,0.000100397185,0.00006102594,0.022571903],"genre_scores_gemma":[0.9856067,0.00070925645,0.005994024,0.000060580784,0.00017958328,0.000029564555,0.0002356875,0.000033362976,0.0071512912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994967,0.00012392804,0.000028577017,0.00012522156,0.00010910587,0.00011638297],"domain_scores_gemma":[0.9984971,0.00031546777,0.00038821856,0.00012832796,0.00017166708,0.00049917516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073065865,0.0008399912,0.00058258564,0.0029432198,0.0014290315,0.0027483318,0.0006313201,0.00043578362,0.0047147204],"category_scores_gemma":[0.002556711,0.00035994986,0.0006122461,0.0010535693,0.0039226576,0.0037287346,0.0023086953,0.0017861172,0.00039455885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085519365,0.00003282351,0.0025949187,0.0000640789,0.000014050463,0.0001883847,0.00093032373,0.001740433,0.0029050019,0.9852819,0.00058049214,0.0055820597],"study_design_scores_gemma":[0.00003656988,0.0001444576,0.010390534,0.000084758896,0.000035805824,0.00083621446,0.0010236938,0.017365085,0.0021404014,0.9568148,0.011082723,0.00004497559],"about_ca_topic_score_codex":0.0011371359,"about_ca_topic_score_gemma":0.00084720686,"teacher_disagreement_score":0.0047147204,"about_ca_system_score_codex":0.0009782168,"about_ca_system_score_gemma":0.00028804567,"threshold_uncertainty_score":0.015772343},"labels":[],"label_agreement":null},{"id":"W179999808","doi":"10.1016/j.jpaa.2004.12.049","title":"Higher secant varieties of the Segre varieties <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>×</mml:mo><mml:mo>⋯</mml:mo><mml:mo>×</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>","year":2005,"lang":"lv","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Subvariety; Mathematics; Dimension (graph theory); Conjecture; Closure (psychology); Combinatorics; Variety (cybernetics); Statistics; Law","score_opus":0.018973413149533394,"score_gpt":0.24114351898782507,"score_spread":0.22217010583829166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179999808","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2646988,0.002824918,0.11232194,0.0028121243,0.0013162921,0.00006393746,0.0014851678,0.001211281,0.6132655],"genre_scores_gemma":[0.8054667,0.0013468915,0.020575289,0.00037168319,0.00078841427,0.000042935604,0.0013251099,0.0005749582,0.16950798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.00011813523,0.00002992506,0.00009320833,0.00013179313,0.00009933678],"domain_scores_gemma":[0.9993344,0.00012377517,0.000094162635,0.000121802754,0.0001903504,0.0001355306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062582904,0.0007497011,0.00045370634,0.0018622846,0.0014284675,0.0032108233,0.0004150502,0.00042675878,0.028964896],"category_scores_gemma":[0.0011757247,0.00039700244,0.00095074356,0.0014682184,0.002340127,0.0045139734,0.0013224939,0.001895937,0.0053627314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036539797,0.0000090142,0.00021607998,0.000022211683,0.0000055816286,0.00007340374,0.00021738316,0.00023103626,0.0007745671,0.9868233,0.0044022403,0.0071885404],"study_design_scores_gemma":[0.00002209395,0.000048712704,0.002037203,0.000027858208,0.0000187387,0.0005659013,0.00030218018,0.0026358298,0.0029855848,0.91197425,0.07934664,0.000035123034],"about_ca_topic_score_codex":0.0014753964,"about_ca_topic_score_gemma":0.0013393448,"teacher_disagreement_score":0.028964896,"about_ca_system_score_codex":0.0012679544,"about_ca_system_score_gemma":0.00058934896,"threshold_uncertainty_score":0.096897244},"labels":[],"label_agreement":null},{"id":"W1801870623","doi":"10.4153/cmb-2015-076-1","title":"Product Ranks of the 3 × 3 Determinant and Permanent","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rank (graph theory); Tensor product; Product (mathematics); Tensor (intrinsic definition); Direct product","score_opus":0.0455145325354404,"score_gpt":0.2794478881159374,"score_spread":0.233933355580497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801870623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.803963,0.0005570904,0.05680796,0.0008415786,0.00042928816,0.000045871282,0.00047519724,0.00044635878,0.13643362],"genre_scores_gemma":[0.9891945,0.00012496444,0.0034589353,0.000057525733,0.00012659265,0.000011262461,0.00012532428,0.00006319913,0.006837621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990067,0.0001234059,0.000063183215,0.00017547193,0.000319629,0.00031162094],"domain_scores_gemma":[0.99766964,0.0004862918,0.00047524436,0.00029636774,0.00046237741,0.00061002537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009108923,0.00046567182,0.0004586588,0.0016969974,0.001076532,0.0025897436,0.00044394704,0.0003620081,0.017373484],"category_scores_gemma":[0.0019507757,0.00025720082,0.0005553074,0.00059221644,0.003043066,0.0027336462,0.0021963583,0.0011919847,0.0015357996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022037252,0.000060237584,0.0029132606,0.00007711819,0.000018529152,0.0003097129,0.0004349819,0.0016955036,0.0069987136,0.9661828,0.0043000914,0.016788624],"study_design_scores_gemma":[0.000028913337,0.00025689104,0.007168545,0.0000392221,0.000039583138,0.0010342398,0.0004006622,0.011645227,0.012164713,0.9458971,0.021239487,0.00008542664],"about_ca_topic_score_codex":0.00065552135,"about_ca_topic_score_gemma":0.0007063928,"teacher_disagreement_score":0.017373484,"about_ca_system_score_codex":0.0006034212,"about_ca_system_score_gemma":0.0005767192,"threshold_uncertainty_score":0.058120072},"labels":[],"label_agreement":null},{"id":"W1919986261","doi":"10.1002/nla.1845","title":"The power and Arnoldi methods in an algebra of circulants","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Centre International de Recherche sur le Cancer","keywords":"Mathematics; Circulant matrix; Algebra over a field; Linear algebra; Scalar (mathematics); Dimension (graph theory); Matrix (chemical analysis); Numerical linear algebra; Pure mathematics; Discrete mathematics; Numerical analysis; Mathematical analysis","score_opus":0.03708464711442809,"score_gpt":0.37598441701929824,"score_spread":0.33889976990487014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919986261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00893404,0.00019570775,0.9849979,0.00024014019,0.00008830169,0.000028909735,0.000051474202,0.00009428603,0.00536926],"genre_scores_gemma":[0.30784014,0.00083392044,0.67598706,0.0002654018,0.00027995443,0.00021081776,0.00021908327,0.00039395483,0.013969666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991597,0.00032436676,0.000049465474,0.0001175636,0.00028223454,0.000066627596],"domain_scores_gemma":[0.99809283,0.00083014945,0.00017346507,0.00035927686,0.00040622355,0.00013806674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017575275,0.00058500085,0.0007497525,0.001000554,0.00069196837,0.0014211913,0.00089684996,0.0004885158,0.0038544973],"category_scores_gemma":[0.0048152013,0.00035042776,0.00075617374,0.00076431973,0.002267868,0.0023844116,0.0018310368,0.0015057126,0.0011407047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026685404,0.000018805167,0.00018332542,0.000048145586,0.000012658915,0.00006169577,0.000114182265,0.046411023,0.0022085216,0.92314404,0.0018540177,0.02591686],"study_design_scores_gemma":[0.000008564423,0.000021696475,0.00007188995,0.000014673123,0.0000045892357,0.0000421493,0.000035127363,0.37791747,0.0017652926,0.61449003,0.0056137387,0.000014824947],"about_ca_topic_score_codex":0.0012915098,"about_ca_topic_score_gemma":0.0013262565,"teacher_disagreement_score":0.0038544973,"about_ca_system_score_codex":0.0006414873,"about_ca_system_score_gemma":0.0010958131,"threshold_uncertainty_score":0.012894511},"labels":[],"label_agreement":null},{"id":"W1964144425","doi":"10.4153/cjm-2012-046-1","title":"On Hilbert Covariants","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Covariant transformation; Embedding; Divisor (algebraic geometry); Variety (cybernetics); Triviality; Ideal (ethics); Class (philosophy)","score_opus":0.06011526205570358,"score_gpt":0.3072372096845298,"score_spread":0.2471219476288262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964144425","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31415617,0.005569317,0.24471547,0.0072395154,0.0028334633,0.00015967448,0.000618733,0.00066377793,0.42404383],"genre_scores_gemma":[0.90925586,0.0019221271,0.0355092,0.0009842819,0.001233754,0.000062030034,0.00023171054,0.0002628739,0.0505383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982607,0.00044753694,0.000088685745,0.00024940178,0.00064788567,0.0003059327],"domain_scores_gemma":[0.9986059,0.00024453137,0.00013325381,0.00030660376,0.00045500774,0.00025474065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027315072,0.00076204765,0.0005558923,0.002417972,0.0021007303,0.002045211,0.0007310957,0.000976195,0.0042633996],"category_scores_gemma":[0.0028185758,0.0003544193,0.000805088,0.0009927446,0.01072638,0.0050331852,0.0033139768,0.0029760567,0.0008848761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024062933,0.0000026030918,0.000039797764,0.0000057950897,9.5116616e-7,0.000017615557,0.00012770749,0.000080488346,0.00018456801,0.99831796,0.0002551629,0.00096493866],"study_design_scores_gemma":[0.00000796192,0.000019068568,0.00026827684,0.000014399271,0.000003013704,0.00008397743,0.00008171517,0.0013603268,0.00044099498,0.9845046,0.013202953,0.000012725199],"about_ca_topic_score_codex":0.0035415592,"about_ca_topic_score_gemma":0.002594305,"teacher_disagreement_score":0.0042633996,"about_ca_system_score_codex":0.0030967146,"about_ca_system_score_gemma":0.0016915705,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1970394077","doi":"10.1063/1.2823971","title":"Orthogonal separation of variables for the Hamilton-Jacobi and wave equations in three-dimensional Minkowski space","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minkowski space; Hamilton–Jacobi equation; Separation of variables; Separable space; Orthogonal coordinates; Mathematics; Canonical coordinates; Cartesian coordinate system; Mathematical analysis; Space (punctuation); Generalized coordinates; Coordinate system; Separation (statistics); Action-angle coordinates; Mathematical physics; Pure mathematics; Physics; Partial differential equation; Phase space; Geometry; Quantum mechanics","score_opus":0.08808041428475184,"score_gpt":0.3371698783677919,"score_spread":0.24908946408304006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970394077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7489833,0.00029901668,0.22648278,0.0007732432,0.00015425858,0.00013089359,0.00020731844,0.00011891577,0.022850232],"genre_scores_gemma":[0.86269045,0.0005280402,0.12337851,0.00022033835,0.000090633446,0.00019939481,0.00022661463,0.0001457801,0.012520239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995608,0.00011377616,0.000036886984,0.000030740648,0.00018215741,0.000075606375],"domain_scores_gemma":[0.99977595,0.00004793903,0.00005267649,0.00003487569,0.00004163379,0.00004700557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009276483,0.0009622945,0.00072254194,0.000869892,0.0010170246,0.0016478457,0.0007767096,0.00073358335,0.0032371355],"category_scores_gemma":[0.0012548538,0.00042987036,0.0011883633,0.000668755,0.0018773404,0.0012993321,0.0015073107,0.0012985404,0.0005574902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006009618,0.000035593755,0.0005533976,0.0000321718,0.00002080915,0.00037640834,0.00019695253,0.019025601,0.00527061,0.96866333,0.00051606836,0.0052489135],"study_design_scores_gemma":[0.00015310619,0.000078725105,0.0010970715,0.000022955232,0.00002954642,0.00039141023,0.00041341814,0.1494623,0.0046504997,0.84080076,0.0028336782,0.00006663763],"about_ca_topic_score_codex":0.001496803,"about_ca_topic_score_gemma":0.0020602616,"teacher_disagreement_score":0.0032371355,"about_ca_system_score_codex":0.00080633257,"about_ca_system_score_gemma":0.0014278576,"threshold_uncertainty_score":0.01082927},"labels":[],"label_agreement":null},{"id":"W1974126243","doi":"10.1016/j.laa.2012.01.037","title":"Cayley’s hyperdeterminant: A combinatorial approach via representation theory","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invariant (physics); Enumeration; Combinatorics; Integer (computer science); Representation theory; Algebra over a field; Polynomial; Simple (philosophy); Discrete mathematics; Pure mathematics","score_opus":0.03904000227757939,"score_gpt":0.32440324925601227,"score_spread":0.2853632469784329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974126243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10182924,0.007883917,0.6132166,0.008388217,0.0025214667,0.00009104724,0.00038253985,0.00040924922,0.2652777],"genre_scores_gemma":[0.7732783,0.0062155924,0.15698333,0.0021212648,0.0042051203,0.00015837445,0.00031947333,0.00041329203,0.05630516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992424,0.0003338717,0.00003472085,0.00014160953,0.00018260353,0.00006489859],"domain_scores_gemma":[0.9990752,0.00035915885,0.000117196905,0.00012772625,0.00019502096,0.00012570251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013160293,0.0011860044,0.0010728212,0.002977087,0.0017601958,0.004210503,0.0015559781,0.0016380277,0.007409401],"category_scores_gemma":[0.002321682,0.0006606165,0.00094792695,0.0024759104,0.0046872627,0.005868793,0.00165789,0.0036572842,0.001068378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028341365,0.000004624557,0.000014098849,0.000009468201,0.0000016640608,0.000011379365,0.00004062992,0.00018195632,0.00011705887,0.99749506,0.0005664078,0.0015548038],"study_design_scores_gemma":[0.0000023451257,0.0000037680993,0.000019487134,0.0000045653615,0.0000019038862,0.000028358669,0.000019811121,0.0020854173,0.00007713127,0.9953621,0.0023901425,0.0000050063422],"about_ca_topic_score_codex":0.00092738494,"about_ca_topic_score_gemma":0.0009297928,"teacher_disagreement_score":0.007409401,"about_ca_system_score_codex":0.0013659057,"about_ca_system_score_gemma":0.0007775216,"threshold_uncertainty_score":0.02478689},"labels":[],"label_agreement":null},{"id":"W1978771480","doi":"10.1162/neco_a_00570","title":"Large Margin Low Rank Tensor Analysis","year":2014,"lang":"en","type":"article","venue":"Neural Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Dimensionality reduction; Tensor (intrinsic definition); Margin (machine learning); Curse of dimensionality; Pattern recognition (psychology); Mathematics; Projection (relational algebra); Artificial intelligence; Data point; Rank (graph theory); Computer science; Representation (politics); Dimension (graph theory); Algorithm; Machine learning; Combinatorics; Pure mathematics","score_opus":0.027006941903408365,"score_gpt":0.3218331844378574,"score_spread":0.29482624253444906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978771480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002289506,0.00015837731,0.9960615,0.00018621782,0.000030318242,0.000028592336,0.00012420632,0.0005788187,0.0005423963],"genre_scores_gemma":[0.2304991,0.00087564,0.7547392,0.0004781498,0.0003697515,0.0004312076,0.0023541946,0.00074141443,0.009511348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973239,0.001019743,0.0001429516,0.00052062055,0.00078854593,0.00020419169],"domain_scores_gemma":[0.99603647,0.0010425844,0.00061290467,0.0011283442,0.0009720324,0.00020773557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002716441,0.0019689596,0.0016593436,0.0014150983,0.00083109335,0.0023983868,0.0023496465,0.0014428385,0.0037052545],"category_scores_gemma":[0.008925136,0.0006969981,0.0016935235,0.0015999624,0.0019177181,0.003338836,0.002766668,0.0034047703,0.003227087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031468135,0.00024388664,0.0025226362,0.00037831365,0.00025385723,0.00027865244,0.00031257627,0.50096565,0.017303098,0.11416101,0.027941704,0.33532393],"study_design_scores_gemma":[0.000005699444,0.000045144894,0.00016464759,0.000010490203,0.000009752176,0.00004545807,0.000012014971,0.964332,0.0018990976,0.030707877,0.002750354,0.000017577504],"about_ca_topic_score_codex":0.002811848,"about_ca_topic_score_gemma":0.0034769569,"teacher_disagreement_score":0.0037052545,"about_ca_system_score_codex":0.0010047934,"about_ca_system_score_gemma":0.0018343971,"threshold_uncertainty_score":0.01436609},"labels":[],"label_agreement":null},{"id":"W1982573319","doi":"10.1002/cem.709","title":"‘Stretch’ vs ‘slice’ methods for representing three‐way structure via matrix notation","year":2002,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Korea Institute of Energy Research","keywords":"Slicing; Notation; Representation (politics); Matrix (chemical analysis); Matrix representation; Set (abstract data type); Computer science; Diagonal; Flexibility (engineering); Array data structure; Algorithm; Theoretical computer science; Mathematics; Arithmetic; Programming language; Computer graphics (images); Geometry; Group (periodic table)","score_opus":0.08810379124293947,"score_gpt":0.4277878576391258,"score_spread":0.3396840663961863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982573319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002779725,0.00011869172,0.99583495,0.00009065103,0.00003428612,0.000013419137,0.00003776779,0.00027397304,0.00081657775],"genre_scores_gemma":[0.0613515,0.000384352,0.9359149,0.00011036808,0.00006543889,0.00013348363,0.00017603615,0.00021112978,0.0016527235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984504,0.00082922773,0.00010484845,0.00018198474,0.000363052,0.00007052099],"domain_scores_gemma":[0.99694616,0.0013721192,0.00045402304,0.0007670511,0.0003745167,0.00008625528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025833983,0.0014044972,0.0006020938,0.0010241293,0.00038381518,0.0017056802,0.0012237733,0.0008216035,0.005655949],"category_scores_gemma":[0.0067327814,0.0002878524,0.00091585587,0.0016483448,0.001850462,0.003614847,0.0016479723,0.001331618,0.0019267742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016163704,0.00004755861,0.0005465937,0.00029459453,0.00007498621,0.00016666017,0.00060745084,0.10610843,0.019782776,0.5447955,0.005890958,0.32152283],"study_design_scores_gemma":[0.00002230118,0.00012682295,0.0003383489,0.00005508226,0.000033168915,0.0002492958,0.00017923166,0.6981044,0.013585115,0.26512247,0.022106629,0.000077164696],"about_ca_topic_score_codex":0.0012507109,"about_ca_topic_score_gemma":0.0011572107,"teacher_disagreement_score":0.005655949,"about_ca_system_score_codex":0.00044388353,"about_ca_system_score_gemma":0.00079467735,"threshold_uncertainty_score":0.018921018},"labels":[],"label_agreement":null},{"id":"W2003787220","doi":"10.1002/cem.665","title":"An index formalism that generalizes the capabilities of matrix notation and algebra to n‐way arrays","year":2001,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Korea Institute of Energy Research","keywords":"Notation; Formalism (music); Algebra over a field; Computer science; Matrix (chemical analysis); Context (archaeology); Matrix algebra; Theoretical computer science; Mathematics; Arithmetic; Pure mathematics; Physics","score_opus":0.045832148677248406,"score_gpt":0.33749582474370843,"score_spread":0.29166367606646004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003787220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007560649,0.00043766107,0.9639755,0.0006888705,0.0004190026,0.0000549442,0.00022168862,0.000709296,0.025932387],"genre_scores_gemma":[0.17977978,0.0010894331,0.79801816,0.0012242433,0.00068563136,0.0003077285,0.0005014892,0.00063145254,0.01776211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835974,0.00048080515,0.00022976738,0.0002788627,0.00052759907,0.0001231693],"domain_scores_gemma":[0.99817014,0.00046935448,0.00023640372,0.00068196986,0.00029729793,0.00014484557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028346893,0.00066298735,0.00081190036,0.0015623367,0.0014238165,0.0042917198,0.0015031119,0.0010384248,0.0049316846],"category_scores_gemma":[0.0038450342,0.00042887128,0.0015607212,0.0024499553,0.0033831706,0.008474883,0.0026309208,0.0021581592,0.0022928787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001529019,0.000014156281,0.000093911796,0.000035982994,0.0000065002832,0.0001013458,0.00026054587,0.0013930497,0.0017583217,0.9799644,0.0025913909,0.0137650585],"study_design_scores_gemma":[0.000009605773,0.000024787074,0.00009213239,0.000029066376,0.000010204503,0.00022450357,0.00007499531,0.017021064,0.0014027032,0.94181186,0.039268736,0.000030229266],"about_ca_topic_score_codex":0.0013651353,"about_ca_topic_score_gemma":0.0018145476,"teacher_disagreement_score":0.0049316846,"about_ca_system_score_codex":0.0008780445,"about_ca_system_score_gemma":0.0016306768,"threshold_uncertainty_score":0.016498148},"labels":[],"label_agreement":null},{"id":"W2004701861","doi":"10.1063/1.4861707","title":"Killing tensors, warped products and the orthogonal separation of the Hamilton-Jacobi equation","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Separable space; Constant curvature; Separation of variables; Action-angle coordinates; Hamiltonian (control theory); Bipolar coordinates; Differential geometry; Constant (computer programming); Orthogonal coordinates","score_opus":0.04561495930637477,"score_gpt":0.3147122227175251,"score_spread":0.2690972634111503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004701861","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60929185,0.0014223803,0.3406031,0.0010151009,0.00016652448,0.000044041557,0.00017062036,0.00013130801,0.047155026],"genre_scores_gemma":[0.9491276,0.00057505263,0.0394205,0.0000845846,0.00010743356,0.000032700333,0.000102599704,0.00005348948,0.01049599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997814,0.000045152028,0.000012866437,0.0000391688,0.0000639175,0.00005748487],"domain_scores_gemma":[0.999607,0.000059197864,0.00011118554,0.000056566456,0.000080175254,0.00008584095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037811018,0.00043262838,0.00026257956,0.0006734264,0.00076932815,0.0008065692,0.00040305522,0.0003796606,0.0027177678],"category_scores_gemma":[0.0007795287,0.0001638086,0.00039436505,0.00041403304,0.002277414,0.0021047546,0.0012860997,0.00084484805,0.00028567968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007772552,0.0000044784006,0.00013194732,0.00001438914,0.0000022382876,0.00006233154,0.00012163071,0.0014243694,0.0014052391,0.9938617,0.00024076314,0.0027231104],"study_design_scores_gemma":[0.000005335035,0.000028084249,0.0003428126,0.0000094714,0.0000040783752,0.00014221069,0.000120416946,0.017755091,0.001581493,0.976229,0.0037693246,0.000012790519],"about_ca_topic_score_codex":0.0009271941,"about_ca_topic_score_gemma":0.00072637707,"teacher_disagreement_score":0.0027177678,"about_ca_system_score_codex":0.00065569824,"about_ca_system_score_gemma":0.0005427374,"threshold_uncertainty_score":0.0090917945},"labels":[],"label_agreement":null},{"id":"W2005500822","doi":"10.1007/s10231-014-0470-y","title":"The secant line variety to the varieties of reducible plane curves","year":2014,"lang":"en","type":"article","venue":"Annali di Matematica Pura ed Applicata (1923 -)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; National Research Foundation; National Research Foundation of Korea; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Variety (cybernetics); Lambda; Combinatorics; Mathematics; Partition (number theory); Product (mathematics); Line (geometry); Geometry; Physics; Statistics; Quantum mechanics","score_opus":0.04101410708034894,"score_gpt":0.32382714785065614,"score_spread":0.2828130407703072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005500822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6855322,0.005491778,0.062298343,0.0031676397,0.001143979,0.00012189968,0.0006709504,0.0004242181,0.24114902],"genre_scores_gemma":[0.93023807,0.0032722694,0.014179098,0.00034544998,0.0014171413,0.00006425118,0.00047677485,0.0001577461,0.049849346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994024,0.0001866086,0.000030006235,0.00016483785,0.00012476323,0.000091337075],"domain_scores_gemma":[0.99937063,0.0001621637,0.000114480295,0.000064265056,0.000115479015,0.00017300028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008162778,0.0013690855,0.0010262727,0.0050489674,0.0018819666,0.0038761992,0.0009116751,0.00085992547,0.008901635],"category_scores_gemma":[0.0017967939,0.00056791294,0.0010655726,0.003250433,0.0042247395,0.0043730303,0.0023262757,0.004132598,0.0011953156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004932781,0.00001660253,0.00019656861,0.00003700138,0.0000115895045,0.00013423557,0.0004386944,0.0006736576,0.0006886221,0.9916496,0.0007201435,0.0053839795],"study_design_scores_gemma":[0.000043028147,0.000068609574,0.0012880905,0.00003382798,0.000026748448,0.00044190726,0.0003024602,0.003955652,0.00080229505,0.97596776,0.017046813,0.000022813187],"about_ca_topic_score_codex":0.0017456447,"about_ca_topic_score_gemma":0.0009058797,"teacher_disagreement_score":0.008901635,"about_ca_system_score_codex":0.0020889223,"about_ca_system_score_gemma":0.00061057665,"threshold_uncertainty_score":0.029778898},"labels":[],"label_agreement":null},{"id":"W2010946668","doi":"10.1007/s00014-003-0769-6","title":"On Waring's problem for several algebraic forms","year":2003,"lang":"en","type":"article","venue":"Commentarii Mathematici Helvetici","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Dimension (graph theory); Algebraic number; Degree (music); Scalar (mathematics); Polynomial ring; Pure mathematics; Polynomial; Combinatorics; Discrete mathematics; Algebra over a field; Mathematical analysis; Geometry","score_opus":0.058126340531118675,"score_gpt":0.33723655499162297,"score_spread":0.2791102144605043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010946668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5339011,0.0018053896,0.23562208,0.015939778,0.00084617554,0.000106668485,0.00048404894,0.00039285517,0.21090193],"genre_scores_gemma":[0.92604303,0.0009960614,0.042553645,0.0008557634,0.00060760806,0.0000695743,0.0003141193,0.00014060386,0.028419549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924845,0.00017489618,0.00003643486,0.00019663657,0.00017142671,0.00017209946],"domain_scores_gemma":[0.9986279,0.0006290175,0.00014486183,0.0003026199,0.0001103015,0.00018529595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013949807,0.0005660941,0.00090019405,0.0012426173,0.0023907505,0.0023792111,0.00094989245,0.0018002755,0.011933353],"category_scores_gemma":[0.0043261745,0.00033309232,0.00087061507,0.0011688403,0.0075276154,0.010807452,0.003174223,0.004197611,0.00084924407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002152922,0.000006407018,0.00006437707,0.000013344513,0.0000022886031,0.00005014805,0.00017235232,0.00072928605,0.00018873553,0.9935607,0.0008983316,0.0042925254],"study_design_scores_gemma":[0.000005787937,0.0000068518134,0.000044888624,0.000007182556,0.0000013949353,0.00006049954,0.00013076777,0.0020790256,0.00019871023,0.99377644,0.003682352,0.0000060340076],"about_ca_topic_score_codex":0.0006692714,"about_ca_topic_score_gemma":0.00044151547,"teacher_disagreement_score":0.011933353,"about_ca_system_score_codex":0.0010826875,"about_ca_system_score_gemma":0.00042687837,"threshold_uncertainty_score":0.039921045},"labels":[],"label_agreement":null},{"id":"W2018014435","doi":"10.1137/110855934","title":"An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multigrid method; Mathematics; Rank (graph theory); Tensor (intrinsic definition); Algebraic number; Relaxation (psychology); Multiplicative function; Algorithm; Applied mathematics; Mathematical analysis; Pure mathematics; Partial differential equation; Combinatorics","score_opus":0.04218870997084388,"score_gpt":0.3564629447187452,"score_spread":0.3142742347479013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018014435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017879107,0.000056118257,0.9968183,0.000052472846,0.00003455908,0.00002501052,0.000029952665,0.00037632312,0.0008193388],"genre_scores_gemma":[0.04521232,0.00011056235,0.9518937,0.000044622095,0.000036492293,0.00012917756,0.00019279162,0.0002563146,0.0021239778],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995895,0.00009207418,0.00002031521,0.000060338134,0.00020542109,0.000032369662],"domain_scores_gemma":[0.999445,0.00014975226,0.00004519602,0.00013169303,0.00018161978,0.000046760822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005875469,0.00062621984,0.00068926066,0.00072928646,0.00053576677,0.0007577513,0.0012574639,0.0007168162,0.0035763208],"category_scores_gemma":[0.0016384021,0.00029575627,0.0007608526,0.0007770664,0.0006250008,0.00092059467,0.0016219422,0.0016276924,0.0014851643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110931134,0.000109997134,0.0009778418,0.000230158,0.000085957116,0.00016692518,0.0002103664,0.38834274,0.02981473,0.14572446,0.010754489,0.42347142],"study_design_scores_gemma":[0.000010759473,0.000023200002,0.000092309245,0.000006284857,0.000006374692,0.000042655833,0.000010599625,0.98068917,0.0023690131,0.010911836,0.005827332,0.0000104444725],"about_ca_topic_score_codex":0.0027374432,"about_ca_topic_score_gemma":0.0038654287,"teacher_disagreement_score":0.0035763208,"about_ca_system_score_codex":0.0005275689,"about_ca_system_score_gemma":0.001007213,"threshold_uncertainty_score":0.0119639635},"labels":[],"label_agreement":null},{"id":"W2030434042","doi":"10.1016/j.cam.2012.09.017","title":"Maximum likelihood estimation for the tensor normal distribution: Algorithm, minimum sample size, and empirical bias and dispersion","year":2012,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Covariance matrix; Estimator; Covariance; Statistics; Kronecker product; Sample size determination; Univariate; Multivariate normal distribution; Rate of convergence; Dimension (graph theory); Estimation of covariance matrices; Matrix (chemical analysis); Applied mathematics; Multivariate statistics; Kronecker delta; Combinatorics","score_opus":0.048457596303383386,"score_gpt":0.32288168150934005,"score_spread":0.2744240852059567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030434042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002485569,0.00012513719,0.9968696,0.00015661436,0.000015191161,0.000032719538,0.000028760782,0.00012586884,0.0001605721],"genre_scores_gemma":[0.06734514,0.0003976505,0.9299981,0.00011170005,0.00012548729,0.00036912432,0.00030774972,0.00035014324,0.0009948612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98627484,0.009421983,0.0006349055,0.0017418165,0.0015899892,0.00033644712],"domain_scores_gemma":[0.8727348,0.10923048,0.0034669524,0.007619215,0.0060547534,0.0008938166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029068783,0.0016304333,0.0032750384,0.002482292,0.0015866893,0.0032178115,0.003924775,0.0032849854,0.00251325],"category_scores_gemma":[0.20522343,0.0017312873,0.0016911557,0.0027433152,0.0037118138,0.007491291,0.0045881914,0.005040249,0.0010533123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090704265,0.00023871107,0.006965151,0.0007607732,0.00037710136,0.00032713087,0.0007604236,0.3416884,0.004820645,0.3926958,0.0060897158,0.24436916],"study_design_scores_gemma":[0.00008465636,0.000055029872,0.00057679723,0.00007686014,0.0000355797,0.0001881554,0.00004315848,0.7921727,0.0012706638,0.20400408,0.001441483,0.000050921644],"about_ca_topic_score_codex":0.003245084,"about_ca_topic_score_gemma":0.0031555928,"teacher_disagreement_score":0.029068783,"about_ca_system_score_codex":0.00170149,"about_ca_system_score_gemma":0.004336389,"threshold_uncertainty_score":0.15373224},"labels":[],"label_agreement":null},{"id":"W2033342614","doi":"10.4153/cjm-2009-047-5","title":"Prolongations and Computational Algebra","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Cambridge; Canadian Mathematical Society","keywords":"Mathematics; Binary number; Algebra over a field; Pure mathematics; Applied mathematics; Arithmetic","score_opus":0.033859059778599834,"score_gpt":0.2914576829439053,"score_spread":0.25759862316530546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033342614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34223813,0.0024362686,0.47965112,0.0032395904,0.0007042064,0.00011832526,0.00041675963,0.00047039235,0.17072508],"genre_scores_gemma":[0.9566874,0.00075694086,0.029076843,0.00019284428,0.0003192904,0.000035466663,0.00016049725,0.000068930996,0.012701871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992409,0.00021941436,0.00006238256,0.00014595741,0.00022604193,0.00010529855],"domain_scores_gemma":[0.9983974,0.00054031087,0.00017979051,0.00030666403,0.00033989642,0.0002358524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001326441,0.00031822425,0.00036050394,0.00095603656,0.0010098212,0.0017805379,0.0004728229,0.00031882557,0.005805473],"category_scores_gemma":[0.003234484,0.00023085951,0.0007736178,0.00080640515,0.005483847,0.004854574,0.0027606755,0.0017254534,0.00064139254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051994984,0.000001790846,0.00014634829,0.0000100886555,0.0000017733104,0.000023580817,0.00017682543,0.000437484,0.00019469969,0.996166,0.00024461534,0.0025915683],"study_design_scores_gemma":[0.000004385209,0.0000125502975,0.00017672115,0.0000107765445,0.0000025511677,0.0000705764,0.00007574286,0.0025627206,0.0002623142,0.990288,0.0065276716,0.0000060774005],"about_ca_topic_score_codex":0.00084100594,"about_ca_topic_score_gemma":0.00061348156,"teacher_disagreement_score":0.005805473,"about_ca_system_score_codex":0.0011954574,"about_ca_system_score_gemma":0.0006617712,"threshold_uncertainty_score":0.01942122},"labels":[],"label_agreement":null},{"id":"W2033393326","doi":"10.1002/cem.1206","title":"Modeling multi‐way data with linearly dependent loadings","year":2009,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":134,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Generalization; Context (archaeology); Linear model; Mathematics; Computer science; Algorithm; Biological system; Statistics; Mathematical analysis","score_opus":0.1329767601637393,"score_gpt":0.3669497680814434,"score_spread":0.23397300791770412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033393326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033395533,0.00011938056,0.9649174,0.0001707779,0.000030085015,0.00007596536,0.0001908917,0.00050038745,0.0005995291],"genre_scores_gemma":[0.58149785,0.0003195884,0.41360164,0.00016459475,0.00008746915,0.000343021,0.00074771856,0.00021373763,0.003024387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974439,0.0011591738,0.000106024134,0.000571589,0.00049840304,0.0002207997],"domain_scores_gemma":[0.99508435,0.003455783,0.00043220012,0.00048531342,0.00044701196,0.000095371324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004021342,0.0012402968,0.0010283994,0.0011671076,0.00047891086,0.001534026,0.0011631049,0.0012713658,0.0023169806],"category_scores_gemma":[0.008790661,0.00064619374,0.0017624655,0.0014965929,0.0011520452,0.0014521497,0.0013938202,0.002413634,0.0006948664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001720269,0.00023800625,0.007420628,0.00020077717,0.00034759057,0.000248936,0.00043396317,0.83036435,0.009241204,0.017154345,0.0013615296,0.13281669],"study_design_scores_gemma":[0.0000041755,0.000022728567,0.00080053555,0.0000055928263,0.000007871062,0.000022188935,0.000024462102,0.99336064,0.0006005308,0.0046746265,0.00046170424,0.0000148771405],"about_ca_topic_score_codex":0.008844052,"about_ca_topic_score_gemma":0.008476739,"teacher_disagreement_score":0.008844052,"about_ca_system_score_codex":0.00075732433,"about_ca_system_score_gemma":0.0011828509,"threshold_uncertainty_score":0.021267176},"labels":[],"label_agreement":null},{"id":"W2034012206","doi":"10.1016/j.jalgebra.2007.01.045","title":"On the ideals of secant varieties to certain rational varieties","year":2007,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Variety (cybernetics); Embedding; Pure mathematics; Product (mathematics); Projective test; Projective variety; Algebra over a field; Geometry; Statistics","score_opus":0.03838698805067434,"score_gpt":0.3233152826859932,"score_spread":0.2849282946353189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034012206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7504956,0.0025071078,0.09206539,0.002915127,0.00085176236,0.00012475884,0.00025397036,0.00037063585,0.15041552],"genre_scores_gemma":[0.95861006,0.0016835436,0.014765196,0.0003308032,0.0010756844,0.00007488822,0.00029277705,0.00016223176,0.023004862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984276,0.00043518617,0.00008625141,0.00023169433,0.0003876958,0.00043152535],"domain_scores_gemma":[0.9962915,0.0010954936,0.00057035475,0.00025475252,0.0006905839,0.0010973162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031745154,0.0013801733,0.001614027,0.0046365154,0.0033986114,0.004473775,0.0012745805,0.0010605883,0.008198643],"category_scores_gemma":[0.004433938,0.001005997,0.0018118178,0.0024985133,0.007082764,0.007724189,0.0042410293,0.0044142287,0.00088220864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006714182,0.00003248321,0.0002394117,0.000024642824,0.000007772089,0.000078776844,0.0005165782,0.00032650348,0.00050410395,0.99630773,0.0004076995,0.0014872494],"study_design_scores_gemma":[0.000033400353,0.00006690326,0.0007243428,0.00003101881,0.000023265762,0.0001816508,0.00040556595,0.0031673198,0.00072084763,0.99154913,0.0030770672,0.000019423169],"about_ca_topic_score_codex":0.001578576,"about_ca_topic_score_gemma":0.0015296603,"teacher_disagreement_score":0.008198643,"about_ca_system_score_codex":0.002722259,"about_ca_system_score_gemma":0.00097644434,"threshold_uncertainty_score":0.027427197},"labels":[],"label_agreement":null},{"id":"W2037844371","doi":"10.1016/s0024-3795(03)00455-5","title":"Erratum to: “Ranks of tensors, secant varieties of Segre varieties and fat points” [Linear Algebra Appl. 355 (2002) 263–285]","year":2003,"lang":"en","type":"erratum","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.023371799167554937,"score_gpt":0.28481644787624183,"score_spread":0.2614446487086869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037844371","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006248762,0.0060273204,0.0018751606,0.08541021,0.87058204,0.00006223798,0.00221522,0.00062768033,0.032575324],"genre_scores_gemma":[0.014837218,0.022835659,0.0069099106,0.10484681,0.1776891,0.0002549488,0.0074306605,0.001977809,0.663218],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99733716,0.00040737804,0.00051948254,0.0003383043,0.001210678,0.00018697322],"domain_scores_gemma":[0.990368,0.0022472742,0.000558884,0.0006371602,0.005836,0.00035264663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022834647,0.0025653252,0.002458359,0.0048755584,0.004791239,0.0041721617,0.0033185713,0.004692984,0.065210685],"category_scores_gemma":[0.020139746,0.0011345731,0.0015329745,0.0049436116,0.0024681098,0.005089155,0.0017402504,0.006513443,0.04371631],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036246165,0.000007993297,0.00003399214,0.00008871545,0.000005036163,0.000084974476,0.00002637865,0.000036550973,0.00004442752,0.002196773,0.9935416,0.0038971773],"study_design_scores_gemma":[0.000039676743,0.000039512524,0.0008457961,0.00037316317,0.00003269131,0.00034278142,0.00017284403,0.00033566912,0.00045913554,0.0070066624,0.9902964,0.000055615943],"about_ca_topic_score_codex":0.01808601,"about_ca_topic_score_gemma":0.022008734,"teacher_disagreement_score":0.065210685,"about_ca_system_score_codex":0.0040590772,"about_ca_system_score_gemma":0.0037975623,"threshold_uncertainty_score":0.21815145},"labels":[],"label_agreement":null},{"id":"W2042663327","doi":"10.1002/cem.810","title":"Shifted factor analysis—Part III: <i>N</i>‐way generalization and application","year":2003,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Chemometrics; Generalization; Mode (computer interface); Factor analysis; Factor (programming language); Set (abstract data type); Mathematics; Data set; Algorithm; Statistics; Computer science; Applied mathematics; Machine learning; Mathematical analysis","score_opus":0.03673406376145951,"score_gpt":0.3140604343626678,"score_spread":0.2773263706012083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042663327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011639541,0.0004666703,0.9859387,0.00029330445,0.00007540876,0.00004412019,0.0000547834,0.00031492792,0.0011724954],"genre_scores_gemma":[0.20334958,0.00093690597,0.7908724,0.0001897801,0.00015169686,0.00016520963,0.00029826266,0.00029273413,0.0037433468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799854,0.0010268237,0.000092868286,0.00040095748,0.0003967831,0.00008402979],"domain_scores_gemma":[0.99562126,0.0015750558,0.0003028111,0.0015518831,0.000866755,0.00008221433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004694944,0.0012221716,0.0007749334,0.00074430835,0.00054460374,0.0011711618,0.0010721812,0.0007617093,0.005603725],"category_scores_gemma":[0.010473192,0.0004247769,0.0016843611,0.001516698,0.0015243471,0.0019577092,0.0016421276,0.0014226963,0.0018932095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023143241,0.0001080907,0.0023308948,0.00033645,0.00018768889,0.0002825393,0.00060914684,0.17191488,0.023924114,0.11851038,0.006316448,0.67524785],"study_design_scores_gemma":[0.000017667762,0.00012272038,0.0012378531,0.000057654463,0.00002614535,0.0002546514,0.00009668408,0.8770908,0.0067356736,0.104629666,0.009687731,0.000042713422],"about_ca_topic_score_codex":0.0030151054,"about_ca_topic_score_gemma":0.0018157226,"teacher_disagreement_score":0.005603725,"about_ca_system_score_codex":0.0006717158,"about_ca_system_score_gemma":0.0010443496,"threshold_uncertainty_score":0.024829507},"labels":[],"label_agreement":null},{"id":"W2043064432","doi":"10.1016/s0024-3795(03)00451-8","title":"Matrices with special reference to applications in psychometrics","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multidimensional scaling; Canonical correlation; Rank (graph theory); Set (abstract data type); Matrix (chemical analysis); Psychometrics; Scaling; Item response theory; Mathematics; Statistics; Regression analysis; Data set; Computer science; Algebra over a field; Econometrics; Pure mathematics; Combinatorics","score_opus":0.04279565869116034,"score_gpt":0.32617890670036187,"score_spread":0.28338324800920156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043064432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007899253,0.035817284,0.8410496,0.011491903,0.017802382,0.000058021753,0.00060767756,0.0012100807,0.084063694],"genre_scores_gemma":[0.27865222,0.054065067,0.47709918,0.0059141386,0.04729734,0.00047030183,0.0009038251,0.0019111548,0.13368669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978174,0.000929305,0.00023669189,0.0004053743,0.00047043484,0.00014076175],"domain_scores_gemma":[0.99095565,0.0046589947,0.000646031,0.0014063936,0.0018813785,0.0004515706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020307319,0.002030295,0.0017183217,0.0030737724,0.001714924,0.0041455785,0.0016427297,0.002185856,0.02216245],"category_scores_gemma":[0.012860969,0.00058954867,0.0013601402,0.0077571627,0.0037871394,0.0055741263,0.0025917052,0.0040129647,0.007180868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012909683,0.000029168848,0.00012788708,0.00024956925,0.000017569178,0.00013329273,0.0002697496,0.0013488081,0.0006779868,0.9144309,0.026840052,0.055862024],"study_design_scores_gemma":[0.0000034962222,0.00002010395,0.0001754258,0.000062117404,0.000012834957,0.000272942,0.00008114218,0.0046317447,0.00038292588,0.9273253,0.06700466,0.000027356626],"about_ca_topic_score_codex":0.0017118892,"about_ca_topic_score_gemma":0.001728588,"teacher_disagreement_score":0.02216245,"about_ca_system_score_codex":0.0007755839,"about_ca_system_score_gemma":0.0013330983,"threshold_uncertainty_score":0.07414073},"labels":[],"label_agreement":null},{"id":"W2047527848","doi":"10.1002/cem.926","title":"Mathematical improvements to maximum likelihood parallel factor analysis: theory and simulations","year":2005,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Algorithm; Computation; Representation (politics); Basis (linear algebra); Covariance; Heteroscedasticity; Function (biology); Computer science; Variety (cybernetics); Covariance matrix; Mathematics; Noise (video); Mathematical optimization; Applied mathematics; Statistics; Artificial intelligence","score_opus":0.03508056897040344,"score_gpt":0.34350867179711275,"score_spread":0.3084281028267093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047527848","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016913313,0.000102828264,0.99651575,0.00012293336,0.000017285543,0.000028443652,0.000023102066,0.00019608029,0.0013022794],"genre_scores_gemma":[0.09106396,0.00039850554,0.9052248,0.0001171432,0.00007919641,0.00051749364,0.0001369168,0.00018105813,0.002280848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982546,0.00090288295,0.00007989622,0.000146436,0.00054449716,0.00007167674],"domain_scores_gemma":[0.99241817,0.0053730737,0.00034761216,0.00078029244,0.00097472436,0.000106166626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043013827,0.00089883135,0.00083766325,0.0010256774,0.0006582142,0.0011175243,0.0018941938,0.0012470423,0.0062949765],"category_scores_gemma":[0.022537239,0.0007293507,0.00096827757,0.001478773,0.0015338201,0.0022153407,0.001900277,0.0017372221,0.0019642175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004186515,0.00003751884,0.00030278493,0.00011675448,0.000022948985,0.000071777744,0.00004831778,0.8699882,0.0006884292,0.082126215,0.0014398452,0.045115333],"study_design_scores_gemma":[0.000007649977,0.000005356127,0.00002501327,0.000005002215,0.0000012777423,0.000011702227,0.0000027469748,0.98438346,0.00016867855,0.014756727,0.0006284828,0.0000037530372],"about_ca_topic_score_codex":0.0044861096,"about_ca_topic_score_gemma":0.0042203967,"teacher_disagreement_score":0.0062949765,"about_ca_system_score_codex":0.0009951153,"about_ca_system_score_gemma":0.0012282213,"threshold_uncertainty_score":0.022748172},"labels":[],"label_agreement":null},{"id":"W2057387067","doi":"10.1007/s00180-008-0114-z","title":"One-mode three-way overlapping cluster analysis","year":2008,"lang":"en","type":"article","venue":"Computational Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Paul University","funders":"","keywords":"Cluster (spacecraft); Computer science; Mode (computer interface); Computational biology; Biology; Programming language; Operating system","score_opus":0.06935203769758191,"score_gpt":0.3454439474674511,"score_spread":0.2760919097698692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057387067","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032988217,0.00017713154,0.96241057,0.000112141795,0.0001318056,0.00018851348,0.0004838498,0.001396564,0.0021112992],"genre_scores_gemma":[0.34094247,0.00019641432,0.65097237,0.00009399369,0.00008126048,0.00062286423,0.0017215275,0.00084820844,0.00452094],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787354,0.00069889636,0.00013516365,0.0005313007,0.0005399795,0.00022121354],"domain_scores_gemma":[0.99356055,0.0016598352,0.0003417692,0.001798631,0.0022554295,0.00038370246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029793864,0.001483396,0.0018781321,0.0019329451,0.0021621017,0.0021985602,0.0029624682,0.0009188701,0.006720296],"category_scores_gemma":[0.012058714,0.00043082438,0.0019116637,0.002850842,0.0011875394,0.0021354477,0.0022211275,0.0013007858,0.001733641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029243894,0.00068114646,0.008283395,0.0014865642,0.0011194764,0.0006916677,0.0036676335,0.10494864,0.039422043,0.090822086,0.027935484,0.71801734],"study_design_scores_gemma":[0.00009068511,0.00018854512,0.0060748323,0.0000579555,0.00023475407,0.00032767854,0.00081496866,0.8962281,0.012072999,0.076409295,0.0072966493,0.00020360688],"about_ca_topic_score_codex":0.0026354163,"about_ca_topic_score_gemma":0.0036483884,"teacher_disagreement_score":0.006720296,"about_ca_system_score_codex":0.0004634517,"about_ca_system_score_gemma":0.0020863544,"threshold_uncertainty_score":0.02248168},"labels":[],"label_agreement":null},{"id":"W2064562747","doi":"10.1109/ssp.2012.6319687","title":"Reconstruction of seismic data via tensor completion","year":2012,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Singular value decomposition; Tensor (intrinsic definition); Algorithm; Noise (video); Computer science; Singular value; Rank (graph theory); Matrix decomposition; Domain (mathematical analysis); Tensor decomposition; Iterative method; Mathematics; Artificial intelligence; Mathematical analysis; Image (mathematics); Geometry; Physics","score_opus":0.14024637179663432,"score_gpt":0.35591034507197056,"score_spread":0.21566397327533623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064562747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003952474,0.00007974917,0.9950991,0.000071904666,0.000020327496,0.000014303967,0.00008810364,0.00024011487,0.00043393785],"genre_scores_gemma":[0.103704564,0.00062043377,0.8922705,0.000055451274,0.00006989345,0.000057591944,0.00070518255,0.00016977396,0.0023465825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926287,0.0001892782,0.000056267254,0.00012618475,0.00030171062,0.00006373897],"domain_scores_gemma":[0.9989215,0.00030986025,0.00014696374,0.0002883723,0.00027257742,0.000060740138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012050689,0.0011711887,0.0007995356,0.0013421457,0.00036494998,0.0014309714,0.00078164204,0.0008318436,0.0024211013],"category_scores_gemma":[0.0028180263,0.00051320775,0.0011300667,0.0014812802,0.0010780463,0.0017701944,0.0014447798,0.0015273526,0.0012012292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020639208,0.00010815472,0.001771886,0.00042238168,0.00014210163,0.00040663852,0.00036783406,0.4317849,0.080266416,0.13912648,0.004514495,0.34088233],"study_design_scores_gemma":[0.000010330712,0.00007838133,0.00043502162,0.000017851742,0.000015239493,0.0002013048,0.00004151985,0.93521124,0.016036307,0.04117347,0.006739777,0.00003951784],"about_ca_topic_score_codex":0.0023199066,"about_ca_topic_score_gemma":0.0023781497,"teacher_disagreement_score":0.0024211013,"about_ca_system_score_codex":0.00041750976,"about_ca_system_score_gemma":0.0012518371,"threshold_uncertainty_score":0.008099437},"labels":[],"label_agreement":null},{"id":"W2064591878","doi":"10.1016/j.jalgebra.2012.07.028","title":"The solution to the Waring problem for monomials and the sum of coprime monomials","year":2012,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":125,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Monomial; Mathematics; Coprime integers; Rank (graph theory); Pairwise comparison; Combinatorics; Monomial basis; Pure mathematics; Statistics","score_opus":0.04315358005490639,"score_gpt":0.31966075089649537,"score_spread":0.276507170841589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064591878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16296588,0.0018952802,0.7473563,0.0060773417,0.0016649265,0.000121279525,0.00039542228,0.00035216336,0.0791715],"genre_scores_gemma":[0.6223228,0.0024380921,0.27282745,0.00096547627,0.0019915681,0.0001423199,0.0008624252,0.0008844499,0.0975655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999318,0.00019221651,0.000034349057,0.00014630484,0.00016514333,0.0001440896],"domain_scores_gemma":[0.99880254,0.0005575502,0.00011431576,0.00017712529,0.00016237043,0.00018606879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001372708,0.0010481512,0.0013917634,0.0011734661,0.0016061263,0.0022790085,0.001878953,0.0020229889,0.013759838],"category_scores_gemma":[0.0062383763,0.00075406604,0.001302625,0.0011490608,0.0028819125,0.005339,0.00241859,0.0041580778,0.0017597325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008936281,0.000041503623,0.0001448033,0.00013259,0.00002095023,0.00012362836,0.00021566248,0.008985577,0.0013814962,0.9516543,0.00890728,0.028302802],"study_design_scores_gemma":[0.000014164719,0.00002015014,0.00007055663,0.000018363262,0.000008316373,0.00008697381,0.000112540554,0.03537436,0.0006407929,0.95775,0.0058854534,0.000018253542],"about_ca_topic_score_codex":0.00117943,"about_ca_topic_score_gemma":0.0011517336,"teacher_disagreement_score":0.013759838,"about_ca_system_score_codex":0.0005621615,"about_ca_system_score_gemma":0.00095195597,"threshold_uncertainty_score":0.046031296},"labels":[],"label_agreement":null},{"id":"W2075879908","doi":"10.1007/s00012-004-1864-2","title":"A characterization of k-normal varieties","year":2004,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Normalization (sociology); Mathematics; Valuation (finance); Variety (cybernetics); Combinatorics; Pure mathematics; Statistics","score_opus":0.01804818728520705,"score_gpt":0.2494112950908435,"score_spread":0.23136310780563646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075879908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6245653,0.0026917865,0.19388066,0.0036239738,0.00071827293,0.00008662451,0.000785485,0.0007301921,0.17291777],"genre_scores_gemma":[0.9680829,0.00081923156,0.012272962,0.00021401262,0.00053816364,0.000030364443,0.00033048738,0.00011905758,0.01759286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910516,0.00014594843,0.00005779575,0.000265242,0.00020840617,0.00021745799],"domain_scores_gemma":[0.998408,0.00034598308,0.0002357915,0.00014398381,0.00040495297,0.00046138355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011294101,0.00092245656,0.00087267265,0.004096603,0.0022490998,0.004460879,0.0010066418,0.00078134,0.0051834024],"category_scores_gemma":[0.0019328089,0.00048939715,0.00072145,0.0025675849,0.005838726,0.008291778,0.0031440014,0.0031256343,0.00077386445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029432405,0.000018387931,0.00036547187,0.000021550897,0.000004281032,0.0000528793,0.00035155166,0.00014095659,0.0008611591,0.9935922,0.0007750839,0.003787063],"study_design_scores_gemma":[0.00000839747,0.000023426403,0.00057520537,0.000020103376,0.000010927514,0.0002570193,0.00032040002,0.002018308,0.00097313424,0.98929846,0.006478483,0.000016154132],"about_ca_topic_score_codex":0.001073066,"about_ca_topic_score_gemma":0.0008104792,"teacher_disagreement_score":0.0051834024,"about_ca_system_score_codex":0.0019605295,"about_ca_system_score_gemma":0.0006319435,"threshold_uncertainty_score":0.017340183},"labels":[],"label_agreement":null},{"id":"W2081729430","doi":"10.1016/s0024-3795(02)00352-x","title":"Ranks of tensors, secant varieties of Segre varieties and fat points","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":127,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Pure mathematics; Projective variety; Variety (cybernetics); Product (mathematics); Algebraic variety; Algebraic geometry; Lemma (botany); Projective space; Projective test; Algebraic number; Algebra over a field; Mathematical analysis; Geometry","score_opus":0.03566932599326967,"score_gpt":0.27695858826405123,"score_spread":0.24128926227078157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081729430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577485,0.016203867,0.20512156,0.0063469117,0.0020312616,0.000097657445,0.00079511065,0.0008816252,0.19103706],"genre_scores_gemma":[0.9357245,0.0052392483,0.02401652,0.00042353568,0.0023031905,0.00007342224,0.0003540103,0.00019640436,0.03166905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886346,0.00032595076,0.0000882631,0.0002208625,0.00031153465,0.00019000522],"domain_scores_gemma":[0.9970433,0.0010144118,0.0006255301,0.00022159769,0.00044658344,0.00064863765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023392844,0.0018864718,0.0015327359,0.008175721,0.002776488,0.0063971677,0.0014039396,0.001352146,0.0079070255],"category_scores_gemma":[0.0045961253,0.0009783002,0.0009852856,0.004964136,0.0061601168,0.008908327,0.002946164,0.0036627704,0.001063013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027638176,0.000016271742,0.00020662673,0.00003199377,0.0000066388006,0.000033331362,0.00030849542,0.00047170097,0.0003439356,0.99367213,0.000743647,0.0041377083],"study_design_scores_gemma":[0.000006822409,0.000018450994,0.00031966387,0.000020089214,0.000012879517,0.00008878269,0.00017908344,0.002292583,0.00033239368,0.994121,0.002588195,0.000020000896],"about_ca_topic_score_codex":0.0014796124,"about_ca_topic_score_gemma":0.0018347026,"teacher_disagreement_score":0.008175721,"about_ca_system_score_codex":0.002043494,"about_ca_system_score_gemma":0.0008851468,"threshold_uncertainty_score":0.026451647},"labels":[],"label_agreement":null},{"id":"W2087434571","doi":"10.1007/s11856-006-0015-1","title":"On the positivity set of a linear recurrence sequence","year":2007,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sequence (biology); Set (abstract data type); Combinatorics; Constant (computer programming); Discrete mathematics; Pure mathematics","score_opus":0.12793373692651216,"score_gpt":0.39441474150445,"score_spread":0.26648100457793783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087434571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4877629,0.0017825813,0.3479689,0.004045586,0.00059408584,0.00010255885,0.0006098975,0.00042747858,0.1567059],"genre_scores_gemma":[0.9438545,0.001087665,0.025539761,0.00066362927,0.0006468652,0.0001980143,0.00044772404,0.0003140075,0.027247872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882835,0.00040186,0.00006734321,0.00022623257,0.00029286218,0.00018322706],"domain_scores_gemma":[0.9916598,0.0051381513,0.00083280285,0.00033713967,0.001114422,0.00091762125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022428029,0.0010290835,0.0012701675,0.002839133,0.0030738688,0.0036132482,0.001457948,0.0015875477,0.011543842],"category_scores_gemma":[0.009293807,0.0009274535,0.0012100724,0.0017450633,0.0044139926,0.0058633536,0.0027250464,0.0037868943,0.0012951615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004645379,0.00001809878,0.00014547032,0.00003067163,0.000007768171,0.00011292919,0.00019538336,0.0007882616,0.0012839705,0.99359894,0.00081832166,0.002953762],"study_design_scores_gemma":[0.000014534598,0.000020566305,0.00016765691,0.000018238781,0.000009154293,0.00012903819,0.000056543937,0.009245193,0.0004716129,0.9888327,0.0010168237,0.000017904375],"about_ca_topic_score_codex":0.0009698102,"about_ca_topic_score_gemma":0.0008550468,"teacher_disagreement_score":0.011543842,"about_ca_system_score_codex":0.0014555646,"about_ca_system_score_gemma":0.0010546197,"threshold_uncertainty_score":0.03861797},"labels":[],"label_agreement":null},{"id":"W2092684478","doi":"10.1080/03081087.2013.811583","title":"Canonical forms of 2 × 2 × 2 and 2 × 2 × 2 × 2 symmetric tensors over prime fields","year":2013,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"McMaster University; University of Saskatchewan","keywords":"Mathematics; Prime (order theory); Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.02464235126888602,"score_gpt":0.3120886650240618,"score_spread":0.28744631375517576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092684478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8540698,0.00037259483,0.10517895,0.000692872,0.00034396644,0.00010496543,0.0007108731,0.00044996117,0.03807602],"genre_scores_gemma":[0.9549649,0.00048122363,0.03227219,0.00013473263,0.00023616337,0.000062191604,0.00055354065,0.00028035467,0.011014625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991123,0.00013288826,0.000046647147,0.00013679524,0.00024191581,0.00032942364],"domain_scores_gemma":[0.9987136,0.0001646958,0.00024239834,0.00016959774,0.00039566122,0.00031404264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012406672,0.0008768841,0.00059679704,0.002261412,0.0012691433,0.0022844078,0.00066442677,0.00061887264,0.010066215],"category_scores_gemma":[0.002032295,0.0003687578,0.00083008496,0.0011312136,0.0022989386,0.003505087,0.0012061778,0.0008911578,0.0012299618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076001445,0.00007230052,0.0014959902,0.000047615355,0.000009689001,0.00024328653,0.0003905498,0.0102286935,0.0036345678,0.9692067,0.0031897046,0.011404801],"study_design_scores_gemma":[0.000025611722,0.00011823555,0.0012758868,0.000036219313,0.000015380265,0.00027492712,0.0005821082,0.054285146,0.0058981334,0.928642,0.008760938,0.00008551109],"about_ca_topic_score_codex":0.0016831863,"about_ca_topic_score_gemma":0.0017029113,"teacher_disagreement_score":0.010066215,"about_ca_system_score_codex":0.0009707281,"about_ca_system_score_gemma":0.0014659334,"threshold_uncertainty_score":0.033674836},"labels":[],"label_agreement":null},{"id":"W2093432797","doi":"10.1145/3130348.3130358","title":"Information Retrieval using a Singular Value Decomposition Model of Latent Semantic Structure","year":2017,"lang":"en","type":"article","venue":"ACM SIGIR Forum","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":387,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University; Bell (Canada)","funders":"","keywords":"Computer science; Singular value decomposition; Citation; Information retrieval; Value (mathematics); Latent semantic analysis; World Wide Web; Artificial intelligence","score_opus":0.04617564812377155,"score_gpt":0.3387440814574338,"score_spread":0.2925684333336622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093432797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025370855,0.0027656688,0.9592291,0.0032330551,0.00032461935,0.0002330123,0.0016714609,0.0015694968,0.005602795],"genre_scores_gemma":[0.49913177,0.0056369863,0.45453215,0.00086529943,0.0009137292,0.0006025367,0.008125214,0.00058638386,0.029606007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998151,0.00091207965,0.00012698265,0.000324043,0.00034437762,0.00014150343],"domain_scores_gemma":[0.99534273,0.003047795,0.00026479788,0.0006124252,0.0006099922,0.00012220968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003323216,0.00085515314,0.0011561167,0.0021636474,0.0006725675,0.0037097775,0.0010514726,0.0013565684,0.0082362145],"category_scores_gemma":[0.011759143,0.00061046955,0.0021688514,0.0033295013,0.00088603917,0.0050352816,0.0015154565,0.0023470526,0.005463595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000775556,0.00041903436,0.0040998417,0.00076709234,0.00048021864,0.00027970332,0.0010361226,0.12353828,0.009971047,0.11965447,0.08124871,0.65773],"study_design_scores_gemma":[0.000034437664,0.00012971551,0.0010778873,0.000088899586,0.0000808373,0.00011874656,0.00010362555,0.919009,0.0014669062,0.072726645,0.005111422,0.00005198717],"about_ca_topic_score_codex":0.0097273365,"about_ca_topic_score_gemma":0.010221643,"teacher_disagreement_score":0.0097273365,"about_ca_system_score_codex":0.0014793031,"about_ca_system_score_gemma":0.0015804967,"threshold_uncertainty_score":0.027552843},"labels":[],"label_agreement":null},{"id":"W2095112579","doi":"10.1007/s00180-010-0184-6","title":"An acceleration method for Ten Berge et al.’s algorithm for orthogonal INDSCAL","year":2010,"lang":"en","type":"article","venue":"Computational Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Université de Genève; McGill University","keywords":"Acceleration; Algorithm; Mathematics; Computer science; Applied mathematics; Physics; Classical mechanics","score_opus":0.053350659342087305,"score_gpt":0.4315087163112483,"score_spread":0.378158056969161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095112579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015729971,0.00015483082,0.9912273,0.00017291315,0.00031333973,0.000099828896,0.00013917487,0.0030640366,0.0032554956],"genre_scores_gemma":[0.019764842,0.00016820844,0.967534,0.00011564755,0.00016992007,0.00029147192,0.00046222727,0.0010645887,0.010429001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890184,0.00019395225,0.000069844726,0.0001281087,0.00058219954,0.00012403548],"domain_scores_gemma":[0.9986085,0.0003526324,0.00004637171,0.00032191662,0.0005686381,0.00010187645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012100177,0.0016684899,0.0009383069,0.0013365791,0.0009765807,0.0012684792,0.0018699121,0.0010704492,0.031634986],"category_scores_gemma":[0.005096164,0.0005219078,0.0010620878,0.0017074074,0.0006091064,0.0014936863,0.0026913597,0.002540891,0.01503777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002969947,0.00022678594,0.0006946354,0.00023682816,0.00011831549,0.00021102538,0.00027052377,0.027275022,0.012026595,0.09219675,0.05959565,0.8068509],"study_design_scores_gemma":[0.00024041074,0.00019040122,0.00082547264,0.00007548442,0.0000617566,0.00051510654,0.00013547423,0.76490855,0.015030588,0.07849982,0.13940626,0.000110688685],"about_ca_topic_score_codex":0.006287053,"about_ca_topic_score_gemma":0.012500226,"teacher_disagreement_score":0.031634986,"about_ca_system_score_codex":0.00054348493,"about_ca_system_score_gemma":0.002049373,"threshold_uncertainty_score":0.1058296},"labels":[],"label_agreement":null},{"id":"W2108840817","doi":"10.1162/neco_a_00256","title":"Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization","year":2011,"lang":"en","type":"article","venue":"Neural Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":204,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Non-negative matrix factorization; Multiplicative function; Image (mathematics); Convergence (economics); Matrix (chemical analysis); Simple (philosophy); Inverse; Factorization; Matrix decomposition","score_opus":0.17264928879827862,"score_gpt":0.39757292166750885,"score_spread":0.22492363286923023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108840817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037670243,0.00013930256,0.9944026,0.00014601706,0.00005791045,0.00003299443,0.000027170156,0.00021107665,0.001215965],"genre_scores_gemma":[0.09708841,0.00030601272,0.8967583,0.00019609912,0.0001630722,0.00024390995,0.00020539589,0.00015998996,0.004878923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880505,0.0005360489,0.000046440677,0.0001431852,0.00040324626,0.00006601105],"domain_scores_gemma":[0.9981584,0.00081222894,0.0001637247,0.00029799185,0.00049998926,0.000067627894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017744908,0.0011109922,0.0007329583,0.00068289164,0.0005904087,0.00085387565,0.001468661,0.0011107483,0.0030630585],"category_scores_gemma":[0.0075284103,0.0004371062,0.0007364882,0.00094358466,0.00095048,0.0017574832,0.0016931446,0.0016682206,0.0013081677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001620124,0.00011441756,0.0005390768,0.00018719267,0.00008090703,0.000098781136,0.00023762442,0.53683853,0.009131551,0.14175321,0.008022701,0.30283403],"study_design_scores_gemma":[0.000012352808,0.000021998254,0.00006038209,0.0000044093795,0.000003893264,0.000019190935,0.000008762803,0.97978896,0.0008766899,0.01761449,0.0015809378,0.000008014068],"about_ca_topic_score_codex":0.0028018553,"about_ca_topic_score_gemma":0.00520687,"teacher_disagreement_score":0.0030630585,"about_ca_system_score_codex":0.00058902043,"about_ca_system_score_gemma":0.001243294,"threshold_uncertainty_score":0.0102469325},"labels":[],"label_agreement":null},{"id":"W211616019","doi":"10.1007/978-3-319-18032-8_13","title":"Contextual Anomaly Detection Using Log-Linear Tensor Factorization","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Factorization; Tensor (intrinsic definition); Anomaly detection; Anomaly (physics); Computer science; Mathematics; Artificial intelligence; Algorithm; Pure mathematics; Physics; Quantum mechanics","score_opus":0.09141878481234107,"score_gpt":0.3309313722778271,"score_spread":0.23951258746548604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W211616019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063498123,0.00036868,0.9901224,0.00015515502,0.00011660372,0.000029859393,0.00017308777,0.0019661367,0.00071833323],"genre_scores_gemma":[0.2528743,0.0009385172,0.7376226,0.00020732677,0.00044464285,0.00011396608,0.0020599556,0.0006463777,0.005092302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830365,0.00025786183,0.00008633765,0.00050549814,0.00061514805,0.00023151163],"domain_scores_gemma":[0.99759644,0.0005693515,0.00028038005,0.00068723294,0.00072883425,0.00013768258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013068003,0.0019294912,0.0019306347,0.0021903838,0.00084177725,0.001616109,0.0021513104,0.0011981917,0.0024771271],"category_scores_gemma":[0.0051142243,0.00061065983,0.0014860046,0.0023708956,0.0010096226,0.0026273348,0.0024656057,0.002454737,0.0023452411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004260921,0.00024497212,0.0051347967,0.00027660673,0.00022057742,0.00038183812,0.00014721973,0.07424916,0.03917292,0.021374661,0.02284688,0.8355243],"study_design_scores_gemma":[0.000009207893,0.000051076597,0.000889439,0.000018486884,0.000040687653,0.00034689414,0.000045594355,0.9582346,0.007905061,0.028292933,0.0041375537,0.000028431987],"about_ca_topic_score_codex":0.004368529,"about_ca_topic_score_gemma":0.0063187554,"teacher_disagreement_score":0.004368529,"about_ca_system_score_codex":0.0005847814,"about_ca_system_score_gemma":0.0012623973,"threshold_uncertainty_score":0.0086862445},"labels":[],"label_agreement":null},{"id":"W2119680381","doi":"10.1139/cjc-2014-0590","title":"Two new methods for computing vibrational energy levels","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Basis (linear algebra); Chemistry; Basis function; Product (mathematics); Grid; Tensor product; Function (biology); Pure mathematics; Mathematical analysis; Mathematics; Geometry","score_opus":0.11830275040096618,"score_gpt":0.3943417218845081,"score_spread":0.27603897148354195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119680381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010832135,0.0030293202,0.98578876,0.00072440854,0.001111279,0.000047419693,0.00013736387,0.00036909775,0.007709061],"genre_scores_gemma":[0.024976766,0.0053683883,0.9462454,0.0007316163,0.0010482834,0.00032570623,0.00032956345,0.0008787948,0.020095417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989512,0.00020103455,0.00008099502,0.0001545371,0.00054226315,0.000069884554],"domain_scores_gemma":[0.99918336,0.0002686567,0.00006557954,0.00020998786,0.00019750593,0.00007482265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089711795,0.0010535206,0.0009549396,0.002035739,0.0009028225,0.0017471311,0.0023526642,0.001524758,0.00901935],"category_scores_gemma":[0.0031462633,0.0006450179,0.001720037,0.0015841284,0.0014175646,0.0032830704,0.0023381773,0.0032020235,0.0042980025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003843595,0.00004626182,0.00029452995,0.0005217983,0.000072436465,0.00008981483,0.00020528569,0.018123552,0.005708959,0.7699977,0.016058099,0.18884318],"study_design_scores_gemma":[0.0000705519,0.000082478015,0.00039292415,0.00020821049,0.000051752075,0.00047747613,0.00009022236,0.23170696,0.0063950093,0.5203273,0.24009125,0.00010580636],"about_ca_topic_score_codex":0.0015458938,"about_ca_topic_score_gemma":0.0019801445,"teacher_disagreement_score":0.00901935,"about_ca_system_score_codex":0.0006978788,"about_ca_system_score_gemma":0.0008479163,"threshold_uncertainty_score":0.030172706},"labels":[],"label_agreement":null},{"id":"W2122640592","doi":"10.1002/cem.1245","title":"An efficient algorithm for Parafac with uncorrelated mode‐A components applied to large <i>I</i> × <i>J</i> × <i>K</i> data sets with <i>I</i> &gt;&gt; <i>JK</i>","year":2009,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Algorithm; Uncorrelated; Mode (computer interface); Product (mathematics); Constraint (computer-aided design); Computer science; Mathematics; Statistics","score_opus":0.04417632818794799,"score_gpt":0.33191053844305907,"score_spread":0.2877342102551111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122640592","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013359385,0.000032779644,0.9973636,0.000049156195,0.000014904279,0.00005658621,0.000023104858,0.00090110983,0.00022290029],"genre_scores_gemma":[0.008366331,0.00003173919,0.9907803,0.000019728974,0.000011871681,0.00014898412,0.00007674343,0.00011673797,0.0004474793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987997,0.00031998177,0.00008788254,0.0002516966,0.0004543519,0.00008644046],"domain_scores_gemma":[0.99823713,0.0007953047,0.00013662406,0.00028307113,0.00048762895,0.000060228867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021264572,0.001551019,0.0011431817,0.001437867,0.0012224277,0.0010433502,0.0016442875,0.0011759688,0.006916148],"category_scores_gemma":[0.005835771,0.0007834433,0.0011649372,0.0019951882,0.0008089349,0.0013594001,0.002042204,0.002332497,0.005762828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017826789,0.00013006064,0.00047285616,0.0001763028,0.000114317,0.00013885782,0.00023529724,0.06392454,0.020479113,0.015904421,0.007040258,0.8912058],"study_design_scores_gemma":[0.00011947576,0.000111259404,0.00046531274,0.000014784717,0.000030009733,0.00022449974,0.00006463059,0.9597439,0.01438441,0.01590987,0.008874812,0.000057115598],"about_ca_topic_score_codex":0.006607063,"about_ca_topic_score_gemma":0.009315288,"teacher_disagreement_score":0.006916148,"about_ca_system_score_codex":0.0006770258,"about_ca_system_score_gemma":0.002325728,"threshold_uncertainty_score":0.023136795},"labels":[],"label_agreement":null},{"id":"W2122949291","doi":"10.1002/cem.789","title":"Maximum likelihood parallel factor analysis (MLPARAFAC)","year":2003,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Algorithm; Covariance; Noise (video); Covariance matrix; Variety (cybernetics); Computer science; Least-squares function approximation; Uncorrelated; Mathematics; Statistics; Artificial intelligence","score_opus":0.05454327994311516,"score_gpt":0.33079010294682387,"score_spread":0.27624682300370873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122949291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010831928,0.000105394836,0.9970356,0.000052109335,0.000018140816,0.00006222816,0.000086722794,0.0011139687,0.0004426131],"genre_scores_gemma":[0.016435446,0.00013320275,0.98178977,0.000032624186,0.000022067263,0.0002647916,0.00026128124,0.00017367031,0.0008872331],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962774,0.0014733258,0.00019518795,0.0006716664,0.0012188096,0.00016368288],"domain_scores_gemma":[0.9942076,0.002751995,0.00075424014,0.0008689086,0.0012774249,0.00013982703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004939185,0.003011586,0.0016758043,0.001998328,0.001027499,0.0020248129,0.002024733,0.0015315091,0.009969987],"category_scores_gemma":[0.016799117,0.001048214,0.0021704454,0.002439205,0.001197612,0.0026307215,0.0027122588,0.0024050532,0.0067253713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023528028,0.00014878562,0.0009536929,0.00064624037,0.00022743052,0.00018443898,0.00030515782,0.09561748,0.013875006,0.03024854,0.009640366,0.84791756],"study_design_scores_gemma":[0.00007419843,0.00015010351,0.0014581312,0.000078025594,0.00006228425,0.00041787975,0.00009040378,0.8958025,0.016439622,0.060754303,0.024524586,0.00014807968],"about_ca_topic_score_codex":0.00163416,"about_ca_topic_score_gemma":0.0021990184,"teacher_disagreement_score":0.009969987,"about_ca_system_score_codex":0.0005626394,"about_ca_system_score_gemma":0.0018068064,"threshold_uncertainty_score":0.03335291},"labels":[],"label_agreement":null},{"id":"W2129068307","doi":"10.48550/arxiv.1412.4864","title":"Learning with Pseudo-Ensembles","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":361,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Robustness (evolution); Artificial intelligence; Ensemble learning; Benchmark (surveying); Machine learning; Artificial neural network; Dropout (neural networks); Perturbation (astronomy); Pattern recognition (psychology); Algorithm","score_opus":0.06577836543410738,"score_gpt":0.2018170692429524,"score_spread":0.13603870380884503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129068307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031078339,0.0002058194,0.9655546,0.00027325263,0.00006888671,0.000045554356,0.00015587144,0.0013017971,0.0013159044],"genre_scores_gemma":[0.65075517,0.00025355438,0.34199077,0.0005703698,0.00022327261,0.00028633876,0.0014308018,0.00057498144,0.003914655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979438,0.00090246374,0.00010384278,0.0004684419,0.00040767327,0.00017374643],"domain_scores_gemma":[0.99507254,0.0016083457,0.00039701367,0.0017679051,0.0009063413,0.00024778632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029000759,0.0012984124,0.0011289201,0.0006126615,0.00070406706,0.0011887177,0.002373664,0.0017277572,0.0018863362],"category_scores_gemma":[0.011043679,0.00083469454,0.0010911396,0.0006281674,0.0015564865,0.004198943,0.0029161368,0.002388579,0.0009885324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024931645,0.00012517028,0.0035366106,0.000089106754,0.00016558096,0.0001628136,0.00020267098,0.8440339,0.005296802,0.04057922,0.005274846,0.10028398],"study_design_scores_gemma":[0.0000053492977,0.00002933437,0.00008382357,0.0000037460325,0.000005548614,0.000020658665,0.000005201253,0.98722935,0.00068280956,0.011440794,0.00048803532,0.0000053112535],"about_ca_topic_score_codex":0.0020853153,"about_ca_topic_score_gemma":0.0036474892,"teacher_disagreement_score":0.0029000759,"about_ca_system_score_codex":0.0007903403,"about_ca_system_score_gemma":0.0010111189,"threshold_uncertainty_score":0.015337288},"labels":[],"label_agreement":null},{"id":"W2142412563","doi":"10.1063/1.2949249","title":"A geometric description of tensor product decompositions in su(3)","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor product; Decomposition; Tensor (intrinsic definition); Tensor product of Hilbert spaces; Tensor contraction; Product (mathematics); Tensor decomposition; Mathematics; Algebra over a field; Symmetric tensor; Cartesian tensor; Tensor density; Pure mathematics; Theoretical physics; Tensor field; Physics; Exact solutions in general relativity; Mathematical analysis; Geometry","score_opus":0.09589504705267571,"score_gpt":0.32627667998491766,"score_spread":0.23038163293224195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142412563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11654403,0.004409295,0.66510534,0.0018269527,0.0010751507,0.00012331878,0.0006446885,0.0008620955,0.20940909],"genre_scores_gemma":[0.73744565,0.0028965073,0.21554749,0.00097427185,0.0012750766,0.00018740355,0.0007265704,0.0005344473,0.0404127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957794,0.0000871937,0.000026463347,0.00009680611,0.00013633295,0.000075278724],"domain_scores_gemma":[0.9996834,0.00004125361,0.00007062586,0.00006779209,0.00008397024,0.000052865817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006446587,0.0011160291,0.0005471399,0.0021942714,0.0012128316,0.0019215452,0.0010641726,0.0010022823,0.007875291],"category_scores_gemma":[0.00075854926,0.0003463056,0.000998176,0.0011539062,0.0022341541,0.002762887,0.0011313208,0.0019453363,0.0017221334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004442118,0.000004681795,0.000040051953,0.000015931733,0.0000018638618,0.00005300059,0.000069197435,0.00051776244,0.0010282588,0.9944079,0.0006394037,0.0032176175],"study_design_scores_gemma":[0.0000037121324,0.000027951268,0.00015898845,0.000017934317,0.000004315621,0.0003225615,0.000057091427,0.0049773096,0.0005301667,0.9845269,0.009357139,0.000015937121],"about_ca_topic_score_codex":0.0005100811,"about_ca_topic_score_gemma":0.000457139,"teacher_disagreement_score":0.007875291,"about_ca_system_score_codex":0.00062112784,"about_ca_system_score_gemma":0.00045715226,"threshold_uncertainty_score":0.026345491},"labels":[],"label_agreement":null},{"id":"W2143526866","doi":"10.1137/120896499","title":"Birkhoff--von Neumann Theorem for Multistochastic Tensors","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Extreme point; Permutation (music); Tensor (intrinsic definition); Class (philosophy); Permutation matrix; Von Neumann architecture; Set (abstract data type); Pure mathematics; Regular polygon; Combinatorics; Algebra over a field; Geometry","score_opus":0.021071244987455683,"score_gpt":0.33686466200191195,"score_spread":0.3157934170144563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143526866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20892167,0.0016853813,0.71234936,0.0023750535,0.00036940773,0.000084784326,0.00049301336,0.00024195366,0.073479414],"genre_scores_gemma":[0.9399772,0.0010990944,0.04575387,0.0004953121,0.00039000667,0.00018205967,0.0004614745,0.000114382055,0.011526598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998207,0.0003605915,0.00010539445,0.0003216025,0.0006853607,0.00031997403],"domain_scores_gemma":[0.99605644,0.0016384295,0.00041963818,0.0003841181,0.0009602756,0.00054118835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028835135,0.00076024886,0.00086194515,0.0021535996,0.0021989995,0.0019604287,0.00093220465,0.0011032835,0.0054657273],"category_scores_gemma":[0.0064224554,0.00037752418,0.001028569,0.00094640814,0.003923489,0.0059446804,0.002462213,0.002721925,0.0010050668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015120505,0.000008559624,0.00015972638,0.000023071036,0.0000055651494,0.00005886246,0.000057321904,0.0012754144,0.0008077874,0.9953483,0.00040380916,0.0018365388],"study_design_scores_gemma":[0.000005908837,0.000016955108,0.00018202487,0.000012487554,0.0000038318412,0.000094785144,0.000033198863,0.018343069,0.00066740415,0.9794741,0.0011529566,0.000013278537],"about_ca_topic_score_codex":0.0009802646,"about_ca_topic_score_gemma":0.0008495998,"teacher_disagreement_score":0.0054657273,"about_ca_system_score_codex":0.0013897854,"about_ca_system_score_gemma":0.0010723466,"threshold_uncertainty_score":0.018284619},"labels":[],"label_agreement":null},{"id":"W2159111908","doi":"10.2172/887253","title":"Temporal analysis of social networks using three-way DEDICOM.","year":2006,"lang":"en","type":"report","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Hospital","funders":"","keywords":"Computer science; Adjacency list; Adjacency matrix; Construct (python library); Uniqueness; Latent semantic analysis; Theoretical computer science; Graph; Representation (politics); Extension (predicate logic); Tensor (intrinsic definition); Data mining; Algorithm; Information retrieval; Mathematics","score_opus":0.12556821684714517,"score_gpt":0.39515762751562084,"score_spread":0.26958941066847564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159111908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056853052,0.00029071356,0.9386628,0.0002487295,0.000038861854,0.00009215226,0.0014310254,0.0007710647,0.001611552],"genre_scores_gemma":[0.56752557,0.00034492498,0.42579836,0.00009102191,0.000059104328,0.0002463822,0.0039057904,0.00016049652,0.0018682665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992023,0.0002880933,0.000063304404,0.00018836388,0.00017374504,0.000084248524],"domain_scores_gemma":[0.99599385,0.0014471135,0.00079485384,0.0008888597,0.0006217503,0.00025342117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013732767,0.0006395711,0.00058191246,0.0036962158,0.00086867856,0.0014486947,0.00086311676,0.0006086036,0.0017632657],"category_scores_gemma":[0.007744668,0.00035098896,0.0012173894,0.0030780113,0.0009528539,0.002357751,0.0015984875,0.0010369068,0.00045805852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006107522,0.00023610433,0.035421338,0.0006399862,0.00042161014,0.0009424631,0.002308021,0.31463525,0.018143157,0.32827288,0.011500315,0.28686818],"study_design_scores_gemma":[0.000009564661,0.000026713044,0.003868944,0.000017727849,0.000018856805,0.00015687346,0.000295374,0.901513,0.0023448647,0.087278314,0.0044428767,0.000026872944],"about_ca_topic_score_codex":0.0063043796,"about_ca_topic_score_gemma":0.00783447,"teacher_disagreement_score":0.0063043796,"about_ca_system_score_codex":0.0011211348,"about_ca_system_score_gemma":0.0007034309,"threshold_uncertainty_score":0.012535393},"labels":[],"label_agreement":null},{"id":"W2161137988","doi":"10.2172/900402","title":"Pattern analysis of directed graphs using DEDICOM: an application to Enron email.","year":2006,"lang":"en","type":"report","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Sandia National Laboratories; U.S. Department of Energy","keywords":"Interpretability; Uniqueness; Computer science; Adjacency list; Latent semantic analysis; Extension (predicate logic); Theoretical computer science; Strongly connected component; Graph; Order (exchange); Artificial intelligence; Mathematics; Algorithm","score_opus":0.0713641675276691,"score_gpt":0.38501682617087324,"score_spread":0.31365265864320413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161137988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048551228,0.00050508004,0.93922496,0.0007300846,0.000079173515,0.00022282911,0.004264815,0.0045129484,0.0019088691],"genre_scores_gemma":[0.17193294,0.00026844512,0.8183642,0.00014286548,0.000054944983,0.0003760757,0.0061591915,0.00026240599,0.0024388805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858356,0.0006640359,0.000109134555,0.00029471557,0.00027333552,0.0000752776],"domain_scores_gemma":[0.99412775,0.0033687882,0.0005580008,0.0010830326,0.0006722195,0.00019035721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002401924,0.0009328395,0.00075532246,0.004261469,0.0008793787,0.0010368421,0.0011289755,0.0010343101,0.0025408478],"category_scores_gemma":[0.012246084,0.00047766007,0.0010740586,0.004248634,0.0006728484,0.0016952553,0.0016611638,0.0013667536,0.0010533214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044966154,0.0005703052,0.02869014,0.0009083404,0.00036069038,0.0011587765,0.002309483,0.12721485,0.011066896,0.07772958,0.039500814,0.7100405],"study_design_scores_gemma":[0.000031341762,0.0000402437,0.004342591,0.00003116338,0.000026786589,0.00032586532,0.00031370847,0.9169078,0.003394256,0.060259268,0.0142954625,0.00003149484],"about_ca_topic_score_codex":0.007939272,"about_ca_topic_score_gemma":0.017524,"teacher_disagreement_score":0.007939272,"about_ca_system_score_codex":0.0010494266,"about_ca_system_score_gemma":0.0007296455,"threshold_uncertainty_score":0.015786111},"labels":[],"label_agreement":null},{"id":"W2212333471","doi":"10.3842/sigma.2016.117","title":"Orthogonal Separation of the Hamilton-Jacobi Equation on Spaces of Constant Curvature","year":2016,"lang":"en","type":"article","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constant curvature; Hamilton–Jacobi equation; Curvature; Pure mathematics; Separation of variables; Separable space; Tensor (intrinsic definition); Conformal map; Constant (computer programming); Mathematical analysis; Geometry; Partial differential equation; Computer science","score_opus":0.05400900123939454,"score_gpt":0.40321162788411335,"score_spread":0.3492026266447188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212333471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12774946,0.009520522,0.7522873,0.001992916,0.00060549955,0.00008687788,0.0002921497,0.00019446002,0.10727075],"genre_scores_gemma":[0.76883304,0.008151826,0.18531892,0.0003958607,0.0008380359,0.00013233397,0.00035434472,0.00015898366,0.035816643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996824,0.000092014714,0.000020037165,0.00005007369,0.00011474559,0.00004070232],"domain_scores_gemma":[0.9997609,0.00006031074,0.00004693168,0.000027018174,0.00007425716,0.0000304815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006361242,0.00056804396,0.00043734943,0.000937634,0.0006868456,0.0009909869,0.00060846785,0.00050653116,0.0023068849],"category_scores_gemma":[0.0008904533,0.00021296165,0.00066244137,0.00068818586,0.0016199928,0.0016909417,0.0010036,0.0011179476,0.00046061314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001841679,0.0000018068915,0.00004450145,0.000016549522,0.000002103759,0.000012991084,0.000039772134,0.0008440451,0.00029007188,0.9963192,0.00029322342,0.0021340058],"study_design_scores_gemma":[0.0000050683584,0.000021814198,0.00027532573,0.000021633852,0.000005040064,0.00011230374,0.0000597564,0.02441751,0.00056709297,0.96314615,0.011352477,0.00001587165],"about_ca_topic_score_codex":0.001793651,"about_ca_topic_score_gemma":0.0012522193,"teacher_disagreement_score":0.0023068849,"about_ca_system_score_codex":0.0011377047,"about_ca_system_score_gemma":0.00078344624,"threshold_uncertainty_score":0.008254647},"labels":[],"label_agreement":null},{"id":"W2268704426","doi":"10.1016/j.laa.2017.07.021","title":"Waring-like decompositions of polynomials, 1","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Knut och Alice Wallenbergs Stiftelse; Natural Sciences and Engineering Research Council of Canada; Queen's University; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Monomial; Homogeneous; Degree (music); Combinatorics; Sums of powers; Decomposition; Homogeneous polynomial; Discrete mathematics; Pure mathematics; Polynomial; Mathematical analysis; Matrix polynomial","score_opus":0.04549379085835899,"score_gpt":0.3435571623498662,"score_spread":0.29806337149150725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268704426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1264641,0.0035238613,0.74320304,0.0020094332,0.0023641733,0.00011822592,0.0010538034,0.00063996983,0.12062333],"genre_scores_gemma":[0.70789456,0.0035431113,0.19746506,0.00087471626,0.0020392104,0.00011207831,0.0010211155,0.00066966604,0.08638053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994856,0.00011378203,0.000021952306,0.00013353385,0.00014579267,0.00009929347],"domain_scores_gemma":[0.9992316,0.00013369432,0.00015583685,0.00013359619,0.00018428048,0.00016103961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007625409,0.0010986441,0.0005214961,0.0018576512,0.0011116676,0.0017606474,0.00078974967,0.00067472726,0.011601364],"category_scores_gemma":[0.0019746425,0.00040670604,0.000861705,0.0012993383,0.0020985554,0.0033737796,0.0015144539,0.0024467586,0.0018292267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022060889,0.000010605158,0.00007209809,0.00003672839,0.000005074885,0.00003475564,0.00016090873,0.00081924145,0.0016700927,0.98391205,0.002333471,0.010923043],"study_design_scores_gemma":[0.0000041639996,0.000026884303,0.00016817648,0.000014437968,0.0000054875654,0.0001386101,0.00007892112,0.0077718752,0.0008691401,0.97975326,0.011153356,0.000015744788],"about_ca_topic_score_codex":0.0007715005,"about_ca_topic_score_gemma":0.0009931439,"teacher_disagreement_score":0.011601364,"about_ca_system_score_codex":0.00068827445,"about_ca_system_score_gemma":0.00055096357,"threshold_uncertainty_score":0.038810432},"labels":[],"label_agreement":null},{"id":"W2283608423","doi":"10.1109/tsc.2015.2497705","title":"Deep Computation Model for Unsupervised Feature Learning on Big Data","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":151,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Deep learning; Artificial intelligence; Feature vector; Big data; Tensor (intrinsic definition); Data modeling; Feature (linguistics); Pattern recognition (psychology); Autoencoder; Computation; Feature learning; Machine learning; Data mining; Algorithm; Mathematics","score_opus":0.1697865211088342,"score_gpt":0.35584263707734565,"score_spread":0.18605611596851146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283608423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045887153,0.00011413689,0.99422956,0.00016656815,0.000024950376,0.000017886445,0.00007603359,0.00041729596,0.00036482222],"genre_scores_gemma":[0.50363755,0.00081992534,0.48899943,0.0002958461,0.000119404234,0.00035055118,0.0010172122,0.00023236712,0.004527721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993777,0.00013285564,0.000051893025,0.00016031717,0.00020180685,0.00007534092],"domain_scores_gemma":[0.99891293,0.00041290792,0.00010541338,0.00022508527,0.00029863947,0.000044992634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107954,0.0009362003,0.000888683,0.00066381623,0.0004136683,0.0010102976,0.0017050058,0.00070779445,0.0013489332],"category_scores_gemma":[0.003373283,0.00042363975,0.0009530054,0.0012864609,0.00090425333,0.0025543314,0.0012054616,0.0023256803,0.00054387905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108951506,0.00008647004,0.0013716425,0.00009772955,0.00007766642,0.000102615326,0.0000865944,0.79892075,0.0032892835,0.051286586,0.0041202814,0.14045134],"study_design_scores_gemma":[0.0000017144257,0.000007456045,0.000052108226,0.000001632136,0.0000025250008,0.0000060990474,0.00000200679,0.9911528,0.00036789844,0.008112413,0.00029099718,0.0000023760283],"about_ca_topic_score_codex":0.008193914,"about_ca_topic_score_gemma":0.010138548,"teacher_disagreement_score":0.008193914,"about_ca_system_score_codex":0.0013252534,"about_ca_system_score_gemma":0.0016650051,"threshold_uncertainty_score":0.016292453},"labels":[],"label_agreement":null},{"id":"W2294277889","doi":"","title":"Tensor Analyzers","year":2013,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multilinear map; Generalization; Tensor (intrinsic definition); Artificial intelligence; Computer science; Latent variable; Face (sociological concept); Factor (programming language); Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.0714223381075099,"score_gpt":0.36052847844171104,"score_spread":0.2891061403342011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294277889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038350462,0.00026502088,0.98934424,0.00022928689,0.00012135265,0.0000971891,0.0005873098,0.0017609982,0.0037595143],"genre_scores_gemma":[0.13788003,0.001161974,0.8414649,0.00047208444,0.00036354637,0.0003889439,0.0030963891,0.0017677702,0.013404456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602425,0.0010987746,0.00030748828,0.0011373798,0.0011157818,0.0003163324],"domain_scores_gemma":[0.9934028,0.0017818102,0.0008655803,0.001848133,0.0016075989,0.00049408816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00363253,0.0023201483,0.0012787106,0.0029592996,0.0012983796,0.0036980337,0.0020111524,0.0013998335,0.016962778],"category_scores_gemma":[0.01435908,0.0008971128,0.0023592352,0.0023766558,0.0028690733,0.005894019,0.0035575768,0.0028090444,0.0066169696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037845678,0.000108476335,0.0028783693,0.0003625083,0.00018396134,0.0003661621,0.000581015,0.040813807,0.013076427,0.6459462,0.0222396,0.27306506],"study_design_scores_gemma":[0.000035724584,0.0001225726,0.0012043085,0.00010715408,0.00006070747,0.00053611875,0.00018064446,0.4276956,0.007616605,0.51148134,0.05085783,0.00010135996],"about_ca_topic_score_codex":0.0027867362,"about_ca_topic_score_gemma":0.0027936087,"teacher_disagreement_score":0.016962778,"about_ca_system_score_codex":0.0011735333,"about_ca_system_score_gemma":0.0021406473,"threshold_uncertainty_score":0.056746125},"labels":[],"label_agreement":null},{"id":"W2295966731","doi":"10.1109/icip.2015.7351019","title":"Hierarchical tucker tensor regression: Application to brain imaging data analysis","year":2015,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Dimension (graph theory); Tensor (intrinsic definition); Rank (graph theory); Regression analysis; Regression; Linear regression; Mathematics; Covariate; Artificial intelligence; Contrast (vision); Tucker decomposition; Computer science; Statistics; Applied mathematics; Combinatorics; Pure mathematics; Tensor decomposition","score_opus":0.10434302120941685,"score_gpt":0.4066080538738986,"score_spread":0.30226503266448174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295966731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045465087,0.00019791159,0.9938676,0.00025436573,0.000025392159,0.0000226124,0.0001420343,0.0006523323,0.00029132154],"genre_scores_gemma":[0.13644426,0.00079291523,0.85791564,0.0002063358,0.00012996544,0.00018491024,0.00064922945,0.00048225155,0.0031945012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985366,0.00071138184,0.00007912312,0.00027507782,0.00027321035,0.00012457506],"domain_scores_gemma":[0.9967057,0.0016410243,0.0004727051,0.0004964373,0.00051683426,0.00016740042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003333344,0.0015327733,0.0012526237,0.0012047155,0.00066044054,0.0011173615,0.001999648,0.0014493723,0.0026795238],"category_scores_gemma":[0.010859947,0.00062215875,0.0016544508,0.0023116758,0.0011097668,0.0017144384,0.0015496166,0.0021628407,0.0013080792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012388741,0.000079795194,0.0020122495,0.00017014907,0.00012871665,0.00019757428,0.00014112702,0.80640465,0.0060360227,0.044714544,0.006406862,0.13358453],"study_design_scores_gemma":[0.0000032628611,0.000013935879,0.000110176035,0.0000043794976,0.0000066759885,0.000019792376,0.0000054226352,0.99092895,0.00054058904,0.0076466575,0.0007113564,0.000008751736],"about_ca_topic_score_codex":0.022422979,"about_ca_topic_score_gemma":0.02270357,"teacher_disagreement_score":0.022422979,"about_ca_system_score_codex":0.0014158869,"about_ca_system_score_gemma":0.0027236354,"threshold_uncertainty_score":0.04458493},"labels":[],"label_agreement":null},{"id":"W2312649792","doi":"10.1190/1.3627833","title":"A tensor higher‐order singular value decomposition (HOSVD) for pre‐stack simultaneous noise‐reduction and interpolation","year":2011,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Singular value decomposition; Tensor (intrinsic definition); Stack (abstract data type); Interpolation (computer graphics); Noise reduction; Reduction (mathematics); Mathematics; Noise (video); Decomposition; Order (exchange); Value (mathematics); Computer science; Algorithm; Pure mathematics; Statistics; Artificial intelligence; Geometry","score_opus":0.041172955298347,"score_gpt":0.3334472325961529,"score_spread":0.29227427729780586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312649792","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029747772,0.000044035605,0.9964547,0.000036408088,0.000021654949,0.000012380273,0.000028807297,0.00020836617,0.00021879445],"genre_scores_gemma":[0.029928945,0.00010792408,0.96872723,0.000019619454,0.00002257182,0.000035122597,0.00015518173,0.00008979139,0.00091365585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994153,0.00013253363,0.00003800014,0.00010034817,0.00026127067,0.000052612962],"domain_scores_gemma":[0.9993944,0.00013554558,0.000060537408,0.00013800914,0.00022695349,0.00004458924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010716767,0.0010167897,0.0006969825,0.0008717377,0.0004878162,0.0008852387,0.0008223374,0.0008240069,0.0017526712],"category_scores_gemma":[0.0016578593,0.00044240104,0.0011184403,0.0009962474,0.00068688986,0.0010576003,0.0010498931,0.0012245534,0.0009090045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028477912,0.00015109323,0.0016640091,0.00030540716,0.00016829986,0.0002447357,0.0003023077,0.22695902,0.21481639,0.047076315,0.0045781094,0.5034495],"study_design_scores_gemma":[0.000013935999,0.00010079966,0.00046956216,0.000015678039,0.000023185577,0.00017348073,0.000023077353,0.9468748,0.03901521,0.0064994013,0.00674178,0.00004907671],"about_ca_topic_score_codex":0.0021672589,"about_ca_topic_score_gemma":0.0026984978,"teacher_disagreement_score":0.0021672589,"about_ca_system_score_codex":0.00040831763,"about_ca_system_score_gemma":0.0013696183,"threshold_uncertainty_score":0.005863309},"labels":[],"label_agreement":null},{"id":"W2336634865","doi":"10.48550/arxiv.1112.0298","title":"Ranks of 0-1 arrays of size 2 x 2 x 2 and 2 x 2 x 2 x 2","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Product (mathematics); Mathematics; Field (mathematics); Combinatorics; Set (abstract data type); Boolean algebra; Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.12886575034395492,"score_gpt":0.22416434755537654,"score_spread":0.09529859721142162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336634865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90709347,0.00038968434,0.03824681,0.0005506269,0.00026607385,0.000056264293,0.00077971886,0.00048560128,0.0521317],"genre_scores_gemma":[0.97547114,0.00020442331,0.0112981275,0.00008493373,0.0001997633,0.000041026484,0.00042734412,0.00013795153,0.012135314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989384,0.00015880977,0.00006962861,0.00016077555,0.00032509785,0.00034725736],"domain_scores_gemma":[0.99752015,0.00077867956,0.00057150755,0.00022492369,0.0004443405,0.00046037973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077636616,0.00056013954,0.0004754034,0.0028895068,0.0010671004,0.0026340191,0.00046657582,0.00051509234,0.012710783],"category_scores_gemma":[0.0035614124,0.00026799514,0.00051459717,0.0011103912,0.0016585009,0.0028565885,0.0010581873,0.0008271919,0.0018567778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005522983,0.0001705192,0.0051331865,0.0001698272,0.000027599646,0.00045478684,0.0008851314,0.0066724494,0.02364205,0.9137183,0.0065655834,0.042008325],"study_design_scores_gemma":[0.00006738394,0.00032332816,0.005703504,0.00005159745,0.000033000233,0.0006517784,0.00077795674,0.021014633,0.029413017,0.92436796,0.017435245,0.00016060905],"about_ca_topic_score_codex":0.00038690714,"about_ca_topic_score_gemma":0.00064673903,"teacher_disagreement_score":0.012710783,"about_ca_system_score_codex":0.0006485905,"about_ca_system_score_gemma":0.00050066144,"threshold_uncertainty_score":0.042521775},"labels":[],"label_agreement":null},{"id":"W2400648685","doi":"10.1109/icassp.2016.7472870","title":"Online incremental higher-order partial least squares regression for fast reconstruction of motion trajectories from tensor streams","year":2016,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Tensor (intrinsic definition); Computer science; Projection (relational algebra); Scalability; Partial least squares regression; Artificial intelligence; Algorithm; Cluster analysis; Regression; Latent variable; Theoretical computer science; Machine learning; Mathematics; Statistics","score_opus":0.04801838149161407,"score_gpt":0.3200513751964805,"score_spread":0.27203299370486644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400648685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076844413,0.00012554128,0.99067384,0.00007815796,0.000022603755,0.00002067262,0.00007989277,0.001088733,0.00022616918],"genre_scores_gemma":[0.20900254,0.0003691096,0.78638965,0.00008803114,0.00007548669,0.0001229621,0.0011134936,0.0004324602,0.0024062141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994918,0.00015701927,0.000030278914,0.00012513345,0.00014310463,0.00005263837],"domain_scores_gemma":[0.9987447,0.00062714424,0.00012974149,0.00019980558,0.00023406044,0.00006441385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009855912,0.0015309745,0.0010853048,0.0006755305,0.00040632184,0.0007340463,0.001235506,0.000822212,0.0018671144],"category_scores_gemma":[0.004733322,0.0006448022,0.0010295856,0.0011152979,0.0005990315,0.0015279439,0.0010257859,0.0019246836,0.00118628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002530147,0.00011239662,0.001943341,0.00019689852,0.000118218515,0.00021147993,0.00019129632,0.65011114,0.018007923,0.009852836,0.005400319,0.31360105],"study_design_scores_gemma":[0.0000030019116,0.00000928133,0.00008838297,0.0000018106407,0.0000027881454,0.000014761222,0.0000062047548,0.99693453,0.0011940006,0.0014018014,0.00033915363,0.0000042550814],"about_ca_topic_score_codex":0.008232608,"about_ca_topic_score_gemma":0.012094043,"teacher_disagreement_score":0.008232608,"about_ca_system_score_codex":0.00048027615,"about_ca_system_score_gemma":0.0014216128,"threshold_uncertainty_score":0.016369343},"labels":[],"label_agreement":null},{"id":"W2411304668","doi":"","title":"Scalable and Sound Low-Rank Tensor Learning","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scalability; Computer science; Tensor (intrinsic definition); Rank (graph theory); Sound (geography); Mathematics; Acoustics; Physics","score_opus":0.14412932921451255,"score_gpt":0.3819043419830679,"score_spread":0.23777501276855534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411304668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050272294,0.0005057336,0.98614746,0.00079360045,0.00034080746,0.00008968164,0.0005028035,0.0038515907,0.0027410686],"genre_scores_gemma":[0.10133288,0.0005985901,0.8839797,0.00043861291,0.00046836754,0.00019028352,0.0021068123,0.0009841709,0.009900625],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996298,0.0009296437,0.00026223453,0.00062607875,0.0015680013,0.00031602668],"domain_scores_gemma":[0.99099344,0.0024185374,0.00037384234,0.003573787,0.0021948018,0.00044553104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027082711,0.0024851179,0.0020929617,0.0012265508,0.0012350596,0.0032270995,0.0032796334,0.0021769365,0.011850775],"category_scores_gemma":[0.018617898,0.0010902757,0.0012938943,0.0016559559,0.0019086655,0.0065661618,0.0050349594,0.0045297625,0.008419193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079050445,0.00034758437,0.0011982041,0.0005573572,0.00019908705,0.00025155323,0.00020842228,0.086754836,0.026821261,0.097785264,0.065377206,0.71970874],"study_design_scores_gemma":[0.00009012584,0.00010300098,0.00024123641,0.00003785178,0.000037054582,0.00015867103,0.000069131806,0.86268127,0.008512012,0.11777917,0.010246522,0.000043987544],"about_ca_topic_score_codex":0.005034133,"about_ca_topic_score_gemma":0.012737324,"teacher_disagreement_score":0.011850775,"about_ca_system_score_codex":0.0009312273,"about_ca_system_score_gemma":0.004289699,"threshold_uncertainty_score":0.039644778},"labels":[],"label_agreement":null},{"id":"W2416570751","doi":"10.1021/acs.jpca.5b10015","title":"Using Nested Contractions and a Hierarchical Tensor Format To Compute Vibrational Spectra of Molecules with Seven Atoms","year":2015,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry A","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenfunction; Hamiltonian (control theory); Quartic function; Wave function; Computational chemistry; Computer science; Eigenvalues and eigenvectors; Mathematics; Chemistry; Physics; Quantum mechanics; Pure mathematics; Mathematical optimization","score_opus":0.047710756258663264,"score_gpt":0.32364916206159133,"score_spread":0.27593840580292806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416570751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062566385,0.000090024296,0.928765,0.00020991247,0.00007356262,0.00008407407,0.00023685808,0.0016010952,0.00637321],"genre_scores_gemma":[0.2154869,0.00015047118,0.7795482,0.00009815862,0.000035541336,0.00021409694,0.0006483203,0.00044168826,0.0033765978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975353,0.00006001115,0.000016189735,0.000028019515,0.00010616247,0.000035991256],"domain_scores_gemma":[0.9994991,0.00014776173,0.000047270605,0.00013644656,0.00012557453,0.000043859312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005002908,0.0006411206,0.00046269354,0.00048054682,0.00044154495,0.0005798344,0.0014791483,0.00045188062,0.004413806],"category_scores_gemma":[0.0014045287,0.0002943975,0.0006574352,0.0006207408,0.00064484554,0.0016634563,0.00097311806,0.0008941282,0.0013011843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023430682,0.0002484278,0.0016111245,0.00033975212,0.0000694976,0.00041913177,0.00044263733,0.5475643,0.055142533,0.20244236,0.0063209985,0.18516494],"study_design_scores_gemma":[0.00003233009,0.00006140505,0.000090569134,0.000007838788,0.000005851049,0.000027819744,0.0000341975,0.95668846,0.00722856,0.033095725,0.0027132032,0.000014069831],"about_ca_topic_score_codex":0.002762656,"about_ca_topic_score_gemma":0.003663926,"teacher_disagreement_score":0.004413806,"about_ca_system_score_codex":0.0003666572,"about_ca_system_score_gemma":0.0011253378,"threshold_uncertainty_score":0.01476568},"labels":[],"label_agreement":null},{"id":"W2541077386","doi":"10.1142/s0219498820501212","title":"Fano schemes for generic sums of products of linear forms","year":2019,"lang":"en","type":"preprint","venue":"Journal of Algebra and Its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperplane; Pfaffian; Linear subspace; Fano plane; Mathematics; Dimension (graph theory); Hypersurface; Product (mathematics); Upper and lower bounds; Tensor product; Rank (graph theory); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.05930994424995299,"score_gpt":0.3392514718352186,"score_spread":0.2799415275852656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541077386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8444991,0.0006009814,0.08630681,0.0005300831,0.0001181582,0.000050077866,0.00023446807,0.00017140526,0.06748893],"genre_scores_gemma":[0.97495097,0.00024784214,0.012794244,0.000053926018,0.000077659235,0.000030295281,0.00019342448,0.00005872177,0.01159292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994134,0.00009874739,0.000029290617,0.00010643346,0.00017581746,0.0001763355],"domain_scores_gemma":[0.99934644,0.00014891535,0.00017213718,0.00007863312,0.00007370544,0.00018010446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008045323,0.00070670125,0.0005084438,0.0025377704,0.001554393,0.0023606834,0.00057145563,0.0005125409,0.007522134],"category_scores_gemma":[0.0017324572,0.0003050184,0.0005319359,0.00082351564,0.002359305,0.0039755143,0.0019731638,0.0010900955,0.0006475056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028876804,0.0000092335695,0.0005177709,0.000020095493,0.0000044782055,0.00006836036,0.00015939662,0.0011988285,0.0013007184,0.992622,0.00033645067,0.0037338089],"study_design_scores_gemma":[0.000017016826,0.00004683009,0.0012812626,0.00004246466,0.000014243754,0.00038218783,0.0002687904,0.019209182,0.0033393211,0.9675239,0.007838182,0.00003663868],"about_ca_topic_score_codex":0.0006925077,"about_ca_topic_score_gemma":0.0007088981,"teacher_disagreement_score":0.007522134,"about_ca_system_score_codex":0.001127261,"about_ca_system_score_gemma":0.00025293732,"threshold_uncertainty_score":0.025164068},"labels":[],"label_agreement":null},{"id":"W2546825596","doi":"10.1109/mwc.2016.7721746","title":"Tensor-based software-defined internet of things","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Tensor (intrinsic definition); Distributed computing; Key (lock); Computer network; Wireless; Software; Telecommunications; Computer security","score_opus":0.06551914334016713,"score_gpt":0.32269860487666224,"score_spread":0.2571794615364951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546825596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011899807,0.00029854177,0.9838154,0.00032296783,0.00011181914,0.000033505203,0.00015532962,0.00024122203,0.003121495],"genre_scores_gemma":[0.64131796,0.0018190861,0.34853366,0.00020669441,0.00018625088,0.00017948404,0.0009872832,0.00014011998,0.0066295513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943715,0.00017648726,0.000044146185,0.000093869785,0.00018848685,0.000059767273],"domain_scores_gemma":[0.99935883,0.00015597447,0.00010815706,0.00012550603,0.00019571156,0.000055820954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398197,0.00072784885,0.00047599402,0.00069772947,0.0004114292,0.0012699328,0.0007591119,0.00044211734,0.0011868938],"category_scores_gemma":[0.0015244641,0.00022704856,0.0008781361,0.00084721006,0.0008946433,0.0016253871,0.0008819208,0.0008741228,0.00026424616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008832466,0.0000676589,0.0024078854,0.00016443676,0.00008981213,0.00024027571,0.00021880232,0.56085217,0.0085060615,0.35966596,0.0031297973,0.06456883],"study_design_scores_gemma":[0.0000031291631,0.00002400857,0.0002413512,0.000008031594,0.0000078812145,0.000042471005,0.00002580612,0.9545431,0.000663032,0.04134229,0.0030880831,0.000010775519],"about_ca_topic_score_codex":0.0050147744,"about_ca_topic_score_gemma":0.0042864657,"teacher_disagreement_score":0.0050147744,"about_ca_system_score_codex":0.0007882002,"about_ca_system_score_gemma":0.0009943305,"threshold_uncertainty_score":0.009971201},"labels":[],"label_agreement":null},{"id":"W2550773760","doi":"10.1016/j.jmp.2016.10.006","title":"The memory tesseract: Mathematical equivalence between composite and separate storage memory models","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Psychology","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unification; Computer science; Memory model; Equivalence (formal languages); Storage model; Auxiliary memory; Tensor (intrinsic definition); Computer data storage; Theoretical computer science; Computational model; Artificial intelligence; Mathematics; Parallel computing; Shared memory; Pure mathematics; Programming language","score_opus":0.09840809197825819,"score_gpt":0.40343103365132565,"score_spread":0.3050229416730675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550773760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08156061,0.000950698,0.88376945,0.0018899804,0.00033238853,0.000052824893,0.00026642412,0.0003126068,0.030864973],"genre_scores_gemma":[0.82029843,0.0010554582,0.16460027,0.0008065839,0.00060051086,0.00020008336,0.0003080672,0.00028148424,0.011849201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991013,0.00034063432,0.00007291839,0.00020415471,0.0001819343,0.000099028846],"domain_scores_gemma":[0.9961133,0.001691399,0.00035447883,0.0010959214,0.0005166656,0.00022819224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027060928,0.0008492647,0.0010853735,0.0010220902,0.0010179756,0.0033220695,0.0020978893,0.0019661635,0.0073117395],"category_scores_gemma":[0.008887318,0.00058185344,0.0017068832,0.00085751084,0.003977114,0.012616957,0.0026538873,0.0037019555,0.00088166917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018906025,0.000009389781,0.00006217893,0.000016431759,0.0000062015215,0.000014814481,0.00008618294,0.0011203368,0.0002028689,0.9953864,0.00045668666,0.002619615],"study_design_scores_gemma":[0.000005496765,0.0000118094,0.000054591274,0.000005367917,0.0000061461938,0.000040741284,0.00001952394,0.01949099,0.00015008356,0.9795574,0.0006508617,0.000007015453],"about_ca_topic_score_codex":0.0010909812,"about_ca_topic_score_gemma":0.00071739603,"teacher_disagreement_score":0.0073117395,"about_ca_system_score_codex":0.000755591,"about_ca_system_score_gemma":0.000969939,"threshold_uncertainty_score":0.024460196},"labels":[],"label_agreement":null},{"id":"W2551156993","doi":"","title":"Supervised Learning with Tensor Networks","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":214,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"MNIST database; Tensor (intrinsic definition); Artificial intelligence; Computer science; Machine learning; Tensor product; Set (abstract data type); Kernel (algebra); Moment tensor; Interpretation (philosophy); Matrix (chemical analysis); Supervised learning; Mathematics; Algorithm; Deep learning; Artificial neural network; Pure mathematics; Physics","score_opus":0.029951562186194405,"score_gpt":0.2749004509657065,"score_spread":0.24494888877951207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551156993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033705495,0.00036947863,0.9940601,0.00021989476,0.000044849225,0.000039754108,0.00014071654,0.0008932609,0.0008613774],"genre_scores_gemma":[0.20600925,0.0011859275,0.78674835,0.00024675482,0.00030330615,0.00034892967,0.0015751795,0.00048819944,0.0030941532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957176,0.0024098821,0.0002281697,0.00075095246,0.00075758965,0.00013594548],"domain_scores_gemma":[0.9914836,0.0041892985,0.00081768923,0.00214417,0.0011452604,0.00021993308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039814077,0.0014814482,0.0012982485,0.0018705167,0.00082389545,0.0025904952,0.0018029304,0.001337885,0.0026379267],"category_scores_gemma":[0.019001301,0.0009234506,0.0011968565,0.0020359706,0.0016952826,0.0036377439,0.0027547877,0.0028925778,0.00142186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017874553,0.00011761981,0.0017783104,0.00044643425,0.00028867729,0.000112979,0.00019617357,0.53058356,0.0042632343,0.11378281,0.012373285,0.33587816],"study_design_scores_gemma":[0.000009270379,0.000021551503,0.00013655827,0.00002078524,0.000009846007,0.000021378935,0.000011526329,0.9035607,0.0012020435,0.09271883,0.002277274,0.00001027578],"about_ca_topic_score_codex":0.002488069,"about_ca_topic_score_gemma":0.0031908778,"teacher_disagreement_score":0.0039814077,"about_ca_system_score_codex":0.0013720825,"about_ca_system_score_gemma":0.0017809481,"threshold_uncertainty_score":0.021055996},"labels":[],"label_agreement":null},{"id":"W2563669235","doi":"10.1016/j.nuclphysb.2017.01.015","title":"The complete 1/N expansion of a SYK–like tensor model","year":2017,"lang":"en","type":"article","venue":"Nuclear Physics B","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":162,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Tensor (intrinsic definition); Point (geometry); Order (exchange); Function (biology); Mathematics; Series (stratigraphy); Third order; Series expansion; Term (time); Pure mathematics; Mathematical analysis; Physics; Geometry; Quantum mechanics","score_opus":0.09733683784065719,"score_gpt":0.3323194751487582,"score_spread":0.234982637308101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563669235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4911608,0.002405445,0.26793027,0.003080331,0.0010988048,0.00014387115,0.000406759,0.0019639188,0.23180978],"genre_scores_gemma":[0.91083103,0.0014349811,0.043839186,0.00091540406,0.0008452279,0.00015512473,0.00036105193,0.0006068185,0.041011263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961203,0.00009801178,0.000013061507,0.000045520585,0.00015820388,0.0000730852],"domain_scores_gemma":[0.9995467,0.000070375456,0.000048363774,0.00008707448,0.00011974442,0.00012774156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007334233,0.0012388551,0.00135531,0.0015888202,0.0013000377,0.001589707,0.0015410923,0.0018800765,0.0050442703],"category_scores_gemma":[0.0013504506,0.0004379483,0.00097362953,0.0006754105,0.0029666696,0.002913746,0.0012058418,0.0019678178,0.0013222635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004363368,0.0000390364,0.00015237032,0.00008447308,0.00000774221,0.00023020795,0.00016740049,0.013115972,0.007958088,0.97315884,0.0018923373,0.003149907],"study_design_scores_gemma":[0.000019388972,0.000053992324,0.00059891003,0.000040447485,0.0000128944,0.00038372065,0.00006467387,0.24944097,0.0022978743,0.74377584,0.0032586532,0.00005259282],"about_ca_topic_score_codex":0.0014402384,"about_ca_topic_score_gemma":0.0015223112,"teacher_disagreement_score":0.0050442703,"about_ca_system_score_codex":0.0013532276,"about_ca_system_score_gemma":0.0010237991,"threshold_uncertainty_score":0.01687479},"labels":[],"label_agreement":null},{"id":"W2564479228","doi":"10.1145/2983640","title":"A Tensor-Based Framework for Software-Defined Cloud Data Center","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cloud computing; Computer science; Tensor (intrinsic definition); Big data; Data center; Software; Distributed computing; Data mining; Theoretical computer science; Computer network; Mathematics","score_opus":0.10639891469318016,"score_gpt":0.3729609067405157,"score_spread":0.26656199204733555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564479228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034316198,0.00015689082,0.9945844,0.00014784816,0.000043386233,0.000032919586,0.000065152446,0.00042211777,0.0011156452],"genre_scores_gemma":[0.3361344,0.00079602667,0.65843916,0.00012023753,0.00012938067,0.00022964034,0.0004942125,0.00018937785,0.0034675219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994286,0.0001680982,0.000042114338,0.000102114645,0.00018205534,0.000077127304],"domain_scores_gemma":[0.9995566,0.00007006595,0.000054673474,0.000082047765,0.00016229092,0.00007432947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078173477,0.0008424605,0.00060728966,0.0007573113,0.00071315485,0.0014007717,0.0015408832,0.00058879337,0.0017450368],"category_scores_gemma":[0.0012561369,0.0002709848,0.00079384027,0.0010643074,0.00079898984,0.0019332368,0.0013951814,0.0010593655,0.0005006844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012171674,0.000093458475,0.0017601844,0.00013843483,0.000060859387,0.0002854347,0.00026425096,0.619676,0.010916473,0.26616204,0.007520925,0.09300017],"study_design_scores_gemma":[0.0000034028237,0.000012708278,0.000055853743,0.0000032463997,0.000004206577,0.00001949622,0.000016694474,0.9873259,0.0004604956,0.010131319,0.001959477,0.000007274874],"about_ca_topic_score_codex":0.013713745,"about_ca_topic_score_gemma":0.010003369,"teacher_disagreement_score":0.013713745,"about_ca_system_score_codex":0.0014579,"about_ca_system_score_gemma":0.0020825227,"threshold_uncertainty_score":0.027267873},"labels":[],"label_agreement":null},{"id":"W2573911918","doi":"10.1098/rspa.2017.0480","title":"Quantum algorithm for multivariate polynomial interpolation","year":2018,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation of Sri Lanka; Canadian Institute for Advanced Research; U.S. Department of Defense","keywords":"Conjecture; Polynomial; Order (exchange); Mathematics; Field (mathematics); Univariate; Combinatorics; Discrete mathematics; Multivariate statistics; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.023206416601953748,"score_gpt":0.2882376747083941,"score_spread":0.26503125810644035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573911918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045763988,0.00056730886,0.9210929,0.0036273177,0.00020748042,0.00022908654,0.00076305616,0.0031422998,0.024606569],"genre_scores_gemma":[0.53240526,0.0005605094,0.4474532,0.0009311501,0.00031685052,0.00038590535,0.0014934478,0.00073331344,0.015720347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610883,0.0010406402,0.00021098844,0.0007172693,0.0011573222,0.0007649155],"domain_scores_gemma":[0.9938519,0.0031058993,0.00034219693,0.0017383448,0.000734825,0.00022695144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026148092,0.00065302814,0.0011707691,0.0011674989,0.0016658194,0.0030696047,0.0021045865,0.0016148061,0.014762941],"category_scores_gemma":[0.012362679,0.0004760276,0.0015823246,0.0022703381,0.0016383522,0.006506633,0.0045487904,0.0034753543,0.002818899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006505542,0.00022556665,0.0015439666,0.0002514977,0.00007758086,0.00013547047,0.00038889956,0.047014542,0.00635299,0.77056897,0.018700657,0.1540892],"study_design_scores_gemma":[0.00013749234,0.00006703443,0.00041323202,0.000035365418,0.00003135659,0.00011342692,0.00012938475,0.42558715,0.0048056734,0.55765,0.010980891,0.000048980386],"about_ca_topic_score_codex":0.0043585855,"about_ca_topic_score_gemma":0.0046033147,"teacher_disagreement_score":0.014762941,"about_ca_system_score_codex":0.003793394,"about_ca_system_score_gemma":0.0040468415,"threshold_uncertainty_score":0.04938692},"labels":[],"label_agreement":null},{"id":"W2577122409","doi":"10.1609/aaai.v30i1.10214","title":"Common and Discriminative Subspace Kernel-Based Multiblock Tensor Partial Least Squares Regression","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Discriminative model; Multilinear map; Tensor (intrinsic definition); Kernel (algebra); Pattern recognition (psychology); Artificial intelligence; Mathematics; Computer science; Linear subspace; Subspace topology; Discrete mathematics","score_opus":0.13102826435870088,"score_gpt":0.3652290948497541,"score_spread":0.2342008304910532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577122409","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037387146,0.000116071686,0.99549615,0.00004084837,0.00001751503,0.000011849681,0.000038987604,0.00033444923,0.00020538353],"genre_scores_gemma":[0.24782814,0.00058112823,0.74529064,0.000114662405,0.00011666129,0.00011096305,0.0010124106,0.00043081117,0.0045146854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886143,0.0003819555,0.000060555918,0.0003092512,0.00027678013,0.00011001146],"domain_scores_gemma":[0.9985031,0.00043750033,0.00020943125,0.00034667263,0.00041236097,0.00009110184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012818023,0.0016584505,0.0013711113,0.00094258407,0.00041487,0.00086780026,0.0016763126,0.00097017887,0.0017266201],"category_scores_gemma":[0.004195549,0.0006209746,0.0012359981,0.0013201445,0.0008775569,0.002185098,0.0012271601,0.001552124,0.0013427563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020234087,0.00013830357,0.0019314407,0.00023810258,0.00017931212,0.00014040465,0.0001364931,0.6104566,0.024730539,0.022848776,0.0038497446,0.33514792],"study_design_scores_gemma":[0.0000022734428,0.000014243073,0.000117670425,0.0000026546309,0.000006911549,0.00001873431,0.000005492566,0.9960348,0.0012835439,0.0019703533,0.0005354961,0.000007742],"about_ca_topic_score_codex":0.0050130757,"about_ca_topic_score_gemma":0.0069134724,"teacher_disagreement_score":0.0050130757,"about_ca_system_score_codex":0.0005419326,"about_ca_system_score_gemma":0.0013639806,"threshold_uncertainty_score":0.009967804},"labels":[],"label_agreement":null},{"id":"W2589197426","doi":"10.1007/s00211-017-0869-7","title":"Newton–Noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor","year":2017,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Tensor (intrinsic definition); Numerical analysis; Newton's method; Applied mathematics; Mathematical analysis; Pure mathematics; Nonlinear system","score_opus":0.13041365272414635,"score_gpt":0.3979500100665251,"score_spread":0.26753635734237874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589197426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030943774,0.00028060033,0.9622953,0.00040227422,0.00014621242,0.000055298442,0.00004959904,0.00020400406,0.005622994],"genre_scores_gemma":[0.29086852,0.00023483926,0.69250315,0.00020152323,0.00008244281,0.00019809812,0.0001456547,0.00031443447,0.0154514015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994955,0.00024980964,0.000019427092,0.00008115136,0.00009982417,0.000054192828],"domain_scores_gemma":[0.9988418,0.0006579771,0.000094753486,0.00008552366,0.00015364468,0.00016636132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018003355,0.0012145309,0.0015040904,0.0012977646,0.000777977,0.0013055215,0.0011967944,0.0016610728,0.0038010315],"category_scores_gemma":[0.0052737314,0.000672118,0.0008942092,0.000576111,0.0022148306,0.0019436438,0.0025633078,0.0023599032,0.0010161429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050665037,0.00016263599,0.001488583,0.00053534994,0.00014864955,0.00042722627,0.0005085315,0.2065315,0.008231744,0.6798292,0.006537827,0.095092095],"study_design_scores_gemma":[0.000031243027,0.000057703164,0.00015593428,0.00003943294,0.000017162105,0.000067145724,0.00006534143,0.85155106,0.0013545027,0.1443688,0.0022593052,0.000032466793],"about_ca_topic_score_codex":0.0025595655,"about_ca_topic_score_gemma":0.0043170545,"teacher_disagreement_score":0.0038010315,"about_ca_system_score_codex":0.0009420153,"about_ca_system_score_gemma":0.0014759585,"threshold_uncertainty_score":0.012715697},"labels":[],"label_agreement":null},{"id":"W2597184788","doi":"10.1080/03081087.2017.1301873","title":"Corrigendum to ‘Rank classification of tensors over ’","year":2017,"lang":"en","type":"erratum","venue":"Linear and Multilinear Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Rank (graph theory); Product (mathematics); Action (physics); Direct product; Pure mathematics; Group (periodic table); Group action; Combinatorics; Algebra over a field; Geometry; Physics; Quantum mechanics","score_opus":0.0800506802927653,"score_gpt":0.3639882757321359,"score_spread":0.2839375954393706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597184788","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006941042,0.0029996268,0.005070376,0.06067379,0.8964051,0.000039927585,0.0011608525,0.0008570707,0.032099213],"genre_scores_gemma":[0.03431173,0.0111096185,0.012356936,0.06421778,0.26164034,0.00018249395,0.0043065967,0.0031917396,0.6086827],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967098,0.0006089537,0.0003865011,0.0006934726,0.0013612238,0.00024000012],"domain_scores_gemma":[0.99326444,0.0015960986,0.00035838337,0.00094461883,0.003523991,0.00031241798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024505917,0.0012604232,0.001044001,0.0025454997,0.0022778192,0.0028524422,0.002343586,0.002490944,0.050069943],"category_scores_gemma":[0.019295473,0.00054311985,0.0010622891,0.0017133639,0.002640908,0.0030780022,0.0018063025,0.0050871274,0.03001949],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018900348,0.000008538469,0.00006523559,0.000080110396,0.0000072080175,0.000089596004,0.00004100635,0.00007636238,0.00010194647,0.0069399467,0.98542005,0.007151144],"study_design_scores_gemma":[0.000011291129,0.000022451452,0.0006223388,0.00014127076,0.000017469258,0.0002385485,0.000046834233,0.00038902982,0.0005508573,0.0071863052,0.99074554,0.000027944296],"about_ca_topic_score_codex":0.012905898,"about_ca_topic_score_gemma":0.014230584,"teacher_disagreement_score":0.050069943,"about_ca_system_score_codex":0.004114837,"about_ca_system_score_gemma":0.0023709903,"threshold_uncertainty_score":0.16750067},"labels":[],"label_agreement":null},{"id":"W2604930203","doi":"10.1016/j.inffus.2017.04.002","title":"High-order possibilistic c-means algorithms based on tensor decompositions for big data in IoT","year":2017,"lang":"en","type":"article","venue":"Information Fusion","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Big data; Computer science; Cluster analysis; Internet of Things; Tensor (intrinsic definition); Data mining; Algorithm; Artificial intelligence; Mathematics","score_opus":0.09565623818988435,"score_gpt":0.3603582001379818,"score_spread":0.2647019619480975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604930203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041629677,0.00033945555,0.99476033,0.00011914852,0.000030428759,0.000019458661,0.00004008583,0.00012039285,0.00040774292],"genre_scores_gemma":[0.28731546,0.0010150735,0.7094309,0.0001249467,0.00013776892,0.00016379824,0.00033688158,0.00013712153,0.0013381623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980483,0.00067047874,0.00019401491,0.00032415555,0.00062099047,0.00014203398],"domain_scores_gemma":[0.9956664,0.00220892,0.00037572288,0.0004718156,0.0010930422,0.00018407445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027575255,0.0012679694,0.0017509961,0.0019122354,0.0012457969,0.002586921,0.0019973551,0.0013718872,0.002010653],"category_scores_gemma":[0.0088799875,0.0007776416,0.002149342,0.00282102,0.0015232575,0.0040233186,0.002196813,0.0031437427,0.00046943699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034632278,0.00012282336,0.0011282633,0.0003744828,0.0002499048,0.000120796765,0.00029887308,0.662374,0.0053296657,0.12896426,0.00349068,0.1971999],"study_design_scores_gemma":[0.0000028070826,0.000012206548,0.000085198255,0.00000954657,0.000009925736,0.00001687528,0.000011095972,0.9722731,0.00043980236,0.026815567,0.000313563,0.000010317974],"about_ca_topic_score_codex":0.00793159,"about_ca_topic_score_gemma":0.006450776,"teacher_disagreement_score":0.00793159,"about_ca_system_score_codex":0.0016366926,"about_ca_system_score_gemma":0.0024470286,"threshold_uncertainty_score":0.015770853},"labels":[],"label_agreement":null},{"id":"W2608366086","doi":"10.1090/crmp/041/04","title":"Sparse tensor-product Fokker–Planck-based methods for nonlinear bead-spring chain models of dilute polymer solutions","year":2007,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Spring (device); Chain (unit); Fokker–Planck equation; Nonlinear system; Product (mathematics); Bead; Statistical physics; Polymer; Tensor (intrinsic definition); Physics; Materials science; Mathematics; Thermodynamics; Mathematical analysis; Geometry; Quantum mechanics; Composite material","score_opus":0.13490132966230475,"score_gpt":0.37034759681369606,"score_spread":0.2354462671513913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608366086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009724579,0.0007954587,0.98460764,0.00045929433,0.00012503068,0.00005471591,0.00012675847,0.00030345115,0.003803064],"genre_scores_gemma":[0.23488626,0.0020764251,0.734139,0.00041753668,0.00058808207,0.00061091455,0.00083239784,0.000994791,0.025454609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995963,0.00019232067,0.0000247075,0.000045054036,0.00010707933,0.0000345729],"domain_scores_gemma":[0.997823,0.0012902897,0.00014280045,0.00028207267,0.00029760832,0.000164236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013667027,0.0011418331,0.0017193182,0.00070190174,0.0008685742,0.0012469841,0.0038298373,0.0029013364,0.0039192964],"category_scores_gemma":[0.004162404,0.0010488409,0.0012945492,0.0011944108,0.0016060278,0.0025028274,0.0022894016,0.0029424042,0.0013269092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074729454,0.000106912565,0.00020393796,0.00024052645,0.00006813909,0.00004894735,0.00014896007,0.85781753,0.0025479097,0.100470565,0.0044882596,0.033783607],"study_design_scores_gemma":[0.0000033807735,0.0000020542286,0.000010604261,0.000002843852,0.0000013324621,0.0000026491898,0.0000029652547,0.9914825,0.00009907667,0.008119624,0.00026962388,0.0000033783983],"about_ca_topic_score_codex":0.00907269,"about_ca_topic_score_gemma":0.00789048,"teacher_disagreement_score":0.00907269,"about_ca_system_score_codex":0.0010701444,"about_ca_system_score_gemma":0.001432757,"threshold_uncertainty_score":0.018039763},"labels":[],"label_agreement":null},{"id":"W2619090350","doi":"10.1063/1.4983695","title":"An intertwined method for making low-rank, sum-of-product basis functions that makes it possible to compute vibrational spectra of molecules with more than 10 atoms","year":2017,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Institutes of Health; Natural Sciences and Engineering Research Council of Canada; Wellcome Trust; Wellcome","keywords":"Basis (linear algebra); Rank (graph theory); Matrix (chemical analysis); Basis function; Product (mathematics); Spectral line; Sequence (biology); Computational chemistry; Mathematics; Chemistry; Physics; Mathematical analysis; Combinatorics; Quantum mechanics; Geometry","score_opus":0.05775930115895453,"score_gpt":0.36558147467995694,"score_spread":0.3078221735210024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619090350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004346746,0.00004130438,0.99391854,0.00005749846,0.000034641023,0.000021391697,0.000031410313,0.00039328024,0.0011551469],"genre_scores_gemma":[0.05119002,0.000101464575,0.9454402,0.000045497014,0.000030843064,0.00009161928,0.00013846096,0.00030206912,0.0026597895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964523,0.00009936674,0.000016053751,0.00004882094,0.00016439322,0.000025999028],"domain_scores_gemma":[0.99952304,0.00011263753,0.000034867633,0.00013930809,0.00015638693,0.000033823082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060879445,0.0006331128,0.000476373,0.0006328784,0.0005061033,0.00052714144,0.00093695126,0.00047135988,0.0036443847],"category_scores_gemma":[0.0015319079,0.00034611713,0.0005982966,0.00054757483,0.00071358046,0.0011788213,0.0007237442,0.001008614,0.0013774702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019464537,0.00020588197,0.0009319484,0.00033265777,0.00014321158,0.00018071588,0.00026232042,0.21156795,0.101383634,0.1794579,0.008328064,0.49701104],"study_design_scores_gemma":[0.00002883391,0.000079485224,0.00019125172,0.000009593946,0.000015980952,0.00008709803,0.000022699609,0.943045,0.020854427,0.027685354,0.007951062,0.00002920099],"about_ca_topic_score_codex":0.0011484923,"about_ca_topic_score_gemma":0.0017031521,"teacher_disagreement_score":0.0036443847,"about_ca_system_score_codex":0.00021721695,"about_ca_system_score_gemma":0.00082281436,"threshold_uncertainty_score":0.012191653},"labels":[],"label_agreement":null},{"id":"W2740868391","doi":"10.24963/ijcai.2017/257","title":"Fast Recursive Low-rank Tensor Learning for Regression","year":2017,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Tensor (intrinsic definition); Computer science; Rank (graph theory); Regression; Predictability; Set (abstract data type); Scale (ratio); Algorithm; Artificial intelligence; Data mining; Machine learning; Theoretical computer science; Mathematics; Statistics","score_opus":0.06138969775447265,"score_gpt":0.375715730530891,"score_spread":0.31432603277641835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740868391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015855654,0.00015903478,0.9966182,0.000063999614,0.000023895029,0.000015322716,0.000060629336,0.0012275773,0.00024579978],"genre_scores_gemma":[0.08852806,0.00046037722,0.9054592,0.000118734424,0.00011114819,0.0001218311,0.00088631175,0.0007891211,0.003525226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893314,0.00034696257,0.000052334024,0.00024174788,0.000329588,0.000096204705],"domain_scores_gemma":[0.9980526,0.0007704889,0.00016565889,0.00048167547,0.00044222616,0.00008739322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015827474,0.0018507281,0.00125097,0.00084472366,0.00061507046,0.0010299988,0.0016748243,0.00105756,0.004343722],"category_scores_gemma":[0.005923444,0.0007214538,0.001007251,0.0012858473,0.00091035006,0.0022997186,0.0012690907,0.0025189717,0.0037007506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025272582,0.000117297306,0.0010585884,0.00043700894,0.00016206676,0.00016785231,0.00021888039,0.44931677,0.027677568,0.046365585,0.016364917,0.45786077],"study_design_scores_gemma":[0.000006435676,0.000021508033,0.000083454965,0.000005079379,0.000006373589,0.00002659205,0.000008007311,0.9886001,0.0026902228,0.0066215615,0.0019192575,0.000011475009],"about_ca_topic_score_codex":0.007716288,"about_ca_topic_score_gemma":0.011168084,"teacher_disagreement_score":0.007716288,"about_ca_system_score_codex":0.000810551,"about_ca_system_score_gemma":0.0018312513,"threshold_uncertainty_score":0.015342772},"labels":[],"label_agreement":null},{"id":"W2744816398","doi":"10.1145/3063593","title":"A Tucker Deep Computation Model for Mobile Multimedia Feature Learning","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computation; Speedup; Computer science; Tucker decomposition; Deep learning; Artificial intelligence; Feature (linguistics); Server; Machine learning; Parallel computing; Algorithm; Tensor (intrinsic definition); Tensor decomposition; Mathematics; Computer network","score_opus":0.06013025682110174,"score_gpt":0.37236190494088983,"score_spread":0.3122316481197881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744816398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019547658,0.00042934445,0.9750128,0.00042370494,0.00009435593,0.000057031335,0.00018900499,0.0016036042,0.0026424986],"genre_scores_gemma":[0.5642455,0.0011166052,0.42034665,0.00056708866,0.00012514643,0.0002960246,0.0012665519,0.00023992085,0.011796512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997547,0.00003318793,0.00001552119,0.0000741642,0.00007403955,0.00004835705],"domain_scores_gemma":[0.999777,0.000053030035,0.00001989256,0.00004666603,0.00008097165,0.000022510718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034973305,0.00078771927,0.0006393382,0.0005066782,0.00035353177,0.0007022819,0.001452087,0.0007910568,0.003032681],"category_scores_gemma":[0.0012107418,0.00028842434,0.00067941606,0.0007567338,0.00047587702,0.0019484153,0.0008790419,0.0016381479,0.00090826594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002459932,0.00015523756,0.0011514904,0.00011102437,0.000067761124,0.0001694916,0.00008012334,0.62865746,0.019668663,0.036461756,0.011598169,0.30163285],"study_design_scores_gemma":[0.0000026697417,0.000012661539,0.00004473738,0.0000020869445,0.000003952145,0.000010520867,0.0000025563586,0.99598336,0.0011509793,0.0022011534,0.0005824608,0.0000028866789],"about_ca_topic_score_codex":0.01228137,"about_ca_topic_score_gemma":0.014745383,"teacher_disagreement_score":0.01228137,"about_ca_system_score_codex":0.0011606064,"about_ca_system_score_gemma":0.0013489242,"threshold_uncertainty_score":0.024419725},"labels":[],"label_agreement":null},{"id":"W2746512809","doi":"10.1190/segam2017-17783114.1","title":"Incoherent noise attenuation via randomized CP decomposition","year":2017,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Noise (video); Computer science; Rank (graph theory); Tensor (intrinsic definition); Algorithm; Decomposition; Tensor decomposition; Matrix decomposition; Theoretical computer science; Physics; Mathematics; Artificial intelligence; Combinatorics; Geometry","score_opus":0.04382938397629275,"score_gpt":0.3699521270238548,"score_spread":0.32612274304756206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746512809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011356088,0.00010031313,0.9864696,0.00014634265,0.000039632356,0.000020820768,0.00007567449,0.00048133155,0.0013101404],"genre_scores_gemma":[0.24998349,0.00036736552,0.7438607,0.00022011063,0.00013475485,0.00015636071,0.0006493425,0.00027374603,0.0043541216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986737,0.00032757863,0.000049141498,0.00026055195,0.000562417,0.00012666092],"domain_scores_gemma":[0.9982664,0.0006504248,0.00017268672,0.0002937234,0.000549428,0.00006743201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011632723,0.0012091433,0.0007295267,0.0007140944,0.0005283504,0.0009964601,0.00096615986,0.0007453088,0.0023637512],"category_scores_gemma":[0.004766209,0.00038693938,0.0007350102,0.0011271508,0.000972751,0.001679789,0.0011330444,0.0013491606,0.00088767766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041634668,0.00017411963,0.0016242904,0.00017139057,0.00012262628,0.0002289076,0.00014881855,0.497334,0.06775885,0.085514836,0.008791283,0.3377146],"study_design_scores_gemma":[0.000011816029,0.000035954654,0.0002193495,0.0000054128272,0.000009088827,0.000034784527,0.000012300326,0.9837875,0.0072873933,0.006938265,0.0016445785,0.000013570587],"about_ca_topic_score_codex":0.0065457425,"about_ca_topic_score_gemma":0.0066380585,"teacher_disagreement_score":0.0065457425,"about_ca_system_score_codex":0.00071623473,"about_ca_system_score_gemma":0.001821966,"threshold_uncertainty_score":0.01301533},"labels":[],"label_agreement":null},{"id":"W2746990344","doi":"10.1190/segam2017-17782228.1","title":"5D seismic reconstruction via parallel matrix factorization with randomized QR decomposition","year":2017,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Matrix decomposition; QR decomposition; Factorization; Computer science; Rank (graph theory); Algorithm; Tensor (intrinsic definition); Matrix (chemical analysis); Tensor decomposition; Mathematics; Combinatorics; Physics; Chemistry","score_opus":0.029903866577705874,"score_gpt":0.3311684247697618,"score_spread":0.30126455819205594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746990344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013335174,0.000059001362,0.9978588,0.000059711994,0.000022945604,0.000013737951,0.00003797046,0.0002844739,0.0003298577],"genre_scores_gemma":[0.025297854,0.00013354575,0.9730099,0.000054590786,0.00003526522,0.000061674094,0.00019500703,0.00013081358,0.0010815018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991974,0.00023014205,0.000034626933,0.00011493365,0.0003666537,0.000056213798],"domain_scores_gemma":[0.99916387,0.0003088449,0.00011044219,0.00015492197,0.00021417823,0.00004774967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011535638,0.0012653117,0.00091502856,0.0007436387,0.0004379072,0.00080941146,0.0010816761,0.001139908,0.0031865174],"category_scores_gemma":[0.0024197532,0.000613917,0.001186376,0.0008044534,0.0006779591,0.0011695932,0.001474435,0.0017752082,0.0014548835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025611618,0.0000967138,0.0007496931,0.00030705374,0.00015317333,0.0002644288,0.0001814529,0.5843009,0.054836076,0.04689343,0.009070521,0.3028905],"study_design_scores_gemma":[0.00001540981,0.00003185435,0.00007187531,0.000012123719,0.000007447875,0.00007035577,0.000012362189,0.9870904,0.0044724625,0.0046841577,0.0035133613,0.00001828828],"about_ca_topic_score_codex":0.0037689463,"about_ca_topic_score_gemma":0.005079649,"teacher_disagreement_score":0.0037689463,"about_ca_system_score_codex":0.00048301797,"about_ca_system_score_gemma":0.0013036832,"threshold_uncertainty_score":0.010659993},"labels":[],"label_agreement":null},{"id":"W2759845240","doi":"10.1137/16m1084717","title":"Discrete Fourier Transform Tensors and Their Ranks","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Rank (graph theory); Tensor (intrinsic definition); Discrete Fourier transform (general); Dimension (graph theory); Generalization; Tensor contraction; Tensor field; Tensor product; Symmetric tensor; Pure mathematics; Tensor density; Mathematical analysis; Fourier transform; Combinatorics; Fourier analysis; Exact solutions in general relativity; Fractional Fourier transform","score_opus":0.023471862087207213,"score_gpt":0.34247139287467526,"score_spread":0.31899953078746807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759845240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1514228,0.0041123494,0.7792045,0.0020388588,0.0008788813,0.00010094189,0.0010307488,0.0008515255,0.060359344],"genre_scores_gemma":[0.79085445,0.00400864,0.16712575,0.00060845935,0.0015024627,0.00016290075,0.0011041822,0.0007747354,0.03385843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859947,0.0003176255,0.000078955185,0.00020251983,0.0005833497,0.00021817363],"domain_scores_gemma":[0.9951137,0.0015675001,0.0008234072,0.0007569836,0.0011714556,0.000566988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017071457,0.0011438483,0.00061786955,0.003453612,0.0008227387,0.002908018,0.0007567515,0.0010594906,0.0081118],"category_scores_gemma":[0.009903832,0.00043272384,0.0006693425,0.0013600535,0.0033917315,0.004665406,0.002164086,0.0022702278,0.0020744335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038556598,0.000026150748,0.00051506155,0.00006385941,0.000009893845,0.00011220519,0.00019241417,0.00726078,0.0029484532,0.9697771,0.0020818468,0.016973604],"study_design_scores_gemma":[0.000007872599,0.000051604293,0.0006201483,0.00003838945,0.0000073979077,0.00021541155,0.00011260777,0.05352182,0.0019699018,0.93519455,0.00822247,0.000037918544],"about_ca_topic_score_codex":0.0011337516,"about_ca_topic_score_gemma":0.000887429,"teacher_disagreement_score":0.0081118,"about_ca_system_score_codex":0.00086781435,"about_ca_system_score_gemma":0.0009215947,"threshold_uncertainty_score":0.027136683},"labels":[],"label_agreement":null},{"id":"W2768480272","doi":"10.1002/cpa.21861","title":"The Landscape of the Spiked Tensor Model","year":2019,"lang":"en","type":"preprint","venue":"Communications on Pure and Applied Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Lambda; Mathematics; Combinatorics; Unit vector; Maxima; Rank (graph theory); Polynomial; Estimator; Exponential function; Tensor (intrinsic definition); Degree (music); Mathematical analysis; Physics; Geometry; Statistics; Quantum mechanics","score_opus":0.06979842427746022,"score_gpt":0.3231111371011944,"score_spread":0.25331271282373413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768480272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33074552,0.0036663057,0.6124527,0.01635693,0.00028788924,0.00009093503,0.0012757992,0.0011302427,0.033993773],"genre_scores_gemma":[0.94164544,0.0011935363,0.044812676,0.001044851,0.00030753374,0.00016678641,0.00079756323,0.00032844933,0.009703187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871767,0.00060835306,0.0000353764,0.00023522823,0.00019219177,0.00021130352],"domain_scores_gemma":[0.9920718,0.005025106,0.0008877819,0.0005420279,0.0006591089,0.0008141665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027953107,0.0011027829,0.0018026198,0.0016328853,0.0013746566,0.0033325583,0.0021686195,0.003183234,0.0060976893],"category_scores_gemma":[0.017978363,0.00086869457,0.000922969,0.0008851772,0.003859426,0.004925639,0.0030027125,0.0025384945,0.0006548567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002520113,0.000065648164,0.0018944466,0.00018148351,0.00007441082,0.00036393356,0.0001270766,0.36620155,0.0015349261,0.6153164,0.0056363586,0.008351674],"study_design_scores_gemma":[0.000019342147,0.000024585283,0.0002590935,0.000023473269,0.000007856204,0.000052227384,0.000026559006,0.7290294,0.00018067547,0.2696114,0.0007429311,0.000022458538],"about_ca_topic_score_codex":0.0049609668,"about_ca_topic_score_gemma":0.0030960361,"teacher_disagreement_score":0.0060976893,"about_ca_system_score_codex":0.0022423686,"about_ca_system_score_gemma":0.0013625732,"threshold_uncertainty_score":0.020398855},"labels":[],"label_agreement":null},{"id":"W2785761199","doi":"10.48550/arxiv.1802.04868","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":395,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Simple (philosophy); Embedding; Computer science; Theoretical computer science; Link (geometry); Factorization; Graph embedding; Tying; Artificial intelligence; Algorithm","score_opus":0.13757808140572042,"score_gpt":0.28085417601112767,"score_spread":0.14327609460540724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785761199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01649846,0.00044117187,0.97526205,0.00062210305,0.00007771921,0.00008618303,0.0018560198,0.0029103989,0.002245961],"genre_scores_gemma":[0.39946455,0.0011393334,0.581046,0.00051728054,0.0002376285,0.0003725504,0.008802143,0.00081854535,0.0076020095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794894,0.00051375857,0.00015444036,0.00068160193,0.0005221697,0.0001791468],"domain_scores_gemma":[0.99228716,0.0034690101,0.0007562061,0.0024345,0.00078534585,0.00026773615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001749328,0.0018260012,0.0011501904,0.0019164992,0.00082290615,0.0021017662,0.0020985443,0.0016277838,0.010579829],"category_scores_gemma":[0.018073242,0.0009615578,0.0016324811,0.0029533529,0.0016947138,0.009600139,0.0029594023,0.0032928356,0.0031858918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039219932,0.0002652868,0.0034408472,0.0007301665,0.00015667512,0.0003439481,0.00048753497,0.36603037,0.0052683335,0.21345168,0.029969305,0.3794637],"study_design_scores_gemma":[0.000015941836,0.00002626267,0.00024816397,0.00004032936,0.000021796035,0.00005874007,0.00004241174,0.7027586,0.0011369177,0.29179162,0.003841092,0.000018159657],"about_ca_topic_score_codex":0.0045911125,"about_ca_topic_score_gemma":0.0081589725,"teacher_disagreement_score":0.010579829,"about_ca_system_score_codex":0.0017637719,"about_ca_system_score_gemma":0.0013259491,"threshold_uncertainty_score":0.03539306},"labels":[],"label_agreement":null},{"id":"W2788615233","doi":"10.3390/math6010013","title":"Iterative Methods for Computing Vibrational Spectra","year":2018,"lang":"en","type":"article","venue":"Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Eigenvalues and eigenvectors; Basis (linear algebra); Grid; Matrix (chemical analysis); Hamiltonian (control theory); Quadrature (astronomy); Hamiltonian matrix; Applied mathematics; Algorithm; Computer science; Mathematics; Physics; Chemistry; Symmetric matrix; Mathematical optimization; Quantum mechanics; Geometry; Optics","score_opus":0.09770630229374164,"score_gpt":0.450016614239556,"score_spread":0.3523103119458144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788615233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005445248,0.0017133047,0.99103516,0.00019033105,0.00018463659,0.000055175555,0.00008289113,0.0005069572,0.005687104],"genre_scores_gemma":[0.019735102,0.003921038,0.9664705,0.00021281731,0.00030697582,0.00040147465,0.00027892843,0.0010621784,0.007611017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983309,0.0005744388,0.00009772861,0.0001501168,0.00076319836,0.00008366581],"domain_scores_gemma":[0.9977202,0.0011331933,0.000139714,0.00029306617,0.00064729835,0.000066520435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020030998,0.0017501378,0.0011231246,0.0018180497,0.0010748467,0.0015327944,0.002908813,0.0016863181,0.01061695],"category_scores_gemma":[0.0073980154,0.0007483506,0.0017473657,0.0019734004,0.0014127182,0.0020373943,0.0019530468,0.002928661,0.0068884045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006276702,0.000096022326,0.0007557503,0.00091841357,0.00018963745,0.0001581832,0.00037826312,0.17922926,0.005438368,0.43834797,0.022986084,0.35143927],"study_design_scores_gemma":[0.00003689434,0.000048485133,0.00025881475,0.0002084418,0.000040536816,0.00019224363,0.000067773064,0.6729018,0.0035616753,0.24528345,0.07733371,0.00006621838],"about_ca_topic_score_codex":0.0026765678,"about_ca_topic_score_gemma":0.0026197098,"teacher_disagreement_score":0.01061695,"about_ca_system_score_codex":0.0008926611,"about_ca_system_score_gemma":0.0013137144,"threshold_uncertainty_score":0.035517275},"labels":[],"label_agreement":null},{"id":"W2790705522","doi":"10.1007/s11590-018-1234-1","title":"Complementarity problems over a hypermatrix (tensor) set","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uniqueness; Complementarity (molecular biology); Complementarity theory; Tensor (intrinsic definition); Combinatorics; Mathematics; Computational intelligence; Order (exchange); Mathematical physics; Physics; Pure mathematics; Mathematical analysis; Computer science; Quantum mechanics; Artificial intelligence","score_opus":0.05394148092549266,"score_gpt":0.32752160638490413,"score_spread":0.27358012545941146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790705522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026457163,0.00057914434,0.9480051,0.001593292,0.00024873935,0.000059822203,0.00038333135,0.00012534183,0.022548009],"genre_scores_gemma":[0.57090366,0.0029782823,0.3651173,0.00097575405,0.0012014916,0.00058696547,0.0007943536,0.00044018024,0.057002075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.0005156117,0.00006627234,0.00020905858,0.00037722386,0.000106434156],"domain_scores_gemma":[0.99669385,0.0019214704,0.00036351962,0.00027463332,0.00044108744,0.0003053887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020131576,0.0013146289,0.0010361766,0.0016119527,0.0008104174,0.0034398427,0.001203008,0.0016506983,0.0063650208],"category_scores_gemma":[0.0047988114,0.0005019177,0.00079119107,0.0021515817,0.0023302042,0.004168247,0.0026454397,0.0028827295,0.00084816123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028696131,0.00005117234,0.00018033531,0.0001309586,0.000036511356,0.00011833493,0.00008900942,0.04226353,0.0020438947,0.93740904,0.0033017287,0.01434683],"study_design_scores_gemma":[0.000009749054,0.00003674661,0.000162345,0.000027107242,0.000017473982,0.00011262588,0.00007656255,0.22914584,0.0009371189,0.76517606,0.0042744335,0.000023929655],"about_ca_topic_score_codex":0.0015045597,"about_ca_topic_score_gemma":0.0018006671,"teacher_disagreement_score":0.0063650208,"about_ca_system_score_codex":0.0010446317,"about_ca_system_score_gemma":0.0012046621,"threshold_uncertainty_score":0.021293163},"labels":[],"label_agreement":null},{"id":"W2790987616","doi":"10.1002/nla.2202","title":"Nonlinearly preconditioned L‐BFGS as an acceleration mechanism for alternating least squares with application to tensor decomposition","year":2018,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Nonlinear system; Tensor (intrinsic definition); Acceleration; Nonlinear conjugate gradient method; Robustness (evolution); Mathematics; Conjugate gradient method; Quasi-Newton method; Applied mathematics; Mathematical optimization; Computer science; Newton's method; Geometry; Gradient descent; Physics; Artificial intelligence","score_opus":0.030350149289128103,"score_gpt":0.3549142863738016,"score_spread":0.3245641370846735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790987616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042839544,0.00007387619,0.99347514,0.0001315262,0.000045156594,0.000019652774,0.000028500339,0.00041608774,0.001525981],"genre_scores_gemma":[0.15025611,0.00021954413,0.8435124,0.0001279996,0.00005945182,0.00013351897,0.00015422438,0.00045999995,0.0050766827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995022,0.00018891251,0.000023944163,0.0000550433,0.00019306736,0.000036860696],"domain_scores_gemma":[0.99914324,0.00029185164,0.00008801712,0.00015069627,0.0002671977,0.000059003043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008265282,0.00084803795,0.00053073687,0.0004660142,0.00037730343,0.0005568322,0.00067109586,0.00070095324,0.0035586685],"category_scores_gemma":[0.003214013,0.00031635817,0.0005357379,0.00047762843,0.00086083706,0.000636016,0.0012013699,0.0013520271,0.0015768666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013299489,0.000055267257,0.0006101497,0.0001876788,0.000054603643,0.000120308185,0.00017227928,0.7529485,0.019026967,0.10700146,0.005333799,0.11435588],"study_design_scores_gemma":[0.0000073016236,0.0000096962995,0.000036568297,0.000005874253,0.0000024874266,0.000010010621,0.000005245388,0.9853774,0.0017812756,0.0107823005,0.0019768656,0.000005008765],"about_ca_topic_score_codex":0.0050791646,"about_ca_topic_score_gemma":0.005979162,"teacher_disagreement_score":0.0050791646,"about_ca_system_score_codex":0.00049232005,"about_ca_system_score_gemma":0.0011716562,"threshold_uncertainty_score":0.011904895},"labels":[],"label_agreement":null},{"id":"W2791529266","doi":"10.1109/tetc.2018.2801464","title":"Tensor-Based Multiple Clustering Approaches for Cyber-Physical-Social Applications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Euclidean distance; Ranking (information retrieval); Similarity (geometry); Correlation clustering; Tensor (intrinsic definition); Clustering high-dimensional data; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.0998356847540566,"score_gpt":0.35029781150461065,"score_spread":0.250462126750554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791529266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042242412,0.00075813907,0.9932755,0.00023949775,0.00005524204,0.00004189983,0.000088366905,0.00041764427,0.00089957943],"genre_scores_gemma":[0.19023822,0.0016858439,0.804198,0.00014915323,0.00013321136,0.00013845754,0.0006261621,0.00018723999,0.0026436555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840087,0.0005938223,0.00011216973,0.00033363185,0.00044872257,0.00011080975],"domain_scores_gemma":[0.9978752,0.0005296006,0.00028239234,0.00040181624,0.0007974349,0.00011351077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018547846,0.0015290689,0.0011082027,0.0028344765,0.0013801109,0.0017485531,0.0016873146,0.0008770232,0.0018480064],"category_scores_gemma":[0.0039156973,0.00047357546,0.0015604277,0.004298206,0.00096810044,0.002567757,0.0016571073,0.0014000696,0.0009309229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019763397,0.00015412857,0.0024702798,0.0005120704,0.0003335662,0.00025658726,0.0006700847,0.41139272,0.011242775,0.08961341,0.010606323,0.47255036],"study_design_scores_gemma":[0.0000062911854,0.000035702382,0.0005136049,0.00001874447,0.00002960709,0.00006835576,0.00014909923,0.9620001,0.0019786933,0.030538192,0.0046296837,0.000031988304],"about_ca_topic_score_codex":0.010984384,"about_ca_topic_score_gemma":0.012802789,"teacher_disagreement_score":0.010984384,"about_ca_system_score_codex":0.0016030617,"about_ca_system_score_gemma":0.0016628917,"threshold_uncertainty_score":0.02184093},"labels":[],"label_agreement":null},{"id":"W2796165036","doi":"10.1109/tsp.2018.2879031","title":"Learning Tensors From Partial Binary Measurements","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Bounded function; Binary number; Matrix norm; Mathematics; Rank (graph theory); Sample complexity; Combinatorics; Context (archaeology); Matrix (chemical analysis); Low-rank approximation; Order (exchange); Norm (philosophy); Discrete mathematics; Computational complexity theory; Algorithm; Computer science; Pure mathematics; Mathematical analysis; Physics; Arithmetic; Artificial intelligence; Eigenvalues and eigenvectors","score_opus":0.09392853624470889,"score_gpt":0.3342651369320856,"score_spread":0.24033660068737672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796165036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02924134,0.0002460381,0.9672316,0.0006188037,0.00007429512,0.000041384126,0.00058980065,0.0007471046,0.0012096654],"genre_scores_gemma":[0.5160289,0.0009951227,0.47062802,0.0004951361,0.00047375166,0.00022537683,0.0038620234,0.00037428192,0.006917422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979545,0.0006380555,0.000121478995,0.00054281874,0.00048275478,0.0002604021],"domain_scores_gemma":[0.99417454,0.0024437523,0.00071323523,0.0017225571,0.00062981393,0.0003161942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001997188,0.0018926112,0.0015190844,0.0010366727,0.0006789649,0.0017949021,0.0016775419,0.0017773109,0.0033076056],"category_scores_gemma":[0.013771692,0.0007465115,0.0011011494,0.0015240134,0.0019330352,0.004700556,0.00256978,0.0031552555,0.001406519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009957782,0.0001734636,0.003281269,0.0004888319,0.00016115322,0.00037122637,0.00032099892,0.57279974,0.020902993,0.17405795,0.011504729,0.21494184],"study_design_scores_gemma":[0.000015160928,0.00005548235,0.00042088114,0.000018402463,0.0000118967155,0.000059896796,0.00003137573,0.9190534,0.00321785,0.07562823,0.001460009,0.000027479955],"about_ca_topic_score_codex":0.0054916884,"about_ca_topic_score_gemma":0.0044014063,"teacher_disagreement_score":0.0054916884,"about_ca_system_score_codex":0.0012414319,"about_ca_system_score_gemma":0.0017098702,"threshold_uncertainty_score":0.011065066},"labels":[],"label_agreement":null},{"id":"W2797346236","doi":"10.1109/focs.2018.00088","title":"Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Polytope; Mathematics; Kronecker delta; Tensor (intrinsic definition); Scaling; Algorithm; Discrete mathematics; Pure mathematics; Geometry; Quantum mechanics","score_opus":0.08355092090534687,"score_gpt":0.36928202406498906,"score_spread":0.2857311031596422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797346236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091680605,0.00006173192,0.98699003,0.00022495202,0.00002475146,0.000050645904,0.00008227833,0.001606334,0.0017911417],"genre_scores_gemma":[0.18257679,0.000097400676,0.8117189,0.00016230822,0.00006440327,0.00021115206,0.00060077105,0.00081784686,0.0037504549],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985262,0.0003047141,0.00009376473,0.00038947942,0.00046024015,0.00022562835],"domain_scores_gemma":[0.99737716,0.0010558111,0.00020366425,0.00084143615,0.00037900716,0.00014289981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013533572,0.001176766,0.0013112088,0.0008814226,0.0008491445,0.0019037087,0.0021443346,0.0011832849,0.008697666],"category_scores_gemma":[0.008175149,0.00054414244,0.0012409773,0.0012684019,0.0016528284,0.0036664074,0.0042079724,0.003220399,0.0027416355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026185752,0.00020118139,0.0012157814,0.00028054925,0.000056105513,0.000120760014,0.0004581809,0.23384516,0.011773162,0.2931586,0.013052273,0.44557646],"study_design_scores_gemma":[0.000029641024,0.000037564652,0.0001187105,0.000013433887,0.000008848824,0.00004296581,0.000065613836,0.84137595,0.004413875,0.15102363,0.0028531468,0.00001667756],"about_ca_topic_score_codex":0.002057018,"about_ca_topic_score_gemma":0.002745202,"teacher_disagreement_score":0.008697666,"about_ca_system_score_codex":0.0014395302,"about_ca_system_score_gemma":0.0015925271,"threshold_uncertainty_score":0.029096544},"labels":[],"label_agreement":null},{"id":"W2799867926","doi":"10.1002/cpe.4473","title":"Distributed geometric nonnegative matrix factorization and hierarchical alternating least squares–based nonnegative tensor factorization with the MapReduce paradigm","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wroclawskie Centrum Sieciowo-Superkomputerowe, Politechnika Wroclawska; Canadian Institute for Advanced Research","keywords":"Matrix decomposition; Non-negative matrix factorization; Multilinear map; Computer science; Factorization; Dimensionality reduction; Computation; Curse of dimensionality; Tensor (intrinsic definition); Matrix (chemical analysis); Algorithm; Mathematics; Artificial intelligence","score_opus":0.037413872453637066,"score_gpt":0.3647767161157716,"score_spread":0.32736284366213453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799867926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004624022,0.00012169785,0.9941543,0.00014961441,0.00003721265,0.000019966708,0.000030204486,0.0001608179,0.0007021267],"genre_scores_gemma":[0.35272083,0.00044572024,0.6426056,0.00020360023,0.00022639512,0.00017892693,0.00040030768,0.00014900698,0.0030696518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988858,0.00039561474,0.000045643996,0.00024502486,0.0003245009,0.0001035253],"domain_scores_gemma":[0.99851865,0.0005084046,0.00016075814,0.0003133442,0.00040082762,0.00009799564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011973206,0.0009669266,0.0008079989,0.0005433407,0.0004961752,0.0008428507,0.0012967965,0.0005694103,0.001443167],"category_scores_gemma":[0.0036260053,0.00035531222,0.001095214,0.000898137,0.0010855374,0.0014898614,0.0013435667,0.0012667086,0.0005351056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017009558,0.00008343914,0.00076884055,0.00014871273,0.00008779325,0.00018189517,0.00013115132,0.7668295,0.009027572,0.090747096,0.006260643,0.12556326],"study_design_scores_gemma":[0.000005993362,0.0000124239,0.000064305365,0.0000024313301,0.0000038820394,0.000020895759,0.000011176995,0.97820216,0.00062732946,0.020163218,0.00087971543,0.0000064015244],"about_ca_topic_score_codex":0.0056469557,"about_ca_topic_score_gemma":0.0054057413,"teacher_disagreement_score":0.0056469557,"about_ca_system_score_codex":0.0006275938,"about_ca_system_score_gemma":0.0014481146,"threshold_uncertainty_score":0.011228144},"labels":[],"label_agreement":null},{"id":"W2802552971","doi":"10.1109/tcss.2018.2813320","title":"A Distributed HOSVD Method With Its Incremental Computation for Big Data in Cyber-Physical-Social Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Big data; Computer science; Scalability; Computation; Dimensionality reduction; Tensor (intrinsic definition); Noise (video); Singular value decomposition; Cyber-physical system; Data mining; Artificial intelligence; Theoretical computer science; Distributed computing; Algorithm; Mathematics; Database","score_opus":0.12441489177833089,"score_gpt":0.3895373254667616,"score_spread":0.26512243368843075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802552971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041542333,0.00013366496,0.994732,0.000101980615,0.000059386766,0.000024092677,0.000031798634,0.00019823624,0.00056466163],"genre_scores_gemma":[0.2176675,0.00040653147,0.77714753,0.00013637463,0.00016122521,0.00015118576,0.00036109495,0.00013375883,0.003834789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996722,0.00006991719,0.00002125404,0.00007447978,0.00013017679,0.00003214907],"domain_scores_gemma":[0.9993888,0.00020231918,0.00004654508,0.00010709529,0.00021299133,0.000042111296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059932505,0.00063105306,0.0007172146,0.0005944026,0.0005122042,0.00095823244,0.0011018872,0.00067386904,0.0019353789],"category_scores_gemma":[0.0018002831,0.0003151799,0.0007264636,0.000920239,0.00067468703,0.0013167572,0.0010441025,0.0011240419,0.00048290886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017918414,0.00011255698,0.0016557346,0.00025093983,0.00010696779,0.0002158688,0.00023361885,0.60124767,0.015586469,0.046757095,0.007143714,0.32651022],"study_design_scores_gemma":[0.000006783119,0.000015353038,0.00007969234,0.0000026520702,0.000004053979,0.000019663465,0.000012924241,0.9939511,0.00091743434,0.00399818,0.0009857198,0.000006446624],"about_ca_topic_score_codex":0.0042809662,"about_ca_topic_score_gemma":0.0054722554,"teacher_disagreement_score":0.0042809662,"about_ca_system_score_codex":0.0004222675,"about_ca_system_score_gemma":0.0011785323,"threshold_uncertainty_score":0.00851208},"labels":[],"label_agreement":null},{"id":"W2808531674","doi":"10.24963/ijcai.2018/504","title":"Joint Learning of Phenotypes and Diagnosis-Medication Correspondence via Hidden Interaction Tensor Factorization","year":2018,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heuristics; Computer science; Factorization; Tensor (intrinsic definition); Artificial intelligence; Machine learning; Poisson distribution; Matrix decomposition; Medical diagnosis; Pattern recognition (psychology); Data mining; Mathematics; Algorithm; Statistics; Medicine","score_opus":0.04675466994228429,"score_gpt":0.3286242398606789,"score_spread":0.2818695699183946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808531674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036284234,0.0005866649,0.9597405,0.00082791183,0.00008112666,0.00008053072,0.0010303471,0.00073527585,0.0006333274],"genre_scores_gemma":[0.65671515,0.0006839774,0.33217958,0.00045183813,0.00030078838,0.00026527172,0.005977466,0.00013697785,0.0032889405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997792,0.0010327746,0.00011805026,0.00060507044,0.0002645198,0.00018759337],"domain_scores_gemma":[0.9933274,0.004450903,0.0007795432,0.0006363957,0.0005666956,0.0002391031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004436117,0.001733329,0.0015027276,0.0013905824,0.00052306947,0.0011242348,0.0014864143,0.0013498083,0.0017938236],"category_scores_gemma":[0.014244657,0.00077586854,0.002079183,0.0015495952,0.0010106884,0.0018625357,0.0011278453,0.00276998,0.00090326386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009882066,0.0005747123,0.035644766,0.0005177573,0.0005742107,0.00089287624,0.0005387111,0.6020476,0.0053332048,0.028024973,0.016433991,0.30842897],"study_design_scores_gemma":[0.00002626207,0.00004271651,0.0015181924,0.000019334619,0.000032609856,0.00008074643,0.000020413872,0.9760375,0.0004755556,0.020999718,0.0007271377,0.000019878022],"about_ca_topic_score_codex":0.011821022,"about_ca_topic_score_gemma":0.0138103785,"teacher_disagreement_score":0.011821022,"about_ca_system_score_codex":0.0011149804,"about_ca_system_score_gemma":0.0024616788,"threshold_uncertainty_score":0.023504436},"labels":[],"label_agreement":null},{"id":"W2900800369","doi":"10.1016/j.laa.2020.01.039","title":"Exact recovery in the hypergraph stochastic block model: A spectral algorithm","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Hypergraph; Stochastic block model; Mathematics; Algorithm; Block (permutation group theory); Combinatorics; Statistics","score_opus":0.03562181014026161,"score_gpt":0.29029807622208653,"score_spread":0.2546762660818249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900800369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055943336,0.00013552523,0.9929898,0.00025647262,0.000027632923,0.00001960939,0.00006166941,0.00015359628,0.00076135225],"genre_scores_gemma":[0.27948105,0.0007857625,0.7091504,0.0004246739,0.00021878471,0.00025902817,0.0006336197,0.00037919942,0.008667437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899083,0.0004575752,0.000051924068,0.00018600682,0.00020375481,0.000109865076],"domain_scores_gemma":[0.99543744,0.003077795,0.00026738853,0.0005587799,0.00044415233,0.00021444944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027980267,0.0011743227,0.0019113319,0.0010006559,0.00064138067,0.0016154412,0.0021320072,0.0020415492,0.0041858577],"category_scores_gemma":[0.009536204,0.00081568497,0.00093487307,0.0015681387,0.0017711231,0.0043528466,0.0029044999,0.002893726,0.0010295808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025392775,0.00016940177,0.0004231869,0.00017206585,0.00008275509,0.00009515592,0.0001354678,0.6097511,0.002332341,0.29445255,0.0052020345,0.08693007],"study_design_scores_gemma":[0.0000071402937,0.000008844144,0.00002082621,0.0000046831697,0.0000036874908,0.000008595179,0.000006143448,0.95844907,0.00016515498,0.041076567,0.00024339659,0.0000058587207],"about_ca_topic_score_codex":0.005626374,"about_ca_topic_score_gemma":0.0053563765,"teacher_disagreement_score":0.005626374,"about_ca_system_score_codex":0.00097055885,"about_ca_system_score_gemma":0.002966729,"threshold_uncertainty_score":0.014797509},"labels":[],"label_agreement":null},{"id":"W2901166078","doi":"10.1109/tsusc.2018.2881439","title":"Improved Multi-Order Distributed HOSVD with Its Incremental Computing for Smart City Services","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Huazhong University of Science and Technology; Canada Research Chairs; Shenzhen Fundamental Research Program; Royal Society of Canada","keywords":"Big data; Computer science; Adaptability; Distributed computing; Tree (set theory); Operationalization; Data processing; Data mining; Data science; Database","score_opus":0.030183311862901647,"score_gpt":0.31109342348925734,"score_spread":0.2809101116263557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901166078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018815735,0.00024304191,0.97893757,0.00015262412,0.00007193163,0.00002805366,0.00003999591,0.00043268767,0.0012782571],"genre_scores_gemma":[0.42314216,0.000332105,0.57340187,0.00013198929,0.00007299924,0.00007802414,0.00025778398,0.000108356995,0.002474759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996706,0.00006631216,0.000019672103,0.000057452195,0.00013772633,0.0000481999],"domain_scores_gemma":[0.99951935,0.0001350688,0.000037663493,0.00008231517,0.00018799466,0.000037577887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237757,0.00045395555,0.00063654996,0.00058110885,0.0005595965,0.00089803006,0.0010517646,0.0004921549,0.0015911494],"category_scores_gemma":[0.001615013,0.000220936,0.00060378044,0.0010388062,0.00040771338,0.0014193065,0.0008683777,0.00075279915,0.0004065795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029937885,0.0001561672,0.002462823,0.0001375134,0.00006980947,0.00017047733,0.00024217319,0.58505774,0.014696569,0.026857281,0.006328214,0.36352196],"study_design_scores_gemma":[0.0000065534323,0.000018216795,0.00008269203,0.0000017336076,0.0000041025432,0.000017565328,0.000014749189,0.9957942,0.0010122644,0.0023692455,0.00067431433,0.000004428273],"about_ca_topic_score_codex":0.0067213913,"about_ca_topic_score_gemma":0.007164338,"teacher_disagreement_score":0.0067213913,"about_ca_system_score_codex":0.0005735264,"about_ca_system_score_gemma":0.0009867464,"threshold_uncertainty_score":0.013364494},"labels":[],"label_agreement":null},{"id":"W2904119337","doi":"10.1145/3233773","title":"A Deep Bayesian Tensor-Based System for Video Recommendation","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Tencent","keywords":"Computer science; Recommender system; Surprise; Exploit; Artificial intelligence; Ranking (information retrieval); Machine learning; Tensor (intrinsic definition); Metric (unit); Cluster analysis; Bayesian probability; Information retrieval; Collaborative filtering; Latent variable","score_opus":0.038135568599120005,"score_gpt":0.306795895461837,"score_spread":0.268660326862717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904119337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007774687,0.00046617497,0.9866419,0.00028746322,0.000083402534,0.000063380416,0.00029800905,0.0026132434,0.0017716752],"genre_scores_gemma":[0.38893217,0.00073641684,0.59947264,0.00039276836,0.00016552252,0.00024692388,0.0012872411,0.00017777493,0.008588481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992919,0.0001746651,0.000053845262,0.00018872044,0.0001896297,0.000101192956],"domain_scores_gemma":[0.99909973,0.00023395882,0.00007239817,0.00015953495,0.00034713725,0.00008717875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012140839,0.0009105227,0.0012801852,0.0008321449,0.00073585147,0.0011389338,0.0022815024,0.0013828402,0.0058953767],"category_scores_gemma":[0.0032309315,0.000553688,0.0008980095,0.0013606228,0.00054180215,0.0019824707,0.0011771265,0.0016605224,0.0026628422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065788283,0.00025738575,0.0020502969,0.00022654785,0.000177484,0.00024431132,0.00021308521,0.39699847,0.012836604,0.03335395,0.018762896,0.5342211],"study_design_scores_gemma":[0.000007839508,0.000019797022,0.000052916657,0.000002964662,0.0000075483686,0.00001954441,0.000004561929,0.996336,0.0004985736,0.0024031417,0.0006392095,0.000007990776],"about_ca_topic_score_codex":0.039419953,"about_ca_topic_score_gemma":0.04718378,"teacher_disagreement_score":0.039419953,"about_ca_system_score_codex":0.0016265869,"about_ca_system_score_gemma":0.0018880507,"threshold_uncertainty_score":0.078381},"labels":[],"label_agreement":null},{"id":"W2909294622","doi":"10.1109/tnse.2019.2929155","title":"HO-OTSVD: A Novel Tensor Decomposition and Its Incremental Decomposition for Cyber–Physical–Social Networks (CPSN)","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Singular value decomposition; Orthogonalization; Tensor (intrinsic definition); Lanczos resampling; Computer science; Tensor decomposition; Tucker decomposition; Decomposition; Adjacency matrix; Theoretical computer science; Matrix decomposition; Distributed computing; Mathematics; Algorithm; Eigenvalues and eigenvectors","score_opus":0.019971534297515935,"score_gpt":0.2905657392360518,"score_spread":0.27059420493853586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909294622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032969178,0.00018377134,0.9953301,0.000094097464,0.000064256645,0.000035525878,0.00013838767,0.00036520496,0.0004918346],"genre_scores_gemma":[0.13461527,0.00065685285,0.8597371,0.00012903902,0.00011705652,0.00019473983,0.0014271316,0.00020993776,0.0029127966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911827,0.00022138537,0.00007949605,0.00016980212,0.0003132825,0.000097820805],"domain_scores_gemma":[0.9987692,0.00027945425,0.00014249898,0.00024490326,0.000428549,0.0001353416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010532853,0.0012463126,0.0009268819,0.0011926993,0.0006485429,0.0013011892,0.0014318383,0.00079468684,0.0024732135],"category_scores_gemma":[0.0032630153,0.00046179377,0.0013477075,0.001644059,0.0008078395,0.0024335438,0.0016889288,0.0017318273,0.00096695416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023675739,0.00016826023,0.0035829253,0.0005193462,0.0001890275,0.0002780955,0.0003358217,0.3620368,0.017226262,0.050157692,0.013191359,0.5520776],"study_design_scores_gemma":[0.000009023626,0.000029114237,0.00023839579,0.000009499416,0.000011138463,0.000048223978,0.00004180018,0.9865108,0.0015807104,0.008527952,0.0029781577,0.0000152217735],"about_ca_topic_score_codex":0.013542503,"about_ca_topic_score_gemma":0.015912902,"teacher_disagreement_score":0.013542503,"about_ca_system_score_codex":0.0008739022,"about_ca_system_score_gemma":0.002037858,"threshold_uncertainty_score":0.026927352},"labels":[],"label_agreement":null},{"id":"W2919046304","doi":"10.48550/arxiv.1903.00813","title":"Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Catalan number; Mathematics; Enumeration; Bijection; Hypercube; Combinatorics; Generalization; Functional equation; Arity; Binary tree; Binary number; Discrete mathematics; Arithmetic","score_opus":0.11530920800697195,"score_gpt":0.23067743545995656,"score_spread":0.11536822745298461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919046304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72943145,0.0015236255,0.22174655,0.00074086554,0.00013979519,0.000047312653,0.0003784137,0.00043224424,0.045559842],"genre_scores_gemma":[0.943461,0.00074611267,0.042423036,0.000180538,0.00013484237,0.00013774009,0.0005211195,0.0001921282,0.012203447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993406,0.00014900428,0.00003254622,0.00010446364,0.0002330051,0.00014040746],"domain_scores_gemma":[0.99747974,0.0012802444,0.00033644363,0.0002570237,0.00044116421,0.00020543097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088450476,0.00036105304,0.00046977762,0.002219662,0.0008351145,0.0018463676,0.0010609076,0.00052567024,0.004103823],"category_scores_gemma":[0.0072370586,0.00034698044,0.0005349577,0.0016944758,0.001628745,0.0031200454,0.0011592348,0.0011152336,0.00050953473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003882429,0.000025517696,0.0011381776,0.00006520114,0.0000063517605,0.00007797231,0.00022891081,0.009922142,0.0025334903,0.9724286,0.0015321551,0.012002628],"study_design_scores_gemma":[0.00001301991,0.00002830627,0.0009395319,0.000041745803,0.000012902632,0.00024131568,0.00015975446,0.15121387,0.003408038,0.83982307,0.0040917913,0.000026645275],"about_ca_topic_score_codex":0.0019072327,"about_ca_topic_score_gemma":0.002327137,"teacher_disagreement_score":0.004103823,"about_ca_system_score_codex":0.0018530833,"about_ca_system_score_gemma":0.0005873974,"threshold_uncertainty_score":0.013728619},"labels":[],"label_agreement":null},{"id":"W2939066948","doi":"10.3390/sym11040556","title":"System Identification Based on Tensor Decompositions: A Trilinear Approach","year":2019,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Multilinear map; Nonlinear system; Tensor (intrinsic definition); Computer science; Context (archaeology); Bilinear interpolation; Nonlinear system identification; System identification; Identification (biology); Linear system; Curse of dimensionality; Mathematical optimization; Algorithm; Applied mathematics; Mathematics; Artificial intelligence; Measure (data warehouse); Data mining","score_opus":0.027529352859798614,"score_gpt":0.3011408063701561,"score_spread":0.2736114535103575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939066948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010455755,0.00023994422,0.9980774,0.000062267165,0.000021573058,0.000010432606,0.000019808316,0.000055311833,0.0004676861],"genre_scores_gemma":[0.26163125,0.0038178037,0.72497094,0.000259927,0.0002766853,0.00025050476,0.00045761574,0.00027409627,0.008061229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935466,0.00023924527,0.00005285478,0.00011748352,0.00017715915,0.000058561065],"domain_scores_gemma":[0.9989513,0.00042087305,0.00016444839,0.0001186965,0.0002775735,0.00006705234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012868189,0.0014243103,0.00095576607,0.0011316113,0.00041871046,0.0012891251,0.0009881133,0.0011688225,0.0024822485],"category_scores_gemma":[0.0022181799,0.000666736,0.0019346986,0.0010103292,0.00095804024,0.0017620937,0.0012829022,0.0020985922,0.0010245465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009479038,0.00008080255,0.0010898052,0.0004669886,0.00019661638,0.00031332375,0.00041178142,0.69564027,0.018452214,0.17913732,0.0026403447,0.10147574],"study_design_scores_gemma":[0.000001913521,0.000018225115,0.00008715513,0.000013733405,0.000009240753,0.000031553063,0.000012757992,0.9847494,0.00070825976,0.013287657,0.0010673577,0.0000127859585],"about_ca_topic_score_codex":0.0041964613,"about_ca_topic_score_gemma":0.0029679015,"teacher_disagreement_score":0.0041964613,"about_ca_system_score_codex":0.000714951,"about_ca_system_score_gemma":0.0010548673,"threshold_uncertainty_score":0.008344054},"labels":[],"label_agreement":null},{"id":"W2950784786","doi":"10.48550/arxiv.1004.4641","title":"Chunky and Equal-Spaced Polynomial Multiplication","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Multiplication (music); Polynomial; Product (mathematics); Feature (linguistics); Computer science; Time complexity; Algorithm; Algebra over a field; Arithmetic; Mathematics; Theoretical computer science; Combinatorics; Pure mathematics","score_opus":0.11378005192518088,"score_gpt":0.24345700891062105,"score_spread":0.12967695698544018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950784786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033088036,0.0002845729,0.95923686,0.00030883233,0.00012593761,0.000041860607,0.0001007011,0.0006798164,0.006133222],"genre_scores_gemma":[0.41908193,0.00033852892,0.5654005,0.00019641321,0.0002633567,0.0001110981,0.00027204296,0.00045501787,0.013881143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.00036153547,0.000088861416,0.0004277328,0.0005001461,0.00023814772],"domain_scores_gemma":[0.9961255,0.0012412515,0.00033696525,0.0015706135,0.0005110829,0.00021449845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013368336,0.0006789885,0.0008659418,0.0011214227,0.0009248833,0.0016536374,0.0013252293,0.0007837367,0.009566372],"category_scores_gemma":[0.009366481,0.00038444137,0.0007233501,0.0013464233,0.0025154671,0.0045506777,0.0034015067,0.0019186009,0.0023138083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042473368,0.00007669067,0.0013277632,0.00014717637,0.00003829788,0.0001395776,0.00036644164,0.050865296,0.009431422,0.7049664,0.007945353,0.22427079],"study_design_scores_gemma":[0.000030318193,0.00009988297,0.00042840507,0.000029471728,0.000022256976,0.00020234124,0.000108763896,0.39984235,0.010153077,0.5765137,0.012538144,0.00003128835],"about_ca_topic_score_codex":0.0011984423,"about_ca_topic_score_gemma":0.0016151429,"teacher_disagreement_score":0.009566372,"about_ca_system_score_codex":0.000873977,"about_ca_system_score_gemma":0.00081196224,"threshold_uncertainty_score":0.032002687},"labels":[],"label_agreement":null},{"id":"W2951215707","doi":"10.48550/arxiv.1609.08063","title":"Modeling Parallel Wiener-Hammerstein Systems Using Tensor Decomposition of Volterra Kernels","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Nonlinear system identification; Block (permutation group theory); Interpretability; Tensor (intrinsic definition); Nonlinear system; Identification (biology); Kernel (algebra); System identification; Mathematics; Tensor decomposition; Computer science; Mathematical optimization; Artificial intelligence; Discrete mathematics; Data modeling; Pure mathematics","score_opus":0.20521471365683042,"score_gpt":0.2744396346288421,"score_spread":0.06922492097201166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951215707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015546278,0.000098010474,0.9831297,0.00005485561,0.000017739138,0.0000148220715,0.000038842587,0.00016742361,0.00093241996],"genre_scores_gemma":[0.6363827,0.0006597118,0.3564525,0.00005420899,0.00005413099,0.00010613605,0.00023850481,0.00019815328,0.0058539575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997278,0.000097309094,0.000021108124,0.000054436678,0.00006992134,0.0000294412],"domain_scores_gemma":[0.99936074,0.00025812874,0.00012807689,0.000111228546,0.00010642461,0.000035452154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007635298,0.00084851,0.0006084336,0.0005797114,0.00028360527,0.00094875955,0.0006280967,0.0006920587,0.0017014772],"category_scores_gemma":[0.0018472861,0.00042569824,0.0009207171,0.0004987367,0.00064906356,0.0014879197,0.0007624908,0.00086213445,0.00043563952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059978687,0.000034780533,0.0009522654,0.00009011856,0.00006317769,0.00013660469,0.00012755624,0.8797174,0.0147813605,0.076000035,0.0005671992,0.027469505],"study_design_scores_gemma":[0.0000013058075,0.0000067777323,0.000076432385,0.0000027981755,0.0000035853536,0.000012508125,0.000005248481,0.99058986,0.00066378445,0.0083604045,0.000272621,0.000004624777],"about_ca_topic_score_codex":0.0044455845,"about_ca_topic_score_gemma":0.0035856923,"teacher_disagreement_score":0.0044455845,"about_ca_system_score_codex":0.00054462376,"about_ca_system_score_gemma":0.00072755,"threshold_uncertainty_score":0.008839428},"labels":[],"label_agreement":null},{"id":"W2951244983","doi":"10.48550/arxiv.1405.2096","title":"Optimization on the Hierarchical Tucker manifold - applications to tensor completion","year":2014,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Tensor (intrinsic definition); Subspace topology; Mathematical optimization; Overfitting; Manifold (fluid mechanics); Computer science; Conjugate gradient method; Scalability; Algorithm; Optimization problem; Gradient descent; Mathematics; Theoretical computer science; Artificial intelligence; Artificial neural network; Pure mathematics","score_opus":0.11241534572183058,"score_gpt":0.3412388485841592,"score_spread":0.2288235028623286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951244983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002187608,0.00011554849,0.9968945,0.00012497859,0.000015105408,0.000014900337,0.00003995329,0.0001757338,0.00043170896],"genre_scores_gemma":[0.144439,0.0006871425,0.85047776,0.00015544675,0.00014886925,0.00018998295,0.0004678372,0.00039074183,0.0030433023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988084,0.0004933689,0.00005796015,0.00025145788,0.00029881188,0.00008999717],"domain_scores_gemma":[0.9970579,0.0016644045,0.0002482447,0.000450718,0.00042287732,0.0001558087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022347015,0.0015256904,0.0013634508,0.0008902301,0.00060592237,0.0011290745,0.0012606797,0.0013461008,0.0029376992],"category_scores_gemma":[0.008505092,0.00056342396,0.00093393907,0.0013423593,0.0017809498,0.0025524392,0.0018450577,0.002458806,0.001117725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061001294,0.00005725428,0.00038935026,0.00018747908,0.000039818584,0.000071336646,0.00009372806,0.798092,0.0040778564,0.13818468,0.0039845314,0.054760914],"study_design_scores_gemma":[0.0000049020796,0.000018233839,0.00004926885,0.000005825273,0.0000024442065,0.000012602934,0.00000808352,0.9611901,0.00069494,0.037011877,0.0009958263,0.0000059624035],"about_ca_topic_score_codex":0.0042070276,"about_ca_topic_score_gemma":0.005031621,"teacher_disagreement_score":0.0042070276,"about_ca_system_score_codex":0.0011410292,"about_ca_system_score_gemma":0.0015965588,"threshold_uncertainty_score":0.011818349},"labels":[],"label_agreement":null},{"id":"W2951364546","doi":"10.48550/arxiv.math/0609054","title":"On the ideals of Secant Varieties to certain rational varieties","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Embedding; Variety (cybernetics); Pure mathematics; Product (mathematics); Projective variety; Projective test; Geometry; Computer science; Statistics","score_opus":0.08873804861913319,"score_gpt":0.32764793151689753,"score_spread":0.23890988289776433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951364546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8034347,0.0011823679,0.0718202,0.0013957779,0.00025822077,0.00007943848,0.00018717826,0.0002369323,0.12140526],"genre_scores_gemma":[0.9609982,0.0008126905,0.013663063,0.00017489337,0.00040564188,0.000052476567,0.00027260426,0.00012622085,0.023494218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990644,0.00023022048,0.000052986477,0.00015314828,0.00025766782,0.00024162984],"domain_scores_gemma":[0.99910444,0.00021158016,0.0001866412,0.00007298263,0.00016691524,0.00025747597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010218399,0.000734604,0.000630402,0.0021423602,0.0015447764,0.0027366087,0.0005425856,0.00047794633,0.00560479],"category_scores_gemma":[0.0018934673,0.00045567454,0.0010908211,0.0011439692,0.0042125923,0.0031363205,0.0022521396,0.0018534828,0.00074342196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004361135,0.000028592187,0.0005239877,0.0000255469,0.000006481149,0.00013903677,0.0006474536,0.0007824284,0.0014001031,0.99258196,0.00074947765,0.0030712835],"study_design_scores_gemma":[0.000029877523,0.00006648624,0.0016773053,0.000026959704,0.000021876505,0.00033976563,0.00056785106,0.012370906,0.002591619,0.97219527,0.010088427,0.000023642777],"about_ca_topic_score_codex":0.0019653805,"about_ca_topic_score_gemma":0.0014174349,"teacher_disagreement_score":0.00560479,"about_ca_system_score_codex":0.001818394,"about_ca_system_score_gemma":0.00062836614,"threshold_uncertainty_score":0.018749952},"labels":[],"label_agreement":null},{"id":"W2951706336","doi":"10.48550/arxiv.1306.2663","title":"Large Margin Low Rank Tensor Analysis","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Generalization; Computer science; Artificial intelligence; Nonlinear dimensionality reduction; Manifold (fluid mechanics); Margin (machine learning); Pattern recognition (psychology); Curse of dimensionality; Dimensionality reduction; Similarity (geometry); Rank (graph theory); Euclidean space; Object (grammar); Cognition; Feature vector; Mathematics; Machine learning; Pure mathematics; Image (mathematics); Psychology","score_opus":0.08061920354587528,"score_gpt":0.2293455989999257,"score_spread":0.14872639545405042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951706336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00785923,0.000657899,0.9880056,0.0007340822,0.00006266169,0.000035751596,0.00028331525,0.00088216225,0.0014793816],"genre_scores_gemma":[0.5317197,0.0025670957,0.44489655,0.00059826387,0.00074580644,0.00031331528,0.0037850873,0.00052853604,0.014845682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986463,0.00058720616,0.00006904133,0.00030066445,0.0002971446,0.00009966576],"domain_scores_gemma":[0.9971136,0.0010410196,0.0004201729,0.00076132326,0.0005292133,0.00013464567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024353492,0.0019609148,0.0015590814,0.0011970904,0.0006819285,0.0018688046,0.0013031792,0.0013532116,0.0039134254],"category_scores_gemma":[0.007907973,0.00048179092,0.00092442834,0.001256536,0.0015574552,0.002122459,0.0015847839,0.0025127085,0.0026162758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002918606,0.00016491044,0.0018840404,0.00053473725,0.00022716321,0.00020447673,0.00016798412,0.46779048,0.009068358,0.15340972,0.035357412,0.33089888],"study_design_scores_gemma":[0.000007590925,0.000035340177,0.00026735416,0.000013525166,0.000009123785,0.000032512864,0.000015285324,0.9331396,0.0009971391,0.0631782,0.0022911683,0.00001321585],"about_ca_topic_score_codex":0.0028154135,"about_ca_topic_score_gemma":0.0028017808,"teacher_disagreement_score":0.0039134254,"about_ca_system_score_codex":0.00095949497,"about_ca_system_score_gemma":0.0015577051,"threshold_uncertainty_score":0.013091743},"labels":[],"label_agreement":null},{"id":"W2952042704","doi":"10.48550/arxiv.1111.6091","title":"An adaptive algebraic multigrid algorithm for low-rank canonical tensor decomposition","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Rank (graph theory); Tensor (intrinsic definition); Mathematics; Relaxation (psychology); Computation; Algebraic number; Multiplicative function; Algorithm; Decomposition; Applied mathematics; Mathematical optimization; Pure mathematics; Mathematical analysis; Combinatorics","score_opus":0.12335943587844318,"score_gpt":0.26682248994398045,"score_spread":0.14346305406553728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952042704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030837161,0.00005076877,0.99556315,0.00005482606,0.000025806923,0.000022303997,0.000025482534,0.00028496832,0.0008889118],"genre_scores_gemma":[0.06543135,0.000097913726,0.9319155,0.000048032234,0.00003553679,0.000088888286,0.00016506805,0.00022902508,0.0019886522],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961483,0.000108130094,0.000020194011,0.00005835635,0.00017152767,0.000027026852],"domain_scores_gemma":[0.99951553,0.00014751776,0.00003944199,0.00011530679,0.00014857072,0.00003359266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151444,0.00045189608,0.000528105,0.0005610331,0.0004725343,0.0006268898,0.00096466707,0.00058761216,0.0024618967],"category_scores_gemma":[0.0018642623,0.00024152575,0.00070551684,0.00060191134,0.0005613174,0.0008021237,0.0012741928,0.0011981067,0.0010341154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013043992,0.00009595096,0.0011412714,0.00019892615,0.000083990875,0.00013878163,0.0002639866,0.39055246,0.031598423,0.16717502,0.00711327,0.40150735],"study_design_scores_gemma":[0.000009567277,0.000023339708,0.00009644563,0.0000053606736,0.0000059198032,0.00003390503,0.000009957581,0.98102623,0.002511017,0.011435009,0.0048344815,0.000008649036],"about_ca_topic_score_codex":0.0021103716,"about_ca_topic_score_gemma":0.002915255,"teacher_disagreement_score":0.0024618967,"about_ca_system_score_codex":0.00039931014,"about_ca_system_score_gemma":0.00073811336,"threshold_uncertainty_score":0.008235931},"labels":[],"label_agreement":null},{"id":"W2953019997","doi":"10.1103/physrevb.100.235118","title":"Tensor renormalization group centered about a core tensor","year":2019,"lang":"en","type":"article","venue":"Physical review. B./Physical review. B","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Canada First Research Excellence Fund","keywords":"Renormalization group; Mathematics; Scaling; Tensor (intrinsic definition); Lattice (music); Granularity; Row; Statistical physics; Pure mathematics; Physics; Mathematical physics; Geometry; Computer science","score_opus":0.049859046473733876,"score_gpt":0.4146013800713177,"score_spread":0.3647423335975838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953019997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024767945,0.00015008377,0.96518445,0.0003267497,0.00016039521,0.000056485525,0.00007413279,0.0009118476,0.008368047],"genre_scores_gemma":[0.2778143,0.0002731669,0.7118097,0.00030210748,0.0001367654,0.0002048242,0.00024739804,0.00089083554,0.008320866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955124,0.00012655987,0.000016320459,0.00005777713,0.00018681731,0.00006126319],"domain_scores_gemma":[0.99901617,0.00021773991,0.000076877426,0.00037390483,0.00023091937,0.000084316656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011185745,0.0007262871,0.0009858077,0.0009287344,0.0007890351,0.0014696115,0.0022139014,0.0011306885,0.0054405495],"category_scores_gemma":[0.00300506,0.00043669724,0.0012091973,0.00078075577,0.001452192,0.0024215898,0.0011823474,0.0014268617,0.0014996442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012823245,0.00008788786,0.0006963615,0.0001136781,0.00005600656,0.00011940468,0.00012949604,0.23159844,0.011576531,0.7125569,0.0037618207,0.03917523],"study_design_scores_gemma":[0.00001273893,0.00001830123,0.00008239014,0.000005722512,0.0000061887854,0.00001917329,0.000009512054,0.8764242,0.0014767121,0.1200882,0.0018450947,0.0000118777725],"about_ca_topic_score_codex":0.0026544237,"about_ca_topic_score_gemma":0.0028007524,"teacher_disagreement_score":0.0054405495,"about_ca_system_score_codex":0.0011815227,"about_ca_system_score_gemma":0.0017803828,"threshold_uncertainty_score":0.018200517},"labels":[],"label_agreement":null},{"id":"W2953272550","doi":"10.48550/arxiv.1106.5068","title":"Cayley's hyperdeterminant: a combinatorial approach via representation theory","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Invariant (physics); Enumeration; Combinatorics; Integer (computer science); Representation theory; Polynomial; Homogeneous; Simple (philosophy); Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.14773369026133498,"score_gpt":0.24335563586643014,"score_spread":0.09562194560509515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953272550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18999912,0.0029548933,0.6761255,0.0026632452,0.0006644903,0.00010778076,0.00035316433,0.0004406222,0.12669115],"genre_scores_gemma":[0.7737668,0.0023936138,0.19767325,0.00058121624,0.0008880518,0.00013559102,0.00034243357,0.00019647267,0.02402249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952257,0.00014529393,0.000022441593,0.000094946285,0.00015203182,0.00006280338],"domain_scores_gemma":[0.99942243,0.0001975285,0.0000737171,0.000118686585,0.00011358392,0.0000740823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067091774,0.00065462454,0.0006209491,0.002338025,0.0010342854,0.0027914776,0.0010210241,0.0007751346,0.004970016],"category_scores_gemma":[0.0013337313,0.00034604224,0.0007454807,0.0019887176,0.0029271604,0.0038531993,0.0013654701,0.0020243726,0.00079750165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057105362,0.000009496059,0.0000850643,0.00002259485,0.000002478717,0.000047221594,0.00011126285,0.0011334965,0.00071683637,0.99051875,0.0007302947,0.006616796],"study_design_scores_gemma":[0.0000038454887,0.000011611452,0.00007673694,0.000009641005,0.0000025756647,0.00007823232,0.00005872896,0.0097652,0.00056268723,0.98529017,0.0041316217,0.000008861962],"about_ca_topic_score_codex":0.00068437384,"about_ca_topic_score_gemma":0.0008524915,"teacher_disagreement_score":0.004970016,"about_ca_system_score_codex":0.001070671,"about_ca_system_score_gemma":0.00050962577,"threshold_uncertainty_score":0.016626358},"labels":[],"label_agreement":null},{"id":"W2954734636","doi":"10.1109/tem.2019.2912928","title":"Tensor-Train-Based High-Order Dominant Eigen Decomposition for Multimodal Prediction Services","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Engineering Management","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities; Shenzhen Fundamental Research Program; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Computation; Tensor (intrinsic definition); Big data; Curse of dimensionality; Data mining; Artificial intelligence; Algorithm; Machine learning; Mathematics; Database","score_opus":0.009589296351073215,"score_gpt":0.2542805308584959,"score_spread":0.24469123450742267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954734636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009281813,0.00010989174,0.9884465,0.00014266105,0.00004650789,0.000029700906,0.00014266664,0.0010201542,0.0007801087],"genre_scores_gemma":[0.37049627,0.00041093645,0.62225235,0.00017405555,0.00012255683,0.00015453841,0.0015211749,0.000327492,0.004540625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958915,0.00007629547,0.000032344593,0.00009188362,0.0001453176,0.00006507527],"domain_scores_gemma":[0.9993292,0.00014353577,0.00006832676,0.00015105875,0.00023085542,0.00007695426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005653304,0.0012709317,0.0006833493,0.00066312513,0.0005938165,0.0010185203,0.0010002876,0.0005293286,0.0038740989],"category_scores_gemma":[0.0026437896,0.00034686667,0.00077347114,0.0009860735,0.00057205267,0.0022401784,0.0014540144,0.0014718713,0.0012960421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003537352,0.00018762492,0.004299031,0.00017525011,0.00012020999,0.00027287236,0.0002738547,0.45701265,0.019904714,0.04306138,0.014890689,0.459448],"study_design_scores_gemma":[0.000003826499,0.000012822686,0.00013158997,0.0000028774473,0.000004389534,0.000016154268,0.00001867144,0.99121547,0.0015120119,0.006191992,0.000883903,0.0000062393033],"about_ca_topic_score_codex":0.009713567,"about_ca_topic_score_gemma":0.011608878,"teacher_disagreement_score":0.009713567,"about_ca_system_score_codex":0.0007883429,"about_ca_system_score_gemma":0.0015274406,"threshold_uncertainty_score":0.01931405},"labels":[],"label_agreement":null},{"id":"W2963626304","doi":"10.1002/nla.1963","title":"A nonlinearly preconditioned conjugate gradient algorithm for rank‐<i>R</i> canonical tensor approximation","year":2014,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Preconditioner; Conjugate gradient method; Convergence (economics); Mathematics; Rank (graph theory); Tensor (intrinsic definition); Acceleration; Nonlinear conjugate gradient method; Nonlinear system; Algorithm; Applied mathematics; Mathematical optimization; Computer science; Iterative method; Pure mathematics; Gradient descent; Combinatorics; Artificial intelligence; Artificial neural network","score_opus":0.019395089764698913,"score_gpt":0.28877605997942274,"score_spread":0.26938097021472385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963626304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049614203,0.000057821322,0.99281245,0.00012666052,0.000039253926,0.00003596129,0.000029614708,0.00048617265,0.0014507736],"genre_scores_gemma":[0.107049845,0.00012026452,0.88813365,0.00009887305,0.000055174707,0.000121934594,0.0002160515,0.00031942496,0.0038847327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993734,0.00022022336,0.00003991072,0.0001045149,0.00019130454,0.00007071319],"domain_scores_gemma":[0.9989557,0.00040056696,0.00009674492,0.00017188504,0.00030066472,0.000074472344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009164944,0.00093784294,0.00073643343,0.00049391703,0.00046240562,0.00087835785,0.000976389,0.0009052016,0.004719144],"category_scores_gemma":[0.0028596325,0.0003501706,0.00078026,0.0005788427,0.0009303245,0.00073370576,0.00126691,0.0016009657,0.002123911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021657735,0.00011315697,0.0010693215,0.00019748199,0.000059183607,0.0001817732,0.00020290956,0.6603172,0.017067391,0.06990583,0.010650511,0.24001874],"study_design_scores_gemma":[0.000009691052,0.000017578745,0.00005269067,0.0000045250176,0.000002278416,0.00001873712,0.0000075465705,0.99294794,0.001641512,0.004119522,0.0011723563,0.0000056896315],"about_ca_topic_score_codex":0.0064779683,"about_ca_topic_score_gemma":0.0059862263,"teacher_disagreement_score":0.0064779683,"about_ca_system_score_codex":0.00062531955,"about_ca_system_score_gemma":0.0019881157,"threshold_uncertainty_score":0.015787065},"labels":[],"label_agreement":null},{"id":"W2964162214","doi":"10.1090/proc/14274","title":"On the first and second eigenvalue of finite and infinite uniform hypergraphs","year":2018,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Science Foundation of Jiangxi Province; Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Government of Jiangxi Province; National Natural Science Foundation of China","keywords":"Eigenvalues and eigenvectors; Mathematics; Pure mathematics; Finite set; Combinatorics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.02147293581004314,"score_gpt":0.27051273084178634,"score_spread":0.2490397950317432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964162214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29200855,0.006422183,0.5252249,0.0056814775,0.00089415273,0.00006717471,0.0007197543,0.0011687976,0.16781305],"genre_scores_gemma":[0.9254402,0.0030093775,0.044711944,0.00083210564,0.0015486362,0.00023985276,0.00065682223,0.00067256053,0.022888523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983803,0.0005021882,0.0000622964,0.00031033155,0.00038213612,0.00036273757],"domain_scores_gemma":[0.97084653,0.022330383,0.0015651312,0.0014133945,0.0019439737,0.0019005848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002645096,0.0014623307,0.0011703076,0.0043136906,0.0015947403,0.0033584402,0.0016277969,0.0015096578,0.010692638],"category_scores_gemma":[0.019478643,0.000709854,0.00086895126,0.0019679526,0.0044072648,0.006941721,0.0029235235,0.004037272,0.0017271716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001435635,0.000052229832,0.0008723039,0.00019990526,0.000025049945,0.00013687956,0.00042901142,0.009606674,0.0034045791,0.9669076,0.006207198,0.012014925],"study_design_scores_gemma":[0.00001345787,0.000024048997,0.0007869797,0.000076141,0.00001677711,0.00015870598,0.00014506653,0.04522548,0.0013377634,0.94981766,0.0023604133,0.00003757029],"about_ca_topic_score_codex":0.0010425915,"about_ca_topic_score_gemma":0.0012444538,"teacher_disagreement_score":0.010692638,"about_ca_system_score_codex":0.0019126202,"about_ca_system_score_gemma":0.00065487885,"threshold_uncertainty_score":0.035770416},"labels":[],"label_agreement":null},{"id":"W2964285749","doi":"10.1016/j.laa.2013.03.021","title":"On Kruskal’s theorem that every 3 × 3 × 3 array has rank at most 5","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Mathematics; Rank (graph theory); Kruskal's algorithm; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Spanning tree","score_opus":0.03849920406538472,"score_gpt":0.28142836041825625,"score_spread":0.24292915635287154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964285749","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08888374,0.0028423127,0.3717393,0.01208725,0.0041418932,0.00019931966,0.0020046134,0.0015765062,0.51652503],"genre_scores_gemma":[0.6450026,0.0023748204,0.14474408,0.009010149,0.0049897954,0.00041080595,0.0020862725,0.0010235471,0.19035794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981571,0.0003005375,0.000091531576,0.0005843371,0.0005449993,0.00032159808],"domain_scores_gemma":[0.9967746,0.0012438791,0.00028533983,0.00073873246,0.00071403914,0.00024347618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013481638,0.0011943278,0.0010836775,0.0018655901,0.0022306521,0.0028501712,0.0011233713,0.0013078712,0.021741461],"category_scores_gemma":[0.006424689,0.0006565177,0.001249635,0.002063466,0.0046934243,0.00921528,0.003995683,0.0039975033,0.006403117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015457829,0.000045417164,0.00037820486,0.00011878632,0.000030441433,0.00010168621,0.00039101334,0.0012261155,0.0020220801,0.92063016,0.038892332,0.03600918],"study_design_scores_gemma":[0.00001793964,0.000026943433,0.0003260583,0.000034336448,0.000019592027,0.00016573512,0.000105161154,0.0019416431,0.001013511,0.9656641,0.030650897,0.000034082594],"about_ca_topic_score_codex":0.001420512,"about_ca_topic_score_gemma":0.0016916463,"teacher_disagreement_score":0.021741461,"about_ca_system_score_codex":0.0010869944,"about_ca_system_score_gemma":0.0010236235,"threshold_uncertainty_score":0.07273239},"labels":[],"label_agreement":null},{"id":"W2970059119","doi":"10.1109/icip.2019.8803602","title":"Point Cloud Denoising Based on Tensor Tucker Decomposition","year":2019,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Tucker decomposition; Tensor (intrinsic definition); Point cloud; Thresholding; Noise reduction; Laplacian matrix; Computer science; Gaussian noise; Noise (video); Algorithm; Point (geometry); Mathematics; Tensor decomposition; Laplace operator; Artificial intelligence; Mathematical analysis; Geometry; Image (mathematics)","score_opus":0.026172830167646488,"score_gpt":0.3229735169913719,"score_spread":0.2968006868237254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970059119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006278797,0.00015403627,0.9924638,0.00007526081,0.000038787824,0.000023323788,0.000038640657,0.00055691204,0.00037039458],"genre_scores_gemma":[0.11839329,0.0005308882,0.8774804,0.000118324046,0.00010921813,0.000081882084,0.00055133266,0.00030563795,0.0024289868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903345,0.00011521348,0.00005748532,0.00022428697,0.0004655767,0.000103997605],"domain_scores_gemma":[0.998796,0.00025383476,0.00016430383,0.00026153715,0.00045017857,0.00007407062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096835825,0.0011762489,0.0017137685,0.0020261267,0.000552835,0.00130479,0.0014578286,0.0012866558,0.001549267],"category_scores_gemma":[0.0030696003,0.000513908,0.0015674,0.0019186767,0.0008877453,0.0019491934,0.0011794751,0.001960368,0.001156305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040326556,0.00009465379,0.0015772174,0.0002782892,0.00015333146,0.00024635173,0.00026393638,0.2194143,0.10103124,0.021244496,0.0060483697,0.64924455],"study_design_scores_gemma":[0.00000993653,0.000035839475,0.00041020982,0.000009038224,0.000017106759,0.000122152,0.00002189879,0.9798498,0.0136123,0.0037116455,0.0021793775,0.000020696536],"about_ca_topic_score_codex":0.006678791,"about_ca_topic_score_gemma":0.0052863513,"teacher_disagreement_score":0.006678791,"about_ca_system_score_codex":0.00075036904,"about_ca_system_score_gemma":0.0010065933,"threshold_uncertainty_score":0.013279855},"labels":[],"label_agreement":null},{"id":"W2972517792","doi":"10.1515/forum-2019-0275","title":"On hyperquadrics containing projective varieties","year":2020,"lang":"en","type":"preprint","venue":"Forum Mathematicum","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Research Foundation of Korea","keywords":"Variety (cybernetics); Mathematics; Codimension; Projective variety; Lemma (botany); Pure mathematics; Projective space; Degree (music); Fano plane; Generalization; Twisted cubic; Quadratic equation; Projective test; Combinatorics; Discrete mathematics; Mathematical analysis; Complex projective space; Geometry; Physics","score_opus":0.08712281804060903,"score_gpt":0.3454514891998677,"score_spread":0.2583286711592586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972517792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88998574,0.002189026,0.023358798,0.0005462142,0.00019260996,0.0000804766,0.00047218273,0.0001494821,0.08302545],"genre_scores_gemma":[0.98327947,0.0006191008,0.004006497,0.00008263601,0.00025934482,0.00003275012,0.0006652309,0.00003132002,0.011023538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986726,0.00021681274,0.00006632024,0.00029652088,0.000396936,0.00035084542],"domain_scores_gemma":[0.9990671,0.00024885172,0.0002273997,0.00007133965,0.00013993798,0.00024537687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006295573,0.00070896297,0.00085346686,0.0032216096,0.002279094,0.0029820434,0.00085963175,0.0006934191,0.0074182926],"category_scores_gemma":[0.0012722779,0.0005714614,0.00093900494,0.0022232165,0.003218379,0.0026524893,0.0022924927,0.0018355183,0.0009637443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001791054,0.000054915672,0.003566146,0.00014566278,0.00003740565,0.0007762138,0.00079752895,0.003563443,0.006683301,0.96371114,0.0022666515,0.018218443],"study_design_scores_gemma":[0.00007974424,0.0002769534,0.017608246,0.00013593443,0.00007695149,0.0020760929,0.00095569517,0.021907113,0.0054523265,0.9226848,0.028644564,0.00010155785],"about_ca_topic_score_codex":0.002285583,"about_ca_topic_score_gemma":0.0015886902,"teacher_disagreement_score":0.0074182926,"about_ca_system_score_codex":0.002007391,"about_ca_system_score_gemma":0.00034899532,"threshold_uncertainty_score":0.024816692},"labels":[],"label_agreement":null},{"id":"W2979740536","doi":"10.1145/3323926","title":"A Distributed Tensor-Train Decomposition Method for Cyber-Physical-Social Services","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Cyber-Physical Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; St. Francis Xavier University","funders":"","keywords":"Tensor (intrinsic definition); Decomposition; Computer science; Tensor decomposition; Representation (politics); Scale (ratio); Big data; Order (exchange); Interpretation (philosophy); Theoretical computer science; Distributed computing; Mathematics; Data mining; Pure mathematics; Geography; Ecology; Programming language; Cartography","score_opus":0.02929942267681448,"score_gpt":0.357332827020621,"score_spread":0.32803340434380657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979740536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020216273,0.00021764729,0.9960783,0.0001557964,0.000099036646,0.00004292773,0.00012986464,0.0004655546,0.00078917044],"genre_scores_gemma":[0.10435434,0.001036405,0.8832632,0.00024999652,0.00024117388,0.00031987272,0.0016634486,0.0005948256,0.008276837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999456,0.00016056077,0.000039715058,0.000119966484,0.0001446843,0.00007913663],"domain_scores_gemma":[0.99941254,0.00013182433,0.00006139212,0.00008735929,0.00022324725,0.00008362412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009108923,0.0016202674,0.0009315206,0.0008995489,0.0007484637,0.0014419566,0.0014308841,0.0011287174,0.007015183],"category_scores_gemma":[0.0020648264,0.00049369934,0.0017391011,0.0011334303,0.0007006049,0.0018498764,0.0016603288,0.002245798,0.0027062974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003554727,0.00023697072,0.0020499825,0.00046241103,0.00021619601,0.0003728659,0.0003574096,0.39802298,0.016577438,0.06714849,0.034138422,0.48006126],"study_design_scores_gemma":[0.000007440076,0.000017882385,0.0000989899,0.000008582386,0.000010323072,0.00002888933,0.000028974782,0.990173,0.00073518825,0.0053397175,0.003541133,0.000009786747],"about_ca_topic_score_codex":0.012335531,"about_ca_topic_score_gemma":0.010746177,"teacher_disagreement_score":0.012335531,"about_ca_system_score_codex":0.0008627335,"about_ca_system_score_gemma":0.0019785997,"threshold_uncertainty_score":0.02452749},"labels":[],"label_agreement":null},{"id":"W2981420153","doi":"10.1111/1365-2478.12894","title":"Random noise attenuation via the randomized canonical polyadic decomposition","year":2019,"lang":"en","type":"article","venue":"Geophysical Prospecting","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Singular value decomposition; Rank (graph theory); Noise (video); Tensor (intrinsic definition); Algorithm; Noise reduction; Low-rank approximation; Mathematics; Matrix decomposition; Computer science; Filter (signal processing); Artificial intelligence; Physics; Geometry","score_opus":0.014226423740965796,"score_gpt":0.3005228603434406,"score_spread":0.28629643660247484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981420153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005272192,0.00008586653,0.99356854,0.00007948887,0.000032070653,0.000020001356,0.000029257833,0.00022824552,0.0006842829],"genre_scores_gemma":[0.22667122,0.0003658721,0.7685432,0.00020816605,0.0001008272,0.0001663154,0.00037274224,0.00019592782,0.0033759007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780315,0.00072603964,0.00009538606,0.0004194366,0.0007974335,0.00015857164],"domain_scores_gemma":[0.9983944,0.0005306858,0.00016022695,0.00025762842,0.0005718612,0.000085113104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017265446,0.0013685315,0.001100795,0.0009371985,0.0006493723,0.0011539469,0.0011197308,0.0008693505,0.002456843],"category_scores_gemma":[0.004102157,0.00044510065,0.0010785403,0.001365617,0.0010946133,0.0015978789,0.0011264832,0.0014535333,0.001029719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025078218,0.00011960195,0.0007642602,0.00015286822,0.000098003744,0.00013426872,0.00010747184,0.6811336,0.020112785,0.07202496,0.0054105474,0.21969087],"study_design_scores_gemma":[0.0000057549105,0.00002132773,0.000070519956,0.0000036318445,0.000005653695,0.000018474184,0.000008909019,0.9933876,0.0020519209,0.00352791,0.0008894398,0.000008865066],"about_ca_topic_score_codex":0.006225185,"about_ca_topic_score_gemma":0.0065063685,"teacher_disagreement_score":0.006225185,"about_ca_system_score_codex":0.00080094865,"about_ca_system_score_gemma":0.0019486998,"threshold_uncertainty_score":0.012377918},"labels":[],"label_agreement":null},{"id":"W2988137070","doi":"10.1002/nla.2297","title":"Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Acceleration; Mathematics; Gradient descent; Nonlinear system; Conjugate gradient method; Robustness (evolution); Tensor (intrinsic definition); Nonlinear conjugate gradient method; Mathematical optimization; Line search; Applied mathematics; Algorithm; Rate of convergence; Computer science; Artificial intelligence; Geometry; Key (lock)","score_opus":0.03470059674419496,"score_gpt":0.3201134359785043,"score_spread":0.2854128392343093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988137070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125349695,0.00016181065,0.9842743,0.00012550829,0.00007000534,0.000028332579,0.00003149261,0.0011282756,0.0016452676],"genre_scores_gemma":[0.23480758,0.00022910394,0.75794184,0.00014707143,0.00006148503,0.00014685084,0.00022159758,0.0004971687,0.0059472546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999371,0.0001911365,0.00003768373,0.00008667742,0.00026349633,0.000050008177],"domain_scores_gemma":[0.9987179,0.00040611782,0.00013739547,0.00024218172,0.00042178275,0.00007459177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010353856,0.0010450204,0.0005439444,0.00048143422,0.00041912816,0.0005940571,0.0009692596,0.0006874897,0.0026528512],"category_scores_gemma":[0.0041664303,0.0004007327,0.00055543357,0.00043758444,0.0005775771,0.0008500974,0.0010001494,0.0012367583,0.0013073487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028975235,0.00008893152,0.002175408,0.00017739102,0.00010673483,0.00016761507,0.00023154935,0.5511095,0.02858108,0.038243324,0.007709098,0.37111968],"study_design_scores_gemma":[0.0000069237026,0.000017336095,0.00012646765,0.000005397783,0.0000029578764,0.000015769512,0.0000054328284,0.99338645,0.0031402525,0.0018892003,0.0013964874,0.000007319404],"about_ca_topic_score_codex":0.004962014,"about_ca_topic_score_gemma":0.0067310915,"teacher_disagreement_score":0.004962014,"about_ca_system_score_codex":0.0004515206,"about_ca_system_score_gemma":0.0010780622,"threshold_uncertainty_score":0.009866297},"labels":[],"label_agreement":null},{"id":"W2996814955","doi":"10.18280/ria.330611","title":"A Nonlinear Tensor-Based Machine Learning Algorithm for Image Classification","year":2019,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Beijing Union University","keywords":"Artificial intelligence; Computer science; Tensor (intrinsic definition); Pattern recognition (psychology); Nonlinear system; Image (mathematics); Machine learning; Algorithm; Computer vision; Mathematics; Physics; Geometry","score_opus":0.07057550152249059,"score_gpt":0.33823635606169455,"score_spread":0.26766085453920396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996814955","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011958915,0.00054133974,0.9968874,0.00013987818,0.00007946309,0.00003010311,0.00004852041,0.00041852426,0.00065900054],"genre_scores_gemma":[0.06006802,0.0013886816,0.933595,0.00016373587,0.00019363158,0.00021006746,0.00037041257,0.00016265686,0.003847841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989348,0.00026655511,0.00009759972,0.0002574389,0.0003714116,0.00007217143],"domain_scores_gemma":[0.99883944,0.0003559938,0.00012099564,0.00016066738,0.00048069956,0.00004220781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016263461,0.0012957463,0.0011672226,0.0017271957,0.00072839914,0.0013968174,0.0015068738,0.0012140162,0.0034416101],"category_scores_gemma":[0.004279759,0.00034993966,0.0012366216,0.002628767,0.0010662748,0.0020503688,0.0012747264,0.002315439,0.0027087168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014014484,0.00006799224,0.0006574645,0.00031592173,0.000080540216,0.00007598354,0.00013224268,0.102639146,0.013761157,0.04670142,0.010490264,0.82493764],"study_design_scores_gemma":[0.000007478823,0.000043445543,0.00015577227,0.000018563778,0.000012410954,0.00008411109,0.000014958966,0.9760838,0.0034202382,0.012894636,0.0072434484,0.000020953206],"about_ca_topic_score_codex":0.004465017,"about_ca_topic_score_gemma":0.002802455,"teacher_disagreement_score":0.004465017,"about_ca_system_score_codex":0.001093193,"about_ca_system_score_gemma":0.0013085321,"threshold_uncertainty_score":0.011513293},"labels":[],"label_agreement":null},{"id":"W3000659041","doi":"10.1186/s12859-019-3312-5","title":"Optimization and expansion of non-negative matrix factorization","year":2020,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Institute for Cancer Research","funders":"Natural Sciences and Engineering Research Council of Canada; Prostate Cancer Canada; Government of Ontario; Canadian Institutes of Health Research; Ontario Genomics; Genome Canada; Government of Canada; Ontario Institute for Cancer Research; Ontario Genomics Institute; Movember Foundation","keywords":"Non-negative matrix factorization; Computer science; Matrix (chemical analysis); Matrix decomposition; Computational biology; Biology; Mathematics; Physics; Chemistry","score_opus":0.044048035217136294,"score_gpt":0.30938569971251123,"score_spread":0.26533766449537494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000659041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016201313,0.00024237843,0.99676764,0.00020187958,0.000043686137,0.0000271091,0.00008807119,0.00016540772,0.0008437496],"genre_scores_gemma":[0.07034129,0.000768368,0.9242586,0.00020820124,0.00016877573,0.00026969746,0.0005364539,0.00030437286,0.0031441858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986965,0.00055755686,0.000056350786,0.00025270352,0.00035043916,0.00008651086],"domain_scores_gemma":[0.99658054,0.0019664306,0.00034719642,0.00034832972,0.0006274074,0.00013022883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003053607,0.0014086773,0.0009150195,0.0007842839,0.00048188807,0.0009956132,0.0010234577,0.0013574556,0.0043527395],"category_scores_gemma":[0.010389089,0.00047773428,0.0012512726,0.00086488103,0.0013887198,0.001337394,0.0012804875,0.0020531144,0.0025495065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011784914,0.00008812379,0.00090362894,0.00073161523,0.00008642121,0.0003057685,0.00023637334,0.68007886,0.008995838,0.130224,0.017788822,0.16044265],"study_design_scores_gemma":[0.000010548646,0.00002155662,0.00015868811,0.00003817861,0.00000655494,0.000073969386,0.000017431295,0.95496386,0.0011833787,0.03922664,0.004287324,0.0000119024035],"about_ca_topic_score_codex":0.0031922418,"about_ca_topic_score_gemma":0.0039182,"teacher_disagreement_score":0.0043527395,"about_ca_system_score_codex":0.0009779045,"about_ca_system_score_gemma":0.0017594292,"threshold_uncertainty_score":0.016149223},"labels":[],"label_agreement":null},{"id":"W3008797530","doi":"10.1109/access.2020.2977050","title":"Tensor Completion Methods for Collaborative Intelligence","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Science and Engineering Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tensor (intrinsic definition); Deep learning; Feature (linguistics); Artificial intelligence; Cloud computing; Enhanced Data Rates for GSM Evolution; Pattern recognition (psychology); Big data; Workload; Data mining; Machine learning; Algorithm; Mathematics; Geometry","score_opus":0.32479351335010836,"score_gpt":0.519641986399115,"score_spread":0.1948484730490066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008797530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017662981,0.0014182273,0.9935703,0.00050775113,0.00014602905,0.00003486475,0.000089538604,0.00043334207,0.0020335852],"genre_scores_gemma":[0.16456772,0.0046018157,0.8169811,0.0004102563,0.0007721301,0.00031885848,0.001030181,0.0005880272,0.01072988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984201,0.00057162973,0.00010889111,0.00029324324,0.0004923176,0.00011382301],"domain_scores_gemma":[0.9966517,0.001330186,0.0003780879,0.0006943461,0.0007402358,0.00020555193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028201994,0.0017032591,0.001273226,0.0012753013,0.00063813507,0.0019293224,0.0014120775,0.0013989779,0.005052555],"category_scores_gemma":[0.009254022,0.0006007199,0.0014412414,0.0015744885,0.0018774951,0.002685245,0.0022880535,0.0039204727,0.0025063166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016646122,0.0001008135,0.0012239073,0.0006364838,0.00024117487,0.00013817385,0.00035348695,0.3627733,0.005172221,0.2947248,0.021502312,0.31296694],"study_design_scores_gemma":[0.0000133967,0.000037645998,0.00024095611,0.000040778155,0.000015962607,0.00004768795,0.00003405632,0.8713157,0.0014220147,0.116418526,0.010388413,0.000024817506],"about_ca_topic_score_codex":0.005933212,"about_ca_topic_score_gemma":0.0049007875,"teacher_disagreement_score":0.005933212,"about_ca_system_score_codex":0.0013613106,"about_ca_system_score_gemma":0.0019486591,"threshold_uncertainty_score":0.016902506},"labels":[],"label_agreement":null},{"id":"W3008903234","doi":"10.4230/lipics.ccc.2020.35","title":"Geometric Rank of Tensors and Subrank of Matrix Multiplication","year":2020,"lang":"en","type":"preprint","venue":"UvA-DARE (University of Amsterdam)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Rank (graph theory); Mathematics; Strassen algorithm; Combinatorics; Matrix multiplication; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.04372526490211509,"score_gpt":0.2836267991078776,"score_spread":0.2399015342057625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008903234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3157308,0.0033202076,0.55744255,0.002726756,0.0004509339,0.00007518447,0.0010362013,0.00094139134,0.11827596],"genre_scores_gemma":[0.9479735,0.0014812119,0.035814103,0.00036291542,0.0007852049,0.000073350726,0.0006730961,0.00018931433,0.012647307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981377,0.0004441892,0.00007874418,0.00036146643,0.0006426021,0.00033513975],"domain_scores_gemma":[0.9924615,0.0029040838,0.0012586399,0.0011917189,0.0012281862,0.0009559506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013518886,0.00096077565,0.0007674551,0.0029296123,0.0012202563,0.0034424772,0.00081058155,0.0006525599,0.007876989],"category_scores_gemma":[0.0075722877,0.00034668745,0.0005108144,0.0016613756,0.004276608,0.0063761557,0.00237786,0.0024116256,0.0016746424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004600394,0.000017856157,0.00063851674,0.00005465047,0.000007746666,0.000068384536,0.00017358744,0.0036682042,0.0017112242,0.9804223,0.0025040554,0.010687459],"study_design_scores_gemma":[0.000007672819,0.000044769527,0.0007656622,0.000022093978,0.000010215192,0.00020875083,0.00011759751,0.019711118,0.0023678776,0.9682539,0.008466387,0.000024000545],"about_ca_topic_score_codex":0.00061965885,"about_ca_topic_score_gemma":0.00067150756,"teacher_disagreement_score":0.007876989,"about_ca_system_score_codex":0.0010455546,"about_ca_system_score_gemma":0.0006375092,"threshold_uncertainty_score":0.026351154},"labels":[],"label_agreement":null},{"id":"W3010021662","doi":"10.1038/s41598-020-60884-9","title":"Author Correction: Speed-dependent and mode-dependent modulations of spatiotemporal modules in human locomotion extracted via tensor decomposition","year":2020,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Rehabilitation Institute; University Health Network","funders":"","keywords":"Decomposition; Tensor decomposition; Tensor (intrinsic definition); Computer science; Mode (computer interface); Biological system; Biology; Mathematics; Human–computer interaction; Pure mathematics; Ecology","score_opus":0.049647368760940044,"score_gpt":0.34054069931525466,"score_spread":0.2908933305543146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010021662","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065990526,0.0009214114,0.0050445744,0.015371362,0.9720641,0.000027343352,0.0023905248,0.0014348571,0.0020859067],"genre_scores_gemma":[0.10745513,0.011287832,0.048667822,0.036889486,0.35970747,0.00064951845,0.01749143,0.012020483,0.40583086],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9952443,0.00060183654,0.0008963435,0.0009538689,0.0019437261,0.00035991904],"domain_scores_gemma":[0.9333584,0.012595765,0.0020464673,0.0077630747,0.042215563,0.0020206182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005370046,0.0021960218,0.0023031181,0.0040910062,0.0028352153,0.0032992188,0.0034752109,0.004058181,0.12431249],"category_scores_gemma":[0.09617684,0.00094898336,0.0019274217,0.004392418,0.0018672042,0.003166339,0.0033942885,0.0055045392,0.060550597],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008198795,0.0000070536794,0.00018697772,0.00034286082,0.000030673935,0.00020308998,0.0001053183,0.000120486795,0.00035058256,0.0019323268,0.982691,0.013947738],"study_design_scores_gemma":[0.000086951804,0.00005529608,0.0025719912,0.0005904276,0.00012227768,0.0012177419,0.0002675343,0.0015345967,0.0028470703,0.0068086213,0.98378724,0.00011028636],"about_ca_topic_score_codex":0.0062330132,"about_ca_topic_score_gemma":0.008975007,"teacher_disagreement_score":0.12431249,"about_ca_system_score_codex":0.0019959756,"about_ca_system_score_gemma":0.0050335196,"threshold_uncertainty_score":0.41586673},"labels":[],"label_agreement":null},{"id":"W3011285915","doi":"10.1016/j.jcta.2019.105190","title":"The partition rank of a tensor and k-right corners in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math>","year":2020,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Partition (number theory); Combinatorics; Rank (graph theory); Discrete mathematics","score_opus":0.01948802082768114,"score_gpt":0.2484689187412446,"score_spread":0.22898089791356346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011285915","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2967947,0.00274119,0.21215756,0.0053885835,0.0035692633,0.00016047146,0.00638678,0.002339267,0.47046214],"genre_scores_gemma":[0.8305182,0.0012723319,0.028947419,0.0006829952,0.0011688543,0.00010887404,0.003436437,0.0017833475,0.13208154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895155,0.00016919612,0.000058441947,0.00021455852,0.0002948523,0.00031136879],"domain_scores_gemma":[0.9975369,0.0006853707,0.0003420689,0.00034957757,0.00057840155,0.0005075798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056355,0.0010247729,0.00091770076,0.003355824,0.0021423264,0.0066384743,0.0010526628,0.0009922141,0.053929444],"category_scores_gemma":[0.0035681296,0.00055652525,0.00090383214,0.0019165714,0.0029481694,0.0058234483,0.0016816373,0.0025420033,0.012899715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018081474,0.000045529687,0.00058306236,0.000093576,0.000015430996,0.000179945,0.000500043,0.0011322222,0.0023716672,0.9517226,0.025450015,0.01772515],"study_design_scores_gemma":[0.000026864169,0.00006517136,0.0014906125,0.00009262699,0.000033233046,0.00042122035,0.00053060194,0.008938789,0.004829797,0.9423151,0.041161414,0.00009448381],"about_ca_topic_score_codex":0.0036725318,"about_ca_topic_score_gemma":0.004499108,"teacher_disagreement_score":0.053929444,"about_ca_system_score_codex":0.001694534,"about_ca_system_score_gemma":0.001040721,"threshold_uncertainty_score":0.180412},"labels":[],"label_agreement":null},{"id":"W3012129924","doi":"10.48550/arxiv.2003.05101","title":"Tensorized Random Projections","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Random projection; Projection (relational algebra); Dimension (graph theory); Rank (graph theory); Gaussian; Tensor (intrinsic definition); Distortion (music); Random matrix; Algorithm; Mathematics; Computer science; Decomposition; Euclidean geometry; Combinatorics; Geometry; Physics","score_opus":0.1888783030525406,"score_gpt":0.24979311228992346,"score_spread":0.06091480923738285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012129924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040809615,0.00018872027,0.9932104,0.00017393834,0.00007399772,0.000031114843,0.00019296602,0.0005690449,0.0014788813],"genre_scores_gemma":[0.19367605,0.0013084052,0.7939132,0.00039972932,0.00039079966,0.00027302385,0.001392419,0.00045577527,0.008190603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869543,0.00036392725,0.00006022291,0.00024699894,0.0005084139,0.00012507131],"domain_scores_gemma":[0.99803203,0.0005521067,0.0002326698,0.0006376344,0.0003996115,0.00014581352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010813052,0.0015071522,0.0009142086,0.00095099496,0.0005007197,0.0016555571,0.001288785,0.00090601307,0.0057315403],"category_scores_gemma":[0.004957454,0.00053813943,0.0009114471,0.001627164,0.0014169829,0.0031140207,0.0023627665,0.0021727919,0.0022257871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035235417,0.00015735636,0.001199007,0.00044195852,0.00014575961,0.00040514045,0.00024207549,0.2236825,0.040892135,0.32530802,0.017776614,0.38939714],"study_design_scores_gemma":[0.000026252304,0.00013675631,0.00039472437,0.000035331286,0.000026023004,0.00036319246,0.00005301144,0.8901655,0.018679641,0.075512506,0.014555844,0.00005120132],"about_ca_topic_score_codex":0.0014022866,"about_ca_topic_score_gemma":0.0014472228,"teacher_disagreement_score":0.0057315403,"about_ca_system_score_codex":0.00057998725,"about_ca_system_score_gemma":0.0014639748,"threshold_uncertainty_score":0.01917398},"labels":[],"label_agreement":null},{"id":"W301566927","doi":"10.1016/j.laa.2015.04.015","title":"Optimization on the Hierarchical Tucker manifold – Applications to tensor completion","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Subspace topology; Mathematics; Conjugate gradient method; Overfitting; Mathematical optimization; Manifold (fluid mechanics); Algorithm; Scalability; Optimization problem; Gradient descent; Computer science; Theoretical computer science; Artificial intelligence; Artificial neural network","score_opus":0.08230579605464176,"score_gpt":0.3296400954964969,"score_spread":0.24733429944185514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W301566927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033305217,0.0019640515,0.9443321,0.0017468185,0.00022499381,0.000036672318,0.00014757017,0.00024457343,0.017998],"genre_scores_gemma":[0.60866314,0.004238339,0.34716356,0.0006922733,0.0010375488,0.00014820551,0.00039949353,0.0006428465,0.037014503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934906,0.00029388946,0.000030265526,0.000125754,0.00013757832,0.00006344238],"domain_scores_gemma":[0.99856406,0.00046057196,0.00023281161,0.00021112942,0.0002971686,0.00023425299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624257,0.0010538854,0.0013067567,0.0011904412,0.0008307893,0.0014983524,0.0011092653,0.000995606,0.004734032],"category_scores_gemma":[0.0043760394,0.00048695697,0.00086404453,0.0015168982,0.002624858,0.003669138,0.0021528169,0.002201714,0.0006844459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021035397,0.000030232388,0.00015151323,0.000055154516,0.00001757218,0.000020926249,0.000066563574,0.030049115,0.0007944936,0.9527558,0.0026859345,0.013351641],"study_design_scores_gemma":[0.0000054283482,0.000019102703,0.0001613714,0.000011501944,0.0000059569466,0.000019116498,0.00003638859,0.1954955,0.00032295447,0.8011987,0.002708802,0.00001529034],"about_ca_topic_score_codex":0.0045625996,"about_ca_topic_score_gemma":0.004467697,"teacher_disagreement_score":0.004734032,"about_ca_system_score_codex":0.0013499645,"about_ca_system_score_gemma":0.0013537762,"threshold_uncertainty_score":0.015836954},"labels":[],"label_agreement":null},{"id":"W3016369572","doi":"10.1109/ojcoms.2020.2987543","title":"A Tensor Based Framework for Multi-Domain Communication Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tensor (intrinsic definition); Theoretical computer science; Distributed computing; Topology (electrical circuits); Mathematics","score_opus":0.3011576138005281,"score_gpt":0.43455081353152736,"score_spread":0.13339319973099928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016369572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001871773,0.00088769756,0.9903357,0.00036724439,0.00014503792,0.00002832368,0.00006547392,0.00013017429,0.00616856],"genre_scores_gemma":[0.31171566,0.0049883854,0.6503191,0.00046269916,0.0009961578,0.00028786936,0.00035945277,0.00026647837,0.030604146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993187,0.00025416166,0.000040451734,0.00010186785,0.00021588677,0.000068946174],"domain_scores_gemma":[0.9994673,0.00016142824,0.000075753676,0.00008737742,0.00015373607,0.00005439499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009017006,0.0011442445,0.00058950705,0.00081598276,0.000716301,0.0020563654,0.001081295,0.0012439644,0.004659896],"category_scores_gemma":[0.0011000738,0.00033775344,0.0008669771,0.00088318,0.0018984303,0.0021196858,0.0012661422,0.001910825,0.0013393563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002455124,0.000020708985,0.00016165031,0.00010607658,0.000023791792,0.00016197746,0.00019188414,0.12042869,0.0043460256,0.84799147,0.002607573,0.023935633],"study_design_scores_gemma":[0.000009750449,0.00008441574,0.00015198805,0.000036383844,0.000017415074,0.00017817157,0.00008313133,0.71934444,0.0010583033,0.25171044,0.02729175,0.000033768858],"about_ca_topic_score_codex":0.003194725,"about_ca_topic_score_gemma":0.0025129104,"teacher_disagreement_score":0.004659896,"about_ca_system_score_codex":0.0012592551,"about_ca_system_score_gemma":0.0010493902,"threshold_uncertainty_score":0.01558888},"labels":[],"label_agreement":null},{"id":"W3016516060","doi":"10.3390/e22040467","title":"Weyl Prior and Bayesian Statistics","year":2020,"lang":"en","type":"article","venue":"Entropy","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Univariate; Prior probability; Gaussian; Applied mathematics; Statistical manifold; Manifold (fluid mechanics); Pure mathematics; Statistical inference; Metric (unit); Exponential family; Bayesian probability; Statistics; Multivariate statistics; Information geometry; Physics; Scalar curvature; Geometry","score_opus":0.03159040966157418,"score_gpt":0.3042446233928518,"score_spread":0.27265421373127763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016516060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074575916,0.0013106504,0.9831155,0.0014702937,0.0001098658,0.000027133903,0.0002098431,0.00012861946,0.0061704465],"genre_scores_gemma":[0.5344359,0.0074795643,0.43965042,0.0016768071,0.0018868226,0.00044465828,0.0010293865,0.00044565316,0.012950801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964175,0.0017448646,0.00017615886,0.00066105014,0.00074651523,0.0002538195],"domain_scores_gemma":[0.992167,0.0050720107,0.00090444024,0.00074971677,0.00077352894,0.0003333203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072722044,0.0009816922,0.0013135443,0.003242001,0.0010338933,0.0026804109,0.0017320093,0.0024797877,0.0042521576],"category_scores_gemma":[0.021528393,0.00069603795,0.0011784806,0.0021777041,0.0054019894,0.0054485537,0.002223574,0.003775383,0.0010930273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009775252,0.000007812471,0.0003218606,0.000052606578,0.000024323792,0.00004890032,0.0000676532,0.020721247,0.000261884,0.96978,0.0008629556,0.007840951],"study_design_scores_gemma":[0.000003621798,0.000008384967,0.00021791336,0.000039280123,0.000006969863,0.000045295776,0.000018063904,0.060688857,0.00020290886,0.93598247,0.0027646392,0.000021591084],"about_ca_topic_score_codex":0.0032872048,"about_ca_topic_score_gemma":0.0018304983,"teacher_disagreement_score":0.0072722044,"about_ca_system_score_codex":0.002312734,"about_ca_system_score_gemma":0.0013789146,"threshold_uncertainty_score":0.03845954},"labels":[],"label_agreement":null},{"id":"W3016873192","doi":"10.48550/arxiv.1810.05846","title":"Nesterov Acceleration of Alternating Least Squares for Canonical Tensor Decomposition: Momentum Step Size Selection and Restart Mechanisms","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Acceleration; Gradient descent; Tensor (intrinsic definition); Line search; Robustness (evolution); Mathematics; Proximal Gradient Methods; Mathematical optimization; Convergence (economics); Algorithm; Computer science; Convex optimization; Regular polygon; Applied mathematics; Artificial intelligence; Physics; Artificial neural network; Geometry","score_opus":0.11269099910736664,"score_gpt":0.27506825403341545,"score_spread":0.16237725492604882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016873192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007398018,0.00019947598,0.9885954,0.00012365905,0.000093406954,0.0000382119,0.000051503703,0.001910155,0.001590123],"genre_scores_gemma":[0.12799408,0.00024661547,0.86481893,0.00017996048,0.00006742381,0.00019234935,0.0003405975,0.0007199514,0.005439975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992888,0.00020211149,0.000042787222,0.000110403555,0.00029103804,0.00006492419],"domain_scores_gemma":[0.99861574,0.00042887562,0.00014557886,0.0003009493,0.0004199652,0.000088860565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011087682,0.0015803837,0.00071623136,0.0005875225,0.0005129011,0.00083602144,0.0012754191,0.0009883854,0.00395914],"category_scores_gemma":[0.0052872137,0.00047678736,0.0006905082,0.0005816926,0.0006971144,0.0011545137,0.0012415154,0.0016575973,0.002365935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000321123,0.00013178436,0.0024229581,0.00027376803,0.00012952289,0.00024235497,0.00030793957,0.4260981,0.028931053,0.033091836,0.011284775,0.49676475],"study_design_scores_gemma":[0.000014683151,0.00003375735,0.00019706655,0.000010684797,0.0000060872767,0.00003824567,0.000012489424,0.988493,0.0047884346,0.003010208,0.003381635,0.000013683135],"about_ca_topic_score_codex":0.00685048,"about_ca_topic_score_gemma":0.010536784,"teacher_disagreement_score":0.00685048,"about_ca_system_score_codex":0.0005100593,"about_ca_system_score_gemma":0.0014135932,"threshold_uncertainty_score":0.013621211},"labels":[],"label_agreement":null},{"id":"W3020586295","doi":"10.1109/tpds.2020.2990429","title":"aeSpTV: An Adaptive and Efficient Framework for Sparse Tensor-Vector Product Kernel on a High-Performance Computing Platform","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Supercomputer; Parallel computing; Leverage (statistics); FLOPS; Thread (computing); Kernel (algebra); Tensor (intrinsic definition); Sparse matrix; Tensor product; Computational science; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.07216470640477066,"score_gpt":0.2944106034335115,"score_spread":0.22224589702874084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020586295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008048769,0.00012435103,0.9830657,0.00008243735,0.00004516005,0.000060956103,0.00010546552,0.0072991024,0.0011680317],"genre_scores_gemma":[0.20599273,0.00028529897,0.78483766,0.00014514817,0.0000689702,0.00031884285,0.00127561,0.002465859,0.0046098633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919456,0.00015782082,0.000055597313,0.000119030374,0.00036747562,0.00010546734],"domain_scores_gemma":[0.9992962,0.00011637261,0.00006123365,0.00020254675,0.0002408456,0.0000827269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073287694,0.0009984538,0.00073603564,0.0007011777,0.00062449055,0.0010410611,0.002334688,0.0006304513,0.0036055383],"category_scores_gemma":[0.0021527328,0.00047919806,0.0009166647,0.00091418193,0.00077718974,0.0019879993,0.0016553727,0.0015350538,0.0016572681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006690195,0.00030745263,0.0036301583,0.00042669618,0.00023057475,0.00043438084,0.0004466167,0.33866483,0.0749848,0.07558862,0.038349427,0.46626744],"study_design_scores_gemma":[0.0000350857,0.00006037157,0.00021827166,0.000007733312,0.000009857587,0.000052463587,0.000024320407,0.9733,0.010299137,0.008059419,0.007911038,0.00002226944],"about_ca_topic_score_codex":0.0055611026,"about_ca_topic_score_gemma":0.006492257,"teacher_disagreement_score":0.0055611026,"about_ca_system_score_codex":0.00080562057,"about_ca_system_score_gemma":0.0016229638,"threshold_uncertainty_score":0.012061775},"labels":[],"label_agreement":null},{"id":"W3023588015","doi":"10.1109/tfuzz.2020.2992634","title":"An Edge-Cloud-Aided High-Order Possibilistic c-Means Algorithm for Big Data Clustering","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cluster analysis; Autoencoder; Cloud computing; Computer science; Big data; Enhanced Data Rates for GSM Evolution; Algorithm; Data stream clustering; Data mining; CURE data clustering algorithm; Feature (linguistics); Correlation clustering; Computation; Artificial intelligence; Deep learning","score_opus":0.12452096412800735,"score_gpt":0.33112661588150877,"score_spread":0.20660565175350143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023588015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054373983,0.00012445344,0.9931212,0.00010226331,0.00002975206,0.00003388553,0.000036669306,0.00044723746,0.0006670587],"genre_scores_gemma":[0.22727421,0.00017305792,0.7691699,0.00022208533,0.000050760435,0.00018826366,0.00032719233,0.00018957561,0.0024049866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915004,0.00017239082,0.00005898724,0.0002412294,0.00026652816,0.00011078202],"domain_scores_gemma":[0.9988274,0.00042759193,0.00009193224,0.00014548992,0.0004124001,0.000095147465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009714946,0.0011979749,0.0013377456,0.0011998815,0.0012815369,0.001437867,0.002804376,0.0019071918,0.0028238264],"category_scores_gemma":[0.0029944798,0.0007357222,0.0012489216,0.0015175606,0.0009622267,0.0018545648,0.0018174604,0.0023907141,0.00083843747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031208512,0.00011589515,0.0013557962,0.00015822884,0.00015797238,0.00011273551,0.00015820154,0.73921084,0.005548521,0.017749332,0.0047933944,0.23032695],"study_design_scores_gemma":[0.0000048680035,0.00000772953,0.000043605407,0.0000025183676,0.0000032770242,0.000012942268,0.0000060474526,0.9963632,0.00061179505,0.002687766,0.0002514248,0.000004874712],"about_ca_topic_score_codex":0.014103637,"about_ca_topic_score_gemma":0.016759878,"teacher_disagreement_score":0.014103637,"about_ca_system_score_codex":0.0015998747,"about_ca_system_score_gemma":0.0030050671,"threshold_uncertainty_score":0.028043091},"labels":[],"label_agreement":null},{"id":"W3026289647","doi":"10.1007/978-3-030-45247-6_15","title":"An Introduction to the Waring Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Unione Matematica Italiana","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.02560291618424219,"score_gpt":0.26941303109454107,"score_spread":0.2438101149102989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026289647","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035363664,0.03554103,0.43220675,0.0078063607,0.0053935954,0.000083619896,0.00087694894,0.00079305255,0.5137622],"genre_scores_gemma":[0.095989585,0.07713865,0.33471584,0.0042072623,0.01395037,0.00046997788,0.0026521205,0.0020068386,0.46886933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995466,0.0000873541,0.000030785595,0.0001247684,0.0001664449,0.000044062515],"domain_scores_gemma":[0.9994783,0.0002776858,0.00003325088,0.000091717346,0.00007415961,0.000044934157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062441017,0.0015661654,0.0012308711,0.0015378132,0.0012212221,0.002616174,0.0014563292,0.0016607636,0.039977044],"category_scores_gemma":[0.0016508799,0.00090896717,0.0012107533,0.0031004986,0.0026244135,0.0058934097,0.0024830194,0.00558589,0.013980851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016479798,0.000038581198,0.000054532153,0.0002242624,0.000010215339,0.00007137597,0.000119699835,0.0020464885,0.00081577414,0.84053516,0.061894175,0.09417329],"study_design_scores_gemma":[0.000004931653,0.000013330353,0.00009702873,0.000073446914,0.000004774828,0.0001747305,0.000036686437,0.002550201,0.00025531332,0.7981603,0.19861376,0.000015556401],"about_ca_topic_score_codex":0.0008448103,"about_ca_topic_score_gemma":0.00075832347,"teacher_disagreement_score":0.039977044,"about_ca_system_score_codex":0.0011316949,"about_ca_system_score_gemma":0.00067540986,"threshold_uncertainty_score":0.13373655},"labels":[],"label_agreement":null},{"id":"W3029815899","doi":"10.3390/a13060135","title":"A Recursive Least-Squares Algorithm for the Identification of Trilinear Forms","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Recursive least squares filter; Algorithm; Impulse response; Least-squares function approximation; Identification (biology); Impulse (physics); Rank (graph theory); Tensor (intrinsic definition); Mathematics; Computer science; Tensor decomposition; System identification; Rank condition; Mathematical optimization; Applied mathematics; Adaptive filter; Statistics; Data mining","score_opus":0.0642865499699324,"score_gpt":0.340926401923273,"score_spread":0.2766398519533406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029815899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004374241,0.000043270287,0.99920017,0.000022250897,0.000008262257,0.0000072680828,0.000007965174,0.0001493988,0.00012400498],"genre_scores_gemma":[0.042210106,0.00023803202,0.95536315,0.00006136697,0.00004158447,0.00012580234,0.00016581142,0.00014482203,0.0016493194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916744,0.00028350085,0.000061059814,0.0001998122,0.00023161937,0.000056470773],"domain_scores_gemma":[0.9987949,0.0005554909,0.00015731734,0.00018334993,0.0002697649,0.000039146802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411945,0.0013295979,0.00093493186,0.000799424,0.00046164216,0.00082838064,0.0012000627,0.0011940661,0.0026476046],"category_scores_gemma":[0.004067964,0.0005876531,0.0011585238,0.001075363,0.0008720942,0.0014449024,0.0010822981,0.002051585,0.002309985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013021,0.000095084775,0.00072543556,0.00031637136,0.00013537683,0.00011153034,0.0002120638,0.48208278,0.03004589,0.05054138,0.004754645,0.43084922],"study_design_scores_gemma":[0.000006105212,0.00003528672,0.00007604718,0.000008462403,0.0000073567803,0.000046838974,0.000009913782,0.98943514,0.0028242413,0.005374316,0.0021624563,0.0000137829975],"about_ca_topic_score_codex":0.0026579923,"about_ca_topic_score_gemma":0.0032236024,"teacher_disagreement_score":0.0026579923,"about_ca_system_score_codex":0.00048964936,"about_ca_system_score_gemma":0.0013845889,"threshold_uncertainty_score":0.008857131},"labels":[],"label_agreement":null},{"id":"W3033538417","doi":"10.1109/tii.2020.2999622","title":"Support Multimode Tensor Machine for Multiple Classification on Industrial Big Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Support vector machine; Computer science; Artificial intelligence; Machine learning; Context (archaeology); Big data; Data mining; Binary classification; Tensor (intrinsic definition); Data classification; Statistical classification; Feature extraction; Structured support vector machine; Pattern recognition (psychology); Contextual image classification; Image (mathematics); Mathematics","score_opus":0.4926474357201112,"score_gpt":0.36892885570776945,"score_spread":0.12371858001234176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033538417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058711357,0.00030587305,0.9924253,0.00025887587,0.00008150117,0.000040682382,0.00012143651,0.00055599463,0.00033926373],"genre_scores_gemma":[0.26506695,0.0008136253,0.729582,0.00019062299,0.00023866649,0.0002968692,0.0011797082,0.00021165499,0.002419818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813396,0.0006860181,0.0001624006,0.00040577876,0.0004506415,0.00016127192],"domain_scores_gemma":[0.99663866,0.0012245425,0.0004396769,0.0005961922,0.0009290033,0.00017194997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024117588,0.0016484838,0.0015173713,0.001242973,0.0007533105,0.0013655871,0.0017529365,0.0011544357,0.0020109287],"category_scores_gemma":[0.009139135,0.00042358605,0.0012639397,0.0021910374,0.0008236145,0.0024719152,0.001385371,0.0025286686,0.0011354213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032213592,0.00015393861,0.0032443916,0.00039562245,0.00019703871,0.0002847851,0.00025741447,0.37719926,0.007223169,0.040654685,0.011434353,0.55863327],"study_design_scores_gemma":[0.0000037436246,0.000021779499,0.00014721653,0.000007428236,0.000005869251,0.00002319935,0.000015691,0.98716325,0.0007678486,0.011002217,0.0008330893,0.0000086926],"about_ca_topic_score_codex":0.005153936,"about_ca_topic_score_gemma":0.004598183,"teacher_disagreement_score":0.005153936,"about_ca_system_score_codex":0.001100969,"about_ca_system_score_gemma":0.0016677545,"threshold_uncertainty_score":0.012754738},"labels":[],"label_agreement":null},{"id":"W3033693759","doi":"10.18280/isi.250202","title":"A Novel Log-Based Tensor Completion Algorithm","year":2020,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hebei Province; Department of Education of Hebei Province; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Mathematics; Matrix norm; Rank (graph theory); Algorithm; Generalization; Function (biology); Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.05270963583783972,"score_gpt":0.28248854674855994,"score_spread":0.22977891091072022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033693759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002096124,0.0001564796,0.9954373,0.00013488637,0.00005799222,0.000042840744,0.000080209735,0.0012564403,0.0007378131],"genre_scores_gemma":[0.058415968,0.00033090558,0.93204314,0.00021948878,0.00013231042,0.00018196969,0.0009974069,0.000583163,0.007095726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868494,0.0002343712,0.00007749341,0.00031546576,0.00055221375,0.00013553786],"domain_scores_gemma":[0.9984731,0.00032196476,0.00012834457,0.00027630813,0.00067262433,0.00012762104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013656105,0.0015250557,0.0014958975,0.0015568637,0.0008348484,0.0015686123,0.0025407076,0.0014068332,0.006084785],"category_scores_gemma":[0.004167691,0.00061530387,0.0012775778,0.0018018287,0.0011126694,0.0027909267,0.0019325091,0.0028668232,0.0040095258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031506602,0.00021771288,0.00086234824,0.00021192916,0.00006793562,0.00016748915,0.00015582211,0.18558678,0.018931974,0.027736695,0.02489868,0.7408475],"study_design_scores_gemma":[0.000022626515,0.000041004983,0.00009056649,0.000007957757,0.0000067168876,0.00011124561,0.000016047097,0.9846422,0.003268364,0.006905955,0.004869021,0.000018302746],"about_ca_topic_score_codex":0.008695924,"about_ca_topic_score_gemma":0.0078271525,"teacher_disagreement_score":0.008695924,"about_ca_system_score_codex":0.001053215,"about_ca_system_score_gemma":0.0033684499,"threshold_uncertainty_score":0.020355582},"labels":[],"label_agreement":null},{"id":"W3036176725","doi":"10.1007/978-3-030-40794-0_9","title":"Tensor-Based Feature Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Information fusion and data science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Tensor (intrinsic definition); Feature (linguistics); Feature learning; Feature vector; Representation (politics); Computer science; Artificial intelligence; Transformation matrix; Matrix (chemical analysis); Rationality; Transformation (genetics); Pattern recognition (psychology); Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.07037117138720562,"score_gpt":0.32440874453539126,"score_spread":0.25403757314818565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036176725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015311956,0.006113983,0.96137273,0.0005047436,0.0005128428,0.000024191144,0.00041413112,0.001817747,0.027708305],"genre_scores_gemma":[0.087442294,0.01631793,0.7777135,0.00047421933,0.0009746662,0.00013392698,0.0029301527,0.0013237357,0.11268967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997669,0.000030258203,0.000013557029,0.000059963495,0.000112452246,0.00001675563],"domain_scores_gemma":[0.99966884,0.00009873063,0.00002098651,0.00009601112,0.00010348262,0.000011960787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047029063,0.00084652053,0.00070773775,0.00089767756,0.00027102022,0.0013365982,0.0008530299,0.0006276099,0.010489695],"category_scores_gemma":[0.001079101,0.000340776,0.0005559479,0.0019557478,0.0006112497,0.00231261,0.0009148856,0.0011981991,0.008140945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032705564,0.00002673085,0.00012084967,0.0002248334,0.000029556431,0.000032756885,0.000040778457,0.013353592,0.007279291,0.10485358,0.051757473,0.8222478],"study_design_scores_gemma":[0.000008326902,0.0000758162,0.0007256501,0.00013031723,0.000047431666,0.00048460186,0.0000456343,0.3303217,0.018765535,0.3543546,0.29497385,0.0000665409],"about_ca_topic_score_codex":0.00089931313,"about_ca_topic_score_gemma":0.0011297695,"teacher_disagreement_score":0.010489695,"about_ca_system_score_codex":0.00043507907,"about_ca_system_score_gemma":0.00039453444,"threshold_uncertainty_score":0.03509158},"labels":[],"label_agreement":null},{"id":"W3037008335","doi":"10.1109/jiot.2020.3004826","title":"Edge–Cloud-Aided Differentially Private Tucker Decomposition for Cyber–Physical–Social Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Cyber-physical system; Decomposition; Enhanced Data Rates for GSM Evolution; Edge computing; Computer security; Distributed computing; Artificial intelligence; Operating system","score_opus":0.04923406306194937,"score_gpt":0.33332512771810346,"score_spread":0.2840910646561541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037008335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016182952,0.00024987935,0.98176664,0.00025030962,0.000049605493,0.00004303705,0.000115929506,0.00027736148,0.001064307],"genre_scores_gemma":[0.7389222,0.00048562602,0.25621185,0.0002675975,0.00010228788,0.00011149412,0.00041219144,0.00008013842,0.0034066953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980149,0.0006676664,0.00011398555,0.00039741505,0.0005278362,0.00027813305],"domain_scores_gemma":[0.9977848,0.00068190263,0.0002475407,0.0007961814,0.00033656321,0.00015300699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017301769,0.000885488,0.0010801217,0.0005180674,0.0009253602,0.001545977,0.0011118695,0.00096993346,0.0020717534],"category_scores_gemma":[0.0046941126,0.00031135348,0.00085271336,0.0011133687,0.0010459697,0.0026840754,0.0022723523,0.001698834,0.00063609146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007930369,0.00018024519,0.002596852,0.00021255056,0.00013329416,0.0004232772,0.00029494907,0.64613307,0.021981489,0.101229966,0.007841903,0.21817932],"study_design_scores_gemma":[0.000011502353,0.000041232775,0.00019831126,0.000006395286,0.000008961587,0.000058514797,0.000030800038,0.9778139,0.0023258948,0.018472262,0.0010205809,0.000011695371],"about_ca_topic_score_codex":0.0028256718,"about_ca_topic_score_gemma":0.0030739505,"teacher_disagreement_score":0.0028256718,"about_ca_system_score_codex":0.0011920347,"about_ca_system_score_gemma":0.001354981,"threshold_uncertainty_score":0.009150147},"labels":[],"label_agreement":null},{"id":"W3037951614","doi":"10.1016/j.laa.2021.02.019","title":"The tensor rank problem over the quaternions","year":2021,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Quaternion; Rank (graph theory); Tensor (intrinsic definition); Simple (philosophy); Combinatorics; Upper and lower bounds; Symmetric tensor; Pure mathematics; Decomposition; Algebra over a field; Mathematical analysis; Geometry; Exact solutions in general relativity; Chemistry","score_opus":0.02683223370056843,"score_gpt":0.30756374178514645,"score_spread":0.28073150808457803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037951614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19561209,0.016137408,0.62862307,0.019929895,0.0028494487,0.00007396041,0.0010386746,0.0004887755,0.13524671],"genre_scores_gemma":[0.7931538,0.012909749,0.12186343,0.0014916823,0.0055055176,0.0000947245,0.000889227,0.00041842822,0.06367343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900657,0.00037350846,0.000049867474,0.00019672119,0.00024921613,0.00012401382],"domain_scores_gemma":[0.9982249,0.00071274524,0.00028397614,0.0002249976,0.00030964476,0.0002437279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784102,0.0011894357,0.0012773892,0.0019413456,0.0012509193,0.0039554504,0.0010910045,0.0014394718,0.008757073],"category_scores_gemma":[0.004035909,0.0004674606,0.0007642781,0.0025309874,0.003180533,0.00897186,0.002261992,0.003703025,0.0015406485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038458766,0.000020928821,0.00010985492,0.000083905186,0.000009329433,0.000046117875,0.00011624745,0.0023285458,0.00055251294,0.9793482,0.0040302156,0.013315704],"study_design_scores_gemma":[0.000005470254,0.000011237235,0.00005814989,0.000015461297,0.0000033826966,0.000046996105,0.0000702277,0.008528614,0.00022300018,0.98754764,0.0034798703,0.000010024272],"about_ca_topic_score_codex":0.0015237675,"about_ca_topic_score_gemma":0.0012953695,"teacher_disagreement_score":0.008757073,"about_ca_system_score_codex":0.0011045124,"about_ca_system_score_gemma":0.0012600403,"threshold_uncertainty_score":0.029295385},"labels":[],"label_agreement":null},{"id":"W3039070800","doi":"10.48550/arxiv.2007.01996","title":"On the Asymptotic Linear Convergence Speed of Anderson Acceleration, Nesterov Acceleration, and Nonlinear GMRES","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized minimal residual method; Mathematics; Preconditioner; Acceleration; Convergence (economics); Applied mathematics; Nonlinear system; Fixed point; Mathematical analysis; Linear system; Physics","score_opus":0.2062707078361858,"score_gpt":0.2569184581879256,"score_spread":0.05064775035173977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039070800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06453783,0.0028107667,0.91104126,0.0011614921,0.00016321494,0.00007534343,0.00005587324,0.0005603284,0.019593937],"genre_scores_gemma":[0.7726692,0.0027160433,0.21546264,0.0003521474,0.0002640534,0.00026623355,0.00015296761,0.0005842725,0.007532515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987225,0.00058166665,0.000053018677,0.00012846908,0.00036837583,0.000146033],"domain_scores_gemma":[0.9907003,0.0064885383,0.00070069963,0.0006192768,0.0012323192,0.0002589736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004099931,0.0011809247,0.0008060037,0.0012452921,0.00060547784,0.00096417044,0.00075039227,0.00092038023,0.0020979284],"category_scores_gemma":[0.023824822,0.00041766936,0.00077730155,0.00062811107,0.0035841048,0.0018495911,0.0020337047,0.0021118382,0.0005957783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044688603,0.00009948683,0.0035483986,0.00059514126,0.00007078637,0.00024901342,0.00060573686,0.53707534,0.014595656,0.35526234,0.0028391627,0.084612],"study_design_scores_gemma":[0.000014501111,0.00006442765,0.00033501233,0.00008704974,0.0000094241095,0.000034274486,0.000032540367,0.96810406,0.0029084152,0.027105333,0.0012890393,0.000015946689],"about_ca_topic_score_codex":0.0043645925,"about_ca_topic_score_gemma":0.002940273,"teacher_disagreement_score":0.0043645925,"about_ca_system_score_codex":0.0008363014,"about_ca_system_score_gemma":0.0011724734,"threshold_uncertainty_score":0.021682799},"labels":[],"label_agreement":null},{"id":"W3042374971","doi":"10.1093/bioinformatics/btaa488","title":"Factorized embeddings learns rich and biologically meaningful embedding spaces using factorized tensor decomposition","year":2020,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute; Institute for Research in Immunology and Cancer","funders":"Canadian Institutes of Health Research; Institut de Valorisation des Données; Canada First Research Excellence Fund; Canadian Institute for Advanced Research","keywords":"Representation (politics); Computer science; Tensor (intrinsic definition); Dimensionality reduction; Embedding; Curse of dimensionality; Rank (graph theory); Sample (material); Artificial intelligence; Multifactor dimensionality reduction; Matrix decomposition; Theoretical computer science; Pattern recognition (psychology); Gene; Mathematics; Biology","score_opus":0.08759766551448768,"score_gpt":0.35351002339032034,"score_spread":0.2659123578758327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042374971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038631156,0.0005893686,0.95418376,0.00056031113,0.00008634449,0.00006623008,0.000864756,0.0034209806,0.0015971196],"genre_scores_gemma":[0.516851,0.00083821284,0.46449333,0.0005652644,0.00018358362,0.0003038553,0.0072995727,0.0011056726,0.008359422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933535,0.00020733777,0.000034983408,0.00024509564,0.00010197092,0.00007514699],"domain_scores_gemma":[0.99803823,0.00089944166,0.00017798367,0.0004340486,0.0003311072,0.00011916483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012929911,0.0018933051,0.0010111328,0.00073129777,0.00040736742,0.0011444499,0.0010702168,0.0013687393,0.0033217806],"category_scores_gemma":[0.0063970257,0.0006716836,0.001403846,0.0008424195,0.0011212277,0.002317414,0.0014999941,0.0028751802,0.0017771147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028558957,0.00018981488,0.003595238,0.00028177528,0.00019139395,0.00015160056,0.00024476706,0.6937393,0.010194982,0.028159276,0.017825495,0.24514085],"study_design_scores_gemma":[0.000013548524,0.000032188927,0.00018907753,0.000016665479,0.000010045438,0.000028440541,0.000016606871,0.9771047,0.0011410292,0.020350488,0.0010846466,0.0000125511115],"about_ca_topic_score_codex":0.0060960306,"about_ca_topic_score_gemma":0.0063784155,"teacher_disagreement_score":0.0060960306,"about_ca_system_score_codex":0.000929834,"about_ca_system_score_gemma":0.0011223605,"threshold_uncertainty_score":0.012121081},"labels":[],"label_agreement":null},{"id":"W3044908563","doi":"10.4171/dm/791","title":"Rost Multipliers of Lifted Kronecker Tensor Products","year":2020,"lang":"en","type":"article","venue":"Documenta Mathematica","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Kronecker delta; Tensor product; Kronecker product; Tensor (intrinsic definition); Pure mathematics; Algebra over a field; Physics","score_opus":0.06639058567454487,"score_gpt":0.3263655318449989,"score_spread":0.259974946170454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044908563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71460885,0.00032138795,0.18757702,0.00066523027,0.0006441478,0.00010195835,0.00022931136,0.00048379388,0.0953683],"genre_scores_gemma":[0.93499625,0.0003737752,0.03772565,0.00022022706,0.00029478237,0.000107101354,0.00017004443,0.00031044465,0.025801709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968815,0.000055503748,0.000018066714,0.000046433972,0.00010875732,0.00008298959],"domain_scores_gemma":[0.9996153,0.000043679778,0.00008212484,0.00006831908,0.0000849751,0.000105584026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006200351,0.0007546548,0.0004299167,0.0023624955,0.0008352053,0.0016408556,0.0006306156,0.0004854232,0.008915672],"category_scores_gemma":[0.001013556,0.00026716015,0.0007367413,0.00051801134,0.0016722941,0.002680259,0.0015307181,0.0015421492,0.0014540988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025065101,0.00002801718,0.0001670947,0.00001997501,0.000005303001,0.00009095765,0.00015626625,0.0016239964,0.0028687571,0.99003285,0.0004045742,0.0045771208],"study_design_scores_gemma":[0.000025291147,0.000071587994,0.0005045176,0.000028211325,0.000010206908,0.00019108274,0.00016231865,0.021536516,0.006560719,0.9658609,0.0050120717,0.000036485442],"about_ca_topic_score_codex":0.00037125908,"about_ca_topic_score_gemma":0.00045349883,"teacher_disagreement_score":0.008915672,"about_ca_system_score_codex":0.00082635606,"about_ca_system_score_gemma":0.00065710075,"threshold_uncertainty_score":0.029825866},"labels":[],"label_agreement":null},{"id":"W3047460132","doi":"10.1007/jhep11(2020)084","title":"Dual S-matrix bootstrap. Part I. 2D theory","year":2020,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Institut Périmètre de physique théorique; Simons Foundation","keywords":"Duality (order theory); Observable; Bootstrapping (finance); Dual (grammatical number); Convergence (economics); Symmetry (geometry)","score_opus":0.04286409814806524,"score_gpt":0.30422210195146304,"score_spread":0.2613580038033978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047460132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06643935,0.0015681108,0.86796963,0.0020126856,0.00028410513,0.00006237444,0.00023562016,0.00021820188,0.061209947],"genre_scores_gemma":[0.8641421,0.0009248562,0.11618491,0.001040166,0.00055129756,0.00025857703,0.00017421272,0.00020345613,0.016520444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922276,0.0003629514,0.000024436658,0.000085942745,0.00022136503,0.000082594546],"domain_scores_gemma":[0.99908626,0.0002893947,0.00014827865,0.00019349567,0.00015334468,0.00012913311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016253463,0.0006579207,0.0007477497,0.001226177,0.0007702829,0.0019574193,0.000794571,0.0011894199,0.005205245],"category_scores_gemma":[0.0029018759,0.00034003233,0.0009281797,0.00053678063,0.0031711736,0.0026625153,0.0021847226,0.0017409422,0.0010712766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009103804,0.0000108747745,0.000086049076,0.00001906356,0.000003386242,0.000025072823,0.000030889725,0.00404749,0.0009076506,0.99298203,0.00041647835,0.001461817],"study_design_scores_gemma":[0.000007610605,0.000029856203,0.00016111905,0.00001987121,0.0000031188706,0.00006537795,0.000031651998,0.12642744,0.0005882243,0.87048626,0.0021689388,0.000010447361],"about_ca_topic_score_codex":0.0005494708,"about_ca_topic_score_gemma":0.00038579723,"teacher_disagreement_score":0.005205245,"about_ca_system_score_codex":0.0011204894,"about_ca_system_score_gemma":0.0006555992,"threshold_uncertainty_score":0.017413259},"labels":[],"label_agreement":null},{"id":"W3080991741","doi":"10.48550/arxiv.2008.10766","title":"Channel-Directed Gradients for Optimization of Convolutional Neural Networks","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Computation; Discretization; Generalization; Benchmark (surveying); Smoothing; Channel (broadcasting); Mathematical optimization; Algorithm; Mathematics","score_opus":0.12898135070328254,"score_gpt":0.23293016385167029,"score_spread":0.10394881314838775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080991741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001940278,0.00049072766,0.99555165,0.00015848929,0.00004976421,0.000021567712,0.00006278517,0.00032381463,0.0014008343],"genre_scores_gemma":[0.21865149,0.0019491324,0.76764476,0.00041622375,0.0003258848,0.00040011358,0.0006521545,0.0011373803,0.008822809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937975,0.00022384645,0.00003742916,0.00010697061,0.00020914289,0.00004277937],"domain_scores_gemma":[0.9990275,0.00044940945,0.00010813419,0.00012575323,0.00022951749,0.000059753944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013679406,0.0016182916,0.00084204995,0.0008826244,0.00037101563,0.0010264791,0.0008450147,0.0010650667,0.0021032589],"category_scores_gemma":[0.005163303,0.00053437974,0.00072588515,0.0009667847,0.0011751849,0.0016243986,0.0014677409,0.0021855785,0.0010048724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070027774,0.000044983313,0.000440414,0.00023507322,0.00006664131,0.000045266308,0.000056103858,0.74377173,0.0051139956,0.15262382,0.007504914,0.09002709],"study_design_scores_gemma":[0.0000059435015,0.000018122691,0.00006478897,0.000016502912,0.0000043667524,0.000012071623,0.000002934048,0.9469189,0.001299668,0.049252674,0.0023956962,0.000008276191],"about_ca_topic_score_codex":0.0026252,"about_ca_topic_score_gemma":0.0032576958,"teacher_disagreement_score":0.0026252,"about_ca_system_score_codex":0.001344674,"about_ca_system_score_gemma":0.0012906127,"threshold_uncertainty_score":0.009756386},"labels":[],"label_agreement":null},{"id":"W3091528227","doi":"10.1109/lsp.2020.3028006","title":"A Complete Discriminative Tensor Representation Learning for Two-Dimensional Correlation Analysis","year":2020,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Discriminative model; Representation (politics); Tensor (intrinsic definition); Pattern recognition (psychology); Canonical correlation; Correlation; Linear discriminant analysis","score_opus":0.0880582341947177,"score_gpt":0.34963411800444544,"score_spread":0.26157588380972774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091528227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038500722,0.0002901129,0.99491984,0.00015123792,0.000037781836,0.000021577102,0.00006582266,0.00031441762,0.00034913758],"genre_scores_gemma":[0.1940432,0.0010984807,0.79930776,0.0004009701,0.00025437237,0.0002387694,0.0012067327,0.00024970755,0.0032000705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987783,0.00045285883,0.000055763045,0.000311498,0.00030442845,0.00009716089],"domain_scores_gemma":[0.9985587,0.00032019275,0.00017316712,0.0003847149,0.00041628437,0.00014692606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015099965,0.0012118829,0.0011205235,0.0012709257,0.00069621444,0.0010399296,0.0013377786,0.0009466832,0.0019809166],"category_scores_gemma":[0.0043044738,0.000464456,0.0011476125,0.0020461134,0.0011818492,0.0020082453,0.0019980825,0.0020443655,0.0013264973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021861042,0.00024366903,0.0018252204,0.00038128736,0.00018536355,0.0002526063,0.00024364301,0.14024375,0.052777044,0.058974702,0.020172035,0.724482],"study_design_scores_gemma":[0.000009292312,0.00008211694,0.00025524898,0.000013019926,0.000019250465,0.00012176138,0.000017383103,0.9822566,0.0038228992,0.010604495,0.0027651375,0.00003280622],"about_ca_topic_score_codex":0.0028984712,"about_ca_topic_score_gemma":0.0026450786,"teacher_disagreement_score":0.0028984712,"about_ca_system_score_codex":0.0006400155,"about_ca_system_score_gemma":0.0016088822,"threshold_uncertainty_score":0.007985711},"labels":[],"label_agreement":null},{"id":"W3092057726","doi":"10.1007/s11854-023-0289-9","title":"A note on Fourier restriction and nested Polynomial Wolff axioms","year":2023,"lang":"fr","type":"article","venue":"Journal d Analyse Mathématique","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Axiom; Conjecture; Mathematics; Fourier transform; Polynomial; Combinatorics; Range (aeronautics); Fourier series; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry; Engineering","score_opus":0.034076189972169386,"score_gpt":0.3339062749361032,"score_spread":0.2998300849639338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092057726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08734695,0.008066663,0.5519666,0.022433447,0.0053885737,0.000080171914,0.0005333859,0.0005435104,0.32364073],"genre_scores_gemma":[0.73991704,0.0066960165,0.17081673,0.004005267,0.0069032623,0.00017526204,0.00041633032,0.00059352524,0.07047654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851865,0.00052062696,0.00009991538,0.00030143702,0.00037158892,0.00018785804],"domain_scores_gemma":[0.99568814,0.0028702775,0.00020402094,0.00062376517,0.0003753253,0.00023848211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034211024,0.0010083984,0.001592352,0.0020789406,0.0025567939,0.0029193358,0.0017598522,0.0027084283,0.007353727],"category_scores_gemma":[0.007836394,0.00081550196,0.0018538947,0.001841388,0.008259066,0.017341519,0.0045337332,0.00772621,0.0009809312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007620424,0.000005232348,0.000029405828,0.000012256502,0.0000022372833,0.00004285093,0.000091130416,0.00010077314,0.00014377684,0.99688065,0.0010267579,0.0016572691],"study_design_scores_gemma":[0.0000039407696,0.000005180647,0.000050523842,0.0000053923404,0.000003481799,0.00006719544,0.00002747919,0.0006643568,0.00013893348,0.9947129,0.0043121595,0.000008413938],"about_ca_topic_score_codex":0.0016249106,"about_ca_topic_score_gemma":0.0013557348,"teacher_disagreement_score":0.007353727,"about_ca_system_score_codex":0.0015149646,"about_ca_system_score_gemma":0.00078608154,"threshold_uncertainty_score":0.024600625},"labels":[],"label_agreement":null},{"id":"W3113608201","doi":"","title":"High-dimensional quantile tensor regression","year":2020,"lang":"en","type":"article","venue":"CityU Scholars","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Shenzhen Research Institute, City University of Hong Kong; National Natural Science Foundation of China; City University of Hong Kong","keywords":"Quantile regression; Tensor (intrinsic definition); Regression; Econometrics; Quantile; Mathematics; Computer science; Statistics; Artificial intelligence; Pure mathematics","score_opus":0.07385700183305119,"score_gpt":0.3350480108015665,"score_spread":0.2611910089685153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113608201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074622207,0.00043507968,0.9904542,0.00034699208,0.00005394437,0.000015527447,0.0001086162,0.00018046738,0.00094293756],"genre_scores_gemma":[0.6597715,0.0028207833,0.32849675,0.00032358133,0.00036057815,0.00014495458,0.0007174907,0.00018713328,0.007177217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906784,0.0004541013,0.000037297446,0.00017406062,0.00018797588,0.00007880726],"domain_scores_gemma":[0.9983571,0.00073474617,0.00029874782,0.00018457895,0.000346911,0.00007792351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018285817,0.0007993532,0.0008294027,0.00066117797,0.00041291953,0.0010941473,0.00087494025,0.0009890053,0.002115641],"category_scores_gemma":[0.006829949,0.00038584578,0.00061731687,0.001212839,0.0008449632,0.0014188362,0.0010032194,0.0013726995,0.00048203024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011705694,0.000051341576,0.004578607,0.00022416931,0.00009999261,0.00020346056,0.00012076697,0.6716377,0.00450551,0.20038378,0.006168056,0.11190948],"study_design_scores_gemma":[0.0000040044415,0.000011450558,0.00039778036,0.000009167568,0.000007016655,0.000023770248,0.000010075713,0.97572327,0.00048617536,0.021937244,0.0013808185,0.000009336586],"about_ca_topic_score_codex":0.005632495,"about_ca_topic_score_gemma":0.0031635975,"teacher_disagreement_score":0.005632495,"about_ca_system_score_codex":0.00077173987,"about_ca_system_score_gemma":0.00093404687,"threshold_uncertainty_score":0.011199415},"labels":[],"label_agreement":null},{"id":"W3120764419","doi":"10.1007/s11464-020-0884-3","title":"On intervals and sets of hypermatrices (tensors)","year":2020,"lang":"en","type":"article","venue":"Frontiers of Mathematics in China","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Interval (graph theory); Positive-definite matrix; Combinatorics; Order (exchange); Regular polygon; Extreme point; Set (abstract data type); Pure mathematics; Discrete mathematics; Geometry; Eigenvalues and eigenvectors; Physics","score_opus":0.03591064661656725,"score_gpt":0.305404374305912,"score_spread":0.26949372768934476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120764419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39712134,0.011697335,0.5045148,0.002592937,0.0007981821,0.0000948291,0.0013551727,0.0002998846,0.08152551],"genre_scores_gemma":[0.89713156,0.005489868,0.0773441,0.00030672908,0.0014947314,0.00018453253,0.0010326648,0.00015521128,0.016860636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984524,0.00043836646,0.00011090988,0.00038578952,0.00039821633,0.00021422136],"domain_scores_gemma":[0.99639696,0.0013284384,0.0006971282,0.0002760064,0.00071747135,0.00058410945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016673369,0.0008101229,0.0010073449,0.0053814454,0.0015921708,0.003698464,0.0011688197,0.0006517541,0.0044763545],"category_scores_gemma":[0.0055465573,0.00042485466,0.0013507961,0.0040576183,0.0034430544,0.0043080556,0.0021574588,0.002078083,0.00053067465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032599997,0.000012534591,0.00042355902,0.000044630146,0.000013951883,0.000047114067,0.00029347357,0.0014232415,0.0004348043,0.98812103,0.00094470265,0.008208388],"study_design_scores_gemma":[0.00000843925,0.000026110874,0.0008591264,0.000024935709,0.000019436793,0.00007428216,0.00014625107,0.012214107,0.00018788825,0.982989,0.0034307963,0.000019482073],"about_ca_topic_score_codex":0.0036020163,"about_ca_topic_score_gemma":0.0016303399,"teacher_disagreement_score":0.0053814454,"about_ca_system_score_codex":0.0021294227,"about_ca_system_score_gemma":0.0009460485,"threshold_uncertainty_score":0.01545012},"labels":[],"label_agreement":null},{"id":"W3121013072","doi":"10.1109/tits.2020.3044466","title":"Diagnosing Spatiotemporal Traffic Anomalies With Low-Rank Tensor Autoregression","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec","keywords":"Autoregressive model; Computer science; Data mining; Tensor (intrinsic definition); Data set; Artificial intelligence; Data modeling; Set (abstract data type); Rank (graph theory); Machine learning; Mathematics; Econometrics","score_opus":0.03737141860003043,"score_gpt":0.2958990533756125,"score_spread":0.25852763477558205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121013072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13500087,0.00044542056,0.8613464,0.00080161553,0.00006492439,0.000043964068,0.00042809866,0.0010265704,0.0008421017],"genre_scores_gemma":[0.90520364,0.0004158818,0.092181206,0.000091640315,0.00008103991,0.000041178013,0.0009988591,0.000069703245,0.00091689755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991934,0.00030756014,0.000055856275,0.00020454676,0.00012645594,0.00011221852],"domain_scores_gemma":[0.99779296,0.0009816495,0.00047014304,0.0002545369,0.0003857309,0.0001149808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018910439,0.0012133336,0.00081412337,0.0012673337,0.0004102239,0.0010427773,0.0008415827,0.0008437652,0.0005577631],"category_scores_gemma":[0.0055479407,0.00045689457,0.0009611135,0.0010271643,0.00064541236,0.0018965211,0.00073506444,0.0017375925,0.00028102403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013244036,0.00013220072,0.012657456,0.00007358261,0.000101569756,0.00016943387,0.00014822562,0.89843667,0.0054073217,0.010640091,0.0020670376,0.070033945],"study_design_scores_gemma":[9.54731e-7,0.000008196008,0.00034211777,0.0000016258049,0.0000029905668,0.000008617272,0.000007852553,0.99769324,0.00023276811,0.0016027996,0.00009479521,0.000003917874],"about_ca_topic_score_codex":0.01561021,"about_ca_topic_score_gemma":0.012690841,"teacher_disagreement_score":0.01561021,"about_ca_system_score_codex":0.00086029427,"about_ca_system_score_gemma":0.0011693661,"threshold_uncertainty_score":0.031038702},"labels":[],"label_agreement":null},{"id":"W3126076084","doi":"","title":"Toward Rapid Automated Moment Tensor Solutions for Canada","year":2019,"lang":"en","type":"article","venue":"AGU Fall Meeting Abstracts","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Moment (physics); Computer science; Physics","score_opus":0.049830265706836,"score_gpt":0.292204787697876,"score_spread":0.24237452199104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126076084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014139516,0.0002476609,0.9424943,0.0007520366,0.00020540485,0.0001658811,0.0024429762,0.018045247,0.021506896],"genre_scores_gemma":[0.10886322,0.00028494353,0.86873883,0.00012325277,0.0000570036,0.0001178953,0.0032066482,0.002753242,0.015854983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991209,0.00009512171,0.00003522213,0.00013283962,0.00045923624,0.00015662725],"domain_scores_gemma":[0.9980653,0.00030784286,0.00007919521,0.0002618655,0.0011722642,0.00011352253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008532412,0.001706893,0.0010931991,0.0023910212,0.0023095533,0.002404271,0.0018215212,0.0013221942,0.02652073],"category_scores_gemma":[0.005401679,0.00087795214,0.0012114033,0.002276661,0.0007668104,0.0024772165,0.0027980532,0.0018483609,0.0080710035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003803397,0.00013084324,0.0023516638,0.00028489943,0.00012745088,0.00031623433,0.00064847106,0.13834485,0.017550342,0.16659759,0.1226012,0.55066615],"study_design_scores_gemma":[0.000055773216,0.000017311102,0.0005476305,0.000045590896,0.00002632546,0.000060237857,0.00035935914,0.8672533,0.007649247,0.07898692,0.04494582,0.000052501928],"about_ca_topic_score_codex":0.32460213,"about_ca_topic_score_gemma":0.42044434,"teacher_disagreement_score":0.6753979,"about_ca_system_score_codex":0.003748936,"about_ca_system_score_gemma":0.012276373,"threshold_uncertainty_score":0.64542544},"labels":[],"label_agreement":null},{"id":"W3135491679","doi":"10.1016/j.bspc.2021.102523","title":"Higher order tensor decomposition for proportional myoelectric control based on muscle synergies","year":2021,"lang":"en","type":"article","venue":"Biomedical Signal Processing and Control","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Matrix decomposition; Tensor (intrinsic definition); Computer science; Curse of dimensionality; Kinematics; Factorization; Matrix (chemical analysis); Tucker decomposition; Control theory (sociology); Pattern recognition (psychology); Artificial intelligence; Mathematics; Control (management); Algorithm; Tensor decomposition","score_opus":0.018319409186574053,"score_gpt":0.2994295976742046,"score_spread":0.28111018848763053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135491679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006619766,0.0003360706,0.9918922,0.000092691895,0.00004400512,0.000017973018,0.000040397314,0.000096132695,0.0008607231],"genre_scores_gemma":[0.40315658,0.0020834568,0.5861071,0.00010876027,0.00016018178,0.00016692303,0.0002625303,0.00022058818,0.00773392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998004,0.00006376473,0.000017088323,0.000042211603,0.000059459875,0.000017173623],"domain_scores_gemma":[0.9995685,0.00016086824,0.00005291139,0.000069788104,0.00011838265,0.000029635568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838177,0.00069690845,0.0005281055,0.00044257502,0.00023515779,0.000664177,0.00045924308,0.0005481518,0.002569901],"category_scores_gemma":[0.0015748041,0.00021333418,0.0005296574,0.0006459893,0.00040047552,0.0010656589,0.00048595003,0.00083313347,0.000423153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002396061,0.000142201,0.0005825891,0.0005396258,0.00011609839,0.00018066714,0.0002617976,0.3721445,0.083336934,0.19809967,0.0039177025,0.34043857],"study_design_scores_gemma":[0.0000037374027,0.000031561973,0.00019660669,0.000009941052,0.000008415607,0.00003172753,0.000008936437,0.98273325,0.0014806978,0.014388409,0.0010962338,0.000010395832],"about_ca_topic_score_codex":0.0019446653,"about_ca_topic_score_gemma":0.0015923907,"teacher_disagreement_score":0.002569901,"about_ca_system_score_codex":0.00032796804,"about_ca_system_score_gemma":0.0005308861,"threshold_uncertainty_score":0.008597195},"labels":[],"label_agreement":null},{"id":"W3138044305","doi":"10.3390/sym13030481","title":"Tensor-Based Adaptive Filtering Algorithms","year":2021,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Algorithm; Adaptive filter; Tensor (intrinsic definition); Computer science; System identification; Signal processing; Finite impulse response; Impulse response; Impulse (physics); Filter (signal processing); Rank (graph theory); Mathematics; Digital signal processing; Data mining","score_opus":0.0669231010285452,"score_gpt":0.33034385134100613,"score_spread":0.2634207503124609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138044305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011371423,0.00019693503,0.9975854,0.000048440375,0.000041299318,0.00001612604,0.00003263507,0.00017942,0.0007626012],"genre_scores_gemma":[0.094932616,0.0015152014,0.8962709,0.00015270844,0.00021087457,0.0001884096,0.00046454114,0.00021674958,0.006047921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916756,0.00020431785,0.00007076284,0.00018786416,0.00028714954,0.00008240808],"domain_scores_gemma":[0.99860245,0.0004855464,0.0001608365,0.000247321,0.00044677785,0.00005710706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014054466,0.0014280574,0.0010202874,0.0011888915,0.00060834025,0.0014814199,0.0012239265,0.001147613,0.004490522],"category_scores_gemma":[0.003951997,0.00038536737,0.0012463013,0.0014130439,0.0008093636,0.0017220523,0.001129925,0.0014974958,0.0024796368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019336087,0.0000622613,0.00096705573,0.0002970703,0.00015947514,0.00009932698,0.00018487296,0.34291124,0.019959886,0.1186805,0.005748953,0.51073605],"study_design_scores_gemma":[0.000010802653,0.000041179275,0.00016574924,0.000015849853,0.000018576768,0.00007253309,0.0000149983125,0.9688098,0.0031030423,0.022023866,0.0057011144,0.000022545302],"about_ca_topic_score_codex":0.0037468267,"about_ca_topic_score_gemma":0.0026368669,"teacher_disagreement_score":0.004490522,"about_ca_system_score_codex":0.00062769966,"about_ca_system_score_gemma":0.0010958413,"threshold_uncertainty_score":0.015022278},"labels":[],"label_agreement":null},{"id":"W3139119893","doi":"10.1109/tii.2021.3065719","title":"A Distributed Hierarchical Deep Computation Model for Federated Learning in Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Edge computing; Computation; Bandwidth (computing); Artificial intelligence; Edge device; Deep learning; Distributed computing; Big data; Machine learning; Enhanced Data Rates for GSM Evolution; Data modeling; Data mining; Computer network; Algorithm; Cloud computing; Database","score_opus":0.0979936206294948,"score_gpt":0.3357521216312969,"score_spread":0.23775850100180212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139119893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009513667,0.00013017474,0.98813534,0.00021187135,0.000036498262,0.000025809662,0.00007325752,0.0004005632,0.0014728114],"genre_scores_gemma":[0.758298,0.00036503296,0.23396167,0.00025983952,0.000057141908,0.00018655592,0.00033340455,0.00012587638,0.0064124116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994655,0.00012434917,0.000029396306,0.00015657477,0.00013261742,0.00009150633],"domain_scores_gemma":[0.9994604,0.00016150456,0.000046797988,0.000121629135,0.00016595093,0.000043622473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112785,0.0006562268,0.00080611353,0.00038684424,0.0006467501,0.0011070137,0.0018959028,0.0008006239,0.0026434714],"category_scores_gemma":[0.0017804235,0.0002856323,0.00064349273,0.00075824757,0.0008172947,0.0020107047,0.0014540948,0.0014232539,0.00051845144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119729375,0.00005489431,0.0006343531,0.00005038956,0.00002852693,0.00009385521,0.000071763636,0.9069578,0.0024835195,0.04296669,0.0031589267,0.0433796],"study_design_scores_gemma":[0.0000020429795,0.000005689346,0.00001958463,0.0000011875163,0.0000019146294,0.0000055351625,0.000003814601,0.9944495,0.00019478357,0.0051006298,0.0002134993,0.0000018195415],"about_ca_topic_score_codex":0.009224332,"about_ca_topic_score_gemma":0.013846195,"teacher_disagreement_score":0.009224332,"about_ca_system_score_codex":0.0014257453,"about_ca_system_score_gemma":0.0015605934,"threshold_uncertainty_score":0.018341243},"labels":[],"label_agreement":null},{"id":"W3154986566","doi":"10.1007/978-3-030-73100-7_4","title":"Tensor Multi-linear MMSE Estimation Using the Einstein Product","year":2021,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tensor (intrinsic definition); Estimator; Minimum mean square error; Outer product; Computer science; Mathematics; Algorithm; Tensor product; Applied mathematics; Pure mathematics; Statistics","score_opus":0.0891865329417268,"score_gpt":0.3656836136092793,"score_spread":0.2764970806675525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154986566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093636545,0.00049146125,0.99656266,0.00012270935,0.000067149966,0.00000696329,0.000046278692,0.00017168453,0.0015946132],"genre_scores_gemma":[0.07796871,0.0023319381,0.90348566,0.00029526866,0.00039504326,0.000077898905,0.00053814874,0.00036982386,0.014537453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994081,0.00020760832,0.000043726195,0.00012160398,0.00017876845,0.00004015393],"domain_scores_gemma":[0.99912494,0.00038968172,0.000070161586,0.00016124002,0.0002241497,0.000029856401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011635559,0.0014065687,0.0010411101,0.0006239521,0.00038479414,0.0015180497,0.0007957595,0.0009843722,0.0046730028],"category_scores_gemma":[0.003473441,0.00054680026,0.0007491954,0.0010040465,0.0008663693,0.0026168025,0.0015482605,0.0015688236,0.0027823655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029016135,0.00006416558,0.0009214575,0.0005609171,0.00028703696,0.0002283575,0.00025150846,0.15876286,0.03562983,0.33811787,0.017998597,0.44688728],"study_design_scores_gemma":[0.000013209454,0.00007884518,0.00045985228,0.00008383195,0.00005886243,0.00040382764,0.00003326641,0.8793091,0.0142923985,0.0901659,0.015031494,0.000069423935],"about_ca_topic_score_codex":0.0013635162,"about_ca_topic_score_gemma":0.002430707,"teacher_disagreement_score":0.0046730028,"about_ca_system_score_codex":0.00038739562,"about_ca_system_score_gemma":0.00079401734,"threshold_uncertainty_score":0.015632749},"labels":[],"label_agreement":null},{"id":"W3155581945","doi":"10.1109/tii.2021.3074152","title":"Federated Tensor Decomposition-Based Feature Extraction Approach for Industrial IoT","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Foundation for Innovation","keywords":"Computer science; Dimension (graph theory); Data mining; Tensor (intrinsic definition); Decomposition; Feature extraction; Dimensionality reduction; Tensor decomposition; Big data; Data modeling; Machine learning; Artificial intelligence; Database; Mathematics","score_opus":0.1128814839262955,"score_gpt":0.3448710913636853,"score_spread":0.23198960743738983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155581945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053697443,0.00010466281,0.9936313,0.00007727102,0.000016976472,0.000016191865,0.000053257212,0.0003042399,0.00042628773],"genre_scores_gemma":[0.39676204,0.0004433819,0.59879863,0.00011410219,0.00006854974,0.00012858275,0.00066986127,0.00012426826,0.002890641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993298,0.00015152806,0.00005243596,0.0001508449,0.00022457272,0.00009084294],"domain_scores_gemma":[0.9993444,0.0001275211,0.000090058435,0.00017976997,0.00021522687,0.00004297605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008046278,0.00077539176,0.0008410232,0.0009299217,0.0004538467,0.0009443442,0.0008953887,0.00051805255,0.001458525],"category_scores_gemma":[0.0017507768,0.0002969769,0.0010916439,0.0014370921,0.0006133339,0.001994519,0.0012656022,0.0011776004,0.00044359846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002772491,0.00012895782,0.0023351747,0.000156209,0.0001370823,0.00031161236,0.0002514161,0.48132545,0.02092154,0.05337417,0.0054125357,0.43536857],"study_design_scores_gemma":[0.00000556807,0.000022678014,0.00025851518,0.0000051689644,0.000010310877,0.000050551644,0.000027556942,0.98008806,0.0024429343,0.015796509,0.001281908,0.000010210305],"about_ca_topic_score_codex":0.0036796099,"about_ca_topic_score_gemma":0.0032932598,"teacher_disagreement_score":0.0036796099,"about_ca_system_score_codex":0.0006800872,"about_ca_system_score_gemma":0.001097744,"threshold_uncertainty_score":0.007316351},"labels":[],"label_agreement":null},{"id":"W3160129277","doi":"","title":"On convergence of matrix and tensor approximate diagonalization algorithms by unitary transformations","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Convergence (economics); Unitary state; Unitary transformation; Unitary matrix; Tensor (intrinsic definition); Mathematics; Algorithm; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Physics","score_opus":0.0190430690287734,"score_gpt":0.27073771319829276,"score_spread":0.25169464416951937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160129277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060249474,0.0004092563,0.9906612,0.0001344661,0.000067410605,0.000034490895,0.00001814889,0.00023846998,0.0024116205],"genre_scores_gemma":[0.22749722,0.0012734395,0.75960505,0.00024692356,0.00018759925,0.00026125033,0.00021778877,0.00080224563,0.009908429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986473,0.0005540814,0.000056791356,0.00018187659,0.0004681942,0.000091742084],"domain_scores_gemma":[0.99703,0.0018023842,0.00016048877,0.0003496813,0.0005635691,0.00009380656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031911358,0.0011575134,0.0009814351,0.0009984361,0.0006815218,0.0011119219,0.0011236254,0.0010339746,0.002626785],"category_scores_gemma":[0.010129829,0.00042129148,0.00055813114,0.000944246,0.0021263154,0.0023476377,0.0017509126,0.0018107375,0.001205925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030141737,0.00012705795,0.0008804335,0.0002937979,0.00008992162,0.00010051016,0.00043391727,0.4036745,0.011778921,0.3617947,0.0039112335,0.2166137],"study_design_scores_gemma":[0.000013027448,0.00003621781,0.00009458759,0.000014638343,0.0000040881537,0.000030806474,0.000021012616,0.95433617,0.0028374612,0.040793933,0.0018043013,0.000013692536],"about_ca_topic_score_codex":0.0026981425,"about_ca_topic_score_gemma":0.002230506,"teacher_disagreement_score":0.0031911358,"about_ca_system_score_codex":0.00084146205,"about_ca_system_score_gemma":0.0011183195,"threshold_uncertainty_score":0.016876519},"labels":[],"label_agreement":null},{"id":"W3161019910","doi":"10.3390/s21103555","title":"A Kalman Filter for Multilinear Forms and Its Connection with Tensorial Adaptive Filters","year":2021,"lang":"en","type":"article","venue":"Sensors","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Multilinear map; Kalman filter; Adaptive filter; Tensor (intrinsic definition); Algorithm; Extended Kalman filter; Computer science; Context (archaeology); Mathematics; Invariant extended Kalman filter; Filter (signal processing); Artificial intelligence","score_opus":0.04993205294080435,"score_gpt":0.3074780558820816,"score_spread":0.2575460029412773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161019910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007874169,0.00022090055,0.9982936,0.000071481976,0.000034493285,0.000008076299,0.000015806776,0.000053347216,0.00051488256],"genre_scores_gemma":[0.26111576,0.0031373207,0.7277779,0.00024794685,0.0003353219,0.00020634857,0.0002157015,0.00013510155,0.006828698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905604,0.00022256294,0.00007127548,0.0003088254,0.00026971757,0.000071556904],"domain_scores_gemma":[0.9987412,0.00057171297,0.0002272904,0.0001331931,0.00027974718,0.00004688685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014948167,0.0009160579,0.0007051243,0.000687998,0.00062087306,0.0013323792,0.0008955619,0.0012128252,0.002056929],"category_scores_gemma":[0.004832562,0.00044567572,0.001025999,0.0010438632,0.0013179509,0.0018084748,0.0011620761,0.0020154428,0.0007226477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115956296,0.000039357892,0.00113631,0.00024586983,0.00008847094,0.00015410194,0.00033884763,0.39636242,0.01010987,0.4280143,0.0024977257,0.16089691],"study_design_scores_gemma":[0.000010495476,0.00005988569,0.00034203482,0.000038051396,0.00002385473,0.000093415365,0.000022381937,0.915793,0.0022406338,0.07263946,0.008692542,0.00004421787],"about_ca_topic_score_codex":0.00562154,"about_ca_topic_score_gemma":0.0029757018,"teacher_disagreement_score":0.00562154,"about_ca_system_score_codex":0.0009257871,"about_ca_system_score_gemma":0.0011134386,"threshold_uncertainty_score":0.011177659},"labels":[],"label_agreement":null},{"id":"W3166592160","doi":"10.1016/j.inffus.2021.05.014","title":"A tensor-network-based big data fusion framework for Cyber–Physical–Social Systems (CPSS)","year":2021,"lang":"en","type":"article","venue":"Information Fusion","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Foundation for Innovation","keywords":"Computer science; Big data; Tensor decomposition; Tensor (intrinsic definition); External Data Representation; Tucker decomposition; Data mining; Data science; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.09798327447700858,"score_gpt":0.34463952610559273,"score_spread":0.24665625162858415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166592160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020400416,0.00020819141,0.9962288,0.000268333,0.000057562127,0.000029849629,0.00018575825,0.00032346678,0.00065797195],"genre_scores_gemma":[0.3086026,0.0011113737,0.6847308,0.00028936187,0.00030719637,0.0002302176,0.001629456,0.00022283876,0.002876092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845374,0.0005533235,0.000113332586,0.00031478904,0.00042058076,0.00014417619],"domain_scores_gemma":[0.99806994,0.0004374215,0.00026427142,0.00035194226,0.0006679914,0.0002085356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029756534,0.0013789003,0.001362223,0.0018349218,0.0009440167,0.0026267609,0.0019338266,0.00097342,0.0020652255],"category_scores_gemma":[0.005116639,0.0005080066,0.0017249517,0.0024301417,0.0012164777,0.00396642,0.0032254525,0.0020632197,0.0007167055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020607383,0.00013646373,0.0025009895,0.00029519232,0.00030970678,0.00022708497,0.00032358113,0.59404004,0.0062323106,0.24143985,0.009855575,0.14443313],"study_design_scores_gemma":[0.000003402074,0.00001788932,0.00019742624,0.00001022384,0.000015612392,0.000022145541,0.000026729236,0.9456947,0.00055518904,0.05155298,0.0018910156,0.000012646604],"about_ca_topic_score_codex":0.01221531,"about_ca_topic_score_gemma":0.010170075,"teacher_disagreement_score":0.01221531,"about_ca_system_score_codex":0.001377406,"about_ca_system_score_gemma":0.002792367,"threshold_uncertainty_score":0.024288416},"labels":[],"label_agreement":null},{"id":"W3170257148","doi":"10.1109/ojsp.2021.3084541","title":"A Tensor Framework for Multi-Linear Complex MMSE Estimation","year":2021,"lang":"en","type":"article","venue":"IEEE Open Journal of Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Covariance; Estimator; Mathematics; Minimum mean square error; Tensor product; Applied mathematics; Algorithm; Computer science; Mathematical optimization; Pure mathematics; Statistics","score_opus":0.26780788103721254,"score_gpt":0.4623984886535521,"score_spread":0.19459060761633956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170257148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006131185,0.00026260604,0.99820244,0.00007461929,0.000034869583,0.0000064791516,0.00004010679,0.00006236816,0.00070328545],"genre_scores_gemma":[0.09983006,0.0025597562,0.88965416,0.0002331199,0.00046599866,0.00010657699,0.000426119,0.0002281377,0.006496036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991893,0.00034050617,0.00006488369,0.00013718702,0.00021637016,0.000051679293],"domain_scores_gemma":[0.9986628,0.00043963562,0.00020251916,0.00023759903,0.00039366892,0.000063767184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014993972,0.0015216868,0.0008382925,0.0009720117,0.00046252838,0.0016121883,0.00096549134,0.0009831974,0.0027130856],"category_scores_gemma":[0.0032467504,0.00037244344,0.0009949792,0.0012593649,0.0013123383,0.002372201,0.0013148291,0.0017138117,0.0012959932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008832642,0.00003815425,0.00068023044,0.00027745633,0.00009745863,0.0002812372,0.00023328599,0.21051358,0.017778542,0.64439213,0.004251947,0.121367656],"study_design_scores_gemma":[0.0000063876414,0.0000970329,0.00034849174,0.000043868156,0.000031551277,0.00031437475,0.000042277734,0.85207486,0.0039846348,0.12609962,0.016902227,0.00005464929],"about_ca_topic_score_codex":0.0018808632,"about_ca_topic_score_gemma":0.0018808453,"teacher_disagreement_score":0.0027130856,"about_ca_system_score_codex":0.0006541677,"about_ca_system_score_gemma":0.00084105163,"threshold_uncertainty_score":0.009076178},"labels":[],"label_agreement":null},{"id":"W3174048467","doi":"10.48550/arxiv.2106.11827","title":"Lower and Upper Bounds on the VC-Dimension of Tensor Network Models","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Dimension (graph theory); Mathematics; Tensor (intrinsic definition); Upper and lower bounds; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.11438509385522522,"score_gpt":0.22211115428968278,"score_spread":0.10772606043445757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174048467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050915662,0.014141888,0.8918404,0.009748764,0.0007254085,0.00016399885,0.0034302804,0.001485757,0.027547875],"genre_scores_gemma":[0.76471686,0.014930512,0.18648994,0.0044781375,0.003331335,0.0013183397,0.0065054717,0.0020473148,0.016182115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99159825,0.0024981524,0.00042034843,0.0019091354,0.002289901,0.0012841959],"domain_scores_gemma":[0.92442095,0.055289518,0.0031464584,0.009127253,0.005487021,0.0025287508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009461868,0.003415235,0.003105747,0.0039997557,0.002568981,0.006566377,0.005227413,0.0035878364,0.008419285],"category_scores_gemma":[0.063745186,0.0015372561,0.002519929,0.0034747566,0.0058441344,0.015081584,0.0091575,0.015166475,0.0025068843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002242781,0.00020021788,0.0056241304,0.0007540103,0.00017993311,0.00022101273,0.00061934325,0.1229854,0.0028624544,0.8000034,0.021866344,0.044459466],"study_design_scores_gemma":[0.000012690136,0.000047765086,0.0008327039,0.00018669391,0.00004241137,0.00013756889,0.00007386708,0.4199564,0.0011850644,0.5719689,0.0054917596,0.00006409028],"about_ca_topic_score_codex":0.0042549768,"about_ca_topic_score_gemma":0.005212626,"teacher_disagreement_score":0.009461868,"about_ca_system_score_codex":0.0055298205,"about_ca_system_score_gemma":0.0023585148,"threshold_uncertainty_score":0.05003971},"labels":[],"label_agreement":null},{"id":"W3176251287","doi":"10.1109/jiot.2021.3092360","title":"Tensor Graph Attention Network for Knowledge Reasoning in Internet of Things","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Theoretical computer science; Premise; Graph; Knowledge representation and reasoning; Artificial intelligence","score_opus":0.03914019874936194,"score_gpt":0.3253981482133418,"score_spread":0.28625794946397987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176251287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032801483,0.0012922676,0.95933,0.0010836723,0.00014622537,0.000051028495,0.00036488965,0.0011447874,0.0037855795],"genre_scores_gemma":[0.7885704,0.0019646643,0.20194374,0.00051835907,0.00017184023,0.00011401464,0.0011921423,0.00012400604,0.0054007615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951637,0.000113394795,0.000032196833,0.00015586134,0.000119924895,0.000062367995],"domain_scores_gemma":[0.9992816,0.00028432987,0.00010094131,0.000109152534,0.00017713015,0.000046968038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006969297,0.0007750863,0.00059465645,0.0015439108,0.0006079261,0.0010822909,0.0011627066,0.00081623666,0.0018331967],"category_scores_gemma":[0.0032087287,0.00031344488,0.0010905135,0.0016507189,0.00073654996,0.0028894437,0.001066255,0.0014019108,0.00031962508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015667288,0.000102216516,0.003047432,0.00024794036,0.00017762456,0.0003152429,0.00028106847,0.6612744,0.0053589554,0.09281853,0.007532791,0.2286871],"study_design_scores_gemma":[0.0000020709813,0.000009758216,0.0002977422,0.0000060452076,0.000021333344,0.000024392642,0.000015785223,0.9643414,0.0005525138,0.033649568,0.0010727391,0.000006624486],"about_ca_topic_score_codex":0.027153837,"about_ca_topic_score_gemma":0.024463234,"teacher_disagreement_score":0.027153837,"about_ca_system_score_codex":0.0017790418,"about_ca_system_score_gemma":0.0011099692,"threshold_uncertainty_score":0.053991616},"labels":[],"label_agreement":null},{"id":"W3178270665","doi":"10.1109/iccvw54120.2021.00466","title":"A unified framework for non-negative matrix and tensor factorisations with a smoothed Wasserstein loss","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Tensor (intrinsic definition); Metric (unit); Matrix (chemical analysis); Dual (grammatical number); Mathematics; Mathematical optimization; Applied mathematics; Regular polygon; Space (punctuation); Function (biology); Algorithm; Computer science; Algebra over a field; Pure mathematics; Geometry","score_opus":0.05118225196005899,"score_gpt":0.3581749316541139,"score_spread":0.3069926796940549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178270665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072989496,0.00010310195,0.9984688,0.00012327054,0.000025250585,0.000012699965,0.0000256216,0.00005929801,0.0004519927],"genre_scores_gemma":[0.07263005,0.0007987096,0.9191659,0.00026194032,0.0003016025,0.00024499305,0.00041439332,0.0005859072,0.005596455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983011,0.00071205833,0.00010656695,0.00028800804,0.0004730763,0.0001192856],"domain_scores_gemma":[0.9973231,0.0011140412,0.0003177833,0.00042983267,0.000569056,0.0002462205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048946613,0.0022441212,0.0016072531,0.0019114601,0.0008323142,0.0037398413,0.0028499488,0.0023128926,0.0042092013],"category_scores_gemma":[0.010670688,0.00082442164,0.0019895507,0.002038887,0.0028877226,0.0063668364,0.00427345,0.0045918277,0.0015918532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004838386,0.000059730366,0.00040372158,0.00012973235,0.00005474574,0.00012732299,0.00011433542,0.3472665,0.0027363217,0.6087141,0.0038617568,0.03648333],"study_design_scores_gemma":[0.000006776464,0.000029835444,0.00007019128,0.000017022583,0.0000069871794,0.00004556192,0.000015567202,0.83234274,0.0004394945,0.16405672,0.0029534546,0.000015626194],"about_ca_topic_score_codex":0.0034784588,"about_ca_topic_score_gemma":0.004109646,"teacher_disagreement_score":0.0048946613,"about_ca_system_score_codex":0.0018811068,"about_ca_system_score_gemma":0.002256461,"threshold_uncertainty_score":0.02588576},"labels":[],"label_agreement":null},{"id":"W3178347231","doi":"10.1049/itr2.12099","title":"Rail transit OD‐matrix completion via manifold regularized tensor factorisation","year":2021,"lang":"en","type":"article","venue":"IET Intelligent Transport Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Manifold (fluid mechanics); Transit (satellite); Matrix (chemical analysis); Computer science; Matrix decomposition; Algebra over a field; Mathematics; Transport engineering; Physics; Engineering; Pure mathematics; Public transport; Materials science; Mechanical engineering","score_opus":0.0679966865238819,"score_gpt":0.31970764138725155,"score_spread":0.25171095486336964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178347231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009184048,0.0001809867,0.9892223,0.00015761329,0.000039109997,0.000040706374,0.00016553307,0.0005589539,0.0004507756],"genre_scores_gemma":[0.4542054,0.00060165103,0.53554,0.00022732753,0.00019013807,0.0002312436,0.0031103315,0.00045909162,0.0054347795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871683,0.00047172952,0.00006265319,0.00037904424,0.00021359175,0.00015622444],"domain_scores_gemma":[0.9975552,0.00089321425,0.00028017678,0.0003906178,0.0007311327,0.00014973817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019658257,0.0017684097,0.0013418269,0.0010129256,0.0005761733,0.0010787623,0.0013451619,0.0010122095,0.0022861396],"category_scores_gemma":[0.0059608794,0.00053170323,0.0017177738,0.0013055824,0.0011473546,0.0016782808,0.0013087135,0.0026322135,0.001233191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027244582,0.00013782899,0.0023178465,0.00029993747,0.00018152405,0.00020663254,0.00026478287,0.74519295,0.005791937,0.015501158,0.009687624,0.2201453],"study_design_scores_gemma":[0.000005494393,0.000020930986,0.0001940094,0.0000070358046,0.000006837257,0.000016015656,0.000020143803,0.99390346,0.000552085,0.0045696576,0.00069514394,0.000009209348],"about_ca_topic_score_codex":0.021160774,"about_ca_topic_score_gemma":0.01391974,"teacher_disagreement_score":0.021160774,"about_ca_system_score_codex":0.0008256697,"about_ca_system_score_gemma":0.0021773363,"threshold_uncertainty_score":0.042075217},"labels":[],"label_agreement":null},{"id":"W3178568068","doi":"10.3390/network1020005","title":"Multi-Domain Communication Systems and Networks: A Tensor-Based Approach","year":2021,"lang":"en","type":"article","venue":"Network","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Computer science; Transmission (telecommunications); Domain (mathematical analysis); Frequency domain; Multiplexing; MIMO; Tensor algebra; Electronic engineering; Physical layer; Topology (electrical circuits); Theoretical computer science; Channel (broadcasting); Mathematics; Wireless; Telecommunications; Engineering; Algebra over a field","score_opus":0.05520534064176455,"score_gpt":0.3034051072146086,"score_spread":0.24819976657284407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178568068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050677834,0.005264748,0.9743456,0.0018009817,0.00031029788,0.00004378086,0.000122060264,0.000105084146,0.012939595],"genre_scores_gemma":[0.3600802,0.020495541,0.59262174,0.0009778457,0.0016413109,0.00023456464,0.00037355314,0.00021466547,0.023360593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993166,0.00026580514,0.000030484867,0.00011663064,0.00019941443,0.00007108361],"domain_scores_gemma":[0.999246,0.0002507723,0.000111907975,0.00012833555,0.00017759761,0.00008551682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097472843,0.0011340178,0.0006628639,0.001069025,0.00075094344,0.0027487683,0.0010540059,0.0012774013,0.0032032584],"category_scores_gemma":[0.0012332604,0.00049107894,0.00082787365,0.0012168383,0.0023830114,0.0029069935,0.0015645237,0.0024033252,0.0008247406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029374627,0.000026162159,0.00035203644,0.00016303625,0.000033859225,0.00016617023,0.00021715324,0.11860126,0.0034430698,0.8493252,0.0032667448,0.024375971],"study_design_scores_gemma":[0.000009934705,0.00006945064,0.00032982975,0.00008793494,0.000019719873,0.00027440884,0.00014693827,0.5100392,0.0010943465,0.4559028,0.03197702,0.0000483221],"about_ca_topic_score_codex":0.0026644443,"about_ca_topic_score_gemma":0.0023884089,"teacher_disagreement_score":0.0032032584,"about_ca_system_score_codex":0.0016995692,"about_ca_system_score_gemma":0.0010748002,"threshold_uncertainty_score":0.012331307},"labels":[],"label_agreement":null},{"id":"W3189608635","doi":"10.1109/icc42927.2021.9500957","title":"A Tensor based Precoder and Receiver for MIMO GFDM systems","year":2021,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Precoding; Tensor (intrinsic definition); Channel (broadcasting); Orthogonal frequency-division multiplexing; Computer science; MIMO-OFDM; Control theory (sociology); Interference (communication); Frequency domain; Topology (electrical circuits); Mathematics; Electronic engineering; Algorithm; Telecommunications; Engineering; Mathematical analysis; Geometry","score_opus":0.0691470913764628,"score_gpt":0.3325845956879464,"score_spread":0.2634375043114836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189608635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053835423,0.00021627462,0.9915241,0.00016708217,0.00007866102,0.00002156457,0.00006351771,0.00023244295,0.0023128837],"genre_scores_gemma":[0.30773184,0.0009928235,0.6781057,0.0002437501,0.00023630794,0.00007276898,0.00025839472,0.00008275277,0.01227564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996228,0.00011607476,0.000017589313,0.00005342273,0.0001540487,0.000035990564],"domain_scores_gemma":[0.9997166,0.0000776877,0.00003287268,0.00005726043,0.00009970903,0.000015853511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004618792,0.0007057139,0.00047152146,0.00022902951,0.00043918283,0.0006528735,0.00049904035,0.0007371391,0.0019190182],"category_scores_gemma":[0.00082413334,0.00020106953,0.00047431953,0.00048582893,0.0005445632,0.0008578214,0.00044036462,0.00094259396,0.0009387272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028402454,0.00010065857,0.0008134538,0.0002574597,0.000110504596,0.00052327215,0.00031224353,0.4771437,0.095564656,0.22741926,0.0075880173,0.18988284],"study_design_scores_gemma":[0.0000072710286,0.00011260402,0.00015432932,0.0000142023255,0.000018881983,0.00022847211,0.000017488463,0.9671205,0.01418709,0.011629864,0.006483132,0.000026115424],"about_ca_topic_score_codex":0.002150541,"about_ca_topic_score_gemma":0.0032708924,"teacher_disagreement_score":0.002150541,"about_ca_system_score_codex":0.00061993557,"about_ca_system_score_gemma":0.0007566304,"threshold_uncertainty_score":0.006419778},"labels":[],"label_agreement":null},{"id":"W3190122703","doi":"10.1109/isscs52333.2021.9497456","title":"A Tensorial Affine Projection Algorithm","year":2021,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Ministry of Education","keywords":"Multilinear map; Identification (biology); Affine transformation; Tensor (intrinsic definition); Projection (relational algebra); Algorithm; Computer science; System identification; Space (punctuation); Mathematics; Data modeling; Pure mathematics","score_opus":0.04702315278518103,"score_gpt":0.338342309241975,"score_spread":0.29131915645679396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190122703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014152377,0.00009780205,0.99704415,0.00006719676,0.00003767726,0.000019498408,0.00003941744,0.00022971159,0.0010492259],"genre_scores_gemma":[0.09271633,0.00056350656,0.8994335,0.00012646514,0.00013372231,0.0001424409,0.00038963073,0.00020248254,0.0062919566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900347,0.000320504,0.00006109836,0.00025338726,0.00027784889,0.00008370525],"domain_scores_gemma":[0.99884677,0.00031634723,0.00009245136,0.00027193964,0.00039729307,0.0000752045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013244471,0.0012213658,0.00086330174,0.0007509627,0.00055943435,0.0017393611,0.00097431574,0.0011027745,0.006145648],"category_scores_gemma":[0.0034253073,0.00043433663,0.000978542,0.001247574,0.0010074337,0.0018416563,0.001759183,0.0020141073,0.0031626145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023395695,0.000085914355,0.0008484793,0.00022338255,0.00012223357,0.00015844214,0.0001664015,0.31091106,0.017838327,0.16129057,0.008963228,0.49915797],"study_design_scores_gemma":[0.000013566155,0.000077084915,0.0001473468,0.000015320787,0.00001360261,0.00011982501,0.00001990231,0.960304,0.0039550816,0.027267138,0.008047257,0.000019824798],"about_ca_topic_score_codex":0.0017949928,"about_ca_topic_score_gemma":0.0012372654,"teacher_disagreement_score":0.006145648,"about_ca_system_score_codex":0.0004684915,"about_ca_system_score_gemma":0.0016157966,"threshold_uncertainty_score":0.020559251},"labels":[],"label_agreement":null},{"id":"W3190268122","doi":"10.1109/tii.2021.3100978","title":"An Incremental Boolean Tensor Factorization for Knowledge Reasoning in Artificial Intelligence of Things","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Interpretability; Theoretical computer science; Artificial intelligence; Graph; Machine learning","score_opus":0.14798447833846134,"score_gpt":0.362838364592646,"score_spread":0.21485388625418467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190268122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028349767,0.00034536753,0.9953922,0.00017837861,0.000055490847,0.0000431007,0.00012868879,0.00036362733,0.0006580639],"genre_scores_gemma":[0.1675538,0.0012470469,0.8274797,0.00022607422,0.00017909867,0.00019166096,0.0012020099,0.00013217084,0.00178839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989241,0.0002630474,0.000094872514,0.00026059742,0.00034607903,0.000111263005],"domain_scores_gemma":[0.9989365,0.00031558075,0.00014344488,0.00018067985,0.00032862116,0.00009510433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011061354,0.0012260403,0.00089198735,0.002049247,0.00083826896,0.0016103465,0.0013333611,0.00065128127,0.002618737],"category_scores_gemma":[0.004107399,0.00037849514,0.0018128641,0.002740586,0.00093234587,0.0028304805,0.001565572,0.0014623948,0.00081864203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029616622,0.00015405941,0.0023454544,0.0006933219,0.0002070245,0.00047947117,0.00050747185,0.22060356,0.017849302,0.13076471,0.015997294,0.6101022],"study_design_scores_gemma":[0.000011681122,0.00003739959,0.0002744166,0.000022874321,0.000039181283,0.000103285645,0.00006489039,0.93732333,0.002496679,0.055041097,0.0045592193,0.000025911475],"about_ca_topic_score_codex":0.012615537,"about_ca_topic_score_gemma":0.012202504,"teacher_disagreement_score":0.012615537,"about_ca_system_score_codex":0.0012315161,"about_ca_system_score_gemma":0.0018869477,"threshold_uncertainty_score":0.025084198},"labels":[],"label_agreement":null},{"id":"W3192889988","doi":"10.1109/icalt52272.2021.00057","title":"IRT++: Improving Student Response Prediction With Gaussian Initialisation and Other Modifications","year":2021,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interpretability; Item response theory; Computer science; Simple (philosophy); Convergence (economics); Machine learning; Artificial intelligence; Extension (predicate logic); Model parameter; Gaussian; Gaussian process; Gradient descent; Mathematics; Statistics; Artificial neural network","score_opus":0.05809367413002877,"score_gpt":0.3396688124459596,"score_spread":0.28157513831593084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192889988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067112125,0.00011400881,0.985782,0.0002855584,0.00008802133,0.0000832212,0.00014381776,0.0059896302,0.000802454],"genre_scores_gemma":[0.15526639,0.00014133849,0.83667976,0.00048359085,0.00012584028,0.0004004157,0.0010514836,0.0015312169,0.0043200688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542,0.002842498,0.00020494187,0.0007436571,0.00059125485,0.00019760862],"domain_scores_gemma":[0.989938,0.0044942065,0.0005779195,0.0029020251,0.0017864533,0.0003014239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008889229,0.0017790986,0.001612678,0.0009995545,0.0004837391,0.0013905009,0.0032677676,0.002389393,0.006557387],"category_scores_gemma":[0.03852192,0.00082638994,0.0017649075,0.0014287933,0.00095737923,0.0030668466,0.0025085218,0.0036461498,0.008397109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006064876,0.00049257575,0.004519556,0.00021964761,0.00021730301,0.00012613458,0.0003704089,0.312091,0.007971651,0.013496316,0.013674475,0.6462145],"study_design_scores_gemma":[0.000032006712,0.00008122738,0.00044848822,0.000015013652,0.000015374339,0.00003699617,0.000019850782,0.98823243,0.0022905818,0.006878112,0.0019226063,0.000027421602],"about_ca_topic_score_codex":0.0068031037,"about_ca_topic_score_gemma":0.0066147693,"teacher_disagreement_score":0.008889229,"about_ca_system_score_codex":0.00085495354,"about_ca_system_score_gemma":0.001668895,"threshold_uncertainty_score":0.047011316},"labels":[],"label_agreement":null},{"id":"W3196986231","doi":"10.1214/24-ba1428","title":"Scalable Spatiotemporally Varying Coefficient Modeling with Bayesian Kernelized Tensor Regression","year":2024,"lang":"en","type":"article","venue":"Bayesian Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Gibbs sampling; Markov chain Monte Carlo; Covariance; Covariate; Bayesian inference; Hyperparameter; Mathematics; Computer science; Kernel (algebra); Bayesian probability; Artificial intelligence; Data mining; Algorithm; Machine learning; Pattern recognition (psychology); Statistics","score_opus":0.029045937899116445,"score_gpt":0.3099755801192388,"score_spread":0.28092964222012234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196986231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041044476,0.00014938798,0.99486154,0.00013971711,0.0000152330085,0.000018346256,0.00018947005,0.0002884272,0.00023346837],"genre_scores_gemma":[0.30888286,0.0011632596,0.683541,0.0002504938,0.00016421205,0.00029055114,0.0022528374,0.00051243225,0.0029424196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815303,0.0008184395,0.00010346277,0.0004633087,0.00031048144,0.00015122957],"domain_scores_gemma":[0.9955314,0.0023166458,0.00067623134,0.0006588929,0.00066238455,0.0001545613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034089473,0.0014299633,0.0015226194,0.0011142339,0.00057174225,0.0013054282,0.0022626314,0.001124398,0.001813338],"category_scores_gemma":[0.013487208,0.0009681987,0.0017561796,0.0019243622,0.00091352453,0.0024598716,0.0014575981,0.0024181711,0.0008372714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012414141,0.000073999174,0.003945652,0.00014962706,0.00020248786,0.00017563954,0.00016665478,0.8445252,0.004292127,0.06109315,0.0046157506,0.08063548],"study_design_scores_gemma":[0.000005233254,0.0000069729854,0.00020377409,0.000005308553,0.000008795643,0.000014070901,0.0000065848867,0.9870323,0.00024012195,0.0119354725,0.00053172425,0.000009617462],"about_ca_topic_score_codex":0.029514775,"about_ca_topic_score_gemma":0.02911698,"teacher_disagreement_score":0.029514775,"about_ca_system_score_codex":0.0011718632,"about_ca_system_score_gemma":0.0026119791,"threshold_uncertainty_score":0.058686018},"labels":[],"label_agreement":null},{"id":"W3197057273","doi":"10.1109/tim.2021.3105236","title":"Improving the Signal-to-Noise-Ratio of Free Induction Decay Signals Using a New Multilinear Singular Value Decomposition-Based Filter","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China; Wuhan Municipal Science and Technology Bureau; Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Singular value decomposition; Noise reduction; Noise (video); Signal-to-noise ratio (imaging); SIGNAL (programming language); Interference (communication); Filter (signal processing); Noise measurement; Mathematics; Algorithm; Physics; Acoustics; Computer science; Statistics; Artificial intelligence; Telecommunications","score_opus":0.08582058538581315,"score_gpt":0.3226535991598306,"score_spread":0.23683301377401744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197057273","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015417955,0.00020881786,0.9832322,0.00006311942,0.00004261154,0.000025592988,0.000030737607,0.00042175432,0.0005571837],"genre_scores_gemma":[0.15367173,0.0005005438,0.84309685,0.00012439526,0.00006250788,0.0001066557,0.00030058486,0.00012917999,0.0020075582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.00012689456,0.000058858855,0.00024134293,0.00058108754,0.00006915296],"domain_scores_gemma":[0.99912745,0.0002482116,0.00007983959,0.00006769201,0.0004341178,0.000042691794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011062926,0.0011046118,0.00070586725,0.0009063148,0.0003978564,0.0007398137,0.00073653314,0.00084408565,0.0010471945],"category_scores_gemma":[0.0021130736,0.00034532908,0.0008587685,0.00084708695,0.00045280808,0.001273805,0.0006102014,0.0008786592,0.00058307475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006853103,0.00030844216,0.0027447846,0.0004261394,0.00013596892,0.00019192878,0.00027616715,0.07004112,0.33024982,0.008718903,0.0029885448,0.5832329],"study_design_scores_gemma":[0.000033349996,0.00021674277,0.0012397144,0.000018186716,0.00004487373,0.00014962348,0.000028252402,0.90541524,0.08583856,0.0012665887,0.0056971605,0.000051705283],"about_ca_topic_score_codex":0.0022397384,"about_ca_topic_score_gemma":0.002447941,"teacher_disagreement_score":0.0022397384,"about_ca_system_score_codex":0.00046427918,"about_ca_system_score_gemma":0.00089757325,"threshold_uncertainty_score":0.0058506727},"labels":[],"label_agreement":null},{"id":"W3197686036","doi":"10.1109/tcyb.2021.3106485","title":"Multiview PCA: A Methodology of Feature Extraction and Dimension Reduction for High-Order Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dimensionality reduction; Computer science; Principal component analysis; Artificial intelligence; Dimension (graph theory); Projection (relational algebra); Tensor (intrinsic definition); Feature (linguistics); Pattern recognition (psychology); Mathematics; Algorithm; Combinatorics","score_opus":0.1529325046986833,"score_gpt":0.3962758409918483,"score_spread":0.243343336293165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197686036","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007317544,0.00030738575,0.99812406,0.00007383874,0.000046095043,0.000030027188,0.000060271228,0.00035379207,0.00027268886],"genre_scores_gemma":[0.029424878,0.0014092161,0.965886,0.00013043259,0.00023108475,0.0002211158,0.0006406542,0.00033120372,0.0017252966],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979184,0.00035982506,0.00014561391,0.0005682156,0.00086472277,0.00014323831],"domain_scores_gemma":[0.9984236,0.00048563653,0.00023851459,0.00032073614,0.00044463985,0.0000869108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017541735,0.0024206927,0.001741888,0.0033974084,0.0011055577,0.0019789613,0.0020875272,0.0010472414,0.0027284487],"category_scores_gemma":[0.0034538484,0.0010136194,0.0027085892,0.004050779,0.0018453433,0.0026781121,0.0023200468,0.0030472192,0.0015977306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016082793,0.00011983125,0.0018452366,0.00082199415,0.0003964924,0.00033380368,0.0005209451,0.10793349,0.064905226,0.057718556,0.013788693,0.75145495],"study_design_scores_gemma":[0.000034312554,0.00019220808,0.0023101724,0.00010632762,0.000111673384,0.00061624893,0.00018128297,0.8635832,0.032268833,0.06267551,0.037717402,0.00020278696],"about_ca_topic_score_codex":0.0046406914,"about_ca_topic_score_gemma":0.0042179925,"teacher_disagreement_score":0.0046406914,"about_ca_system_score_codex":0.00082861504,"about_ca_system_score_gemma":0.0024637626,"threshold_uncertainty_score":0.009277105},"labels":[],"label_agreement":null},{"id":"W3202635391","doi":"10.1109/tits.2021.3113608","title":"Low-Rank Autoregressive Tensor Completion for Spatiotemporal Traffic Data Imputation","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":153,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Canada Foundation for Innovation","keywords":"Missing data; Imputation (statistics); Autoregressive model; Computer science; Data mining; Matrix completion; Time series; Minification; Temporal database; Regularization (linguistics); Algorithm; Econometrics; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning","score_opus":0.18377282755485508,"score_gpt":0.27077406332608006,"score_spread":0.08700123577122498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202635391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007653469,0.0002671959,0.9904558,0.0003107995,0.000054846867,0.00003598733,0.00024185017,0.0004778159,0.0005023072],"genre_scores_gemma":[0.3075838,0.0009923194,0.6823678,0.0004277258,0.00022880826,0.00035512136,0.0034723538,0.0005158275,0.0040562456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816567,0.00085262395,0.0001240705,0.00035418896,0.0003320045,0.00017144652],"domain_scores_gemma":[0.9935334,0.003590792,0.00064605044,0.00075051375,0.0011525137,0.00032673212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004467996,0.0017424612,0.0016935074,0.0008615478,0.00070600887,0.001208997,0.0018977508,0.001529921,0.0019902163],"category_scores_gemma":[0.013701794,0.00071787345,0.0017620525,0.0016211808,0.0015947819,0.002232693,0.0016751288,0.0039694523,0.0009494826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014266379,0.00009914202,0.0014513233,0.00023595872,0.000102634054,0.00015704035,0.00013409003,0.9189624,0.0024231204,0.02698562,0.005913219,0.043392748],"study_design_scores_gemma":[0.0000046536343,0.000011251614,0.00007504364,0.000005270519,0.0000031803047,0.000008945775,0.000008572496,0.9947378,0.0003467204,0.0044122236,0.0003787062,0.0000075762114],"about_ca_topic_score_codex":0.019001385,"about_ca_topic_score_gemma":0.018569915,"teacher_disagreement_score":0.019001385,"about_ca_system_score_codex":0.001297374,"about_ca_system_score_gemma":0.0032924318,"threshold_uncertainty_score":0.037781596},"labels":[],"label_agreement":null},{"id":"W3207498650","doi":"10.1109/tnse.2021.3119324","title":"Tensor Train-Based Multiple Clusterings for Big Data in Cyber-Physical-Social Systems and Its Efficient Implementations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Big data; Tensor (intrinsic definition); Overhead (engineering); Implementation; Parallel computing; Data mining; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.08272881589556075,"score_gpt":0.3230384472093226,"score_spread":0.24030963131376187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207498650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037667323,0.00021336866,0.99416625,0.00020640345,0.000057063593,0.000038402057,0.0000884486,0.0006718382,0.0007914403],"genre_scores_gemma":[0.20820005,0.0007950111,0.7859383,0.00016152817,0.0001522149,0.00025106932,0.0008210786,0.00033730117,0.0033434145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985153,0.00040759408,0.00011965201,0.00029995918,0.0005180058,0.00013945407],"domain_scores_gemma":[0.99793017,0.0004552993,0.00021395377,0.00042944858,0.0007921316,0.00017901858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014645339,0.001409814,0.0011508864,0.0017077057,0.001788386,0.0017582102,0.00226295,0.0010131665,0.0034168812],"category_scores_gemma":[0.005514415,0.00061682693,0.001670181,0.0029424531,0.0014141478,0.0031271756,0.002158229,0.0022321746,0.0014727764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020581804,0.000109433095,0.0025065555,0.00029271562,0.00016766936,0.00017946625,0.0003969784,0.5969105,0.006270538,0.11924497,0.010637217,0.2630782],"study_design_scores_gemma":[0.000004143463,0.000011853895,0.00012887453,0.0000047295334,0.000005620495,0.000020616797,0.00002717058,0.98422194,0.0007819906,0.013463363,0.0013188783,0.000010920049],"about_ca_topic_score_codex":0.02701889,"about_ca_topic_score_gemma":0.02109856,"teacher_disagreement_score":0.02701889,"about_ca_system_score_codex":0.0023704558,"about_ca_system_score_gemma":0.003272656,"threshold_uncertainty_score":0.053723276},"labels":[],"label_agreement":null},{"id":"W3211104423","doi":"10.1007/s10013-022-00558-3","title":"The Set of Orthogonal Tensor Trains","year":2022,"lang":"en","type":"article","venue":"Vietnam Journal of Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tensor (intrinsic definition); Rank (graph theory); Extension (predicate logic); Set (abstract data type); Quadratic equation; Pure mathematics; Decomposition; Invariants of tensors; Symmetric tensor; Type (biology); Algebra over a field; Mathematical analysis; Combinatorics; Exact solutions in general relativity; Geometry","score_opus":0.05796193281343756,"score_gpt":0.32933150031069386,"score_spread":0.27136956749725627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211104423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50030434,0.002361015,0.3878933,0.003311649,0.00073863595,0.00009278953,0.003409705,0.00048467846,0.10140381],"genre_scores_gemma":[0.9167055,0.0022130262,0.035197273,0.0006573668,0.0011189153,0.00021103543,0.0034812398,0.00029405154,0.0401217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983829,0.00040503877,0.00011302266,0.00045494954,0.00041227991,0.00023171512],"domain_scores_gemma":[0.997095,0.001026859,0.0004924007,0.00030402438,0.00061849767,0.00046324462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013124063,0.0011552376,0.0017219466,0.0042196875,0.0023847327,0.00547883,0.0015555212,0.0014953519,0.007979188],"category_scores_gemma":[0.0042185616,0.0008174992,0.0014605381,0.0021541254,0.0032441865,0.0053695263,0.0031689191,0.002769676,0.00126641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004421804,0.000026507747,0.0003368578,0.00003354231,0.000022420454,0.000052169005,0.00012056401,0.00095477776,0.0005940682,0.98995054,0.0013911623,0.006473128],"study_design_scores_gemma":[0.000012932016,0.000030027635,0.00039519623,0.000022571374,0.000014123296,0.0001552796,0.00007709017,0.012068349,0.00036611492,0.9829238,0.003909927,0.000024545101],"about_ca_topic_score_codex":0.0014207696,"about_ca_topic_score_gemma":0.0005798167,"teacher_disagreement_score":0.007979188,"about_ca_system_score_codex":0.001255451,"about_ca_system_score_gemma":0.0012390286,"threshold_uncertainty_score":0.026693046},"labels":[],"label_agreement":null},{"id":"W3217437752","doi":"10.1063/5.0075412","title":"Computing vibrational energy levels by solving linear equations using a tensor method with an imposed rank","year":2021,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rank (graph theory); Tensor (intrinsic definition); Basis (linear algebra); Orthogonalization; Applied mathematics; Mathematics; Basis function; Hamiltonian (control theory); Realization (probability); Tensor product; Algorithm; Mathematical analysis; Mathematical optimization; Pure mathematics; Combinatorics; Geometry","score_opus":0.07816383131306777,"score_gpt":0.3602719052322727,"score_spread":0.28210807391920495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217437752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028107656,0.00010414487,0.9645175,0.00019156963,0.00006611535,0.000061812985,0.000109446824,0.00055356865,0.006288234],"genre_scores_gemma":[0.15819696,0.0002701212,0.8345501,0.00008550465,0.000049952014,0.00015617904,0.00021519169,0.0003758298,0.00610016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996263,0.00011795515,0.000026122652,0.000037304202,0.00014950511,0.000042811105],"domain_scores_gemma":[0.9994425,0.00022401704,0.000046103447,0.00012748572,0.00012299215,0.000036909503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082660763,0.00076164113,0.00071706326,0.0006040596,0.0005946902,0.0010085726,0.0008738396,0.00057065143,0.0061751488],"category_scores_gemma":[0.0014526872,0.0003284524,0.00077724893,0.0007814681,0.0009696226,0.0013350818,0.0008196481,0.0014876504,0.0014005684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001627763,0.00021991487,0.0013505997,0.0004702837,0.00010108527,0.00022735458,0.00045544156,0.36721042,0.04422687,0.4370372,0.00454768,0.14399046],"study_design_scores_gemma":[0.000031571777,0.00008099767,0.00015278468,0.000014255657,0.000011190877,0.00005257436,0.000067779234,0.9397482,0.007209017,0.04761795,0.0049926927,0.0000210502],"about_ca_topic_score_codex":0.003387202,"about_ca_topic_score_gemma":0.0047397106,"teacher_disagreement_score":0.0061751488,"about_ca_system_score_codex":0.00050366216,"about_ca_system_score_gemma":0.0013925391,"threshold_uncertainty_score":0.020657957},"labels":[],"label_agreement":null},{"id":"W3217735989","doi":"10.4171/aihpd/178","title":"Perturbing isoradial triangulations","year":2024,"lang":"en","type":"article","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Institut Périmètre de physique théorique; Institut Henri Poincaré; University of Miami; Saint Petersburg State University; European Commission","keywords":"Geology; Geometry; Mathematics","score_opus":0.04279290230407783,"score_gpt":0.3193144170895309,"score_spread":0.27652151478545306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217735989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94006616,0.00008066771,0.044602774,0.00021484858,0.000053128824,0.000025508343,0.00008736761,0.00010642169,0.014763195],"genre_scores_gemma":[0.9830562,0.000081170096,0.012548687,0.000080860584,0.000015738902,0.000024355882,0.00016174871,0.00006450851,0.003966699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981695,0.00003827705,0.0000053996046,0.000044622597,0.000050999257,0.000043758308],"domain_scores_gemma":[0.9997243,0.00008542746,0.00005322326,0.00004845594,0.000032248492,0.000056237754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017652988,0.0003777036,0.00039356976,0.0007507173,0.0005624174,0.0009005672,0.00090662704,0.0008919261,0.0033874868],"category_scores_gemma":[0.0013278289,0.0002708283,0.00035200812,0.00033116085,0.0014140881,0.0007649583,0.001260017,0.0006631804,0.00026872204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001639842,0.00010720687,0.0023497753,0.00009112092,0.000050704293,0.0009237321,0.0003777891,0.6168851,0.017088192,0.35367632,0.00067718007,0.007608869],"study_design_scores_gemma":[0.000036368685,0.000087810884,0.0012973944,0.000015771184,0.0000131575025,0.00028281787,0.00046787763,0.8815475,0.0029862705,0.1109226,0.0023085654,0.000033826098],"about_ca_topic_score_codex":0.004061383,"about_ca_topic_score_gemma":0.0035401545,"teacher_disagreement_score":0.004061383,"about_ca_system_score_codex":0.0008940775,"about_ca_system_score_gemma":0.00032941546,"threshold_uncertainty_score":0.0113322735},"labels":[],"label_agreement":null},{"id":"W38648097","doi":"10.2196/53241","title":"Nobelprize.org eductaional material","year":2011,"lang":"en","type":"article","venue":"JMIR Formative Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.24837148336171405,"score_gpt":0.47812406330187346,"score_spread":0.2297525799401594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38648097","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022352617,0.008570706,0.010449027,0.027992422,0.013887748,0.00023819131,0.013619279,0.0047336244,0.9182736],"genre_scores_gemma":[0.011549903,0.0043126764,0.0037414443,0.0039439835,0.001778119,0.00014753944,0.0055998834,0.00088122307,0.9680453],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948007,0.00009674605,0.000026488076,0.00009927484,0.00022461334,0.00007283509],"domain_scores_gemma":[0.99755484,0.00059538113,0.00013545706,0.00040711425,0.00035626057,0.00095096003],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014654639,0.0008153555,0.00053533365,0.0016756416,0.00071178604,0.0024859726,0.0012229473,0.0015881192,0.82059306],"category_scores_gemma":[0.004550585,0.00031091922,0.00039571003,0.0010266496,0.0006136365,0.0013467816,0.002110942,0.0015870912,0.60621095],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002047799,0.00012013513,0.00028822027,0.00026778367,0.000010584992,0.000175713,0.000053050582,0.00021679062,0.0007436124,0.010267445,0.67986435,0.3077876],"study_design_scores_gemma":[0.000021297083,0.000024052799,0.00014816514,0.00008811987,0.000003835239,0.00012588303,0.000018898569,0.000111226545,0.00038326526,0.0032442291,0.9958264,0.0000046540913],"about_ca_topic_score_codex":0.0006592702,"about_ca_topic_score_gemma":0.001412495,"teacher_disagreement_score":0.82059306,"about_ca_system_score_codex":0.0008969821,"about_ca_system_score_gemma":0.001240702,"threshold_uncertainty_score":0.25590223},"labels":[],"label_agreement":null},{"id":"W4200023254","doi":"10.1016/j.neucom.2021.11.108","title":"Predefined-time convergent neural networks for solving the time-varying nonsingular multi-linear tensor equations","year":2021,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Invertible matrix; Artificial neural network; Convergence (economics); Applied mathematics; Tensor (intrinsic definition); Mathematics; Invariant (physics); LTI system theory; Computer science; Mathematical optimization; Linear system; Mathematical analysis; Artificial intelligence; Pure mathematics","score_opus":0.05781329295032648,"score_gpt":0.31599939765656476,"score_spread":0.25818610470623826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200023254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017806496,0.0004288618,0.97923,0.00015343339,0.000094963805,0.000028480148,0.000029371851,0.00013652036,0.0020918504],"genre_scores_gemma":[0.59099346,0.000734719,0.3991504,0.00017869259,0.00013551279,0.00019159674,0.0002239098,0.00014116307,0.008250566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997439,0.00007616907,0.000018117691,0.000057602396,0.000072732764,0.00003154756],"domain_scores_gemma":[0.9988393,0.0005790286,0.00010968072,0.000074754105,0.0003366568,0.000060634095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011526534,0.0008542235,0.00064856856,0.00028653018,0.00041157316,0.00068872486,0.0010763556,0.0012183273,0.0014620341],"category_scores_gemma":[0.0039735474,0.00030358465,0.00042514654,0.00049379485,0.00075294083,0.0009377416,0.0009944021,0.0017202654,0.00036042146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008414178,0.000040054012,0.0003616331,0.0001056359,0.00003803397,0.00005782351,0.00010057207,0.9119179,0.0035500175,0.026565047,0.001173588,0.05600556],"study_design_scores_gemma":[0.0000011840087,0.00000487562,0.000012040423,0.0000016937869,0.0000012732626,0.0000023070763,0.0000017818271,0.99862003,0.00013597686,0.0011393296,0.000078272904,0.0000012718391],"about_ca_topic_score_codex":0.0067530675,"about_ca_topic_score_gemma":0.008688651,"teacher_disagreement_score":0.0067530675,"about_ca_system_score_codex":0.0007969444,"about_ca_system_score_gemma":0.0010876252,"threshold_uncertainty_score":0.013427496},"labels":[],"label_agreement":null},{"id":"W4207006620","doi":"10.1145/3491223","title":"TT-TSVD: A Multi-modal Tensor Train Decomposition with Its Application in Convolutional Neural Networks for Smart Healthcare","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Singular value decomposition; Tensor (intrinsic definition); Convolutional neural network; Computer science; Reduction (mathematics); Modalities; Decomposition; Data mining; Tensor decomposition; Artificial intelligence; Big data; Pattern recognition (psychology); Algorithm; Mathematics; Chemistry","score_opus":0.05554688708277145,"score_gpt":0.35205559600128217,"score_spread":0.2965087089185107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207006620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007484844,0.0003432424,0.9901904,0.00020056142,0.00008290251,0.000047161164,0.000147319,0.00091711426,0.00058650353],"genre_scores_gemma":[0.16305904,0.0011533315,0.82786214,0.00022302342,0.00009501012,0.0001639334,0.0016235801,0.00035778427,0.005462074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954766,0.00008833519,0.000043436896,0.000087378845,0.00018398926,0.00004911916],"domain_scores_gemma":[0.9993906,0.00015358871,0.00006304302,0.000106796346,0.00023524534,0.000050708455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010743549,0.0011248662,0.0007075762,0.0010753743,0.0004509232,0.00091472786,0.00095267047,0.000712481,0.0023948015],"category_scores_gemma":[0.0022169983,0.00040254547,0.0011168943,0.0013524211,0.0006654749,0.0014798696,0.0012752727,0.0017227762,0.0007969357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022387337,0.0001569659,0.0018812454,0.00021147908,0.00016376661,0.00014170237,0.00013413181,0.19420333,0.025904594,0.0166553,0.011136395,0.74918723],"study_design_scores_gemma":[0.0000075252765,0.000044550783,0.00027140076,0.000011222717,0.000016454249,0.000056278273,0.000018060153,0.98463744,0.0075523243,0.004459015,0.0029120508,0.00001367416],"about_ca_topic_score_codex":0.009109388,"about_ca_topic_score_gemma":0.012801259,"teacher_disagreement_score":0.009109388,"about_ca_system_score_codex":0.0007632952,"about_ca_system_score_gemma":0.0016916285,"threshold_uncertainty_score":0.018112719},"labels":[],"label_agreement":null},{"id":"W4210405460","doi":"10.1145/3483448","title":"Feature Extraction of High-dimensional Data Based on J-HOSVD for Cyber-Physical-Social Systems","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Management Information Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Feature extraction; Robustness (evolution); Data mining; Dimensionality reduction; Artificial intelligence; Big data; Pattern recognition (psychology); Benchmark (surveying); Machine learning","score_opus":0.05146768431163548,"score_gpt":0.32249296021106755,"score_spread":0.27102527589943204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210405460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015853753,0.000647248,0.9818656,0.00025572983,0.00010321213,0.000059644313,0.0002213151,0.0004908428,0.00050263066],"genre_scores_gemma":[0.4504159,0.0016819728,0.5428585,0.00018887938,0.00023583874,0.00022615358,0.001956515,0.0001427373,0.002293549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992913,0.00015251471,0.000079176876,0.00015833935,0.00023954197,0.00007903091],"domain_scores_gemma":[0.9988985,0.00037727645,0.0001509876,0.00016098024,0.0003562213,0.00005603194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178554,0.0010383832,0.0010151259,0.002272031,0.00052821904,0.0011051628,0.00074903236,0.0006699644,0.0012541446],"category_scores_gemma":[0.003559083,0.00027714224,0.0014067789,0.0023184028,0.00062494987,0.0014324978,0.0009037976,0.001496622,0.000553074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022420671,0.00022454493,0.008205022,0.0004958838,0.00020580871,0.0003633675,0.0002485563,0.27832457,0.017947746,0.022606162,0.01049124,0.66066295],"study_design_scores_gemma":[0.000005544288,0.000038398175,0.0016222908,0.000014257626,0.000017159695,0.00006990271,0.00004727161,0.98919827,0.0017326076,0.0055295113,0.001704667,0.000020070423],"about_ca_topic_score_codex":0.004153308,"about_ca_topic_score_gemma":0.0034894561,"teacher_disagreement_score":0.004153308,"about_ca_system_score_codex":0.0005031926,"about_ca_system_score_gemma":0.0010734776,"threshold_uncertainty_score":0.008258283},"labels":[],"label_agreement":null},{"id":"W4211105203","doi":"10.1145/3491255","title":"Quantized Tensor Neural Network","year":2021,"lang":"en","type":"article","venue":"ACM/IMS Transactions on Data Science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Artificial neural network; Computer science; Artificial intelligence; Deep learning; Machine learning; Mathematics","score_opus":0.1596832134277979,"score_gpt":0.39083364715414226,"score_spread":0.23115043372634436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211105203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009297315,0.0012076832,0.98386765,0.00045701864,0.00029099255,0.000047797377,0.0004946831,0.0010220476,0.0033147929],"genre_scores_gemma":[0.5405702,0.0034014543,0.44286257,0.00045974317,0.00038038337,0.00021475414,0.0019687458,0.0002874761,0.00985472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922,0.00019544455,0.000060318132,0.00018427536,0.00024069911,0.000099201694],"domain_scores_gemma":[0.99892443,0.00026568767,0.00014008864,0.00018483924,0.00042130423,0.00006364147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094149803,0.0010017658,0.0010369853,0.00091528497,0.00052752893,0.0015424129,0.0014705467,0.00080618693,0.0033696042],"category_scores_gemma":[0.0037811908,0.0003702943,0.00076421705,0.0015984046,0.0009785201,0.0027991654,0.0010160819,0.0015908895,0.00090910966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023680336,0.0000666228,0.0020293342,0.00042114698,0.00014008883,0.00017701964,0.000115741655,0.6294147,0.008666501,0.12858653,0.01451589,0.21562962],"study_design_scores_gemma":[0.0000046014165,0.000016350896,0.0001522731,0.000011243596,0.0000100073585,0.000027474702,0.000009223749,0.9774968,0.0009005675,0.019013932,0.002346766,0.000010798011],"about_ca_topic_score_codex":0.01081475,"about_ca_topic_score_gemma":0.009619813,"teacher_disagreement_score":0.01081475,"about_ca_system_score_codex":0.0015184358,"about_ca_system_score_gemma":0.0015851823,"threshold_uncertainty_score":0.021503627},"labels":[],"label_agreement":null},{"id":"W4220804418","doi":"10.5772/intechopen.102765","title":"Identification of Multilinear Systems: A Brief Overview","year":2022,"lang":"en","type":"book-chapter","venue":"IntechOpen eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Multilinear map; Nonlinear system; Identification (biology); Computer science; Context (archaeology); System identification; Tensor (intrinsic definition); Nonlinear system identification; Multidimensional systems; Separable space; Theoretical computer science; Mathematics; Data modeling; Physics; Pure mathematics","score_opus":0.0887579075520936,"score_gpt":0.345304649958902,"score_spread":0.25654674240680836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220804418","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016668697,0.51821953,0.4228067,0.0011690585,0.0020617335,0.00008904655,0.000372564,0.0006818837,0.05293255],"genre_scores_gemma":[0.041237917,0.709297,0.18112558,0.0011954402,0.005509597,0.00030493227,0.0014846941,0.00048767976,0.05935713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996246,0.00007522841,0.000031914773,0.000090026064,0.00015455401,0.000023586086],"domain_scores_gemma":[0.9996722,0.00017242647,0.000026575815,0.00002884945,0.00008633159,0.000013662038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004895558,0.0013047694,0.0009198919,0.0018477268,0.00036488424,0.0017950876,0.0007728489,0.0011740918,0.010328012],"category_scores_gemma":[0.0007799634,0.0006368652,0.0008484154,0.002829685,0.0005806886,0.0021880462,0.0012315577,0.002029902,0.008929566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006511094,0.00013587027,0.00044270663,0.0074257683,0.00011245869,0.00054954493,0.0004763981,0.02273866,0.0067991074,0.17924905,0.046330553,0.7356748],"study_design_scores_gemma":[0.0000085973425,0.00018291014,0.0010169133,0.0014896862,0.0000489863,0.0013943118,0.0001503469,0.03492525,0.0025729872,0.10965473,0.84847486,0.00008042748],"about_ca_topic_score_codex":0.00071686134,"about_ca_topic_score_gemma":0.0005829025,"teacher_disagreement_score":0.010328012,"about_ca_system_score_codex":0.0005170238,"about_ca_system_score_gemma":0.0005383293,"threshold_uncertainty_score":0.034550667},"labels":[],"label_agreement":null},{"id":"W4224442812","doi":"10.1109/msmc.2021.3114538","title":"Tensor-Based Knowledge Fusion and Reasoning for Cyberphysical-Social Systems: Theory and Framework","year":2022,"lang":"en","type":"article","venue":"IEEE Systems Man and Cybernetics Magazine","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Theoretical computer science; Knowledge representation and reasoning; Big data; Artificial intelligence; Data mining","score_opus":0.027479245115961278,"score_gpt":0.30684529109873315,"score_spread":0.27936604598277187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224442812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027443282,0.00056461844,0.99389064,0.000628215,0.000047704576,0.000049514027,0.00013777106,0.00019705568,0.0017400812],"genre_scores_gemma":[0.24867117,0.0023920916,0.7450168,0.0004020373,0.0003044224,0.0002516876,0.0007919034,0.000090478876,0.0020793905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700123,0.0008930368,0.00040544817,0.00071420526,0.000774059,0.00021204526],"domain_scores_gemma":[0.9969465,0.0010570913,0.0004915258,0.0006247867,0.0006656613,0.00021442048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003493629,0.0010735252,0.0010942651,0.0049715587,0.0013892422,0.0044608945,0.002238054,0.001104109,0.00226418],"category_scores_gemma":[0.0064510936,0.00059837836,0.0031331314,0.005168006,0.0040817535,0.008116596,0.0037314647,0.0023400835,0.000508415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052915148,0.0000602864,0.0011309141,0.00031730504,0.00014317369,0.00031652724,0.00054016674,0.10138792,0.0019216454,0.8131183,0.0028830275,0.078127824],"study_design_scores_gemma":[0.000008193761,0.000026406355,0.00028925075,0.0000592809,0.00005867173,0.00011867216,0.00014013407,0.51869357,0.0010513255,0.4729463,0.0065709217,0.000037328107],"about_ca_topic_score_codex":0.019070782,"about_ca_topic_score_gemma":0.009833425,"teacher_disagreement_score":0.019070782,"about_ca_system_score_codex":0.0033901732,"about_ca_system_score_gemma":0.0029391227,"threshold_uncertainty_score":0.03791952},"labels":[],"label_agreement":null},{"id":"W4225656449","doi":"10.1109/access.2022.3160187","title":"The Tensor Multi-Linear Channel and Its Shannon Capacity","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Notation; Channel (broadcasting); Precoding; Domain (mathematical analysis); Computer science; Mathematics; Theoretical computer science; Topology (electrical circuits); Pure mathematics; MIMO; Mathematical analysis","score_opus":0.1867681659927632,"score_gpt":0.38627520862362347,"score_spread":0.19950704263086028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225656449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027415507,0.0022418988,0.92838395,0.0016215075,0.00019974624,0.000057642017,0.0008082204,0.00028140302,0.0389902],"genre_scores_gemma":[0.85981137,0.004329507,0.12110984,0.0008374231,0.00062412623,0.0003914402,0.00053509965,0.00020447728,0.0121567175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985274,0.0005090884,0.00006398636,0.0002077766,0.00047138598,0.00022033176],"domain_scores_gemma":[0.99666613,0.0019489714,0.00035645106,0.000390079,0.00052578514,0.00011263501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012661592,0.0009175871,0.0007107828,0.0010464152,0.00072576647,0.0021343883,0.0008706109,0.0012062863,0.0042229844],"category_scores_gemma":[0.0047043697,0.00033514109,0.00056185614,0.0012496922,0.002907689,0.0029931634,0.0014345059,0.0015179226,0.001007593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000715454,0.000022216127,0.00033742085,0.00016848637,0.000026792452,0.00015376523,0.0001447907,0.11334093,0.003438817,0.8608012,0.003680893,0.017813234],"study_design_scores_gemma":[0.00001404916,0.000059301503,0.00041940346,0.0000766024,0.000022042123,0.00022041335,0.00007961615,0.4961073,0.0026133903,0.4912718,0.00904717,0.00006885494],"about_ca_topic_score_codex":0.0022139424,"about_ca_topic_score_gemma":0.0013895968,"teacher_disagreement_score":0.0042229844,"about_ca_system_score_codex":0.0013730929,"about_ca_system_score_gemma":0.0012230823,"threshold_uncertainty_score":0.014127314},"labels":[],"label_agreement":null},{"id":"W4229791652","doi":"10.31234/osf.io/pr8kd","title":"The memory tesseract: Mathematical equivalence between composite and separate storage memory models","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Carleton University","funders":"","keywords":"Unification; Computer science; Memory model; Equivalence (formal languages); Storage model; Computer data storage; Tensor (intrinsic definition); Auxiliary memory; Theoretical computer science; Artificial intelligence; Mathematics; Parallel computing; Shared memory; Pure mathematics; Programming language","score_opus":0.09051695469425543,"score_gpt":0.3571670243566651,"score_spread":0.26665006966240967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229791652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12105923,0.0014255305,0.82109004,0.0034144595,0.00028188663,0.0000441804,0.00027893673,0.00045893557,0.05194687],"genre_scores_gemma":[0.8765825,0.0011978307,0.10194262,0.00066244876,0.00031059512,0.00013601578,0.0002451321,0.00021453331,0.018708415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999453,0.00013633593,0.000042709697,0.0001227258,0.00017134509,0.000073994255],"domain_scores_gemma":[0.9985808,0.00042983802,0.00017627147,0.00047198206,0.0002345435,0.00010653166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011447673,0.0005430984,0.00054972304,0.00085974234,0.00062448013,0.0022546314,0.0012352949,0.0012406583,0.0053464016],"category_scores_gemma":[0.0040158946,0.00031630692,0.0011873675,0.0005045696,0.0028043534,0.0073993253,0.0027069293,0.0023406814,0.0009701738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018837929,0.000009525971,0.00010891724,0.000030329042,0.0000076465485,0.000032602456,0.000113284084,0.0031987089,0.0007530761,0.99048644,0.000740164,0.004500422],"study_design_scores_gemma":[0.0000050717395,0.000018068356,0.00008963754,0.000009914333,0.000004787131,0.00006132666,0.000028831299,0.040878974,0.00048890733,0.9566661,0.0017399559,0.0000084258445],"about_ca_topic_score_codex":0.0007838364,"about_ca_topic_score_gemma":0.00052517344,"teacher_disagreement_score":0.0053464016,"about_ca_system_score_codex":0.00078143197,"about_ca_system_score_gemma":0.00060552923,"threshold_uncertainty_score":0.017885447},"labels":[],"label_agreement":null},{"id":"W4231767232","doi":"10.1007/978-1-4939-7131-2_100469","title":"Homogeneity Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Homogeneity (statistics); Mathematics; Statistics","score_opus":0.06590848720974263,"score_gpt":0.32851591009723835,"score_spread":0.2626074228874957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231767232","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037578058,0.00625202,0.3183737,0.0026202572,0.0018379005,0.000047224396,0.0007481879,0.0011187505,0.66524404],"genre_scores_gemma":[0.082172975,0.007878208,0.09189983,0.0010446165,0.0031508936,0.00012478723,0.0017360996,0.0026004084,0.80939215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995528,0.00009104745,0.00001844826,0.000118659395,0.00018345703,0.000035504716],"domain_scores_gemma":[0.9995763,0.00010162722,0.00002477562,0.00010673564,0.00015895678,0.00003161021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005977796,0.0010846592,0.0007103274,0.0019800323,0.00083547307,0.0022490462,0.0007286508,0.0005982093,0.04194637],"category_scores_gemma":[0.0014722007,0.00042956273,0.0007235038,0.001445062,0.0016345434,0.0026971754,0.0014484526,0.00202415,0.023435578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015645692,0.000015401247,0.00007813057,0.000105101884,0.000015905176,0.000029976698,0.00011868005,0.0007679364,0.0016524688,0.8217828,0.08718326,0.08823463],"study_design_scores_gemma":[0.000003865939,0.0000103419125,0.0002936083,0.000044833123,0.000017505845,0.00012211887,0.00007117379,0.0032923329,0.0018532898,0.7222861,0.2719891,0.00001568711],"about_ca_topic_score_codex":0.00105608,"about_ca_topic_score_gemma":0.001391794,"teacher_disagreement_score":0.04194637,"about_ca_system_score_codex":0.0010684299,"about_ca_system_score_gemma":0.0006538841,"threshold_uncertainty_score":0.14032465},"labels":[],"label_agreement":null},{"id":"W4233974870","doi":"10.1007/978-1-4939-7131-2_101334","title":"Tensor Decomposition","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Decomposition; Chemistry; Organic chemistry","score_opus":0.058710707546639374,"score_gpt":0.34099597049566155,"score_spread":0.2822852629490222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233974870","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018794242,0.01069568,0.1626688,0.0024755273,0.004646479,0.00005733164,0.00094348507,0.0013509566,0.81528234],"genre_scores_gemma":[0.032077037,0.0133653935,0.07572067,0.00084974477,0.0032991415,0.00011195518,0.0018484653,0.0021140266,0.8706136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995647,0.000069563364,0.000020499749,0.000091577655,0.00021780028,0.000035793917],"domain_scores_gemma":[0.99965763,0.000045306155,0.00001722454,0.00008460809,0.00015546916,0.00003964148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004615205,0.0015679402,0.00070804777,0.002116232,0.0010098534,0.0035340572,0.00081469765,0.00067842775,0.065056816],"category_scores_gemma":[0.0011322427,0.00045403317,0.0006566588,0.002035993,0.0015553709,0.0042946753,0.0018379522,0.0024419576,0.04400968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011219908,0.000014612627,0.000042882806,0.00014347656,0.000008039303,0.000026773814,0.00014303855,0.0005800129,0.00094543386,0.7427505,0.15191717,0.10341685],"study_design_scores_gemma":[0.0000025655165,0.0000070792344,0.00007541181,0.00007995189,0.000007196219,0.0001036343,0.00005297455,0.0012501976,0.0006599455,0.36544704,0.63230276,0.000011262595],"about_ca_topic_score_codex":0.0010599656,"about_ca_topic_score_gemma":0.0016565314,"teacher_disagreement_score":0.065056816,"about_ca_system_score_codex":0.0011693221,"about_ca_system_score_gemma":0.00095186516,"threshold_uncertainty_score":0.2176367},"labels":[],"label_agreement":null},{"id":"W4237698854","doi":"10.1007/978-1-4614-6170-8_110012","title":"Homogeneity Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Homogeneity (statistics); Mathematics; Statistics","score_opus":0.05307208160447776,"score_gpt":0.3136455422301744,"score_spread":0.26057346062569664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237698854","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033416261,0.006315621,0.30847022,0.0022625902,0.0015130389,0.000041132404,0.0005718094,0.0009329224,0.67655104],"genre_scores_gemma":[0.07793275,0.007740629,0.08698783,0.00090682943,0.0025317546,0.00010806959,0.0013218372,0.002088605,0.8203817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995974,0.000085594475,0.000016187436,0.000102879036,0.00016690177,0.000030990774],"domain_scores_gemma":[0.99965584,0.000086359825,0.000019801537,0.00008607082,0.00012734582,0.00002454525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054633035,0.0010204619,0.0006817767,0.0018253591,0.0007855877,0.001976932,0.0006962064,0.0005436342,0.03738833],"category_scores_gemma":[0.001224887,0.0004113451,0.00065001316,0.001360575,0.0016338504,0.002458165,0.0013182599,0.0018841128,0.01920873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014266872,0.000014170623,0.000074150754,0.000095725314,0.000015114893,0.000029805866,0.00011774178,0.0008214839,0.001581302,0.81462926,0.08557908,0.09702786],"study_design_scores_gemma":[0.0000034583138,0.000009528824,0.00028692008,0.00004268674,0.000015765938,0.00012299263,0.00007074487,0.0033514958,0.0018353835,0.7128561,0.28139004,0.000014953505],"about_ca_topic_score_codex":0.0011367828,"about_ca_topic_score_gemma":0.0015839149,"teacher_disagreement_score":0.03738833,"about_ca_system_score_codex":0.0010547186,"about_ca_system_score_gemma":0.0006126025,"threshold_uncertainty_score":0.12507641},"labels":[],"label_agreement":null},{"id":"W4240094840","doi":"10.1002/0470013192.bsa459","title":"Optimal Scaling","year":2005,"lang":"en","type":"other","venue":"Encyclopedia of Statistics in Behavioral Science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scaling; Transformation (genetics); Variety (cybernetics); Column (typography); Computer science; Scale (ratio); Ordinal data; Matrix (chemical analysis); Key (lock); Algorithm; Data Matrix; Multidimensional scaling; Mathematics; Statistics; Artificial intelligence; Physics; Geometry","score_opus":0.03822121135356509,"score_gpt":0.3766746153828547,"score_spread":0.3384534040292896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240094840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012042379,0.001021976,0.9629091,0.0012034732,0.00036763152,0.00013125569,0.00029247452,0.00034491858,0.021686759],"genre_scores_gemma":[0.36605218,0.0029375488,0.6111234,0.0008681834,0.0012192801,0.00076083344,0.0012161991,0.0007691136,0.015053408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99371195,0.0022816432,0.00050830195,0.0013741021,0.001815374,0.00030859897],"domain_scores_gemma":[0.99077773,0.003420594,0.0008418798,0.002939401,0.0017288245,0.00029159227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049702213,0.001303243,0.0014463919,0.0024846937,0.00093530834,0.0036301578,0.0012514801,0.00092064554,0.010793152],"category_scores_gemma":[0.036077905,0.0005555562,0.0010060621,0.0029880307,0.0027499264,0.0046666926,0.0037951316,0.0018948285,0.0022211971],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086073516,0.00007927906,0.0012271155,0.0002805462,0.00007451926,0.00013959841,0.00037953412,0.038070455,0.0024186934,0.74422264,0.01583349,0.19718802],"study_design_scores_gemma":[0.000021368493,0.000048108504,0.0008130313,0.0000812417,0.00002315682,0.0001453914,0.00014519105,0.14716092,0.0010515609,0.8305544,0.019928575,0.000027121105],"about_ca_topic_score_codex":0.0012983611,"about_ca_topic_score_gemma":0.00073440035,"teacher_disagreement_score":0.010793152,"about_ca_system_score_codex":0.001211299,"about_ca_system_score_gemma":0.0016768393,"threshold_uncertainty_score":0.036106706},"labels":[],"label_agreement":null},{"id":"W4240954477","doi":"10.1016/b978-0-08-044894-7.01348-8","title":"Multidimensional Scaling","year":2010,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multidimensional scaling; Similarity (geometry); Set (abstract data type); Multidimensional analysis; Computer science; Variety (cybernetics); Space (punctuation); Scaling; Object (grammar); Multidimensional data; Scale (ratio); Data set; Data mining; Theoretical computer science; Mathematics; Artificial intelligence; Geography; Machine learning; Cartography; Image (mathematics); Statistics; Geometry","score_opus":0.035947023293803414,"score_gpt":0.30015456327842993,"score_spread":0.26420753998462654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240954477","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040480606,0.020972693,0.17227653,0.0026098064,0.003306792,0.000050604667,0.0006592378,0.0015328731,0.79454345],"genre_scores_gemma":[0.07647518,0.030509498,0.13662244,0.0008579144,0.00285823,0.00022823151,0.0014195975,0.0015571035,0.7494719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999747,0.000042554853,0.000013740051,0.00006017443,0.00012057293,0.000015929318],"domain_scores_gemma":[0.9997321,0.000050743052,0.00001535052,0.00010370287,0.00007615764,0.00002196949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000343355,0.001157703,0.00082321785,0.0014306825,0.0007509449,0.0026455629,0.00051850855,0.00066415896,0.047596063],"category_scores_gemma":[0.0010599706,0.00040900192,0.000513898,0.0018883843,0.0010796414,0.0025864118,0.0017250044,0.0017916032,0.017886821],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009678249,0.000013025245,0.00007897164,0.00018877907,0.000013860847,0.000057579087,0.00016114686,0.0010594754,0.0019607148,0.6682886,0.09607775,0.23209044],"study_design_scores_gemma":[0.00000458253,0.000011589484,0.00040200897,0.0001166833,0.000011890758,0.00026645267,0.000077707606,0.005416163,0.0011095157,0.47554314,0.5170237,0.000016547398],"about_ca_topic_score_codex":0.0006314808,"about_ca_topic_score_gemma":0.00075698266,"teacher_disagreement_score":0.047596063,"about_ca_system_score_codex":0.000669703,"about_ca_system_score_gemma":0.0004566157,"threshold_uncertainty_score":0.15922469},"labels":[],"label_agreement":null},{"id":"W4241693471","doi":"10.23952/jnva.4.2020.1.07","title":"Tensor variational inequalities: theoretical results, numerical methods and applications to an economic equilibrium model","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per il Calcolo Scientifico; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Variational inequality; Tensor (intrinsic definition); Mathematical economics; Applied mathematics; Inequality; Mathematics; General equilibrium theory; Mathematical optimization; Economics; Statistical physics; Physics; Mathematical analysis; Pure mathematics; Microeconomics","score_opus":0.0696455019492705,"score_gpt":0.40214206658467017,"score_spread":0.33249656463539967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241693471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039718323,0.001287371,0.987743,0.0004888992,0.00010809815,0.00002743692,0.000038748723,0.000041456497,0.0062932405],"genre_scores_gemma":[0.3693657,0.0075587486,0.60446185,0.00041681813,0.0006246241,0.0003970591,0.00020200557,0.00023375738,0.016739441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937016,0.0003401857,0.000035446064,0.000070829454,0.00013654791,0.000046841356],"domain_scores_gemma":[0.9990264,0.0005509515,0.00012410729,0.000065552864,0.00015758118,0.0000753781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018842571,0.0013743456,0.0008909221,0.0011536084,0.00073203334,0.001706417,0.0010055174,0.0013257861,0.0038758218],"category_scores_gemma":[0.0038596531,0.0004221699,0.00122847,0.0015535754,0.0020311128,0.0026011977,0.0023177192,0.0024583042,0.00052026776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018238608,0.000038512724,0.00027129034,0.00014319424,0.00002348578,0.00008494309,0.000113600305,0.20031598,0.00160532,0.778712,0.0014264476,0.01724702],"study_design_scores_gemma":[0.000004084871,0.000016509512,0.000041180967,0.00001879209,0.000006674441,0.000038625112,0.000019409817,0.84245867,0.00028573172,0.15459399,0.0025073295,0.000008909016],"about_ca_topic_score_codex":0.0036449928,"about_ca_topic_score_gemma":0.0021774254,"teacher_disagreement_score":0.0038758218,"about_ca_system_score_codex":0.001157381,"about_ca_system_score_gemma":0.0013821489,"threshold_uncertainty_score":0.012965918},"labels":[],"label_agreement":null},{"id":"W4251360357","doi":"10.1002/9781118445112.stat06456","title":"Optimal Scaling","year":2014,"lang":"en","type":"other","venue":"Wiley StatsRef: Statistics Reference Online","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scaling; Transformation (genetics); Variety (cybernetics); Column (typography); Scale (ratio); Ordinal data; Matrix (chemical analysis); Key (lock); Computer science; Data Matrix; Interval (graph theory); Multidimensional scaling; Algorithm; Mathematics; Statistics; Artificial intelligence; Combinatorics; Connection (principal bundle); Geometry","score_opus":0.06851394283590133,"score_gpt":0.36800897850302366,"score_spread":0.2994950356671223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251360357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009332222,0.0009918847,0.9670852,0.0015753051,0.00038998885,0.00012210605,0.00036867068,0.00038215917,0.01975249],"genre_scores_gemma":[0.29267722,0.0027363608,0.6864034,0.00097265595,0.0013972966,0.0006667009,0.0013501955,0.0008507963,0.012945347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99281317,0.0028328702,0.0005617764,0.0015846181,0.0018591968,0.00034836476],"domain_scores_gemma":[0.98881245,0.0042314134,0.0010394877,0.0035925189,0.0019950694,0.0003290074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058106775,0.001319722,0.0012944624,0.002627722,0.0009329133,0.003941932,0.0012493072,0.00092710357,0.010827281],"category_scores_gemma":[0.04032114,0.0005813038,0.0010457783,0.0031691482,0.0032706342,0.0047242753,0.0039000378,0.002114231,0.002810053],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072729265,0.0000644337,0.0011757504,0.00026757072,0.00006626283,0.00011834738,0.00037984957,0.02753823,0.0020154782,0.755593,0.01817613,0.19453219],"study_design_scores_gemma":[0.00001722217,0.000043442244,0.00081396097,0.00008826169,0.000019293197,0.00014053076,0.00014328759,0.11210581,0.0010150172,0.8633849,0.022201125,0.000027279451],"about_ca_topic_score_codex":0.0013153552,"about_ca_topic_score_gemma":0.0007406693,"teacher_disagreement_score":0.010827281,"about_ca_system_score_codex":0.0013573393,"about_ca_system_score_gemma":0.0019425441,"threshold_uncertainty_score":0.03622085},"labels":[],"label_agreement":null},{"id":"W4283696279","doi":"10.1109/msp.2022.3163870","title":"Reproducibility in Matrix and Tensor Decompositions: Focus on model match, interpretability, and uniqueness","year":2022,"lang":"en","type":"article","venue":"IEEE Signal Processing Magazine","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Baycrest Hospital","funders":"National Institute on Aging; Norges Forskningsråd; National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health; U.S. Department of Health and Human Services","keywords":"Interpretability; Uniqueness; Focus (optics); Computer science; Audit; Tensor (intrinsic definition); Matrix (chemical analysis); Point (geometry); Artificial intelligence; Algorithm; Theoretical computer science; Mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Physics; Accounting; Geometry","score_opus":0.04122156571030822,"score_gpt":0.3400429608258426,"score_spread":0.2988213951155344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283696279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00707303,0.0031274068,0.9711211,0.010015211,0.0004322999,0.00007352599,0.00021497927,0.00053656404,0.007405873],"genre_scores_gemma":[0.3307149,0.0055982904,0.64959526,0.0027353202,0.002931341,0.00067532324,0.0010464237,0.0018046107,0.0048985244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9488403,0.030427238,0.002784118,0.008500727,0.008360343,0.001087292],"domain_scores_gemma":[0.77209795,0.12951353,0.012040071,0.07457814,0.009826495,0.0019437303],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06318138,0.0025713462,0.0027992786,0.004134785,0.0028609135,0.013211037,0.005721326,0.005466233,0.004835331],"category_scores_gemma":[0.24443313,0.0020519148,0.0028431085,0.0035553714,0.030824224,0.03340122,0.013159418,0.010332852,0.0018064918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071240225,0.000033710538,0.0010066024,0.00023118625,0.00009376801,0.00011971478,0.0011593918,0.008991605,0.00058889727,0.95366174,0.0027079717,0.031334076],"study_design_scores_gemma":[0.0000118691905,0.000021505613,0.00018984765,0.00009694777,0.000014503489,0.00007388929,0.00011315453,0.020402592,0.0008139465,0.9736892,0.004545069,0.000027440126],"about_ca_topic_score_codex":0.0024342372,"about_ca_topic_score_gemma":0.0015154565,"teacher_disagreement_score":0.9368186,"about_ca_system_score_codex":0.0038084325,"about_ca_system_score_gemma":0.0048194304,"threshold_uncertainty_score":0.3341391},"labels":[],"label_agreement":null},{"id":"W4283820924","doi":"10.1609/aaai.v36i3.20261","title":"Handling Slice Permutations Variability in Tensor Recovery","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Subspace topology; Algorithm; Exploit; Tensor contraction; Computer science; Mathematics; Exact solutions in general relativity; Artificial intelligence; Pure mathematics; Mathematical analysis","score_opus":0.12533328613039185,"score_gpt":0.34758533996514046,"score_spread":0.2222520538347486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283820924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02611085,0.00011485782,0.97260743,0.00013766965,0.000030628038,0.000031269017,0.000027436367,0.00027681014,0.0006630383],"genre_scores_gemma":[0.53420687,0.0002860817,0.46281797,0.00019370571,0.00010658962,0.00010260913,0.0003199244,0.0004588019,0.0015073657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668723,0.0011153092,0.00026312197,0.0005827798,0.0011132885,0.00023823245],"domain_scores_gemma":[0.98365146,0.008439644,0.0015848854,0.0046811816,0.0012913715,0.00035140093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003661636,0.00080581254,0.0009639955,0.00070072414,0.0012191416,0.0014776017,0.0011701143,0.0012518687,0.001324536],"category_scores_gemma":[0.022477902,0.00049893593,0.0008817372,0.0010244811,0.002138076,0.0042693694,0.002302198,0.002049129,0.00041937118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008268117,0.0001495971,0.0075632744,0.00037044584,0.00016589164,0.0008379676,0.0008124208,0.42839512,0.07869116,0.13534668,0.0030192493,0.34382135],"study_design_scores_gemma":[0.000012392517,0.00013915774,0.000808815,0.000015707363,0.000022359438,0.00039524684,0.000094000214,0.9115473,0.034763206,0.049462978,0.0026968562,0.000042004387],"about_ca_topic_score_codex":0.0013736075,"about_ca_topic_score_gemma":0.0017669803,"teacher_disagreement_score":0.003661636,"about_ca_system_score_codex":0.00057704665,"about_ca_system_score_gemma":0.001667399,"threshold_uncertainty_score":0.019364774},"labels":[],"label_agreement":null},{"id":"W4285133964","doi":"10.1109/tgrs.2022.3179275","title":"Efficient Tensor Completion Methods for 5-D Seismic Data Reconstruction: Low-Rank Tensor Train and Tensor Ring","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Matrix decomposition; Rank (graph theory); Computer science; Tensor contraction; Matrix (chemical analysis); Algorithm; Cartesian tensor; Mathematics; Tensor field; Tensor density; Exact solutions in general relativity; Geometry; Physics; Combinatorics; Mathematical analysis","score_opus":0.07786585200162596,"score_gpt":0.3602344492309203,"score_spread":0.2823685972292943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285133964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005459703,0.00020889657,0.99329317,0.00013431847,0.000027722888,0.000026251084,0.00007557785,0.00035725159,0.00041715192],"genre_scores_gemma":[0.11324589,0.0007793398,0.8819864,0.000104779814,0.000101760445,0.00014360038,0.0007095185,0.000247895,0.0026808889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931574,0.00021435016,0.00004454051,0.00013996933,0.00021592813,0.00006944955],"domain_scores_gemma":[0.9985678,0.0004903198,0.00018071086,0.00034174157,0.00031027562,0.00010902652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001580921,0.0014035191,0.0010890943,0.00094520295,0.00060711754,0.001010054,0.0013085809,0.0009972274,0.0028707883],"category_scores_gemma":[0.0043705124,0.00052936596,0.0011572564,0.0014758159,0.0011723477,0.0023666,0.0015940237,0.0021108838,0.0013263893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037489823,0.00018667516,0.0013046768,0.00035835,0.00012061564,0.00017525571,0.00029219975,0.48507002,0.03065193,0.065638065,0.009137618,0.40668964],"study_design_scores_gemma":[0.000012155933,0.000030592033,0.00011126656,0.0000069475313,0.000007242211,0.000036515044,0.0000189329,0.98745906,0.004016041,0.0066423453,0.0016429969,0.000015857411],"about_ca_topic_score_codex":0.0051928456,"about_ca_topic_score_gemma":0.0065335147,"teacher_disagreement_score":0.0051928456,"about_ca_system_score_codex":0.0005900431,"about_ca_system_score_gemma":0.0018410848,"threshold_uncertainty_score":0.010325253},"labels":[],"label_agreement":null},{"id":"W4285505181","doi":"10.1109/tii.2022.3190549","title":"Jointly Low-Rank Tensor Completion for Estimating Missing Spatiotemporal Values in Logistics Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Imputation (statistics); Missing data; Exploit; Data mining; Rank (graph theory); Trajectory; Matrix completion; Artificial intelligence; Machine learning; Mathematics","score_opus":0.1619201742071927,"score_gpt":0.3428514528192143,"score_spread":0.1809312786120216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285505181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009790272,0.00046364323,0.9887001,0.00021372971,0.000037080204,0.000030732273,0.00018153523,0.00030552046,0.00027744408],"genre_scores_gemma":[0.430189,0.0019440887,0.5602849,0.0002555113,0.0002669604,0.00027668488,0.003048698,0.00028922586,0.0034448463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832135,0.0007287697,0.00012244069,0.00037228604,0.00027493385,0.00018015063],"domain_scores_gemma":[0.996801,0.0016789275,0.00043624503,0.00033949973,0.000560146,0.00018421008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003319183,0.0018451483,0.0018180176,0.00121856,0.00062880706,0.0012517615,0.0014623879,0.0011624674,0.0014732722],"category_scores_gemma":[0.008596398,0.00077255775,0.0015174826,0.001814038,0.0012187243,0.002268102,0.0014279173,0.0027083561,0.00070119015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002878333,0.00013533245,0.0030451193,0.00053823134,0.00020238706,0.00029646076,0.00025728723,0.8361663,0.0051954896,0.017924188,0.005352806,0.1305986],"study_design_scores_gemma":[0.0000055353985,0.000025818077,0.00027246957,0.000009610952,0.000009385172,0.000020642428,0.000021476277,0.9928421,0.00055527966,0.005726806,0.0004964671,0.000014422177],"about_ca_topic_score_codex":0.012323592,"about_ca_topic_score_gemma":0.009052137,"teacher_disagreement_score":0.012323592,"about_ca_system_score_codex":0.000953937,"about_ca_system_score_gemma":0.0027362707,"threshold_uncertainty_score":0.024503708},"labels":[],"label_agreement":null},{"id":"W4285732454","doi":"10.3390/sym14071460","title":"The Minimum-Norm Least Squares Solutions to Quaternion Tensor Systems","year":2022,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Quaternion; Norm (philosophy); Mathematics; Tensor (intrinsic definition); Least-squares function approximation; Pure mathematics; Geometry","score_opus":0.0511561823783001,"score_gpt":0.3130702990485122,"score_spread":0.2619141166702121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285732454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009537974,0.000111368274,0.988112,0.0001569405,0.000031198444,0.000020562333,0.000024970539,0.000077143435,0.0019278706],"genre_scores_gemma":[0.19800892,0.0003556915,0.79644924,0.00008201684,0.000052078904,0.0000918115,0.0001788937,0.00020047107,0.0045808465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951756,0.00019956108,0.000025729041,0.000087423236,0.00013983643,0.000029828338],"domain_scores_gemma":[0.9990829,0.0004829224,0.00011491675,0.000089038906,0.0001996633,0.000030535517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013445005,0.0010128894,0.0006306025,0.00047549699,0.00037362092,0.00087906455,0.00071150425,0.000946254,0.0032376293],"category_scores_gemma":[0.0053307465,0.00040295016,0.00056545995,0.0005338694,0.001028867,0.001756983,0.0007260844,0.0010346299,0.00090097915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011384251,0.00006473665,0.00073333713,0.0003931904,0.000053954875,0.00016800797,0.00032362124,0.67466384,0.013487386,0.20803772,0.0032176736,0.09874276],"study_design_scores_gemma":[0.000011159681,0.000037707123,0.00009598596,0.000017281915,0.000004758277,0.00006408939,0.000068405614,0.9504085,0.0036193405,0.043595616,0.00206224,0.000014850238],"about_ca_topic_score_codex":0.0011314653,"about_ca_topic_score_gemma":0.0009582626,"teacher_disagreement_score":0.0032376293,"about_ca_system_score_codex":0.00030245708,"about_ca_system_score_gemma":0.0008004947,"threshold_uncertainty_score":0.010830939},"labels":[],"label_agreement":null},{"id":"W4286891768","doi":"10.48550/arxiv.2110.15479","title":"The Set of Orthogonal Tensor Trains","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Rank (graph theory); Mathematics; Set (abstract data type); Extension (predicate logic); Quadratic equation; Decomposition; Pure mathematics; Invariants of tensors; Type (biology); Algebra over a field; Applied mathematics; Combinatorics; Computer science; Geometry","score_opus":0.17111979242357392,"score_gpt":0.2480399177449049,"score_spread":0.07692012532133097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286891768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911767,0.0012495309,0.33848783,0.0014619576,0.0003971105,0.000109377375,0.0021786846,0.00047281434,0.06446599],"genre_scores_gemma":[0.932749,0.00088299386,0.03637001,0.0004632457,0.00059782143,0.00013873272,0.003367279,0.00030624866,0.02512475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980849,0.00031846855,0.000119650744,0.00049638166,0.0006551641,0.00032542285],"domain_scores_gemma":[0.9982224,0.0003533016,0.0003773776,0.00022443877,0.00045665106,0.00036585567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011639384,0.00086105365,0.0009985946,0.0025115174,0.0019554277,0.003288011,0.0009187248,0.00090777193,0.005732771],"category_scores_gemma":[0.003041008,0.0004824598,0.0011382505,0.0012036712,0.0029994324,0.0038713473,0.0029101714,0.0019319869,0.0009532079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045520577,0.000027951439,0.0010136112,0.00004919723,0.000021798849,0.000117376214,0.00019712684,0.002180454,0.0021992754,0.9843827,0.0021283233,0.007636749],"study_design_scores_gemma":[0.000022292741,0.00006088365,0.0012262308,0.000033681456,0.000020690453,0.0004118818,0.00019332902,0.029416138,0.001673449,0.9555344,0.011366474,0.000040564257],"about_ca_topic_score_codex":0.001398631,"about_ca_topic_score_gemma":0.0006677328,"teacher_disagreement_score":0.005732771,"about_ca_system_score_codex":0.0009585196,"about_ca_system_score_gemma":0.00080653274,"threshold_uncertainty_score":0.019178033},"labels":[],"label_agreement":null},{"id":"W4288374796","doi":"10.48550/arxiv.1904.03858","title":"The Kikuchi Hierarchy and Tensor PCA","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Banff International Research Station for Mathematical Innovation and Discovery; Johns Hopkins University; National Science Foundation","keywords":"Hessian matrix; Tensor (intrinsic definition); Hierarchy; Mathematics; Algorithm; Statistical inference; Theoretical computer science; Computer science; Discrete mathematics; Applied mathematics; Pure mathematics","score_opus":0.10748845762231672,"score_gpt":0.2285682961902354,"score_spread":0.12107983856791867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288374796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051087304,0.0011281963,0.9838663,0.0016664163,0.00012809584,0.000042553263,0.00015498282,0.0009051373,0.0069997576],"genre_scores_gemma":[0.18774542,0.0025197447,0.7916381,0.001271344,0.00073090254,0.0003607795,0.0006679783,0.0011212373,0.013944507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995363,0.0014217431,0.00020143617,0.00082283944,0.0016281822,0.0005626839],"domain_scores_gemma":[0.99033,0.0044201044,0.00072475045,0.0024509788,0.0015752224,0.00049898046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037271085,0.0016565023,0.0018088261,0.0024495672,0.002198304,0.0042021284,0.0033391707,0.002302899,0.008361676],"category_scores_gemma":[0.020705111,0.0012341934,0.0018773896,0.0033390087,0.0048014927,0.009445221,0.0052681062,0.007911213,0.004400165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008924035,0.000040140276,0.00052116346,0.00024589393,0.00004389676,0.00006710932,0.00031347052,0.043881968,0.0017287885,0.8576443,0.011655909,0.08376818],"study_design_scores_gemma":[0.000013046181,0.00001883386,0.00019221385,0.000031401098,0.000013013538,0.000050654042,0.000044735938,0.26990345,0.0009146114,0.7214403,0.007349218,0.000028480405],"about_ca_topic_score_codex":0.007935689,"about_ca_topic_score_gemma":0.007866042,"teacher_disagreement_score":0.008361676,"about_ca_system_score_codex":0.0043703155,"about_ca_system_score_gemma":0.0043204585,"threshold_uncertainty_score":0.031709015},"labels":[],"label_agreement":null},{"id":"W4293508040","doi":"10.1214/22-ejs2035","title":"Improved estimation in tensor regression with multiple change-points","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Estimator; Tensor (intrinsic definition); Context (archaeology); Applied mathematics; Regression; Statistics; Pure mathematics","score_opus":0.025661414888054183,"score_gpt":0.308099937728837,"score_spread":0.2824385228407828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293508040","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076971254,0.00028155936,0.9914308,0.00016564527,0.000028061668,0.00001363184,0.000033813503,0.000113973314,0.00023535869],"genre_scores_gemma":[0.37943348,0.0018076072,0.6106234,0.0003530744,0.0005244188,0.00018076597,0.0006087473,0.00039478776,0.006073602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562836,0.0023548682,0.00022413772,0.0009462409,0.0006385339,0.00020788267],"domain_scores_gemma":[0.98150474,0.011479516,0.002098578,0.0024985485,0.0020254715,0.00039314397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011909162,0.001483957,0.001908098,0.0013685655,0.00048697856,0.0016350548,0.0019007935,0.0020813567,0.001591582],"category_scores_gemma":[0.041338395,0.0010443039,0.0015385579,0.0016510985,0.0020134633,0.0049368115,0.0022208549,0.0030834265,0.0006763896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042165726,0.00012943735,0.007407748,0.0006131077,0.00038578082,0.00064105255,0.00049456576,0.54986805,0.012528168,0.25257385,0.002805961,0.17213061],"study_design_scores_gemma":[0.000011507713,0.000053806125,0.00077602355,0.000021917816,0.000033961678,0.00007833846,0.000017071468,0.9534369,0.0012800086,0.04313162,0.0011253665,0.000033391432],"about_ca_topic_score_codex":0.0029068347,"about_ca_topic_score_gemma":0.0018960959,"teacher_disagreement_score":0.011909162,"about_ca_system_score_codex":0.0008158509,"about_ca_system_score_gemma":0.0011148024,"threshold_uncertainty_score":0.06298238},"labels":[],"label_agreement":null},{"id":"W4300582220","doi":"10.48550/arxiv.1111.6091","title":"An adaptive algebraic multigrid algorithm for low-rank canonical tensor\\n decomposition","year":2011,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Rank (graph theory); Tensor (intrinsic definition); Mathematics; Relaxation (psychology); Multiplicative function; Algebraic number; Computation; Applied mathematics; Decomposition; Algorithm; Pure mathematics; Mathematical analysis; Combinatorics","score_opus":0.10483292272040505,"score_gpt":0.2550927736559139,"score_spread":0.1502598509355088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300582220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003606815,0.000048022048,0.9948456,0.00004914403,0.000025633504,0.00002107869,0.00002246639,0.00033187488,0.0010494012],"genre_scores_gemma":[0.067664646,0.00008669058,0.92919,0.000048380836,0.000030353403,0.000087522196,0.00016775959,0.00027234302,0.0024523549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973613,0.00006736996,0.000012423839,0.000043466054,0.000117355106,0.000023268009],"domain_scores_gemma":[0.9996612,0.00009816028,0.000028130338,0.00008371596,0.00010027489,0.00002851915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047658925,0.00045577923,0.0005343258,0.00051902526,0.00048183202,0.00058024377,0.0010520207,0.0006016985,0.002486493],"category_scores_gemma":[0.0012083505,0.00024913537,0.00061855715,0.0005003294,0.00057366065,0.00070964743,0.0011727158,0.0010415134,0.000995395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013413811,0.00009476758,0.0010109593,0.00018326788,0.000065761626,0.0001390913,0.00024333871,0.46914527,0.028966805,0.11897967,0.006761456,0.37427542],"study_design_scores_gemma":[0.000009033266,0.000015669977,0.00007396347,0.000003922101,0.0000035643454,0.000023734798,0.000007926043,0.98714286,0.0020058942,0.00705899,0.0036480178,0.000006460545],"about_ca_topic_score_codex":0.0024588876,"about_ca_topic_score_gemma":0.0037601963,"teacher_disagreement_score":0.002486493,"about_ca_system_score_codex":0.00044877888,"about_ca_system_score_gemma":0.00076839176,"threshold_uncertainty_score":0.008318186},"labels":[],"label_agreement":null},{"id":"W4302196109","doi":"","title":"In Praise of an Alternative BRDF Parametrization","year":2015,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Praise; Parametrization (atmospheric modeling); Bidirectional reflectance distribution function; Computer science; Reflectivity; Psychology; Optics; Physics; Social psychology","score_opus":0.03777879838743096,"score_gpt":0.3046572855705475,"score_spread":0.2668784871831165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302196109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010565612,0.0012153983,0.9730549,0.0017376844,0.00046990332,0.000055316123,0.00041749407,0.0008828628,0.011600835],"genre_scores_gemma":[0.23968454,0.0021151146,0.74248195,0.0015670287,0.000624102,0.0002931779,0.0015018963,0.001996039,0.009736043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672794,0.0012734849,0.00020265159,0.0007189167,0.00092896295,0.00014802502],"domain_scores_gemma":[0.99360985,0.0011838162,0.00035226202,0.003607175,0.0010676382,0.00017915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048128255,0.001887273,0.0012087914,0.0027370162,0.0010942598,0.0053700865,0.0030968601,0.0022882235,0.0074053057],"category_scores_gemma":[0.010910496,0.00076448283,0.0013966829,0.0026623406,0.0027213464,0.009672321,0.0040647024,0.0062873303,0.0035618336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018411296,0.000058614543,0.0028168962,0.00037136817,0.00009648481,0.00014650794,0.00056789553,0.023606954,0.018643608,0.7501701,0.008306635,0.19503087],"study_design_scores_gemma":[0.00005831589,0.00016328695,0.0020346045,0.00027579992,0.00008154967,0.00090219366,0.00052978005,0.12508783,0.011803328,0.6337283,0.2250762,0.00025882816],"about_ca_topic_score_codex":0.001855905,"about_ca_topic_score_gemma":0.0013077914,"teacher_disagreement_score":0.0074053057,"about_ca_system_score_codex":0.0013549131,"about_ca_system_score_gemma":0.0007471578,"threshold_uncertainty_score":0.025452912},"labels":[],"label_agreement":null},{"id":"W4310054753","doi":"10.1109/jtehm.2022.3219775","title":"Explainable Tensor Multi-Task Ensemble Learning Based on Brain Structure Variation for Alzheimer’s Disease Dynamic Prediction","year":2022,"lang":"en","type":"article","venue":"IEEE Journal of Translational Engineering in Health and Medicine","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Janssen Alzheimer Immunotherapy Research And Development; Johnson and Johnson Pharmaceutical Research and Development; Janssen Research and Development; National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; Meso Scale Diagnostics; Johnson and Johnson; Genentech; IXICO; H. Lundbeck A/S; Servier; Eisai; Pfizer; Biogen; BioClinica; Alzheimer's Disease Neuroimaging Initiative; Novartis Pharmaceuticals Corporation; Engineering and Physical Sciences Research Council; Eli Lilly and Company; Bristol-Myers Squibb; F. Hoffmann-La Roche; Alzheimer's Drug Discovery Foundation; National Institute on Aging; Innovate UK; Alzheimer's Association; Foundation for the National Institutes of Health","keywords":"Artificial intelligence; Computer science; Machine learning; Ensemble learning; Neuroimaging; Multiple kernel learning; Multi-task learning; Cognition; Alzheimer's Disease Neuroimaging Initiative; Functional magnetic resonance imaging; Pattern recognition (psychology); Task (project management); Support vector machine; Psychology; Cognitive impairment; Kernel method; Neuroscience","score_opus":0.03476800841063807,"score_gpt":0.3261177109128619,"score_spread":0.2913497025022238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310054753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071266465,0.0011365834,0.9255246,0.00046722151,0.00010150521,0.00004168007,0.00018033947,0.0006772958,0.0006041921],"genre_scores_gemma":[0.846978,0.00081838603,0.14889634,0.0001973763,0.0001624758,0.00012096247,0.00084491464,0.00010365183,0.0018779093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995365,0.0001834021,0.000025648682,0.000111063564,0.00007819441,0.0000652594],"domain_scores_gemma":[0.99845684,0.0007476095,0.00017159863,0.00022189617,0.00032622475,0.00007580819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026040026,0.0010115886,0.0011296511,0.0007461648,0.00049393775,0.0006619135,0.0008850212,0.00087295705,0.0007191981],"category_scores_gemma":[0.004544787,0.00037147308,0.0012753189,0.0006750324,0.0003569625,0.0010851197,0.0009046247,0.0017850761,0.00032738197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016628616,0.00013054327,0.0054639494,0.000043709177,0.00018119317,0.000081180406,0.000086626,0.8432899,0.0037985987,0.0029150958,0.0019216603,0.14192125],"study_design_scores_gemma":[0.0000016420886,0.000016964672,0.0002816661,0.0000020735506,0.000007822582,0.00000795131,0.0000025855543,0.99800545,0.0002547905,0.0012894219,0.00012572059,0.000003883028],"about_ca_topic_score_codex":0.0072078058,"about_ca_topic_score_gemma":0.0076854476,"teacher_disagreement_score":0.0072078058,"about_ca_system_score_codex":0.00057521585,"about_ca_system_score_gemma":0.0009090521,"threshold_uncertainty_score":0.014331698},"labels":[],"label_agreement":null},{"id":"W4312335457","doi":"10.1007/978-3-031-06947-5_2","title":"Shannon Capacity of Tensor Channels Under a Family of Power Constraints","year":2022,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Generalization; Channel (broadcasting); Tensor (intrinsic definition); Domain (mathematical analysis); Channel capacity; Power (physics); Focus (optics); Transmission (telecommunications); Constraint (computer-aided design); Frequency domain; Mathematics; Computer science; Space (punctuation); Topology (electrical circuits); Theoretical computer science; Telecommunications; Pure mathematics; Mathematical analysis; Physics; Combinatorics; Geometry","score_opus":0.0665942363153673,"score_gpt":0.2956151947206492,"score_spread":0.22902095840528186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312335457","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08811151,0.006377486,0.6886002,0.004582929,0.00059027603,0.00006199993,0.0011173112,0.00038293062,0.21017541],"genre_scores_gemma":[0.8951331,0.009671138,0.05839958,0.0008379196,0.0018864685,0.0002770427,0.000473771,0.00031918788,0.03300176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987747,0.0005075622,0.000046118363,0.00013700721,0.00033640655,0.00019824076],"domain_scores_gemma":[0.9953538,0.0033550668,0.00024950673,0.00049783825,0.00039362983,0.00015012042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022984443,0.0010349271,0.0010967113,0.0012890109,0.0009342199,0.0029505584,0.0010082206,0.0013566492,0.004894225],"category_scores_gemma":[0.0065592267,0.00049938745,0.00077640987,0.0020929608,0.003471217,0.0049989275,0.0014627709,0.002391714,0.0006356588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024118162,0.0000074479963,0.00003303372,0.000045043664,0.0000071770887,0.000029752035,0.000070623326,0.014745284,0.0007278469,0.9782411,0.0023554896,0.0037131396],"study_design_scores_gemma":[0.0000041118483,0.000009828093,0.000058577163,0.000016940594,0.0000050914787,0.0000506786,0.00002474376,0.045239452,0.00031282668,0.9524922,0.0017732339,0.000012304194],"about_ca_topic_score_codex":0.0010111564,"about_ca_topic_score_gemma":0.0004907252,"teacher_disagreement_score":0.004894225,"about_ca_system_score_codex":0.001249093,"about_ca_system_score_gemma":0.0011172588,"threshold_uncertainty_score":0.0163728},"labels":[],"label_agreement":null},{"id":"W4312799022","doi":"10.1109/iwaenc53105.2022.9914787","title":"Acoustic System Identification with Partially Time-Varying Models Based on Tensor Decompositions","year":2022,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"National Key Research and Development Program of China; National Science Foundation","keywords":"Finite impulse response; Impulse response; Computer science; LTI system theory; System identification; Linear filter; Microphone; Infinite impulse response; Algorithm; Speech recognition; Filter (signal processing); Acoustics; Linear system; Mathematics; Digital filter; Data modeling; Physics; Telecommunications","score_opus":0.03526491605262385,"score_gpt":0.2816687745280188,"score_spread":0.24640385847539495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312799022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043623773,0.00014243605,0.9948137,0.000045364723,0.000018840914,0.000010616505,0.000033170745,0.00013556288,0.00043800255],"genre_scores_gemma":[0.5176122,0.0013191031,0.47417217,0.00012701789,0.00013259529,0.00021390175,0.0006496677,0.0001962111,0.0055771647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993998,0.00020473011,0.000034976358,0.00013317521,0.00016772137,0.000059515234],"domain_scores_gemma":[0.99925834,0.00030096152,0.00014751694,0.00011104176,0.0001439058,0.000038292677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007264052,0.0010696189,0.000766096,0.00048128946,0.0003793012,0.00078313425,0.0006903467,0.00064513966,0.0013685257],"category_scores_gemma":[0.0022951618,0.00046649238,0.0012703496,0.00070016476,0.0007598183,0.001183486,0.0007236907,0.0013303536,0.0005460139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006362806,0.000029490997,0.00058974716,0.00009204356,0.000074186966,0.000093074384,0.000112401554,0.91485775,0.009261515,0.026234906,0.0007782343,0.04781304],"study_design_scores_gemma":[0.0000014683462,0.000012457529,0.000081361606,0.0000027604847,0.0000045650713,0.000013180416,0.000003800165,0.9966581,0.0003540026,0.0025151058,0.0003476126,0.000005596855],"about_ca_topic_score_codex":0.008389929,"about_ca_topic_score_gemma":0.0059936815,"teacher_disagreement_score":0.008389929,"about_ca_system_score_codex":0.00047722048,"about_ca_system_score_gemma":0.00094281806,"threshold_uncertainty_score":0.016682148},"labels":[],"label_agreement":null},{"id":"W4319653486","doi":"10.48550/arxiv.2302.03160","title":"Stretching maps for tensors","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Construct (python library); Symmetry (geometry); Mathematics; Algebraic number; Order (exchange); Pure mathematics; Algebra over a field; Invariants of tensors; Algebraic structure; Mathematical analysis; Computer science; Geometry","score_opus":0.24912995725061926,"score_gpt":0.26575926596096794,"score_spread":0.016629308710348678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319653486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1742722,0.0029221766,0.70386964,0.001823814,0.0017050855,0.00012854426,0.00036551125,0.0006793048,0.114233725],"genre_scores_gemma":[0.79017335,0.0030127706,0.15133874,0.0008461772,0.0020584022,0.00020495748,0.0004429966,0.0006004603,0.051322244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939406,0.0001484926,0.000036248013,0.000118226155,0.00021727581,0.00008566484],"domain_scores_gemma":[0.9991732,0.0002111436,0.0001448662,0.00016214343,0.0001580619,0.0001505702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092791225,0.0008867715,0.000296212,0.0013223737,0.001104,0.0015236593,0.00051419315,0.00066406745,0.0074685216],"category_scores_gemma":[0.0017093639,0.00023124237,0.0007646708,0.00064174965,0.0019007617,0.003450512,0.0017204595,0.0014228325,0.0015293297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001533558,0.000013183559,0.00009716419,0.000041100022,0.0000050911704,0.00008913014,0.00025417344,0.0012713212,0.0039325035,0.9830177,0.0009758333,0.010287396],"study_design_scores_gemma":[0.0000058433843,0.000052299423,0.00021025936,0.000019167688,0.000007923905,0.00023256992,0.00015813901,0.011285822,0.003650716,0.9604012,0.023959411,0.00001668513],"about_ca_topic_score_codex":0.00034564562,"about_ca_topic_score_gemma":0.00022218937,"teacher_disagreement_score":0.0074685216,"about_ca_system_score_codex":0.00058977486,"about_ca_system_score_gemma":0.0003222426,"threshold_uncertainty_score":0.024984717},"labels":[],"label_agreement":null},{"id":"W4320002729","doi":"10.1109/ojcoms.2023.3240406","title":"Capacity Performance of Tensor Multi-Domain Communication Systems With Discrete Signalling Constellations","year":2023,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Channel capacity; Tensor (intrinsic definition); Covariance; Constellation; Estimator; Computer science; Mathematics; Topology (electrical circuits); Channel (broadcasting); Gaussian; Limit (mathematics); Coding (social sciences); Mathematical optimization; Algorithm; Telecommunications; Physics","score_opus":0.1634124708187748,"score_gpt":0.3605079207027732,"score_spread":0.1970954498839984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320002729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52455646,0.0009891094,0.45554742,0.0008181207,0.00009330249,0.000060116883,0.00027987757,0.0004801347,0.01717557],"genre_scores_gemma":[0.9892786,0.0001491464,0.009614933,0.000034061333,0.000011128692,0.000018996281,0.00007218993,0.000019605364,0.0008013805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989606,0.00049887,0.0000356121,0.000078262645,0.00019247037,0.00023419343],"domain_scores_gemma":[0.99335325,0.0045470907,0.00047306233,0.0004789592,0.00091999944,0.00022763637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002187267,0.00081522885,0.0006860904,0.00047371458,0.0005354145,0.0011187621,0.0005463658,0.0008331632,0.0016755364],"category_scores_gemma":[0.0073070414,0.00023242185,0.00036073325,0.0005903921,0.0018202742,0.0013789652,0.0013655534,0.0008566341,0.00026744558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017158443,0.00002022641,0.00040648732,0.00005682849,0.000014850861,0.00010795646,0.000070359034,0.9761905,0.0032264905,0.014694027,0.00037566945,0.0046650274],"study_design_scores_gemma":[0.000005812481,0.000045380915,0.00014293917,0.000008327852,0.0000038928215,0.000033453176,0.00003504953,0.99406564,0.0017723829,0.0037679088,0.000106247884,0.000012948493],"about_ca_topic_score_codex":0.00523956,"about_ca_topic_score_gemma":0.0027676078,"teacher_disagreement_score":0.00523956,"about_ca_system_score_codex":0.0011556321,"about_ca_system_score_gemma":0.0012768989,"threshold_uncertainty_score":0.011567533},"labels":[],"label_agreement":null},{"id":"W4323022420","doi":"10.1109/tits.2023.3247961","title":"Low-Rank Hankel Tensor Completion for Traffic Speed Estimation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Canada Foundation for Innovation","keywords":"Matrix completion; Algorithm; Computer science; Hyperparameter; Tensor (intrinsic definition); Matrix norm; Mathematical optimization; Low-rank approximation; Mathematics","score_opus":0.08315372593801956,"score_gpt":0.3379218660780011,"score_spread":0.25476814013998156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323022420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041517476,0.00015114926,0.9949654,0.00009307978,0.000023099119,0.000013665209,0.00008147602,0.00017613362,0.00034428638],"genre_scores_gemma":[0.39835256,0.0011348804,0.5949185,0.00014281452,0.00018733482,0.00016155864,0.001418497,0.00021501766,0.0034688958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945444,0.00019507695,0.00003233126,0.00013356433,0.0001254838,0.00005917116],"domain_scores_gemma":[0.99847466,0.00076843344,0.0002066103,0.00016183704,0.00030754472,0.000080913385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011985325,0.001250603,0.0009187177,0.0006164746,0.00031271807,0.00068128057,0.0008142211,0.00082884013,0.0013524115],"category_scores_gemma":[0.004783024,0.000526781,0.0006959779,0.0010284656,0.000761991,0.0014676998,0.0007750582,0.0019695163,0.000518199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090965346,0.000048420232,0.0006962981,0.0001789847,0.000054229073,0.00007043638,0.000074073665,0.8997944,0.004850389,0.020645743,0.0025188047,0.07097725],"study_design_scores_gemma":[0.0000021397186,0.000009103439,0.00006087176,0.0000030451467,0.0000020983248,0.0000077623545,0.0000053631675,0.9955621,0.00038690894,0.0036398417,0.0003166811,0.000004174641],"about_ca_topic_score_codex":0.0076850294,"about_ca_topic_score_gemma":0.0058036163,"teacher_disagreement_score":0.0076850294,"about_ca_system_score_codex":0.00063302857,"about_ca_system_score_gemma":0.0015188183,"threshold_uncertainty_score":0.015280604},"labels":[],"label_agreement":null},{"id":"W4324283457","doi":"10.1007/978-3-031-06440-1_1","title":"Introduction","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Scope (computer science); Political science; Section (typography); Business; Geography; Computer science; Advertising","score_opus":0.06770331474931003,"score_gpt":0.31231748126240666,"score_spread":0.24461416651309664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324283457","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031197674,0.0036090259,0.006676584,0.001698494,0.0042380043,0.00007583891,0.0010566952,0.0005274631,0.98180586],"genre_scores_gemma":[0.0010679761,0.0019604114,0.0016272668,0.00052643084,0.0008314123,0.00004138875,0.00070537336,0.00021405476,0.99302566],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960274,0.000048216534,0.000014031503,0.00007946788,0.00021582913,0.00003971259],"domain_scores_gemma":[0.9995097,0.00007146743,0.000019430854,0.00007530532,0.0002443376,0.00007973132],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043883736,0.0009847259,0.00059136277,0.0019871404,0.0011997683,0.003272788,0.0012956329,0.0012106299,0.41941217],"category_scores_gemma":[0.0014670884,0.00037516758,0.0005077711,0.0017357416,0.00064211426,0.0030935968,0.0017533813,0.002005073,0.33359665],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016932443,0.000036085286,0.000059816073,0.00018163097,0.000002411542,0.000033444456,0.000116926036,0.00022968935,0.0004293706,0.08215404,0.7656565,0.1510832],"study_design_scores_gemma":[9.841555e-7,0.000003817346,0.000043785152,0.00005566915,8.3326955e-7,0.000026812999,0.000023759034,0.000037804853,0.00007119698,0.008654699,0.99107844,0.0000021993587],"about_ca_topic_score_codex":0.0019288696,"about_ca_topic_score_gemma":0.0038304268,"teacher_disagreement_score":0.41941217,"about_ca_system_score_codex":0.001271829,"about_ca_system_score_gemma":0.001408965,"threshold_uncertainty_score":0.82813805},"labels":[],"label_agreement":null},{"id":"W4362575656","doi":"10.22215/etd/2023-15405","title":"TC-GVF: Tensor Core GPU Based Vector Fitting Via Accelerated Tall-Skinny QR Solvers","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Gachon University; Nvidia","keywords":"Computer science; Parallel computing; Tensor (intrinsic definition); Convergence (economics); Computational science; Speedup; Factorization; Multi-core processor; Set (abstract data type); CUDA; General-purpose computing on graphics processing units; QR decomposition; Algorithm; Mathematics; Computer graphics (images)","score_opus":0.1005501877717839,"score_gpt":0.3679465451712774,"score_spread":0.2673963573994935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362575656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026133927,0.00023613888,0.9896796,0.00015584043,0.00012291741,0.00005694568,0.000119472876,0.0017547606,0.005260859],"genre_scores_gemma":[0.06288774,0.00046969362,0.9227462,0.00015514738,0.00009209007,0.00013456844,0.0006914002,0.0015007422,0.011322472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956137,0.00009119005,0.000018331022,0.000075424505,0.0002092206,0.00004446461],"domain_scores_gemma":[0.9994696,0.00013704867,0.00003882253,0.000113283015,0.00019385753,0.000047446752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006914888,0.0009624368,0.00083472783,0.00065661623,0.00054374844,0.0014540268,0.0015129505,0.0010974016,0.011523641],"category_scores_gemma":[0.002245952,0.000392778,0.00072899566,0.0008829142,0.000610608,0.0014355534,0.0016395203,0.0017739623,0.0048520337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017304518,0.00014038372,0.0010726932,0.0003998256,0.00011521578,0.00030112427,0.0003612518,0.38560668,0.018188972,0.14126538,0.046023127,0.40635234],"study_design_scores_gemma":[0.000015256315,0.000021844973,0.000070642775,0.000019515806,0.0000053121726,0.00006966546,0.000024575093,0.9700823,0.0033894198,0.010768693,0.015519516,0.000013195236],"about_ca_topic_score_codex":0.0052299355,"about_ca_topic_score_gemma":0.006785592,"teacher_disagreement_score":0.011523641,"about_ca_system_score_codex":0.0005809817,"about_ca_system_score_gemma":0.0017491616,"threshold_uncertainty_score":0.038550377},"labels":[],"label_agreement":null},{"id":"W4364322627","doi":"10.1109/tcss.2022.3227458","title":"Tensor-Based Baum–Welch Algorithms in Coupled Hidden Markov Model for Responsible Activity Prediction","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Machine learning; Hidden Markov model; Distrust; Tensor (intrinsic definition); Big data; Data mining; Mathematics","score_opus":0.07810676939060002,"score_gpt":0.34728629780789216,"score_spread":0.26917952841729215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364322627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022190118,0.0008112923,0.97474796,0.00038477677,0.0000916526,0.000041738833,0.00012612344,0.000790702,0.00081569963],"genre_scores_gemma":[0.6816413,0.00094656675,0.311414,0.00038918588,0.00017129006,0.00022051143,0.0011703419,0.0002308202,0.0038160414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992348,0.00026663285,0.00006181396,0.00022296926,0.000109489265,0.000104273124],"domain_scores_gemma":[0.99789435,0.0012859814,0.00019478155,0.00016827353,0.00035803794,0.00009862834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001555938,0.0012537255,0.0014864617,0.00082611665,0.0007698628,0.00092905783,0.002045177,0.0011766471,0.0016264353],"category_scores_gemma":[0.0051842555,0.0006965383,0.0012285654,0.0013020025,0.00074970897,0.0016219675,0.0011231188,0.0022976396,0.00070854224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014479826,0.00009605281,0.0024306485,0.000102293634,0.000118091106,0.000077765544,0.00015153801,0.83843756,0.0014052758,0.010853561,0.0019613612,0.14422114],"study_design_scores_gemma":[0.0000019982265,0.000004288106,0.00006581953,0.0000024307483,0.0000043205428,0.0000035642424,0.0000035753885,0.9972045,0.00012621301,0.0024859218,0.00009327919,0.000004064247],"about_ca_topic_score_codex":0.032469347,"about_ca_topic_score_gemma":0.024580339,"teacher_disagreement_score":0.032469347,"about_ca_system_score_codex":0.001200005,"about_ca_system_score_gemma":0.0023746204,"threshold_uncertainty_score":0.06456065},"labels":[],"label_agreement":null},{"id":"W4364856218","doi":"10.1109/tii.2023.3266401","title":"Tensor-Based Lyapunov Deep Neural Networks Offloading Control Strategy With Cloud–Fog–Edge Orchestration","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Orchestration; Quality of service; Enhanced Data Rates for GSM Evolution; Edge computing; Lyapunov optimization; Distributed computing; Artificial neural network; Computer network; Artificial intelligence; Lyapunov equation","score_opus":0.09010082933644514,"score_gpt":0.3031708338836976,"score_spread":0.21307000454725245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364856218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06543591,0.00034817835,0.9248168,0.00028582744,0.00017120126,0.00005434057,0.00004080095,0.0008573944,0.007989493],"genre_scores_gemma":[0.9789342,0.00009733699,0.01823875,0.000074375705,0.000021547312,0.00003583236,0.000042262855,0.000027881291,0.0025277976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980026,0.000025665775,0.000013736315,0.000055625285,0.00004796581,0.000056841316],"domain_scores_gemma":[0.99981433,0.000040086517,0.000030284353,0.000017913546,0.00006720351,0.000030182919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033596306,0.0009769166,0.0004615007,0.000204985,0.00042016327,0.0006421773,0.00067524664,0.0004064638,0.0013964801],"category_scores_gemma":[0.0006332724,0.0002024471,0.000384472,0.00016639601,0.00040009987,0.00064161845,0.00080596184,0.00063663337,0.00018051274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019505955,0.00009453122,0.0010492087,0.0000934774,0.000042054402,0.0002103001,0.00009761413,0.9051748,0.014217078,0.008409394,0.0022681719,0.06814827],"study_design_scores_gemma":[0.0000037340512,0.000016528882,0.00004984013,0.0000015258977,0.000003613979,0.000005780048,0.000004546722,0.9984654,0.00069542334,0.00060398795,0.00014721458,0.000002408428],"about_ca_topic_score_codex":0.0090443855,"about_ca_topic_score_gemma":0.008840546,"teacher_disagreement_score":0.0090443855,"about_ca_system_score_codex":0.00074864697,"about_ca_system_score_gemma":0.00082412,"threshold_uncertainty_score":0.017983496},"labels":[],"label_agreement":null},{"id":"W4366850781","doi":"10.48550/arxiv.2304.10658","title":"Linear to multi-linear algebra and systems using tensors","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor algebra; Algebra over a field; Linear algebra; Tensor (intrinsic definition); Tensor contraction; Tensor product; Tensor product of Hilbert spaces; Multilinear algebra; Multivector; Linear system; Mathematics; Cartesian tensor; Computer science; Pure mathematics; Algebra representation; Tensor density; Cellular algebra; Tensor field; Exact solutions in general relativity; Mathematical analysis; Geometry","score_opus":0.3283661630865402,"score_gpt":0.29264565646008545,"score_spread":0.03572050662645476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366850781","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007853221,0.04067411,0.8672073,0.006183286,0.0036181994,0.000096678734,0.00060734164,0.0007319995,0.073027834],"genre_scores_gemma":[0.31346077,0.06810151,0.53402185,0.0073573026,0.011327695,0.00062014017,0.0012781869,0.0012049231,0.0626276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783,0.00091790396,0.0001808498,0.00047664487,0.00047492087,0.00011970909],"domain_scores_gemma":[0.99838924,0.0006972359,0.00019873258,0.00028887115,0.00032533615,0.000100505524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020211306,0.0019369296,0.0010725443,0.0025650642,0.0011436914,0.0040334794,0.0007839657,0.0012953442,0.013557263],"category_scores_gemma":[0.0026850253,0.00050444773,0.0016838121,0.0027128882,0.0064164246,0.0057039433,0.0029119747,0.0052336925,0.0041866847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008634049,0.000009182207,0.00006898882,0.00021388938,0.00001669872,0.00009307351,0.0002692149,0.0015978867,0.00062166486,0.9777399,0.004434705,0.014926093],"study_design_scores_gemma":[0.0000044292246,0.00003271805,0.00016325347,0.00010752705,0.0000091202855,0.00025660437,0.000114929,0.008521061,0.0004819444,0.9247604,0.06552624,0.000021692855],"about_ca_topic_score_codex":0.0012793855,"about_ca_topic_score_gemma":0.00088561885,"teacher_disagreement_score":0.013557263,"about_ca_system_score_codex":0.0017342874,"about_ca_system_score_gemma":0.0009804033,"threshold_uncertainty_score":0.04535353},"labels":[],"label_agreement":null},{"id":"W4367191582","doi":"10.19086/da.73322","title":"geometric-rank-of-tensors-and-subrank-of-matrix-multiplication","year":2023,"lang":"","type":"preprint","venue":"Discrete Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Strassen algorithm; Combinatorics; Matrix multiplication; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics","score_opus":0.052503720976420136,"score_gpt":0.35744533678563467,"score_spread":0.30494161580921453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367191582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036201417,0.03912695,0.6813576,0.019902555,0.0073265447,0.00009434467,0.0021864187,0.0015547177,0.21224943],"genre_scores_gemma":[0.6450622,0.024270903,0.19089296,0.007598066,0.014534104,0.00021966167,0.0031396379,0.0018879535,0.11239455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985403,0.00038032702,0.000084687876,0.00040683008,0.0004397278,0.00014816326],"domain_scores_gemma":[0.9980787,0.00063741894,0.00025719177,0.00040684742,0.00042840999,0.00019138733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013962048,0.0012958933,0.00093473686,0.0016848575,0.0012244835,0.0041740322,0.00067089696,0.0012288586,0.009606267],"category_scores_gemma":[0.0053233486,0.00054920744,0.0010848421,0.0018444784,0.0048195357,0.01076037,0.0022469447,0.0034211266,0.004702865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004074524,0.0000112697235,0.00026438278,0.00007467664,0.000011587512,0.00006837861,0.00017665839,0.0010974525,0.0005159575,0.95772755,0.02318818,0.01682308],"study_design_scores_gemma":[0.0000048307547,0.000018040551,0.00033272136,0.000029369066,0.000006739063,0.00019838732,0.00007859465,0.0032389022,0.00041315777,0.9562448,0.039412376,0.000022094977],"about_ca_topic_score_codex":0.0009925469,"about_ca_topic_score_gemma":0.0013248572,"teacher_disagreement_score":0.009606267,"about_ca_system_score_codex":0.0016983981,"about_ca_system_score_gemma":0.00072648725,"threshold_uncertainty_score":0.0321362},"labels":[],"label_agreement":null},{"id":"W4376123207","doi":"10.48550/arxiv.2305.05622","title":"Multilinear Hyperquiver Representations","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Division of Materials Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Multilinear map; Quiver; Hypergraph; Tensor (intrinsic definition); Mathematics; Representation (politics); Dimension (graph theory); Eigenvalues and eigenvectors; Tuple; Linear subspace; Pure mathematics; Variety (cybernetics); Algebra over a field; Discrete mathematics","score_opus":0.28622343688893837,"score_gpt":0.2895679401618224,"score_spread":0.0033445032728840474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376123207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3961032,0.0011904808,0.55210316,0.0013486801,0.00044286108,0.00010312332,0.0006673077,0.0006409662,0.047400206],"genre_scores_gemma":[0.90859175,0.00071892684,0.07094397,0.0003157577,0.0004051014,0.00010868393,0.0006176929,0.00043488044,0.017863194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989237,0.00023487212,0.000055789784,0.0002875985,0.00028556454,0.00021235122],"domain_scores_gemma":[0.99781907,0.0005244227,0.00042779316,0.00036762812,0.0004897783,0.00037132666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010688631,0.0009741301,0.00076908624,0.004353488,0.0012229279,0.0029087535,0.0011241833,0.0011328096,0.007348737],"category_scores_gemma":[0.004244768,0.00036381665,0.0007557361,0.001766771,0.0027696246,0.005596622,0.001826276,0.0018036222,0.001100848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025633142,0.000021440037,0.00082156213,0.000058090678,0.000011872958,0.00010492073,0.00022154198,0.0030422728,0.002332211,0.982366,0.0015341374,0.009460352],"study_design_scores_gemma":[0.000003373539,0.000025214104,0.00043174814,0.000028389104,0.000008254108,0.00014775773,0.00013424018,0.029373962,0.0016089468,0.9636941,0.004523133,0.000021100974],"about_ca_topic_score_codex":0.0007690331,"about_ca_topic_score_gemma":0.0008607543,"teacher_disagreement_score":0.007348737,"about_ca_system_score_codex":0.0010622542,"about_ca_system_score_gemma":0.00042380983,"threshold_uncertainty_score":0.024583995},"labels":[],"label_agreement":null},{"id":"W4377115366","doi":"10.13001/ela.2023.7635","title":"Bounding real tensor optimizations via the numerical range","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounding overwatch; Eigenvalues and eigenvectors; Semidefinite programming; Numerical range; Linear algebra; Tensor (intrinsic definition); Numerical linear algebra; Matrix (chemical analysis); Tensor product; Rank (graph theory); Subspace topology; Range (aeronautics); Linear programming; Upper and lower bounds; Positive-definite matrix; Numerical analysis; Algebra over a field; Combinatorics; Pure mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.02920302873916053,"score_gpt":0.3254095091602312,"score_spread":0.2962064804210707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377115366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066121756,0.00067625684,0.9848273,0.0003205015,0.00011075032,0.000020509973,0.00003261532,0.00034760297,0.007052268],"genre_scores_gemma":[0.45884237,0.0015338901,0.5299293,0.0003879262,0.00039329613,0.00033961638,0.00019590494,0.00092551426,0.0074522295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969914,0.0013020881,0.00011893068,0.0003946363,0.0009955654,0.00019732445],"domain_scores_gemma":[0.99037826,0.0063592023,0.00073735474,0.001356296,0.0008810487,0.00028782955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037091468,0.0017634522,0.0011110198,0.001155746,0.00060920394,0.0024448482,0.0013345146,0.0010349344,0.0046993536],"category_scores_gemma":[0.017007282,0.00066934025,0.000763512,0.0008192226,0.00334645,0.0049415785,0.0037039837,0.0041840794,0.0012492161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023504504,0.000079518075,0.0005677484,0.00027808506,0.000059430276,0.000098142475,0.00014801756,0.41609982,0.012284078,0.49830678,0.003591401,0.06825192],"study_design_scores_gemma":[0.000009221108,0.00005961944,0.00007181786,0.000044114204,0.000008130935,0.000042372496,0.00001708344,0.8484711,0.003946244,0.14449091,0.002816892,0.000022478813],"about_ca_topic_score_codex":0.0007448789,"about_ca_topic_score_gemma":0.0009908528,"teacher_disagreement_score":0.0046993536,"about_ca_system_score_codex":0.0011167842,"about_ca_system_score_gemma":0.0011104923,"threshold_uncertainty_score":0.019616127},"labels":[],"label_agreement":null},{"id":"W4378952188","doi":"10.1063/5.0149832","title":"Computing vibrational energy levels using a canonical polyadic tensor method with a fixed rank and a contraction tree","year":2023,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Université Paris-Saclay; Compute Canada","keywords":"Wave function; Tensor (intrinsic definition); Inverse; Contraction (grammar); Rank (graph theory); Tree (set theory); Mathematics; Physics; Computer science; Quantum mechanics; Combinatorics; Pure mathematics; Geometry","score_opus":0.0695368673051236,"score_gpt":0.35097201046346627,"score_spread":0.28143514315834267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378952188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06255851,0.00011031308,0.9301457,0.00020416894,0.000082204046,0.00006723743,0.00013712983,0.00075319334,0.005941559],"genre_scores_gemma":[0.16164222,0.00012067696,0.8341746,0.00007211168,0.000022961705,0.00016550097,0.0002669409,0.00044342023,0.0030915774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997416,0.00006970021,0.000013842234,0.000036228335,0.00010049051,0.000038212962],"domain_scores_gemma":[0.99957937,0.0001302422,0.000029229623,0.000088314824,0.00012534016,0.000047522703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006356952,0.0006844152,0.00064696465,0.000435101,0.000662729,0.0007326702,0.001089758,0.0006795038,0.0034097265],"category_scores_gemma":[0.001234642,0.00031344488,0.00054336095,0.0006050057,0.0006539392,0.001205108,0.0008764931,0.001272058,0.0010252944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021107038,0.00021608626,0.0016035794,0.00033583932,0.00005559269,0.00022750329,0.00029346702,0.7146868,0.044247527,0.11871507,0.003575378,0.11583203],"study_design_scores_gemma":[0.000015001843,0.00003825342,0.00007050524,0.000003952676,0.000004058813,0.000019688488,0.00002785348,0.9887961,0.00324429,0.0062045683,0.0015669661,0.000008759089],"about_ca_topic_score_codex":0.0027224116,"about_ca_topic_score_gemma":0.005484929,"teacher_disagreement_score":0.0034097265,"about_ca_system_score_codex":0.0004226001,"about_ca_system_score_gemma":0.0014676724,"threshold_uncertainty_score":0.0114066005},"labels":[],"label_agreement":null},{"id":"W4381331525","doi":"10.1016/j.jmva.2023.105206","title":"Tensor Stein-rules in a generalized tensor regression model","year":2023,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Estimator; Tensor (intrinsic definition); Applied mathematics; Covariate; Context (archaeology); Asymptotic distribution; Statistics; Pure mathematics","score_opus":0.07984146258435315,"score_gpt":0.3837853891623493,"score_spread":0.3039439265779961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381331525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045363065,0.00051330874,0.9496881,0.0007983865,0.000106122505,0.000043413173,0.00019619695,0.00021574173,0.003075692],"genre_scores_gemma":[0.6115228,0.002108845,0.35696027,0.00073308055,0.0005709588,0.00025358866,0.0008865826,0.00043612704,0.026527708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951912,0.0023639144,0.00035207663,0.000885313,0.0008998861,0.00030754303],"domain_scores_gemma":[0.97440535,0.014229323,0.0029923578,0.004021964,0.0030630887,0.0012879585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008757429,0.0012372194,0.0026679693,0.0019977489,0.0012494124,0.0036202078,0.0024747376,0.0022594645,0.0036946621],"category_scores_gemma":[0.028869089,0.0010305725,0.0017613599,0.001997492,0.003908557,0.00675986,0.0026446106,0.0034201192,0.00093367405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046391247,0.00004679498,0.0012836768,0.00005877207,0.00006125976,0.0002118865,0.0001477637,0.045409046,0.0005383226,0.93287045,0.0016763305,0.01764923],"study_design_scores_gemma":[0.000010054532,0.000024192112,0.00024329325,0.000015279486,0.000019436256,0.00008761707,0.000023334052,0.27957612,0.00014666116,0.7189576,0.0008736204,0.000022916582],"about_ca_topic_score_codex":0.0051019965,"about_ca_topic_score_gemma":0.005004198,"teacher_disagreement_score":0.008757429,"about_ca_system_score_codex":0.0010049121,"about_ca_system_score_gemma":0.0019855544,"threshold_uncertainty_score":0.04631424},"labels":[],"label_agreement":null},{"id":"W4383312765","doi":"10.1088/1361-6579/ace510","title":"ETucker: a constrained tensor decomposition for single trial ERP extraction","year":2023,"lang":"en","type":"article","venue":"Physiological Measurement","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor decomposition; Extraction (chemistry); Decomposition; Tensor (intrinsic definition); Computer science; Artificial intelligence; Mathematics; Chemistry; Chromatography; Pure mathematics","score_opus":0.34906108780742046,"score_gpt":0.41865683166488765,"score_spread":0.0695957438574672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383312765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045730174,0.00015255708,0.99394715,0.00008706021,0.000039079143,0.000050777075,0.00023628502,0.0005793919,0.0003346915],"genre_scores_gemma":[0.09620059,0.0005041943,0.8981977,0.000102693564,0.00009799789,0.0002659328,0.0016761522,0.00033864338,0.0026160998],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993476,0.00024023723,0.0000537474,0.00014032707,0.00016109749,0.000056981895],"domain_scores_gemma":[0.9990336,0.00027988618,0.0001277442,0.00016569509,0.00032584305,0.000067238696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011939285,0.0014869855,0.0007326751,0.0010846282,0.0003415815,0.0010430262,0.00088572095,0.00073380396,0.004099764],"category_scores_gemma":[0.0034391352,0.00033245655,0.0011247353,0.0011238166,0.0004372948,0.0012654425,0.0010126797,0.0012117922,0.0016668926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044898066,0.00016631688,0.0014667758,0.00050069357,0.00019757004,0.0002340836,0.00013930051,0.110278875,0.07366141,0.015036341,0.011512653,0.78635705],"study_design_scores_gemma":[0.00002064764,0.00010940376,0.0010067588,0.000025672913,0.00002911745,0.00013062186,0.000029833547,0.9768099,0.0099435635,0.006151676,0.005711366,0.000031493622],"about_ca_topic_score_codex":0.0036303336,"about_ca_topic_score_gemma":0.0039935242,"teacher_disagreement_score":0.004099764,"about_ca_system_score_codex":0.00037619635,"about_ca_system_score_gemma":0.0012556835,"threshold_uncertainty_score":0.013715029},"labels":[],"label_agreement":null},{"id":"W4385553849","doi":"10.1137/22m1531907","title":"A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Imaging Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"National Key Research and Development Program of China; Research Grants Council, University Grants Committee; National Natural Science Foundation of China","keywords":"Algorithm; Mathematics; S transform; Computer science; Matrix norm; Tensor (intrinsic definition); Artificial intelligence; Mathematical optimization; Geometry; Physics","score_opus":0.07202506911643215,"score_gpt":0.3541081900783005,"score_spread":0.2820831209618684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385553849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028660228,0.00017557906,0.9960509,0.0001395545,0.000031366286,0.000018068056,0.00004201025,0.0001537454,0.0005227468],"genre_scores_gemma":[0.24013545,0.0013473856,0.7493837,0.00030413634,0.0002550154,0.000356667,0.0009898294,0.00041018252,0.0068176603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989293,0.0003759611,0.000058372134,0.0002780557,0.00028366127,0.00007464855],"domain_scores_gemma":[0.9982451,0.000701542,0.00021364544,0.00021071344,0.0004858976,0.0001430981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016534525,0.0013867359,0.0011892318,0.00082009536,0.00044892306,0.0010136314,0.0013516756,0.0013702818,0.0020334153],"category_scores_gemma":[0.0060214805,0.00047903598,0.0012485416,0.0011341036,0.0016185528,0.0022723987,0.0019365298,0.0029133665,0.00086669467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019168489,0.000097143944,0.0010595223,0.00033003092,0.000093318595,0.0001854917,0.00020996065,0.71944255,0.011257027,0.08184947,0.007491498,0.17779227],"study_design_scores_gemma":[0.0000035965413,0.000025087453,0.000046288245,0.000006292623,0.000004546736,0.000025711595,0.0000069520393,0.9911028,0.00096763653,0.0070520462,0.00074834615,0.000010766451],"about_ca_topic_score_codex":0.00566918,"about_ca_topic_score_gemma":0.003948277,"teacher_disagreement_score":0.00566918,"about_ca_system_score_codex":0.0010402204,"about_ca_system_score_gemma":0.0019211868,"threshold_uncertainty_score":0.011272371},"labels":[],"label_agreement":null},{"id":"W4385633790","doi":"10.1016/j.sigpro.2023.109216","title":"Recursive least-squares algorithm based on a third-order tensor decomposition for low-rank system identification","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Recursive least squares filter; Adaptive filter; Rank (graph theory); Impulse response; Mathematics; Matrix decomposition; Computational complexity theory; Least-squares function approximation; Kronecker product; Finite impulse response; Computer science; Mathematical optimization; Kronecker delta; Statistics","score_opus":0.03647775312829842,"score_gpt":0.34155362725061617,"score_spread":0.30507587412231774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385633790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001637693,0.00006681757,0.9977245,0.00002835236,0.000017583961,0.000012742791,0.000016743437,0.00029510807,0.00020056279],"genre_scores_gemma":[0.073592946,0.00026334377,0.9236782,0.000052448504,0.000046803296,0.00011237853,0.00023267725,0.00018982562,0.0018314526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944574,0.00016387146,0.000039825587,0.000111366986,0.00018772445,0.000051471783],"domain_scores_gemma":[0.99897987,0.00040032304,0.0000965108,0.00016262615,0.00032342473,0.000037288366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007666452,0.0010726394,0.0011970178,0.0005989173,0.0006623066,0.000729977,0.0008888443,0.0008492594,0.002126111],"category_scores_gemma":[0.0029260877,0.00045711195,0.000983872,0.0009370374,0.0005442724,0.0009709006,0.000687101,0.0018234381,0.0014371674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026942242,0.00018543728,0.000876823,0.00032427593,0.00018299498,0.00014240538,0.00027179124,0.33962405,0.07564454,0.04266806,0.006071917,0.5337382],"study_design_scores_gemma":[0.0000068049303,0.000036711335,0.0001861204,0.000006080727,0.000015361918,0.000044782224,0.000007864372,0.9908698,0.0047448436,0.0025976228,0.0014681412,0.000015844435],"about_ca_topic_score_codex":0.005775072,"about_ca_topic_score_gemma":0.0075178035,"teacher_disagreement_score":0.005775072,"about_ca_system_score_codex":0.00039885018,"about_ca_system_score_gemma":0.0018817085,"threshold_uncertainty_score":0.011482894},"labels":[],"label_agreement":null},{"id":"W4385737293","doi":"10.3390/sym15081560","title":"An Iterative Wiener Filter Based on a Fourth-Order Tensor Decomposition","year":2023,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Wiener filter; Mathematics; Tensor (intrinsic definition); Kronecker delta; Filter (signal processing); Algorithm; Mathematical optimization; Tensor product; Adaptive filter; Filter design; Applied mathematics; Computer science","score_opus":0.039071188953253816,"score_gpt":0.35834807820768716,"score_spread":0.3192768892544333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385737293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025997462,0.00006909936,0.99666166,0.000024678558,0.00002759272,0.00001509497,0.000011878453,0.00013208506,0.00045822558],"genre_scores_gemma":[0.0923844,0.00038910782,0.90243876,0.000065936474,0.000060471757,0.000116194984,0.00014353229,0.00009380477,0.0043077497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994435,0.00011195518,0.000039309034,0.00010668544,0.00023651846,0.000062089755],"domain_scores_gemma":[0.9994267,0.00021106146,0.0000635468,0.00007591933,0.00018425952,0.000038477418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010293532,0.0008895319,0.0009046252,0.0007495743,0.00037905504,0.0008162659,0.0008508506,0.0011079874,0.0023347249],"category_scores_gemma":[0.0018558978,0.00039442745,0.0011499095,0.0007714939,0.0006056865,0.0013088544,0.0007590016,0.0010574734,0.001010144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046467903,0.00015574353,0.0013536428,0.00035392528,0.00025401035,0.00025933306,0.0003003159,0.24113952,0.18965474,0.07221433,0.0028826683,0.49096704],"study_design_scores_gemma":[0.000020298794,0.00012914697,0.0002535394,0.000020125814,0.000038500584,0.00016452745,0.000015159197,0.9686915,0.021682221,0.004639984,0.004309822,0.000035172216],"about_ca_topic_score_codex":0.0027196438,"about_ca_topic_score_gemma":0.0030294217,"teacher_disagreement_score":0.0027196438,"about_ca_system_score_codex":0.00043218263,"about_ca_system_score_gemma":0.0013283828,"threshold_uncertainty_score":0.007810414},"labels":[],"label_agreement":null},{"id":"W4385882083","doi":"10.1109/bmsb58369.2023.10211188","title":"Novel Personalized Multimedia Recommendation Systems Using Tensor Singular-Value-Decomposition","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Singular value decomposition; Computer science; Recommender system; Multimedia; Tensor decomposition; Decomposition; Tensor (intrinsic definition); Information retrieval; Artificial intelligence; Mathematics","score_opus":0.1190994709113317,"score_gpt":0.3896650378705325,"score_spread":0.2705655669592008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385882083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035289586,0.0016984508,0.9580178,0.00028232805,0.0001651002,0.00013465926,0.00034282304,0.0017063379,0.0023628827],"genre_scores_gemma":[0.39717233,0.0017658251,0.5922996,0.00032816947,0.00023774842,0.00020237187,0.0013747952,0.0001293818,0.006489863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990126,0.00020220522,0.00008617989,0.00025958463,0.0003392225,0.00010015861],"domain_scores_gemma":[0.99876046,0.00031113083,0.0001394484,0.00018705586,0.00052053103,0.00008138524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138956,0.0012712816,0.001509466,0.001590957,0.0007026554,0.0009908349,0.0012655497,0.001002257,0.0023425259],"category_scores_gemma":[0.0029876246,0.00047612516,0.0014518359,0.0020865074,0.0003345907,0.0016994874,0.0006808651,0.0010232291,0.0013714731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061341684,0.00043893643,0.005129497,0.0003505213,0.0005161223,0.00033276805,0.00025472758,0.18815604,0.03654078,0.00880729,0.014495653,0.7443643],"study_design_scores_gemma":[0.000027195763,0.000113206705,0.00068543607,0.000011607232,0.000070808084,0.00010293197,0.000037393285,0.9915236,0.0036999679,0.001755529,0.0019382491,0.000034036617],"about_ca_topic_score_codex":0.01703792,"about_ca_topic_score_gemma":0.021834387,"teacher_disagreement_score":0.01703792,"about_ca_system_score_codex":0.0006110851,"about_ca_system_score_gemma":0.0008266526,"threshold_uncertainty_score":0.033877492},"labels":[],"label_agreement":null},{"id":"W4386570219","doi":"10.1016/j.cam.2023.115559","title":"Computing the extremal nonnegative solutions of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e1182\" altimg=\"si3.svg\"><mml:mi>M</mml:mi></mml:math>-tensor equation with a nonnegative right-side vector","year":2023,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tensor (intrinsic definition); Convergence (economics); Applied mathematics; Invertible matrix; Mathematical proof; Numerical analysis; Mathematical analysis; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.034236055271423364,"score_gpt":0.2707205369192474,"score_spread":0.23648448164782404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386570219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24076752,0.000701068,0.73543274,0.0020223982,0.00030304628,0.0000998129,0.0009094489,0.0005131548,0.019250764],"genre_scores_gemma":[0.74555665,0.00045253464,0.2416469,0.00023446299,0.00012380372,0.00013646063,0.001086682,0.00055500347,0.010207464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996637,0.00010474315,0.000019181589,0.00007299313,0.000058725727,0.000080663136],"domain_scores_gemma":[0.99819225,0.0011416341,0.00016989408,0.00008844521,0.00020960181,0.00019816332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013050392,0.0010143487,0.00077011815,0.0011811794,0.00059726846,0.0016622397,0.0010557817,0.00116865,0.00810561],"category_scores_gemma":[0.008295195,0.00053706876,0.0006434731,0.0005534313,0.0014056801,0.0021310272,0.0014743881,0.0015413639,0.00077396695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087144686,0.000322218,0.0057729674,0.001077982,0.00014931976,0.0009268252,0.00040795773,0.27184626,0.012106868,0.57700866,0.028043961,0.10146553],"study_design_scores_gemma":[0.000031477863,0.000051926236,0.0009002644,0.000069255555,0.000015211875,0.00011959453,0.00014546294,0.7749964,0.002106993,0.22008084,0.0014408785,0.000041692918],"about_ca_topic_score_codex":0.0016424826,"about_ca_topic_score_gemma":0.0030774332,"teacher_disagreement_score":0.00810561,"about_ca_system_score_codex":0.00059074926,"about_ca_system_score_gemma":0.0010817596,"threshold_uncertainty_score":0.027115941},"labels":[],"label_agreement":null},{"id":"W4386645607","doi":"10.1002/sta4.615","title":"A modified partial envelope tensor response regression","year":2023,"lang":"en","type":"article","venue":"Stat","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Envelope (radar); Estimator; Mathematics; Consistency (knowledge bases); Multivariate statistics; Applied mathematics; Regression analysis; Regression; Linear regression; Dimensionality reduction; Statistics; Computer science; Artificial intelligence; Geometry","score_opus":0.10489743131836093,"score_gpt":0.38393872167020576,"score_spread":0.27904129035184483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386645607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071014175,0.00022333213,0.9909861,0.00019967291,0.000054813205,0.000027468264,0.00014436399,0.00020804083,0.0010548302],"genre_scores_gemma":[0.42055935,0.0021859764,0.5552408,0.0007859922,0.00037707877,0.00037130655,0.00124675,0.00059401453,0.018638743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980862,0.0009956138,0.00006796989,0.00033351398,0.00037531077,0.00014146323],"domain_scores_gemma":[0.99693966,0.001285251,0.000388033,0.0006577661,0.0006021958,0.00012707907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037578477,0.0012053215,0.0012245027,0.0009062427,0.00036176675,0.0014411219,0.0018472571,0.0015558936,0.004773437],"category_scores_gemma":[0.009732225,0.0005363807,0.001591104,0.0018759309,0.0009918021,0.0027558238,0.0014277622,0.001531057,0.0018652768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027575763,0.00017267228,0.00328913,0.00036393185,0.00026485344,0.00031947953,0.00021987558,0.5721247,0.014496494,0.18422924,0.0069870916,0.21725671],"study_design_scores_gemma":[0.0000108309105,0.000060339265,0.00052048697,0.00001945489,0.000023818655,0.00007700578,0.000012780286,0.97672427,0.0008834741,0.018742872,0.0028968719,0.000027841785],"about_ca_topic_score_codex":0.0028334996,"about_ca_topic_score_gemma":0.001964741,"teacher_disagreement_score":0.004773437,"about_ca_system_score_codex":0.0004930031,"about_ca_system_score_gemma":0.001368248,"threshold_uncertainty_score":0.01987362},"labels":[],"label_agreement":null},{"id":"W4386797719","doi":"10.1016/j.aml.2023.108861","title":"A note on Newton–Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensor","year":2023,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounded function; Quadratic growth; Constant (computer programming); Convergence (economics); Sequence (biology); Combinatorics; Tensor (intrinsic definition); Quadratic equation; Applied mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.05296986112414553,"score_gpt":0.32763578983850167,"score_spread":0.27466592871435613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386797719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009737853,0.00057637267,0.9785725,0.00055929524,0.0006739552,0.00004972575,0.00006896544,0.00067221443,0.009089111],"genre_scores_gemma":[0.11443339,0.00045996107,0.8709795,0.00045203872,0.00034080647,0.0001526964,0.00016291757,0.0007237097,0.012295019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899656,0.0003796644,0.000060667822,0.00017388958,0.00030948926,0.00007978027],"domain_scores_gemma":[0.9984799,0.00079343916,0.000043344542,0.00030269456,0.00023189635,0.00014873006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022819312,0.0012305676,0.0017575551,0.0013777274,0.0011542586,0.0019177282,0.0018839217,0.0014359929,0.007515986],"category_scores_gemma":[0.0067811874,0.0006103814,0.0014142407,0.0010984511,0.0023897146,0.0033192872,0.003415933,0.0036567026,0.0026681798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041936597,0.00013425745,0.0013252252,0.00037171325,0.00017274727,0.00042983287,0.00063724257,0.05650332,0.009757462,0.70799816,0.01395826,0.20829234],"study_design_scores_gemma":[0.000050203224,0.00012640336,0.0003897153,0.000074920885,0.000049050646,0.00013235089,0.000087939996,0.5865816,0.0043019135,0.38423494,0.023863195,0.00010773821],"about_ca_topic_score_codex":0.0040348186,"about_ca_topic_score_gemma":0.0073604546,"teacher_disagreement_score":0.007515986,"about_ca_system_score_codex":0.0010366727,"about_ca_system_score_gemma":0.0013182693,"threshold_uncertainty_score":0.025143504},"labels":[],"label_agreement":null},{"id":"W4387314795","doi":"10.23919/ursigass57860.2023.10265592","title":"Multidimensional Optical Diffraction using Tensor Train Decompositions","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tensor (intrinsic definition); Diffraction; Computer science; Planar; Decomposition; Tensor decomposition; Aperture (computer memory); Algorithm; Mathematics; Physics; Optics; Geometry; Computer graphics (images)","score_opus":0.10832684114535103,"score_gpt":0.3892752841619538,"score_spread":0.28094844301660277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387314795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015560074,0.00010524617,0.978084,0.00014458783,0.000040448595,0.000038618702,0.000082873245,0.00019977965,0.0057443804],"genre_scores_gemma":[0.47959667,0.0008229778,0.51143956,0.00013016567,0.000054835757,0.000186674,0.0002839376,0.00026889556,0.007216285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972993,0.00009930657,0.000015961085,0.000021568774,0.000102278194,0.00003098395],"domain_scores_gemma":[0.9994331,0.0002089505,0.000060648275,0.000121784935,0.00012862489,0.000046810364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060404005,0.00069565466,0.00049609505,0.0005769559,0.00047532862,0.0012416786,0.00069670356,0.00060820027,0.003306361],"category_scores_gemma":[0.0012345096,0.0003142279,0.0007508551,0.00097440626,0.00083260686,0.0020135236,0.000844265,0.0009472729,0.00057855254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007189722,0.00007149818,0.00060695544,0.000109580105,0.000033888788,0.00012704558,0.00016533435,0.59786624,0.014994149,0.35703704,0.0017526572,0.027163671],"study_design_scores_gemma":[0.000003347559,0.000006707903,0.000025709805,0.0000035641106,0.000001349655,0.000014839504,0.0000107014675,0.9825659,0.001093252,0.015470627,0.0007979477,0.0000060024176],"about_ca_topic_score_codex":0.0030859872,"about_ca_topic_score_gemma":0.0027865707,"teacher_disagreement_score":0.003306361,"about_ca_system_score_codex":0.00073621626,"about_ca_system_score_gemma":0.0008306326,"threshold_uncertainty_score":0.011060894},"labels":[],"label_agreement":null},{"id":"W4388032305","doi":"10.48550/arxiv.2310.17827","title":"A hierarchy of eigencomputations for polynomial optimization on the sphere","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hierarchy; Eigenvalues and eigenvectors; Homogeneous polynomial; Polynomial; Norm (philosophy); Semidefinite programming; Upper and lower bounds; Tensor product; Computation; Combinatorics; Discrete mathematics; Applied mathematics; Mathematical optimization; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.23692606262448673,"score_gpt":0.2631305185265006,"score_spread":0.026204455902013868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388032305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013793615,0.00038045584,0.96725756,0.00063850987,0.00007462242,0.000058631103,0.00013919077,0.0006624709,0.016994962],"genre_scores_gemma":[0.32920277,0.0010479018,0.6527364,0.0006773497,0.00031454721,0.00033698554,0.00058470684,0.0012497727,0.013849603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704117,0.0007824913,0.00020317669,0.0003478545,0.0013117355,0.00031365166],"domain_scores_gemma":[0.9948689,0.0025569391,0.00022775376,0.00106242,0.0009575103,0.0003264498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027437222,0.0013377615,0.0013133597,0.0014949946,0.0012747409,0.0031612015,0.0020226105,0.0011711128,0.010295422],"category_scores_gemma":[0.012467517,0.0007181677,0.0014288961,0.0013844505,0.0032076738,0.004701528,0.0038779469,0.004928056,0.0036509167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000866098,0.000059669554,0.00036492472,0.00020562363,0.000022032262,0.000078358185,0.00026673372,0.07699899,0.0051754913,0.8698396,0.0045564575,0.04234555],"study_design_scores_gemma":[0.00001632084,0.00003846532,0.000111874455,0.000034725246,0.0000069679563,0.00003505903,0.00003756757,0.52680314,0.0021008714,0.4663704,0.004424727,0.000019874447],"about_ca_topic_score_codex":0.0028059634,"about_ca_topic_score_gemma":0.004465973,"teacher_disagreement_score":0.010295422,"about_ca_system_score_codex":0.0022415475,"about_ca_system_score_gemma":0.0019175345,"threshold_uncertainty_score":0.03444159},"labels":[],"label_agreement":null},{"id":"W4388623247","doi":"10.1109/iseee58596.2023.10310482","title":"Iterative Wiener Filter Based on Third-Order Tensor Decomposition and Coordinate Descent Method","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Wiener filter; Coordinate descent; Algorithm; Finite impulse response; Kronecker product; Matrix decomposition; Computer science; Impulse response; Wiener deconvolution; Filter design; Kronecker delta; Mathematical optimization; Tensor product; Iterative method; Tensor (intrinsic definition); Filter (signal processing); Mathematics; Blind deconvolution; Deconvolution","score_opus":0.05286332385413682,"score_gpt":0.38070564655764133,"score_spread":0.3278423227035045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388623247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023207895,0.00008332402,0.996992,0.000031112348,0.000017841969,0.000014906968,0.000013892319,0.00012518454,0.00040092572],"genre_scores_gemma":[0.10352964,0.0004556021,0.89128125,0.000058966292,0.00005718262,0.0001662224,0.00018186503,0.00012368773,0.00414554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993636,0.00018524493,0.000038270784,0.00009569644,0.00024858135,0.00006864759],"domain_scores_gemma":[0.9994216,0.00018961959,0.000066125285,0.00005911231,0.00022279922,0.000040829702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010122142,0.0008937394,0.001010388,0.0006790548,0.00044811072,0.000758102,0.0008133802,0.0010762664,0.0016555428],"category_scores_gemma":[0.0018182591,0.00037134523,0.0011061566,0.0008421539,0.0005614335,0.00094688084,0.0007283749,0.0010216006,0.0008155859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003080933,0.00012303948,0.001276271,0.00030126775,0.00019357068,0.00030985888,0.0003223747,0.54383004,0.081287794,0.09142936,0.0042473045,0.27637106],"study_design_scores_gemma":[0.00000817417,0.000041226853,0.0001574757,0.0000058359583,0.000010409833,0.00005285017,0.0000053388844,0.99021167,0.0053886073,0.0027152363,0.0013850398,0.000018081462],"about_ca_topic_score_codex":0.0053436416,"about_ca_topic_score_gemma":0.004085735,"teacher_disagreement_score":0.0053436416,"about_ca_system_score_codex":0.0006224559,"about_ca_system_score_gemma":0.0016141175,"threshold_uncertainty_score":0.010625064},"labels":[],"label_agreement":null},{"id":"W4388820672","doi":"10.1109/apsipaasc58517.2023.10317157","title":"Coupled Transformed Induced Tensor Nuclear Norm for Robust Tensor Completion","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Youth Foundation","keywords":"Tensor (intrinsic definition); Singular value decomposition; Matrix norm; Computer science; Unitary transformation; Algorithm; Matrix decomposition; Representation (politics); Theoretical computer science; Artificial intelligence; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.1465151743967936,"score_gpt":0.34488642834357813,"score_spread":0.19837125394678454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388820672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017345806,0.00017622483,0.99724704,0.000101663456,0.000030683386,0.000018412726,0.000059395647,0.00015757408,0.00047430518],"genre_scores_gemma":[0.18749078,0.001282759,0.8020109,0.0002956721,0.00026215267,0.00033457548,0.0014503639,0.00045437913,0.0064184177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985518,0.0006044269,0.00006588628,0.0003268674,0.00035738846,0.00009376652],"domain_scores_gemma":[0.99760383,0.0010633386,0.00031836424,0.00037971098,0.00048041638,0.00015427981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546402,0.0019678795,0.0014223271,0.00088165695,0.00043757271,0.0012615619,0.0016279969,0.0014500411,0.0026736162],"category_scores_gemma":[0.006667753,0.00055103004,0.0012433495,0.0013421259,0.0020181858,0.00211279,0.0018827665,0.003284355,0.0014904417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016663961,0.000099623845,0.00043247678,0.00045382653,0.00012767944,0.0001569638,0.00014240642,0.74492747,0.008517602,0.11834234,0.007968737,0.11866432],"study_design_scores_gemma":[0.0000048529223,0.00003339192,0.00004000299,0.000008784675,0.000005456922,0.00002951042,0.00000846812,0.9785544,0.000802871,0.019170243,0.0013317808,0.000010228549],"about_ca_topic_score_codex":0.004271764,"about_ca_topic_score_gemma":0.004417961,"teacher_disagreement_score":0.004271764,"about_ca_system_score_codex":0.0010014108,"about_ca_system_score_gemma":0.0023758996,"threshold_uncertainty_score":0.013466835},"labels":[],"label_agreement":null},{"id":"W4390098046","doi":"10.1109/focs57990.2023.00079","title":"Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"National Science Foundation","keywords":"Quantum entanglement; Variety (cybernetics); Linear subspace; Mathematics; Rank (graph theory); Dimension (graph theory); Time complexity; Tensor (intrinsic definition); Polynomial; Subspace topology; Degeneracy (biology); Intersection (aeronautics); Field (mathematics); Quantum computer; Discrete mathematics; Combinatorics; Quantum; Pure mathematics; Quantum mechanics; Physics","score_opus":0.04927050754117019,"score_gpt":0.3501297681485778,"score_spread":0.30085926060740764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390098046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4034478,0.0010164612,0.57706356,0.0025969467,0.000087581946,0.00010676224,0.0004919641,0.0013124486,0.013876414],"genre_scores_gemma":[0.8530907,0.000351521,0.14112012,0.0001890227,0.00009688859,0.000062856656,0.0006660888,0.00019710607,0.0042256266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988961,0.00026927015,0.00005210058,0.00038161722,0.00018786007,0.00021291274],"domain_scores_gemma":[0.9970715,0.0017616231,0.00025951205,0.0005324475,0.00016455803,0.00021043501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100719,0.0007018978,0.00097088865,0.0009143136,0.0015523635,0.002498266,0.0013215427,0.001154241,0.004230826],"category_scores_gemma":[0.004738658,0.00046531818,0.0011276772,0.0016629021,0.0033624428,0.00713855,0.0028541188,0.0026349,0.0006696331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003823889,0.00015963345,0.004075695,0.00026401234,0.00007607268,0.0003596872,0.0011090139,0.13759662,0.005499992,0.781927,0.0054451795,0.063104615],"study_design_scores_gemma":[0.000022867933,0.000047810914,0.00042207818,0.00002915307,0.000016419963,0.00012684257,0.000323141,0.27329808,0.004383999,0.71780777,0.0034968457,0.000024948262],"about_ca_topic_score_codex":0.0018548331,"about_ca_topic_score_gemma":0.0019276519,"teacher_disagreement_score":0.004230826,"about_ca_system_score_codex":0.0013083067,"about_ca_system_score_gemma":0.00083521643,"threshold_uncertainty_score":0.01415354},"labels":[],"label_agreement":null},{"id":"W4390597122","doi":"10.5383/juspn.17.02.003","title":"Low Rank Graph Regularization Embedding for 2D+3D Facial Expression Recognition","year":2022,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hebei Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Embedding; Tensor (intrinsic definition); Facial expression; Regularization (linguistics); Graph embedding; Rank (graph theory); Pattern recognition (psychology); Support vector machine; Graph; Computer science; Artificial intelligence; Mathematics; Theoretical computer science; Combinatorics; Pure mathematics","score_opus":0.03549677848626891,"score_gpt":0.29689852905576325,"score_spread":0.26140175056949433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390597122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006421971,0.00027996989,0.99197173,0.00013936283,0.000040829716,0.00002237177,0.00010156659,0.00045165012,0.0005705438],"genre_scores_gemma":[0.32473937,0.001351938,0.66533047,0.00029198293,0.00014287175,0.00019850123,0.0015066048,0.00039419858,0.0060439915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994184,0.00018279601,0.000027222126,0.00012838586,0.00018786617,0.000055441535],"domain_scores_gemma":[0.9995808,0.000121017445,0.000061840685,0.00007500012,0.0001300123,0.000031322506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006743868,0.0013637521,0.00084342033,0.00089652534,0.0002751167,0.00086081325,0.0008232163,0.0006473063,0.0018601109],"category_scores_gemma":[0.001755963,0.0003529374,0.0010939582,0.00084315235,0.00051157206,0.0012356632,0.00088991254,0.001205054,0.0010375659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023209701,0.00013490606,0.0013152792,0.00028670297,0.00013431592,0.00018864802,0.00017323585,0.28662392,0.036005706,0.021484837,0.012551388,0.64086896],"study_design_scores_gemma":[0.0000035327278,0.00002916016,0.00026415393,0.000008220249,0.000010334314,0.00007064594,0.000024637486,0.99029225,0.002503885,0.0050043543,0.0017758092,0.000013019024],"about_ca_topic_score_codex":0.0037131505,"about_ca_topic_score_gemma":0.0038114528,"teacher_disagreement_score":0.0037131505,"about_ca_system_score_codex":0.0004771772,"about_ca_system_score_gemma":0.0006634665,"threshold_uncertainty_score":0.007383108},"labels":[],"label_agreement":null},{"id":"W4390738662","doi":"10.1109/access.2024.3352597","title":"Orthogonal Tensor Recovery Based on Non-Convex Regularization and Rank Estimation","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Mathematics; Rank (graph theory); Cartesian tensor; Tensor density; Applied mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Tensor field; Pure mathematics; Combinatorics; Exact solutions in general relativity","score_opus":0.0384202557798864,"score_gpt":0.34826829803445325,"score_spread":0.30984804225456686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390738662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016606934,0.00012742587,0.9976357,0.000058517122,0.000022370858,0.000016236932,0.000020578911,0.00014227549,0.00031620363],"genre_scores_gemma":[0.093147576,0.00090827263,0.9013658,0.00015815657,0.0001709888,0.00012002007,0.0004492498,0.0003107301,0.0033690874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987016,0.0003717529,0.000080599726,0.00025098588,0.00048819647,0.00010677758],"domain_scores_gemma":[0.9981408,0.00069729413,0.0002571737,0.00037856254,0.00043828232,0.000087923785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015169322,0.0015599316,0.0013171842,0.0012786265,0.00055267086,0.0011575387,0.0013170299,0.0010991974,0.0016829572],"category_scores_gemma":[0.005358183,0.00054281607,0.0010319179,0.0012992524,0.0013527464,0.002712856,0.001544205,0.0021447141,0.0011836856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004357439,0.00019501905,0.0013293445,0.0005903694,0.00018487414,0.00038530273,0.0002754354,0.2653779,0.09421247,0.11122062,0.010478779,0.5153141],"study_design_scores_gemma":[0.000009600133,0.000045680546,0.0001320203,0.000010790426,0.000015120019,0.00013831386,0.000017148659,0.9771689,0.010928768,0.009104827,0.0024032344,0.000025563468],"about_ca_topic_score_codex":0.002099831,"about_ca_topic_score_gemma":0.0024557132,"teacher_disagreement_score":0.002099831,"about_ca_system_score_codex":0.00055467576,"about_ca_system_score_gemma":0.0012903676,"threshold_uncertainty_score":0.008022428},"labels":[],"label_agreement":null},{"id":"W4390956094","doi":"10.1109/tce.2024.3355064","title":"An Adaptive Rank-Based Tensor Ring Completion Model for Intelligent Transportation Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fundamental Research Funds for the Central Universities; Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Rank (graph theory); Computer science; Pruning; Kernel (algebra); Bayesian probability; Algorithm; Ring (chemistry); Bayesian inference; Artificial intelligence; Data mining; Mathematical optimization; Mathematics; Geometry","score_opus":0.06601193932888896,"score_gpt":0.3320654461814597,"score_spread":0.2660535068525708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390956094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036140173,0.00012963606,0.9953992,0.000103200844,0.000021108588,0.00001804477,0.0000904406,0.00017149898,0.00045286288],"genre_scores_gemma":[0.43722153,0.00095921167,0.549049,0.00024369021,0.0001506988,0.00025573393,0.0014025959,0.00029992108,0.010417663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993092,0.00021324487,0.000033435394,0.00017615022,0.00017779136,0.000090214286],"domain_scores_gemma":[0.9991621,0.0002789253,0.00012710317,0.000115954776,0.00024764327,0.00006833735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015020294,0.0010419466,0.0010727549,0.0006775864,0.00041642404,0.0010311479,0.0017274324,0.0010660741,0.002741934],"category_scores_gemma":[0.0028938667,0.0004839335,0.0010844924,0.00095141225,0.00092482293,0.0020726367,0.0010859977,0.0019796668,0.0010133035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011404972,0.000058132136,0.00060000905,0.0001174055,0.00004321122,0.000079903264,0.0000744982,0.90739715,0.0041072746,0.03173381,0.00323722,0.05243739],"study_design_scores_gemma":[0.0000021291605,0.000009395336,0.000041299092,0.0000018899042,0.0000025919655,0.0000073129377,0.000003419754,0.99703974,0.00026915447,0.0022873569,0.0003309227,0.00000480496],"about_ca_topic_score_codex":0.008935784,"about_ca_topic_score_gemma":0.0082080625,"teacher_disagreement_score":0.008935784,"about_ca_system_score_codex":0.0008070059,"about_ca_system_score_gemma":0.0016807906,"threshold_uncertainty_score":0.017767549},"labels":[],"label_agreement":null},{"id":"W4391536396","doi":"10.3389/fams.2023.1259836","title":"Linear to multi-linear algebra and systems using tensors","year":2024,"lang":"en","type":"article","venue":"Frontiers in Applied Mathematics and Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebra over a field; Linear algebra; Mathematics; Linear system; Multilinear algebra; Pure mathematics; Algebra representation; Cellular algebra; Mathematical analysis; Geometry","score_opus":0.052679173140480644,"score_gpt":0.33117619320859937,"score_spread":0.2784970200681187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391536396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00717603,0.024767097,0.9120816,0.0041346326,0.0023212994,0.00009526979,0.00047526084,0.0005049851,0.048443828],"genre_scores_gemma":[0.31250364,0.046646673,0.5834553,0.0054922234,0.008188179,0.0006405616,0.0011396697,0.00082376436,0.04110994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973748,0.0011418975,0.00022123437,0.00057651044,0.00053931493,0.0001462613],"domain_scores_gemma":[0.9975254,0.0010501543,0.00034680817,0.00045520905,0.0004873514,0.00013516919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024802715,0.0019475354,0.0011264795,0.0025738338,0.0011867576,0.0039506927,0.00089470303,0.0011943801,0.012090523],"category_scores_gemma":[0.0035285403,0.00051611185,0.001848617,0.0026506418,0.0071541704,0.0055267825,0.0030508996,0.0046109483,0.0033078275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008408328,0.000009024666,0.00008075095,0.00018197611,0.000018948733,0.000090959635,0.00024619602,0.002518942,0.000567651,0.981874,0.002761918,0.011641224],"study_design_scores_gemma":[0.000004445416,0.00003567371,0.00017626763,0.00009032677,0.000010280467,0.0001984832,0.0001074795,0.013226486,0.00041591245,0.94340825,0.04230309,0.000023377881],"about_ca_topic_score_codex":0.001611576,"about_ca_topic_score_gemma":0.0010798748,"teacher_disagreement_score":0.012090523,"about_ca_system_score_codex":0.0017237294,"about_ca_system_score_gemma":0.0011289164,"threshold_uncertainty_score":0.040446877},"labels":[],"label_agreement":null},{"id":"W4391564802","doi":"10.1007/s11749-023-00915-5","title":"Change-point detection in a tensor regression model","year":2024,"lang":"en","type":"article","venue":"Test","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regression; Econometrics; Regression analysis; Point (geometry); Mathematics; Tensor (intrinsic definition); Statistics; Statistical physics; Computer science; Physics; Pure mathematics; Geometry","score_opus":0.10017456302058811,"score_gpt":0.35940688321485004,"score_spread":0.2592323201942619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391564802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04816867,0.00023391552,0.94924414,0.00059540925,0.00007516331,0.00004277929,0.00019496195,0.0007641609,0.0006808009],"genre_scores_gemma":[0.80140334,0.00035390232,0.19200936,0.00019715483,0.00023188264,0.00014011352,0.0008301436,0.0003769434,0.004457219],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99470717,0.0026260265,0.00027371183,0.0011752417,0.0007917713,0.00042616265],"domain_scores_gemma":[0.9621838,0.028206255,0.0028236478,0.0032266758,0.0025319827,0.0010276278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010305324,0.0014822453,0.0023753266,0.0025885925,0.0007678512,0.0023100027,0.0027665407,0.0027595821,0.004101684],"category_scores_gemma":[0.050798707,0.00075486157,0.0012423646,0.0022939797,0.0027773993,0.0040126042,0.0023163876,0.0034198295,0.001013712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001446088,0.00051605195,0.026691709,0.0005190103,0.0005107704,0.0006929638,0.000381511,0.401948,0.0109490445,0.14444593,0.009596645,0.40230227],"study_design_scores_gemma":[0.0000102031145,0.00006693297,0.0010250817,0.000010683842,0.000017435199,0.000046148896,0.000020840333,0.9732006,0.00075517385,0.024511162,0.0003170792,0.000018619754],"about_ca_topic_score_codex":0.007038333,"about_ca_topic_score_gemma":0.0035643089,"teacher_disagreement_score":0.010305324,"about_ca_system_score_codex":0.00090320065,"about_ca_system_score_gemma":0.0019024778,"threshold_uncertainty_score":0.05450046},"labels":[],"label_agreement":null},{"id":"W4391629159","doi":"10.1016/j.disc.2024.113915","title":"On a relationship between the characteristic and matching polynomials of a uniform hypertree","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Stroke Consortium; China Scholarship Council; Natural Science Foundation of Jiangxi Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Hyperbolic tree; Counterexample; Tree (set theory); Exponent; Conjecture; Boundary (topology); Matching (statistics); Discrete mathematics; Pure mathematics; Hyperbolic geometry","score_opus":0.06615074844130979,"score_gpt":0.3378207297208488,"score_spread":0.271669981279539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391629159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7165669,0.0009932282,0.2417311,0.0020761369,0.00023062358,0.000049411643,0.00035741995,0.0002475044,0.037747655],"genre_scores_gemma":[0.9722014,0.0007324269,0.020499615,0.00024739618,0.00029454267,0.000024155179,0.00014616699,0.00011324236,0.0057410663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934465,0.00019076598,0.000026309779,0.0001582388,0.00012717696,0.00015280968],"domain_scores_gemma":[0.9904621,0.0053970073,0.0017199294,0.0005895791,0.0007625428,0.0010688066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014186032,0.00041526632,0.0008460142,0.0033592018,0.0013704775,0.0025490532,0.001408684,0.0009828265,0.0057669412],"category_scores_gemma":[0.012722343,0.00043860613,0.00061665644,0.0035040127,0.0042023757,0.0074853306,0.0020916117,0.0027986718,0.0005083205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006327445,0.00002424238,0.0009780657,0.00003301809,0.000005378605,0.0000585409,0.00024615257,0.0022103577,0.0010798977,0.9876316,0.00083164405,0.0068379175],"study_design_scores_gemma":[0.0000130992585,0.000033336055,0.0007524489,0.000016793527,0.000011037521,0.00015969216,0.0001588522,0.019653378,0.0004350838,0.9774719,0.0012722005,0.000022236101],"about_ca_topic_score_codex":0.0019208365,"about_ca_topic_score_gemma":0.001874129,"teacher_disagreement_score":0.0057669412,"about_ca_system_score_codex":0.001413085,"about_ca_system_score_gemma":0.000737708,"threshold_uncertainty_score":0.019292295},"labels":[],"label_agreement":null},{"id":"W4392411623","doi":"10.2196/53241","title":"Creating High-Quality Synthetic Health Data: Framework for Model Development and Validation","year":2024,"lang":"en","type":"article","venue":"JMIR Formative Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Children's Hospital of Eastern Ontario; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quality (philosophy); Computer science; Model validation; Data quality; Data science; Data mining; Engineering; Operations management","score_opus":0.37240777582468176,"score_gpt":0.5654031685451946,"score_spread":0.1929953927205128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392411623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0089101,0.00019391465,0.98827934,0.00061018503,0.000030699663,0.00020260659,0.00052274053,0.00027863082,0.0009718032],"genre_scores_gemma":[0.31557795,0.000493917,0.6773928,0.0003378943,0.000104300496,0.0018904083,0.0025782194,0.00017446917,0.0014500349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99305093,0.0048521818,0.0002734396,0.000807651,0.0007151213,0.0003006571],"domain_scores_gemma":[0.9488401,0.043119036,0.0020086626,0.0018357773,0.0035945806,0.00060198933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02032527,0.0014009138,0.0012238275,0.0023361526,0.0009756358,0.00275593,0.003724742,0.002474182,0.0033560554],"category_scores_gemma":[0.062413026,0.0011235704,0.0021570001,0.0018011018,0.002213158,0.0021230439,0.0034261392,0.0037389921,0.0005623354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004484991,0.00004789251,0.0024363417,0.00007229658,0.000059734193,0.0001138509,0.00014482548,0.92963904,0.00013421108,0.05693951,0.0011468253,0.009220693],"study_design_scores_gemma":[0.000008748113,0.0000076034066,0.000094486015,0.000015990869,0.0000047930766,0.0000110158,0.000015068519,0.9820609,0.00004690834,0.017357651,0.00037082875,0.0000060642305],"about_ca_topic_score_codex":0.028122254,"about_ca_topic_score_gemma":0.019708015,"teacher_disagreement_score":0.028122254,"about_ca_system_score_codex":0.003655047,"about_ca_system_score_gemma":0.0047688927,"threshold_uncertainty_score":0.10749161},"labels":[],"label_agreement":null},{"id":"W4392763661","doi":"10.3390/app14062430","title":"Wiener Filter Using the Conjugate Gradient Method and a Third-Order Tensor Decomposition","year":2024,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Wiener filter; Conjugate gradient method; Robustness (evolution); Algorithm; Mathematical optimization; Mathematics; Tensor decomposition; Applied mathematics; Third order; Computer science; Tensor (intrinsic definition)","score_opus":0.07959954090645134,"score_gpt":0.3947157876944449,"score_spread":0.31511624678799355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392763661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019454573,0.00011305753,0.9972481,0.00003166134,0.00002830749,0.000013136189,0.000011023447,0.00010095547,0.000508287],"genre_scores_gemma":[0.11254498,0.00078799354,0.8814273,0.00006710982,0.00008437518,0.00012619529,0.00013941781,0.00013513495,0.0046874853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962604,0.00011566097,0.000025694413,0.000059647704,0.0001366565,0.000036208432],"domain_scores_gemma":[0.99962616,0.00014776965,0.000046015142,0.000047556936,0.000104645966,0.000027861726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000925873,0.0010539026,0.0008384866,0.00068982784,0.00032364993,0.0009149375,0.0006361342,0.001028519,0.001833134],"category_scores_gemma":[0.0016323406,0.0003196281,0.001145246,0.00081875664,0.00071001914,0.0012998235,0.0008396615,0.0011942851,0.00076887565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024399474,0.00011610398,0.0010052247,0.00041947362,0.00021087812,0.00026975863,0.00025310274,0.4470547,0.07402077,0.17926846,0.002849264,0.29428822],"study_design_scores_gemma":[0.000009714006,0.000049628794,0.0001226592,0.000010959301,0.000015038146,0.00007345608,0.00000965694,0.9824058,0.006897255,0.008094778,0.0022921492,0.000018907553],"about_ca_topic_score_codex":0.0028490885,"about_ca_topic_score_gemma":0.0023279474,"teacher_disagreement_score":0.0028490885,"about_ca_system_score_codex":0.000391843,"about_ca_system_score_gemma":0.0014808049,"threshold_uncertainty_score":0.0061324835},"labels":[],"label_agreement":null},{"id":"W4392979711","doi":"10.1109/jiot.2024.3378202","title":"Sparse Bayesian Tensor Completion for Data Recovery in Intelligent IoT Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Missing data; Bayesian probability; Artificial intelligence; Bayesian inference; Big data; Data mining; Machine learning; Data modeling; Domain knowledge; Database","score_opus":0.14068777719434333,"score_gpt":0.3738669681349511,"score_spread":0.2331791909406078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392979711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029423372,0.00046872886,0.99540085,0.00032923665,0.000042739928,0.000017785587,0.00010811094,0.00020633462,0.000483974],"genre_scores_gemma":[0.35371104,0.003283874,0.63292056,0.000495125,0.0004316811,0.0002453569,0.0019644864,0.0003784123,0.0065694423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884295,0.00045823713,0.000067600806,0.00022256238,0.0002895884,0.000118980766],"domain_scores_gemma":[0.9978504,0.0010866171,0.00027330188,0.00023533034,0.00042717837,0.00012715306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021916307,0.0015523155,0.0014099026,0.0009153983,0.0006040599,0.0009757483,0.0012547056,0.0012086199,0.0021758438],"category_scores_gemma":[0.006502695,0.000693308,0.001340277,0.0015491195,0.0014731705,0.0020504342,0.0014282587,0.0029666007,0.0008372092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017535267,0.00008683999,0.00094507897,0.0003732543,0.00012448404,0.00013562525,0.00016866415,0.81109226,0.004519107,0.058443412,0.00754339,0.11639256],"study_design_scores_gemma":[0.00000394421,0.000012398936,0.00008891056,0.000008511495,0.0000053585677,0.0000135048185,0.000008410231,0.9896025,0.00036863086,0.009210808,0.0006678825,0.000009188055],"about_ca_topic_score_codex":0.014236753,"about_ca_topic_score_gemma":0.009847652,"teacher_disagreement_score":0.014236753,"about_ca_system_score_codex":0.0012825546,"about_ca_system_score_gemma":0.0024687285,"threshold_uncertainty_score":0.028307736},"labels":[],"label_agreement":null},{"id":"W4394636026","doi":"10.4230/lipics.approx/random.2022.21","title":"Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Rank (graph theory); Undecidable problem; Tensor (intrinsic definition); Mathematics; Domain (mathematical analysis); Computational complexity theory; Conjecture; Polynomial; Time complexity; Matrix (chemical analysis); Symmetric tensor; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Decidability; Exact solutions in general relativity; Mathematical analysis","score_opus":0.06372568142230997,"score_gpt":0.33636613014081457,"score_spread":0.27264044871850457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394636026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7217737,0.0010445752,0.2587615,0.0042036646,0.00007501708,0.00017712306,0.0026426255,0.0023638154,0.008958091],"genre_scores_gemma":[0.9293728,0.00034655991,0.06313685,0.00066764076,0.00012911813,0.00013425622,0.0027275758,0.00012703697,0.003358098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989611,0.0001931407,0.000058710033,0.00038609374,0.00020388521,0.00019712953],"domain_scores_gemma":[0.99439234,0.004019915,0.0004286002,0.0006491264,0.00023660512,0.00027339146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009375138,0.00082395395,0.0014299346,0.00045989384,0.0006384818,0.0015011745,0.0018841119,0.0016118905,0.0053170095],"category_scores_gemma":[0.009285684,0.00052375894,0.0014353791,0.0008379723,0.0012622476,0.0045239306,0.0018999858,0.0027374001,0.0005364359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031490403,0.0006805281,0.015812729,0.00087972905,0.00028277,0.0011307391,0.0009749863,0.585628,0.012071666,0.13473481,0.018183095,0.22647192],"study_design_scores_gemma":[0.00022641013,0.00021119147,0.0013096585,0.000045246845,0.000074299955,0.00028903806,0.00015236001,0.7336169,0.0028201768,0.25904486,0.0021836273,0.00002623556],"about_ca_topic_score_codex":0.0027935824,"about_ca_topic_score_gemma":0.00418579,"teacher_disagreement_score":0.0053170095,"about_ca_system_score_codex":0.0016177593,"about_ca_system_score_gemma":0.001200025,"threshold_uncertainty_score":0.017787158},"labels":[],"label_agreement":null},{"id":"W4394910414","doi":"10.1109/mcse.2024.3368956","title":"Tensor Computations—Part I","year":2023,"lang":"en","type":"article","venue":"Computing in Science & Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Tensor (intrinsic definition); Computation; Physics; Mathematical physics; Computer science; Mathematics; Pure mathematics; Algorithm","score_opus":0.05264023556262729,"score_gpt":0.3402714258353571,"score_spread":0.28763119027272976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394910414","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017770603,0.0673954,0.49139994,0.0068060383,0.014183187,0.00022304684,0.0028168384,0.0014026964,0.3980022],"genre_scores_gemma":[0.37923214,0.073415406,0.19639729,0.005355747,0.023880858,0.0008948771,0.0067354226,0.00436187,0.30972642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989976,0.00020716118,0.000084826024,0.00027358608,0.00032669946,0.000110229055],"domain_scores_gemma":[0.9986314,0.00035292126,0.00012933259,0.0004021514,0.00037367476,0.00011053882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009408779,0.0021903806,0.0008176052,0.0023296047,0.0013820983,0.0033904794,0.0012320722,0.0011497264,0.026834829],"category_scores_gemma":[0.0032635413,0.0007585063,0.0016416447,0.003353836,0.0026486143,0.005570316,0.0025201808,0.0027170624,0.017877433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046780046,0.00009170346,0.0006052538,0.00060132775,0.00005252825,0.00010008994,0.0003186302,0.0030147755,0.0029723032,0.81021476,0.086240776,0.09574108],"study_design_scores_gemma":[0.00000654812,0.00007064576,0.0011665587,0.00020715171,0.000043020627,0.0004451021,0.00010618269,0.0059952675,0.0035274944,0.7932766,0.19511363,0.000041883417],"about_ca_topic_score_codex":0.0010199642,"about_ca_topic_score_gemma":0.0007050507,"teacher_disagreement_score":0.026834829,"about_ca_system_score_codex":0.0010184908,"about_ca_system_score_gemma":0.0009698531,"threshold_uncertainty_score":0.08977139},"labels":[],"label_agreement":null},{"id":"W4395005329","doi":"10.5539/apr.v16n1p190","title":"About a Solution of (∂^3 x^ν)/(∂x^μ ∂x^μ ∂x^μ )=M:\\{M=0,M&gt;0\\} in Tensor Satisfying Binary Law 2","year":2024,"lang":"en","type":"article","venue":"Applied Physics Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary number; Tensor (intrinsic definition); Mathematical physics; Physics; Materials science; Mathematics; Pure mathematics; Arithmetic","score_opus":0.15643054401318285,"score_gpt":0.4393992303372343,"score_spread":0.2829686863240515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395005329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25604266,0.004207741,0.45480746,0.060014136,0.009247067,0.0002750635,0.00095477246,0.0005182643,0.21393287],"genre_scores_gemma":[0.70373905,0.004349301,0.18826325,0.00819536,0.006020672,0.00021841905,0.0009143553,0.0006241745,0.08767545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950004,0.00015130865,0.00003620901,0.00011153044,0.00012624238,0.00007459725],"domain_scores_gemma":[0.9995091,0.00015479428,0.00007615191,0.00003026307,0.00012730782,0.000102403734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010759471,0.00076596567,0.00054894655,0.0011941339,0.0017125738,0.0017876398,0.0009451327,0.002857003,0.008968211],"category_scores_gemma":[0.002865823,0.0002543559,0.0013559957,0.0006401553,0.0032040118,0.0038478917,0.0017333752,0.003303832,0.0012962735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051738087,0.00003155413,0.00026207799,0.00023056133,0.000015344678,0.00033953,0.0007611351,0.0021543417,0.0041935216,0.9749195,0.010288627,0.0067520356],"study_design_scores_gemma":[0.00002225088,0.00005367192,0.0004021239,0.000060780218,0.0000135656255,0.00045897238,0.00038838584,0.011767372,0.0014915367,0.97475624,0.010551298,0.00003378431],"about_ca_topic_score_codex":0.0010013111,"about_ca_topic_score_gemma":0.0006105702,"teacher_disagreement_score":0.008968211,"about_ca_system_score_codex":0.0008311222,"about_ca_system_score_gemma":0.0009882174,"threshold_uncertainty_score":0.03000164},"labels":[],"label_agreement":null},{"id":"W4396910359","doi":"10.1007/978-3-031-54908-3_1","title":"Introduction","year":2024,"lang":"en","type":"book-chapter","venue":"Compact textbooks in mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Computer science","score_opus":0.06039587419689805,"score_gpt":0.3292959561955844,"score_spread":0.2689000819986863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396910359","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029666134,0.0026433093,0.0039178384,0.002055012,0.0037946948,0.00008346056,0.0014361731,0.0005458316,0.985227],"genre_scores_gemma":[0.001014506,0.001394179,0.0012001274,0.00080369215,0.00071697537,0.000049729522,0.0009910106,0.00020283578,0.99362695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945205,0.000056723737,0.000018881252,0.000111697314,0.00030386404,0.000056910023],"domain_scores_gemma":[0.9992624,0.0001043549,0.000030017374,0.0001035196,0.0003600699,0.00013956985],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052234955,0.00090420595,0.0006134201,0.001744076,0.0012647731,0.004275199,0.0015261895,0.0015409346,0.5636948],"category_scores_gemma":[0.0020675245,0.00032032482,0.00046797667,0.001635283,0.0006361515,0.0033632016,0.0022391255,0.0019075369,0.4750964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019364248,0.000036162175,0.00006850683,0.00017420945,0.0000020204236,0.000037412487,0.00013044935,0.00014233647,0.00035187718,0.055002812,0.7978432,0.14619161],"study_design_scores_gemma":[0.0000012285439,0.000004104142,0.00004639756,0.00005986029,7.0258415e-7,0.000021350806,0.00003161535,0.000021979513,0.00004993117,0.005555503,0.9942054,0.0000019085035],"about_ca_topic_score_codex":0.0016496638,"about_ca_topic_score_gemma":0.0031157192,"teacher_disagreement_score":0.5636948,"about_ca_system_score_codex":0.0012866306,"about_ca_system_score_gemma":0.0017593774,"threshold_uncertainty_score":0.62233645},"labels":[],"label_agreement":null},{"id":"W4398147710","doi":"10.1016/j.isatra.2024.05.023","title":"Quadrotors’ double-loop controller design with tensor product model transformation and partial fully actuated method","year":2024,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Transformation (genetics); Controller (irrigation); Model transformation; Tensor product; Fuzzy logic; Mathematics; Computer science; Control (management); Artificial intelligence","score_opus":0.08276827114933696,"score_gpt":0.3494632787812505,"score_spread":0.26669500763191356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398147710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069586416,0.00012978502,0.9893885,0.00004600416,0.0000651118,0.000028973287,0.000022428936,0.00021782026,0.003142742],"genre_scores_gemma":[0.84465665,0.00025895188,0.1498945,0.00007146145,0.00004174671,0.00018325685,0.00012654379,0.00007727002,0.004689586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998029,0.000037391335,0.00001261371,0.00005428777,0.00006962914,0.000023231403],"domain_scores_gemma":[0.9998368,0.000027235368,0.00003303229,0.000022863873,0.000067912064,0.000012143723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033178783,0.00077745266,0.0007106802,0.00023819944,0.00036229068,0.0006541443,0.000659537,0.00051744777,0.0023695165],"category_scores_gemma":[0.00038420473,0.00031114873,0.00048456056,0.00025569444,0.00033682483,0.0005545214,0.00059114664,0.0005725826,0.00056469813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002720607,0.00007751452,0.00050958944,0.0005094407,0.00013688554,0.00018402019,0.00016520557,0.72996444,0.07229993,0.029573983,0.0026748683,0.1636321],"study_design_scores_gemma":[0.000016080023,0.00017493285,0.00014867754,0.000009715725,0.000014683423,0.000041191914,0.000010590809,0.99093235,0.004659008,0.00148113,0.0025024302,0.000009135021],"about_ca_topic_score_codex":0.0017442394,"about_ca_topic_score_gemma":0.0020752726,"teacher_disagreement_score":0.0023695165,"about_ca_system_score_codex":0.00025726802,"about_ca_system_score_gemma":0.00053855125,"threshold_uncertainty_score":0.007926822},"labels":[],"label_agreement":null},{"id":"W4398229804","doi":"10.48550/arxiv.2405.12325","title":"A canonical polyadic tensor basis for fast Bayesian estimation of multi-subject fMRI activation patterns","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Bayesian probability; Basis (linear algebra); Computer science; Subject (documents); Artificial intelligence; Pattern recognition (psychology); Psychology; Cognitive psychology; Mathematics; Pure mathematics; Geometry","score_opus":0.10391420078392223,"score_gpt":0.2688453596700338,"score_spread":0.1649311588861116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398229804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010811448,0.00009060156,0.9982431,0.00008387758,0.000019073505,0.000026952133,0.00009522839,0.00020461644,0.00015541584],"genre_scores_gemma":[0.043034706,0.0005225275,0.95225614,0.0001262025,0.0000876296,0.00055194536,0.0010994487,0.00043308246,0.0018883595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849105,0.00091666746,0.000075811084,0.00021639305,0.00022373421,0.00007627346],"domain_scores_gemma":[0.9972561,0.0013613516,0.00022619852,0.0004971171,0.00052601413,0.00013312293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035055801,0.001310572,0.0010334881,0.001015492,0.00078558846,0.001287189,0.0016409727,0.0014257065,0.0042129327],"category_scores_gemma":[0.010799737,0.0009758557,0.001536888,0.0018597754,0.0009702033,0.001465288,0.0017250126,0.0030461561,0.0028172748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002339648,0.0001404127,0.0013378935,0.00035386978,0.0002603565,0.00021472336,0.00027842136,0.5434912,0.014235574,0.13806921,0.01636824,0.28501603],"study_design_scores_gemma":[0.000010317625,0.00002348893,0.00029112166,0.00001678411,0.0000126412615,0.000051840736,0.000012436616,0.9693582,0.0008350688,0.026249152,0.0031163204,0.000022624528],"about_ca_topic_score_codex":0.013306515,"about_ca_topic_score_gemma":0.017404377,"teacher_disagreement_score":0.013306515,"about_ca_system_score_codex":0.000986918,"about_ca_system_score_gemma":0.0034141026,"threshold_uncertainty_score":0.026458144},"labels":[],"label_agreement":null},{"id":"W4399068194","doi":"10.1007/jhep05(2024)299","title":"Improving the five-point bootstrap","year":2024,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Point (geometry); Statistics; Econometrics; Mathematics; Computer science; Geometry","score_opus":0.027771642728328823,"score_gpt":0.2907864636718424,"score_spread":0.2630148209435136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399068194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1348291,0.00024524212,0.84067893,0.00028523023,0.00012687348,0.00010068067,0.0001432344,0.0016676958,0.02192301],"genre_scores_gemma":[0.596803,0.00021622758,0.39585495,0.00020462139,0.00007434539,0.00025880485,0.00034654015,0.0008927307,0.005348689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993032,0.00021191024,0.000033958127,0.000048955273,0.00030726177,0.000094724775],"domain_scores_gemma":[0.99743026,0.0009259116,0.00012742162,0.00069864653,0.00067601516,0.00014179178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016261031,0.00048899825,0.0010010159,0.001384877,0.000817213,0.0011664396,0.0016998823,0.000880905,0.0055114585],"category_scores_gemma":[0.0077403085,0.00029605985,0.00074848044,0.0008957031,0.001060406,0.0015013096,0.0019229796,0.0010776555,0.0025901943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028702075,0.00020869028,0.004517813,0.00028016022,0.00007882106,0.0006105519,0.0004951528,0.32935318,0.013262001,0.5199124,0.0054518133,0.1255424],"study_design_scores_gemma":[0.000016340324,0.00001804932,0.00018290429,0.000019728774,0.0000057145244,0.000032909287,0.000024571877,0.9501339,0.0017588787,0.045744296,0.0020535742,0.000009171443],"about_ca_topic_score_codex":0.0022906133,"about_ca_topic_score_gemma":0.0021582823,"teacher_disagreement_score":0.0055114585,"about_ca_system_score_codex":0.0007711554,"about_ca_system_score_gemma":0.0010266682,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4399527102","doi":"10.1109/tcpmt.2024.3410298","title":"TC-GVF: Tensor Core GPU-Based Vector Fitting via Accelerated Tall-Skinny QR Solvers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Components Packaging and Manufacturing Technology","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational science; Tensor (intrinsic definition); Parallel computing; Computer science; Core (optical fiber); Computer graphics (images); CUDA; Mathematics; Geometry","score_opus":0.052529132840329756,"score_gpt":0.3024098454241697,"score_spread":0.24988071258383995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399527102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026041097,0.0001431033,0.9935628,0.0000871828,0.000052570464,0.00003590116,0.000074590964,0.0012590239,0.002180667],"genre_scores_gemma":[0.06706433,0.00027175745,0.92706203,0.00012546341,0.00004733632,0.00012865874,0.00046645346,0.000857453,0.003976471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996124,0.00009040395,0.000020706293,0.000052251184,0.00017928102,0.0000449287],"domain_scores_gemma":[0.99933976,0.00019831602,0.00006708129,0.000122045385,0.00021389584,0.000058973517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006492643,0.0010298045,0.0007647066,0.0005788446,0.0004392647,0.0009678648,0.0013892627,0.0010462466,0.007843044],"category_scores_gemma":[0.0026766863,0.0003655703,0.0006574813,0.0008281742,0.0005506507,0.0012184741,0.0014043334,0.0014176273,0.0028661462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022018104,0.00012304903,0.0016838654,0.00041065426,0.00012041189,0.0004281865,0.0003847753,0.4960322,0.03156399,0.10250333,0.030356834,0.3361725],"study_design_scores_gemma":[0.00001569483,0.000019560044,0.00005144655,0.0000106769385,0.000004272419,0.000061026505,0.000017972741,0.9866757,0.002720579,0.0049418323,0.0054709837,0.000010264846],"about_ca_topic_score_codex":0.0052834083,"about_ca_topic_score_gemma":0.008433999,"teacher_disagreement_score":0.007843044,"about_ca_system_score_codex":0.0005036374,"about_ca_system_score_gemma":0.0018029982,"threshold_uncertainty_score":0.026237607},"labels":[],"label_agreement":null},{"id":"W4400193754","doi":"10.1016/j.patcog.2024.110735","title":"Poisson tensor completion with transformed correlated total variation regularization","year":2024,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sichuan Province Science and Technology Support Program; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Regularization (linguistics); Poisson distribution; Variation (astronomy); Tensor (intrinsic definition); Total variation denoising; Applied mathematics; Algorithm; Statistics; Computer science; Artificial intelligence; Pure mathematics; Physics; Image (mathematics)","score_opus":0.039902147148397,"score_gpt":0.28265462941553154,"score_spread":0.24275248226713453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400193754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032086747,0.000102132,0.99507964,0.00016149807,0.000077035875,0.000021858868,0.00007715639,0.00022892142,0.001043073],"genre_scores_gemma":[0.15891911,0.0008130091,0.8218792,0.00037101153,0.00038793302,0.00017947346,0.00079051475,0.0010349879,0.015624862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998459,0.00063098455,0.00007655362,0.00026472338,0.0004690278,0.000099699435],"domain_scores_gemma":[0.9970599,0.0006458252,0.00034326874,0.00084147335,0.0008470991,0.00026242732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024287389,0.0013113987,0.0013137889,0.0017177517,0.000564707,0.0022534763,0.0018536511,0.0014591898,0.0037726003],"category_scores_gemma":[0.0063597276,0.00082775374,0.0014796589,0.0016148861,0.001842384,0.002430293,0.0027903868,0.0029323408,0.0018890153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016367526,0.00012392772,0.00061702426,0.00023320543,0.0001643209,0.00017166046,0.00018654975,0.15302676,0.011927468,0.6684183,0.016174426,0.14879283],"study_design_scores_gemma":[0.000011231929,0.00003582688,0.00016793955,0.000016789703,0.00002071866,0.00010862492,0.000026097989,0.83255774,0.0032149255,0.15786517,0.005945149,0.000029722692],"about_ca_topic_score_codex":0.0032021042,"about_ca_topic_score_gemma":0.0032171078,"teacher_disagreement_score":0.0037726003,"about_ca_system_score_codex":0.0007981582,"about_ca_system_score_gemma":0.0019603642,"threshold_uncertainty_score":0.0128445625},"labels":[],"label_agreement":null},{"id":"W4400411415","doi":"10.1109/tbc.2024.3417342","title":"Multimedia Classification via Tensor Linear Discriminant Analysis","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Linear discriminant analysis; Tensor (intrinsic definition); Computer science; Discriminant; Pattern recognition (psychology); Artificial intelligence; Speech recognition; Mathematics","score_opus":0.08644760922550569,"score_gpt":0.35410896379214324,"score_spread":0.26766135456663753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400411415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011601309,0.0007544776,0.98410934,0.0003412083,0.00011712135,0.00007218632,0.00021939175,0.0010071002,0.0017778836],"genre_scores_gemma":[0.3742642,0.0022264854,0.61272347,0.0002607219,0.00046759748,0.00028243152,0.0015334073,0.00019469838,0.008046926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991793,0.00018996418,0.00005571047,0.00017476405,0.00030261153,0.00009750357],"domain_scores_gemma":[0.9991142,0.00020926805,0.00012655376,0.0001347781,0.00036171553,0.00005344028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008287537,0.0008954855,0.0008376657,0.002701635,0.0005210966,0.0013868965,0.00078008906,0.00058819435,0.0022334834],"category_scores_gemma":[0.0029891988,0.00025890215,0.0011316199,0.0026286733,0.0005261169,0.0015992527,0.0009853434,0.0011339594,0.0017282013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002024894,0.00010389004,0.0022606645,0.00016318126,0.00010193534,0.000117296084,0.00010884809,0.078304015,0.017030168,0.017631738,0.011257891,0.8727179],"study_design_scores_gemma":[0.000007904129,0.000032383883,0.00074539497,0.000013134153,0.000019574776,0.00005849592,0.000042440246,0.98235804,0.0033179852,0.009966242,0.0034167878,0.000021591888],"about_ca_topic_score_codex":0.004905869,"about_ca_topic_score_gemma":0.004160892,"teacher_disagreement_score":0.004905869,"about_ca_system_score_codex":0.0007909001,"about_ca_system_score_gemma":0.0007947054,"threshold_uncertainty_score":0.009754658},"labels":[],"label_agreement":null},{"id":"W4400693123","doi":"10.1137/23m1599355","title":"Memory Capacity of Two Layer Neural Networks with Smooth Activations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Mathematics of Data Science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Layer (electronics); Computer science; Artificial neural network; Neuroscience; Psychology; Artificial intelligence; Materials science; Nanotechnology","score_opus":0.14205692219987792,"score_gpt":0.38760655590766235,"score_spread":0.24554963370778443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400693123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8008991,0.0019640336,0.17570637,0.002857126,0.0002495917,0.000038106147,0.00088959746,0.00085757364,0.016538598],"genre_scores_gemma":[0.99272025,0.000237016,0.0035248492,0.00010260762,0.000048884576,0.000027020813,0.00015349704,0.0000408592,0.003145198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997372,0.00006127908,0.000019251946,0.000054342625,0.000034528275,0.00009334352],"domain_scores_gemma":[0.9956346,0.0033023183,0.00022435213,0.00035700548,0.000324532,0.00015726183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009753067,0.000568337,0.00085365435,0.00050949486,0.00033177325,0.0014961546,0.0017185115,0.001344199,0.0060475306],"category_scores_gemma":[0.00884802,0.00042818315,0.00032002782,0.00051526347,0.00094762084,0.0036578716,0.0016428682,0.00092943455,0.0004244128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024840957,0.00029630263,0.0024284918,0.0006882715,0.00022699057,0.00047334962,0.00034456447,0.6713626,0.025999522,0.20359339,0.006834336,0.08526816],"study_design_scores_gemma":[0.000029148352,0.00004727618,0.0004318501,0.000019498895,0.000025259593,0.000033569806,0.000020845457,0.9369912,0.0027130337,0.059486076,0.00018686237,0.000015314465],"about_ca_topic_score_codex":0.003237409,"about_ca_topic_score_gemma":0.0016336294,"teacher_disagreement_score":0.0060475306,"about_ca_system_score_codex":0.000634731,"about_ca_system_score_gemma":0.0007652744,"threshold_uncertainty_score":0.020230949},"labels":[],"label_agreement":null},{"id":"W4400887522","doi":"10.1063/5.0219434","title":"Using nested tensor train contracted basis functions with group theoretical techniques to compute (ro)-vibrational spectra of molecules with non-Abelian groups","year":2024,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Reims Champagne-Ardenne; Université Paris-Saclay; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Hamiltonian (control theory); Tensor (intrinsic definition); Eigenvalues and eigenvectors; Symmetry (geometry); Basis (linear algebra); Molecule; Symmetry group; Computational chemistry; Physics; Molecular physics; Chemistry; Quantum mechanics; Mathematics; Pure mathematics; Geometry","score_opus":0.02180364736805859,"score_gpt":0.28778773388979884,"score_spread":0.26598408652174027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400887522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26437837,0.00008353865,0.7289062,0.00011936031,0.00005448519,0.000076695425,0.00012709995,0.0010812262,0.005172905],"genre_scores_gemma":[0.6098712,0.000079882295,0.38646954,0.00008203489,0.000017885108,0.00017263218,0.00042029764,0.00044316016,0.002443481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997992,0.00006129247,0.000008300977,0.000016023703,0.00008320653,0.000032023894],"domain_scores_gemma":[0.9994361,0.00020510906,0.000052298496,0.0001353106,0.000118068754,0.0000530639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063406985,0.00055301265,0.0003670802,0.00068994553,0.00043845584,0.00045077942,0.0009773606,0.0005246111,0.0027936168],"category_scores_gemma":[0.0015629579,0.00022463086,0.00045442916,0.00058826886,0.000620979,0.0008313642,0.00073900016,0.0007798839,0.0005232318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022839944,0.0002641175,0.0022698692,0.00019324059,0.00007352851,0.00026652732,0.00038316447,0.7985694,0.046901207,0.0621699,0.0012997831,0.08738083],"study_design_scores_gemma":[0.000010005951,0.000025879115,0.00014131842,0.000003986147,0.000003129085,0.000015053277,0.000021066215,0.9894573,0.0048528807,0.0049852678,0.00047779604,0.0000064492833],"about_ca_topic_score_codex":0.0020556287,"about_ca_topic_score_gemma":0.002760673,"teacher_disagreement_score":0.0027936168,"about_ca_system_score_codex":0.00031028906,"about_ca_system_score_gemma":0.00088708324,"threshold_uncertainty_score":0.009345531},"labels":[],"label_agreement":null},{"id":"W4401163230","doi":"10.1109/tits.2024.3430039","title":"Convolutional Low-Rank Tensor Representation for Structural Missing Traffic Data Imputation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Imputation (statistics); Representation (politics); Computer science; Missing data; Convolutional neural network; Tensor (intrinsic definition); Rank (graph theory); Artificial intelligence; Data mining; Pattern recognition (psychology); Natural language processing; Mathematics; Machine learning; Combinatorics; Pure mathematics","score_opus":0.11187706007114423,"score_gpt":0.3801490533734013,"score_spread":0.2682719933022571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401163230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050787977,0.00017397678,0.9936155,0.00016715999,0.000036769416,0.0000170084,0.00016991647,0.00043293054,0.00030779457],"genre_scores_gemma":[0.34931874,0.0012089249,0.6393774,0.00039151256,0.00025411844,0.00028690998,0.003514914,0.00039994728,0.005247483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899787,0.00032106944,0.000066335066,0.0002484487,0.0002223635,0.00014397685],"domain_scores_gemma":[0.99705315,0.0011786019,0.00042114613,0.0004690079,0.000702911,0.00017519797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020786645,0.001816082,0.0014730204,0.00097375707,0.0005802944,0.0012459417,0.0019123508,0.0014385997,0.002036423],"category_scores_gemma":[0.0073861056,0.0007849617,0.0015493761,0.0015770992,0.0011998381,0.0023967125,0.0014676829,0.0033190427,0.0010107418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022357747,0.000102964725,0.0019107234,0.0003261476,0.00013802598,0.00023553983,0.00015297854,0.822182,0.0059895087,0.03407134,0.007795543,0.12687165],"study_design_scores_gemma":[0.0000035430346,0.000015958634,0.000095403244,0.0000069373746,0.0000063866105,0.000019316816,0.000006881281,0.9927591,0.0006875837,0.005835389,0.0005536824,0.000009782623],"about_ca_topic_score_codex":0.008886685,"about_ca_topic_score_gemma":0.0086599365,"teacher_disagreement_score":0.008886685,"about_ca_system_score_codex":0.0010769181,"about_ca_system_score_gemma":0.0025137772,"threshold_uncertainty_score":0.017669916},"labels":[],"label_agreement":null},{"id":"W4401287998","doi":"10.1515/math-2024-0031","title":"Matrix stretching","year":2024,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Tensor product; Injective function; Tensor (intrinsic definition); Pure mathematics; Matrix (chemical analysis); Symmetry (geometry); Product (mathematics); Algebraic number; Tensor product of Hilbert spaces; Algebra over a field; Tensor product of algebras; Tensor contraction; Mathematical analysis; Geometry; Materials science","score_opus":0.08468956082795183,"score_gpt":0.42957890255156006,"score_spread":0.34488934172360824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401287998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18079312,0.002198944,0.7116011,0.0012443481,0.0023872226,0.00019841598,0.0006438577,0.001141078,0.099791996],"genre_scores_gemma":[0.8375036,0.0017879284,0.11106855,0.00071866857,0.0014638358,0.00016671032,0.00056988344,0.00053205603,0.046188746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.000101450394,0.000028524666,0.00020006443,0.00019276796,0.00007838447],"domain_scores_gemma":[0.99885714,0.00021056172,0.00017722858,0.00034328,0.00027708002,0.00013474561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063096225,0.0008113724,0.00043020284,0.0009658911,0.0007041832,0.0013229664,0.0006010472,0.0005604209,0.012301579],"category_scores_gemma":[0.0023004704,0.00024021215,0.00057154987,0.0006154959,0.0017677685,0.0029730035,0.0014656041,0.0010588539,0.0018182652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091192764,0.00003794316,0.00040002936,0.00015280014,0.000024980074,0.00029174172,0.00028977077,0.010691108,0.022498908,0.9160158,0.004373929,0.04513179],"study_design_scores_gemma":[0.00002633179,0.00024341629,0.0014334591,0.00006573653,0.00003610735,0.0011090143,0.00029797506,0.09078018,0.027644604,0.8176373,0.060645506,0.00008041245],"about_ca_topic_score_codex":0.0004196611,"about_ca_topic_score_gemma":0.00022504997,"teacher_disagreement_score":0.012301579,"about_ca_system_score_codex":0.0004357616,"about_ca_system_score_gemma":0.00038956729,"threshold_uncertainty_score":0.041152954},"labels":[],"label_agreement":null},{"id":"W4401499346","doi":"10.3389/fninf.2024.1399391","title":"A canonical polyadic tensor basis for fast Bayesian estimation of multi-subject brain activation patterns","year":2024,"lang":"en","type":"article","venue":"Frontiers in Neuroinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tensor (intrinsic definition); Human Connectome Project; Functional magnetic resonance imaging; Bayesian probability; Canonical correlation; Artificial intelligence; Population; Scalar (mathematics); Curse of dimensionality; Bayes estimator; Pattern recognition (psychology); Working memory; Basis function; Machine learning; Mathematics; Cognition; Psychology; Neuroscience","score_opus":0.02836119733561122,"score_gpt":0.313061369486997,"score_spread":0.28470017215138577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401499346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012690056,0.000101824466,0.9979867,0.00008802572,0.000019411944,0.00003316929,0.00011034195,0.00023761598,0.00015394535],"genre_scores_gemma":[0.046720285,0.00058672467,0.948262,0.00013948292,0.000083821345,0.00064216135,0.0013122943,0.00044307928,0.0018100924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842227,0.0009481993,0.000083893596,0.0002201462,0.00023839966,0.00008703826],"domain_scores_gemma":[0.99696726,0.0015276888,0.00024194266,0.00051368144,0.0006022885,0.00014709296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038298373,0.0013668909,0.0011518153,0.0010213645,0.0008039158,0.0013370062,0.0017009419,0.0014570277,0.0042397245],"category_scores_gemma":[0.011267008,0.0009518416,0.0016851567,0.001891087,0.0009068123,0.0014048925,0.0017181729,0.0031757138,0.0029354584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027778742,0.00015019297,0.0015486479,0.00043261325,0.000301765,0.00023754982,0.00033191268,0.54135776,0.014525898,0.107594885,0.015268163,0.31797284],"study_design_scores_gemma":[0.000012063293,0.000028419217,0.0003561283,0.000020304566,0.000015510506,0.00006320997,0.00001571984,0.97354364,0.00088020245,0.021972585,0.0030666422,0.000025510779],"about_ca_topic_score_codex":0.014198205,"about_ca_topic_score_gemma":0.018870981,"teacher_disagreement_score":0.014198205,"about_ca_system_score_codex":0.0009722062,"about_ca_system_score_gemma":0.0037244165,"threshold_uncertainty_score":0.028231144},"labels":[],"label_agreement":null},{"id":"W4401626153","doi":"10.20944/preprints202408.0929.v1","title":"The BiCG Algorithm for Solving the Minimal Frobenius Norm Solution of Generalized Sylvester Tensor Equation over the Quaternions","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quaternion; Matrix norm; Sylvester equation; Mathematics; Tensor (intrinsic definition); Convergence (economics); Norm (philosophy); Algorithm; Sylvester matrix; Applied mathematics; Exact solutions in general relativity; Mathematical optimization; Algebra over a field; Mathematical analysis; Pure mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.19152233562894075,"score_gpt":0.39329379332824477,"score_spread":0.20177145769930402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401626153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016754152,0.00010824135,0.9967907,0.00007863409,0.000027519261,0.000025941456,0.000017478316,0.00013641985,0.0011395931],"genre_scores_gemma":[0.036635898,0.00022396925,0.960397,0.00007287733,0.000032222197,0.0001297724,0.0001111166,0.00013499071,0.002262153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997248,0.00007622437,0.000014960937,0.000047282407,0.000108399196,0.00002819468],"domain_scores_gemma":[0.9996805,0.000112136906,0.000028950097,0.000048245678,0.00010778981,0.000022466169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077528344,0.0008513493,0.0006349307,0.00081384415,0.00043242183,0.0006165507,0.0008628519,0.0009278636,0.002825583],"category_scores_gemma":[0.0016971478,0.00030492563,0.00045254658,0.0007408949,0.00089035236,0.000783023,0.0008978645,0.0013639436,0.0013227849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001315493,0.00006443439,0.0006553681,0.00038242963,0.000058878486,0.00019325709,0.00036333135,0.33380345,0.026531275,0.29663748,0.010054735,0.3311239],"study_design_scores_gemma":[0.000022630877,0.000045804696,0.000114064605,0.0000301217,0.00000867323,0.000108016546,0.000038801827,0.93181485,0.0056878584,0.051824577,0.010282319,0.000022330369],"about_ca_topic_score_codex":0.0028194592,"about_ca_topic_score_gemma":0.004607188,"teacher_disagreement_score":0.002825583,"about_ca_system_score_codex":0.00060550036,"about_ca_system_score_gemma":0.001516347,"threshold_uncertainty_score":0.009452522},"labels":[],"label_agreement":null},{"id":"W4401758534","doi":"10.1016/j.laa.2024.08.013","title":"The determinant of {±1}-matrices and oriented hypergraphs","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017830019581672664,"score_gpt":0.30795868979055235,"score_spread":0.29012867020887967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401758534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44374022,0.003997062,0.3900333,0.0046412405,0.00232367,0.000085067586,0.00061598315,0.0006485249,0.15391496],"genre_scores_gemma":[0.9122024,0.0022732033,0.0397403,0.001139849,0.0014742669,0.000080523685,0.00035455922,0.00043648478,0.042298436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916077,0.0002721437,0.000040588657,0.00018052681,0.00021290821,0.00013297166],"domain_scores_gemma":[0.99720734,0.0010427475,0.00055451907,0.00020294619,0.0005175009,0.00047491226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012214727,0.00118274,0.0009451871,0.0033564842,0.0015138462,0.0036894528,0.0014479217,0.0015477741,0.0085901385],"category_scores_gemma":[0.003200566,0.00077459635,0.00072318746,0.0027742803,0.0038897772,0.004725334,0.0014388402,0.002138663,0.001365201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015140575,0.000021124564,0.00008983956,0.000021304219,0.000004850048,0.000037336158,0.00016216109,0.0007288596,0.0005893368,0.99405044,0.0011072481,0.003172381],"study_design_scores_gemma":[0.000004490631,0.000008005163,0.00011342882,0.0000124932985,0.000003858049,0.000061882034,0.00006195201,0.00569909,0.00029036918,0.992136,0.0015918196,0.000016547492],"about_ca_topic_score_codex":0.0017692492,"about_ca_topic_score_gemma":0.001992361,"teacher_disagreement_score":0.0085901385,"about_ca_system_score_codex":0.0011505679,"about_ca_system_score_gemma":0.0008524732,"threshold_uncertainty_score":0.02873683},"labels":[],"label_agreement":null},{"id":"W4402014004","doi":"10.1007/978-3-031-70362-1_15","title":"Graphical Model-Based Lasso for Weakly Dependent Time Series of Tensors","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Series (stratigraphy); Lasso (programming language); Graphical model; Algorithm; Time series; Artificial intelligence; Theoretical computer science; Applied mathematics; Machine learning; Mathematics; Programming language; Geology","score_opus":0.02534541485026531,"score_gpt":0.28632744140858646,"score_spread":0.26098202655832115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402014004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001510586,0.00022258355,0.99718285,0.00016458411,0.00005992189,0.000014495581,0.00012875344,0.00035244224,0.00036383932],"genre_scores_gemma":[0.20043756,0.0020467138,0.7763626,0.0008280244,0.0011633699,0.000664529,0.0037314154,0.001833237,0.012932546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731463,0.001525603,0.00011020057,0.00052291685,0.00033832944,0.00018823822],"domain_scores_gemma":[0.99275726,0.00510744,0.00057692616,0.0007569194,0.00053483486,0.0002666991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039346707,0.002631938,0.0027355005,0.00094898464,0.00064808753,0.002110507,0.0026729424,0.0021198662,0.00457823],"category_scores_gemma":[0.011035058,0.0012597243,0.0027784482,0.0016562035,0.0017790503,0.00217582,0.002438502,0.0052368566,0.0020635563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002666654,0.00018033409,0.00082071807,0.0005042684,0.0004159885,0.00017422663,0.00016853737,0.70301753,0.0063089845,0.11935774,0.016135946,0.15264897],"study_design_scores_gemma":[0.000008196868,0.000021836187,0.000074018826,0.000013784105,0.000018520472,0.000022594799,0.00000720305,0.9669301,0.00030529316,0.031781152,0.0008049262,0.000012409735],"about_ca_topic_score_codex":0.0024851405,"about_ca_topic_score_gemma":0.003635831,"teacher_disagreement_score":0.00457823,"about_ca_system_score_codex":0.00091995194,"about_ca_system_score_gemma":0.0014592778,"threshold_uncertainty_score":0.020808756},"labels":[],"label_agreement":null},{"id":"W4402313870","doi":"10.3390/sym16091167","title":"The BiCG Algorithm for Solving the Minimal Frobenius Norm Solution of Generalized Sylvester Tensor Equation over the Quaternions","year":2024,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Matrix norm; Quaternion; Sylvester equation; Tensor (intrinsic definition); Mathematics; Norm (philosophy); Convergence (economics); Sylvester matrix; Algorithm; Exact solutions in general relativity; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis; Pure mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.05211534162158197,"score_gpt":0.3339578734230112,"score_spread":0.2818425318014292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402313870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018882855,0.00009715667,0.9964954,0.000076177086,0.000026953076,0.000027601722,0.0000175161,0.00015087711,0.0012200079],"genre_scores_gemma":[0.039550595,0.00018714409,0.9576617,0.00006892884,0.000027423961,0.0001288517,0.000103650746,0.00012702607,0.0021446806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997391,0.00007020397,0.000013939262,0.000043692024,0.00010510539,0.000027982154],"domain_scores_gemma":[0.9996985,0.000102244354,0.000027497237,0.000045268054,0.000104602055,0.000021842572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077344384,0.00083086727,0.0006392164,0.0007817224,0.00043743823,0.0005711069,0.0008575611,0.00089919963,0.0028611054],"category_scores_gemma":[0.0015441851,0.0003039745,0.00046153372,0.0007106866,0.000872129,0.0007568514,0.0008631414,0.001304672,0.0013074552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013786658,0.000070025104,0.000693568,0.00035896903,0.00005926433,0.00020408156,0.0003599484,0.3444718,0.02816826,0.2801227,0.010166097,0.33518738],"study_design_scores_gemma":[0.000023582415,0.00004395812,0.000106149775,0.000024892062,0.000007939972,0.00010192808,0.000036849462,0.94465446,0.005515104,0.041095566,0.0083679445,0.00002173262],"about_ca_topic_score_codex":0.0029125079,"about_ca_topic_score_gemma":0.00461494,"teacher_disagreement_score":0.0029125079,"about_ca_system_score_codex":0.00058606535,"about_ca_system_score_gemma":0.0016148539,"threshold_uncertainty_score":0.009571373},"labels":[],"label_agreement":null},{"id":"W4402616002","doi":"10.1017/s0963548324000233","title":"A new formula for the determinant and bounds on its tensor and Waring ranks","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Mathematics; Mathematical economics; Algebra over a field; Pure mathematics; Statistics","score_opus":0.08689395350699279,"score_gpt":0.34970296613357243,"score_spread":0.26280901262657963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402616002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.164081,0.0026107503,0.65663624,0.0032398067,0.001088798,0.00012085463,0.0006862728,0.0016101301,0.16992617],"genre_scores_gemma":[0.86647797,0.0017086107,0.1005818,0.00060435984,0.0012139337,0.00014876986,0.00040961162,0.0010418374,0.02781316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785763,0.00026932027,0.00013788698,0.00035898073,0.0009129632,0.000463218],"domain_scores_gemma":[0.9956801,0.0017674677,0.00029303087,0.0010021467,0.00080548454,0.0004517956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053983,0.00097469875,0.00094691233,0.003296642,0.0017415008,0.00345175,0.0016452358,0.0010181046,0.015655028],"category_scores_gemma":[0.008934589,0.000585351,0.0009984301,0.0020367962,0.004132239,0.01029038,0.0033046203,0.004366323,0.0034965053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000419628,0.000036476904,0.0004155376,0.00006651258,0.0000057763905,0.000112685775,0.00017847487,0.00309295,0.0025737197,0.9739596,0.004320081,0.015196218],"study_design_scores_gemma":[0.000012238399,0.000050101353,0.0005062462,0.000050175277,0.000019390782,0.00029141025,0.00010130505,0.050415795,0.0057268646,0.92791814,0.014840594,0.00006787096],"about_ca_topic_score_codex":0.0013912434,"about_ca_topic_score_gemma":0.0016253553,"teacher_disagreement_score":0.015655028,"about_ca_system_score_codex":0.0017765404,"about_ca_system_score_gemma":0.0009868748,"threshold_uncertainty_score":0.052371323},"labels":[],"label_agreement":null},{"id":"W4402978094","doi":"10.1109/tcbb.2024.3471930","title":"MG-TCCA: Tensor Canonical Correlation Analysis Across Multiple Groups","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Biology and Bioinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute on Aging; Canadian Institutes of Health Research; GE Healthcare; Genentech; IXICO; U.S. National Library of Medicine; H. Lundbeck A/S; Pfizer; Novartis Pharmaceuticals Corporation; Biogen; Alzheimer's Drug Discovery Foundation; Merck; Takeda Pharmaceutical Company; Eli Lilly and Company; Servier","keywords":"Canonical correlation; Correlation; Tensor (intrinsic definition); Canonical analysis; Canonical correspondence analysis; Mathematics; Statistics; Geology; Pure mathematics; Paleontology","score_opus":0.029186359324651,"score_gpt":0.33807272609567635,"score_spread":0.3088863667710253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402978094","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018018074,0.0004997719,0.9751864,0.00044241463,0.00022772531,0.00028854818,0.00106704,0.0027083328,0.0015616257],"genre_scores_gemma":[0.2388814,0.00089912233,0.7485185,0.0004892753,0.00037356294,0.0010969808,0.0045413533,0.0012675814,0.003932212],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747914,0.0011899665,0.00014832855,0.0005279208,0.000463363,0.00019132892],"domain_scores_gemma":[0.99255764,0.0022675253,0.0008189419,0.0021137989,0.0017575842,0.00048453378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041872696,0.002577983,0.001639112,0.002904548,0.0015481808,0.0022082638,0.0017545318,0.0011010262,0.005707536],"category_scores_gemma":[0.016520094,0.00062799855,0.0036312994,0.003757771,0.0014756023,0.0019529168,0.0028672635,0.0025978845,0.00247923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008687708,0.0004896453,0.02618842,0.0008680032,0.002319656,0.001024232,0.0017750353,0.18274613,0.0204878,0.10452724,0.06673083,0.59197426],"study_design_scores_gemma":[0.000070010356,0.00025558486,0.004825132,0.00007861715,0.0002276191,0.00039408947,0.0002357378,0.9134427,0.00391917,0.06088766,0.015530092,0.00013365604],"about_ca_topic_score_codex":0.013714733,"about_ca_topic_score_gemma":0.018611182,"teacher_disagreement_score":0.013714733,"about_ca_system_score_codex":0.00076287636,"about_ca_system_score_gemma":0.0050728624,"threshold_uncertainty_score":0.02726978},"labels":[],"label_agreement":null},{"id":"W4403075406","doi":"10.1016/j.ifacol.2024.08.498","title":"Tensor Train Discrete Grid-Based Filters: Breaking the Curse of Dimensionality","year":2024,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Curse of dimensionality; Curse; Tensor (intrinsic definition); Grid; Computer science; Algorithm; Artificial intelligence; Mathematics; Geometry; Sociology","score_opus":0.054077765865036084,"score_gpt":0.3672022558879268,"score_spread":0.3131244900228907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403075406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069177295,0.00010201038,0.99110913,0.00014258745,0.000045333018,0.000011476727,0.00004874779,0.0004085092,0.0012144306],"genre_scores_gemma":[0.20961516,0.0005478474,0.7845993,0.00016916418,0.00009506271,0.00006905829,0.00025882674,0.0003330191,0.00431251],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963343,0.000111119996,0.000022725308,0.00005595244,0.00013034442,0.00004640762],"domain_scores_gemma":[0.99844944,0.0006120442,0.00012941165,0.0005039709,0.0002301567,0.00007498077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009986764,0.00055542437,0.0006037782,0.00041302305,0.0004396782,0.0012175164,0.0006523125,0.0006662428,0.003056324],"category_scores_gemma":[0.005157186,0.0002814721,0.0003842241,0.0008013212,0.0008644674,0.0017251504,0.00088849594,0.0011256406,0.0010472948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046254048,0.00008460761,0.0019296283,0.00017549236,0.00009201743,0.00011008908,0.00025036128,0.35260212,0.014842979,0.21805021,0.0072975806,0.40410239],"study_design_scores_gemma":[0.000014945167,0.00004174298,0.00022924862,0.000011176175,0.0000080370255,0.00003353628,0.00002108342,0.96683806,0.0039952835,0.024136137,0.0046597337,0.000011119467],"about_ca_topic_score_codex":0.007923287,"about_ca_topic_score_gemma":0.008633972,"teacher_disagreement_score":0.007923287,"about_ca_system_score_codex":0.0004927198,"about_ca_system_score_gemma":0.0009895567,"threshold_uncertainty_score":0.015754342},"labels":[],"label_agreement":null},{"id":"W4403789673","doi":"10.5539/apr.v16n2p99","title":"Property of Tensor Satisfying Binary Law 5","year":2024,"lang":"en","type":"article","venue":"Applied Physics Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary number; Tensor (intrinsic definition); Property (philosophy); Law; Computer science; Mathematics; Geometry; Arithmetic; Philosophy; Political science","score_opus":0.22480062107934265,"score_gpt":0.4476800263704843,"score_spread":0.22287940529114167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403789673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38740194,0.0016372876,0.31189337,0.0046136347,0.0017743697,0.0002177893,0.0010370166,0.0006907094,0.29073393],"genre_scores_gemma":[0.94086283,0.0005152246,0.03769771,0.00078409666,0.00073257723,0.000087857516,0.000670271,0.00015213939,0.018497251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787545,0.00034253157,0.00019628099,0.00060365646,0.0005899658,0.0003920788],"domain_scores_gemma":[0.99673283,0.0006604438,0.0004999744,0.00051392853,0.0011890783,0.00040378104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017279563,0.00046925282,0.0005017292,0.0018892202,0.001710738,0.0020695315,0.000629275,0.0007365858,0.010771217],"category_scores_gemma":[0.003567255,0.00029858405,0.0011194854,0.00065721566,0.004961918,0.0050877985,0.0023685903,0.0019841574,0.0015362129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031422085,0.000019327375,0.00068732334,0.000057273257,0.0000060982734,0.00013282339,0.0002844371,0.000118358505,0.0034224696,0.98823905,0.0019038052,0.005097702],"study_design_scores_gemma":[0.000020102778,0.00014868978,0.0022677775,0.00002477525,0.000013824476,0.00080900855,0.00024754243,0.0027828508,0.0064955684,0.96695274,0.020195356,0.000041846433],"about_ca_topic_score_codex":0.0008063856,"about_ca_topic_score_gemma":0.000480319,"teacher_disagreement_score":0.010771217,"about_ca_system_score_codex":0.0009485146,"about_ca_system_score_gemma":0.000645521,"threshold_uncertainty_score":0.036033332},"labels":[],"label_agreement":null},{"id":"W4404569111","doi":"10.48550/arxiv.2411.09816","title":"Learning Fine-grained Parameter Sharing via Sparse Tensor Decomposition","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Alberta Innovates","keywords":"Tensor (intrinsic definition); Computer science; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.11095075603748983,"score_gpt":0.2582313782133282,"score_spread":0.14728062217583837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404569111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057327617,0.0006612767,0.9270552,0.00049038354,0.00015099309,0.00007444792,0.00065130583,0.009801518,0.0037873564],"genre_scores_gemma":[0.63405895,0.0006188705,0.354787,0.0003628526,0.00011916879,0.00018774434,0.0027875649,0.00095468457,0.006123156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993912,0.00012093831,0.000036796828,0.00015051992,0.00021421244,0.000086348904],"domain_scores_gemma":[0.9990374,0.000216586,0.000090622736,0.0004313304,0.00016804505,0.000056093733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076043326,0.001720096,0.00078856334,0.00069569773,0.00039858642,0.0010601641,0.0014574877,0.0008520449,0.0030882205],"category_scores_gemma":[0.0039899126,0.00048539197,0.0006116871,0.0008655257,0.0008296374,0.00352102,0.0016521888,0.0020752994,0.0016735874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004085345,0.00019603457,0.0016426331,0.00015953433,0.00012412241,0.00021275779,0.00016151142,0.4555891,0.038549956,0.018310921,0.0145848,0.4700601],"study_design_scores_gemma":[0.000013653141,0.000045359073,0.0001278451,0.000007189295,0.000011097512,0.00002869138,0.000021464744,0.98025346,0.008777649,0.008788731,0.0019140946,0.000010859167],"about_ca_topic_score_codex":0.0061736507,"about_ca_topic_score_gemma":0.01226782,"teacher_disagreement_score":0.0061736507,"about_ca_system_score_codex":0.0008500163,"about_ca_system_score_gemma":0.0014971487,"threshold_uncertainty_score":0.012275398},"labels":[],"label_agreement":null},{"id":"W4405002901","doi":"10.1007/978-3-031-72630-9_26","title":"Handling the Non-smooth Challenge in Tensor SVD: A Multi-objective Tensor Recovery Framework","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of British Columbia","funders":"","keywords":"Computer science; Tensor (intrinsic definition); Tensor decomposition; Singular value decomposition; Lanczos tensor; Algorithm; Algebra over a field; Tensor field; Tensor density; Mathematics; Exact solutions in general relativity; Pure mathematics; Mathematical analysis","score_opus":0.03840319060337078,"score_gpt":0.31044943515594087,"score_spread":0.2720462445525701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405002901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009888872,0.00018711969,0.9980994,0.00011159583,0.000030592222,0.000011385217,0.00003144138,0.00012788926,0.00041178288],"genre_scores_gemma":[0.047364786,0.0010337983,0.94475937,0.00016217823,0.00020973335,0.00008507363,0.00030729885,0.00045195213,0.0056258505],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991124,0.00031602214,0.00004909581,0.00015404141,0.0002936971,0.00007472628],"domain_scores_gemma":[0.99832195,0.0007975001,0.00016173792,0.00027017403,0.00034507315,0.0001035323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023939405,0.0017910497,0.0016347108,0.0007183624,0.0005827014,0.00193366,0.001931744,0.0019877562,0.0033493503],"category_scores_gemma":[0.0047560143,0.0007201473,0.0010872813,0.0013377985,0.0012264461,0.0028978002,0.0027489224,0.004081682,0.0017697278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021797628,0.00019434268,0.00047461365,0.00068709947,0.00020456187,0.00023654061,0.00021448905,0.38723764,0.029386887,0.1474083,0.020629223,0.41310826],"study_design_scores_gemma":[0.0000064547653,0.000041082254,0.00006261351,0.000016821448,0.000015881364,0.00006195998,0.00001564226,0.9623561,0.0022534458,0.032621402,0.0025333457,0.000015318543],"about_ca_topic_score_codex":0.0024680381,"about_ca_topic_score_gemma":0.0036758904,"teacher_disagreement_score":0.0033493503,"about_ca_system_score_codex":0.0004252483,"about_ca_system_score_gemma":0.0012299822,"threshold_uncertainty_score":0.012660563},"labels":[],"label_agreement":null},{"id":"W4405033697","doi":"10.21468/scipostphyscore.8.4.067","title":"Fractal decompositions and tensor network representations of Bethe wavefunctions","year":2025,"lang":"en","type":"preprint","venue":"SciPost Physics Core","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Institut de Ciències Fotòniques; Canadian Institute for Advanced Research","keywords":"Wave function; Fractal; Tensor (intrinsic definition); Mathematics; Physics; Statistical physics; Pure mathematics; Mathematical physics; Mathematical analysis; Quantum mechanics","score_opus":0.06853633399500149,"score_gpt":0.37099731360553406,"score_spread":0.3024609796105326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405033697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77838314,0.0005118817,0.18647155,0.00082895346,0.000093205745,0.00004140546,0.00024052213,0.00022382129,0.033205535],"genre_scores_gemma":[0.97681695,0.00027369492,0.015698299,0.000087069,0.000074650256,0.00004923871,0.0001986096,0.00009900216,0.0067025344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962246,0.00008716342,0.000015040169,0.00005659895,0.00010167273,0.00011707908],"domain_scores_gemma":[0.99887496,0.00033744157,0.00025130445,0.00016143628,0.0001493372,0.00022559374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115039,0.0004958705,0.00044229857,0.002411441,0.0008146309,0.0019631258,0.0006749102,0.0009861693,0.0054671946],"category_scores_gemma":[0.0020305591,0.0003626623,0.0006101389,0.0008933005,0.0018291998,0.0034567316,0.0011441578,0.00096824346,0.00038111256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002689513,0.000024234178,0.00042346152,0.00001883253,0.000007907531,0.00009126731,0.00016655421,0.010675748,0.0018067105,0.98350173,0.00040962567,0.0028470112],"study_design_scores_gemma":[0.000008614904,0.000020382018,0.0007309077,0.000019694564,0.00000770449,0.00010792333,0.00013273758,0.26778966,0.00092190003,0.72901714,0.0012212155,0.000022039036],"about_ca_topic_score_codex":0.001713572,"about_ca_topic_score_gemma":0.0014267687,"teacher_disagreement_score":0.0054671946,"about_ca_system_score_codex":0.0010698986,"about_ca_system_score_gemma":0.000403411,"threshold_uncertainty_score":0.018289626},"labels":[],"label_agreement":null},{"id":"W4405384795","doi":"10.1002/nla.2608","title":"Quaternion Tensor Completion via <scp>QR</scp> Decomposition and Nuclear Norm Minimization","year":2024,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Quaternion; Singular value decomposition; Robustness (evolution); Mathematics; Tensor (intrinsic definition); Matrix completion; Matrix norm; Mathematical optimization; Matrix decomposition; Minification; Singular value; Generalization; Algorithm; Computer science; Artificial intelligence; Mathematical analysis; Pure mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.01797523011889221,"score_gpt":0.2937145160819113,"score_spread":0.2757392859630191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405384795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020074844,0.000069920825,0.9971629,0.000072625015,0.00003424231,0.00001619607,0.000036554353,0.00009560727,0.00050436275],"genre_scores_gemma":[0.16294977,0.0005866671,0.8310306,0.00015286184,0.0001973429,0.00015884009,0.00058449636,0.00030303298,0.0040364806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910635,0.000330078,0.00005512255,0.00018306373,0.00026637697,0.000058957212],"domain_scores_gemma":[0.9986933,0.00034154078,0.00018691347,0.00023647687,0.00042343079,0.000118287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014324997,0.0012442808,0.00085745734,0.0008611172,0.00032449432,0.0009718965,0.00088589685,0.00058935455,0.0031012166],"category_scores_gemma":[0.0034096406,0.00030989735,0.0010551614,0.0009677971,0.0014329467,0.0014407467,0.0015927607,0.0018922106,0.0010515301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013525812,0.00009038336,0.00081753253,0.00037284332,0.00009141598,0.00020956121,0.00022983467,0.4636521,0.019211002,0.30787078,0.012971732,0.19434752],"study_design_scores_gemma":[0.000005794317,0.000025937958,0.0000843531,0.0000074322356,0.000004189465,0.000033473152,0.000015074216,0.97338957,0.0017460242,0.022758702,0.0019176161,0.000011790323],"about_ca_topic_score_codex":0.0044591115,"about_ca_topic_score_gemma":0.002327945,"teacher_disagreement_score":0.0044591115,"about_ca_system_score_codex":0.00055336487,"about_ca_system_score_gemma":0.0013790487,"threshold_uncertainty_score":0.010374665},"labels":[],"label_agreement":null},{"id":"W4405529663","doi":"10.1016/j.laa.2024.12.010","title":"On the maximal ranks of some third-order quaternion tensors","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Quaternion; Order (exchange); Pure mathematics; Third order; Algebra over a field; Geometry; Theology","score_opus":0.03198494979118157,"score_gpt":0.30765101874433476,"score_spread":0.2756660689531532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405529663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53880775,0.007140115,0.2842997,0.005143325,0.001640352,0.00006489277,0.0006942251,0.0004911238,0.16171853],"genre_scores_gemma":[0.9471905,0.0036855307,0.02633841,0.00056549045,0.001636983,0.000054470012,0.00032359804,0.00018151615,0.020023528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992112,0.0002294842,0.000045204626,0.00014858725,0.00019655236,0.00016896012],"domain_scores_gemma":[0.99691135,0.0013455696,0.00052995083,0.00021672696,0.00045894925,0.00053753256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018238731,0.0014459884,0.0009325494,0.003663813,0.0015927341,0.0030429172,0.00122667,0.0009492655,0.0076457835],"category_scores_gemma":[0.0048967917,0.00053273,0.0008821625,0.0022678357,0.0046159104,0.0058913142,0.0018954598,0.0028385078,0.0013005363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050021397,0.000029034522,0.00027539622,0.000051113508,0.000009635263,0.00007790713,0.00032185935,0.0014621678,0.0013715337,0.98678094,0.0014428877,0.0081274435],"study_design_scores_gemma":[0.000007772244,0.000023468468,0.00035022266,0.000024144858,0.000009929804,0.000102633996,0.00009799188,0.0069347396,0.0005527738,0.98953444,0.0023342953,0.00002758855],"about_ca_topic_score_codex":0.0011716913,"about_ca_topic_score_gemma":0.0011535551,"teacher_disagreement_score":0.0076457835,"about_ca_system_score_codex":0.0012370492,"about_ca_system_score_gemma":0.0008150801,"threshold_uncertainty_score":0.025577724},"labels":[],"label_agreement":null},{"id":"W4406053661","doi":"10.1016/j.ins.2024.121833","title":"Improving preference disaggregation in multicriteria decision making: Incorporating time series analysis and a multi-objective approach","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Preference; Series (stratigraphy); Time series; Computer science; Decision analysis; Econometrics; Operations research; Machine learning; Mathematical optimization; Artificial intelligence; Data mining; Statistics; Mathematics","score_opus":0.043528293611673506,"score_gpt":0.34129733944197516,"score_spread":0.29776904583030167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406053661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034662027,0.0002746408,0.96389717,0.00026541456,0.000043941356,0.000039682112,0.000049574595,0.0000608022,0.00070686557],"genre_scores_gemma":[0.6225289,0.00042507003,0.37558737,0.00016082558,0.00010626071,0.00013738837,0.00019860407,0.00006927275,0.0007862963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953501,0.0029359395,0.00031542836,0.00043269937,0.00071681564,0.00024900542],"domain_scores_gemma":[0.98954356,0.0074401144,0.0009497927,0.0005981508,0.001168041,0.00030030144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0081395125,0.0013482409,0.0028768773,0.0020227972,0.00063185015,0.0022317881,0.0010818492,0.0013223958,0.0014181595],"category_scores_gemma":[0.016189257,0.0007448221,0.0021178066,0.0023963968,0.00068711047,0.0036463577,0.0020395333,0.0019832482,0.00016887386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015752928,0.00021670856,0.0014064341,0.00017627544,0.0003133083,0.000065595996,0.00015986436,0.9220416,0.0014398622,0.015452972,0.00050227216,0.05806766],"study_design_scores_gemma":[0.000003983569,0.000023210603,0.000119040014,0.0000067572932,0.000016979153,0.000004064559,0.00001346636,0.99318933,0.0001528459,0.006388504,0.00007646147,0.0000052618525],"about_ca_topic_score_codex":0.006619985,"about_ca_topic_score_gemma":0.0062852483,"teacher_disagreement_score":0.0081395125,"about_ca_system_score_codex":0.001180214,"about_ca_system_score_gemma":0.0021001096,"threshold_uncertainty_score":0.043046355},"labels":[],"label_agreement":null},{"id":"W4406940898","doi":"10.1007/978-3-031-79029-4_5","title":"A Novel Genetic Algorithm Approach for Discriminative Subspace Optimization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Discriminative model; Subspace topology; Genetic algorithm; Algorithm; Optimization algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","score_opus":0.037909874601596304,"score_gpt":0.30212238473931813,"score_spread":0.26421251013772185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406940898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026240984,0.00012489644,0.9945628,0.00007595608,0.00006130747,0.000027881535,0.000024039351,0.0003025261,0.0021965124],"genre_scores_gemma":[0.06223112,0.00019566683,0.93081146,0.00019782475,0.00009855941,0.00016805266,0.00018065891,0.00018391067,0.00593279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995421,0.00012545843,0.000016043907,0.00009360618,0.00017494525,0.00004778925],"domain_scores_gemma":[0.9995091,0.00021237152,0.000031890704,0.000058170655,0.0001591404,0.000029194918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068189856,0.0010773117,0.0011932976,0.000983977,0.0006222937,0.00089624437,0.0019566016,0.0017707648,0.0039583463],"category_scores_gemma":[0.0016645176,0.0005121019,0.00082951493,0.0015346608,0.00081656256,0.0008315496,0.0013269426,0.0014966548,0.0014699076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006104911,0.00014028225,0.0003935105,0.0000686353,0.00009101428,0.00007963354,0.00005658394,0.6351205,0.006239526,0.03508281,0.005308705,0.31735775],"study_design_scores_gemma":[0.000007977529,0.000016585376,0.00003882522,0.0000036065449,0.0000058533133,0.000018158478,0.0000045749625,0.9946332,0.00036387923,0.0039999853,0.0009031199,0.0000043925415],"about_ca_topic_score_codex":0.00551594,"about_ca_topic_score_gemma":0.0073701013,"teacher_disagreement_score":0.00551594,"about_ca_system_score_codex":0.0005948001,"about_ca_system_score_gemma":0.0011806458,"threshold_uncertainty_score":0.013242006},"labels":[],"label_agreement":null},{"id":"W4407306309","doi":"10.1007/s11004-024-10175-0","title":"Tracing Sedimentary Origins in Multivariate Geochronology via Constrained Tensor Factorization","year":2025,"lang":"en","type":"article","venue":"Mathematical Geosciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Geochronology; Tracing; Multivariate statistics; Geology; Sedimentary rock; Factorization; Hydrogeology; Paleontology; Statistics; Mathematics; Computer science; Algorithm","score_opus":0.032693303497775425,"score_gpt":0.340948537877476,"score_spread":0.30825523437970054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407306309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07681636,0.0005108257,0.919593,0.00032454144,0.00005871451,0.00001319614,0.0003080516,0.0006360452,0.001739233],"genre_scores_gemma":[0.7260432,0.00092618616,0.26890498,0.000062116625,0.00008687485,0.000027292856,0.00040760706,0.0005339006,0.0030078557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998128,0.000046517736,0.000009699007,0.000056709585,0.000051661853,0.000022780881],"domain_scores_gemma":[0.9988876,0.0003984349,0.00027004653,0.00018494,0.00019420954,0.00006481227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064634124,0.0006593538,0.00045921264,0.0017011759,0.0004727244,0.0016670782,0.00070156605,0.0006849418,0.0016600372],"category_scores_gemma":[0.004539406,0.00070855976,0.00046751453,0.0019930454,0.0011480193,0.00195638,0.0012454226,0.0012860633,0.00048814018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028009125,0.00006993718,0.013693311,0.00026989545,0.0001319358,0.0003400306,0.00055937126,0.5541824,0.03271797,0.2381666,0.0035541786,0.15603435],"study_design_scores_gemma":[0.000010354522,0.000012962682,0.0030795108,0.000022826105,0.000014250005,0.000059296708,0.00007167756,0.91438377,0.0024838343,0.077020876,0.0028145143,0.000026067239],"about_ca_topic_score_codex":0.012351493,"about_ca_topic_score_gemma":0.01701153,"teacher_disagreement_score":0.012351493,"about_ca_system_score_codex":0.0006490558,"about_ca_system_score_gemma":0.0011052423,"threshold_uncertainty_score":0.0245592},"labels":[],"label_agreement":null},{"id":"W4407831903","doi":"10.1109/icdm59182.2024.00045","title":"A Bayesian Hierarchical Model for Orthogonal Tucker Decomposition with Oblivious Tensor Compression","year":2024,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tucker decomposition; Decomposition; Tensor decomposition; Compression (physics); Tensor (intrinsic definition); Computer science; Bayesian probability; Mathematics; Artificial intelligence; Physics; Pure mathematics; Chemistry; Thermodynamics","score_opus":0.04204152547561275,"score_gpt":0.35816079560456976,"score_spread":0.316119270128957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407831903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008657496,0.00015802827,0.98921204,0.00037574276,0.000029060511,0.000052391948,0.00024670028,0.0002852226,0.0009833872],"genre_scores_gemma":[0.4590305,0.001014027,0.5226701,0.0006969272,0.00030470925,0.00080760673,0.0021297007,0.00054472376,0.012801723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976629,0.00095368706,0.00012139441,0.0004914505,0.00051230704,0.0002581743],"domain_scores_gemma":[0.99149674,0.004378991,0.0010151084,0.0016566932,0.0010766499,0.00037586462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047383136,0.0012174874,0.0015489123,0.0014865715,0.00095814257,0.0022158371,0.0032166692,0.0019862338,0.0057405955],"category_scores_gemma":[0.021140734,0.0011205818,0.001298969,0.0020454621,0.0030131326,0.004866089,0.0027141967,0.0033865534,0.0018136926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023777946,0.000101550424,0.0018079098,0.00012271044,0.00006796584,0.00016684242,0.00031111896,0.42420986,0.0024149516,0.500024,0.006611814,0.06392346],"study_design_scores_gemma":[0.000013350775,0.000018942714,0.00019284198,0.000014762184,0.00000893358,0.00003289743,0.000014167656,0.88613343,0.0003722192,0.112324074,0.00085455674,0.000019760657],"about_ca_topic_score_codex":0.008010584,"about_ca_topic_score_gemma":0.009531624,"teacher_disagreement_score":0.008010584,"about_ca_system_score_codex":0.00209115,"about_ca_system_score_gemma":0.002623429,"threshold_uncertainty_score":0.025058925},"labels":[],"label_agreement":null},{"id":"W4407895373","doi":"10.1016/j.jmva.2025.105427","title":"Markov switching multiple-equation tensor regressions","year":2025,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"NextGenerationEU; Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Università Ca' Foscari Venezia","keywords":"Mathematics; Markov chain; Tensor (intrinsic definition); Applied mathematics; Statistics; Econometrics; Pure mathematics","score_opus":0.043905920161001886,"score_gpt":0.36576551414396224,"score_spread":0.3218595939829604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407895373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009459931,0.00018775625,0.98852706,0.00030952526,0.00004812515,0.000033018354,0.00020539518,0.0003587328,0.0008704352],"genre_scores_gemma":[0.55144024,0.00135579,0.4315049,0.00034758984,0.00023810209,0.00045621677,0.0017045081,0.0004550566,0.012497647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762064,0.001244758,0.00008790403,0.00046809754,0.00036401246,0.00021454993],"domain_scores_gemma":[0.99574596,0.0024408435,0.0006966384,0.00049636856,0.00046175218,0.00015844875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004039451,0.0014934664,0.0017757455,0.0007486713,0.00070502213,0.0017477634,0.002429268,0.0016626449,0.0038081752],"category_scores_gemma":[0.010376859,0.0008169494,0.0017559822,0.0017317606,0.0011478158,0.002182382,0.0016734567,0.0032833638,0.0010027245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097095945,0.000056330304,0.0023650096,0.00012148202,0.00009066069,0.00015417078,0.00010852402,0.8382138,0.001735348,0.114963375,0.0025881021,0.03950615],"study_design_scores_gemma":[0.0000038422622,0.000008578042,0.00015753596,0.000004433814,0.000005926822,0.000010994924,0.0000039176066,0.989451,0.00013990069,0.00974422,0.00046141853,0.0000082431],"about_ca_topic_score_codex":0.009843798,"about_ca_topic_score_gemma":0.008895929,"teacher_disagreement_score":0.009843798,"about_ca_system_score_codex":0.0014195213,"about_ca_system_score_gemma":0.0022340445,"threshold_uncertainty_score":0.0213629},"labels":[],"label_agreement":null},{"id":"W4408432897","doi":"10.1017/9781009489188.011","title":"Achieving Organizational Alignment for Performance","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Business; Computer science; Process management","score_opus":0.03197273341712346,"score_gpt":0.2391876454481105,"score_spread":0.20721491203098705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408432897","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055898316,0.007204547,0.14401153,0.021244014,0.0019570312,0.00020667649,0.000103822815,0.0009062465,0.81877637],"genre_scores_gemma":[0.3705856,0.013561145,0.25324264,0.007153074,0.0013568137,0.0011646509,0.00062184385,0.0011815156,0.35113275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99568486,0.0013122142,0.0002120302,0.00047649824,0.0017539307,0.0005604589],"domain_scores_gemma":[0.99867874,0.00025663318,0.00018943312,0.00023934877,0.0003300834,0.00030568364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003017143,0.0010712531,0.0005543753,0.0010569431,0.002183028,0.010331609,0.0010107625,0.0016771908,0.01589784],"category_scores_gemma":[0.0052873343,0.00040823844,0.0005012672,0.0015445013,0.004892168,0.005679791,0.0076321885,0.0032029764,0.010091648],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012584648,0.000040359,0.00040795445,0.00026086083,0.000018268382,0.000061298444,0.0022838048,0.0010696105,0.0011397954,0.78467447,0.066817194,0.14321393],"study_design_scores_gemma":[0.000013734713,0.00007902952,0.0013189147,0.00051934883,0.000013116757,0.00018646487,0.0022574014,0.0018705289,0.0012074704,0.5009153,0.49159506,0.000023722112],"about_ca_topic_score_codex":0.0012307485,"about_ca_topic_score_gemma":0.0014245625,"teacher_disagreement_score":0.01589784,"about_ca_system_score_codex":0.003074379,"about_ca_system_score_gemma":0.00674436,"threshold_uncertainty_score":0.053183556},"labels":[],"label_agreement":null},{"id":"W4408503389","doi":"10.21468/scipostphys.18.3.096","title":"Generative learning of continuous data by tensor networks","year":2025,"lang":"en","type":"article","venue":"SciPost Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal; Perimeter Institute","funders":"Canadian Institute for Advanced Research","keywords":"Generative grammar; Computer science; Tensor (intrinsic definition); Artificial intelligence; Mathematics; Geometry","score_opus":0.04274866320332639,"score_gpt":0.34404443539146395,"score_spread":0.3012957721881376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408503389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016685868,0.00022455676,0.9806774,0.00051214243,0.000029242161,0.000025009354,0.00018328697,0.0003360766,0.0013263697],"genre_scores_gemma":[0.7059894,0.0010577036,0.28487557,0.0004746401,0.00018737109,0.00023383065,0.0011106945,0.00039230622,0.0056784614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988776,0.00060197513,0.00004388981,0.00022234053,0.00017712677,0.000076964985],"domain_scores_gemma":[0.994601,0.0033544435,0.0004992096,0.0010187101,0.00030115427,0.0002255623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028027135,0.0008289298,0.00088153314,0.0011574676,0.0006484817,0.0018016419,0.00182006,0.0011240896,0.0023998523],"category_scores_gemma":[0.011185211,0.00075956486,0.0013623772,0.001353934,0.002498145,0.0040227897,0.0022670634,0.0028526902,0.0005719332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000665045,0.000041600546,0.0019045563,0.00009503608,0.00006538116,0.00010145309,0.00022353158,0.65010417,0.0015353609,0.31348988,0.0020988376,0.030273654],"study_design_scores_gemma":[0.0000027427131,0.000005246687,0.00008844814,0.0000068855666,0.0000024161532,0.000015798285,0.000007214739,0.9253531,0.00016965023,0.07394974,0.00039258864,0.0000061591463],"about_ca_topic_score_codex":0.004422955,"about_ca_topic_score_gemma":0.0057637678,"teacher_disagreement_score":0.004422955,"about_ca_system_score_codex":0.0015891825,"about_ca_system_score_gemma":0.0010806281,"threshold_uncertainty_score":0.014822364},"labels":[],"label_agreement":null},{"id":"W4408609844","doi":"10.1101/2025.03.17.643624","title":"randPedPCA: Rapid approximation of principal components from large pedigrees","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pedigree chart; Principal component analysis; Principal (computer security); Mathematics; Computer science; Artificial intelligence; Biology; Genetics","score_opus":0.03490179435241681,"score_gpt":0.27464142522781815,"score_spread":0.23973963087540134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408609844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006105908,0.00027419077,0.9867915,0.00022857405,0.00005835287,0.000058340185,0.0006233359,0.0050778952,0.00078177993],"genre_scores_gemma":[0.103316024,0.0006467502,0.8864135,0.0002069418,0.000102756145,0.00035471277,0.0032265626,0.002184592,0.0035480498],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885476,0.00049726013,0.000058183825,0.00018977953,0.00028784366,0.00011217428],"domain_scores_gemma":[0.996005,0.0023246626,0.00025222998,0.0006705222,0.0005818283,0.00016581165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024986,0.001546686,0.0010173876,0.0017307106,0.00063326064,0.0017610707,0.0015364885,0.0008539472,0.008280404],"category_scores_gemma":[0.01394123,0.00089945365,0.001608135,0.0017925663,0.00076139,0.001454049,0.0019632734,0.0018936098,0.0038470235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039866875,0.00012206623,0.004245934,0.00054742256,0.0004192809,0.00062717544,0.0005956711,0.41411483,0.010357109,0.04445091,0.054859452,0.46926153],"study_design_scores_gemma":[0.000047464502,0.000025724348,0.0010681468,0.000041861116,0.000022900056,0.00016085005,0.000047920465,0.95805174,0.0016724968,0.029976856,0.008853586,0.000030435014],"about_ca_topic_score_codex":0.015691575,"about_ca_topic_score_gemma":0.019030364,"teacher_disagreement_score":0.015691575,"about_ca_system_score_codex":0.0007170803,"about_ca_system_score_gemma":0.0024506734,"threshold_uncertainty_score":0.031200469},"labels":[],"label_agreement":null},{"id":"W4409534108","doi":"10.1016/j.jsc.2025.102449","title":"Linear preservers of secant varieties and other varieties of tensors","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Directorate for Mathematical and Physical Sciences; National Science Foundation","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.032607690337990575,"score_gpt":0.34204714740758524,"score_spread":0.30943945706959464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409534108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8014921,0.0006563092,0.16117518,0.0007398488,0.00009132939,0.00006493478,0.00028725108,0.00019023246,0.035302866],"genre_scores_gemma":[0.9759975,0.00042606908,0.0155417165,0.0000815432,0.00017903534,0.0000328172,0.0002751448,0.000059862592,0.0074063116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994186,0.00010595681,0.00004804394,0.00014846127,0.00017146375,0.000107479726],"domain_scores_gemma":[0.9987155,0.00034713387,0.0003075189,0.0002764548,0.00017528082,0.00017808525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083086407,0.00051272,0.0003579685,0.0015806863,0.0010707128,0.0020944253,0.000530116,0.00035301936,0.004007727],"category_scores_gemma":[0.0017286958,0.0002023759,0.0007024776,0.00094123743,0.0029378864,0.0040558013,0.0019159875,0.0011859004,0.0004475929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024284902,0.000016189008,0.0007573907,0.000026275025,0.000004777368,0.00010767716,0.00062407856,0.0010361974,0.0017933302,0.9890611,0.000311311,0.0062374533],"study_design_scores_gemma":[0.000008494395,0.00010812768,0.0012982346,0.000021802402,0.000013891172,0.00051347545,0.0009581697,0.009112574,0.005909801,0.9721851,0.009846133,0.000024108193],"about_ca_topic_score_codex":0.0004556283,"about_ca_topic_score_gemma":0.00025830572,"teacher_disagreement_score":0.004007727,"about_ca_system_score_codex":0.00058054633,"about_ca_system_score_gemma":0.00024419065,"threshold_uncertainty_score":0.013407171},"labels":[],"label_agreement":null},{"id":"W4409677710","doi":"10.1007/s10115-025-02381-x","title":"A Bayesian hierarchical model for orthogonal Tucker decomposition with oblivious tensor compression","year":2025,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tucker decomposition; Tensor decomposition; Decomposition; Compression (physics); Tensor (intrinsic definition); Bayesian probability; Mathematics; Computer science; Artificial intelligence; Algorithm; Pattern recognition (psychology); Pure mathematics; Chemistry; Physics","score_opus":0.022339431200952747,"score_gpt":0.32378291151621913,"score_spread":0.30144348031526635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409677710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048411526,0.00020159593,0.9929107,0.00035888923,0.000030241106,0.000030874373,0.00024180625,0.00023477314,0.0011498696],"genre_scores_gemma":[0.41943315,0.0012846753,0.5598404,0.0005334445,0.00030719166,0.000540211,0.0017117811,0.0004987083,0.015850475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820125,0.0007805835,0.00009387297,0.00033150884,0.0003682292,0.00022460209],"domain_scores_gemma":[0.99522805,0.002611038,0.0004714307,0.00081099063,0.00065549626,0.00022301753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032148534,0.0009899555,0.0019744253,0.0011756512,0.00080006267,0.0020561481,0.002769689,0.002213102,0.0053952145],"category_scores_gemma":[0.0119917765,0.0010802838,0.0011799515,0.0023075666,0.002003685,0.0047786455,0.0022909162,0.003087255,0.0016075746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020120025,0.000084732346,0.00038168978,0.000112298054,0.00007101379,0.00008333433,0.00012260467,0.55538166,0.0011473014,0.38658214,0.0056107333,0.050221305],"study_design_scores_gemma":[0.000008653277,0.0000111686195,0.00004663361,0.000009002585,0.000007098665,0.000012489736,0.000006055652,0.9119976,0.00016061177,0.087234795,0.0004934979,0.0000123608015],"about_ca_topic_score_codex":0.0106872115,"about_ca_topic_score_gemma":0.011075132,"teacher_disagreement_score":0.0106872115,"about_ca_system_score_codex":0.0017048579,"about_ca_system_score_gemma":0.0028681937,"threshold_uncertainty_score":0.02125001},"labels":[],"label_agreement":null},{"id":"W4410224310","doi":"10.1016/j.amc.2025.129504","title":"Low-rank reduced biquaternion tensor ring decomposition and tensor completion","year":2025,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Tensor (intrinsic definition); Rank (graph theory); Ring (chemistry); Decomposition; Tensor product of Hilbert spaces; Symmetric tensor; Tensor contraction; Algebra over a field; Pure mathematics; Tensor product; Combinatorics; Mathematical analysis; Exact solutions in general relativity","score_opus":0.02707958797396616,"score_gpt":0.32131969428051205,"score_spread":0.2942401063065459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410224310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29734632,0.0029224677,0.535426,0.004284956,0.0021410473,0.0001636712,0.0012819652,0.001061943,0.15537156],"genre_scores_gemma":[0.84561837,0.0018366935,0.08385934,0.0008570785,0.0017137639,0.000095191535,0.0010263993,0.00052890467,0.064464174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993537,0.00014002151,0.000034389097,0.00014492276,0.00022281808,0.00010410618],"domain_scores_gemma":[0.9990445,0.00011767768,0.00019401826,0.00015651717,0.0002845182,0.0002028011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018958,0.0010261582,0.0008743102,0.0022701675,0.0010313641,0.0027386697,0.0010565892,0.0006830306,0.01045297],"category_scores_gemma":[0.0019738935,0.0003173272,0.00067862694,0.001090458,0.002397739,0.004113571,0.001649586,0.0024437145,0.0023462956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029980261,0.000021633981,0.00010430404,0.000035127778,0.000007078348,0.00003939328,0.00012018552,0.0010160052,0.0011620409,0.98909366,0.002208783,0.0061618662],"study_design_scores_gemma":[0.000006979598,0.0000249576,0.0002073701,0.000009648236,0.000008149167,0.00010496215,0.00007268865,0.011204642,0.0008515977,0.98101497,0.006472195,0.000021748901],"about_ca_topic_score_codex":0.0012404013,"about_ca_topic_score_gemma":0.0010649819,"teacher_disagreement_score":0.01045297,"about_ca_system_score_codex":0.00087992183,"about_ca_system_score_gemma":0.000738018,"threshold_uncertainty_score":0.034968615},"labels":[],"label_agreement":null},{"id":"W4410644684","doi":"10.1007/978-3-031-92383-8_14","title":"Markov Switching Tensor Regressions","year":2025,"lang":"en","type":"book-chapter","venue":"Contributions to statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor (intrinsic definition); Markov chain; Mathematics; Computer science; Statistics; Pure mathematics","score_opus":0.02698737649853611,"score_gpt":0.35420399611453224,"score_spread":0.32721661961599613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410644684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004171759,0.02495823,0.7825624,0.0041647987,0.0028697618,0.000037800324,0.0010682478,0.0012657925,0.17890121],"genre_scores_gemma":[0.14134558,0.037932374,0.24351141,0.0020042846,0.008253708,0.00017736372,0.002288836,0.0019327247,0.56255376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994456,0.00019350601,0.000022147131,0.00011133034,0.0001942354,0.00003314048],"domain_scores_gemma":[0.99824715,0.0010727132,0.00010099061,0.00026393624,0.00025271828,0.000062388805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012288227,0.001240311,0.0011355646,0.0012306009,0.00055749685,0.0018786042,0.000670455,0.00089439494,0.018459033],"category_scores_gemma":[0.0046371487,0.00058730476,0.0006166271,0.0028682372,0.001141545,0.0018969111,0.0009623065,0.0024967229,0.009736251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020442263,0.00003990388,0.00025199365,0.00011539855,0.000034443678,0.00004292873,0.000081770544,0.014031841,0.0007398785,0.7044748,0.10109537,0.1790712],"study_design_scores_gemma":[0.0000039282304,0.000015425549,0.00042799223,0.00007013404,0.000018018063,0.00007091476,0.000018086032,0.053635523,0.0006418993,0.82898444,0.11608891,0.000024669662],"about_ca_topic_score_codex":0.0020715166,"about_ca_topic_score_gemma":0.002513317,"teacher_disagreement_score":0.018459033,"about_ca_system_score_codex":0.0010555992,"about_ca_system_score_gemma":0.0010774502,"threshold_uncertainty_score":0.061751604},"labels":[],"label_agreement":null},{"id":"W4410737808","doi":"10.1007/978-981-96-2482-9_5","title":"Dynamic Tensor Least Angle Regression Using L1 Homotopy","year":2025,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Regression; Mathematics; Tensor (intrinsic definition); Homotopy; Statistics; Pure mathematics","score_opus":0.051644941845671984,"score_gpt":0.3145558481268599,"score_spread":0.2629109062811879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410737808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015097446,0.00020790567,0.994558,0.000096559255,0.00012663637,0.000007612166,0.000038770377,0.00041138404,0.0030433962],"genre_scores_gemma":[0.09307829,0.0010594139,0.8669988,0.00019061341,0.0003679361,0.00011692293,0.0004310691,0.0016395681,0.036117326],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999483,0.00018243825,0.00002321726,0.000110535635,0.00016998306,0.00003080737],"domain_scores_gemma":[0.9991178,0.00045346987,0.00006047934,0.00016584233,0.00016941254,0.00003306342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089055,0.0013543862,0.0010332932,0.00077806675,0.00044211352,0.0012807858,0.0011166624,0.0011215584,0.008372848],"category_scores_gemma":[0.003714809,0.00052783504,0.00079483644,0.0010963258,0.0008283336,0.001984432,0.001540097,0.0021748906,0.0049297544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102238126,0.00008208095,0.0005446209,0.00023662091,0.00010981047,0.00012054848,0.00013946563,0.24587199,0.012154239,0.24349213,0.02059707,0.4765492],"study_design_scores_gemma":[0.000004977314,0.000024801253,0.00012640118,0.000018168274,0.000013047635,0.000047333815,0.000016427166,0.9372035,0.0027732782,0.048663825,0.011091203,0.00001698373],"about_ca_topic_score_codex":0.0027198468,"about_ca_topic_score_gemma":0.0024874073,"teacher_disagreement_score":0.008372848,"about_ca_system_score_codex":0.00047284202,"about_ca_system_score_gemma":0.00061773177,"threshold_uncertainty_score":0.028009951},"labels":[],"label_agreement":null},{"id":"W4411059592","doi":"10.1145/3712593","title":"Tensor-empowered Incomplete Multimodal Learning with Modality Reconstruction for Edge Intelligence","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Modality (human–computer interaction); Enhanced Data Rates for GSM Evolution; Artificial intelligence; Tensor (intrinsic definition); Computer vision; Human–computer interaction; Mathematics","score_opus":0.05041442200270725,"score_gpt":0.35246392138635757,"score_spread":0.30204949938365033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411059592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009852514,0.00022282974,0.9885975,0.00018252897,0.000026982912,0.000015830308,0.00007028265,0.00045167733,0.0005797822],"genre_scores_gemma":[0.55817664,0.0007000448,0.43397656,0.00044918418,0.00014642876,0.00013006602,0.0009084182,0.00023780749,0.005274787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999589,0.00015479114,0.000017130982,0.00010452449,0.00007725645,0.00005727131],"domain_scores_gemma":[0.9991491,0.00034550167,0.000106013824,0.00017985863,0.00016101082,0.00005855114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010751007,0.0009164459,0.0007127737,0.00043944584,0.00032599946,0.00059470604,0.0011708216,0.00087340426,0.0015737818],"category_scores_gemma":[0.0030519017,0.00040554343,0.00083043193,0.0005770926,0.00084378483,0.0016951681,0.0014393486,0.002079851,0.000573166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036432,0.0001578489,0.0016767544,0.00018334121,0.00014833498,0.00020039291,0.00031214257,0.6262979,0.02321476,0.026600946,0.0062030843,0.31464016],"study_design_scores_gemma":[0.0000026177236,0.000019453724,0.00008135294,0.0000036774422,0.0000059363897,0.000020270694,0.0000076805745,0.9931772,0.0014574745,0.004751425,0.00046691165,0.0000060022776],"about_ca_topic_score_codex":0.0045217494,"about_ca_topic_score_gemma":0.0057628,"teacher_disagreement_score":0.0045217494,"about_ca_system_score_codex":0.00057586585,"about_ca_system_score_gemma":0.0008495564,"threshold_uncertainty_score":0.008990884},"labels":[],"label_agreement":null},{"id":"W4411404946","doi":"10.1017/9781009180108.013","title":"Principal Component Analysis and Low-Rank Models","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Principal component analysis; Rank (graph theory); Component (thermodynamics); Mathematics; Statistics; Combinatorics; Physics","score_opus":0.03782565170106075,"score_gpt":0.2459316832808854,"score_spread":0.20810603157982466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411404946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016837735,0.0129466755,0.97180676,0.00194472,0.00036965785,0.000050138944,0.000639441,0.0007063725,0.009852481],"genre_scores_gemma":[0.12029463,0.05810037,0.78074074,0.0012977718,0.0030348436,0.00056304643,0.003708001,0.0009476866,0.031312943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99693274,0.0012048312,0.00015389766,0.0006036564,0.00096343074,0.00014143442],"domain_scores_gemma":[0.995756,0.0027328436,0.00032312245,0.00050333235,0.00060196075,0.00008279073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003013307,0.0023620068,0.0015429594,0.0022474579,0.0006997285,0.0034870992,0.0013646466,0.0018737512,0.009132646],"category_scores_gemma":[0.011709123,0.00078975456,0.001348311,0.005057934,0.0020932187,0.003446392,0.0017316386,0.0033210765,0.0064014127],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055708642,0.00006571304,0.0014031252,0.0009931172,0.00022198148,0.00019733183,0.00030370217,0.09360313,0.001734811,0.48664984,0.056217324,0.35855427],"study_design_scores_gemma":[0.00001018152,0.00004480412,0.0011607332,0.00021454376,0.00005295406,0.00024860943,0.00008896344,0.29059526,0.0009023606,0.62853163,0.07807626,0.00007379001],"about_ca_topic_score_codex":0.0033708438,"about_ca_topic_score_gemma":0.0031204089,"teacher_disagreement_score":0.009132646,"about_ca_system_score_codex":0.0012398615,"about_ca_system_score_gemma":0.0013344074,"threshold_uncertainty_score":0.030551791},"labels":[],"label_agreement":null},{"id":"W4412825786","doi":"10.1093/bib/bbaf372","title":"ConvNTC: convolutional neural tensor completion for detecting “A–A–B” type biological triplets","year":2025,"lang":"en","type":"article","venue":"Briefings in Bioinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multilinear map; Tensor (intrinsic definition); Computer science; Convolutional neural network; Artificial intelligence; Tensor algebra; Context (archaeology); Nonlinear system; Theoretical computer science; Pattern recognition (psychology); Mathematics; Algebra over a field; Physics; Pure mathematics; Biology","score_opus":0.08588467673509687,"score_gpt":0.3492596114861307,"score_spread":0.26337493475103385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412825786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059162267,0.0019141556,0.91492563,0.0006552351,0.00027379178,0.0002575317,0.0033525168,0.016124465,0.0033344438],"genre_scores_gemma":[0.41316295,0.0012830552,0.5515767,0.0006760852,0.0001434613,0.00037462855,0.022004023,0.0011884124,0.009590666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902034,0.00019700984,0.000060795526,0.00033617945,0.00024708826,0.0001386272],"domain_scores_gemma":[0.9982992,0.0003233662,0.00029259236,0.0004572532,0.00045552698,0.00017199287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017651956,0.002753868,0.0013388091,0.0015006406,0.00069234037,0.0009930823,0.0025849112,0.0013669273,0.0030598321],"category_scores_gemma":[0.0044084196,0.0006851873,0.001970376,0.0013298177,0.0010551804,0.0020298953,0.0016165184,0.002940178,0.001974696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088140054,0.0005040965,0.006640625,0.0006918034,0.0005247536,0.0005978535,0.00023114882,0.3835665,0.053310882,0.020253496,0.06706227,0.4657352],"study_design_scores_gemma":[0.00001298865,0.00004442777,0.0004137411,0.000012498511,0.000019516227,0.00006757597,0.000016136251,0.9865122,0.0056995433,0.004989692,0.0021930926,0.000018683137],"about_ca_topic_score_codex":0.02563329,"about_ca_topic_score_gemma":0.02968026,"teacher_disagreement_score":0.02563329,"about_ca_system_score_codex":0.001962419,"about_ca_system_score_gemma":0.0025258858,"threshold_uncertainty_score":0.05096817},"labels":[],"label_agreement":null},{"id":"W4413121896","doi":"10.1109/ims40360.2025.11103850","title":"Towards Tensor-Train Solution of Vector Volume Integral Equation in 3D with $log N$ Complexity","year":2025,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tensor (intrinsic definition); Integral equation; Volume (thermodynamics); Computer science; Volume integral; Mathematics; Applied mathematics; Mathematical analysis; Physics; Pure mathematics","score_opus":0.08677643446391338,"score_gpt":0.3415007786016193,"score_spread":0.25472434413770595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413121896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035176997,0.000090038375,0.992796,0.00014781544,0.000030844145,0.000028820728,0.00006347345,0.0005850938,0.0027402942],"genre_scores_gemma":[0.059523728,0.0003241769,0.93298787,0.00011167551,0.000065215456,0.00019923829,0.0003592516,0.00053551636,0.0058933045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961936,0.000111363915,0.000020749172,0.00003124036,0.00018496114,0.00003227689],"domain_scores_gemma":[0.9990538,0.00039166934,0.000060542,0.00014024982,0.00030581187,0.000047989543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070123485,0.0008875669,0.00071614335,0.0007321621,0.00044073354,0.0012386416,0.0012405904,0.0008613552,0.0064273197],"category_scores_gemma":[0.0026175117,0.00040509406,0.0008863388,0.0008371734,0.0007228184,0.001548354,0.0016080575,0.0015692255,0.0037103135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021982042,0.00014690237,0.0012798976,0.00049259304,0.00007514246,0.000439843,0.00049370126,0.4901734,0.020322265,0.21873568,0.01842322,0.24919754],"study_design_scores_gemma":[0.0000067349206,0.000008175652,0.00003030736,0.000006583683,0.0000024540361,0.000025677948,0.000018005645,0.98199433,0.0010961222,0.013783696,0.0030232365,0.0000047549916],"about_ca_topic_score_codex":0.0068626273,"about_ca_topic_score_gemma":0.0068911226,"teacher_disagreement_score":0.0068626273,"about_ca_system_score_codex":0.0006570632,"about_ca_system_score_gemma":0.0012946794,"threshold_uncertainty_score":0.021501541},"labels":[],"label_agreement":null},{"id":"W4414350851","doi":"10.1139/facets-2025-0011","title":"Blossoming instantiations in FRAM: a temporal tensor framework for socio-technical systems","year":2025,"lang":"en","type":"article","venue":"FACETS","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sociotechnical system; Ambiguity; Encoding (memory); Dimension (graph theory); Scheme (mathematics)","score_opus":0.056682032350682886,"score_gpt":0.38526309058003205,"score_spread":0.3285810582293492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414350851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023815532,0.00013888243,0.99209964,0.0002536376,0.000078219105,0.000039803163,0.000110844,0.00022389973,0.0046735257],"genre_scores_gemma":[0.12385995,0.00047597752,0.8692966,0.00015555341,0.00014495356,0.00031794026,0.00031906198,0.00036438924,0.0050655473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986577,0.00063412916,0.000123626,0.00024811737,0.00022806953,0.00010839445],"domain_scores_gemma":[0.99820757,0.0005950723,0.0002586105,0.0005375902,0.00025429827,0.00014688728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002790827,0.001183998,0.00055941654,0.001969385,0.0012751386,0.00396018,0.0013953913,0.0011589002,0.0071403277],"category_scores_gemma":[0.005809055,0.00062670046,0.0015179132,0.0015508087,0.0039851703,0.007387053,0.003058686,0.002359947,0.0016034318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015862774,0.000008623717,0.00019389999,0.00007413333,0.000008707474,0.000083371655,0.0007739881,0.0060480568,0.0012471827,0.97472286,0.0009000768,0.015923243],"study_design_scores_gemma":[0.000009727969,0.00003100642,0.00019052823,0.0000976996,0.000017830314,0.00017523098,0.00044157208,0.11306535,0.0011224176,0.85120904,0.03359883,0.000040772567],"about_ca_topic_score_codex":0.0030506572,"about_ca_topic_score_gemma":0.003008638,"teacher_disagreement_score":0.0071403277,"about_ca_system_score_codex":0.0014374015,"about_ca_system_score_gemma":0.001621722,"threshold_uncertainty_score":0.0238868},"labels":[],"label_agreement":null},{"id":"W4415724501","doi":"10.1002/sta4.70116","title":"Tensor Train Recurrent Network Language Model Prediction","year":2025,"lang":"en","type":"article","venue":"Stat","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Tensor (intrinsic definition); Convolutional neural network; Recurrent neural network; Matrix product state; Computation; Data compression; Reduction (mathematics); Artificial neural network","score_opus":0.034987884450652,"score_gpt":0.34953639972592204,"score_spread":0.31454851527527006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415724501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14179236,0.001508197,0.83891606,0.001572246,0.00049159524,0.000107863976,0.0023244813,0.007049312,0.0062379483],"genre_scores_gemma":[0.84426963,0.0005665085,0.14103796,0.00022635167,0.00017779003,0.00011458819,0.0040843515,0.00030241575,0.009220372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.00014950667,0.000029313958,0.00012849952,0.00009771348,0.000069903435],"domain_scores_gemma":[0.9978818,0.0011732526,0.0001238996,0.00023445133,0.0005338019,0.000052736734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010377573,0.00097406376,0.0006220535,0.00063507294,0.00025976208,0.00091428694,0.0008094944,0.00060949166,0.004287361],"category_scores_gemma":[0.0048335507,0.00031434806,0.0006239435,0.0007579889,0.00036381182,0.0014387231,0.0005622135,0.0015289387,0.0018132308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003231786,0.0001224677,0.0020494112,0.00011015865,0.00010618291,0.00012658222,0.00007440029,0.75932795,0.0040062484,0.010484422,0.011001646,0.21226744],"study_design_scores_gemma":[0.0000012831639,0.0000047807316,0.000040947,0.0000014556178,0.0000018581575,0.0000029581117,0.0000018664978,0.9985663,0.00035528603,0.0008777043,0.00014404798,0.000001494288],"about_ca_topic_score_codex":0.018275272,"about_ca_topic_score_gemma":0.016185747,"teacher_disagreement_score":0.018275272,"about_ca_system_score_codex":0.0010366554,"about_ca_system_score_gemma":0.0008979043,"threshold_uncertainty_score":0.036337793},"labels":[],"label_agreement":null},{"id":"W4416078682","doi":"10.1145/3746252.3761083","title":"Oblivious Johnson--Lindenstrauss embeddings for compressed Tucker decompositions","year":2025,"lang":"","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Intersection (aeronautics); Field (mathematics); Algebra over a field; Upper and lower bounds","score_opus":0.0340284891429637,"score_gpt":0.36619074126531315,"score_spread":0.33216225212234946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416078682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18615213,0.0019717277,0.74574286,0.004535521,0.00063759234,0.00028618143,0.002186221,0.0059414646,0.052546218],"genre_scores_gemma":[0.8172782,0.0010577332,0.14751716,0.0010851256,0.0005040531,0.00042046787,0.0023685922,0.0014836222,0.02828505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975751,0.0004552031,0.00015607993,0.0004615085,0.00079205364,0.0005601919],"domain_scores_gemma":[0.99488837,0.0018274301,0.00035904275,0.0021059986,0.00044959405,0.00036966024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015268495,0.0015186145,0.0017019422,0.0013225953,0.0017468135,0.003999942,0.0019585069,0.0018265897,0.01450409],"category_scores_gemma":[0.009707646,0.00083466346,0.0010161245,0.0019622273,0.0023218002,0.010472317,0.006253568,0.0050924737,0.0034370846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008844664,0.00028915686,0.00062038883,0.00028216426,0.0000613069,0.00014306592,0.000650985,0.04229656,0.0048798667,0.832386,0.026801089,0.09070495],"study_design_scores_gemma":[0.000057782807,0.000060801332,0.0001240205,0.000045668567,0.000030645457,0.000064832144,0.00011649049,0.07848038,0.0024668707,0.91359496,0.0049268105,0.000030746218],"about_ca_topic_score_codex":0.0013681029,"about_ca_topic_score_gemma":0.0031454633,"teacher_disagreement_score":0.01450409,"about_ca_system_score_codex":0.0022671584,"about_ca_system_score_gemma":0.0018419552,"threshold_uncertainty_score":0.048521042},"labels":[],"label_agreement":null},{"id":"W4416247092","doi":"10.48550/arxiv.2510.19516","title":"Probabilistic PCA on tensors","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Identifiability; Multilinear map; Probabilistic logic; Principal component analysis; Estimator; Tensor (intrinsic definition); Kronecker delta; Gaussian; Sparse PCA; Expectation–maximization algorithm","score_opus":0.09097254457846796,"score_gpt":0.341070032919232,"score_spread":0.25009748834076406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416247092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015492699,0.00024426944,0.99684095,0.00020827922,0.00003321258,0.000018394981,0.000108995024,0.00012638714,0.0008701891],"genre_scores_gemma":[0.20580094,0.0030069647,0.78077906,0.00052405946,0.0007002432,0.0003919058,0.001275653,0.0005227696,0.0069985203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956671,0.0019074064,0.00019989551,0.000897633,0.0010963189,0.00023162781],"domain_scores_gemma":[0.9907787,0.0045110784,0.0010701367,0.0019612699,0.0013728678,0.00030585547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004536956,0.0019848656,0.0013308269,0.0023710693,0.0011011501,0.0029764231,0.0018214918,0.0016211647,0.0037685598],"category_scores_gemma":[0.019477814,0.0011846235,0.0016841055,0.0030103934,0.0043621417,0.005448311,0.0044811633,0.0042125625,0.0015728537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051907897,0.000026859649,0.000603005,0.00020016183,0.00007748422,0.0000876588,0.00016722264,0.12884742,0.0025686806,0.8007486,0.0043761577,0.062244944],"study_design_scores_gemma":[0.0000069412954,0.000030586998,0.00034326926,0.00004498785,0.00001540261,0.00008327422,0.000025132216,0.43919235,0.0009897649,0.5536906,0.0055456148,0.00003213218],"about_ca_topic_score_codex":0.0027815877,"about_ca_topic_score_gemma":0.0021632388,"teacher_disagreement_score":0.004536956,"about_ca_system_score_codex":0.0013891911,"about_ca_system_score_gemma":0.0018159946,"threshold_uncertainty_score":0.023994029},"labels":[],"label_agreement":null},{"id":"W4416678022","doi":"10.1016/j.neucom.2025.132074","title":"Deep tensor decomposition: A survey","year":2025,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Deep learning; Multilinear map; Tensor (intrinsic definition); Matrix decomposition; Nonlinear system; Deep neural networks; Curse of dimensionality; Artificial neural network","score_opus":0.045539079690275534,"score_gpt":0.3663864689848994,"score_spread":0.32084738929462386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416678022","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00451648,0.17972574,0.7983162,0.0029003536,0.0008399846,0.000082352766,0.0010390577,0.0011764611,0.011403409],"genre_scores_gemma":[0.11137787,0.48548782,0.3777593,0.0011994475,0.0030547548,0.00027935157,0.0050433488,0.0008331535,0.01496489],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993012,0.00014053188,0.00008900529,0.00012781571,0.00028825313,0.000053182015],"domain_scores_gemma":[0.9985273,0.00055012375,0.00011183911,0.00023475473,0.00047943104,0.000096448486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015079948,0.0017558174,0.001564777,0.0022022275,0.00041710178,0.002121179,0.0016378119,0.0010903701,0.0053374884],"category_scores_gemma":[0.0037380597,0.000765773,0.0015084852,0.0034898806,0.00084567926,0.0032150154,0.0016861791,0.0021850117,0.0036194234],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008655635,0.00007592134,0.0018273884,0.002305847,0.00019623394,0.000106798856,0.00012717438,0.04488207,0.002445442,0.06476428,0.033200208,0.84998214],"study_design_scores_gemma":[0.00002996319,0.00019570353,0.0022454604,0.0013398803,0.00016604875,0.00084159645,0.00017827925,0.5063791,0.005387288,0.17998444,0.3031155,0.00013669026],"about_ca_topic_score_codex":0.0041235574,"about_ca_topic_score_gemma":0.003912446,"teacher_disagreement_score":0.0053374884,"about_ca_system_score_codex":0.00092382735,"about_ca_system_score_gemma":0.0016074246,"threshold_uncertainty_score":0.017855644},"labels":[],"label_agreement":null},{"id":"W4416894713","doi":"10.1007/s10915-025-03140-4","title":"Reduced biquaternion tensors and applications in color video processing","year":2025,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Singular value decomposition; Compression (physics); Inverse; Tensor decomposition; Tensor product; Quaternion; Data compression","score_opus":0.03259310032987307,"score_gpt":0.34666795804203515,"score_spread":0.3140748577121621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416894713","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020471057,0.0033928757,0.9663317,0.0010574049,0.00043258647,0.000043891727,0.00043441833,0.0006120003,0.007224015],"genre_scores_gemma":[0.22574429,0.007931634,0.74575794,0.00037601206,0.00054148375,0.000079425336,0.00084736024,0.00052176137,0.018200202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998031,0.000056036384,0.00001646328,0.0000333934,0.0000732439,0.000017675395],"domain_scores_gemma":[0.99925715,0.00018556396,0.00010138465,0.00011315098,0.0002864906,0.000056267734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004853684,0.0008091828,0.000550867,0.0018031304,0.00034495248,0.001294047,0.00058818737,0.00059962645,0.005079661],"category_scores_gemma":[0.0017635596,0.0002789967,0.00044754596,0.002453978,0.0006699807,0.0013568586,0.0006119877,0.0012301181,0.0011761385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016238044,0.0001305803,0.0007612045,0.00047780576,0.00006154597,0.00019713727,0.00026600048,0.063408956,0.047991987,0.49952236,0.017078606,0.36994147],"study_design_scores_gemma":[0.000014744177,0.00006150912,0.00093277823,0.000056929723,0.000042647906,0.00035474045,0.00013096702,0.75490165,0.014354246,0.19672757,0.03236489,0.000057328805],"about_ca_topic_score_codex":0.0022567818,"about_ca_topic_score_gemma":0.0026042724,"teacher_disagreement_score":0.005079661,"about_ca_system_score_codex":0.00044851034,"about_ca_system_score_gemma":0.00056185725,"threshold_uncertainty_score":0.016993165},"labels":[],"label_agreement":null},{"id":"W4417229947","doi":"10.1109/iccv51701.2025.00026","title":"Generalized Tensor-Based Parameter-Efficient Fine-Tuning via Lie Group Transformations","year":2025,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Lie group; Generalization; Range (aeronautics); Algebra over a field; Group (periodic table); Core (optical fiber)","score_opus":0.03789521035149982,"score_gpt":0.316367237721002,"score_spread":0.27847202736950216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417229947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071739727,0.00010915069,0.9905481,0.00007684114,0.000027096192,0.000020801579,0.000027136794,0.0010321382,0.0009847905],"genre_scores_gemma":[0.41958863,0.00031806473,0.57306534,0.0002614112,0.000099833655,0.00018922743,0.00033587412,0.0010088276,0.005132754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950635,0.00014570188,0.000025036099,0.00011628736,0.00014963266,0.00005697839],"domain_scores_gemma":[0.9990434,0.0003503323,0.000105307474,0.00027077855,0.00015745497,0.00007273984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578511,0.0014036596,0.0011216401,0.00062388193,0.00047530033,0.00086635776,0.0014174681,0.0010624299,0.0028251775],"category_scores_gemma":[0.0041752453,0.0005614838,0.000875882,0.0005592848,0.0011321903,0.0017262939,0.0017847143,0.0018723452,0.0017300055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013254191,0.00007738913,0.00068215345,0.0001253181,0.000093600414,0.00011562485,0.00021373184,0.75618136,0.018969709,0.036220986,0.004156786,0.18303083],"study_design_scores_gemma":[0.000005067647,0.00001904643,0.000039204042,0.00000416523,0.000003889385,0.000019836743,0.000008571614,0.9865893,0.0014120246,0.011098869,0.00079266424,0.0000073431097],"about_ca_topic_score_codex":0.0037225217,"about_ca_topic_score_gemma":0.005505216,"teacher_disagreement_score":0.0037225217,"about_ca_system_score_codex":0.0005879435,"about_ca_system_score_gemma":0.00109911,"threshold_uncertainty_score":0.009451151},"labels":[],"label_agreement":null},{"id":"W4417303627","doi":"10.1093/jrsssa/qnaf180","title":"Tensor time series change-point detection in cryptocurrency network data","year":2025,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series A (Statistics in Society)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cryptocurrency; Asset (computer security); Identification (biology); Time series; Tensor (intrinsic definition); Investment (military); Series (stratigraphy)","score_opus":0.03837087813339109,"score_gpt":0.3270443071994469,"score_spread":0.2886734290660558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417303627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69969857,0.0042684097,0.26798528,0.002356661,0.0005088446,0.00019746699,0.015806356,0.005356482,0.0038219949],"genre_scores_gemma":[0.93138456,0.000536788,0.051703602,0.00012009431,0.0001444649,0.000058437163,0.014838505,0.0001386806,0.0010748485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829453,0.0006678216,0.00012961094,0.00044610223,0.00031745463,0.00014448089],"domain_scores_gemma":[0.9928387,0.00335536,0.0011875681,0.0013590528,0.000940066,0.000319261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034812747,0.0009392085,0.00065971515,0.002363189,0.00047577175,0.0013572979,0.00087292923,0.0009220154,0.001461224],"category_scores_gemma":[0.017559139,0.00027229165,0.00079564267,0.002276126,0.00067166466,0.0015192718,0.00092953286,0.0014567337,0.0007122766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016808063,0.0004239723,0.16971427,0.0007645367,0.00073933013,0.0008928951,0.00035638688,0.51019824,0.011659586,0.015852919,0.029265104,0.25845203],"study_design_scores_gemma":[0.000024887453,0.00005310448,0.017752482,0.000034743665,0.000037996782,0.00011643759,0.00007192035,0.9691723,0.0020698288,0.0073916665,0.003240256,0.000034373752],"about_ca_topic_score_codex":0.011559053,"about_ca_topic_score_gemma":0.009414973,"teacher_disagreement_score":0.011559053,"about_ca_system_score_codex":0.000947549,"about_ca_system_score_gemma":0.0007067227,"threshold_uncertainty_score":0.022983491},"labels":[],"label_agreement":null},{"id":"W50112468","doi":"10.1016/b978-012763560-6/50033-7","title":"Review of Chemometrics Applied to SpectroscopyMultiway Analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kimberly-Clark (Canada)","funders":"","keywords":"Chemometrics; Table (database); Sample (material); Computer science; Exploratory analysis; Matrix (chemical analysis); Mathematics; Algorithm; Data mining; Chemistry; Data science; Machine learning; Chromatography","score_opus":0.039577036984552415,"score_gpt":0.3257568773955276,"score_spread":0.2861798404109752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50112468","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011653936,0.8167081,0.16703992,0.0014246778,0.0022731314,0.00004166295,0.00022317686,0.00056214735,0.010561847],"genre_scores_gemma":[0.013066329,0.7799863,0.17335132,0.0015394392,0.0052233073,0.00013450245,0.0007513873,0.0003538997,0.025593422],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992113,0.0001757417,0.00007710782,0.00013934156,0.00035809513,0.000038458635],"domain_scores_gemma":[0.9988398,0.00046288152,0.00007690968,0.00009274362,0.00048806667,0.000039587103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014327528,0.001320476,0.0018581102,0.0038413831,0.0005438539,0.0017781596,0.0015746461,0.0010385276,0.0062128697],"category_scores_gemma":[0.0021465684,0.0008268625,0.00080602797,0.009118206,0.00075143884,0.0027110248,0.0008760911,0.0015667948,0.004927324],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033597225,0.000067581364,0.00020145999,0.0028972442,0.00012447718,0.000090740636,0.00006476658,0.0030410325,0.004759997,0.028252983,0.06320947,0.8972567],"study_design_scores_gemma":[0.000010582368,0.000082483864,0.001263841,0.000604811,0.00009502186,0.0009466156,0.000052451138,0.010588023,0.004096806,0.06588485,0.91630185,0.000072716815],"about_ca_topic_score_codex":0.001116623,"about_ca_topic_score_gemma":0.0017354062,"teacher_disagreement_score":0.0062128697,"about_ca_system_score_codex":0.0006711176,"about_ca_system_score_gemma":0.0010895956,"threshold_uncertainty_score":0.02078408},"labels":[],"label_agreement":null},{"id":"W6893652806","doi":"10.5281/zenodo.4259498","title":"Ver!]linea.The Christmas Yule Blog (2020) completa Pelicula En Español Castellano ktq","year":2020,"lang":"es","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Entertainment; Illusion; Fandom; Entertainment industry; Movie theater","score_opus":0.05585241675540491,"score_gpt":0.2840178163549411,"score_spread":0.2281653995995362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893652806","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063009135,0.0005969728,0.00030002568,0.00074364897,0.0014823044,0.00008802587,0.01585167,0.0041135065,0.9761938],"genre_scores_gemma":[0.002473881,0.00045803766,0.0003369603,0.00038253056,0.00016537245,0.000048078924,0.0073071597,0.0032281403,0.98559976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984574,0.000008941201,0.000004565025,0.000024054467,0.00006535546,0.000051422696],"domain_scores_gemma":[0.99933976,0.000041105184,0.000018022565,0.00006524724,0.0002789443,0.00025687064],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022518991,0.0006679874,0.00043961487,0.00084384275,0.0015105667,0.0041768476,0.0006601813,0.00084376434,0.86402625],"category_scores_gemma":[0.000993982,0.00033269625,0.00036198687,0.001228704,0.00025928428,0.0025600255,0.0022121125,0.0013113156,0.8009464],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020905907,0.0000068788195,0.00006390792,0.000057089914,7.526797e-7,0.000023706423,0.000054936198,0.000009630047,0.00012624587,0.00056173606,0.9827691,0.01630529],"study_design_scores_gemma":[0.0000053669237,0.0000030891392,0.00037826117,0.000034842284,6.354332e-7,0.000015911575,0.000085457075,0.000008572591,0.000055678025,0.00006604341,0.9993424,0.0000037337754],"about_ca_topic_score_codex":0.024108559,"about_ca_topic_score_gemma":0.06668443,"teacher_disagreement_score":0.13597375,"about_ca_system_score_codex":0.0010025654,"about_ca_system_score_gemma":0.0008336337,"threshold_uncertainty_score":0.19395006},"labels":[],"label_agreement":null},{"id":"W6901662748","doi":"10.60692/9y50s-36c35","title":"Latent Space Model for Higher-order Networks and Generalized Tensor Decomposition","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multilinear map; Convergence (economics); Gradient descent; Smoothness; Kernel (algebra); Space (punctuation); Tensor (intrinsic definition); Estimation theory; Position (finance)","score_opus":0.08092565154312945,"score_gpt":0.2920905471584668,"score_spread":0.21116489561533733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901662748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029395698,0.0001439652,0.99551517,0.00022850957,0.00003115004,0.000014640275,0.00013839031,0.00010822095,0.0008804227],"genre_scores_gemma":[0.3491866,0.0015926576,0.6321248,0.00043563804,0.00041697992,0.00044910633,0.0013175099,0.0003508028,0.014125958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840635,0.00069341005,0.00007249712,0.0004021678,0.0002671667,0.00015840429],"domain_scores_gemma":[0.9970348,0.001132437,0.0006442956,0.00060786534,0.00039024127,0.00019034483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002369447,0.001711595,0.0011400149,0.0017500968,0.00071583386,0.0021199458,0.002157737,0.00157305,0.004123469],"category_scores_gemma":[0.006269632,0.00056480634,0.0016821272,0.0024014567,0.0019441443,0.004712001,0.0019539087,0.003072529,0.0012491697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029139024,0.000038520226,0.0010534134,0.000104945764,0.0000719269,0.00013817691,0.0002008933,0.2439761,0.0016307372,0.72796357,0.0030515238,0.021741023],"study_design_scores_gemma":[0.000003868958,0.000015808073,0.00019606494,0.00001244803,0.000010286804,0.000042284148,0.0000205122,0.7790631,0.00022636064,0.21819514,0.002199423,0.000014682311],"about_ca_topic_score_codex":0.0060205446,"about_ca_topic_score_gemma":0.0062799077,"teacher_disagreement_score":0.0060205446,"about_ca_system_score_codex":0.0017139799,"about_ca_system_score_gemma":0.0017180061,"threshold_uncertainty_score":0.013794422},"labels":[],"label_agreement":null},{"id":"W6930631928","doi":"10.5281/zenodo.14930623","title":"ThrombUS+ D6.1: Product Design Specifications","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"European Commission","keywords":"Deliverable; Process (computing); Software; Systems design; System requirements; Bridging (networking); Product design specification; Functional requirement; System integration","score_opus":0.16061277608706934,"score_gpt":0.32191101234719377,"score_spread":0.16129823626012443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930631928","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014721401,0.007410017,0.46687624,0.0041095447,0.0026716616,0.0060732267,0.06375891,0.0335092,0.40086976],"genre_scores_gemma":[0.08495641,0.010263777,0.33762452,0.0037889557,0.0006907766,0.01118251,0.11974524,0.018165657,0.41358218],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937156,0.0007210766,0.00040503565,0.00046901734,0.004246424,0.00044289493],"domain_scores_gemma":[0.9927348,0.00079234026,0.000503361,0.0007718403,0.004878444,0.00031930307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058551235,0.0018680771,0.0010118826,0.0027584224,0.0008257256,0.003749875,0.0028565424,0.0022163347,0.06870663],"category_scores_gemma":[0.010898235,0.0011105372,0.001109983,0.001451773,0.00048348965,0.002293911,0.0017580397,0.0018946356,0.06830413],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066908094,0.00035728718,0.0013232594,0.00452587,0.000058576094,0.0009291457,0.00096656085,0.018355254,0.10538686,0.042167895,0.4791985,0.34606174],"study_design_scores_gemma":[0.000039104638,0.0003153814,0.0004751035,0.00021136057,0.000023876708,0.00036627855,0.00009855865,0.0022710578,0.011665913,0.0026019167,0.98188573,0.000045756293],"about_ca_topic_score_codex":0.0043991166,"about_ca_topic_score_gemma":0.0032733835,"teacher_disagreement_score":0.06870663,"about_ca_system_score_codex":0.0027884408,"about_ca_system_score_gemma":0.003856336,"threshold_uncertainty_score":0.2298466},"labels":[],"label_agreement":null},{"id":"W6930810905","doi":"10.5281/zenodo.15004090","title":"The Role of Artificial Intelligence (AI) and machine learning in social work practice","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Social work; Software deployment; Big data; Predictive analytics; Applications of artificial intelligence; Equity (law); Analytics","score_opus":0.06323048399475065,"score_gpt":0.3260768415748816,"score_spread":0.262846357580131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930810905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11981395,0.10288998,0.31404045,0.23464599,0.0013594604,0.00030403995,0.00015454419,0.00037474028,0.22641689],"genre_scores_gemma":[0.8924422,0.02190415,0.07772733,0.0036667897,0.0011654863,0.00023527071,0.000036831072,0.00006400565,0.0027579167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9815059,0.014541713,0.00051066757,0.0008953674,0.002022398,0.0005239226],"domain_scores_gemma":[0.92157686,0.06960147,0.0029627327,0.002858374,0.0015930336,0.0014075685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021101806,0.0006137547,0.0007146125,0.0042090113,0.0023883316,0.010747916,0.0012457317,0.0031178854,0.0024757276],"category_scores_gemma":[0.027963,0.0004371058,0.0004748959,0.003484661,0.025344547,0.009335013,0.0054512704,0.0032258234,0.00035450276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003318564,0.0001136405,0.007461125,0.0007216967,0.0000679671,0.00014754794,0.008082609,0.006528396,0.00034029846,0.8278388,0.0029509955,0.14571375],"study_design_scores_gemma":[0.000013392317,0.00005316329,0.0033001702,0.00081899686,0.0000124718745,0.00011627477,0.0037009462,0.011960532,0.00020465188,0.95464694,0.025123933,0.000048483063],"about_ca_topic_score_codex":0.0047586425,"about_ca_topic_score_gemma":0.0035175069,"teacher_disagreement_score":0.021101806,"about_ca_system_score_codex":0.0051180106,"about_ca_system_score_gemma":0.0068314015,"threshold_uncertainty_score":0.11159831},"labels":[],"label_agreement":null},{"id":"W6931190166","doi":"10.5281/zenodo.4374396","title":"Gillenia trifoliata Moench 1794","year":2007,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Taxon; Lauraceae; Bark (sound); Genus; Vitis vinifera","score_opus":0.07399852000351889,"score_gpt":0.3152555322707648,"score_spread":0.2412570122672459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931190166","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35968485,0.016824117,0.006611042,0.0018288854,0.0013773281,0.00045621913,0.01225365,0.0026424744,0.5983215],"genre_scores_gemma":[0.8363375,0.0051556067,0.0037713975,0.00074357336,0.0002043893,0.0001202985,0.0056588827,0.00016366401,0.14784476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99990845,0.0000055493297,0.000009276961,0.000029148427,0.000029014967,0.000018587369],"domain_scores_gemma":[0.99991596,0.000010528235,0.000026302736,0.0000051895704,0.00002235501,0.000019606312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006222524,0.0009826903,0.00045096682,0.0017559194,0.00097283634,0.00029084162,0.0004354263,0.00043022702,0.023087554],"category_scores_gemma":[0.00018239269,0.00019124577,0.00024202553,0.0007694073,0.0002491603,0.00082596164,0.0005709708,0.0005449758,0.0121407695],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004936486,0.00020913033,0.018842915,0.0009085724,0.00013565908,0.004127788,0.0015660577,0.0006079775,0.14004025,0.0049025984,0.065011546,0.76315385],"study_design_scores_gemma":[0.00009864955,0.0006905781,0.2891966,0.00034772797,0.00026251338,0.019379959,0.0015341812,0.0007133785,0.013785017,0.0016946705,0.6722026,0.00009414221],"about_ca_topic_score_codex":0.008824562,"about_ca_topic_score_gemma":0.019568104,"teacher_disagreement_score":0.023087554,"about_ca_system_score_codex":0.0003755082,"about_ca_system_score_gemma":0.00020539392,"threshold_uncertainty_score":0.07723558},"labels":[],"label_agreement":null},{"id":"W6932013645","doi":"10.5683/sp3/h1fmza","title":"Navigating challenges in applied animal behaviour and welfare research: A focus group study","year":2024,"lang":"en","type":"dataset","venue":"Borealis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Focus group; Animal welfare; Thematic analysis; Prejudice (legal term); Welfare; Ethology","score_opus":0.17675256655781238,"score_gpt":0.42686968442336815,"score_spread":0.2501171178655558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6932013645","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92472464,0.0007654667,0.0141188055,0.0027482475,0.0001318039,0.007164393,0.038242873,0.00023691033,0.01186686],"genre_scores_gemma":[0.7197101,0.0021044083,0.08443532,0.0042739036,0.0002017718,0.09747785,0.07316457,0.00041635902,0.01821568],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99508506,0.003380239,0.0003193937,0.000438898,0.00040845037,0.000367858],"domain_scores_gemma":[0.98120636,0.013737186,0.0008104402,0.0012108014,0.0023571753,0.0006780429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01740317,0.0004260281,0.00061478006,0.0023525055,0.003279217,0.0013788817,0.0019430519,0.0015554271,0.0056772493],"category_scores_gemma":[0.020211697,0.00033937054,0.000389133,0.0028071469,0.0013524785,0.0019591118,0.0028383932,0.0011583561,0.0022527464],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016711826,0.0029636903,0.060948428,0.0054546585,0.00008013831,0.002641343,0.6638798,0.0008807106,0.009948291,0.008480186,0.10200598,0.14104562],"study_design_scores_gemma":[0.0004868924,0.0008098696,0.091662824,0.0020559963,0.000090136156,0.0009729016,0.5213976,0.002024118,0.0048727356,0.0040947036,0.3713191,0.00021317136],"about_ca_topic_score_codex":0.011812537,"about_ca_topic_score_gemma":0.029314423,"teacher_disagreement_score":0.01740317,"about_ca_system_score_codex":0.0023714933,"about_ca_system_score_gemma":0.0028957522,"threshold_uncertainty_score":0.09203786},"labels":[],"label_agreement":null},{"id":"W6957967604","doi":"10.60692/a08zx-tj103","title":"Latent Space Model for Higher-order Networks and Generalized Tensor Decomposition","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multilinear map; Convergence (economics); Gradient descent; Smoothness; Kernel (algebra); Space (punctuation); Tensor (intrinsic definition); Estimation theory; Position (finance)","score_opus":0.08092565154312945,"score_gpt":0.2920905471584668,"score_spread":0.21116489561533733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957967604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029395698,0.0001439652,0.99551517,0.00022850957,0.00003115004,0.000014640275,0.00013839031,0.00010822095,0.0008804227],"genre_scores_gemma":[0.3491866,0.0015926576,0.6321248,0.00043563804,0.00041697992,0.00044910633,0.0013175099,0.0003508028,0.014125958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840635,0.00069341005,0.00007249712,0.0004021678,0.0002671667,0.00015840429],"domain_scores_gemma":[0.9970348,0.001132437,0.0006442956,0.00060786534,0.00039024127,0.00019034483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002369447,0.001711595,0.0011400149,0.0017500968,0.00071583386,0.0021199458,0.002157737,0.00157305,0.004123469],"category_scores_gemma":[0.006269632,0.00056480634,0.0016821272,0.0024014567,0.0019441443,0.004712001,0.0019539087,0.003072529,0.0012491697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029139024,0.000038520226,0.0010534134,0.000104945764,0.0000719269,0.00013817691,0.0002008933,0.2439761,0.0016307372,0.72796357,0.0030515238,0.021741023],"study_design_scores_gemma":[0.000003868958,0.000015808073,0.00019606494,0.00001244803,0.000010286804,0.000042284148,0.0000205122,0.7790631,0.00022636064,0.21819514,0.002199423,0.000014682311],"about_ca_topic_score_codex":0.0060205446,"about_ca_topic_score_gemma":0.0062799077,"teacher_disagreement_score":0.0060205446,"about_ca_system_score_codex":0.0017139799,"about_ca_system_score_gemma":0.0017180061,"threshold_uncertainty_score":0.013794422},"labels":[],"label_agreement":null},{"id":"W6991873386","doi":"","title":"Invariance Des Spectres De Parole Par Analyse Des Correlations Canoniques.","year":2022,"lang":"fr","type":"article","venue":"Canadian acoustics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Noise (video); Signal processing; Invariant (physics)","score_opus":0.03273695194616575,"score_gpt":0.27801337494420425,"score_spread":0.2452764229980385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991873386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31908864,0.0021176462,0.63566154,0.0013517522,0.0004893577,0.000065472464,0.00087541464,0.00087743485,0.03947271],"genre_scores_gemma":[0.9211829,0.0014704273,0.04750749,0.00015338212,0.0003248896,0.00007168379,0.0006559162,0.00056294206,0.028070282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895895,0.0002755109,0.000029604564,0.0002856084,0.0003066335,0.0001436299],"domain_scores_gemma":[0.9973827,0.0012427835,0.0003122463,0.00033579452,0.00047774226,0.00024870192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012996602,0.0009463658,0.0006012136,0.0017643598,0.00071532273,0.0022480418,0.00071691873,0.0007956753,0.00885265],"category_scores_gemma":[0.008079364,0.00047915103,0.0007877823,0.0007940249,0.002855528,0.0022194393,0.0009490258,0.0028387506,0.0016659152],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005591573,0.00011627167,0.004793004,0.0002521984,0.00016936767,0.00087552535,0.001942624,0.03348851,0.0905729,0.7433033,0.007416636,0.11651047],"study_design_scores_gemma":[0.00006616,0.00022463046,0.051227488,0.00012560398,0.00007503454,0.0012368127,0.0010965026,0.46422812,0.019394362,0.43770337,0.024355888,0.00026591553],"about_ca_topic_score_codex":0.0138916755,"about_ca_topic_score_gemma":0.009378377,"teacher_disagreement_score":0.0138916755,"about_ca_system_score_codex":0.0011926532,"about_ca_system_score_gemma":0.0009188766,"threshold_uncertainty_score":0.029615104},"labels":[],"label_agreement":null},{"id":"W7019412825","doi":"","title":"A Generation Curtailed: The Lifespans of Canada’s Pensioned Veterans of the Great War","year":2023,"lang":"en","type":"article","venue":"Scholars Commons (Wilfrid Laurier University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Life expectancy; Veterans Affairs; Pension; Sample (material); Spanish Civil War; World War II; Centenarian; Expectancy theory; Longevity; Iraq war","score_opus":0.04813212946130725,"score_gpt":0.2550902827799052,"score_spread":0.20695815331859796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019412825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986709,0.0022300747,0.0001025829,0.0017775797,0.000033449378,0.000009906759,0.0033353535,0.000005340755,0.0057967715],"genre_scores_gemma":[0.9967013,0.00094951777,0.0000980317,0.00012240333,0.000009391699,0.000004414202,0.00086432154,0.000003844955,0.0012467875],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99965465,0.000035061865,0.000008649765,0.000042253825,0.00007810259,0.00018125864],"domain_scores_gemma":[0.99853206,0.00011608917,0.00020016578,0.00006466822,0.00058575196,0.00050124107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006881892,0.00017313226,0.00019126984,0.0017635697,0.0025464236,0.0017867117,0.00061306154,0.00030654104,0.002092677],"category_scores_gemma":[0.0038871267,0.000089257876,0.00019319696,0.0027500861,0.0009082759,0.0006472422,0.0010735329,0.00075628,0.0001884392],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038461474,0.000037435482,0.88286275,0.00006607809,0.00009405572,0.00049562537,0.025178758,0.00066111656,0.00033325178,0.0069204946,0.01544834,0.067517474],"study_design_scores_gemma":[0.000005453644,0.00003259908,0.9643853,0.00010384618,0.000025733996,0.00022590795,0.017740058,0.00047415897,0.00011444953,0.0009951143,0.015866373,0.000030968567],"about_ca_topic_score_codex":0.96653336,"about_ca_topic_score_gemma":0.9764965,"teacher_disagreement_score":0.033466637,"about_ca_system_score_codex":0.014988973,"about_ca_system_score_gemma":0.014202104,"threshold_uncertainty_score":0.108753145},"labels":[],"label_agreement":null},{"id":"W7020846328","doi":"","title":"Modelisation Autoregressive Evolutive et Reconnaissance de La Parole","year":2022,"lang":"en","type":"article","venue":"Canadian acoustics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Autoregressive model; Noise (video); Artificial neural network; Statistical analysis","score_opus":0.03586592211283805,"score_gpt":0.32109746527646815,"score_spread":0.2852315431636301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020846328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044079814,0.0007901455,0.9511811,0.00042024482,0.00020449645,0.000041457515,0.00039127047,0.00077062595,0.0021208157],"genre_scores_gemma":[0.72371215,0.0015919266,0.24366102,0.00014866552,0.0001748777,0.00017512837,0.0013994413,0.00046256935,0.02867432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994313,0.0001372383,0.000019952511,0.00016666473,0.00018452977,0.00006031397],"domain_scores_gemma":[0.9991007,0.00046062,0.00007364643,0.000088075845,0.00024476202,0.00003232407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692805,0.0009856517,0.00070474675,0.0006478103,0.0005112628,0.0013780757,0.0008627607,0.0010396097,0.00191589],"category_scores_gemma":[0.0025580234,0.000588652,0.0009633762,0.0006437847,0.00089412736,0.00081191346,0.00049919327,0.0016865669,0.00092122337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001664804,0.000037203485,0.0015274894,0.00011563741,0.000066548324,0.00023480608,0.00021634837,0.81132907,0.026391346,0.01884503,0.002698341,0.1383716],"study_design_scores_gemma":[0.000003986284,0.000012287545,0.0011291305,0.000008559719,0.0000046038804,0.00004306316,0.000019053767,0.9940369,0.0016419527,0.0014334421,0.001652291,0.000014699745],"about_ca_topic_score_codex":0.13778915,"about_ca_topic_score_gemma":0.09255076,"teacher_disagreement_score":0.13778915,"about_ca_system_score_codex":0.0016869362,"about_ca_system_score_gemma":0.0020277896,"threshold_uncertainty_score":0.27397424},"labels":[],"label_agreement":null},{"id":"W7021353060","doi":"","title":"No Borders: Bridging Cultures Through Yuri's Night","year":2013,"lang":"en","type":"article","venue":"Scholarly Commons (Embry–Riddle Aeronautical University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Summit; Human spaceflight; Spaceflight; Space Science; Mars Exploration Program; Observatory; Space Shuttle; Space research; International Space Station; Planetarium","score_opus":0.03709070729928195,"score_gpt":0.28537330905762004,"score_spread":0.2482826017583381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021353060","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6187238,0.010610842,0.0066212704,0.05733422,0.0034108937,0.00010887631,0.00014860481,0.00029895265,0.30274254],"genre_scores_gemma":[0.97248906,0.0012684983,0.0013490525,0.0054657054,0.00012016735,0.00005849204,0.000076017546,0.00015587379,0.01901695],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99551165,0.0025819952,0.00007756704,0.00033145983,0.0003463897,0.0011509451],"domain_scores_gemma":[0.9943129,0.00095290114,0.0003321264,0.00067464984,0.00060556567,0.0031218498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005961326,0.00036554557,0.0005506171,0.0006969918,0.02821682,0.0144330785,0.001919051,0.0020819393,0.008915015],"category_scores_gemma":[0.006463226,0.00047300974,0.00049561483,0.0009022897,0.018347483,0.012497371,0.029194362,0.0061520794,0.0014208218],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009857996,0.00007630036,0.006329349,0.00015244387,0.000027584636,0.00056979596,0.82949996,0.0000829374,0.0007453341,0.07475584,0.043801706,0.043860145],"study_design_scores_gemma":[0.000012120578,0.000063359796,0.006520241,0.00024790847,0.000012353978,0.00021077054,0.67071825,0.00012608065,0.00022999135,0.011670327,0.31013754,0.00005100618],"about_ca_topic_score_codex":0.017200794,"about_ca_topic_score_gemma":0.039982617,"teacher_disagreement_score":0.02821682,"about_ca_system_score_codex":0.0066689155,"about_ca_system_score_gemma":0.0070129246,"threshold_uncertainty_score":0.048386574},"labels":[],"label_agreement":null},{"id":"W7023781497","doi":"","title":"Perceptions and Experiences of Precarious Employment in Canadian Libraries: An Exploratory Study","year":2019,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Exploratory research; Perception; Qualitative research; Context (archaeology); Unemployment","score_opus":0.03270478531237649,"score_gpt":0.30612802125821703,"score_spread":0.27342323594584056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023781497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885656,0.00070967106,0.000063560896,0.001965089,0.000038254824,0.000049584145,0.00021680091,0.000007853795,0.008383543],"genre_scores_gemma":[0.99613804,0.00067688746,0.000082470884,0.0004625772,0.000011334163,0.00002168071,0.00007471322,0.000007823754,0.002524502],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99479926,0.0009620894,0.00021197923,0.00023935694,0.0015803948,0.002206779],"domain_scores_gemma":[0.98671573,0.0023260799,0.00149406,0.00021914886,0.0032321624,0.0060128905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004400332,0.00039549352,0.0007760034,0.0038490763,0.020545159,0.007799735,0.0021638162,0.0013249769,0.0072574574],"category_scores_gemma":[0.0130606145,0.00053113897,0.00041981175,0.0055995844,0.0066646333,0.0022458802,0.0068142596,0.0022963055,0.0006091203],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019023153,0.00015871732,0.070813596,0.00017456192,0.0000197726,0.0007683011,0.9075669,0.000050871877,0.00030275312,0.00146855,0.0040246155,0.014461229],"study_design_scores_gemma":[0.00000478976,0.000034139346,0.044703424,0.00012392129,0.000007542044,0.00008674795,0.94728047,0.000043548782,0.000046322257,0.00010184917,0.0075326604,0.000034562203],"about_ca_topic_score_codex":0.95297587,"about_ca_topic_score_gemma":0.97380495,"teacher_disagreement_score":0.9594771,"about_ca_system_score_codex":0.0405229,"about_ca_system_score_gemma":0.07771781,"threshold_uncertainty_score":0.29401565},"labels":[],"label_agreement":null},{"id":"W7024201596","doi":"","title":"The Return of the ‘Children of Nature’: Spectacle and Environment during Banff's Indian Days","year":2011,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Spectacle; Indigenous; Population; Interpretation (philosophy); The arts; Metis","score_opus":0.004843349630708185,"score_gpt":0.18357284638772065,"score_spread":0.17872949675701247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024201596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7194717,0.005853537,0.0004541189,0.054662343,0.00230875,0.00008957477,0.00030770272,0.00012861121,0.21672373],"genre_scores_gemma":[0.9445173,0.001541435,0.000250823,0.0055314526,0.00039222467,0.00006254807,0.000077866236,0.00012241905,0.047503974],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99681276,0.0012881274,0.000036879992,0.00019141492,0.00046177523,0.0012090778],"domain_scores_gemma":[0.99609804,0.0015684857,0.00020136357,0.0001874904,0.00038340507,0.0015611295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036095695,0.0005131258,0.00053521676,0.0011601814,0.032158136,0.007987175,0.0018404295,0.0034600762,0.01258358],"category_scores_gemma":[0.0046693333,0.0003858916,0.00032893498,0.0013049124,0.014953104,0.0029647113,0.012208862,0.006250526,0.00072667067],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055729844,0.000028269997,0.0018992941,0.00011022204,0.000008575775,0.001963078,0.94512075,0.000021280985,0.000691285,0.006533657,0.032819588,0.010748342],"study_design_scores_gemma":[0.0000045825163,0.0000229558,0.0060243513,0.00012611924,0.0000069831462,0.0005764001,0.7913279,0.00001396153,0.00022652154,0.00042349676,0.20121765,0.000029106657],"about_ca_topic_score_codex":0.23839279,"about_ca_topic_score_gemma":0.49578813,"teacher_disagreement_score":0.7616072,"about_ca_system_score_codex":0.011536395,"about_ca_system_score_gemma":0.007877477,"threshold_uncertainty_score":0.47401035},"labels":[],"label_agreement":null},{"id":"W7066531101","doi":"","title":"Hyperspectral Remote Sensing in environmental monitoring: Detailed mapping of asbestos concrete sheeting and in illegal stocking area","year":2001,"lang":"en","type":"other","venue":"Università Politecnica delle Marche (Università Politecnica delle Marche)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hyperspectral imaging; Asbestos; Stocking; Environmental impact assessment","score_opus":0.03605143161819343,"score_gpt":0.2616197812352539,"score_spread":0.2255683496170605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066531101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6843594,0.011074495,0.19552824,0.0066898637,0.0004687141,0.00028541413,0.0062879534,0.0022698424,0.09303611],"genre_scores_gemma":[0.8204983,0.0068684565,0.12565134,0.000260957,0.00029383757,0.00007739001,0.0036667765,0.00021191106,0.042471077],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99989974,0.000025259875,0.0000024401718,0.000019947895,0.000041473802,0.000011195178],"domain_scores_gemma":[0.9999113,0.000030310926,0.000007164709,0.000010075165,0.000028221197,0.000012896894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037003012,0.00040477965,0.00011458561,0.0007489014,0.00017181909,0.0003678472,0.00026552202,0.00030464903,0.002921296],"category_scores_gemma":[0.00025711893,0.00013533315,0.00009260198,0.00096574484,0.00022581819,0.00041183317,0.00028098706,0.00019804366,0.0008135514],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003146897,0.00037237132,0.03518189,0.00024710986,0.00006152306,0.0002993883,0.00025798782,0.038702358,0.053317305,0.0034489562,0.061365917,0.8064305],"study_design_scores_gemma":[0.00011067287,0.00026989367,0.35294974,0.00017454695,0.00014549075,0.00064247916,0.0008884766,0.47459257,0.06223702,0.012627625,0.095298134,0.00006333741],"about_ca_topic_score_codex":0.016719747,"about_ca_topic_score_gemma":0.050970048,"teacher_disagreement_score":0.016719747,"about_ca_system_score_codex":0.00023389529,"about_ca_system_score_gemma":0.00036072446,"threshold_uncertainty_score":0.03324485},"labels":[],"label_agreement":null},{"id":"W7066807569","doi":"","title":"Jam and the Playground Kids 1-26-08 - Chugger's Ottawa - 2nd Set","year":2008,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Shakedown; Crew; Set (abstract data type)","score_opus":0.01157354339207301,"score_gpt":0.2209620117175749,"score_spread":0.2093884683255019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066807569","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045801806,0.00059524504,0.0004726484,0.005801664,0.0028848653,0.00010912076,0.003281803,0.0015946173,0.98067987],"genre_scores_gemma":[0.0030843865,0.00016537242,0.00021495156,0.0002016535,0.00004484812,0.00001747803,0.00035112593,0.00018984576,0.9957302],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958235,0.000026273507,0.0000067232886,0.00005571232,0.0001131127,0.00021591428],"domain_scores_gemma":[0.99884534,0.00003795316,0.000017348588,0.000052036758,0.00025424972,0.00079300924],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042103234,0.0010484738,0.0004941947,0.0007861617,0.0070436997,0.003499645,0.0009180886,0.0014799407,0.706009],"category_scores_gemma":[0.00080693513,0.00073906494,0.00043751975,0.0006069014,0.0008829865,0.0018333907,0.004112159,0.0023359337,0.38966253],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004559873,0.000035082867,0.00033617168,0.000024236548,0.0000014218551,0.0000692239,0.00022989998,0.000016269321,0.00018726329,0.0009320949,0.98417974,0.013942982],"study_design_scores_gemma":[0.000007207612,0.000019073635,0.0019499401,0.00004612984,0.0000023125112,0.000037710015,0.0013417266,0.000028363504,0.00012782135,0.00021279852,0.99621946,0.0000075729877],"about_ca_topic_score_codex":0.21296172,"about_ca_topic_score_gemma":0.68492365,"teacher_disagreement_score":0.29399103,"about_ca_system_score_codex":0.003297244,"about_ca_system_score_gemma":0.004873919,"threshold_uncertainty_score":0.42344433},"labels":[],"label_agreement":null},{"id":"W7093294535","doi":"10.5281/zenodo.17424833","title":"Phyllium Illiger 1798","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Espace pour la vie","funders":"","keywords":"Natural (archaeology); Type (biology); Sequence (biology); Subject (documents)","score_opus":0.0453343932041289,"score_gpt":0.29963466726476845,"score_spread":0.25430027406063954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093294535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48240656,0.021680977,0.009756223,0.0025140916,0.0010593694,0.00032870215,0.009493153,0.00171299,0.4710479],"genre_scores_gemma":[0.9416897,0.0037454572,0.0034618634,0.001705247,0.0001903806,0.00016835416,0.0039298874,0.00011680051,0.044992257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99989164,0.000008048982,0.000008432044,0.00003827845,0.00002687778,0.000026693882],"domain_scores_gemma":[0.9998808,0.000023454388,0.000050103114,0.000010895244,0.000020322215,0.000014558593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013132462,0.00045946726,0.00028600916,0.0014545497,0.0011655177,0.00034968354,0.0005831218,0.0007958899,0.009385547],"category_scores_gemma":[0.00042592577,0.00018033775,0.00014516395,0.00072877406,0.0004623089,0.0010634961,0.0010968627,0.00059023005,0.0042710197],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011438285,0.00015715897,0.047397822,0.0013730564,0.00010410324,0.0034334972,0.0020147075,0.0011840083,0.19660443,0.012841023,0.07165971,0.66208667],"study_design_scores_gemma":[0.00015373158,0.00039669816,0.28386804,0.0005913734,0.0001545212,0.0054842033,0.0008989136,0.00063380727,0.010029761,0.0026798728,0.6950631,0.00004596246],"about_ca_topic_score_codex":0.005644868,"about_ca_topic_score_gemma":0.006487387,"teacher_disagreement_score":0.009385547,"about_ca_system_score_codex":0.00083312875,"about_ca_system_score_gemma":0.0002274954,"threshold_uncertainty_score":0.03139782},"labels":[],"label_agreement":null},{"id":"W7096339246","doi":"","title":"Relationship between gradient and EM steps in latent variable models. http://www.cs.toronto.edu/rsalakhu/ecg","year":2003,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Latent variable; Variable (mathematics); Expectation–maximization algorithm; Matrix (chemical analysis); Maximization; Latent variable model; Exponential family; Space (punctuation)","score_opus":0.09110083922928318,"score_gpt":0.30819416600430055,"score_spread":0.21709332677501736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096339246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022117628,0.0008042207,0.9932596,0.00061275926,0.000029124705,0.000037657257,0.00009409589,0.000568132,0.0023826282],"genre_scores_gemma":[0.15429054,0.0016276413,0.8355006,0.0005687583,0.00013877949,0.00036637927,0.00058428745,0.00077977084,0.006143257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792767,0.0014773075,0.00007606935,0.00022887402,0.00023506682,0.000055104112],"domain_scores_gemma":[0.98599666,0.011901093,0.0003278453,0.0009372408,0.00064871163,0.00018851491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048678424,0.0011851257,0.00087635237,0.0009333796,0.0005340839,0.0015162894,0.001998928,0.0020772526,0.006229417],"category_scores_gemma":[0.034012582,0.0010869018,0.00055663957,0.0015195467,0.0014820321,0.0048324727,0.002421453,0.0035069094,0.0023168295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021118407,0.00015047022,0.0029890349,0.00036100717,0.00016645786,0.00020925865,0.0003845847,0.14432587,0.0013238103,0.5306116,0.0197471,0.2995197],"study_design_scores_gemma":[0.000030792668,0.000034555454,0.00045783105,0.00004171639,0.000021440115,0.00011278281,0.000032321506,0.5311929,0.0013979005,0.461313,0.005337478,0.000027305365],"about_ca_topic_score_codex":0.0028071483,"about_ca_topic_score_gemma":0.00584817,"teacher_disagreement_score":0.006229417,"about_ca_system_score_codex":0.0011608762,"about_ca_system_score_gemma":0.0012113728,"threshold_uncertainty_score":0.025743902},"labels":[],"label_agreement":null},{"id":"W7104381216","doi":"10.55016/ojs/cdm.v19i4.73644","title":"On the permanent of an even-dimensional non-negative polystochastic tensor of order n","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Hypercube; Order (exchange); Transversal (combinatorics); Tensor (intrinsic definition); Conjecture","score_opus":0.014606741465860275,"score_gpt":0.32863195459669126,"score_spread":0.314025213130831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104381216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52200764,0.00023714923,0.4549366,0.00049820996,0.00013072004,0.00011173979,0.0005841779,0.0013611786,0.020132575],"genre_scores_gemma":[0.8164717,0.00018557224,0.1745351,0.00010223477,0.00008212461,0.000083377956,0.0008977497,0.00033189016,0.007310266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999584,0.00006108702,0.000022860668,0.00008973903,0.00012489842,0.00011734799],"domain_scores_gemma":[0.99863064,0.0005964053,0.00019675688,0.00027711733,0.0001710122,0.0001280683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007083143,0.00056389056,0.00051295734,0.0009155937,0.0009158354,0.0009879618,0.0006235461,0.00038148588,0.006237108],"category_scores_gemma":[0.002688332,0.00025233513,0.0006952122,0.0005966912,0.0013613208,0.0027130703,0.0011777859,0.00074371276,0.0010336495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014476256,0.00031490895,0.0126693165,0.00068636803,0.00010086806,0.0013444747,0.000929164,0.1134186,0.09022079,0.5485081,0.013063106,0.21729663],"study_design_scores_gemma":[0.00007928772,0.00043875558,0.0034510668,0.00006994141,0.0000720352,0.0009032634,0.00051666173,0.44376746,0.047266297,0.49258956,0.010719873,0.00012580391],"about_ca_topic_score_codex":0.000862427,"about_ca_topic_score_gemma":0.0014226943,"teacher_disagreement_score":0.006237108,"about_ca_system_score_codex":0.000703214,"about_ca_system_score_gemma":0.0009602074,"threshold_uncertainty_score":0.020865262},"labels":[],"label_agreement":null},{"id":"W7111141754","doi":"10.1002/cpe.70477","title":"QTTARNN: A Highly‐Efficient Attention Driven Quantized Tensor Train Recursive Neural Network for Cyber‐Physical‐Social Intelligence","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Artificial neural network; Lossless compression; Quantization (signal processing); Action (physics); Feature (linguistics); Recurrent neural network; Pattern recognition (psychology)","score_opus":0.0520028463967384,"score_gpt":0.4057809311656086,"score_spread":0.3537780847688702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111141754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04781524,0.0017874531,0.94106835,0.0004918859,0.00030693345,0.00010083082,0.0003643382,0.004205123,0.003859809],"genre_scores_gemma":[0.74020755,0.00088981236,0.24608798,0.00040341442,0.0001276002,0.00018735707,0.0015542604,0.00021841054,0.010323583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979585,0.000034691682,0.000014301681,0.00006199518,0.00005609816,0.00003705886],"domain_scores_gemma":[0.9997621,0.000056133787,0.000024433251,0.000033791253,0.00010601364,0.000017438975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041308982,0.00075404305,0.00061879423,0.00032929235,0.00029702703,0.0005518518,0.001489355,0.0006822399,0.0020425976],"category_scores_gemma":[0.0011577014,0.00030767443,0.00052957336,0.0004638691,0.00031316737,0.00094569655,0.0006685427,0.0011519766,0.00055388774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019538487,0.00015875229,0.0014073696,0.0001414765,0.0001085689,0.000147215,0.00007493736,0.6067804,0.012370414,0.0059991563,0.011501988,0.3611144],"study_design_scores_gemma":[0.000003233498,0.000012869703,0.00006677691,0.000002260499,0.0000043042087,0.000005689293,0.0000025767943,0.9985637,0.0005717815,0.0004465288,0.0003175281,0.0000027865165],"about_ca_topic_score_codex":0.02470099,"about_ca_topic_score_gemma":0.023535162,"teacher_disagreement_score":0.02470099,"about_ca_system_score_codex":0.00083080906,"about_ca_system_score_gemma":0.0009984305,"threshold_uncertainty_score":0.049114466},"labels":[],"label_agreement":null},{"id":"W7116731441","doi":"10.1016/j.neucom.2025.132509","title":"BERTC: A new Bayesian exponential regularized tensor completion method for sparse geomagnetic time series data","year":2025,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Missing data; Imputation (statistics); Inference; Gibbs sampling; Bayesian probability; Exponential function; Earth's magnetic field; Bayesian inference; Tensor (intrinsic definition)","score_opus":0.06373881699590099,"score_gpt":0.3618240771956584,"score_spread":0.2980852601997574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116731441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014179277,0.00023187246,0.9962218,0.00018530681,0.00013550447,0.00004940919,0.00032506173,0.001017882,0.00041526774],"genre_scores_gemma":[0.043810975,0.0006459029,0.943939,0.00038762914,0.00036951553,0.0002462171,0.0028049212,0.0008562178,0.0069396254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998686,0.0003730473,0.000070029106,0.00023647923,0.0005239766,0.00011055709],"domain_scores_gemma":[0.99743587,0.000647371,0.0001821325,0.00043304445,0.0010625533,0.00023900851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026432087,0.0016242409,0.001551457,0.0014131226,0.00069750944,0.0014363623,0.003196566,0.0019029758,0.005254697],"category_scores_gemma":[0.0069002463,0.000776482,0.0014369068,0.0018010477,0.0009620045,0.0021434429,0.0023138786,0.0034965752,0.0037823138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064361084,0.00031381074,0.0011332089,0.00045884238,0.00029431292,0.00019143382,0.00013495306,0.27585027,0.016071256,0.03993596,0.0591689,0.6058035],"study_design_scores_gemma":[0.00002216571,0.000031736774,0.00016168655,0.000013721222,0.000013688769,0.00004679008,0.000008836541,0.9855117,0.0015299389,0.006058887,0.006575211,0.000025627824],"about_ca_topic_score_codex":0.015297165,"about_ca_topic_score_gemma":0.018066019,"teacher_disagreement_score":0.015297165,"about_ca_system_score_codex":0.0008097844,"about_ca_system_score_gemma":0.0037649255,"threshold_uncertainty_score":0.03041625},"labels":[],"label_agreement":null},{"id":"W7117971241","doi":"10.1145/3712285.3787161","title":"10.1145/3712285.3787161","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Tensor (intrinsic definition); Matrix (chemical analysis); Calculus (dental); Algebra over a field","score_opus":0.019201946371351596,"score_gpt":0.2524649987642014,"score_spread":0.23326305239284983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117971241","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027999165,0.008023184,0.024750277,0.0025127411,0.0032341902,0.00044695052,0.026133878,0.029384082,0.9027148],"genre_scores_gemma":[0.007770227,0.004169953,0.004545436,0.0010397527,0.0002798278,0.000288306,0.015539083,0.0044996594,0.9618679],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897814,0.000080433965,0.00009107254,0.00028121562,0.00035750493,0.00021164949],"domain_scores_gemma":[0.99806124,0.00041074015,0.000110440946,0.00078201626,0.00036829239,0.00026733734],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021219582,0.0041028038,0.0028534662,0.0032934789,0.0028434952,0.0057429527,0.0033716836,0.005136345,0.9262808],"category_scores_gemma":[0.004319761,0.002248535,0.0015806253,0.010876028,0.0018079258,0.012665862,0.0074173203,0.0035481602,0.9536587],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003108006,0.00020270195,0.0006269441,0.00071514543,0.000059519796,0.00022718465,0.00011795737,0.001170551,0.00132383,0.017008694,0.6591969,0.3190397],"study_design_scores_gemma":[0.00004901569,0.000034998007,0.00070655026,0.0003120487,0.00005448502,0.00017105056,0.00009297729,0.0016123739,0.0007583706,0.0048977206,0.9912743,0.000036095917],"about_ca_topic_score_codex":0.016644143,"about_ca_topic_score_gemma":0.01189905,"teacher_disagreement_score":0.0737192,"about_ca_system_score_codex":0.0033237578,"about_ca_system_score_gemma":0.001443314,"threshold_uncertainty_score":0.105151474},"labels":[],"label_agreement":null},{"id":"W7117996326","doi":"10.1145/3712285.3787162","title":"10.1145/3712285.3787162","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Computation; Tensor (intrinsic definition); Matrix (chemical analysis); Sparse matrix; Sparse approximation","score_opus":0.019229452592024673,"score_gpt":0.2525451610166294,"score_spread":0.2333157084246047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117996326","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025500818,0.007249192,0.021550896,0.00231188,0.0030820174,0.0004625096,0.02565976,0.028895132,0.90823853],"genre_scores_gemma":[0.0065013203,0.0036617706,0.004004875,0.0010394496,0.0002574141,0.00029948796,0.013714586,0.004159605,0.96636146],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990114,0.00007654821,0.00008813713,0.00027757112,0.00033777667,0.00020858108],"domain_scores_gemma":[0.99801254,0.00042016106,0.00011759022,0.0007838701,0.00037456688,0.00029134238],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002168374,0.00428048,0.0029356286,0.0033279813,0.002866826,0.0057273456,0.0035033906,0.005335064,0.93834615],"category_scores_gemma":[0.004187653,0.002297129,0.001613721,0.010692633,0.0017823059,0.012890162,0.00728659,0.003581919,0.9611965],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031725777,0.00021510222,0.0006185141,0.0007131536,0.00005880556,0.00023109782,0.00011304355,0.0010530861,0.001301986,0.015112292,0.67040646,0.3098592],"study_design_scores_gemma":[0.00005213523,0.000037544396,0.00070198585,0.00031828452,0.000053849562,0.00017235015,0.000092632006,0.0014125287,0.0007290033,0.004290552,0.9921015,0.00003758104],"about_ca_topic_score_codex":0.01631366,"about_ca_topic_score_gemma":0.012393451,"teacher_disagreement_score":0.061653852,"about_ca_system_score_codex":0.0034316906,"about_ca_system_score_gemma":0.001435945,"threshold_uncertainty_score":0.08794165},"labels":[],"label_agreement":null},{"id":"W7118019666","doi":"10.1145/3712285.3787185","title":"10.1145/3712285.3787185","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Computation; Tensor (intrinsic definition); Matrix (chemical analysis); Sparse matrix; Sparse approximation","score_opus":0.019182302056395324,"score_gpt":0.25242911844298876,"score_spread":0.23324681638659345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118019666","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028358325,0.008095969,0.024094362,0.0029551857,0.003600215,0.00045998947,0.026913136,0.03011541,0.9009298],"genre_scores_gemma":[0.0074556647,0.0042740605,0.004521492,0.0010942157,0.00030567916,0.00028641892,0.014636445,0.0045797797,0.9628462],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892896,0.00008858834,0.00009866038,0.00028131923,0.00038402638,0.00021838886],"domain_scores_gemma":[0.9978649,0.0004704806,0.00012347133,0.00083998544,0.00040694262,0.00029421604],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0022735095,0.00429064,0.0031071585,0.003427123,0.0028949745,0.00628,0.0035225716,0.0055332673,0.92324114],"category_scores_gemma":[0.004549028,0.002245329,0.0017131837,0.0116016045,0.0018551633,0.01362695,0.00734381,0.0037909695,0.94899863],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000317367,0.00020884398,0.0006180058,0.0007366007,0.00006222422,0.00022244624,0.0001124808,0.0011847693,0.0013158863,0.016961291,0.6730887,0.3051714],"study_design_scores_gemma":[0.000047471847,0.000033959972,0.0006731482,0.00029626614,0.00005244346,0.00016113304,0.000089416135,0.0015998052,0.0007487697,0.005198473,0.9910652,0.000033888216],"about_ca_topic_score_codex":0.017313119,"about_ca_topic_score_gemma":0.012849181,"teacher_disagreement_score":0.07675886,"about_ca_system_score_codex":0.0036889638,"about_ca_system_score_gemma":0.0015382196,"threshold_uncertainty_score":0.10948712},"labels":[],"label_agreement":null},{"id":"W7126377487","doi":"10.19086/da.143834","title":"discreteness-of-asymptotic-tensor-ranks","year":2025,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Novo Nordisk Fonden; Université de Genève; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Novo Nordisk; National Centres of Competence in Research SwissMAP; Centre de Recherches Mathématiques; Erasmus+; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Villum Fonden; National Science Foundation","keywords":"Tensor (intrinsic definition); Rank (graph theory); Asymptotic analysis; Dimension (graph theory); Asymptotic analysis; Symmetric tensor; Asymptotology; Tensor product; Upper and lower bounds","score_opus":0.02302623577288685,"score_gpt":0.3527443798883812,"score_spread":0.3297181441154943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126377487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1259466,0.0242871,0.49633214,0.01703061,0.0053191027,0.000047805537,0.002211941,0.0010300665,0.3277946],"genre_scores_gemma":[0.8710075,0.007232376,0.0511455,0.0032637618,0.006161712,0.00008491501,0.00115996,0.0006511035,0.059293207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883777,0.0003221226,0.000059364516,0.00028971728,0.0003539475,0.00013703154],"domain_scores_gemma":[0.9983348,0.0005922337,0.00018637796,0.0003604051,0.0003573415,0.0001687556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181086,0.0006973359,0.0005868761,0.0014587465,0.0010602872,0.003428742,0.0006627056,0.00090914307,0.010018639],"category_scores_gemma":[0.0058778664,0.0003851793,0.00092343043,0.0012868869,0.0038103703,0.0076489644,0.0015179015,0.0029832814,0.0026841327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019415307,0.000008104101,0.00019163263,0.000027797567,0.0000048130237,0.000027846068,0.00011650873,0.0005206793,0.00029538127,0.98819554,0.0054003415,0.0051920144],"study_design_scores_gemma":[0.0000030660117,0.000009287463,0.000299846,0.000012125086,0.0000034867066,0.00008354142,0.000043430216,0.0026236784,0.00016920098,0.9850734,0.01166804,0.000010908503],"about_ca_topic_score_codex":0.0010112735,"about_ca_topic_score_gemma":0.0011102294,"teacher_disagreement_score":0.010018639,"about_ca_system_score_codex":0.0018815607,"about_ca_system_score_gemma":0.00052789564,"threshold_uncertainty_score":0.03351569},"labels":[],"label_agreement":null},{"id":"W7128252154","doi":"10.1080/03610918.2025.2519508","title":"Best linear unbiased prediction in the two-way error components model with <i>AR</i> (1) error processes","year":2025,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Component (thermodynamics); Best linear unbiased prediction; Mean squared prediction error; Mean squared error; Error analysis","score_opus":0.20194550759334612,"score_gpt":0.45851666510818984,"score_spread":0.2565711575148437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128252154","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00664726,0.0002418616,0.9923294,0.00011525654,0.00002007982,0.000008319002,0.000035081568,0.00012998992,0.00047272758],"genre_scores_gemma":[0.54235464,0.001458626,0.4485528,0.00024723748,0.00013000832,0.00015222927,0.00054099,0.00023820854,0.0063252454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997675,0.0013425349,0.00006756544,0.0003351726,0.0003913822,0.00018836657],"domain_scores_gemma":[0.99459827,0.0041834163,0.0003342247,0.0003845564,0.00043383508,0.00006564588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039008935,0.0009291166,0.0011401077,0.00045806263,0.00043673473,0.0012819666,0.0008476861,0.001154241,0.0014419045],"category_scores_gemma":[0.0133124525,0.00052454363,0.0005685705,0.0011225133,0.0011833964,0.0018603597,0.0012278581,0.0019060605,0.00083073543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015186756,0.000036815374,0.001845704,0.00015853248,0.00008248019,0.00013607455,0.00016073594,0.85956305,0.0019471732,0.06540691,0.0013890904,0.06912162],"study_design_scores_gemma":[0.0000064406736,0.000031040676,0.0003432825,0.0000144134765,0.000012122303,0.000033944485,0.000012345114,0.97657394,0.001192866,0.021173963,0.00059153954,0.000014069589],"about_ca_topic_score_codex":0.0058388063,"about_ca_topic_score_gemma":0.004735299,"teacher_disagreement_score":0.0058388063,"about_ca_system_score_codex":0.00044977118,"about_ca_system_score_gemma":0.0015708198,"threshold_uncertainty_score":0.02063018},"labels":[],"label_agreement":null},{"id":"W7129641361","doi":"10.1007/978-3-031-94050-7_5","title":"Some Stein-Rule Methods in Tensor Regression Model with High-Dimensional Data","year":2025,"lang":"en","type":"book-chapter","venue":"Emerging topics in statistics and biostatistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Estimator; Tensor (intrinsic definition); Asymptotic distribution; Regression analysis; Regression; Linear regression; Estimation theory","score_opus":0.08582428767296793,"score_gpt":0.404576303532234,"score_spread":0.31875201585926605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7129641361","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012420041,0.0030045526,0.99180424,0.00047717773,0.00025011852,0.000016776165,0.00006529369,0.000109089706,0.0030307698],"genre_scores_gemma":[0.04266277,0.0098162675,0.9213826,0.0005472573,0.0015400664,0.00021872554,0.00041944053,0.0005495402,0.02286328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972045,0.0016137926,0.00018783762,0.00035807374,0.00056123163,0.00007456723],"domain_scores_gemma":[0.990235,0.0066120406,0.00037382334,0.0010873709,0.001447794,0.00024394142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009844695,0.0024100188,0.0016043824,0.0017304808,0.00084554474,0.0019908254,0.0029445034,0.0023637984,0.0045635463],"category_scores_gemma":[0.024952305,0.0011044971,0.0025193947,0.003259074,0.003235088,0.004597306,0.0023551402,0.0054054493,0.0021546194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028843277,0.000057436697,0.00041478485,0.00025294692,0.00007651856,0.00014041046,0.00020205612,0.036974397,0.0008698556,0.8622798,0.012693924,0.08600895],"study_design_scores_gemma":[0.0000074153822,0.000031742828,0.00022031808,0.000051523843,0.000028846216,0.0000927308,0.000025461579,0.25587404,0.00045919218,0.73349327,0.0096740015,0.0000414575],"about_ca_topic_score_codex":0.003919164,"about_ca_topic_score_gemma":0.0042721536,"teacher_disagreement_score":0.009844695,"about_ca_system_score_codex":0.0014320716,"about_ca_system_score_gemma":0.0014092824,"threshold_uncertainty_score":0.0520643},"labels":[],"label_agreement":null},{"id":"W7133392047","doi":"","title":"More Efficient Estimation of Multivariate Additive Models Based on Tensor Decomposition and Penalization","year":2024,"lang":"en","type":"article","venue":"CityU Scholars","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Shenzhen Research Institute, City University of Hong Kong; Fujian Normal University; Shanghai University of Finance and Economics; Yunnan University; National Natural Science Foundation of China; Hong Kong Polytechnic University; City University of Hong Kong; National Science Foundation","keywords":"Estimator; Additive model; Multivariate statistics; Spline (mechanical); Nonparametric statistics; Tensor decomposition; Nonparametric regression; Tensor (intrinsic definition); Regression; Convergence (economics)","score_opus":0.03504824305842081,"score_gpt":0.3512575918807643,"score_spread":0.3162093488223435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133392047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036613632,0.0000761897,0.99596304,0.000069108704,0.000012659711,0.000008513564,0.00001846772,0.000046022844,0.00014464167],"genre_scores_gemma":[0.2146008,0.0009395231,0.7808605,0.00014344342,0.00016306469,0.0001631238,0.00036259723,0.00017426482,0.0025926447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997888,0.0013974544,0.00008747219,0.0002648984,0.00026357896,0.000098583136],"domain_scores_gemma":[0.995235,0.0031695336,0.00052715244,0.0004990232,0.0004499283,0.00011942397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004525563,0.0013980484,0.0013000173,0.0011423951,0.0004207609,0.0011292901,0.0012821344,0.0009386485,0.0013454272],"category_scores_gemma":[0.012897797,0.00055105286,0.0018719148,0.0016428799,0.0009820599,0.0018221741,0.0013870127,0.001881729,0.00043163705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112703834,0.00014242182,0.0035558222,0.00023645116,0.00025374367,0.0002414788,0.00025036078,0.7283832,0.00842522,0.12316673,0.0018013329,0.13343048],"study_design_scores_gemma":[0.0000028808768,0.000018716362,0.0001615748,0.0000054154984,0.000010517969,0.000019923655,0.000006469208,0.9912787,0.0004116063,0.0076705776,0.00040393704,0.0000095329815],"about_ca_topic_score_codex":0.0038839232,"about_ca_topic_score_gemma":0.0035631845,"teacher_disagreement_score":0.004525563,"about_ca_system_score_codex":0.0005386996,"about_ca_system_score_gemma":0.0013637182,"threshold_uncertainty_score":0.023933709},"labels":[],"label_agreement":null},{"id":"W7139957918","doi":"10.23919/cnc-usnc-ursi64444.2025.11420190","title":"Tensor-Train Accelerated Solution of 3D Vector Volume Integral Equation Solutions with logN Complexity","year":2025,"lang":"","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Integral equation; Volume (thermodynamics); Work (physics); Computational complexity theory","score_opus":0.1517021373210687,"score_gpt":0.3398519330851733,"score_spread":0.18814979576410462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139957918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024747346,0.00013218517,0.9651822,0.00019317129,0.000055555603,0.00004829646,0.00012308727,0.0009887507,0.008529403],"genre_scores_gemma":[0.30156222,0.00027246933,0.6866895,0.00010774619,0.000051524523,0.00021124327,0.0005218109,0.0004927446,0.010090706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997607,0.000058223486,0.000010884599,0.000017337448,0.00012364045,0.000029361412],"domain_scores_gemma":[0.99929965,0.00030261622,0.000049837596,0.000095551164,0.0002139809,0.00003844707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042366216,0.0005521054,0.00049206417,0.0003080416,0.00034815722,0.0007842578,0.00086496794,0.00061898475,0.0059155957],"category_scores_gemma":[0.0017980712,0.00021669047,0.00038817432,0.00051359826,0.00043071536,0.0009357076,0.00077695015,0.0008240219,0.0017528813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025717533,0.00011911832,0.0013956849,0.00031250916,0.00004799605,0.00031878927,0.00031148148,0.7094542,0.01872536,0.11006452,0.008642063,0.15035117],"study_design_scores_gemma":[0.0000055789087,0.000008104439,0.000038757516,0.0000030798612,0.0000014016877,0.000020045982,0.000015157441,0.99367464,0.0011749497,0.0036797808,0.0013760203,0.000002621181],"about_ca_topic_score_codex":0.0038681652,"about_ca_topic_score_gemma":0.005167385,"teacher_disagreement_score":0.0059155957,"about_ca_system_score_codex":0.0005136937,"about_ca_system_score_gemma":0.00083339075,"threshold_uncertainty_score":0.019789577},"labels":[],"label_agreement":null},{"id":"W79536630","doi":"10.1007/978-3-642-21946-7_22","title":"Classification of Clinical Gene-Sample-Time Microarray Expression Data via Tensor Decomposition Methods","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Discriminative model; Computer science; Curse of dimensionality; Microarray analysis techniques; Tensor (intrinsic definition); Gene chip analysis; Data mining; Sample (material); Pattern recognition (psychology); Artificial intelligence; Expression (computer science); Microarray; Computational biology; Gene; Gene expression; Mathematics; Biology; Genetics","score_opus":0.18378938951214358,"score_gpt":0.4423257245730031,"score_spread":0.25853633506085955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79536630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035872653,0.0024699653,0.9556792,0.0008062927,0.00025171705,0.00011791542,0.002439189,0.0012963718,0.0010666582],"genre_scores_gemma":[0.31939763,0.0037377551,0.6564265,0.00041308734,0.0007068507,0.0005067644,0.0132453265,0.00046945352,0.005096591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813014,0.00055078854,0.0001762329,0.00047105356,0.00048911216,0.0001826431],"domain_scores_gemma":[0.99736315,0.0012840062,0.0003514228,0.00041645698,0.0004677389,0.00011724158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034315556,0.0013111244,0.0014875613,0.0021460452,0.000353429,0.0018201882,0.0011224722,0.00080269756,0.001366101],"category_scores_gemma":[0.0057568583,0.00040462668,0.002205007,0.0028127946,0.00057930907,0.0011489114,0.0009984871,0.0017856744,0.0014494557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049506046,0.00035420278,0.015709471,0.00053430593,0.0004661099,0.00025743354,0.0002942564,0.04494605,0.043894522,0.00879508,0.01892322,0.8653302],"study_design_scores_gemma":[0.00003844335,0.00029590412,0.016990874,0.000099353565,0.00025173792,0.0007776372,0.00019689312,0.9043323,0.013986802,0.049371153,0.013551988,0.000107013206],"about_ca_topic_score_codex":0.0016269013,"about_ca_topic_score_gemma":0.002064629,"teacher_disagreement_score":0.0034315556,"about_ca_system_score_codex":0.0005455904,"about_ca_system_score_gemma":0.0008887588,"threshold_uncertainty_score":0.018148005},"labels":[],"label_agreement":null}]}