{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":314,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":314,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"a544a3ad79b2","filters":{"topic":"Tensor decomposition and applications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1375780814057204,"gpt":0.2808541760111277,"spread":0.1432760946054072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002081968,0.0002084487,0.0002726377,0.0003045065,0.0001451369,0.00003274114,0.0003468344,0.0003048707,0.000111831],"category_scores_gemma":[0.00006025322,0.0002560662,0.0002085335,0.000326481,0.00007519213,0.00008213268,0.000255738,0.0003048415,0.00007583068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001769123,"about_ca_system_score_gemma":0.00006749854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001595143,"about_ca_topic_score_gemma":0.00009819836,"domain_scores_codex":[0.9988334,0.00005736435,0.0002512748,0.0005886856,0.00003621653,0.0002330912],"domain_scores_gemma":[0.9987154,0.0002580383,0.0001909362,0.0005578882,0.0001875047,0.00009023834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006528467,0.000367848,0.002546031,0.0003781336,0.00009666773,0.000008536099,0.0004787626,0.005790415,0.000125149,0.974498,0.01540658,0.0002385973],"study_design_scores_gemma":[0.0005741592,0.00003215964,0.0007693234,0.0001019451,0.00009625556,0.000001080559,0.00009786253,0.2020524,0.0001161088,0.7926654,0.003273191,0.0002200942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.807194,0.00002928574,0.1847373,0.00007755363,0.000354826,0.001193044,0.0003109114,0.0003588774,0.005744167],"genre_scores_gemma":[0.9951166,0.00003728747,0.002563295,0.00002157155,0.0001883734,0.00001629997,0.0001434099,0.0000338228,0.001879376],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.196262,"threshold_uncertainty_score":0.9999892,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04617564812377155,"gpt":0.3387440814574338,"spread":0.2925684333336622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001054219,0.0001277233,0.0002024353,0.00008113407,0.0004325487,0.0001106986,0.0004025876,0.0001061567,0.00001943105],"category_scores_gemma":[0.0002224235,0.0001216841,0.00009517216,0.00005530517,0.00006124991,0.0005729284,0.0001607262,0.0001072175,0.000008993285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005218715,"about_ca_system_score_gemma":0.00003361018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001901425,"about_ca_topic_score_gemma":0.000002801538,"domain_scores_codex":[0.9990804,0.00001647833,0.0003787069,0.0001043027,0.0002323614,0.0001877304],"domain_scores_gemma":[0.9983214,0.000050901,0.0004871624,0.0009314107,0.0001532296,0.00005592322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001644022,0.0002521779,0.002715284,0.0004218693,0.0001553408,0.000002042348,0.001736483,0.01163785,0.5847843,0.3945181,0.001380987,0.002231073],"study_design_scores_gemma":[0.0006498418,0.00003584302,0.001451284,0.0001024195,0.0001135287,0.00002016302,0.00006554313,0.3212379,0.08557114,0.5904824,0.00006149125,0.000208523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9207059,0.000006925893,0.07775263,0.0008462829,0.00007438031,0.0002691985,0.0000865968,0.00005687558,0.0002012611],"genre_scores_gemma":[0.9243941,0.000002767418,0.07538478,0.0001163825,0.00002266644,0.000001351006,0.00004339369,0.00001379201,0.00002073145],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4992132,"threshold_uncertainty_score":0.4962133,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06577836543410738,"gpt":0.2018170692429524,"spread":0.136038703808845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008344729,0.00008881825,0.0001054605,0.00005550701,0.0001735112,0.00001853551,0.0001345181,0.00003893668,0.000102852],"category_scores_gemma":[0.00002691825,0.00008457383,0.00004109289,0.0002285056,0.00005159728,0.00008419004,0.0000277419,0.0001175342,0.0001744044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002286998,"about_ca_system_score_gemma":0.000009580657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007945066,"about_ca_topic_score_gemma":0.00001495044,"domain_scores_codex":[0.9994862,0.00005398913,0.00006663259,0.0002203922,0.00003527142,0.0001374779],"domain_scores_gemma":[0.9994015,0.0001623392,0.00006606441,0.0002374139,0.00005793585,0.00007474646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002037237,0.00006204598,0.003769926,0.00001197342,0.00002001672,0.000009940987,0.0000909045,0.003139101,0.0004826366,0.9915556,0.0005792181,0.0002582041],"study_design_scores_gemma":[0.003613111,0.00062052,0.008296711,0.0001294376,0.0003450164,0.00007661017,0.001915746,0.2122107,0.00262775,0.7280676,0.04089757,0.001199254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8193685,9.00252e-7,0.1592748,0.00009582216,0.00001163494,0.00007147824,9.081593e-7,0.0001986696,0.02097719],"genre_scores_gemma":[0.9914671,0.00000472968,0.002664822,0.00006221112,0.00002720093,5.035972e-7,0.000002921125,0.00001416755,0.005756347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2634881,"threshold_uncertainty_score":0.344882,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0299515621861944,"gpt":0.2749004509657065,"spread":0.2449488887795121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001551716,0.0001333289,0.000161093,0.00008415165,0.0002683251,0.0002443716,0.0001210886,0.00006560201,0.00002772908],"category_scores_gemma":[0.00005351768,0.00007586898,0.00003067468,0.0002092687,0.00004030655,0.00136182,0.00001547426,0.0001124781,0.0000817624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000399409,"about_ca_system_score_gemma":0.00002321743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004396355,"about_ca_topic_score_gemma":7.81373e-7,"domain_scores_codex":[0.9990035,0.00004216063,0.0004173829,0.0001040777,0.0002296001,0.0002032601],"domain_scores_gemma":[0.9990889,0.0001102254,0.0002919359,0.0001566099,0.000277405,0.00007492276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005784621,0.0003874547,0.01985731,0.003375005,0.0002052212,0.00001350836,0.009406214,0.03855144,0.008542766,0.2038516,0.03488109,0.6803499],"study_design_scores_gemma":[0.004883871,0.0003786591,0.003346145,0.001901266,0.0001113659,0.0006051345,0.003489473,0.8813927,0.0009205582,0.001762939,0.09984813,0.001359819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3188981,0.00008443402,0.6677238,0.00209285,0.0002263445,0.0009374184,0.00001167202,0.001463049,0.008562432],"genre_scores_gemma":[0.9971181,0.000003350365,0.001494639,0.0001522205,0.00009295138,0.0001060258,0.00001337823,0.00001603032,0.001003342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8428412,"threshold_uncertainty_score":0.3093847,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1726492887982786,"gpt":0.3975729216675088,"spread":0.2249236328692302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007592998,0.0001356824,0.0001614546,0.00007431974,0.0001861792,0.00004519797,0.00007659361,0.00006699499,0.00002513782],"category_scores_gemma":[0.0000803528,0.0001243167,0.00004207693,0.0001629407,0.00005713776,0.0001842572,0.00002694536,0.00009219618,0.000009539226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001695878,"about_ca_system_score_gemma":0.000009878861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009152199,"about_ca_topic_score_gemma":0.00000245581,"domain_scores_codex":[0.9991607,0.00006141332,0.0002706428,0.0002656854,0.0001014718,0.0001400935],"domain_scores_gemma":[0.9990053,0.0004331473,0.0001609984,0.0000890282,0.0002387098,0.00007285023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007350257,0.001737236,0.003670254,0.0003485278,0.0003331292,0.00000576795,0.02877957,0.0005578255,0.07601921,0.7557341,0.004926171,0.1271532],"study_design_scores_gemma":[0.001987238,0.0003164922,0.03009033,0.00002483074,0.00008204331,0.00001768981,0.0004367405,0.4588183,0.03351755,0.4740111,0.0002544835,0.0004432471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3891712,0.00000893898,0.6089992,0.0003590835,0.00005750165,0.0009008448,0.00007696944,0.0001869402,0.0002393402],"genre_scores_gemma":[0.8630536,0.000002911891,0.136439,0.00007558136,0.00004867012,0.0001375295,0.0001716955,0.00001956809,0.00005145999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4738823,"threshold_uncertainty_score":0.5069489,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09733683784065719,"gpt":0.3323194751487582,"spread":0.234982637308101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007221166,0.00007544325,0.0001239065,0.000006841816,0.0007232548,0.00006921052,0.000382986,0.00002839492,0.00001355149],"category_scores_gemma":[0.00002642397,0.00005499196,0.00008600157,0.00002174808,0.0001415926,0.00007250208,0.00009217268,0.00008776405,0.0001023171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009676922,"about_ca_system_score_gemma":0.00001060914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007214821,"about_ca_topic_score_gemma":0.000001686614,"domain_scores_codex":[0.9994642,0.00001394968,0.0001480873,0.0001119556,0.0001494014,0.0001124691],"domain_scores_gemma":[0.9987245,0.00008402886,0.0002009871,0.0008641311,0.00009118093,0.00003522135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000114392,0.00008253209,0.0000112747,0.00001535666,0.00001779156,2.510902e-7,0.0003066782,0.00005348883,0.02768821,0.9575034,0.01106444,0.003245137],"study_design_scores_gemma":[0.0004353846,0.00002679712,0.0009012308,0.000036596,0.00004106611,0.000002239862,0.0001515427,0.1772124,0.001283941,0.8074093,0.01233564,0.0001639488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9162561,0.00001606393,0.02013728,0.004285887,0.0001695965,0.000660641,0.0001334613,0.000240899,0.05810006],"genre_scores_gemma":[0.9894441,0.00001005085,0.009777341,0.0001186773,0.00005731058,0.00000835617,0.000002014539,0.00002685757,0.0005553191],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1771589,"threshold_uncertainty_score":0.5562764,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1837728275548551,"gpt":0.2707740633260801,"spread":0.08700123577122498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001163287,0.0001281363,0.0001807409,0.00006837463,0.0002189248,0.0000404675,0.0002926126,0.00008020906,0.0001161005],"category_scores_gemma":[0.0001074699,0.0001471594,0.00008669618,0.00026056,0.00005755688,0.0002471622,0.00008724804,0.0000886274,0.00005462419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000694356,"about_ca_system_score_gemma":0.00007470127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005433128,"about_ca_topic_score_gemma":0.00005376671,"domain_scores_codex":[0.9990271,0.00006352637,0.0001807465,0.0004932064,0.00006183164,0.0001735418],"domain_scores_gemma":[0.9985329,0.0002717503,0.0001637474,0.0006632081,0.0002841867,0.00008420607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000164034,0.001065135,0.0006733726,0.0002436392,0.0001950582,0.0001319194,0.0004790751,0.02028877,0.002145711,0.9444041,0.0268404,0.003368815],"study_design_scores_gemma":[0.002750711,0.00007312406,0.003120783,0.00008348847,0.0002866593,0.0000280953,0.0006680407,0.8778567,0.002095445,0.1052716,0.007260991,0.0005043073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6061443,0.00001222547,0.3919813,0.0004940052,0.00009260503,0.0003770302,0.0003410882,0.0001916602,0.0003657955],"genre_scores_gemma":[0.98773,0.00001043276,0.009809606,0.00009593836,0.00007564349,0.000002645133,0.001033054,0.00002053908,0.001222201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.857568,"threshold_uncertainty_score":0.6000984,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1697865211088342,"gpt":0.3558426370773456,"spread":0.1860561159685115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003130082,0.0002193679,0.0002374432,0.0001483829,0.0004874653,0.0001127513,0.0004242036,0.0001186407,0.000004277739],"category_scores_gemma":[0.000007708683,0.0002218468,0.00008602383,0.000275813,0.00001915605,0.0001505345,0.000007093954,0.0003504943,0.00004245756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006594015,"about_ca_system_score_gemma":0.00003990635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001193332,"about_ca_topic_score_gemma":0.00008936493,"domain_scores_codex":[0.9986089,0.00007301666,0.0003055087,0.0004744219,0.0002835595,0.0002546355],"domain_scores_gemma":[0.9984612,0.0004992023,0.0001579576,0.0005167339,0.0002172882,0.0001475652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007005454,0.0002818372,0.000004342568,0.0001151279,0.00004722681,5.896964e-7,0.001834193,0.9532151,0.0002579592,0.0008181647,0.0003724872,0.04298297],"study_design_scores_gemma":[0.001086136,0.00008848603,0.000007944555,0.00009392881,0.00007331492,0.000006408893,0.0007511956,0.9905558,0.0004518152,0.006222681,0.0004363305,0.0002260248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03738101,0.00001053762,0.9601305,0.0007519748,0.0003161597,0.0004947248,0.00006320507,0.0004374112,0.0004144627],"genre_scores_gemma":[0.890043,0.000002322827,0.1088304,0.0005382014,0.0001549342,0.00002577963,0.0001450227,0.00005027417,0.0002101329],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.852662,"threshold_uncertainty_score":0.9046652,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Generalization; Context (archaeology); Linear model; Mathematics; Computer science; Algorithm; Biological system; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1329767601637393,"gpt":0.3669497680814434,"spread":0.2339730079177041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954607,0.0001073131,0.0002454905,0.0004639578,0.00006126866,0.00008294463,0.0005423331,0.00005936421,0.0000210853],"category_scores_gemma":[0.0004332369,0.00008036867,0.00005663374,0.0009220655,0.00001193767,0.0003069529,0.00004043191,0.0002977631,0.000009354211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005406071,"about_ca_system_score_gemma":0.00004309839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001320982,"about_ca_topic_score_gemma":0.000001074905,"domain_scores_codex":[0.9987611,0.0000124705,0.000476175,0.0001321775,0.0004712167,0.0001469229],"domain_scores_gemma":[0.9985655,0.0001179533,0.0003390396,0.0004172239,0.0004251118,0.0001351973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002204699,0.03206184,0.009327156,0.0009557299,0.002796795,0.001546873,0.008101372,0.045872,0.1891321,0.1159748,0.1237564,0.4682703],"study_design_scores_gemma":[0.01331728,0.001752711,0.002306993,0.0005941046,0.001162325,0.004156457,0.001237558,0.8591649,0.04189525,0.06219974,0.01050305,0.001709627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4008037,0.0001989126,0.5968381,0.001526349,0.00004710778,0.00009346368,0.00001345329,0.00003104894,0.0004478905],"genre_scores_gemma":[0.7556123,0.000048748,0.2438301,0.0001877508,0.0001270977,3.779075e-7,0.000003931733,0.0000120881,0.000177632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8132929,"threshold_uncertainty_score":0.3277339,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03566932599326967,"gpt":0.2769585882640512,"spread":0.2412892622707816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008552296,0.0001314303,0.000262849,0.0000743926,0.0001365199,0.00001535067,0.000114249,0.00009096471,0.0002363641],"category_scores_gemma":[0.0000424242,0.000117666,0.00004959244,0.0001946268,0.0001641501,0.00006756634,0.00005776523,0.0001078994,0.00001537401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004898102,"about_ca_system_score_gemma":0.000006523363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006967811,"about_ca_topic_score_gemma":0.000002734996,"domain_scores_codex":[0.9991221,0.00002640475,0.0003805104,0.0002069479,0.0001408008,0.0001232285],"domain_scores_gemma":[0.999019,0.0002560937,0.0001776027,0.0002966977,0.0001719372,0.00007864944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006745687,0.0002447215,0.0001155866,0.0001866793,0.00004919002,1.29446e-7,0.001264504,0.000003737714,0.004622958,0.9897556,0.00196234,0.00178778],"study_design_scores_gemma":[0.002191577,0.0002194408,0.004278285,0.0001213111,0.0004972098,0.00007980771,0.001913205,0.020467,0.03511982,0.8917924,0.04246183,0.0008581748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9176963,0.003746407,0.05988477,0.005511843,0.00004779971,0.002334503,0.000659975,0.0002934982,0.009824933],"genre_scores_gemma":[0.9880295,0.0004325193,0.01007106,0.00009110881,0.000053235,0.0001249709,0.0000177702,0.00002015006,0.001159713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0979633,"threshold_uncertainty_score":0.4798279,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04404803521713629,"gpt":0.3093856997125112,"spread":0.2653376644953749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005601975,0.00009218496,0.0001543097,0.00004506541,0.00005864594,0.00002334529,0.00007005116,0.00006096328,0.00004683788],"category_scores_gemma":[0.0001465488,0.00008297893,0.00003312368,0.0002035233,0.00003655343,0.0002105543,0.00003751256,0.00005379953,0.00001391445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001068583,"about_ca_system_score_gemma":0.00002626366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001413682,"about_ca_topic_score_gemma":5.054037e-7,"domain_scores_codex":[0.9993037,0.00001328876,0.0003890768,0.00007302938,0.0001425937,0.0000783061],"domain_scores_gemma":[0.9993095,0.000138256,0.0002485086,0.0001219025,0.0001061425,0.00007571387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005016463,0.0009955904,0.01124722,0.01483212,0.0003779775,0.00000237071,0.1563952,0.2337619,0.02874553,0.5002096,0.03303947,0.01989128],"study_design_scores_gemma":[0.0004565734,0.00005634496,0.0003328365,0.00003015083,0.00002767815,0.000001848618,0.001082793,0.9906546,0.004343929,0.002814658,0.00008848124,0.0001101331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01587726,0.000004954021,0.9825208,0.0001864398,0.00002086657,0.0003210225,0.00003647937,0.00006918265,0.0009629586],"genre_scores_gemma":[0.208566,0.00001903378,0.7912152,0.0000961863,0.00002364821,0.000008960129,0.00003509957,0.00001033795,0.00002555825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7568927,"threshold_uncertainty_score":0.3383783,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04315358005490639,"gpt":0.3196607508964954,"spread":0.276507170841589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983823,0.00006305482,0.000181069,0.00002525715,0.0002619194,0.00004756734,0.0002048842,0.00002832637,0.000005688908],"category_scores_gemma":[0.0001926431,0.00002741943,0.0001076254,0.00005009092,0.00006816298,0.00009328449,0.00004260526,0.00008974218,0.000003635706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002195119,"about_ca_system_score_gemma":0.00002297981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004893602,"about_ca_topic_score_gemma":0.000005426215,"domain_scores_codex":[0.9991816,0.00007324497,0.0004645919,0.00004183069,0.000104018,0.0001347312],"domain_scores_gemma":[0.9979404,0.001225436,0.0004856713,0.0001703415,0.0001238623,0.00005429783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004932793,0.0001873477,0.0004190973,0.00005293389,0.0003130626,9.377435e-8,0.005170952,0.00006575182,0.01680004,0.9032685,0.06007806,0.01315096],"study_design_scores_gemma":[0.005079225,0.0003015533,0.01171205,0.0001841513,0.0008215634,0.0001765917,0.002330761,0.001034036,0.06197692,0.7995563,0.1164933,0.000333575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9193133,0.0009351692,0.03948436,0.03814561,0.0002248594,0.00126614,0.00001086725,0.00001107868,0.0006085946],"genre_scores_gemma":[0.9887919,0.00005093637,0.01047539,0.0001793899,0.0003159246,0.00004101099,2.326971e-7,0.000009620427,0.0001355798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1037122,"threshold_uncertainty_score":0.2014498,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1244148917783309,"gpt":0.3895373254667616,"spread":0.2651224336884307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004593646,0.0002643518,0.00047076,0.0001799101,0.0009422555,0.0001711748,0.0002980454,0.0001344994,0.000004984162],"category_scores_gemma":[0.00001147266,0.0002620267,0.0001062481,0.0006529799,0.0001083852,0.0001979013,0.000005692006,0.0002030316,0.00003510664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000322406,"about_ca_system_score_gemma":0.0001166436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002356336,"about_ca_topic_score_gemma":0.0001336173,"domain_scores_codex":[0.9976851,0.0002967015,0.000592839,0.0005334569,0.0005857147,0.0003061472],"domain_scores_gemma":[0.9980394,0.0008712735,0.0003239962,0.0001932142,0.0004881759,0.00008395557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003079871,0.01463198,0.0001461608,0.002434101,0.003460886,0.00002605894,0.02261545,0.5123227,0.006197732,0.3589185,0.04173705,0.03442949],"study_design_scores_gemma":[0.004472259,0.0003968967,0.0009985783,0.0001720788,0.0002746013,0.00003892441,0.002083507,0.9794821,0.0003330743,0.00902722,0.001973173,0.0007476272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04837416,0.000006611663,0.9448118,0.0004880402,0.0006997345,0.001687406,0.003589098,0.0001912147,0.0001519559],"genre_scores_gemma":[0.9898797,3.75728e-7,0.007235681,0.00004556208,0.001359791,0.0005761107,0.0007813236,0.00005151389,0.00006999596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9415055,"threshold_uncertainty_score":0.9999832,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09565623818988435,"gpt":0.3603582001379818,"spread":0.2647019619480975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003697672,0.0001606262,0.0001941111,0.0002404397,0.0007372152,0.0002615143,0.0006425002,0.0001069016,0.00007600189],"category_scores_gemma":[0.0006738974,0.0001472073,0.00005199508,0.0001234843,0.00005363634,0.0005240347,0.0001255018,0.000137225,0.0001722799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007202463,"about_ca_system_score_gemma":0.00006446871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007250802,"about_ca_topic_score_gemma":0.0001026623,"domain_scores_codex":[0.9987485,0.00002640459,0.0005504742,0.0002097196,0.0002557276,0.000209192],"domain_scores_gemma":[0.9972913,0.0003698533,0.0003733843,0.001644712,0.0002394267,0.00008129016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009358511,0.0048284,0.002803616,0.001192717,0.0001177053,0.00001219606,0.002865296,0.01561905,0.005195158,0.3178469,0.1158202,0.532763],"study_design_scores_gemma":[0.005589081,0.000207325,0.03661034,0.0003197881,0.00007657694,0.000009156365,0.0002134791,0.8621891,0.0009324891,0.04221968,0.05099064,0.0006423124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1548697,0.000005118802,0.8146372,0.01172621,0.001358093,0.00319612,0.003645364,0.0004091068,0.01015305],"genre_scores_gemma":[0.8068174,0.000005463339,0.1880374,0.001375383,0.0002916634,0.0002960149,0.002892991,0.00002883529,0.0002549358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8465701,"threshold_uncertainty_score":0.6002939,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04845759630338339,"gpt":0.32288168150934,"spread":0.2744240852059567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005336872,0.0001449422,0.0002584633,0.00003671214,0.0003092339,0.00008323799,0.00007349951,0.00006189422,0.00001163873],"category_scores_gemma":[0.0002636286,0.00009571298,0.00006330329,0.00008713131,0.0001111071,0.0001338234,0.00004731182,0.0001268837,0.000001483716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001999909,"about_ca_system_score_gemma":0.00002491305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.807337e-7,"about_ca_topic_score_gemma":1.469635e-7,"domain_scores_codex":[0.9989454,0.00001590294,0.0005064811,0.0000963286,0.0002623049,0.0001735781],"domain_scores_gemma":[0.9939822,0.005233488,0.0003910292,0.00007841965,0.0001637827,0.0001511106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000272311,0.002555006,0.00153416,0.001210032,0.0005540276,0.000002018714,0.007134749,0.0008214033,0.0005948498,0.6959471,0.0170872,0.2722871],"study_design_scores_gemma":[0.001335683,0.00009180451,0.007801204,0.00005515337,0.0002687994,0.0003939115,0.001018932,0.1051095,0.0001160377,0.8809462,0.002667791,0.0001949554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.170149,0.0001656977,0.8269964,0.002167217,0.00004711953,0.0003141667,0.0001083697,0.00001520633,0.0000368557],"genre_scores_gemma":[0.3181572,0.00003813208,0.6814132,0.000146947,0.0001801368,0.00002078356,0.00001855987,0.00001302783,0.00001197856],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2720922,"threshold_uncertainty_score":0.3903062,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","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","retraction":null,"screen_n_in":null,"score":{"opus":0.08230579605464176,"gpt":0.3296400954964969,"spread":0.2473342994418551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002568478,0.0001938832,0.0001882468,0.0001110904,0.0004727075,0.00008149949,0.0002890962,0.00009111609,0.0001272984],"category_scores_gemma":[0.0001021102,0.0001485888,0.00005915839,0.0005397072,0.00005337156,0.00007090494,0.0000825075,0.0002133684,0.0007603188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004334562,"about_ca_system_score_gemma":0.00003400916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003144615,"about_ca_topic_score_gemma":0.000003550567,"domain_scores_codex":[0.9986493,0.00006715085,0.0003587937,0.0004078109,0.0002910697,0.0002258969],"domain_scores_gemma":[0.9982995,0.0004106598,0.0001067471,0.0005893959,0.0002795103,0.0003142224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001174236,0.0002237614,0.00001857442,0.00001049581,0.00001557523,1.464513e-7,0.0001536344,0.0005149886,0.0003436936,0.9885709,0.00935933,0.000777122],"study_design_scores_gemma":[0.0009497041,0.0001895615,0.0008871443,0.00003970317,0.0001422094,0.00004625348,0.0005392682,0.05575865,0.001200814,0.2536813,0.6858504,0.0007150266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0189696,0.0000747321,0.9240396,0.0389928,0.00004053655,0.004703166,0.0001938226,0.0004839335,0.01250178],"genre_scores_gemma":[0.854355,0.00007300531,0.1212565,0.007960528,0.0009627057,0.01168747,0.0003824073,0.0001244813,0.003197837],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8353854,"threshold_uncertainty_score":0.9772614,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1529325046986833,"gpt":0.3962758409918483,"spread":0.243343336293165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000242655,0.0001403377,0.0002650383,0.00007741821,0.0001396282,0.00001717381,0.0001017582,0.0001652879,0.00005777981],"category_scores_gemma":[0.00006143824,0.0001415606,0.00005665774,0.0002312298,0.00007162851,0.0000995263,0.000003983103,0.000205621,0.000004168248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002487221,"about_ca_system_score_gemma":0.00004030639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000017991,"about_ca_topic_score_gemma":0.00006838643,"domain_scores_codex":[0.9989264,0.0001431192,0.0002871853,0.0003779194,0.0001313028,0.0001340999],"domain_scores_gemma":[0.998126,0.0007640264,0.0001462806,0.0006264523,0.0002807716,0.00005652843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002327892,0.00236445,0.000004129701,0.0005408794,0.0003932884,0.000005122342,0.0009668765,0.001176266,0.7818839,0.04802538,0.007567612,0.1568393],"study_design_scores_gemma":[0.00232873,0.0002668195,0.0003315722,0.0001927071,0.001035077,0.0003631868,0.0007489287,0.008322064,0.9175751,0.05642943,0.01191744,0.0004889808],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04511934,0.0001684087,0.9514614,0.001951778,0.0004189196,0.0004316529,0.0003138531,0.0000686811,0.00006598372],"genre_scores_gemma":[0.451054,0.0004354063,0.546994,0.0000582413,0.00005226115,0.00006206328,0.00008185589,0.00002986827,0.001232302],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4059347,"threshold_uncertainty_score":0.5772675,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02929942267681448,"gpt":0.357332827020621,"spread":0.3280334043438066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002475358,0.0004599622,0.0008378039,0.0001378212,0.0005949653,0.0001835148,0.0005759484,0.0002090891,0.00004574497],"category_scores_gemma":[0.00001741449,0.0004249109,0.0006689541,0.0005499433,0.00005943945,0.0002549676,0.00001482918,0.0003961295,0.0004841051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002003057,"about_ca_system_score_gemma":0.0000318988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001437103,"about_ca_topic_score_gemma":0.00002529313,"domain_scores_codex":[0.9973638,0.000259705,0.0005747465,0.0007459617,0.0005091056,0.0005466953],"domain_scores_gemma":[0.9964541,0.001842112,0.0003000786,0.00091908,0.0002737511,0.0002109298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001183917,0.0166824,0.0001090963,0.003469534,0.002343271,0.0000114807,0.009997927,0.008590204,0.2801382,0.6308182,0.004920287,0.04173544],"study_design_scores_gemma":[0.01555963,0.00251547,0.004304707,0.00139593,0.003090423,0.0001800652,0.007869333,0.3571121,0.0436572,0.492086,0.06691315,0.005316019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4034825,0.000006996393,0.5887896,0.001664625,0.0003440813,0.002433341,0.00195546,0.0005783118,0.0007450138],"genre_scores_gemma":[0.9826714,0.000001571649,0.01406399,0.0001750185,0.0005768882,0.001297614,0.0003776598,0.000100973,0.0007348363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5791889,"threshold_uncertainty_score":0.9998203,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04771075625866326,"gpt":0.3236491620615913,"spread":0.2759384058029281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001014947,0.00007601036,0.0001817128,0.00001492469,0.00005318333,0.00002015295,0.0001048805,0.00002064621,0.000003497809],"category_scores_gemma":[0.0000421776,0.00004661005,0.00004630407,0.0001037359,0.00008567161,0.00007933127,0.00002261656,0.0001667484,7.06461e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001825169,"about_ca_system_score_gemma":0.00005971587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001395622,"about_ca_topic_score_gemma":3.393454e-7,"domain_scores_codex":[0.9994121,0.0000269759,0.0002127215,0.00004912733,0.0002198922,0.00007918017],"domain_scores_gemma":[0.9991217,0.0002290851,0.0002018943,0.0001035818,0.0002051132,0.0001386306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003977667,0.0005968328,0.00002168764,0.00005887883,0.0001386437,0.000006523532,0.001742554,0.004995471,0.9678386,0.02363985,0.0004330216,0.0001301849],"study_design_scores_gemma":[0.003643204,0.0006169809,0.001178378,0.0003466413,0.0006426689,0.0042619,0.002365342,0.1596425,0.6708539,0.1552234,0.0007717623,0.0004534147],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8334619,0.000006792845,0.1649696,0.001129408,0.000003127086,0.00007532856,0.00001131084,0.000007690895,0.0003347568],"genre_scores_gemma":[0.9758952,5.798637e-7,0.02386987,0.00005625809,0.0001517632,0.000001434805,0.000001205016,0.000007627189,0.0000160229],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2969848,"threshold_uncertainty_score":0.1900703,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03838698805067434,"gpt":0.3233152826859932,"spread":0.2849282946353189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001004335,0.00007765656,0.00017425,0.0001101368,0.00009078556,0.00002702794,0.0001952653,0.00003907873,0.00038042],"category_scores_gemma":[0.0003401655,0.00004871542,0.0001076759,0.0001515815,0.00004568772,0.00005068229,0.00002059053,0.0001623498,0.00001753493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003104101,"about_ca_system_score_gemma":0.00005625106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002878933,"about_ca_topic_score_gemma":0.00000603504,"domain_scores_codex":[0.9988714,0.00004509721,0.0005331478,0.00005635283,0.000384815,0.0001091859],"domain_scores_gemma":[0.997785,0.001302664,0.0003669788,0.0001602017,0.0003122623,0.00007291688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006449725,0.0001144577,0.00003628213,0.000008750964,0.00004331662,0.000002527811,0.0009454875,0.00003943751,0.005140237,0.9610434,0.03237691,0.0001847037],"study_design_scores_gemma":[0.0002307317,0.0002078397,0.003894184,0.00003791385,0.00003206255,0.00005179828,0.0008983699,0.00002335207,0.01875498,0.9711938,0.004597245,0.00007774105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8734553,0.00003132032,0.1047638,0.01586146,0.0001491313,0.0001988051,0.00001100121,0.00001412283,0.005515011],"genre_scores_gemma":[0.9892545,0.00000412192,0.009095408,0.001089363,0.0001380037,0.000002664809,7.108391e-7,0.000009689283,0.0004055539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1157992,"threshold_uncertainty_score":0.4165332,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05812634053111868,"gpt":0.337236554991623,"spread":0.2791102144605043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004331657,0.000308083,0.0004005804,0.0001057278,0.0003470958,0.00008774885,0.0002964513,0.00009796235,0.0007333466],"category_scores_gemma":[0.0002129065,0.0002607174,0.0002145443,0.0001563899,0.00006049525,0.00009680429,0.00004557354,0.0001829686,0.0002320849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001369638,"about_ca_system_score_gemma":0.00003089017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000332776,"about_ca_topic_score_gemma":0.00001023792,"domain_scores_codex":[0.9982585,0.00005610567,0.0005907003,0.0003488449,0.000275467,0.0004704222],"domain_scores_gemma":[0.997703,0.001193324,0.0002193892,0.000643697,0.00008510245,0.0001555315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001656377,0.0007527223,0.000009930533,0.0001941561,0.0000682813,8.32375e-7,0.0005972969,0.000007985588,0.0002559113,0.954369,0.04349294,0.0002343813],"study_design_scores_gemma":[0.001330693,0.0001936989,0.00001203843,0.0001131027,0.00009449119,0.0000281473,0.0002778948,0.0005691529,0.005739003,0.9698508,0.02146076,0.0003302014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2711855,0.00004496561,0.5832213,0.009560905,0.0003050895,0.007138092,0.0001656475,0.0009577453,0.1274208],"genre_scores_gemma":[0.6385576,0.00000513631,0.3506207,0.005065158,0.0000566042,0.001764333,0.00007687056,0.0001429316,0.003710684],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3673722,"threshold_uncertainty_score":0.9999845,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04122156571030822,"gpt":0.3400429608258426,"spread":0.2988213951155344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097367,0.0001887377,0.0002891782,0.0001597013,0.0003310715,0.00008109483,0.00015537,0.00004740934,0.00005968934],"category_scores_gemma":[0.00006942516,0.0001884863,0.00003927615,0.0002970711,0.0001254253,0.0001443595,0.0001354965,0.0003478442,0.000004743333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001120613,"about_ca_system_score_gemma":0.00007364835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001114501,"about_ca_topic_score_gemma":0.0000204134,"domain_scores_codex":[0.9980072,0.0001538599,0.0004491923,0.0009546814,0.000225045,0.0002100563],"domain_scores_gemma":[0.9988795,0.0002181936,0.0001395634,0.0005948209,0.00008412902,0.00008380739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003048465,0.01138417,0.01291768,0.004272,0.0001525157,0.0001937297,0.01306517,0.04121486,0.5178761,0.1995239,0.007253958,0.1890974],"study_design_scores_gemma":[0.0009201855,0.0001812065,0.002035188,0.0001395106,0.00004862884,0.0001919772,0.0001983479,0.2152726,0.00407346,0.7763811,0.0001410281,0.0004167322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726633,0.0002524002,0.02207502,0.003078307,0.00002489481,0.0006101788,0.00007480354,0.0001802476,0.001040805],"genre_scores_gemma":[0.9865633,0.000006807196,0.01261481,0.0001928687,0.00002417023,0.0002074748,0.000008231543,0.00003035063,0.0003520245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5768572,"threshold_uncertainty_score":0.768625,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06013025682110174,"gpt":0.3723619049408898,"spread":0.3122316481197881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003733879,0.0003295415,0.0003638909,0.000189347,0.005633045,0.0003215943,0.001518894,0.0002073746,0.00001304225],"category_scores_gemma":[0.0001828838,0.0003521129,0.0001993491,0.0001745383,0.0004488479,0.0002735924,0.0001267283,0.0006644942,0.00003531119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007250653,"about_ca_system_score_gemma":0.00005528961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000198536,"about_ca_topic_score_gemma":0.00007513147,"domain_scores_codex":[0.9982547,0.00009178994,0.0005132157,0.0005693174,0.0002126353,0.0003582956],"domain_scores_gemma":[0.9934946,0.002409018,0.0004989251,0.002997401,0.0003805982,0.0002195006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003955207,0.001609939,0.0001881101,0.0001107504,0.0001848804,2.752886e-7,0.002855876,0.01963061,0.001672345,0.01519119,0.0005569882,0.9579595],"study_design_scores_gemma":[0.001112958,0.00005776435,0.0003886897,0.00005223713,0.0001458886,0.00000939162,0.0003371814,0.9644176,0.0001512844,0.02491312,0.00804595,0.0003679016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003943297,0.0001215321,0.9888973,0.003557431,0.00005594943,0.002445373,0.0001375288,0.0004441672,0.000397471],"genre_scores_gemma":[0.5039634,0.0001758596,0.4930842,0.00008969568,0.00006176103,0.002028169,0.0001391136,0.00004814923,0.0004096547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9575916,"threshold_uncertainty_score":0.9998931,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03018331186290165,"gpt":0.3110934234892573,"spread":0.2809101116263557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003616595,0.0003000388,0.0003129721,0.0001517042,0.001620316,0.0001638094,0.0002676902,0.0001074009,0.00006050521],"category_scores_gemma":[0.00001605635,0.0002853971,0.0001122734,0.0006119262,0.00009742848,0.0001882885,0.0000099852,0.0002549305,0.00001238815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002215084,"about_ca_system_score_gemma":0.00008000959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001341023,"about_ca_topic_score_gemma":0.0001081069,"domain_scores_codex":[0.9981464,0.00006042521,0.0004445778,0.0004949963,0.0002027908,0.0006508427],"domain_scores_gemma":[0.9978076,0.000389137,0.0002361909,0.0003602118,0.001063795,0.0001430856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01381615,0.06443857,0.009495017,0.03983204,0.01212628,0.0003520767,0.07843629,0.151437,0.2492147,0.2106263,0.01065164,0.1595739],"study_design_scores_gemma":[0.004882005,0.000680418,0.0006019736,0.0002483373,0.0002271444,0.00004443244,0.007571634,0.9072242,0.07539175,0.00102849,0.001272375,0.0008272434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3257131,0.000005194901,0.6725301,0.0001748679,0.0000930366,0.0009812324,0.00006765964,0.0003354493,0.00009943032],"genre_scores_gemma":[0.9123617,8.045433e-7,0.08668408,0.0002030478,0.0001135636,0.00006189977,0.00003169939,0.00005301784,0.0004902154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7557871,"threshold_uncertainty_score":0.9999598,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Subvariety; Mathematics; Dimension (graph theory); Conjecture; Closure (psychology); Combinatorics; Variety (cybernetics); Statistics; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.01897341314953339,"gpt":0.2411435189878251,"spread":0.2221701058382917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004900841,0.002895335,0.001345134,0.001744524,0.004964329,0.005230349,0.006709924,0.007030479,0.5981464],"category_scores_gemma":[0.001940747,0.005137974,0.005656113,0.003419289,0.005129803,0.003986119,0.005260124,0.006241165,0.003496542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007643011,"about_ca_system_score_gemma":0.004802244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002340747,"about_ca_topic_score_gemma":0.002020683,"domain_scores_codex":[0.9745205,0.001204246,0.006478621,0.004313495,0.007442615,0.006040543],"domain_scores_gemma":[0.9782799,0.003844308,0.008285991,0.005332855,0.0008908377,0.00336607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004271674,0.0009734151,0.00001537559,0.002391944,0.004585964,0.001731717,0.004002314,0.002214774,0.005322872,0.5940788,0.3779509,0.002460232],"study_design_scores_gemma":[0.008082262,0.003369512,0.0001850597,0.002725253,0.006854747,0.009482771,0.007100353,0.0276763,0.9091991,0.002456015,0.0181021,0.00476652],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3672428,0.00322166,0.00250009,0.00367253,0.005191345,0.0002029122,0.001637964,0.0006415275,0.6156892],"genre_scores_gemma":[0.9675754,0.003522675,0.008840893,0.003955061,0.007016313,0.002879968,0.002194253,0.002507572,0.001507914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9038762,"threshold_uncertainty_score":0.9986643,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0979936206294948,"gpt":0.3357521216312969,"spread":0.2377585010018021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002761873,0.0001833261,0.0003017329,0.0001643842,0.0004500178,0.0001470792,0.00009204586,0.0002511689,0.00002050572],"category_scores_gemma":[0.00009831401,0.0002010372,0.0001305102,0.0005475178,0.0000403933,0.0001806119,0.00000277857,0.0007624067,0.0000139777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001594276,"about_ca_system_score_gemma":0.0001818206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003491367,"about_ca_topic_score_gemma":0.00003155242,"domain_scores_codex":[0.9983817,0.00008316209,0.0008905363,0.0001474102,0.0002109534,0.0002862863],"domain_scores_gemma":[0.9985165,0.0008153704,0.000204071,0.0001346104,0.0002230159,0.0001064288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008871975,0.0004272448,0.000007341336,0.00005355139,0.00004608472,0.000001591944,0.001866049,0.9692698,0.0001501424,0.002997885,0.0007334703,0.02435818],"study_design_scores_gemma":[0.002392873,0.00005515807,0.000005023339,0.00007618398,0.00004100117,0.00001427188,0.0008715335,0.9887283,0.002445415,0.004948577,0.0002157695,0.0002058569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08224121,0.000001444451,0.9160694,0.0004238415,0.000176718,0.0005268788,0.0001292016,0.0001977302,0.0002336134],"genre_scores_gemma":[0.9488492,0.00000304818,0.05046695,0.000159972,0.00005691198,0.00007870907,0.0002150784,0.00002432342,0.0001457863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.866608,"threshold_uncertainty_score":0.8198059,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Centre 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","retraction":null,"screen_n_in":null,"score":{"opus":0.03708464711442809,"gpt":0.3759844170192982,"spread":0.3388997699048701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003873105,0.0001386419,0.0002199309,0.00005742861,0.0001797828,0.00002335342,0.0002181193,0.00006979756,0.00004675104],"category_scores_gemma":[0.00005222189,0.00009383253,0.00004011528,0.0004767397,0.0001757899,0.0001207461,0.00004311508,0.0001862586,0.00002327299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001933338,"about_ca_system_score_gemma":0.00002295206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008217239,"about_ca_topic_score_gemma":0.000004881106,"domain_scores_codex":[0.998858,0.0001229791,0.00036401,0.0002145119,0.0001642384,0.0002762274],"domain_scores_gemma":[0.9983444,0.0006514193,0.0001573457,0.0005694801,0.00008783151,0.000189585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000265218,0.0008466564,0.01172386,0.00002242376,0.00003772018,2.28108e-7,0.000569194,0.000005778496,0.003520155,0.9642148,0.0001842586,0.01884839],"study_design_scores_gemma":[0.002987082,0.0005433368,0.3380848,0.00009427642,0.0003624285,0.0002039973,0.002849324,0.007678473,0.01365124,0.4646793,0.1671615,0.001704263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.242032,0.0004009398,0.7520065,0.001409926,0.00002797471,0.001324219,0.00003430971,0.0001577201,0.002606354],"genre_scores_gemma":[0.7490854,0.00001556734,0.2501366,0.0001200062,0.00004719261,0.0005119505,0.00001148138,0.00002534731,0.00004642586],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5070534,"threshold_uncertainty_score":0.3826379,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08315372593801956,"gpt":0.3379218660780011,"spread":0.2547681401399816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000389083,0.00032209,0.0004231416,0.0005123977,0.0004568055,0.0001004182,0.0001936997,0.0001856721,0.0001346428],"category_scores_gemma":[0.00001184239,0.0003313083,0.0003544993,0.0008048776,0.00006285831,0.0001838505,1.878382e-7,0.0001971317,0.0006391112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001218422,"about_ca_system_score_gemma":0.00003937747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002268692,"about_ca_topic_score_gemma":0.00006000476,"domain_scores_codex":[0.9975121,0.00007534408,0.001046652,0.0005004621,0.0004942874,0.0003711412],"domain_scores_gemma":[0.9982041,0.0006369434,0.0002567238,0.0004053606,0.0003401549,0.0001566956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002720775,0.0009448183,0.000009880313,0.0008759352,0.0002230953,0.00000549576,0.002578006,0.949559,0.007024743,0.02235889,0.005618642,0.01052945],"study_design_scores_gemma":[0.002786114,0.0004741279,0.0007541071,0.0006821954,0.0005498877,0.0000248917,0.003043071,0.9197911,0.0574667,0.005539357,0.00766582,0.001222641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1859588,0.000008110075,0.808731,0.0003513145,0.0009707294,0.002078286,0.00078009,0.001049514,0.00007220708],"genre_scores_gemma":[0.9933089,0.00004021589,0.00304335,0.00006604152,0.00009544106,0.001045328,0.0005550766,0.00008825942,0.00175741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.80735,"threshold_uncertainty_score":0.9999139,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07786585200162596,"gpt":0.3602344492309203,"spread":0.2823685972292943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001027223,0.0002208922,0.0003105747,0.0002634256,0.002277708,0.0001081546,0.0002039042,0.00006582807,0.00002579904],"category_scores_gemma":[0.00004529522,0.0002134553,0.00008398233,0.0004464912,0.0003159638,0.0001054525,0.00001579398,0.0003376749,0.000002545753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007768157,"about_ca_system_score_gemma":0.00004651327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006335579,"about_ca_topic_score_gemma":0.00001392171,"domain_scores_codex":[0.9980178,0.0002037737,0.0004156238,0.0007604572,0.0002513306,0.0003509652],"domain_scores_gemma":[0.998357,0.0006641986,0.0001600426,0.0005714442,0.000105889,0.0001414195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006583284,0.0001150275,5.640143e-7,0.00007220771,0.00002833501,0.000003088251,0.0005904901,0.003406957,0.02313669,0.0002372742,0.00006918795,0.9722744],"study_design_scores_gemma":[0.0007093855,0.00009595785,0.00007876151,0.00007012737,0.0001052312,0.001061061,0.001379041,0.9890329,0.002022427,0.003137621,0.00201921,0.0002883187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1690915,0.00003010116,0.8278195,0.001581062,0.0004208514,0.0006349037,0.0002101379,0.0001373221,0.00007465045],"genre_scores_gemma":[0.2834987,0.00003174942,0.7155815,0.000398477,0.0000577022,0.000005622037,0.00001123938,0.00003160721,0.0003833571],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9856259,"threshold_uncertainty_score":0.9990212,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1255682168471452,"gpt":0.3951576275156208,"spread":0.2695894106684756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004479039,0.0002388213,0.0009587507,0.0004169927,0.0001419126,0.00003874339,0.0002391762,0.0004729296,0.001095934],"category_scores_gemma":[0.0000193752,0.00021641,0.0007476021,0.0009629836,0.00007644459,0.00002792381,0.0000722257,0.0002796507,0.000002856576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001541502,"about_ca_system_score_gemma":0.0001771459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001586546,"about_ca_topic_score_gemma":0.00188424,"domain_scores_codex":[0.9977965,0.000030805,0.000874084,0.0002851069,0.0008090611,0.0002044487],"domain_scores_gemma":[0.998158,0.0001251368,0.0008554914,0.000398485,0.0004135469,0.00004939133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001363526,0.001188304,0.01504934,0.0004239648,0.009895677,0.00001663376,0.0001469747,0.003431678,0.0000906306,0.1162028,0.8503002,0.003240137],"study_design_scores_gemma":[0.001573172,0.00007292796,0.05025262,0.0003687464,0.07453432,0.00007808879,0.0004210427,0.5535787,0.0001370346,0.07831887,0.2370862,0.00357824],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02452775,0.0001768873,0.7740297,0.0002466528,0.0002963457,0.0005674664,0.0003219894,0.0002922645,0.1995409],"genre_scores_gemma":[0.9098242,0.00005984915,0.06515241,0.00009076357,0.002204557,0.00006740685,0.003036559,0.0001756963,0.01938855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8852965,"threshold_uncertainty_score":0.9998172,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04286409814806524,"gpt":0.304222101951463,"spread":0.2613580038033978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001106045,0.0001161125,0.0002601916,0.00002260114,0.00006979419,0.00002890136,0.0001680631,0.00004496564,0.0001406827],"category_scores_gemma":[0.00003625914,0.00009604355,0.000184333,0.0001516387,0.00003912898,0.0001243969,0.00002758107,0.0001780757,0.00002340001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001828107,"about_ca_system_score_gemma":0.00004447113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001344548,"about_ca_topic_score_gemma":3.935144e-7,"domain_scores_codex":[0.9990603,0.0000500632,0.0004081226,0.00009551138,0.0002580491,0.0001279455],"domain_scores_gemma":[0.9989474,0.0002014008,0.0003995034,0.0001478306,0.0001476047,0.0001562616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003078469,0.0001373961,0.000004133265,0.000009954219,0.00007275455,0.00001543006,0.0001389036,0.0001503486,0.001009934,0.9673573,0.02964163,0.001431405],"study_design_scores_gemma":[0.0004500805,0.00009847806,0.0000300892,0.00001874666,0.00008781516,0.00004156716,0.00007942852,0.00007117452,0.008772988,0.9609417,0.02929321,0.0001146713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1734545,0.0002629268,0.8132368,0.007640101,0.0004842572,0.0000955033,0.00005587172,0.0001396338,0.00463041],"genre_scores_gemma":[0.990693,0.00004600764,0.006375452,0.000909499,0.001586745,0.000002830015,0.000004756006,0.00002467006,0.0003570228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8172386,"threshold_uncertainty_score":0.3916542,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0714223381075099,"gpt":0.360528478441711,"spread":0.2891061403342011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008693984,0.0001130726,0.000111704,0.0001193992,0.0001061393,0.0001256322,0.0002501977,0.00003909749,0.01387578],"category_scores_gemma":[0.0001789748,0.00009920695,0.00006458702,0.0000786949,0.0000306371,0.0001099237,0.00003700859,0.0003038542,0.001746663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003559681,"about_ca_system_score_gemma":0.0000127333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008305275,"about_ca_topic_score_gemma":0.000008156733,"domain_scores_codex":[0.9991789,0.00004871019,0.0002007583,0.0001955674,0.0002460564,0.0001299662],"domain_scores_gemma":[0.9993193,0.0001390568,0.0001111106,0.0001421961,0.0002193258,0.00006903819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001038563,0.0001102413,0.005801389,0.000004755132,0.00005619899,0.000002700951,0.0001405447,0.0001397467,0.005779088,0.9754585,0.003766986,0.008729438],"study_design_scores_gemma":[0.001250976,0.0001782888,0.0253989,0.000113766,0.00003661265,0.00004205883,0.0006419148,0.3737107,0.001261696,0.5497018,0.04698068,0.000682606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5116428,0.00001035465,0.01484638,0.02783579,0.0002749444,0.0004196776,0.00002444129,0.0005594555,0.4443862],"genre_scores_gemma":[0.9831653,0.000009562835,0.005293561,0.0004580122,0.00007848698,0.00005912606,0.00004255143,0.00001585223,0.0108776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4715225,"threshold_uncertainty_score":0.9990306,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03045666333862183,"gpt":0.2941656321878386,"spread":0.2637089688492168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190693,0.0001742302,0.0003509126,0.00001663191,0.0003126893,0.00005048038,0.0008811224,0.00003700809,0.0001635364],"category_scores_gemma":[0.0005101438,0.00008003724,0.0003745444,0.0006368066,0.0008124578,0.00004075826,0.000257752,0.0002342559,0.00002593032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003885102,"about_ca_system_score_gemma":0.00002224391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001672583,"about_ca_topic_score_gemma":0.000001112527,"domain_scores_codex":[0.9985412,0.00002246768,0.0004093531,0.000185629,0.0005954302,0.0002459463],"domain_scores_gemma":[0.9980432,0.0008341091,0.0004577659,0.0003544519,0.0002451109,0.00006540999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003348472,0.0002702842,0.00007042565,0.00008773711,0.0001045345,3.381383e-8,0.00568861,0.000004779793,0.004454973,0.9387259,0.05042781,0.0001313862],"study_design_scores_gemma":[0.0001370988,0.0001408229,0.0007432688,0.00007351908,0.0001285441,0.00001094005,0.009646901,0.000724668,0.005722248,0.980503,0.002018384,0.0001506545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9499692,0.000009981867,0.005121919,0.03210913,0.00003713217,0.0008737965,0.00002041882,0.00007051893,0.01178792],"genre_scores_gemma":[0.9896407,0.00001415101,0.008098424,0.001375862,0.00006739423,0.0001300047,3.141362e-7,0.00002614116,0.0006469737],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04840942,"threshold_uncertainty_score":0.3263824,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.4926474357201112,"gpt":0.3689288557077695,"spread":0.1237185800123418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003939445,0.0003608277,0.0004531067,0.000205095,0.0004445972,0.0001406132,0.0007257836,0.0005003738,0.000164003],"category_scores_gemma":[0.0003610528,0.00034098,0.0001863011,0.0004689097,0.00008434089,0.0003936203,0.000008822159,0.0009355368,0.0002719538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001150701,"about_ca_system_score_gemma":0.0001950596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002034763,"about_ca_topic_score_gemma":0.00002007881,"domain_scores_codex":[0.9974415,0.00007178805,0.001294355,0.0003494765,0.0004648495,0.0003779894],"domain_scores_gemma":[0.9968338,0.001127919,0.0004881081,0.001058391,0.0001606586,0.0003311079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005281658,0.004466803,0.0001279466,0.0003388536,0.0009111699,0.000004469555,0.005464157,0.01641761,0.002774007,0.008975114,0.4532163,0.502022],"study_design_scores_gemma":[0.01923615,0.001595919,0.00001829958,0.0001351191,0.000605293,0.0000164746,0.001771127,0.7617848,0.02034699,0.001065638,0.1922097,0.001214544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01410042,0.000001191121,0.9652681,0.005872609,0.001492361,0.003059156,0.008438209,0.0005465458,0.00122141],"genre_scores_gemma":[0.9776354,0.00001231901,0.01712464,0.001960461,0.001308471,0.0004304878,0.001071129,0.00008555681,0.0003714743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9635351,"threshold_uncertainty_score":0.9999042,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01948802082768114,"gpt":0.2484689187412446,"spread":0.2289808979135635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003374156,0.0008997054,0.0005251543,0.000558919,0.001806727,0.00169843,0.00235251,0.002175475,0.5013272],"category_scores_gemma":[0.002296462,0.001569875,0.001944522,0.001430387,0.002358856,0.001865099,0.001430312,0.002259514,0.0008082286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002425652,"about_ca_system_score_gemma":0.001812618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004538122,"about_ca_topic_score_gemma":0.0004540988,"domain_scores_codex":[0.9900302,0.0009101015,0.002977961,0.001351126,0.002670474,0.002060102],"domain_scores_gemma":[0.9896075,0.002795731,0.003842731,0.002057589,0.0003824288,0.00131401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.005313696,0.0004268688,0.00001143335,0.001027469,0.001601829,0.001047047,0.003553734,0.0005401928,0.002645276,0.7290144,0.2540484,0.0007696908],"study_design_scores_gemma":[0.005621871,0.002754631,0.0001148605,0.001694706,0.002214117,0.002754265,0.006359453,0.008379348,0.9541298,0.006472547,0.007899631,0.001604752],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5414868,0.001113528,0.0007625414,0.00253976,0.004308172,0.0000729739,0.0002994132,0.0001649281,0.4492519],"genre_scores_gemma":[0.9898454,0.001959719,0.001903568,0.001371999,0.002802448,0.0007671266,0.0003823551,0.0006980643,0.0002693268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9514846,"threshold_uncertainty_score":0.9999698,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1128814839262955,"gpt":0.3448710913636853,"spread":0.2319896074373898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003268493,0.0003774058,0.0004696543,0.0002689116,0.0008918339,0.00032264,0.0001795744,0.0008292368,0.0002356031],"category_scores_gemma":[0.00009766335,0.0003818792,0.0003643135,0.0007518281,0.00007288795,0.0002599275,0.000001996453,0.001083054,0.00004204425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002523701,"about_ca_system_score_gemma":0.0004381088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007089862,"about_ca_topic_score_gemma":0.00000767559,"domain_scores_codex":[0.9977651,0.0001210447,0.0009709152,0.0002833789,0.0004390312,0.0004205805],"domain_scores_gemma":[0.9975115,0.0009158465,0.000411024,0.0004145986,0.0005186744,0.0002283712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.005590388,0.01777958,0.00007752005,0.00099958,0.002432785,0.0000318934,0.002461076,0.2514851,0.02529202,0.01574012,0.5148212,0.1632887],"study_design_scores_gemma":[0.02375956,0.0008255431,0.00001223267,0.0003696367,0.001186311,0.0002548074,0.003856602,0.4207576,0.4967642,0.002565591,0.04761909,0.002028793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02435933,0.000004056935,0.9690824,0.001301414,0.0009824883,0.001522704,0.0007118765,0.0003929359,0.001642849],"genre_scores_gemma":[0.7707147,0.000008281195,0.2215122,0.001438942,0.001072991,0.001302416,0.0008924669,0.0001322438,0.00292579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7475702,"threshold_uncertainty_score":0.9998633,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05454327994311516,"gpt":0.3307901029468239,"spread":0.2762468230037087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414741,0.0001334325,0.0004407395,0.001390345,0.00006584293,0.00006020963,0.0002383938,0.00009289879,0.0005531628],"category_scores_gemma":[0.0008559049,0.000110842,0.0004549285,0.004373194,0.00002253413,0.0001203669,0.0000145484,0.0002620672,0.00003659463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008159474,"about_ca_system_score_gemma":0.00005771631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.577292e-7,"about_ca_topic_score_gemma":7.053155e-7,"domain_scores_codex":[0.9984671,0.0000503144,0.000667567,0.0001158636,0.0004903275,0.0002088658],"domain_scores_gemma":[0.9980834,0.0003648653,0.0006494211,0.0002707202,0.0004244173,0.0002071526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003287604,0.01545843,0.2445078,0.000618179,0.02074083,0.0004210432,0.004105055,0.00108152,0.02444921,0.4069059,0.2137952,0.06758807],"study_design_scores_gemma":[0.004312171,0.0003935288,0.03856926,0.00004245967,0.003960128,0.0004044041,0.0008199657,0.0003654871,0.02372446,0.7568405,0.1694902,0.001077421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6120533,0.0004869872,0.3769212,0.001073542,0.0002096986,0.0001560777,0.0000237839,0.0000480468,0.009027358],"genre_scores_gemma":[0.8896548,0.00009286894,0.1095979,0.0001498082,0.00007080082,0.000002486743,0.000001785575,0.0000175875,0.0004119397],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3499345,"threshold_uncertainty_score":0.6056744,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04583214867724841,"gpt":0.3374958247437084,"spread":0.29166367606646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045584,0.00008576897,0.0002074616,0.0004459753,0.00007381155,0.00005389771,0.0001929276,0.00005198517,0.00004157989],"category_scores_gemma":[0.0002522052,0.00005817296,0.00007415852,0.0008140735,0.00004514953,0.0002217632,0.00001947224,0.0001218757,0.000001412782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003286413,"about_ca_system_score_gemma":0.00002028009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006623527,"about_ca_topic_score_gemma":0.000003780052,"domain_scores_codex":[0.99902,0.00003474196,0.0004169742,0.00006869443,0.0003493959,0.0001101412],"domain_scores_gemma":[0.998645,0.0003337371,0.0004089078,0.0001914217,0.0003207547,0.0001001626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008089102,0.003469474,0.1323778,0.001033824,0.0007166024,0.00004159286,0.05313156,0.002634714,0.1884535,0.4864577,0.04926922,0.08160503],"study_design_scores_gemma":[0.004687394,0.001452384,0.1627779,0.0002181217,0.000529648,0.001939363,0.01814721,0.004587888,0.1920678,0.5704955,0.04206058,0.001036143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9579073,0.0001491766,0.03932207,0.002136681,0.00005740692,0.0001234457,0.000007605086,0.00001001811,0.0002862781],"genre_scores_gemma":[0.9796994,0.0001455408,0.01968072,0.0002005041,0.000113206,0.000004039799,0.000001286355,0.00001150814,0.0001437761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08403786,"threshold_uncertainty_score":0.2372224,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","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","retraction":null,"screen_n_in":null,"score":{"opus":0.09392853624470889,"gpt":0.3342651369320856,"spread":0.2403366006873767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001780944,0.0001471353,0.0001336597,0.00006800026,0.001113133,0.00009882267,0.0001626363,0.0000671139,0.0006353267],"category_scores_gemma":[0.000006540957,0.0001170012,0.00008243672,0.0002637411,0.0001458792,0.0001470325,0.000001107365,0.0003138301,0.0002777267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004385056,"about_ca_system_score_gemma":0.0000411712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001519595,"about_ca_topic_score_gemma":0.00001123729,"domain_scores_codex":[0.9988497,0.00008825924,0.0002640264,0.000259353,0.000330089,0.0002084995],"domain_scores_gemma":[0.9993185,0.0001579625,0.0001101616,0.0001725633,0.0001659509,0.00007489991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006888609,0.002493928,0.0002901662,0.0001277491,0.0004322616,0.00001270785,0.01138867,0.01306349,0.3809367,0.0006183125,0.003701369,0.5862458],"study_design_scores_gemma":[0.002692168,0.0009399653,0.000704348,0.0006484226,0.0007103434,0.00004196783,0.003005461,0.1637692,0.7892778,0.02619298,0.01068794,0.001329475],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.226804,0.00001669737,0.7709214,0.0005065757,0.00008825476,0.000175331,0.000008751842,0.0002619936,0.001216927],"genre_scores_gemma":[0.9945645,0.000001530902,0.004407184,0.0002421997,0.0002140515,0.0000618277,0.000002155556,0.00003029092,0.000476234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7677605,"threshold_uncertainty_score":0.8561434,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08355092090534687,"gpt":0.3692820240649891,"spread":0.2857311031596422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002926259,0.0002802679,0.0003910198,0.0001117051,0.0002103174,0.0001193163,0.0002179434,0.0001982484,0.000223005],"category_scores_gemma":[0.00004155869,0.0002322222,0.0001517302,0.00005227791,0.0001184477,0.000008664562,0.0003220722,0.0001737551,0.00004697783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005415242,"about_ca_system_score_gemma":0.00003678103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000207557,"about_ca_topic_score_gemma":0.000002637032,"domain_scores_codex":[0.9985221,0.00002731394,0.000427009,0.0005443521,0.0002080279,0.0002711747],"domain_scores_gemma":[0.9986817,0.0002014922,0.0002103662,0.0005482542,0.0002197912,0.0001384152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007539691,0.001483255,0.00008607353,0.001452756,0.0003539697,0.000003077597,0.0009110616,0.0002630727,0.0006817002,0.8527111,0.135282,0.006696552],"study_design_scores_gemma":[0.001397151,0.0001705324,0.0008767389,0.0004183677,0.0003836495,0.00003115902,0.0004371724,0.336969,0.003003125,0.5831429,0.07200209,0.001168067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2426854,0.0002899101,0.7419249,0.005923563,0.0005066147,0.003229812,0.0006143411,0.0005044431,0.004321017],"genre_scores_gemma":[0.1628108,0.00009968781,0.8217201,0.0008179169,0.0008901526,0.001773873,0.0001824711,0.0001476962,0.01155733],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.336706,"threshold_uncertainty_score":0.9469748,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09798327447700858,"gpt":0.3446395261055927,"spread":0.2466562516285841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003122112,0.0001838614,0.0002864578,0.00008177556,0.0005757607,0.0002209064,0.0003426266,0.0001886139,0.00006038533],"category_scores_gemma":[0.0003837713,0.0001732297,0.0001200435,0.0004424642,0.00003249598,0.0004506619,0.0001886613,0.0001919439,0.0001953859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006127297,"about_ca_system_score_gemma":0.0001000542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008480152,"about_ca_topic_score_gemma":0.000006010838,"domain_scores_codex":[0.9984466,0.00006887758,0.000581479,0.0002291015,0.0003961985,0.0002777844],"domain_scores_gemma":[0.9976148,0.000627944,0.000387771,0.0008080406,0.0004705975,0.00009084819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001592019,0.0006489975,0.0001011745,0.0007417576,0.00007379489,0.00000279479,0.002062427,0.001200294,0.001702302,0.6298926,0.2906721,0.07274258],"study_design_scores_gemma":[0.002119929,0.00007784106,0.0008319295,0.0004429252,0.0001750708,0.00001978032,0.001052591,0.1871546,0.001252173,0.1153232,0.6908558,0.000694257],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07894764,0.00005043469,0.908356,0.004089453,0.001258749,0.001616727,0.00134823,0.0005819374,0.003750791],"genre_scores_gemma":[0.8774436,0.00002379906,0.1079196,0.00223438,0.003021345,0.0004684002,0.00838928,0.00006085863,0.0004387387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8004365,"threshold_uncertainty_score":0.7064103,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03813556859912001,"gpt":0.306795895461837,"spread":0.268660326862717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004155247,0.000202644,0.0002494122,0.0003601545,0.0006515977,0.0002024835,0.0002628487,0.0001256554,0.0001305005],"category_scores_gemma":[0.00008578532,0.0001938295,0.0001520552,0.0003649548,0.00004828504,0.0006945527,0.000002871391,0.0001193986,0.0005489787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002326918,"about_ca_system_score_gemma":0.00004905429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002172031,"about_ca_topic_score_gemma":0.00001290766,"domain_scores_codex":[0.9984037,0.00007493338,0.0008489271,0.0001841228,0.0002429993,0.0002452958],"domain_scores_gemma":[0.997719,0.0005102904,0.0003927732,0.000670972,0.0005898165,0.0001171234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002136713,0.002144273,0.0001785208,0.008211018,0.001147413,0.000001887595,0.01123628,0.02080787,0.001557581,0.6261604,0.0785866,0.2478314],"study_design_scores_gemma":[0.005200606,0.0007212174,0.00009359678,0.000529768,0.0002673433,0.00009651963,0.008400592,0.5425096,0.007971285,0.004758107,0.4284503,0.001001072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007595949,0.000001850078,0.9906396,0.001116933,0.0007309647,0.001573876,0.0002108769,0.0006254462,0.004340809],"genre_scores_gemma":[0.9561923,7.195661e-7,0.04125729,0.0004856258,0.0001583541,0.001574157,0.0001562812,0.0000288697,0.0001464321],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9554327,"threshold_uncertainty_score":0.7904137,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0669231010285452,"gpt":0.3303438513410061,"spread":0.2634207503124609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006460437,0.00008966246,0.0001293668,0.00004626427,0.00008765439,0.00002853124,0.0000849939,0.00004947222,0.000443253],"category_scores_gemma":[0.00007469338,0.00008951178,0.00008203986,0.0002438904,0.00002351778,0.0000345562,0.00003152986,0.0001075788,0.0001826946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003033818,"about_ca_system_score_gemma":0.00003523568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003055861,"about_ca_topic_score_gemma":0.000002165865,"domain_scores_codex":[0.9993407,0.00003381693,0.0001557572,0.0001908706,0.0001321266,0.0001466864],"domain_scores_gemma":[0.999281,0.0001924772,0.00004782882,0.0003076889,0.000104854,0.00006608992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002423704,0.0009603411,0.0007619858,0.0001312298,0.0001533841,0.0001742758,0.0002703032,0.00004213162,0.04390322,0.8865844,0.04052057,0.02647391],"study_design_scores_gemma":[0.002952097,0.0001503685,0.008753874,0.0002855767,0.0002090187,0.000208791,0.002166713,0.0241814,0.4298133,0.460815,0.06908508,0.001378799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2280081,0.0002747054,0.6525566,0.005642577,0.0005018027,0.0005067817,0.0002272487,0.000981426,0.1113007],"genre_scores_gemma":[0.7109756,0.000002677414,0.2860232,0.0007348692,0.00012088,0.00003778831,0.00002485846,0.00002722731,0.002052834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4829675,"threshold_uncertainty_score":0.4853309,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02107124498745568,"gpt":0.336864662001912,"spread":0.3157934170144563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005033144,0.0001872031,0.0003794711,0.0004047823,0.0007128883,0.000158564,0.0002170887,0.00007591106,0.0001007254],"category_scores_gemma":[0.0001022108,0.0001512185,0.0003730079,0.0006404635,0.00007376003,0.00005998466,0.00002110881,0.000204231,0.00005447871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003254234,"about_ca_system_score_gemma":0.00001378252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002328747,"about_ca_topic_score_gemma":0.000007216137,"domain_scores_codex":[0.9986889,0.00006696872,0.0005049555,0.0003038548,0.0002057729,0.0002295076],"domain_scores_gemma":[0.9980274,0.0007808588,0.0003581297,0.0004083279,0.0002110081,0.00021421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001965143,0.0002348301,0.0001643875,0.00002524454,0.0003575792,2.719409e-7,0.0000542964,0.0008188864,0.000851252,0.9855895,0.001609503,0.01027459],"study_design_scores_gemma":[0.001402127,0.0002153604,0.003487205,0.00003428758,0.003201572,0.00006784959,0.0002385706,0.05461184,0.0003359724,0.794996,0.1408255,0.0005837081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02380157,0.00006203527,0.9725561,0.00171266,0.00002130743,0.0005326898,0.00006320036,0.00008589283,0.001164596],"genre_scores_gemma":[0.9597341,0.00007031726,0.03746924,0.0003199221,0.0004318434,0.0004183069,0.00004378123,0.00003764619,0.001474791],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9359326,"threshold_uncertainty_score":0.6166512,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03385905977859983,"gpt":0.2914576829439053,"spread":0.2575986231653055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001998208,0.00007161401,0.0001507287,0.0001528014,0.0001312377,0.00005572168,0.0001066901,0.00003819625,0.00006194512],"category_scores_gemma":[0.0001742336,0.00006407691,0.00004674602,0.0001056434,0.00004971756,0.00008355668,0.000002560818,0.0001147236,0.000009646091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003454027,"about_ca_system_score_gemma":0.000220088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009342754,"about_ca_topic_score_gemma":0.0002244692,"domain_scores_codex":[0.9993612,0.00001501751,0.000341722,0.0000520991,0.0001143286,0.0001156962],"domain_scores_gemma":[0.9990359,0.000165102,0.0002100056,0.00009479895,0.0001947074,0.0002995082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.859885e-7,0.00006400037,0.000142387,0.0000199869,0.00002034583,0.00001446908,0.001202373,0.00004541519,0.00006171955,0.9891237,0.00799818,0.001306613],"study_design_scores_gemma":[0.0002211089,0.00005666548,0.002928055,0.00005116254,0.00003716476,0.0005547646,0.0002745594,0.001064194,0.00004316651,0.9932064,0.001482799,0.00007989645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9162667,0.0001563421,0.06884842,0.01028789,0.00007132266,0.0002388135,0.00002566202,0.00002458628,0.004080206],"genre_scores_gemma":[0.8214156,0.000002446001,0.1781437,0.0002918456,0.00004837072,0.000001173953,0.000001785777,0.000006967218,0.00008819352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1092952,"threshold_uncertainty_score":0.2612981,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1279337369265122,"gpt":0.39441474150445,"spread":0.2664810045779378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196612,0.0001184622,0.0002820326,0.00009391694,0.00008823429,0.00001552602,0.000368195,0.00005634996,0.000040585],"category_scores_gemma":[0.0008537723,0.0000743108,0.000157104,0.0002173182,0.0001056039,0.00005392836,0.00003016484,0.0002999007,0.00002073475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003716248,"about_ca_system_score_gemma":0.00004440053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000159628,"about_ca_topic_score_gemma":0.000003579004,"domain_scores_codex":[0.9985057,0.00005842646,0.0007615209,0.0000738605,0.0004486823,0.0001518622],"domain_scores_gemma":[0.9954457,0.002830316,0.0009470716,0.0003367379,0.000363867,0.00007631825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003349852,0.0006228313,0.00005319617,0.0001379626,0.00006810309,0.00002301795,0.002033348,0.00001377098,0.01263337,0.9798371,0.002176658,0.002367197],"study_design_scores_gemma":[0.0005355268,0.0003361941,0.0002776501,0.0008782105,0.0001297313,0.0007166528,0.002669544,0.001179772,0.0551277,0.9372415,0.0006898671,0.0002176668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8861827,0.00002741932,0.1095123,0.001325772,0.00007777281,0.0001952083,0.00002889306,0.00001627452,0.002633575],"genre_scores_gemma":[0.9203254,0.00001460648,0.07929689,0.0001828169,0.0000879655,0.000001798483,5.884519e-7,0.00001490789,0.0000750533],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04259556,"threshold_uncertainty_score":0.3030306,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05775930115895453,"gpt":0.3655814746799569,"spread":0.3078221735210024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002684736,0.0001279322,0.0003163435,0.00003695624,0.0001337327,0.00004591539,0.0004978332,0.00003035325,0.0000230684],"category_scores_gemma":[0.00006195321,0.00008389414,0.0001561901,0.00008602117,0.0001186043,0.0001793531,0.00004375956,0.0001398254,0.000001249865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002176019,"about_ca_system_score_gemma":0.00004794203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002670395,"about_ca_topic_score_gemma":0.000001605971,"domain_scores_codex":[0.9990993,0.00003827535,0.0003553016,0.000112291,0.0002745511,0.0001202995],"domain_scores_gemma":[0.9980482,0.0003416197,0.0006904295,0.0004769538,0.000375963,0.00006677578],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008238273,0.0006911472,0.0001669221,0.000142277,0.0003150226,7.485096e-7,0.001297743,0.0008450744,0.967034,0.0227375,0.003479745,0.002466035],"study_design_scores_gemma":[0.0005644874,0.0001599321,0.0005996667,0.0002105259,0.0002265859,0.00002450527,0.0002419493,0.004564611,0.9331534,0.0600686,0.00006368957,0.0001220601],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.413505,0.000005783373,0.5832472,0.002806348,0.00002730288,0.0001681464,0.00004382045,0.000008746989,0.0001876839],"genre_scores_gemma":[0.7509786,0.000001070013,0.2486528,0.00009321782,0.000217759,0.000005221841,0.000006145154,0.00001791361,0.00002723368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3374737,"threshold_uncertainty_score":0.3421104,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09840809197825819,"gpt":0.4034310336513257,"spread":0.3050229416730675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168775,0.0002578334,0.0006876765,0.0001143769,0.0002433274,0.00007226066,0.000595773,0.0001720345,0.0002736369],"category_scores_gemma":[0.0004410851,0.0001322193,0.0001997,0.0001359705,0.0005196382,0.0002797845,0.0001082956,0.0003964174,0.00019115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004492134,"about_ca_system_score_gemma":0.00003283103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.448065e-7,"about_ca_topic_score_gemma":2.439679e-7,"domain_scores_codex":[0.997327,0.0002572807,0.001303463,0.0002542681,0.0004596816,0.0003983037],"domain_scores_gemma":[0.9928458,0.005246517,0.0007498252,0.0006029072,0.0002521637,0.0003027269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000257778,0.00116578,0.0001008963,0.0003323438,0.0004587348,0.00009002296,0.001231213,0.000009929279,0.02843306,0.9218041,0.02633752,0.01977868],"study_design_scores_gemma":[0.00106625,0.0001469279,0.000405086,0.0002394168,0.0001411354,0.0009683328,0.0001045892,0.0002906331,0.0006871999,0.9952365,0.0005256799,0.0001883197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5415461,0.000310536,0.4198493,0.0205065,0.0001682517,0.0004664497,0.0000225519,0.00007843303,0.0170519],"genre_scores_gemma":[0.9559278,0.0001853462,0.04118045,0.0004896002,0.0003255782,0.00002797184,5.654202e-7,0.00005947048,0.001803231],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4143817,"threshold_uncertainty_score":0.5391749,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009589296351073215,"gpt":0.2542805308584959,"spread":0.2446912345074227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001241081,0.0002256028,0.0001981944,0.0002566985,0.0001428131,0.00004643717,0.0001534768,0.00008200848,0.000134804],"category_scores_gemma":[9.128396e-7,0.0002336184,0.0001378955,0.0002181108,0.00001003872,0.0001000331,0.000001442028,0.0001228394,0.00009933616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001225194,"about_ca_system_score_gemma":0.000007000022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009994083,"about_ca_topic_score_gemma":0.00000512304,"domain_scores_codex":[0.998858,0.00001413896,0.0003114856,0.0003453883,0.0002100559,0.0002609054],"domain_scores_gemma":[0.9992403,0.0001430373,0.00006880861,0.0003929456,0.00008105927,0.00007388127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001038747,0.0007517859,0.000009394539,0.001046702,0.0002600148,0.000002182784,0.0001240058,0.9628285,0.01947059,0.01112136,0.0001939461,0.004087651],"study_design_scores_gemma":[0.003789334,0.0002597288,0.0015246,0.0002804452,0.000361568,0.000004696552,0.000146461,0.9455861,0.0411814,0.001483943,0.004835493,0.0005462424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1017538,0.000004063977,0.8952289,0.0002710016,0.0005014254,0.001509249,0.0001520844,0.0003888949,0.0001905953],"genre_scores_gemma":[0.8829106,0.000007358861,0.1155462,0.0001173644,0.0000438225,0.0007895408,0.00004774353,0.00005543104,0.0004819224],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7811568,"threshold_uncertainty_score":0.9526683,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03594702329380341,"gpt":0.3001545632784299,"spread":0.2642075399846265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001399667,0.000307344,0.0003707568,0.00009645197,0.0001848806,0.00002617172,0.0001849053,0.0004158948,0.001425869],"category_scores_gemma":[0.00002158014,0.0002884468,0.0002508589,0.000006030916,0.00011727,0.00001628443,0.00008961032,0.0007439255,0.001104194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003213004,"about_ca_system_score_gemma":0.00005005443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.771306e-8,"about_ca_topic_score_gemma":0.000005753446,"domain_scores_codex":[0.9987511,0.00001010798,0.0004139752,0.0003498126,0.000289022,0.000185984],"domain_scores_gemma":[0.9987053,0.0001942554,0.0002341957,0.0006028768,0.0001280903,0.000135249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003483846,0.00001700289,2.860705e-7,0.00003657133,0.00004570501,0.000008064468,0.00007012275,6.169106e-8,0.001441492,0.5691955,0.0005137242,0.428668],"study_design_scores_gemma":[0.0001236634,0.00000504895,0.000001958968,0.0001130009,0.00006308947,0.00002087795,0.000001529624,0.000006540904,0.0003643872,0.323371,0.6757028,0.0002260504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002103835,0.0000611021,0.00008917123,0.0001666998,0.0002326602,0.0004338927,0.00005417542,0.0001987519,0.9985532],"genre_scores_gemma":[0.0002745861,0.000007056473,0.04818783,0.0003298717,0.0003638503,0.00004121747,0.00003630829,0.0001026305,0.9506567],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6751891,"threshold_uncertainty_score":0.9999568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}