{"meta":{"query_hash":"a544a3ad79b2","filters":{"topic":"Tensor decomposition and applications"},"cohort_total":314,"direct_labels_cover":0,"predictions_cover":314,"exported":314,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a544a3ad79b2","api":"https://metacan.xera.ac/api/v1/cohort?topic=Tensor+decomposition+and+applications"},"results":[{"id":"W1501282291","doi":"10.22329/amr.v13i1.2833","title":"Analysing Three-way Profile Data Using the Parafac and Tucker3 Models Illustrated with Views on Parenting","year":2009,"lang":"en","type":"article","venue":"Applied Multivariate Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Style (visual arts); Parenting styles; Psychology; Curse of dimensionality; Developmental psychology; Control (management); Social psychology; Point (geometry); Computer science; Artificial intelligence; Mathematics","score_opus":0.5522684246707468,"score_gpt":0.4895521336071181,"score_spread":0.06271629106362869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501282291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80561286,0.00007966706,0.17189695,0.0018552496,0.000017399616,0.0033900435,0.00011261622,0.00024361264,0.016791632],"genre_scores_gemma":[0.9573505,0.000011275879,0.042270474,0.00006132857,0.00006486636,0.00006474661,0.000081839426,0.000028803206,0.00006614297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776965,0.00017257518,0.00034183596,0.0006043754,0.00060671434,0.00050487183],"domain_scores_gemma":[0.9977425,0.00061419606,0.00013343185,0.0012182898,0.0001738905,0.00011770757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016507314,0.00019843366,0.00027214322,0.00014291308,0.00087260286,0.00024322301,0.0005372785,0.00008418906,0.00003284066],"category_scores_gemma":[0.000056662746,0.00012400598,0.000026350635,0.0007389809,0.00016325692,0.00015488052,0.00019959157,0.00056815566,0.000020714006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005737119,0.0013363726,0.0001767213,0.00013069015,0.00037599582,0.00002104082,0.0029688363,0.0057081003,0.14274792,0.7848713,0.0018328486,0.05925645],"study_design_scores_gemma":[0.0012691905,0.000089009896,0.0017348176,0.00015722068,0.000108631684,0.000016455435,0.0013251274,0.86047846,0.0036256032,0.130367,0.0004380431,0.00039045358],"about_ca_topic_score_codex":0.00010487708,"about_ca_topic_score_gemma":0.000053131454,"teacher_disagreement_score":0.85477036,"about_ca_system_score_codex":0.000052656378,"about_ca_system_score_gemma":0.000063952604,"threshold_uncertainty_score":0.6711444},"labels":[],"label_agreement":null},{"id":"W1546510688","doi":"10.5220/0002982000800084","title":"MULTIMETRIC NETWORK TOMOGRAPHY","year":2010,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Network tomography; Metric (unit); Computer science; Path (computing); Algorithm; Factorization; Link (geometry); Network packet; Tomography; Artificial intelligence; Computer network; Physics; Optics","score_opus":0.026871061522596197,"score_gpt":0.31311952541448407,"score_spread":0.28624846389188785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546510688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6035687,0.000017754586,0.05959132,0.0014009273,0.0004369346,0.00042003242,0.00000644073,0.0009253981,0.3336325],"genre_scores_gemma":[0.74577606,7.812697e-7,0.25210613,0.00023324703,0.00013603529,0.000018538307,0.0000023034872,0.0000077943,0.0017190995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996399,0.0000060394154,0.0000985358,0.000085941916,0.000064429376,0.00010512566],"domain_scores_gemma":[0.9995159,0.0001513138,0.000026278689,0.0002210217,0.000032033946,0.000053432188],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000074730866,0.000047725014,0.000059542817,0.000058828162,0.0000706256,0.000018109457,0.00008733317,0.000037761958,0.0015144314],"category_scores_gemma":[0.000027594271,0.000039189406,0.000053658936,0.00042615866,0.00001897427,0.000024655132,0.000014356382,0.000107713575,0.00023832727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.904734e-7,0.0000926059,0.0019468344,0.0000026648997,0.000008939131,3.4993772e-7,0.000015425769,0.0000011824277,0.002922638,0.9051106,0.08634674,0.003551011],"study_design_scores_gemma":[0.00044551838,0.000019504761,0.02482944,0.0000039625215,0.00003072547,0.000018554623,0.00002516612,0.0015150065,0.0034943966,0.7859791,0.18336162,0.00027700435],"about_ca_topic_score_codex":0.000003770501,"about_ca_topic_score_gemma":0.000019910176,"teacher_disagreement_score":0.3319134,"about_ca_system_score_codex":0.0000014291904,"about_ca_system_score_gemma":0.0000030244075,"threshold_uncertainty_score":0.9993983},"labels":[],"label_agreement":null},{"id":"W1550321157","doi":"10.5539/jmr.v7n2p175","title":"A Shifted Power Method for Homogenous Polynomial Optimization over Unit Spheres","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; SPHERES; Convergence (economics); Polynomial; Unit (ring theory); Scope (computer science); Mathematical optimization; Power (physics); Global optimization; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.29759129457076805,"score_gpt":0.5054339490502334,"score_spread":0.20784265447946537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550321157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063040525,0.0000942057,0.9308277,0.0010265466,0.000119936674,0.00071296445,0.000029627452,0.000034127024,0.004114401],"genre_scores_gemma":[0.035248596,0.000010419884,0.9634133,0.000043588123,0.00022034126,0.00003529279,0.000003809095,0.00005470786,0.00096991815],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976066,0.00023921057,0.00074640627,0.00012798335,0.00095631013,0.00032350558],"domain_scores_gemma":[0.9951254,0.0019383336,0.00041937624,0.00033994595,0.0018922344,0.00028466928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003813774,0.0001311798,0.00037073804,0.00033623588,0.00015614249,0.00013939395,0.0004326995,0.00012011731,0.0003837326],"category_scores_gemma":[0.001982907,0.00010531275,0.00017068916,0.00040239608,0.00006780949,0.00015597217,0.00007504075,0.00038431326,0.000022643566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008032283,0.0064576943,0.00013558118,0.0007457419,0.00073743163,0.000064006585,0.013732673,0.0064123585,0.009105369,0.3683537,0.5909791,0.0024731313],"study_design_scores_gemma":[0.004846432,0.0011945814,0.000039641884,0.00025595978,0.00016374614,0.00052755396,0.010062891,0.09771859,0.0036238085,0.8594327,0.021734802,0.00039927804],"about_ca_topic_score_codex":0.0000085051915,"about_ca_topic_score_gemma":0.000010686209,"teacher_disagreement_score":0.56924427,"about_ca_system_score_codex":0.00013220489,"about_ca_system_score_gemma":0.00030917415,"threshold_uncertainty_score":0.42945293},"labels":[],"label_agreement":null},{"id":"W1576571322","doi":"10.48550/arxiv.1407.5183","title":"A Nonlinearly Preconditioned Conjugate Gradient Algorithm for Rank-R Canonical Tensor Approximation","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preconditioner; Conjugate gradient method; Convergence (economics); Rank (graph theory); Nonlinear conjugate gradient method; Tensor (intrinsic definition); Acceleration; Mathematics; Nonlinear system; Applied mathematics; Algorithm; Mathematical optimization; Computer science; Iterative method; Gradient descent; Pure mathematics; Physics; Artificial intelligence; Combinatorics; Artificial neural network","score_opus":0.09412979962344337,"score_gpt":0.24672262033258843,"score_spread":0.15259282070914507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576571322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17647435,0.000008026223,0.81924677,0.000270177,0.00024167387,0.0017217018,0.00080315245,0.00032416877,0.0009099946],"genre_scores_gemma":[0.90707374,0.000031026757,0.08780725,0.00018969583,0.00031494678,0.00008584219,0.0010543824,0.000076736054,0.0033663705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998162,0.0001215177,0.0004194563,0.0008627515,0.000095213385,0.00033911783],"domain_scores_gemma":[0.99770015,0.00042459983,0.0004737962,0.00080860924,0.00038768907,0.00020514133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028175916,0.00035220783,0.0005206533,0.00019351415,0.0002638224,0.000082789404,0.00046678656,0.00037465655,0.00010839162],"category_scores_gemma":[0.00007635935,0.0003983982,0.00039824637,0.00018391566,0.00013324255,0.00011034514,0.00020131601,0.00041265364,0.00009434525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018989596,0.0017493016,0.000107739,0.0007769351,0.00064051815,0.000030442796,0.00041562718,0.012725813,0.00027425532,0.96994483,0.009859975,0.0032846623],"study_design_scores_gemma":[0.0018110956,0.00010072733,0.0001376066,0.000102421815,0.0004049307,0.00000932164,0.0000688402,0.62155974,0.00031255686,0.3721603,0.002808891,0.00052354834],"about_ca_topic_score_codex":0.000032412532,"about_ca_topic_score_gemma":0.000032902775,"teacher_disagreement_score":0.73143953,"about_ca_system_score_codex":0.00022130093,"about_ca_system_score_gemma":0.00012965404,"threshold_uncertainty_score":0.9998468},"labels":[],"label_agreement":null},{"id":"W1600006467","doi":"10.1007/978-1-4939-0626-0_2","title":"Four Lectures on Secant Varieties","year":2014,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"","keywords":"Algebra over a field; Mathematics education; Computer science; Mathematics; Calculus (dental); Pure mathematics; Medicine","score_opus":0.045412482778699984,"score_gpt":0.2926905192322903,"score_spread":0.2472780364535903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600006467","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034394127,0.000056499717,0.16313118,0.00034371045,0.00029157105,0.0014432665,0.00038738368,0.0004486241,0.83355385],"genre_scores_gemma":[0.007672228,0.00020996384,0.6172365,0.00042495143,0.0005455598,0.00020235602,0.00005809316,0.00052676164,0.3731236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690104,0.000007862246,0.0011497308,0.0006413007,0.00081284536,0.00048720394],"domain_scores_gemma":[0.99714667,0.0009089817,0.00088032027,0.0005039877,0.00039795035,0.00016210706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052535604,0.0007582828,0.0010049291,0.00042332144,0.00017239661,0.0002044779,0.0005554935,0.00048712405,0.00049794005],"category_scores_gemma":[0.00055150606,0.00072962145,0.00015758745,0.000066913286,0.00018271363,0.00004255116,0.00016267595,0.0010448834,0.00038251057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010869967,0.000103049315,0.0000042773177,0.0013082167,0.000070287344,0.000014535513,0.00094305055,0.0000036379545,0.00004936498,0.97003245,0.02646449,0.0009957532],"study_design_scores_gemma":[0.00029910417,0.000096941105,0.00001828582,0.00075808674,0.00015339098,0.000028367176,0.00005373347,0.00078318507,0.00012867464,0.9258005,0.07118054,0.00069920404],"about_ca_topic_score_codex":0.0000031388236,"about_ca_topic_score_gemma":0.000020215155,"teacher_disagreement_score":0.46043023,"about_ca_system_score_codex":0.00022522137,"about_ca_system_score_gemma":0.0000696719,"threshold_uncertainty_score":0.9995155},"labels":[],"label_agreement":null},{"id":"W1605320307","doi":"10.22329/amr.v13i1.2834","title":"Three-way Hierarchical Classes: A Comparison of the Indclas and Tucker3-Hiclas Models","year":2009,"lang":"en","type":"article","venue":"Applied Multivariate Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mode (computer interface); Computer science; Relation (database); Binary number; Hierarchical database model; Theoretical computer science; Data mining; Mathematics; Arithmetic","score_opus":0.21472050808779775,"score_gpt":0.45144523439945616,"score_spread":0.23672472631165842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605320307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8682496,0.00010149441,0.07212471,0.007561543,0.000048238937,0.0028061375,0.00004624469,0.00018446958,0.04887754],"genre_scores_gemma":[0.9812089,0.000010775687,0.018421778,0.00007245048,0.00005403697,0.0001017625,0.0000047786425,0.000022532893,0.00010294424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778146,0.00015402393,0.00047190968,0.00038884638,0.0007597314,0.00044403956],"domain_scores_gemma":[0.9976441,0.0011811826,0.00012385493,0.00069355377,0.00020170795,0.00015558822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008754151,0.00017036167,0.00035407193,0.00015084347,0.00040879982,0.00006684845,0.0004935413,0.0001779793,0.000034062075],"category_scores_gemma":[0.00012448178,0.0001204679,0.00007717265,0.0005981433,0.00037324123,0.00006538135,0.00023866566,0.0009030019,0.000023586957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077177625,0.0005694315,0.00012779252,0.000032047366,0.00002673854,5.016855e-7,0.0012097997,0.00004546796,0.042487897,0.9452148,0.0016137019,0.008594643],"study_design_scores_gemma":[0.0009559967,0.00007263428,0.009153613,0.00004457759,0.000019494792,0.0000039080205,0.00036943384,0.03160326,0.008813652,0.9480242,0.00078193564,0.00015729532],"about_ca_topic_score_codex":0.00006697717,"about_ca_topic_score_gemma":0.000050499133,"teacher_disagreement_score":0.11295932,"about_ca_system_score_codex":0.000055042503,"about_ca_system_score_gemma":0.00007930506,"threshold_uncertainty_score":0.49125382},"labels":[],"label_agreement":null},{"id":"W1608676567","doi":"10.1002/9780470689646.ch2","title":"Algebraic Techniques for Multilingual Document Clustering","year":2010,"lang":"en","type":"other","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sandia National Laboratories; National Nuclear Security Administration; McGill University","keywords":"Cluster analysis; Algebraic number; Computer science; Information retrieval; Document clustering; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.032267963136136786,"score_gpt":0.36689166341004936,"score_spread":0.3346237002739126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608676567","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001922361,0.000017469776,0.19766298,0.00026039206,0.00013942228,0.0014699089,0.00005931292,0.001600141,0.79877114],"genre_scores_gemma":[0.00010097071,0.000006083238,0.4226539,0.0001219185,0.00025908742,0.0003662903,0.000027184486,0.0002344075,0.57623017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993885,0.00000633371,0.00018211792,0.0002081017,0.00008215462,0.0001327558],"domain_scores_gemma":[0.9993669,0.000090790985,0.00012263509,0.00034724583,0.000026665379,0.000045775952],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007215215,0.00016190698,0.00019751888,0.000103841565,0.000039407147,0.000030907344,0.00015573364,0.00025883972,0.0039747586],"category_scores_gemma":[0.000024345141,0.00013988969,0.00009655649,0.000029514957,0.000023414264,0.00001098867,0.000041518262,0.00013497261,0.000065881],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024793349,0.00006602175,3.8503987e-7,0.00015213025,0.000032836197,3.698081e-7,0.00003497073,1.4220568e-8,0.0012475061,0.09063915,0.8889233,0.018900828],"study_design_scores_gemma":[0.0001437967,0.000012855335,3.0319794e-7,0.00006230397,0.000027851544,0.0000038334388,0.00001356904,0.000038070433,0.0060136477,0.039771084,0.9537295,0.00018316373],"about_ca_topic_score_codex":0.000024548803,"about_ca_topic_score_gemma":0.0003779961,"teacher_disagreement_score":0.22499093,"about_ca_system_score_codex":0.000014519056,"about_ca_system_score_gemma":0.000012893193,"threshold_uncertainty_score":0.9969357},"labels":[],"label_agreement":null},{"id":"W1780038108","doi":"10.1090/s0002-9939-01-06251-7","title":"On the secant varieties to the tangential varieties of a Veronesean","year":2001,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Università di Bologna","keywords":"Mathematics; Tangent; Pure mathematics; Infinitesimal; Conjecture; Line (geometry); Quadratic equation; Mathematical analysis; Geometry","score_opus":0.03045666333862183,"score_gpt":0.29416563218783864,"score_spread":0.2637089688492168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780038108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9499692,0.000009981867,0.0051219193,0.032109126,0.000037132173,0.0008737965,0.000020418824,0.00007051893,0.011787923],"genre_scores_gemma":[0.9896407,0.0000141510145,0.008098424,0.0013758617,0.00006739423,0.00013000467,3.1413623e-7,0.000026141164,0.00064697367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985412,0.000022467675,0.0004093531,0.00018562897,0.0005954302,0.00024594628],"domain_scores_gemma":[0.9980432,0.00083410915,0.0004577659,0.00035445188,0.0002451109,0.000065409986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190693,0.00017423024,0.0003509126,0.000016631906,0.00031268926,0.000050480376,0.00088112237,0.000037008092,0.00016353643],"category_scores_gemma":[0.0005101438,0.00008003724,0.00037454438,0.0006368066,0.00081245776,0.00004075826,0.000257752,0.00023425586,0.000025930323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003348472,0.0002702842,0.00007042565,0.00008773711,0.00010453446,3.3813834e-8,0.0056886096,0.000004779793,0.0044549727,0.93872595,0.05042781,0.00013138617],"study_design_scores_gemma":[0.00013709879,0.0001408229,0.0007432688,0.00007351908,0.0001285441,0.00001094005,0.009646901,0.000724668,0.0057222485,0.98050296,0.0020183842,0.0001506545],"about_ca_topic_score_codex":0.000016725831,"about_ca_topic_score_gemma":0.0000011125265,"teacher_disagreement_score":0.048409425,"about_ca_system_score_codex":0.000038851023,"about_ca_system_score_gemma":0.000022243914,"threshold_uncertainty_score":0.3263824},"labels":[],"label_agreement":null},{"id":"W179999808","doi":"10.1016/j.jpaa.2004.12.049","title":"Higher secant varieties of the Segre varieties <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>×</mml:mo><mml:mo>⋯</mml:mo><mml:mo>×</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>","year":2005,"lang":"lv","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Subvariety; Mathematics; Dimension (graph theory); Conjecture; Closure (psychology); Combinatorics; Variety (cybernetics); Statistics; Law","score_opus":0.018973413149533394,"score_gpt":0.24114351898782507,"score_spread":0.22217010583829166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179999808","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3672428,0.00322166,0.0025000896,0.0036725304,0.005191345,0.00020291217,0.0016379642,0.0006415275,0.61568916],"genre_scores_gemma":[0.9675754,0.003522675,0.008840893,0.003955061,0.007016313,0.0028799677,0.0021942535,0.002507572,0.0015079143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9745205,0.0012042457,0.006478621,0.004313495,0.0074426145,0.0060405433],"domain_scores_gemma":[0.97827995,0.003844308,0.008285991,0.005332855,0.0008908377,0.0033660703],"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.0049008406,0.0028953347,0.001345134,0.0017445238,0.004964329,0.0052303486,0.0067099244,0.0070304787,0.5981464],"category_scores_gemma":[0.0019407475,0.005137974,0.0056561134,0.0034192891,0.0051298034,0.0039861193,0.005260124,0.006241165,0.0034965416],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042716735,0.0009734151,0.00001537559,0.0023919442,0.0045859637,0.0017317175,0.0040023136,0.0022147738,0.0053228717,0.59407884,0.3779509,0.0024602315],"study_design_scores_gemma":[0.008082262,0.0033695118,0.00018505972,0.0027252533,0.0068547474,0.009482771,0.007100353,0.027676297,0.9091991,0.002456015,0.018102102,0.00476652],"about_ca_topic_score_codex":0.0023407466,"about_ca_topic_score_gemma":0.0020206831,"teacher_disagreement_score":0.90387625,"about_ca_system_score_codex":0.000076430115,"about_ca_system_score_gemma":0.004802244,"threshold_uncertainty_score":0.99866426},"labels":[],"label_agreement":null},{"id":"W1801870623","doi":"10.4153/cmb-2015-076-1","title":"Product Ranks of the 3 × 3 Determinant and Permanent","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rank (graph theory); Tensor product; Product (mathematics); Tensor (intrinsic definition); Direct product","score_opus":0.0455145325354404,"score_gpt":0.2794478881159374,"score_spread":0.233933355580497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801870623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92645395,0.00010360882,0.00043893038,0.028699238,0.00008014803,0.00083774514,0.000040064755,0.000043540625,0.04330275],"genre_scores_gemma":[0.99240625,0.0000016097773,0.004399761,0.0003317965,0.000033658747,0.00003444022,0.0000011456767,0.000014976203,0.0027763774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928224,0.000042197487,0.0002302107,0.00013130817,0.0001452599,0.00016878988],"domain_scores_gemma":[0.999056,0.00011975031,0.000062194405,0.00036222735,0.000076455464,0.00032338072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024851738,0.00008824517,0.00016124494,0.00003697354,0.0000685139,0.000017855487,0.00016827056,0.00003751134,0.0007524226],"category_scores_gemma":[0.00043532185,0.00005866827,0.000044539764,0.00007482764,0.00014850784,0.00000952293,0.000035841418,0.000090842084,0.00043917235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065965314,0.00012946152,0.00025628333,0.00024916165,0.000022214586,0.000009000135,0.0015694842,0.0000010461654,0.000422868,0.8540896,0.14160793,0.0016363282],"study_design_scores_gemma":[0.00065635855,0.000040351722,0.0014038614,0.00018244254,0.00008959145,0.00027420485,0.00048673517,0.00025379148,0.0026853485,0.76357234,0.23004958,0.00030537724],"about_ca_topic_score_codex":0.00016894998,"about_ca_topic_score_gemma":0.00030572613,"teacher_disagreement_score":0.09051727,"about_ca_system_score_codex":0.000050894185,"about_ca_system_score_gemma":0.00010699714,"threshold_uncertainty_score":0.82385},"labels":[],"label_agreement":null},{"id":"W1919986261","doi":"10.1002/nla.1845","title":"The power and Arnoldi methods in an algebra of circulants","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Centre International de Recherche sur le Cancer","keywords":"Mathematics; Circulant matrix; Algebra over a field; Linear algebra; Scalar (mathematics); Dimension (graph theory); Matrix (chemical analysis); Numerical linear algebra; Pure mathematics; Discrete mathematics; Numerical analysis; Mathematical analysis","score_opus":0.03708464711442809,"score_gpt":0.37598441701929824,"score_spread":0.33889976990487014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919986261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.242032,0.0004009398,0.75200653,0.0014099258,0.00002797471,0.0013242192,0.00003430971,0.00015772006,0.002606354],"genre_scores_gemma":[0.74908537,0.000015567342,0.25013664,0.00012000615,0.000047192607,0.0005119505,0.000011481376,0.000025347312,0.00004642586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885803,0.00012297905,0.00036401,0.00021451188,0.00016423837,0.0002762274],"domain_scores_gemma":[0.99834436,0.0006514193,0.00015734573,0.0005694801,0.00008783151,0.00018958496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038731046,0.00013864195,0.00021993087,0.000057428613,0.00017978283,0.000023353421,0.00021811934,0.000069797556,0.00004675104],"category_scores_gemma":[0.000052221894,0.00009383253,0.000040115276,0.00047673975,0.00017578992,0.00012074612,0.000043115084,0.00018625858,0.000023272989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026521804,0.0008466564,0.011723865,0.000022423765,0.000037720183,2.2810802e-7,0.000569194,0.0000057784964,0.0035201549,0.9642148,0.00018425864,0.018848388],"study_design_scores_gemma":[0.002987082,0.0005433368,0.33808476,0.000094276416,0.00036242855,0.00020399732,0.0028493237,0.007678473,0.013651239,0.4646793,0.16716154,0.0017042627],"about_ca_topic_score_codex":0.000008217239,"about_ca_topic_score_gemma":0.000004881106,"teacher_disagreement_score":0.5070534,"about_ca_system_score_codex":0.00001933338,"about_ca_system_score_gemma":0.000022952061,"threshold_uncertainty_score":0.38263795},"labels":[],"label_agreement":null},{"id":"W1964144425","doi":"10.4153/cjm-2012-046-1","title":"On Hilbert Covariants","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Covariant transformation; Embedding; Divisor (algebraic geometry); Variety (cybernetics); Triviality; Ideal (ethics); Class (philosophy)","score_opus":0.06011526205570358,"score_gpt":0.3072372096845298,"score_spread":0.2471219476288262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964144425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9070232,0.00020652458,0.030202767,0.0029029867,0.0008815711,0.00031575767,0.000049495753,0.000033842367,0.058383875],"genre_scores_gemma":[0.9521019,0.0000027540448,0.046666127,0.00037688704,0.00020784613,0.0000025716201,9.918792e-7,0.000024835706,0.0006161151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991088,0.00002477288,0.00039429485,0.000043968434,0.00016407251,0.00026408196],"domain_scores_gemma":[0.99837744,0.00035074668,0.00027424996,0.00022011221,0.00012475305,0.00065270136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003987509,0.00009920328,0.00020439012,0.00017619124,0.00010237149,0.000032934662,0.00019778046,0.00005797966,0.00059722154],"category_scores_gemma":[0.00045476746,0.00008252877,0.00009874097,0.0001169103,0.00003754888,0.000106420506,0.000004646669,0.00017092699,0.00020156262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014957536,0.00015466007,0.00025297378,0.00003023716,0.00003781881,0.0000104294395,0.0011749129,0.0000029255173,0.00008253449,0.929879,0.068124495,0.00024850233],"study_design_scores_gemma":[0.0007878077,0.00012587894,0.00160167,0.00032190545,0.00016118083,0.0013675333,0.0009985658,0.00012298812,0.001279309,0.94075716,0.052109495,0.00036648332],"about_ca_topic_score_codex":0.00003337456,"about_ca_topic_score_gemma":0.0002782032,"teacher_disagreement_score":0.05776776,"about_ca_system_score_codex":0.00009709243,"about_ca_system_score_gemma":0.00017934898,"threshold_uncertainty_score":0.6539157},"labels":[],"label_agreement":null},{"id":"W1970394077","doi":"10.1063/1.2823971","title":"Orthogonal separation of variables for the Hamilton-Jacobi and wave equations in three-dimensional Minkowski space","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minkowski space; Hamilton–Jacobi equation; Separation of variables; Separable space; Orthogonal coordinates; Mathematics; Canonical coordinates; Cartesian coordinate system; Mathematical analysis; Space (punctuation); Generalized coordinates; Coordinate system; Separation (statistics); Action-angle coordinates; Mathematical physics; Pure mathematics; Physics; Partial differential equation; Phase space; Geometry; Quantum mechanics","score_opus":0.08808041428475184,"score_gpt":0.3371698783677919,"score_spread":0.24908946408304006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970394077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31805107,0.00006636786,0.6800143,0.0010353926,0.000037751262,0.00037591523,0.00002258564,0.0000077938885,0.0003888219],"genre_scores_gemma":[0.8637606,0.000013915231,0.13591649,0.00005577072,0.00012711552,0.0000222723,0.0000028571485,0.000015076794,0.00008594403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998843,0.00003330053,0.00061536115,0.00008598669,0.00030542206,0.00011693149],"domain_scores_gemma":[0.995724,0.0033479435,0.0004351838,0.00015890996,0.00027948842,0.00005447327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043860494,0.00010741501,0.00031232112,0.000048408776,0.00012108036,0.0000126472,0.00009944002,0.00005334597,0.000026445518],"category_scores_gemma":[0.00028082103,0.000072009294,0.00013037343,0.00015200596,0.0001358633,0.0001216517,0.000021217435,0.0001576526,0.0000027833723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040698138,0.00055002136,0.00004317707,0.00008822045,0.00006174296,0.000002184908,0.00070788973,0.00055622694,0.002676693,0.9937606,0.001251588,0.00026099954],"study_design_scores_gemma":[0.0006898122,0.00007792601,0.00058428757,0.00010335975,0.000093898874,0.00010832403,0.00007455509,0.058583632,0.0010643067,0.9384098,0.00012492231,0.00008519047],"about_ca_topic_score_codex":0.0000010202756,"about_ca_topic_score_gemma":0.0000042346114,"teacher_disagreement_score":0.5457095,"about_ca_system_score_codex":0.000023559438,"about_ca_system_score_gemma":0.000074005286,"threshold_uncertainty_score":0.29364538},"labels":[],"label_agreement":null},{"id":"W1974126243","doi":"10.1016/j.laa.2012.01.037","title":"Cayley’s hyperdeterminant: A combinatorial approach via representation theory","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invariant (physics); Enumeration; Combinatorics; Integer (computer science); Representation theory; Algebra over a field; Polynomial; Simple (philosophy); Discrete mathematics; Pure mathematics","score_opus":0.03904000227757939,"score_gpt":0.32440324925601227,"score_spread":0.2853632469784329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974126243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47925034,0.0008524086,0.4834214,0.0009002737,0.00030892828,0.0033946843,0.00010741557,0.0007055263,0.03105905],"genre_scores_gemma":[0.9818555,0.000038762082,0.015629599,0.00013855254,0.00056921516,0.00092535705,0.00008035367,0.000033342018,0.0007293367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989945,0.00007081759,0.00028919353,0.00024955743,0.00015214014,0.00024374998],"domain_scores_gemma":[0.9989506,0.00029108906,0.000116997544,0.0003806279,0.000085177846,0.00017547944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023844461,0.00014783314,0.00018213462,0.000065877015,0.00032062322,0.00003116465,0.00014172794,0.00009814412,0.00007652886],"category_scores_gemma":[0.00004830931,0.00013612334,0.00006230503,0.0002484205,0.00005913031,0.00018492017,0.000058327118,0.00013949179,0.00014994292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083737705,0.00041286342,0.000171226,0.00003215947,0.000020310074,6.820486e-8,0.00051656505,6.0287056e-7,0.0022301804,0.99316514,0.00040820288,0.003034299],"study_design_scores_gemma":[0.0014834867,0.000056482662,0.0035805812,0.000018015406,0.00032852843,0.00011772309,0.00077527156,0.0051696734,0.014937055,0.92872226,0.044081554,0.00072934746],"about_ca_topic_score_codex":0.0000033360154,"about_ca_topic_score_gemma":3.6013716e-7,"teacher_disagreement_score":0.50260514,"about_ca_system_score_codex":0.000017398832,"about_ca_system_score_gemma":0.000011070815,"threshold_uncertainty_score":0.55509484},"labels":[],"label_agreement":null},{"id":"W1978771480","doi":"10.1162/neco_a_00570","title":"Large Margin Low Rank Tensor Analysis","year":2014,"lang":"en","type":"article","venue":"Neural Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Dimensionality reduction; Tensor (intrinsic definition); Margin (machine learning); Curse of dimensionality; Pattern recognition (psychology); Mathematics; Projection (relational algebra); Artificial intelligence; Data point; Rank (graph theory); Computer science; Representation (politics); Dimension (graph theory); Algorithm; Machine learning; Combinatorics; Pure mathematics","score_opus":0.027006941903408365,"score_gpt":0.3218331844378574,"score_spread":0.29482624253444906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978771480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5752074,0.0000030734873,0.42233235,0.0008370276,0.000045016575,0.00013754699,0.00001082555,0.00017652381,0.0012502045],"genre_scores_gemma":[0.988945,6.011603e-7,0.010127705,0.00047055192,0.00007269672,0.000018113004,0.0000937624,0.000012718984,0.0002588429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991809,0.000092796494,0.00022414501,0.00019257377,0.00016313099,0.00014643061],"domain_scores_gemma":[0.99931836,0.00024862977,0.000105738836,0.00017423717,0.00009589543,0.000057136058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015047635,0.00009600305,0.0001800657,0.00014359828,0.00012945643,0.00004686392,0.000086097265,0.000040531166,0.00012279025],"category_scores_gemma":[0.000053297375,0.000089256544,0.00012973242,0.00048055252,0.000014678512,0.000068432426,0.00001879276,0.00008264965,0.000125703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015895744,0.0021688351,0.017862247,0.00035023055,0.0011594661,0.000013289096,0.002779447,0.058411054,0.012389791,0.7916988,0.05920086,0.05380699],"study_design_scores_gemma":[0.00070416316,0.00003304019,0.03558354,0.0000060560947,0.00027211595,0.000004674659,0.00004421098,0.9019736,0.00033364343,0.059159275,0.0017021928,0.00018349396],"about_ca_topic_score_codex":0.0000032385326,"about_ca_topic_score_gemma":0.00001193538,"teacher_disagreement_score":0.84356254,"about_ca_system_score_codex":0.000017142916,"about_ca_system_score_gemma":0.0000035656083,"threshold_uncertainty_score":0.36397764},"labels":[],"label_agreement":null},{"id":"W1982573319","doi":"10.1002/cem.709","title":"‘Stretch’ vs ‘slice’ methods for representing three‐way structure via matrix notation","year":2002,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Korea Institute of Energy Research","keywords":"Slicing; Notation; Representation (politics); Matrix (chemical analysis); Matrix representation; Set (abstract data type); Computer science; Diagonal; Flexibility (engineering); Array data structure; Algorithm; Theoretical computer science; Mathematics; Arithmetic; Programming language; Computer graphics (images); Geometry; Group (periodic table)","score_opus":0.08810379124293947,"score_gpt":0.4277878576391258,"score_spread":0.3396840663961863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982573319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15977198,0.00034620875,0.83629894,0.0025011897,0.0002559223,0.00027981418,0.000016388,0.000039326467,0.0004902259],"genre_scores_gemma":[0.32840872,0.000026211987,0.6707653,0.00009648834,0.000362943,0.000005413636,0.0000032178339,0.000027962364,0.00030378532],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985129,0.000049030514,0.00075910694,0.00014838291,0.00033207927,0.00019850513],"domain_scores_gemma":[0.9965633,0.0013878627,0.001027647,0.00026603116,0.0006387561,0.0001163728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007004364,0.0001403561,0.00035485945,0.0006435354,0.00012145287,0.00008303468,0.00026987965,0.00013053005,0.000338557],"category_scores_gemma":[0.0018939729,0.000121952,0.0002538026,0.0014594656,0.00002401879,0.00019411155,0.000030678293,0.0002905988,0.0000065622066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017052545,0.0011410854,0.003082413,0.00075200206,0.0006110611,0.000018202603,0.001960484,0.00026522705,0.1879192,0.034950662,0.08350044,0.6856287],"study_design_scores_gemma":[0.0043460126,0.00041126256,0.003365134,0.000121359466,0.0007619221,0.00090934994,0.0003332726,0.08987619,0.14975873,0.68420297,0.06509907,0.00081473385],"about_ca_topic_score_codex":7.934651e-7,"about_ca_topic_score_gemma":7.197585e-7,"teacher_disagreement_score":0.684814,"about_ca_system_score_codex":0.00007898736,"about_ca_system_score_gemma":0.000011199523,"threshold_uncertainty_score":0.4973058},"labels":[],"label_agreement":null},{"id":"W2003787220","doi":"10.1002/cem.665","title":"An index formalism that generalizes the capabilities of matrix notation and algebra to n‐way arrays","year":2001,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Korea Institute of Energy Research","keywords":"Notation; Formalism (music); Algebra over a field; Computer science; Matrix (chemical analysis); Context (archaeology); Matrix algebra; Theoretical computer science; Mathematics; Arithmetic; Pure mathematics; Physics","score_opus":0.045832148677248406,"score_gpt":0.33749582474370843,"score_spread":0.29166367606646004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003787220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579073,0.00014917663,0.039322067,0.0021366812,0.000057406916,0.00012344569,0.0000076050856,0.0000100181105,0.00028627805],"genre_scores_gemma":[0.97969943,0.00014554083,0.01968072,0.00020050413,0.00011320599,0.0000040397986,0.0000012863547,0.000011508145,0.00014377608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902004,0.00003474196,0.00041697425,0.00006869443,0.00034939594,0.00011014116],"domain_scores_gemma":[0.998645,0.00033373715,0.0004089078,0.00019142168,0.00032075465,0.000100162615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045584,0.000085768974,0.00020746164,0.00044597534,0.00007381155,0.000053897707,0.00019292759,0.000051985175,0.000041579886],"category_scores_gemma":[0.00025220518,0.00005817296,0.000074158525,0.00081407354,0.000045149533,0.0002217632,0.000019472243,0.000121875695,0.0000014127821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080891023,0.0034694741,0.13237785,0.0010338236,0.00071660243,0.000041592863,0.05313156,0.0026347141,0.18845351,0.4864577,0.04926922,0.08160503],"study_design_scores_gemma":[0.0046873935,0.0014523844,0.16277793,0.00021812167,0.000529648,0.001939363,0.018147213,0.004587888,0.19206776,0.57049555,0.04206058,0.0010361429],"about_ca_topic_score_codex":0.0000066235275,"about_ca_topic_score_gemma":0.0000037800517,"teacher_disagreement_score":0.08403786,"about_ca_system_score_codex":0.000032864125,"about_ca_system_score_gemma":0.000020280095,"threshold_uncertainty_score":0.23722243},"labels":[],"label_agreement":null},{"id":"W2004701861","doi":"10.1063/1.4861707","title":"Killing tensors, warped products and the orthogonal separation of the Hamilton-Jacobi equation","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Separable space; Constant curvature; Separation of variables; Action-angle coordinates; Hamiltonian (control theory); Bipolar coordinates; Differential geometry; Constant (computer programming); Orthogonal coordinates","score_opus":0.04561495930637477,"score_gpt":0.3147122227175251,"score_spread":0.2690972634111503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004701861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5621827,0.000026546866,0.43164045,0.0044441405,0.00008149086,0.0004138201,0.0000037064162,0.000014959479,0.0011921906],"genre_scores_gemma":[0.9754173,0.000011457492,0.024032613,0.0001249742,0.0002794133,0.0000072069024,8.588819e-7,0.00001429706,0.00011187864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856824,0.00018412247,0.0006395486,0.000087218024,0.0004206773,0.00010021861],"domain_scores_gemma":[0.99730664,0.0012137851,0.0007785273,0.0002796338,0.00038073052,0.000040656883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010816068,0.00010757669,0.00031638652,0.000022418979,0.00013158965,0.00003234437,0.00019633376,0.000042304382,0.000010662733],"category_scores_gemma":[0.00069645734,0.000053327272,0.00014269522,0.00017086213,0.00020740711,0.000112558875,0.000032044612,0.00021458261,0.000006005572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038144462,0.00020368275,0.000020732805,0.00013380809,0.00004444341,1.09111916e-7,0.0011955202,0.00020501937,0.004168675,0.9925131,0.0006643421,0.0008123953],"study_design_scores_gemma":[0.00078930217,0.00003612456,0.00019072034,0.00012857046,0.00015126592,0.000035691686,0.0001015046,0.03373377,0.0056693624,0.958822,0.0002703906,0.00007130757],"about_ca_topic_score_codex":3.025676e-7,"about_ca_topic_score_gemma":2.1240278e-7,"teacher_disagreement_score":0.4132346,"about_ca_system_score_codex":0.000015625023,"about_ca_system_score_gemma":0.000030937725,"threshold_uncertainty_score":0.2174623},"labels":[],"label_agreement":null},{"id":"W2005500822","doi":"10.1007/s10231-014-0470-y","title":"The secant line variety to the varieties of reducible plane curves","year":2014,"lang":"en","type":"article","venue":"Annali di Matematica Pura ed Applicata (1923 -)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; National Research Foundation; National Research Foundation of Korea; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Variety (cybernetics); Lambda; Combinatorics; Mathematics; Partition (number theory); Product (mathematics); Line (geometry); Geometry; Physics; Statistics; Quantum mechanics","score_opus":0.04101410708034894,"score_gpt":0.32382714785065614,"score_spread":0.2828130407703072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005500822","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09895912,0.0042589176,0.3732824,0.42120555,0.0011086406,0.019417925,0.0020448754,0.0022145428,0.07750803],"genre_scores_gemma":[0.98222804,0.00069393386,0.007922724,0.0025869524,0.0003864741,0.002155626,0.00016597511,0.000105623476,0.003754648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974778,0.0001875262,0.00095356663,0.00040105672,0.0005505316,0.00042945967],"domain_scores_gemma":[0.9954666,0.0015742804,0.00043650003,0.0020879183,0.00026131875,0.00017338502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015901524,0.0002939516,0.0005059396,0.000045848687,0.00058541045,0.00014869012,0.0012048105,0.00009362332,0.00021734509],"category_scores_gemma":[0.00036072373,0.0001657896,0.00015100061,0.00045875815,0.00024619847,0.00007492331,0.00026010544,0.00024624483,0.00043272736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025665866,0.00020411749,0.000011070833,0.00069120876,0.00008656742,2.1475653e-7,0.0003709699,0.000012421264,0.0020302238,0.6957811,0.30009103,0.0006953988],"study_design_scores_gemma":[0.0005002718,0.00019464576,0.0004679998,0.0006891229,0.0003124089,0.000057732705,0.0008553788,0.0025736734,0.020196313,0.4389173,0.53459615,0.00063900807],"about_ca_topic_score_codex":0.000045610894,"about_ca_topic_score_gemma":0.000025279633,"teacher_disagreement_score":0.88326895,"about_ca_system_score_codex":0.000018944063,"about_ca_system_score_gemma":0.000037808113,"threshold_uncertainty_score":0.6760704},"labels":[],"label_agreement":null},{"id":"W2010946668","doi":"10.1007/s00014-003-0769-6","title":"On Waring's problem for several algebraic forms","year":2003,"lang":"en","type":"article","venue":"Commentarii Mathematici Helvetici","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Dimension (graph theory); Algebraic number; Degree (music); Scalar (mathematics); Polynomial ring; Pure mathematics; Polynomial; Combinatorics; Discrete mathematics; Algebra over a field; Mathematical analysis; Geometry","score_opus":0.058126340531118675,"score_gpt":0.33723655499162297,"score_spread":0.2791102144605043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010946668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27118546,0.00004496561,0.5832213,0.009560905,0.00030508946,0.007138092,0.00016564748,0.0009577453,0.1274208],"genre_scores_gemma":[0.6385576,0.0000051363104,0.35062066,0.005065158,0.000056604204,0.0017643331,0.000076870565,0.0001429316,0.0037106837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982585,0.000056105673,0.0005907003,0.00034884486,0.00027546703,0.00047042218],"domain_scores_gemma":[0.99770296,0.0011933235,0.00021938921,0.000643697,0.000085102445,0.00015553148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043316567,0.00030808302,0.00040058038,0.000105727835,0.0003470958,0.00008774885,0.0002964513,0.00009796235,0.00073334656],"category_scores_gemma":[0.00021290647,0.00026071744,0.0002145443,0.00015638994,0.000060495247,0.00009680429,0.00004557354,0.00018296861,0.00023208492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016563768,0.00075272226,0.0000099305325,0.00019415613,0.000068281304,8.32375e-7,0.00059729686,0.000007985588,0.00025591132,0.954369,0.043492936,0.00023438128],"study_design_scores_gemma":[0.0013306935,0.0001936989,0.000012038426,0.000113102695,0.00009449119,0.000028147304,0.0002778948,0.0005691529,0.0057390034,0.96985084,0.021460757,0.0003302014],"about_ca_topic_score_codex":0.0000033277597,"about_ca_topic_score_gemma":0.000010237922,"teacher_disagreement_score":0.36737218,"about_ca_system_score_codex":0.00013696382,"about_ca_system_score_gemma":0.000030890165,"threshold_uncertainty_score":0.9999845},"labels":[],"label_agreement":null},{"id":"W2018014435","doi":"10.1137/110855934","title":"An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multigrid method; Mathematics; Rank (graph theory); Tensor (intrinsic definition); Algebraic number; Relaxation (psychology); Multiplicative function; Algorithm; Applied mathematics; Mathematical analysis; Pure mathematics; Partial differential equation; Combinatorics","score_opus":0.04218870997084388,"score_gpt":0.3564629447187452,"score_spread":0.3142742347479013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018014435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5069178,0.000016916743,0.4904265,0.00061059365,0.00088644953,0.0007113442,0.00003342939,0.00013226843,0.00026468694],"genre_scores_gemma":[0.7027226,8.857851e-7,0.29612404,0.0002382537,0.0005549617,0.000023836583,0.000026766893,0.00003411639,0.00027450782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976294,0.00015350411,0.00070400565,0.00051005074,0.0004938959,0.00050913094],"domain_scores_gemma":[0.99731463,0.0007082578,0.00041750784,0.00042086348,0.00074081245,0.00039792512],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001058155,0.00023131691,0.00030847618,0.00026764208,0.0013986282,0.00092856394,0.00044564088,0.00009136057,0.00023393579],"category_scores_gemma":[0.000093507966,0.00020055525,0.0002419572,0.0003472659,0.00014329934,0.00033175125,0.000045769353,0.00040784854,0.00023978077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012903071,0.004188898,0.0001268892,0.000092359565,0.00027314297,0.000040057792,0.0026659628,0.0035169797,0.11737712,0.06714924,0.08725495,0.7171854],"study_design_scores_gemma":[0.0018669439,0.0005052668,0.0017619979,0.0002725284,0.000060160583,0.00036114416,0.0006400841,0.92929494,0.0069197356,0.05500437,0.002761023,0.0005518167],"about_ca_topic_score_codex":0.0000060878506,"about_ca_topic_score_gemma":0.0000045235947,"teacher_disagreement_score":0.925778,"about_ca_system_score_codex":0.0001504504,"about_ca_system_score_gemma":0.000104815146,"threshold_uncertainty_score":0.9999014},"labels":[],"label_agreement":null},{"id":"W2030434042","doi":"10.1016/j.cam.2012.09.017","title":"Maximum likelihood estimation for the tensor normal distribution: Algorithm, minimum sample size, and empirical bias and dispersion","year":2012,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Covariance matrix; Estimator; Covariance; Statistics; Kronecker product; Sample size determination; Univariate; Multivariate normal distribution; Rate of convergence; Dimension (graph theory); Estimation of covariance matrices; Matrix (chemical analysis); Applied mathematics; Multivariate statistics; Kronecker delta; Combinatorics","score_opus":0.048457596303383386,"score_gpt":0.32288168150934005,"score_spread":0.2744240852059567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030434042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17014898,0.00016569765,0.8269964,0.0021672165,0.000047119527,0.00031416665,0.00010836972,0.000015206333,0.000036855705],"genre_scores_gemma":[0.31815723,0.000038132075,0.68141323,0.00014694699,0.00018013683,0.000020783562,0.000018559871,0.000013027833,0.000011978557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989454,0.000015902935,0.0005064811,0.0000963286,0.00026230488,0.00017357805],"domain_scores_gemma":[0.9939822,0.005233488,0.00039102923,0.00007841965,0.00016378271,0.00015111064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053368724,0.00014494218,0.00025846335,0.000036712136,0.0003092339,0.00008323799,0.00007349951,0.00006189422,0.000011638729],"category_scores_gemma":[0.00026362864,0.00009571298,0.00006330329,0.00008713131,0.00011110714,0.00013382341,0.000047311823,0.0001268837,0.000001483716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027231095,0.0025550057,0.0015341599,0.0012100323,0.00055402756,0.0000020187135,0.007134749,0.0008214033,0.0005948498,0.6959471,0.017087195,0.27228713],"study_design_scores_gemma":[0.001335683,0.00009180451,0.0078012035,0.00005515337,0.0002687994,0.00039391153,0.0010189315,0.105109505,0.00011603774,0.8809462,0.0026677914,0.00019495536],"about_ca_topic_score_codex":3.8073367e-7,"about_ca_topic_score_gemma":1.4696352e-7,"teacher_disagreement_score":0.2720922,"about_ca_system_score_codex":0.000019999088,"about_ca_system_score_gemma":0.000024913046,"threshold_uncertainty_score":0.3903062},"labels":[],"label_agreement":null},{"id":"W2033342614","doi":"10.4153/cjm-2009-047-5","title":"Prolongations and Computational Algebra","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Cambridge; Canadian Mathematical Society","keywords":"Mathematics; Binary number; Algebra over a field; Pure mathematics; Applied mathematics; Arithmetic","score_opus":0.033859059778599834,"score_gpt":0.2914576829439053,"score_spread":0.25759862316530546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033342614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91626674,0.0001563421,0.06884842,0.010287891,0.00007132266,0.00023881349,0.00002566202,0.000024586281,0.004080206],"genre_scores_gemma":[0.8214156,0.0000024460012,0.17814365,0.00029184556,0.000048370723,0.0000011739534,0.0000017857769,0.000006967218,0.00008819352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936116,0.000015017512,0.00034172204,0.0000520991,0.000114328635,0.00011569619],"domain_scores_gemma":[0.9990359,0.00016510201,0.0002100056,0.00009479895,0.00019470742,0.00029950816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019982085,0.00007161401,0.00015072865,0.00015280137,0.00013123774,0.00005572168,0.000106690095,0.000038196245,0.00006194512],"category_scores_gemma":[0.00017423362,0.000064076914,0.00004674602,0.00010564337,0.000049717564,0.000083556675,0.0000025608176,0.00011472364,0.000009646091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.859885e-7,0.00006400037,0.00014238697,0.0000199869,0.00002034583,0.000014469085,0.0012023732,0.000045415192,0.00006171955,0.9891237,0.00799818,0.0013066129],"study_design_scores_gemma":[0.00022110886,0.00005666548,0.0029280551,0.00005116254,0.00003716476,0.00055476464,0.00027455937,0.0010641938,0.000043166514,0.99320644,0.0014827994,0.000079896454],"about_ca_topic_score_codex":0.000009342754,"about_ca_topic_score_gemma":0.00022446917,"teacher_disagreement_score":0.10929522,"about_ca_system_score_codex":0.000034540266,"about_ca_system_score_gemma":0.00022008803,"threshold_uncertainty_score":0.2612981},"labels":[],"label_agreement":null},{"id":"W2033393326","doi":"10.1002/cem.1206","title":"Modeling multi‐way data with linearly dependent loadings","year":2009,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":134,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Generalization; Context (archaeology); Linear model; Mathematics; Computer science; Algorithm; Biological system; Statistics; Mathematical analysis","score_opus":0.1329767601637393,"score_gpt":0.3669497680814434,"score_spread":0.23397300791770412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033393326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4008037,0.00019891257,0.59683806,0.0015263491,0.000047107776,0.000093463685,0.000013453293,0.000031048945,0.00044789055],"genre_scores_gemma":[0.7556123,0.000048747996,0.24383007,0.00018775085,0.00012709768,3.7790747e-7,0.000003931733,0.000012088102,0.000177632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876106,0.000012470497,0.000476175,0.00013217753,0.00047121674,0.00014692293],"domain_scores_gemma":[0.9985655,0.00011795329,0.0003390396,0.00041722387,0.00042511182,0.0001351973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954607,0.00010731309,0.00024549052,0.00046395784,0.00006126866,0.00008294463,0.0005423331,0.000059364214,0.000021085298],"category_scores_gemma":[0.0004332369,0.00008036867,0.00005663374,0.0009220655,0.00001193767,0.00030695295,0.000040431914,0.00029776306,0.000009354211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002204699,0.03206184,0.009327156,0.00095572986,0.0027967952,0.0015468727,0.008101372,0.045871995,0.18913208,0.115974784,0.1237564,0.46827027],"study_design_scores_gemma":[0.013317281,0.0017527114,0.002306993,0.00059410464,0.0011623253,0.004156457,0.0012375583,0.8591649,0.041895248,0.062199738,0.010503047,0.0017096275],"about_ca_topic_score_codex":0.0000013209824,"about_ca_topic_score_gemma":0.0000010749051,"teacher_disagreement_score":0.8132929,"about_ca_system_score_codex":0.000054060714,"about_ca_system_score_gemma":0.00004309839,"threshold_uncertainty_score":0.3277339},"labels":[],"label_agreement":null},{"id":"W2034012206","doi":"10.1016/j.jalgebra.2007.01.045","title":"On the ideals of secant varieties to certain rational varieties","year":2007,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Variety (cybernetics); Embedding; Pure mathematics; Product (mathematics); Projective test; Projective variety; Algebra over a field; Geometry; Statistics","score_opus":0.03838698805067434,"score_gpt":0.3233152826859932,"score_spread":0.2849282946353189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034012206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8734553,0.000031320316,0.10476384,0.015861457,0.00014913127,0.00019880512,0.000011001207,0.000014122831,0.005515011],"genre_scores_gemma":[0.9892545,0.0000041219205,0.009095408,0.0010893634,0.00013800373,0.0000026648092,7.1083906e-7,0.000009689283,0.00040555393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988714,0.000045097207,0.0005331478,0.000056352827,0.00038481498,0.00010918586],"domain_scores_gemma":[0.997785,0.001302664,0.00036697875,0.00016020171,0.00031226227,0.00007291688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043355,0.00007765656,0.00017424999,0.000110136774,0.000090785565,0.000027027943,0.00019526528,0.00003907873,0.00038042],"category_scores_gemma":[0.0003401655,0.00004871542,0.00010767587,0.00015158148,0.00004568772,0.00005068229,0.000020590525,0.00016234982,0.000017534929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006449725,0.00011445774,0.000036282127,0.000008750964,0.00004331662,0.0000025278111,0.00094548747,0.000039437513,0.005140237,0.9610434,0.032376908,0.00018470366],"study_design_scores_gemma":[0.00023073175,0.00020783974,0.0038941845,0.000037913847,0.000032062548,0.000051798284,0.0008983699,0.00002335207,0.018754983,0.9711938,0.0045972452,0.000077741046],"about_ca_topic_score_codex":0.000002878933,"about_ca_topic_score_gemma":0.00000603504,"teacher_disagreement_score":0.11579918,"about_ca_system_score_codex":0.000031041007,"about_ca_system_score_gemma":0.00005625106,"threshold_uncertainty_score":0.41653323},"labels":[],"label_agreement":null},{"id":"W2037844371","doi":"10.1016/s0024-3795(03)00455-5","title":"Erratum to: “Ranks of tensors, secant varieties of Segre varieties and fat points” [Linear Algebra Appl. 355 (2002) 263–285]","year":2003,"lang":"en","type":"erratum","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.023371799167554937,"score_gpt":0.28481644787624183,"score_spread":0.2614446487086869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037844371","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04632619,0.060077436,0.440847,0.03616226,0.012998174,0.05030903,0.035201676,0.0039767465,0.31410146],"genre_scores_gemma":[0.09816691,0.013854692,0.18383531,0.004500514,0.0055008046,0.0069850395,0.005676121,0.0014737527,0.68000686],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962225,0.0001328312,0.0014791258,0.0010006116,0.00061532843,0.00054962654],"domain_scores_gemma":[0.996191,0.000439895,0.0008809847,0.0012483117,0.0008361745,0.00040358177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036601527,0.000764324,0.0013740378,0.00040335098,0.00041887234,0.000078569385,0.0005733539,0.00091538666,0.00043829743],"category_scores_gemma":[0.00021929407,0.0007302727,0.00025652917,0.0008264694,0.000426754,0.00013894429,0.0002760358,0.0010562241,0.00008130668],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030740808,0.00045660182,0.000013625083,0.0011223095,0.00025787603,9.664517e-7,0.0009352862,0.000009211299,0.00091751467,0.4571371,0.53853315,0.00058562594],"study_design_scores_gemma":[0.0009737622,0.0002355212,0.00022109099,0.00035026314,0.00087523105,0.00006681221,0.00091766124,0.0014522015,0.002545065,0.18244207,0.80859655,0.0013237722],"about_ca_topic_score_codex":0.00003733826,"about_ca_topic_score_gemma":0.00002752521,"teacher_disagreement_score":0.3659054,"about_ca_system_score_codex":0.000041938194,"about_ca_system_score_gemma":0.00020561814,"threshold_uncertainty_score":0.9995148},"labels":[],"label_agreement":null},{"id":"W2042663327","doi":"10.1002/cem.810","title":"Shifted factor analysis—Part III: <i>N</i>‐way generalization and application","year":2003,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Chemometrics; Generalization; Mode (computer interface); Factor analysis; Factor (programming language); Set (abstract data type); Mathematics; Data set; Algorithm; Statistics; Computer science; Applied mathematics; Machine learning; Mathematical analysis","score_opus":0.03673406376145951,"score_gpt":0.3140604343626678,"score_spread":0.2773263706012083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042663327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5395878,0.00024228169,0.45812327,0.00031669548,0.000064364416,0.00013135478,0.000009439616,0.00002420125,0.0015005998],"genre_scores_gemma":[0.97110766,0.00013849867,0.028181693,0.00013689662,0.00008396451,0.0000050525705,0.000007714793,0.000013537885,0.00032496057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988928,0.00004514057,0.0005323791,0.0001141798,0.00030725275,0.00010828536],"domain_scores_gemma":[0.9985632,0.00018709461,0.00059121934,0.00018516248,0.00035292152,0.00012044747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035555995,0.0000994619,0.00028348668,0.0008633503,0.00007384797,0.000052936193,0.00010263072,0.00007612699,0.00009622045],"category_scores_gemma":[0.00035342504,0.000087215805,0.00012956826,0.0032255135,0.000023819848,0.0001270629,0.000010244667,0.0001264936,0.0000039130327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103710976,0.0026653078,0.07729184,0.0002601517,0.0031051247,0.000017117563,0.0017619543,0.0006599059,0.0749644,0.77568394,0.03891722,0.024569305],"study_design_scores_gemma":[0.0082722865,0.00043621502,0.07534374,0.0000786046,0.005884163,0.0005453051,0.0007382769,0.00877427,0.1919156,0.29535753,0.4108239,0.0018300762],"about_ca_topic_score_codex":9.606508e-7,"about_ca_topic_score_gemma":0.0000014035012,"teacher_disagreement_score":0.48032644,"about_ca_system_score_codex":0.00005085411,"about_ca_system_score_gemma":0.000022770253,"threshold_uncertainty_score":0.35565573},"labels":[],"label_agreement":null},{"id":"W2043064432","doi":"10.1016/s0024-3795(03)00451-8","title":"Matrices with special reference to applications in psychometrics","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multidimensional scaling; Canonical correlation; Rank (graph theory); Set (abstract data type); Matrix (chemical analysis); Psychometrics; Scaling; Item response theory; Mathematics; Statistics; Regression analysis; Data set; Computer science; Algebra over a field; Econometrics; Pure mathematics; Combinatorics","score_opus":0.04279565869116034,"score_gpt":0.32617890670036187,"score_spread":0.28338324800920156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043064432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4393693,0.00085851137,0.37268648,0.004100528,0.000059894304,0.009206944,0.0003565013,0.0006183475,0.17274353],"genre_scores_gemma":[0.87593246,0.000392444,0.1157264,0.0005435933,0.00038289293,0.0049751466,0.00008313271,0.00007016837,0.0018937765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883854,0.000028700964,0.0003246571,0.0004042706,0.00017761697,0.00022622837],"domain_scores_gemma":[0.9989093,0.0002726634,0.000095502146,0.00040813643,0.00012573776,0.00018868026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013278409,0.0001685484,0.0001991684,0.00032407755,0.00021197446,0.000051316416,0.0001974126,0.00008014325,0.00015478462],"category_scores_gemma":[0.00004720151,0.00014742036,0.00002651986,0.0019792374,0.000034387107,0.00008706996,0.000025820582,0.00016871133,0.00021339621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049836044,0.00025526228,0.00058728247,0.00002417806,0.0000077931045,2.1142641e-7,0.00010888105,0.0000060432008,0.0002448341,0.99665785,0.0007289679,0.0013737384],"study_design_scores_gemma":[0.0006965299,0.00007721039,0.005010831,0.000026065945,0.000054372817,0.000021224574,0.000454105,0.000081869766,0.0013531669,0.1432743,0.848462,0.0004882978],"about_ca_topic_score_codex":0.0000038108751,"about_ca_topic_score_gemma":0.000039561837,"teacher_disagreement_score":0.8533835,"about_ca_system_score_codex":0.000029360013,"about_ca_system_score_gemma":0.000034679066,"threshold_uncertainty_score":0.6011628},"labels":[],"label_agreement":null},{"id":"W2047527848","doi":"10.1002/cem.926","title":"Mathematical improvements to maximum likelihood parallel factor analysis: theory and simulations","year":2005,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Algorithm; Computation; Representation (politics); Basis (linear algebra); Covariance; Heteroscedasticity; Function (biology); Computer science; Variety (cybernetics); Covariance matrix; Mathematics; Noise (video); Mathematical optimization; Applied mathematics; Statistics; Artificial intelligence","score_opus":0.03508056897040344,"score_gpt":0.34350867179711275,"score_spread":0.3084281028267093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047527848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58698475,0.000084109495,0.41057256,0.0015857526,0.000024634099,0.00016884893,0.000028288341,0.000021821184,0.0005292267],"genre_scores_gemma":[0.8553344,0.0000145130125,0.1439289,0.00039160365,0.00011158498,0.000003476907,0.0000017324443,0.000014526491,0.0001992814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860686,0.000040624698,0.00065813144,0.00012105706,0.00039451275,0.00017881209],"domain_scores_gemma":[0.9980951,0.0007689642,0.00036168052,0.00021976938,0.00029271017,0.00026177152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097416,0.00012606448,0.00036121818,0.0011479583,0.00007281477,0.000071702605,0.0001851949,0.000068697474,0.00037843335],"category_scores_gemma":[0.0008413807,0.00010236979,0.00018075538,0.001920611,0.000021066306,0.00014861592,0.000048604757,0.00017340932,0.000026891526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007055337,0.011920726,0.030180974,0.0005815135,0.010841547,0.000043604483,0.0094879735,0.0036631913,0.0376437,0.5520175,0.021987919,0.3209258],"study_design_scores_gemma":[0.0017080262,0.00021853289,0.0072440873,0.000038670823,0.001533229,0.000055169006,0.00043710566,0.0034243688,0.0034920122,0.9749426,0.0065097585,0.000396393],"about_ca_topic_score_codex":1.5043479e-7,"about_ca_topic_score_gemma":8.1901277e-7,"teacher_disagreement_score":0.42292514,"about_ca_system_score_codex":0.000069389804,"about_ca_system_score_gemma":0.000024332947,"threshold_uncertainty_score":0.4174519},"labels":[],"label_agreement":null},{"id":"W2057387067","doi":"10.1007/s00180-008-0114-z","title":"One-mode three-way overlapping cluster analysis","year":2008,"lang":"en","type":"article","venue":"Computational Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Paul University","funders":"","keywords":"Cluster (spacecraft); Computer science; Mode (computer interface); Computational biology; Biology; Programming language; Operating system","score_opus":0.06935203769758191,"score_gpt":0.3454439474674511,"score_spread":0.2760919097698692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057387067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04718205,0.000011680753,0.9499795,0.00037702583,0.000041068964,0.0001686747,0.0005447084,0.00011524088,0.001580069],"genre_scores_gemma":[0.51190686,0.0000032725045,0.48702186,0.00034867233,0.000057271725,0.000018690427,0.0003955396,0.000014414809,0.0002333699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878496,0.000037489404,0.00037987242,0.00023482332,0.00038838378,0.00017444506],"domain_scores_gemma":[0.9983395,0.00093825464,0.00015525533,0.00020489244,0.00026355046,0.00009857293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007693999,0.00012760478,0.00025153454,0.00015753978,0.0003288805,0.00003403248,0.0001383913,0.00004847839,0.00030955285],"category_scores_gemma":[0.0000867082,0.0001441585,0.000099498844,0.00047026557,0.00009195788,0.000061700004,0.000042299864,0.00011438925,0.0001623034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012225292,0.00027928292,0.0028460955,0.000025436935,0.00048983353,0.000008108942,0.00035572684,0.05037824,0.00003190263,0.91823274,0.026104275,0.0012361424],"study_design_scores_gemma":[0.0003216457,0.00001392583,0.0800938,0.0000059870295,0.00023154973,0.000012902621,0.000010243841,0.31831515,0.000006668206,0.6000617,0.00074844714,0.00017796592],"about_ca_topic_score_codex":0.000020053863,"about_ca_topic_score_gemma":0.00005887749,"teacher_disagreement_score":0.46472484,"about_ca_system_score_codex":0.000062114996,"about_ca_system_score_gemma":0.000045490557,"threshold_uncertainty_score":0.5878613},"labels":[],"label_agreement":null},{"id":"W2064562747","doi":"10.1109/ssp.2012.6319687","title":"Reconstruction of seismic data via tensor completion","year":2012,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Singular value decomposition; Tensor (intrinsic definition); Algorithm; Noise (video); Computer science; Singular value; Rank (graph theory); Matrix decomposition; Domain (mathematical analysis); Tensor decomposition; Iterative method; Mathematics; Artificial intelligence; Mathematical analysis; Image (mathematics); Geometry; Physics","score_opus":0.14024637179663432,"score_gpt":0.35591034507197056,"score_spread":0.21566397327533623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064562747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51263195,0.000021099142,0.46673325,0.0007637835,0.00017404094,0.00026101604,0.00008414456,0.00016698545,0.019163704],"genre_scores_gemma":[0.9144967,0.0000032304292,0.08490972,0.00007654315,0.00007271389,0.0000055223386,0.00006381596,0.0000071175064,0.00036460202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951583,0.000022223801,0.00019806228,0.00009008755,0.000080255966,0.00009354809],"domain_scores_gemma":[0.9992652,0.00007648937,0.00009280701,0.00047470332,0.00004855858,0.000042268686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015134053,0.000050268845,0.00009987566,0.000035827994,0.00004087405,0.000004571117,0.00012837873,0.000024220393,0.0005865405],"category_scores_gemma":[0.000024402898,0.00004394147,0.000021646783,0.00007635824,0.00003372442,0.00017125951,0.00004439792,0.00004175838,0.00012222813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027286605,0.0011885966,0.019422276,0.00016895939,0.0001098868,2.012896e-7,0.00041525555,0.000007946832,0.08557885,0.6989087,0.087160975,0.1070111],"study_design_scores_gemma":[0.0028892912,0.00011239722,0.10432692,0.00016295836,0.0005359505,0.0012223592,0.0017873764,0.14778186,0.07551539,0.5137045,0.15058354,0.0013774583],"about_ca_topic_score_codex":0.000016929165,"about_ca_topic_score_gemma":0.0000032318962,"teacher_disagreement_score":0.40186477,"about_ca_system_score_codex":0.000010781376,"about_ca_system_score_gemma":0.0000042275187,"threshold_uncertainty_score":0.64222074},"labels":[],"label_agreement":null},{"id":"W2064591878","doi":"10.1016/j.jalgebra.2012.07.028","title":"The solution to the Waring problem for monomials and the sum of coprime monomials","year":2012,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":125,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Monomial; Mathematics; Coprime integers; Rank (graph theory); Pairwise comparison; Combinatorics; Monomial basis; Pure mathematics; Statistics","score_opus":0.04315358005490639,"score_gpt":0.31966075089649537,"score_spread":0.276507170841589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064591878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9193133,0.0009351692,0.039484356,0.03814561,0.00022485937,0.0012661401,0.000010867251,0.000011078679,0.00060859456],"genre_scores_gemma":[0.98879194,0.00005093637,0.010475386,0.00017938987,0.0003159246,0.00004101099,2.3269712e-7,0.000009620427,0.00013557984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918157,0.00007324497,0.0004645919,0.00004183069,0.000104018014,0.00013473116],"domain_scores_gemma":[0.9979404,0.0012254356,0.00048567128,0.00017034146,0.00012386232,0.00005429783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019838235,0.00006305482,0.00018106896,0.000025257146,0.00026191937,0.00004756734,0.00020488416,0.000028326369,0.000005688908],"category_scores_gemma":[0.00019264306,0.000027419428,0.000107625376,0.000050090923,0.00006816298,0.00009328449,0.000042605257,0.00008974218,0.0000036357064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049327925,0.00018734766,0.0004190973,0.000052933894,0.0003130626,9.377435e-8,0.005170952,0.00006575182,0.016800037,0.90326846,0.06007806,0.013150959],"study_design_scores_gemma":[0.005079225,0.0003015533,0.011712055,0.00018415134,0.00082156336,0.00017659174,0.0023307612,0.0010340364,0.06197692,0.79955626,0.1164933,0.00033357504],"about_ca_topic_score_codex":0.000004893602,"about_ca_topic_score_gemma":0.0000054262155,"teacher_disagreement_score":0.103712164,"about_ca_system_score_codex":0.000021951188,"about_ca_system_score_gemma":0.000022979806,"threshold_uncertainty_score":0.20144984},"labels":[],"label_agreement":null},{"id":"W2075879908","doi":"10.1007/s00012-004-1864-2","title":"A characterization of k-normal varieties","year":2004,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Normalization (sociology); Mathematics; Valuation (finance); Variety (cybernetics); Combinatorics; Pure mathematics; Statistics","score_opus":0.01804818728520705,"score_gpt":0.2494112950908435,"score_spread":0.23136310780563646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075879908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556661,0.0000016796574,0.038095042,0.0006961117,0.000029618033,0.000102986254,0.000030341673,0.00008832561,0.005289752],"genre_scores_gemma":[0.99447477,0.00000758711,0.0049049277,0.000085191874,0.000021206131,0.0000033635313,0.00004549287,0.000009331405,0.00044815554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996251,0.00001140972,0.00012256626,0.00007864796,0.00008823716,0.00007405864],"domain_scores_gemma":[0.9996415,0.000025225821,0.000084043255,0.00015451299,0.000063762636,0.00003099818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034140026,0.00005598383,0.00008769352,0.000057892554,0.00005385538,0.000008592423,0.000088290355,0.000036853475,0.00018535987],"category_scores_gemma":[0.000010869292,0.000058003116,0.00004131363,0.00014891209,0.000045684777,0.00013155406,0.000019179679,0.00003898545,0.00002127644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005824678,0.00007177437,0.000036835583,0.000011319702,0.000014158388,0.0000010888824,0.00088801625,0.000002452115,0.08228616,0.91647524,0.000083046514,0.00012407875],"study_design_scores_gemma":[0.0017547065,0.00010783643,0.008425353,0.000052590614,0.00011671056,0.000021989043,0.00096333236,0.000054758566,0.2917481,0.68701446,0.009403455,0.0003366911],"about_ca_topic_score_codex":0.000028769033,"about_ca_topic_score_gemma":0.0000059294953,"teacher_disagreement_score":0.22946078,"about_ca_system_score_codex":0.00002344934,"about_ca_system_score_gemma":0.000022609875,"threshold_uncertainty_score":0.23652984},"labels":[],"label_agreement":null},{"id":"W2081729430","doi":"10.1016/s0024-3795(02)00352-x","title":"Ranks of tensors, secant varieties of Segre varieties and fat points","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":127,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Pure mathematics; Projective variety; Variety (cybernetics); Product (mathematics); Algebraic variety; Algebraic geometry; Lemma (botany); Projective space; Projective test; Algebraic number; Algebra over a field; Mathematical analysis; Geometry","score_opus":0.03566932599326967,"score_gpt":0.27695858826405123,"score_spread":0.24128926227078157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081729430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9176963,0.0037464066,0.05988477,0.005511843,0.000047799713,0.0023345025,0.00065997505,0.0002934982,0.0098249335],"genre_scores_gemma":[0.9880295,0.00043251927,0.010071061,0.00009110881,0.000053235,0.00012497087,0.000017770204,0.000020150062,0.0011597133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991221,0.000026404754,0.0003805104,0.00020694792,0.00014080082,0.00012322851],"domain_scores_gemma":[0.999019,0.00025609366,0.00017760273,0.00029669772,0.00017193715,0.00007864944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008552296,0.00013143031,0.00026284903,0.0000743926,0.00013651994,0.000015350673,0.000114249015,0.000090964706,0.0002363641],"category_scores_gemma":[0.0000424242,0.000117665964,0.000049592443,0.0001946268,0.00016415011,0.00006756634,0.00005776523,0.00010789944,0.000015374006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067456867,0.00024472148,0.0001155866,0.00018667927,0.000049190025,1.29446e-7,0.0012645036,0.0000037377142,0.004622958,0.98975563,0.0019623395,0.0017877801],"study_design_scores_gemma":[0.0021915769,0.00021944076,0.004278285,0.00012131108,0.00049720984,0.00007980771,0.0019132049,0.020466996,0.035119824,0.89179236,0.04246183,0.00085817475],"about_ca_topic_score_codex":0.0000069678113,"about_ca_topic_score_gemma":0.0000027349963,"teacher_disagreement_score":0.097963296,"about_ca_system_score_codex":0.000004898102,"about_ca_system_score_gemma":0.0000065233626,"threshold_uncertainty_score":0.47982788},"labels":[],"label_agreement":null},{"id":"W2087434571","doi":"10.1007/s11856-006-0015-1","title":"On the positivity set of a linear recurrence sequence","year":2007,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sequence (biology); Set (abstract data type); Combinatorics; Constant (computer programming); Discrete mathematics; Pure mathematics","score_opus":0.12793373692651216,"score_gpt":0.39441474150445,"score_spread":0.26648100457793783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087434571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8861827,0.000027419324,0.10951234,0.0013257724,0.00007777281,0.00019520834,0.000028893064,0.000016274522,0.0026335751],"genre_scores_gemma":[0.9203254,0.000014606483,0.079296894,0.00018281689,0.0000879655,0.0000017984835,5.884519e-7,0.000014907892,0.0000750533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850565,0.000058426456,0.00076152093,0.0000738605,0.00044868235,0.00015186222],"domain_scores_gemma":[0.99544567,0.0028303156,0.0009470716,0.0003367379,0.000363867,0.000076318254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019661204,0.00011846215,0.00028203262,0.00009391694,0.00008823429,0.000015526024,0.000368195,0.000056349963,0.000040584997],"category_scores_gemma":[0.00085377233,0.0000743108,0.00015710398,0.00021731817,0.00010560389,0.000053928365,0.00003016484,0.00029990065,0.00002073475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003349852,0.0006228313,0.00005319617,0.00013796259,0.00006810309,0.000023017947,0.0020333477,0.000013770984,0.012633366,0.97983706,0.0021766576,0.002367197],"study_design_scores_gemma":[0.00053552684,0.00033619406,0.00027765014,0.0008782105,0.00012973126,0.0007166528,0.002669544,0.0011797716,0.055127695,0.9372415,0.0006898671,0.00021766685],"about_ca_topic_score_codex":0.0000015962798,"about_ca_topic_score_gemma":0.0000035790035,"teacher_disagreement_score":0.04259556,"about_ca_system_score_codex":0.00003716248,"about_ca_system_score_gemma":0.000044400535,"threshold_uncertainty_score":0.30303064},"labels":[],"label_agreement":null},{"id":"W2092684478","doi":"10.1080/03081087.2013.811583","title":"Canonical forms of 2 × 2 × 2 and 2 × 2 × 2 × 2 symmetric tensors over prime fields","year":2013,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"McMaster University; University of Saskatchewan","keywords":"Mathematics; Prime (order theory); Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.02464235126888602,"score_gpt":0.3120886650240618,"score_spread":0.28744631375517576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092684478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99661285,0.00012992552,0.0010250526,0.0004284501,0.000021912774,0.00037943185,0.000021665779,0.00006431923,0.0013163848],"genre_scores_gemma":[0.9842888,0.00007056839,0.014565137,0.00019915633,0.00006701296,0.00003014441,0.000010847206,0.00002021962,0.0007480803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991129,0.000021389116,0.00033106102,0.00021938233,0.00013500637,0.00018027803],"domain_scores_gemma":[0.9991407,0.00028159108,0.0000937114,0.00024721972,0.00009554898,0.00014125081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094438365,0.00013898958,0.0002569208,0.00009860731,0.00007122227,0.000025351066,0.00008566839,0.00012786794,0.00027315872],"category_scores_gemma":[0.00014038017,0.000108149936,0.00006319045,0.00016731863,0.00010561137,0.00009928524,0.000072502975,0.0001542373,0.0000312761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018965114,0.0026366385,0.029315058,0.0012115617,0.00060475525,0.000016528486,0.004031069,0.000022969069,0.032870043,0.76040703,0.017309943,0.15138476],"study_design_scores_gemma":[0.011186701,0.0010234854,0.2791189,0.00027609285,0.00055491395,0.00023249163,0.0011216267,0.3285955,0.062845655,0.27939907,0.033318825,0.002326751],"about_ca_topic_score_codex":0.00010897331,"about_ca_topic_score_gemma":0.000013402792,"teacher_disagreement_score":0.48100796,"about_ca_system_score_codex":0.0000076571605,"about_ca_system_score_gemma":0.000018132494,"threshold_uncertainty_score":0.44102263},"labels":[],"label_agreement":null},{"id":"W2093432797","doi":"10.1145/3130348.3130358","title":"Information Retrieval using a Singular Value Decomposition Model of Latent Semantic Structure","year":2017,"lang":"en","type":"article","venue":"ACM SIGIR Forum","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":387,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University; Bell (Canada)","funders":"","keywords":"Computer science; Singular value decomposition; Citation; Information retrieval; Value (mathematics); Latent semantic analysis; World Wide Web; Artificial intelligence","score_opus":0.04617564812377155,"score_gpt":0.3387440814574338,"score_spread":0.2925684333336622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093432797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92070585,0.0000069258926,0.077752635,0.00084628287,0.00007438031,0.0002691985,0.000086596796,0.00005687558,0.00020126112],"genre_scores_gemma":[0.92439413,0.0000027674182,0.07538478,0.000116382456,0.000022666443,0.0000013510063,0.000043393688,0.000013792006,0.00002073145],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990804,0.000016478334,0.0003787069,0.00010430273,0.00023236137,0.00018773036],"domain_scores_gemma":[0.99832135,0.000050901,0.0004871624,0.0009314107,0.00015322956,0.000055923225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010542195,0.00012772325,0.00020243529,0.00008113407,0.00043254867,0.00011069858,0.0004025876,0.0001061567,0.000019431052],"category_scores_gemma":[0.00022242349,0.000121684076,0.00009517216,0.000055305165,0.000061249906,0.0005729284,0.00016072621,0.0001072175,0.000008993285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016440217,0.00025217788,0.0027152835,0.00042186934,0.00015534082,0.000002042348,0.0017364831,0.0116378525,0.5847843,0.39451814,0.0013809875,0.0022310733],"study_design_scores_gemma":[0.0006498418,0.000035843015,0.0014512838,0.00010241953,0.00011352873,0.000020163021,0.00006554313,0.3212379,0.08557114,0.59048235,0.00006149125,0.00020852302],"about_ca_topic_score_codex":0.000019014245,"about_ca_topic_score_gemma":0.000002801538,"teacher_disagreement_score":0.49921322,"about_ca_system_score_codex":0.00005218715,"about_ca_system_score_gemma":0.000033610177,"threshold_uncertainty_score":0.49621326},"labels":[],"label_agreement":null},{"id":"W2095112579","doi":"10.1007/s00180-010-0184-6","title":"An acceleration method for Ten Berge et al.’s algorithm for orthogonal INDSCAL","year":2010,"lang":"en","type":"article","venue":"Computational Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Université de Genève; McGill University","keywords":"Acceleration; Algorithm; Mathematics; Computer science; Applied mathematics; Physics; Classical mechanics","score_opus":0.053350659342087305,"score_gpt":0.4315087163112483,"score_spread":0.378158056969161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095112579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014704412,0.0000018278079,0.989011,0.0022803321,0.00021000284,0.0007873527,0.006056948,0.00010263283,0.0000794654],"genre_scores_gemma":[0.00979623,6.362947e-7,0.9826013,0.0023675521,0.00016344084,0.00042213697,0.004496887,0.00004064952,0.00011119585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988658,0.000048173224,0.0003772307,0.0002928292,0.0002326775,0.00018333217],"domain_scores_gemma":[0.9970217,0.0018977612,0.00016846156,0.00016392526,0.0006262105,0.00012194587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042548473,0.00014974506,0.00018221488,0.00007005864,0.0002800018,0.000111550304,0.00015409374,0.00007665855,0.000105766616],"category_scores_gemma":[0.00019204954,0.00015397892,0.00006692244,0.000087587985,0.000039285,0.00012791563,0.00001758874,0.00016224786,0.00001055697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013819664,0.0002521646,0.000016442591,0.000014560527,0.000026854108,3.6059282e-7,0.00009207886,0.00093009096,0.0007587872,0.8609188,0.054685388,0.08229061],"study_design_scores_gemma":[0.0004832906,0.000060428156,0.0009973822,0.0000019968397,0.00002438451,0.0000087001,0.00001180085,0.5185134,0.0000678888,0.4624683,0.017243331,0.0001191414],"about_ca_topic_score_codex":0.00000330869,"about_ca_topic_score_gemma":0.00003630248,"teacher_disagreement_score":0.51758325,"about_ca_system_score_codex":0.000021288446,"about_ca_system_score_gemma":0.00010976108,"threshold_uncertainty_score":0.6279078},"labels":[],"label_agreement":null},{"id":"W2108840817","doi":"10.1162/neco_a_00256","title":"Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization","year":2011,"lang":"en","type":"article","venue":"Neural Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":204,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Non-negative matrix factorization; Multiplicative function; Image (mathematics); Convergence (economics); Matrix (chemical analysis); Simple (philosophy); Inverse; Factorization; Matrix decomposition","score_opus":0.17264928879827862,"score_gpt":0.39757292166750885,"score_spread":0.22492363286923023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108840817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3891712,0.00000893898,0.6089992,0.00035908353,0.00005750165,0.0009008448,0.00007696944,0.0001869402,0.00023934024],"genre_scores_gemma":[0.86305356,0.0000029118912,0.13643904,0.00007558136,0.00004867012,0.0001375295,0.00017169549,0.000019568088,0.00005145999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991607,0.00006141332,0.00027064278,0.0002656854,0.00010147182,0.00014009353],"domain_scores_gemma":[0.99900526,0.00043314727,0.00016099843,0.000089028195,0.0002387098,0.00007285023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007592998,0.00013568242,0.00016145456,0.00007431974,0.00018617921,0.00004519797,0.000076593606,0.000066994995,0.000025137822],"category_scores_gemma":[0.0000803528,0.00012431672,0.000042076932,0.00016294069,0.00005713776,0.00018425724,0.000026945365,0.00009219618,0.000009539226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007350257,0.001737236,0.0036702545,0.00034852783,0.00033312917,0.0000057679504,0.02877957,0.0005578255,0.07601921,0.7557341,0.004926171,0.12715322],"study_design_scores_gemma":[0.001987238,0.00031649222,0.030090334,0.000024830742,0.00008204331,0.00001768981,0.00043674046,0.45881826,0.03351755,0.4740111,0.00025448354,0.00044324715],"about_ca_topic_score_codex":0.000009152199,"about_ca_topic_score_gemma":0.00000245581,"teacher_disagreement_score":0.47388235,"about_ca_system_score_codex":0.000016958784,"about_ca_system_score_gemma":0.0000098788605,"threshold_uncertainty_score":0.5069489},"labels":[],"label_agreement":null},{"id":"W211616019","doi":"10.1007/978-3-319-18032-8_13","title":"Contextual Anomaly Detection Using Log-Linear Tensor Factorization","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Factorization; Tensor (intrinsic definition); Anomaly detection; Anomaly (physics); Computer science; Mathematics; Artificial intelligence; Algorithm; Pure mathematics; Physics; Quantum mechanics","score_opus":0.09141878481234107,"score_gpt":0.3309313722778271,"score_spread":0.23951258746548604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W211616019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042037605,0.0000464201,0.99352366,0.00010504766,0.0005361617,0.00039625983,0.00001992768,0.0001377642,0.0010310047],"genre_scores_gemma":[0.78386325,0.000003169592,0.21465391,0.00024244626,0.0006524228,0.0000069466796,0.000015531301,0.000051255312,0.00051105296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981944,0.000022468306,0.00039931122,0.0006088605,0.00050867756,0.000266309],"domain_scores_gemma":[0.9984146,0.00025703447,0.0002774746,0.00049745024,0.00043808497,0.00011537235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032538318,0.0002940048,0.00033552642,0.00037205644,0.00019946395,0.000110031426,0.00042277892,0.00027091766,0.00004183304],"category_scores_gemma":[0.00013811975,0.0002736144,0.0000776347,0.00026302104,0.0003031295,0.00017322125,0.00014116174,0.0003975479,0.000036928723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011745173,0.00045505492,0.00050617196,0.00032097736,0.0001283156,0.000092763345,0.0037289236,0.08836818,0.04971934,0.1653184,0.00026767913,0.69097674],"study_design_scores_gemma":[0.000494407,0.0001465642,0.00009875423,0.00022502686,0.00004974504,0.00012299317,0.0000012022344,0.4186444,0.0060926853,0.5707205,0.0026607804,0.0007429324],"about_ca_topic_score_codex":0.000016625841,"about_ca_topic_score_gemma":0.000058168855,"teacher_disagreement_score":0.7796595,"about_ca_system_score_codex":0.00034717275,"about_ca_system_score_gemma":0.00018418083,"threshold_uncertainty_score":0.9999716},"labels":[],"label_agreement":null},{"id":"W2119680381","doi":"10.1139/cjc-2014-0590","title":"Two new methods for computing vibrational energy levels","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Basis (linear algebra); Chemistry; Basis function; Product (mathematics); Grid; Tensor product; Function (biology); Pure mathematics; Mathematical analysis; Mathematics; Geometry","score_opus":0.11830275040096618,"score_gpt":0.3943417218845081,"score_spread":0.27603897148354195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119680381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009020645,0.00014759717,0.9827698,0.002249999,0.000116499345,0.000033959688,0.00002175626,0.000008568262,0.0056312038],"genre_scores_gemma":[0.24121152,3.4642002e-7,0.75656414,0.00035071312,0.00075921667,0.0000014380158,0.00000784007,0.00001526147,0.001089551],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994344,0.0000170787,0.00027900943,0.00006422091,0.000072477545,0.00013278433],"domain_scores_gemma":[0.99847704,0.00019227961,0.00019839162,0.000096730146,0.00028284822,0.00075270707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028004733,0.00006753131,0.00013626415,0.000033357057,0.00006684148,0.000043388623,0.00016089543,0.000044019554,0.00014550904],"category_scores_gemma":[0.00028888547,0.00006819712,0.000079525555,0.000066167726,0.000024618224,0.000051094357,0.0000049934583,0.00008341772,0.0000011721356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033130207,0.00007579827,0.00020356942,0.00009824099,0.00025260472,0.00003060984,0.0016926525,0.000702085,0.1855214,0.21368723,0.543724,0.05397871],"study_design_scores_gemma":[0.0015756506,0.000023778113,0.000041939245,0.000052659583,0.00004822899,0.00060372223,0.0003653842,0.0018250769,0.2476895,0.5719788,0.17556493,0.00023031281],"about_ca_topic_score_codex":0.00012901891,"about_ca_topic_score_gemma":0.0001947051,"teacher_disagreement_score":0.36815906,"about_ca_system_score_codex":0.00010804864,"about_ca_system_score_gemma":0.001714694,"threshold_uncertainty_score":0.30417934},"labels":[],"label_agreement":null},{"id":"W2122640592","doi":"10.1002/cem.1245","title":"An efficient algorithm for Parafac with uncorrelated mode‐A components applied to large <i>I</i> × <i>J</i> × <i>K</i> data sets with <i>I</i> &gt;&gt; <i>JK</i>","year":2009,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Algorithm; Uncorrelated; Mode (computer interface); Product (mathematics); Constraint (computer-aided design); Computer science; Mathematics; Statistics","score_opus":0.04417632818794799,"score_gpt":0.33191053844305907,"score_spread":0.2877342102551111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122640592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16028637,0.00011722899,0.8344994,0.0012799649,0.00014877523,0.0014110593,0.00092319754,0.00015828415,0.0011757207],"genre_scores_gemma":[0.56702363,0.00002712085,0.4285018,0.003711043,0.00021309587,0.00003056046,0.00031016796,0.000099656594,0.000082913284],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962347,0.0000520459,0.0011095478,0.0006119443,0.0013007073,0.00069104444],"domain_scores_gemma":[0.9954804,0.00044405775,0.0010590175,0.0013830706,0.00093039876,0.00070305803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010681424,0.00048599625,0.0009172675,0.0007578166,0.00028533422,0.00018848115,0.0014055221,0.00018566195,0.000010924107],"category_scores_gemma":[0.00009683051,0.00036492466,0.00013485155,0.0030783392,0.000055763136,0.00032704044,0.000096808064,0.0005029443,0.000016878777],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008978172,0.05299754,0.0007874716,0.00063975883,0.0024277058,0.00050725864,0.003399687,0.050096113,0.14929807,0.037217516,0.4978116,0.19583912],"study_design_scores_gemma":[0.07004091,0.016080681,0.0022093582,0.0013875157,0.0044870945,0.003876014,0.00151441,0.3674451,0.08071313,0.021994745,0.42319405,0.0070569636],"about_ca_topic_score_codex":0.0000010857311,"about_ca_topic_score_gemma":0.000002604253,"teacher_disagreement_score":0.40673727,"about_ca_system_score_codex":0.00014506139,"about_ca_system_score_gemma":0.00015434448,"threshold_uncertainty_score":0.99988025},"labels":[],"label_agreement":null},{"id":"W2122949291","doi":"10.1002/cem.789","title":"Maximum likelihood parallel factor analysis (MLPARAFAC)","year":2003,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Algorithm; Covariance; Noise (video); Covariance matrix; Variety (cybernetics); Computer science; Least-squares function approximation; Uncorrelated; Mathematics; Statistics; Artificial intelligence","score_opus":0.05454327994311516,"score_gpt":0.33079010294682387,"score_spread":0.27624682300370873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122949291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6120533,0.00048698724,0.3769212,0.0010735424,0.0002096986,0.0001560777,0.000023783901,0.000048046797,0.009027358],"genre_scores_gemma":[0.8896548,0.00009286894,0.10959792,0.00014980821,0.00007080082,0.0000024867431,0.0000017855751,0.0000175875,0.00041193966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984671,0.000050314404,0.00066756696,0.000115863564,0.00049032754,0.00020886581],"domain_scores_gemma":[0.9980834,0.0003648653,0.0006494211,0.0002707202,0.00042441735,0.00020715255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414741,0.00013343246,0.0004407395,0.0013903454,0.000065842934,0.00006020963,0.00023839377,0.000092898794,0.0005531628],"category_scores_gemma":[0.0008559049,0.00011084198,0.00045492846,0.004373194,0.000022534128,0.000120366945,0.000014548398,0.00026206722,0.000036594633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003287604,0.015458427,0.24450782,0.000618179,0.020740835,0.00042104317,0.0041050552,0.0010815198,0.024449207,0.40690592,0.21379516,0.06758807],"study_design_scores_gemma":[0.004312171,0.00039352875,0.038569257,0.000042459666,0.003960128,0.00040440413,0.0008199657,0.0003654871,0.023724463,0.75684047,0.16949025,0.0010774212],"about_ca_topic_score_codex":5.5772915e-7,"about_ca_topic_score_gemma":7.053155e-7,"teacher_disagreement_score":0.34993455,"about_ca_system_score_codex":0.000081594735,"about_ca_system_score_gemma":0.00005771631,"threshold_uncertainty_score":0.60567445},"labels":[],"label_agreement":null},{"id":"W2129068307","doi":"10.48550/arxiv.1412.4864","title":"Learning with Pseudo-Ensembles","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":361,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Robustness (evolution); Artificial intelligence; Ensemble learning; Benchmark (surveying); Machine learning; Artificial neural network; Dropout (neural networks); Perturbation (astronomy); Pattern recognition (psychology); Algorithm","score_opus":0.06577836543410738,"score_gpt":0.2018170692429524,"score_spread":0.13603870380884503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129068307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81936854,9.00252e-7,0.15927485,0.00009582216,0.000011634945,0.00007147824,9.081593e-7,0.00019866963,0.020977186],"genre_scores_gemma":[0.9914671,0.00000472968,0.0026648224,0.00006221112,0.000027200935,5.035972e-7,0.0000029211253,0.00001416755,0.0057563465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994862,0.000053989133,0.00006663259,0.00022039216,0.000035271416,0.00013747792],"domain_scores_gemma":[0.9994015,0.00016233919,0.000066064415,0.00023741393,0.000057935853,0.00007474646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008344729,0.000088818255,0.0001054605,0.000055507007,0.0001735112,0.000018535515,0.0001345181,0.00003893668,0.00010285202],"category_scores_gemma":[0.00002691825,0.000084573825,0.00004109289,0.00022850558,0.000051597282,0.00008419004,0.000027741899,0.000117534175,0.00017440438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002037237,0.00006204598,0.003769926,0.000011973422,0.000020016721,0.000009940987,0.000090904505,0.0031391012,0.00048263656,0.99155563,0.00057921815,0.0002582041],"study_design_scores_gemma":[0.003613111,0.00062052003,0.008296711,0.00012943755,0.00034501642,0.000076610166,0.0019157458,0.21221067,0.00262775,0.7280676,0.040897574,0.001199254],"about_ca_topic_score_codex":0.0000079450665,"about_ca_topic_score_gemma":0.000014950437,"teacher_disagreement_score":0.26348805,"about_ca_system_score_codex":0.000022869983,"about_ca_system_score_gemma":0.000009580657,"threshold_uncertainty_score":0.34488204},"labels":[],"label_agreement":null},{"id":"W2142412563","doi":"10.1063/1.2949249","title":"A geometric description of tensor product decompositions in su(3)","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor product; Decomposition; Tensor (intrinsic definition); Tensor product of Hilbert spaces; Tensor contraction; Product (mathematics); Tensor decomposition; Mathematics; Algebra over a field; Symmetric tensor; Cartesian tensor; Tensor density; Pure mathematics; Theoretical physics; Tensor field; Physics; Exact solutions in general relativity; Mathematical analysis; Geometry","score_opus":0.09589504705267571,"score_gpt":0.32627667998491766,"score_spread":0.23038163293224195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142412563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8776777,0.00005079342,0.120112896,0.0003980618,0.00004214516,0.00021661243,0.0000075332828,0.00001784342,0.0014764271],"genre_scores_gemma":[0.903873,0.000024396011,0.09581892,0.000029852103,0.00012270741,0.000007933604,0.0000013499698,0.000017974367,0.00010384142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832493,0.0000623773,0.00094567117,0.00010656194,0.00039914533,0.00016133884],"domain_scores_gemma":[0.9982403,0.00047608162,0.00057503826,0.00024815588,0.00037039057,0.0000900291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034985007,0.00012533044,0.0004795872,0.00026785597,0.000060661867,0.000013789068,0.0001951585,0.000045539808,0.00006730833],"category_scores_gemma":[0.00038782228,0.00010278207,0.00021011662,0.0007851284,0.0001058813,0.00021199546,0.000025924834,0.0002548193,0.000028373614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020118973,0.017045392,0.0053234175,0.0011666472,0.00030702437,0.000120202916,0.0037981358,0.00052315975,0.08117247,0.8658464,0.0210809,0.0034150644],"study_design_scores_gemma":[0.0009997751,0.0001641711,0.0072542382,0.00025574744,0.000098195764,0.0006834803,0.00013933226,0.00064690213,0.010794552,0.9786553,0.00012587686,0.00018245162],"about_ca_topic_score_codex":0.0000012055305,"about_ca_topic_score_gemma":3.6737728e-7,"teacher_disagreement_score":0.112808876,"about_ca_system_score_codex":0.00006480494,"about_ca_system_score_gemma":0.000056972905,"threshold_uncertainty_score":0.41913313},"labels":[],"label_agreement":null},{"id":"W2143526866","doi":"10.1137/120896499","title":"Birkhoff--von Neumann Theorem for Multistochastic Tensors","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Extreme point; Permutation (music); Tensor (intrinsic definition); Class (philosophy); Permutation matrix; Von Neumann architecture; Set (abstract data type); Pure mathematics; Regular polygon; Combinatorics; Algebra over a field; Geometry","score_opus":0.021071244987455683,"score_gpt":0.33686466200191195,"score_spread":0.3157934170144563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143526866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023801574,0.00006203527,0.97255605,0.0017126604,0.000021307427,0.0005326898,0.000063200365,0.000085892825,0.0011645956],"genre_scores_gemma":[0.95973414,0.00007031726,0.03746924,0.00031992214,0.00043184336,0.00041830694,0.00004378123,0.000037646194,0.0014747911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868894,0.00006696872,0.00050495553,0.00030385482,0.00020577291,0.00022950763],"domain_scores_gemma":[0.99802744,0.0007808588,0.00035812968,0.00040832788,0.00021100813,0.00021421004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050331437,0.00018720307,0.00037947108,0.0004047823,0.00071288826,0.00015856395,0.00021708873,0.00007591106,0.00010072539],"category_scores_gemma":[0.00010221078,0.00015121853,0.00037300793,0.00064046355,0.000073760035,0.00005998466,0.00002110881,0.00020423102,0.000054478714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019651432,0.00023483012,0.00016438753,0.000025244537,0.00035757924,2.7194088e-7,0.0000542964,0.00081888644,0.000851252,0.9855895,0.0016095026,0.010274585],"study_design_scores_gemma":[0.001402127,0.00021536037,0.0034872054,0.000034287576,0.003201572,0.00006784959,0.00023857056,0.054611843,0.0003359724,0.794996,0.14082548,0.0005837081],"about_ca_topic_score_codex":0.0000023287473,"about_ca_topic_score_gemma":0.000007216137,"teacher_disagreement_score":0.9359326,"about_ca_system_score_codex":0.000032542343,"about_ca_system_score_gemma":0.00001378252,"threshold_uncertainty_score":0.61665124},"labels":[],"label_agreement":null},{"id":"W2159111908","doi":"10.2172/887253","title":"Temporal analysis of social networks using three-way DEDICOM.","year":2006,"lang":"en","type":"report","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Hospital","funders":"","keywords":"Computer science; Adjacency list; Adjacency matrix; Construct (python library); Uniqueness; Latent semantic analysis; Theoretical computer science; Graph; Representation (politics); Extension (predicate logic); Tensor (intrinsic definition); Data mining; Algorithm; Information retrieval; Mathematics","score_opus":0.12556821684714517,"score_gpt":0.39515762751562084,"score_spread":0.26958941066847564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159111908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024527745,0.0001768873,0.77402973,0.0002466528,0.00029634574,0.00056746637,0.0003219894,0.0002922645,0.19954091],"genre_scores_gemma":[0.9098242,0.00005984915,0.065152414,0.00009076357,0.0022045572,0.00006740685,0.0030365589,0.00017569632,0.019388547],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977965,0.000030805,0.00087408395,0.00028510691,0.0008090611,0.0002044487],"domain_scores_gemma":[0.998158,0.0001251368,0.00085549144,0.000398485,0.0004135469,0.00004939133],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044790388,0.00023882132,0.00095875066,0.00041699273,0.00014191263,0.00003874339,0.00023917622,0.0004729296,0.0010959337],"category_scores_gemma":[0.000019375197,0.00021640996,0.00074760214,0.00096298364,0.000076444594,0.000027923808,0.000072225695,0.00027965067,0.0000028565757],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013635261,0.0011883037,0.01504934,0.0004239648,0.009895677,0.000016633765,0.00014697466,0.0034316776,0.0000906306,0.11620283,0.8503002,0.0032401367],"study_design_scores_gemma":[0.0015731719,0.000072927956,0.050252624,0.00036874643,0.07453432,0.00007808879,0.00042104267,0.5535787,0.00013703464,0.07831887,0.23708624,0.0035782403],"about_ca_topic_score_codex":0.0015865464,"about_ca_topic_score_gemma":0.00188424,"teacher_disagreement_score":0.88529646,"about_ca_system_score_codex":0.0001541502,"about_ca_system_score_gemma":0.00017714592,"threshold_uncertainty_score":0.9998172},"labels":[],"label_agreement":null},{"id":"W2161137988","doi":"10.2172/900402","title":"Pattern analysis of directed graphs using DEDICOM: an application to Enron email.","year":2006,"lang":"en","type":"report","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Sandia National Laboratories; U.S. Department of Energy","keywords":"Interpretability; Uniqueness; Computer science; Adjacency list; Latent semantic analysis; Extension (predicate logic); Theoretical computer science; Strongly connected component; Graph; Order (exchange); Artificial intelligence; Mathematics; Algorithm","score_opus":0.0713641675276691,"score_gpt":0.38501682617087324,"score_spread":0.31365265864320413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161137988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23024103,0.00003934707,0.7323926,0.00009277225,0.000100053585,0.0013052574,0.00059951097,0.00063439936,0.034595035],"genre_scores_gemma":[0.9452036,0.00003584934,0.047325768,0.00012036549,0.00020596811,0.00030227384,0.003715773,0.00012542322,0.0029649711],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9975644,0.00006201695,0.0009393152,0.00051988586,0.00070860167,0.00020578582],"domain_scores_gemma":[0.9972533,0.00012100711,0.0006872653,0.0010569387,0.00074070477,0.00014075915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032963644,0.0002855402,0.0008492369,0.001065306,0.00008766008,0.000034674085,0.000277102,0.00027498294,0.00031315754],"category_scores_gemma":[0.000038253023,0.00027281113,0.00038573984,0.0017738164,0.00003272395,0.0000491135,0.000052033593,0.00015815749,0.000012573058],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010496687,0.016602026,0.14179662,0.004826792,0.026832316,0.000035449382,0.0024616274,0.007614222,0.13760418,0.070746936,0.37322578,0.2181491],"study_design_scores_gemma":[0.0026364522,0.0005727303,0.38607326,0.0012521844,0.09702477,0.00017378421,0.0009917247,0.24283056,0.022349847,0.09523746,0.14112172,0.009735516],"about_ca_topic_score_codex":0.004874458,"about_ca_topic_score_gemma":0.003323533,"teacher_disagreement_score":0.7149626,"about_ca_system_score_codex":0.00017078694,"about_ca_system_score_gemma":0.0001121044,"threshold_uncertainty_score":0.9999724},"labels":[],"label_agreement":null},{"id":"W2212333471","doi":"10.3842/sigma.2016.117","title":"Orthogonal Separation of the Hamilton-Jacobi Equation on Spaces of Constant Curvature","year":2016,"lang":"en","type":"article","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constant curvature; Hamilton–Jacobi equation; Curvature; Pure mathematics; Separation of variables; Separable space; Tensor (intrinsic definition); Conformal map; Constant (computer programming); Mathematical analysis; Geometry; Partial differential equation; Computer science","score_opus":0.05400900123939454,"score_gpt":0.40321162788411335,"score_spread":0.3492026266447188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212333471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4752823,0.00018918735,0.5184616,0.0022472127,0.00004990889,0.0009322981,0.0003415454,0.000039456525,0.0024565125],"genre_scores_gemma":[0.90937144,0.00009317229,0.09008434,0.00007440613,0.0000321803,0.00014711372,0.0000071793825,0.000009527844,0.00018064056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858385,0.00029265854,0.000494986,0.00031389334,0.00019143795,0.00012317587],"domain_scores_gemma":[0.996199,0.002618601,0.00034976826,0.00053052284,0.00023370828,0.00006838245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011279177,0.0001527696,0.00029714368,0.0001300985,0.00017528301,0.000017075281,0.0001532162,0.00013163169,0.000050865547],"category_scores_gemma":[0.0005441199,0.00008508707,0.00010903465,0.0006543347,0.0005193378,0.00007338447,0.00004818483,0.00016035617,0.0000019491379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019803376,0.00019693303,0.0037362915,0.000089270565,0.00003274077,1.2816235e-8,0.00010578928,5.23699e-7,0.02810723,0.91557884,0.000085347034,0.052047215],"study_design_scores_gemma":[0.0004743084,0.00011164226,0.019016007,0.00014813534,0.000119266995,0.000007651172,0.0004232057,0.0001347012,0.0637931,0.9067353,0.0088321455,0.00020451323],"about_ca_topic_score_codex":0.000010677177,"about_ca_topic_score_gemma":0.00000790332,"teacher_disagreement_score":0.43408912,"about_ca_system_score_codex":0.000023779763,"about_ca_system_score_gemma":0.000032921133,"threshold_uncertainty_score":0.346975},"labels":[],"label_agreement":null},{"id":"W2268704426","doi":"10.1016/j.laa.2017.07.021","title":"Waring-like decompositions of polynomials, 1","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Knut och Alice Wallenbergs Stiftelse; Natural Sciences and Engineering Research Council of Canada; Queen's University; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Monomial; Homogeneous; Degree (music); Combinatorics; Sums of powers; Decomposition; Homogeneous polynomial; Discrete mathematics; Pure mathematics; Polynomial; Mathematical analysis; Matrix polynomial","score_opus":0.04549379085835899,"score_gpt":0.3435571623498662,"score_spread":0.29806337149150725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268704426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86709833,0.0005400126,0.08654819,0.008571614,0.0001509852,0.0023845606,0.00054895016,0.0004269262,0.03373046],"genre_scores_gemma":[0.97866803,0.0000964241,0.01956541,0.00011733678,0.00013630696,0.0002942585,0.000031839427,0.00002271174,0.0010677013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991903,0.000014368754,0.0003129625,0.00023298532,0.000105050334,0.0001443391],"domain_scores_gemma":[0.9986206,0.00014643585,0.0002623792,0.0007374329,0.00011998589,0.00011314384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009438209,0.00011961075,0.00019937156,0.0000611962,0.00078343705,0.00005987784,0.00033177514,0.00007270045,0.000100126614],"category_scores_gemma":[0.000044395823,0.00011729517,0.00007246544,0.000067704255,0.00011449733,0.00012927422,0.00011318483,0.000102434504,0.0000769618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005039525,0.00023149296,0.0002707209,0.000046270066,0.00003592106,2.3931813e-7,0.000102973514,0.0000013028371,0.015247248,0.9801262,0.0017182527,0.002214356],"study_design_scores_gemma":[0.0023617025,0.00013532191,0.03783613,0.00014125567,0.00048701692,0.00008652036,0.00028178727,0.005404714,0.068993054,0.6679129,0.2152346,0.0011250239],"about_ca_topic_score_codex":0.0000141774235,"about_ca_topic_score_gemma":0.000011187829,"teacher_disagreement_score":0.3122133,"about_ca_system_score_codex":0.0000096664435,"about_ca_system_score_gemma":0.000022549228,"threshold_uncertainty_score":0.60256433},"labels":[],"label_agreement":null},{"id":"W2283608423","doi":"10.1109/tsc.2015.2497705","title":"Deep Computation Model for Unsupervised Feature Learning on Big Data","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":151,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Deep learning; Artificial intelligence; Feature vector; Big data; Tensor (intrinsic definition); Data modeling; Feature (linguistics); Pattern recognition (psychology); Autoencoder; Computation; Feature learning; Machine learning; Data mining; Algorithm; Mathematics","score_opus":0.1697865211088342,"score_gpt":0.35584263707734565,"score_spread":0.18605611596851146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283608423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037381012,0.000010537617,0.9601305,0.00075197476,0.0003161597,0.0004947248,0.00006320507,0.00043741125,0.00041446267],"genre_scores_gemma":[0.89004296,0.0000023228272,0.10883037,0.00053820136,0.00015493424,0.000025779631,0.00014502267,0.000050274168,0.00021013292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986089,0.00007301666,0.00030550873,0.00047442195,0.00028355952,0.00025463552],"domain_scores_gemma":[0.99846125,0.0004992023,0.00015795756,0.00051673385,0.00021728818,0.00014756524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003130082,0.00021936787,0.00023744318,0.00014838291,0.00048746532,0.00011275133,0.00042420355,0.00011864072,0.000004277739],"category_scores_gemma":[0.000007708683,0.00022184684,0.00008602383,0.00027581304,0.000019156048,0.00015053453,0.000007093954,0.00035049432,0.00004245756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007005454,0.0002818372,0.0000043425675,0.0001151279,0.000047226815,5.8969636e-7,0.0018341932,0.95321506,0.00025795915,0.00081816467,0.0003724872,0.042982973],"study_design_scores_gemma":[0.0010861357,0.000088486035,0.000007944555,0.000093928815,0.00007331492,0.000006408893,0.0007511956,0.99055576,0.00045181517,0.006222681,0.00043633053,0.00022602477],"about_ca_topic_score_codex":0.000011933322,"about_ca_topic_score_gemma":0.000089364934,"teacher_disagreement_score":0.85266197,"about_ca_system_score_codex":0.00006594015,"about_ca_system_score_gemma":0.00003990635,"threshold_uncertainty_score":0.9046652},"labels":[],"label_agreement":null},{"id":"W2294277889","doi":"","title":"Tensor Analyzers","year":2013,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multilinear map; Generalization; Tensor (intrinsic definition); Artificial intelligence; Computer science; Latent variable; Face (sociological concept); Factor (programming language); Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.0714223381075099,"score_gpt":0.36052847844171104,"score_spread":0.2891061403342011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294277889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51164275,0.00001035465,0.014846375,0.027835794,0.0002749444,0.00041967756,0.000024441293,0.0005594555,0.44438618],"genre_scores_gemma":[0.98316526,0.000009562835,0.005293561,0.00045801225,0.000078486984,0.00005912606,0.000042551426,0.000015852229,0.010877597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917895,0.000048710193,0.0002007583,0.00019556744,0.0002460564,0.00012996615],"domain_scores_gemma":[0.99931926,0.00013905679,0.000111110574,0.00014219606,0.00021932584,0.00006903819],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008693984,0.00011307263,0.00011170403,0.000119399214,0.0001061393,0.00012563221,0.00025019774,0.000039097486,0.013875776],"category_scores_gemma":[0.00017897479,0.000099206954,0.000064587024,0.0000786949,0.000030637104,0.00010992372,0.000037008587,0.00030385418,0.0017466629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103856255,0.00011024127,0.0058013895,0.0000047551316,0.000056198987,0.0000027009507,0.00014054474,0.00013974674,0.0057790885,0.9754585,0.003766986,0.008729438],"study_design_scores_gemma":[0.0012509762,0.00017828877,0.025398895,0.00011376602,0.000036612648,0.000042058826,0.0006419148,0.37371072,0.0012616955,0.5497018,0.046980675,0.00068260595],"about_ca_topic_score_codex":0.00008305275,"about_ca_topic_score_gemma":0.000008156733,"teacher_disagreement_score":0.47152248,"about_ca_system_score_codex":0.00003559681,"about_ca_system_score_gemma":0.000012733302,"threshold_uncertainty_score":0.9990306},"labels":[],"label_agreement":null},{"id":"W2295966731","doi":"10.1109/icip.2015.7351019","title":"Hierarchical tucker tensor regression: Application to brain imaging data analysis","year":2015,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Dimension (graph theory); Tensor (intrinsic definition); Rank (graph theory); Regression analysis; Regression; Linear regression; Mathematics; Covariate; Artificial intelligence; Contrast (vision); Tucker decomposition; Computer science; Statistics; Applied mathematics; Combinatorics; Pure mathematics; Tensor decomposition","score_opus":0.10434302120941685,"score_gpt":0.4066080538738986,"score_spread":0.30226503266448174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295966731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014046307,0.000014363088,0.91968244,0.05277987,0.00002628103,0.00040838696,0.00007410479,0.0003390719,0.012629168],"genre_scores_gemma":[0.6142132,0.0000011273172,0.37481838,0.0046009575,0.00019268181,0.00013745864,0.000523152,0.000032329484,0.0054806815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871486,0.000058965103,0.00029241256,0.00046737958,0.00028891163,0.0001774701],"domain_scores_gemma":[0.9976211,0.00021930247,0.000071979324,0.0016406964,0.00013495758,0.00031194504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045047968,0.000120571945,0.0002170454,0.00019187287,0.00008980381,0.00006230273,0.00053632236,0.00003783181,0.00019899588],"category_scores_gemma":[0.00028206652,0.00009318424,0.00006162906,0.0008806354,0.00003233763,0.00012683193,0.0002736866,0.0001057321,0.0004572517],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026179714,0.00028751185,0.0039115488,0.0000090859285,0.0001483402,0.0000035971887,0.00037283005,0.000048822294,0.0021220911,0.20671575,0.77116805,0.015186169],"study_design_scores_gemma":[0.0012100246,0.000035230838,0.008949111,0.000028951288,0.0008429702,0.00004828946,0.0009979756,0.2091699,0.0010530369,0.263752,0.51306164,0.00085083453],"about_ca_topic_score_codex":0.000027379761,"about_ca_topic_score_gemma":0.000042275875,"teacher_disagreement_score":0.6001669,"about_ca_system_score_codex":0.000036110934,"about_ca_system_score_gemma":0.000028603821,"threshold_uncertainty_score":0.5877198},"labels":[],"label_agreement":null},{"id":"W2312649792","doi":"10.1190/1.3627833","title":"A tensor higher‐order singular value decomposition (HOSVD) for pre‐stack simultaneous noise‐reduction and interpolation","year":2011,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Singular value decomposition; Tensor (intrinsic definition); Stack (abstract data type); Interpolation (computer graphics); Noise reduction; Reduction (mathematics); Mathematics; Noise (video); Decomposition; Order (exchange); Value (mathematics); Computer science; Algorithm; Pure mathematics; Statistics; Artificial intelligence; Geometry","score_opus":0.041172955298347,"score_gpt":0.3334472325961529,"score_spread":0.29227427729780586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312649792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45875904,0.000032429565,0.5330452,0.0010433723,0.00022592761,0.0014976816,0.000038437567,0.00045067602,0.0049072476],"genre_scores_gemma":[0.7294092,0.000004678533,0.26888412,0.00014392208,0.000082424514,0.000107095206,0.000046346853,0.000031324686,0.0012908862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899983,0.000037690526,0.0003455981,0.00031482524,0.000112919355,0.00018914122],"domain_scores_gemma":[0.9990469,0.00022523633,0.00014457939,0.00025277404,0.00023899203,0.00009147621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011405757,0.00017100408,0.00018722528,0.00009534571,0.00019766628,0.000053179523,0.0000848537,0.00011034817,0.0003044917],"category_scores_gemma":[0.000067890745,0.00015996874,0.00007023803,0.0001293143,0.000060127495,0.00017397675,0.000026815167,0.0000811268,0.000024802506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061027834,0.0015038806,0.00024269905,0.00025393988,0.00020266503,0.0000043157697,0.004921655,0.000109774955,0.12675126,0.8488535,0.0075104246,0.009035573],"study_design_scores_gemma":[0.0031499418,0.0007619324,0.0037117612,0.00016014103,0.00048626764,0.00024383966,0.00075340434,0.16129221,0.035435036,0.7838945,0.00897944,0.0011315274],"about_ca_topic_score_codex":0.000036514877,"about_ca_topic_score_gemma":0.0000055716464,"teacher_disagreement_score":0.27065018,"about_ca_system_score_codex":0.000042206804,"about_ca_system_score_gemma":0.000013356965,"threshold_uncertainty_score":0.6523336},"labels":[],"label_agreement":null},{"id":"W2336634865","doi":"10.48550/arxiv.1112.0298","title":"Ranks of 0-1 arrays of size 2 x 2 x 2 and 2 x 2 x 2 x 2","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Product (mathematics); Mathematics; Field (mathematics); Combinatorics; Set (abstract data type); Boolean algebra; Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.12886575034395492,"score_gpt":0.22416434755537654,"score_spread":0.09529859721142162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336634865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492655,0.00003477139,0.031721175,0.00002649556,0.000070527174,0.00032273115,0.000100160556,0.000066739616,0.018391905],"genre_scores_gemma":[0.993229,0.00015150616,0.0054592397,0.000012222533,0.000018160386,0.0000010243708,0.000007350536,0.00001800428,0.0011035206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913996,0.000055641685,0.00026861025,0.00036469073,0.00005001667,0.00012105305],"domain_scores_gemma":[0.9983694,0.00029684167,0.0004431368,0.0006493096,0.00016138074,0.00007992933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011979336,0.00017486712,0.00041725513,0.00010368057,0.000038694074,0.000005455023,0.00032750177,0.00021314863,0.00027654137],"category_scores_gemma":[0.00006132343,0.00019632511,0.00016238283,0.00015406945,0.00021393957,0.000043797867,0.00032985111,0.00023859287,0.000007978141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006957096,0.00032677798,0.0009527974,0.00059028255,0.00017613596,0.000011284589,0.00062606257,0.0004657531,0.0018318314,0.99426776,0.0005945254,0.00008724167],"study_design_scores_gemma":[0.0007103576,0.000044457636,0.0018570857,0.00016038981,0.00033970503,0.000003908406,0.00022107165,0.0015016918,0.0049523464,0.9897058,0.0002161823,0.0002869921],"about_ca_topic_score_codex":0.00005854835,"about_ca_topic_score_gemma":0.000011504573,"teacher_disagreement_score":0.043963473,"about_ca_system_score_codex":0.000022165128,"about_ca_system_score_gemma":0.000042709155,"threshold_uncertainty_score":0.8005906},"labels":[],"label_agreement":null},{"id":"W2400648685","doi":"10.1109/icassp.2016.7472870","title":"Online incremental higher-order partial least squares regression for fast reconstruction of motion trajectories from tensor streams","year":2016,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Tensor (intrinsic definition); Computer science; Projection (relational algebra); Scalability; Partial least squares regression; Artificial intelligence; Algorithm; Cluster analysis; Regression; Latent variable; Theoretical computer science; Machine learning; Mathematics; Statistics","score_opus":0.04801838149161407,"score_gpt":0.3200513751964805,"score_spread":0.27203299370486644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400648685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9413389,0.000008309085,0.055496287,0.0012168415,0.00021415231,0.00037659536,0.0009048946,0.00012867172,0.0003153437],"genre_scores_gemma":[0.9415495,0.000007737392,0.056940544,0.000021455364,0.00025881527,0.000058889218,0.00014011859,0.000019068762,0.0010038723],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990985,0.000034434717,0.0003752748,0.00021882485,0.00014503897,0.00012796248],"domain_scores_gemma":[0.9991223,0.00022781412,0.00020414533,0.0002184461,0.00017610131,0.000051197447],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005588384,0.00012841178,0.00019653798,0.000049869,0.0000908418,0.000012894653,0.00007922024,0.00008311292,0.0010222521],"category_scores_gemma":[0.000048765243,0.000079963516,0.000082959916,0.00008191619,0.00008458255,0.00014343676,0.000018442095,0.00003888303,0.000010324995],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003746907,0.0015237813,0.008677594,0.000076325836,0.00013395748,4.1005097e-7,0.00031054634,0.0000028304682,0.61978745,0.08213989,0.0051583755,0.28181416],"study_design_scores_gemma":[0.0069070957,0.00047279825,0.033456538,0.00064214115,0.00026734197,0.00001665088,0.002742219,0.0012207559,0.8248283,0.12419734,0.004535549,0.00071321934],"about_ca_topic_score_codex":0.00007489672,"about_ca_topic_score_gemma":0.00009941994,"teacher_disagreement_score":0.28110093,"about_ca_system_score_codex":0.00004128357,"about_ca_system_score_gemma":0.000014392648,"threshold_uncertainty_score":0.9998909},"labels":[],"label_agreement":null},{"id":"W2411304668","doi":"","title":"Scalable and Sound Low-Rank Tensor Learning","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scalability; Computer science; Tensor (intrinsic definition); Rank (graph theory); Sound (geography); Mathematics; Acoustics; Physics","score_opus":0.14412932921451255,"score_gpt":0.3819043419830679,"score_spread":0.23777501276855534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411304668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06778777,0.0000082960305,0.92123276,0.0032566045,0.00016327326,0.00015176806,0.00021334112,0.000073875206,0.007112337],"genre_scores_gemma":[0.9812475,0.00016664287,0.016723035,0.00014810146,0.000078013276,0.000019399422,0.00001166957,0.000012621248,0.001593037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990198,0.00004545668,0.00030654971,0.00025939368,0.00021358894,0.00015518062],"domain_scores_gemma":[0.9986176,0.0008132345,0.00010213788,0.00010895427,0.00026398097,0.00009408915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016859674,0.0001285016,0.00013509844,0.00008249983,0.00015768406,0.00014772857,0.00012360516,0.000053069947,0.0009145663],"category_scores_gemma":[0.0005571115,0.000096702264,0.000019615372,0.000050313552,0.00021093167,0.00009165807,0.00004204472,0.00011470698,0.00018801788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041405096,0.000061907434,0.00023013666,0.000007194541,0.000015253592,0.000003989274,0.00012693559,0.0000032901278,0.0029301632,0.9157333,0.00027737662,0.080569096],"study_design_scores_gemma":[0.000057959074,0.00008431005,0.00030909808,0.00007016282,0.000011614165,0.000015392607,0.0003794305,0.011020147,0.0022372762,0.98493403,0.00071968255,0.00016090678],"about_ca_topic_score_codex":0.000009976489,"about_ca_topic_score_gemma":0.000042371328,"teacher_disagreement_score":0.9134597,"about_ca_system_score_codex":0.000024079258,"about_ca_system_score_gemma":0.000018392704,"threshold_uncertainty_score":0.99999875},"labels":[],"label_agreement":null},{"id":"W2416570751","doi":"10.1021/acs.jpca.5b10015","title":"Using Nested Contractions and a Hierarchical Tensor Format To Compute Vibrational Spectra of Molecules with Seven Atoms","year":2015,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry A","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenfunction; Hamiltonian (control theory); Quartic function; Wave function; Computational chemistry; Computer science; Eigenvalues and eigenvectors; Mathematics; Chemistry; Physics; Quantum mechanics; Pure mathematics; Mathematical optimization","score_opus":0.047710756258663264,"score_gpt":0.32364916206159133,"score_spread":0.27593840580292806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416570751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83346194,0.0000067928454,0.16496962,0.0011294077,0.0000031270863,0.000075328564,0.000011310835,0.000007690895,0.00033475683],"genre_scores_gemma":[0.9758952,5.798637e-7,0.023869874,0.000056258094,0.00015176322,0.0000014348045,0.0000012050157,0.0000076271895,0.000016022897],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994121,0.000026975897,0.00021272147,0.000049127335,0.00021989222,0.00007918017],"domain_scores_gemma":[0.99912167,0.00022908513,0.00020189426,0.00010358182,0.0002051132,0.00013863057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010149468,0.000076010365,0.00018171282,0.000014924685,0.000053183332,0.000020152946,0.0001048805,0.00002064621,0.000003497809],"category_scores_gemma":[0.0000421776,0.00004661005,0.000046304074,0.00010373586,0.00008567161,0.00007933127,0.000022616563,0.00016674845,7.0646104e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003977667,0.0005968328,0.000021687638,0.000058878828,0.00013864368,0.000006523532,0.001742554,0.004995471,0.9678386,0.023639847,0.00043302163,0.00013018485],"study_design_scores_gemma":[0.0036432045,0.0006169809,0.0011783784,0.0003466413,0.0006426689,0.0042618997,0.0023653419,0.15964252,0.67085385,0.15522335,0.00077176234,0.00045341472],"about_ca_topic_score_codex":0.0000013956216,"about_ca_topic_score_gemma":3.3934543e-7,"teacher_disagreement_score":0.29698476,"about_ca_system_score_codex":0.000018251689,"about_ca_system_score_gemma":0.000059715865,"threshold_uncertainty_score":0.19007027},"labels":[],"label_agreement":null},{"id":"W2541077386","doi":"10.1142/s0219498820501212","title":"Fano schemes for generic sums of products of linear forms","year":2019,"lang":"en","type":"preprint","venue":"Journal of Algebra and Its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperplane; Pfaffian; Linear subspace; Fano plane; Mathematics; Dimension (graph theory); Hypersurface; Product (mathematics); Upper and lower bounds; Tensor product; Rank (graph theory); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.05930994424995299,"score_gpt":0.3392514718352186,"score_spread":0.2799415275852656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541077386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.770103,0.0029337232,0.21957166,0.0028135183,0.00014681698,0.0032807733,0.00052224053,0.00003065827,0.00059763587],"genre_scores_gemma":[0.912406,0.00087905093,0.08564322,0.00004945589,0.00030554316,0.00023673095,0.000052890104,0.000041605428,0.0003854779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984295,0.000016197338,0.0010058803,0.00020489766,0.00021948345,0.00012406295],"domain_scores_gemma":[0.9962416,0.00023655503,0.0018084417,0.00044163302,0.0011957721,0.00007597352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027811964,0.00017400995,0.00058761827,0.0001840878,0.00006526184,0.000016213671,0.00033524318,0.00016362754,0.000016815826],"category_scores_gemma":[0.00011448535,0.00014117784,0.00022211176,0.00017590923,0.000056013723,0.00007572082,0.00012184213,0.00025095127,0.0000030073666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108054286,0.0010586818,0.00017609185,0.005511816,0.0006405269,2.6764542e-7,0.00065991725,0.000094494026,0.11934382,0.8575868,0.0073138895,0.007505668],"study_design_scores_gemma":[0.0019114981,0.000515603,0.00073466694,0.0007134845,0.0011366153,0.00008784093,0.00034182155,0.0026664594,0.3299681,0.56911296,0.0921535,0.0006574547],"about_ca_topic_score_codex":7.8582775e-7,"about_ca_topic_score_gemma":3.8391744e-7,"teacher_disagreement_score":0.2884738,"about_ca_system_score_codex":0.000020588124,"about_ca_system_score_gemma":0.0001872535,"threshold_uncertainty_score":0.57570654},"labels":[],"label_agreement":null},{"id":"W2546825596","doi":"10.1109/mwc.2016.7721746","title":"Tensor-based software-defined internet of things","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Tensor (intrinsic definition); Distributed computing; Key (lock); Computer network; Wireless; Software; Telecommunications; Computer security","score_opus":0.06551914334016713,"score_gpt":0.32269860487666224,"score_spread":0.2571794615364951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546825596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33100414,0.00007370307,0.6492157,0.012851014,0.00010952406,0.0005726399,0.000108148524,0.00071899063,0.005346139],"genre_scores_gemma":[0.874856,0.000035235844,0.12371558,0.00026950665,0.000011731548,0.00013365658,0.00001388419,0.000030022677,0.000934367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891394,0.00011852205,0.00046462193,0.00017163063,0.00016899024,0.0001622666],"domain_scores_gemma":[0.9955195,0.0016712602,0.00027964314,0.0022083223,0.0002476187,0.00007365572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018510911,0.00013568037,0.00023834083,0.00011023058,0.00012533726,0.000017324046,0.0011295531,0.000081801016,0.00013466271],"category_scores_gemma":[0.00016217759,0.000102339756,0.00012604284,0.00021118506,0.00030488483,0.00012298494,0.000114140224,0.00012617723,0.00013223555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033265696,0.0013590672,0.0031819881,0.000079744015,0.00010519567,7.298825e-7,0.0008352259,0.0000034725902,0.0986582,0.8546156,0.014560413,0.026567047],"study_design_scores_gemma":[0.007451473,0.00033606333,0.009679063,0.0022763584,0.00048329536,0.000047790967,0.0004500721,0.014652013,0.31022763,0.57443196,0.07781835,0.0021459616],"about_ca_topic_score_codex":0.000034182507,"about_ca_topic_score_gemma":0.000017087044,"teacher_disagreement_score":0.54385185,"about_ca_system_score_codex":0.000048466227,"about_ca_system_score_gemma":0.000051742358,"threshold_uncertainty_score":0.4173294},"labels":[],"label_agreement":null},{"id":"W2550773760","doi":"10.1016/j.jmp.2016.10.006","title":"The memory tesseract: Mathematical equivalence between composite and separate storage memory models","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Psychology","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unification; Computer science; Memory model; Equivalence (formal languages); Storage model; Auxiliary memory; Tensor (intrinsic definition); Computer data storage; Theoretical computer science; Computational model; Artificial intelligence; Mathematics; Parallel computing; Shared memory; Pure mathematics; Programming language","score_opus":0.09840809197825819,"score_gpt":0.40343103365132565,"score_spread":0.3050229416730675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550773760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5415461,0.000310536,0.41984928,0.020506501,0.00016825167,0.00046644968,0.000022551903,0.00007843303,0.017051902],"genre_scores_gemma":[0.9559278,0.00018534616,0.041180454,0.0004896002,0.0003255782,0.000027971844,5.654202e-7,0.000059470476,0.0018032312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997327,0.00025728074,0.0013034628,0.00025426815,0.00045968156,0.0003983037],"domain_scores_gemma":[0.99284583,0.0052465172,0.00074982515,0.0006029072,0.00025216374,0.0003027269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016877505,0.00025783342,0.0006876765,0.000114376875,0.00024332742,0.000072260664,0.00059577305,0.00017203449,0.0002736369],"category_scores_gemma":[0.00044108508,0.00013221934,0.00019970002,0.0001359705,0.00051963824,0.00027978452,0.00010829556,0.00039641742,0.00019115001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000257778,0.00116578,0.00010089633,0.0003323438,0.00045873484,0.00009002296,0.0012312133,0.000009929279,0.02843306,0.9218041,0.026337521,0.019778676],"study_design_scores_gemma":[0.0010662497,0.0001469279,0.000405086,0.00023941681,0.00014113536,0.0009683328,0.000104589206,0.00029063312,0.0006871999,0.99523646,0.0005256799,0.00018831967],"about_ca_topic_score_codex":1.448065e-7,"about_ca_topic_score_gemma":2.4396786e-7,"teacher_disagreement_score":0.41438168,"about_ca_system_score_codex":0.000044921337,"about_ca_system_score_gemma":0.00003283103,"threshold_uncertainty_score":0.53917485},"labels":[],"label_agreement":null},{"id":"W2551156993","doi":"","title":"Supervised Learning with Tensor Networks","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":214,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"MNIST database; Tensor (intrinsic definition); Artificial intelligence; Computer science; Machine learning; Tensor product; Set (abstract data type); Kernel (algebra); Moment tensor; Interpretation (philosophy); Matrix (chemical analysis); Supervised learning; Mathematics; Algorithm; Deep learning; Artificial neural network; Pure mathematics; Physics","score_opus":0.029951562186194405,"score_gpt":0.2749004509657065,"score_spread":0.24494888877951207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551156993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31889805,0.000084434025,0.6677238,0.0020928504,0.0002263445,0.00093741843,0.000011672024,0.0014630485,0.008562432],"genre_scores_gemma":[0.99711806,0.0000033503645,0.0014946389,0.00015222048,0.00009295138,0.00010602584,0.000013378229,0.000016030315,0.0010033419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990035,0.000042160627,0.0004173829,0.00010407771,0.00022960013,0.00020326015],"domain_scores_gemma":[0.9990889,0.00011022542,0.00029193592,0.00015660988,0.000277405,0.00007492276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015517164,0.00013332893,0.00016109305,0.00008415165,0.00026832512,0.00024437156,0.000121088604,0.000065602006,0.000027729076],"category_scores_gemma":[0.000053517677,0.00007586898,0.00003067468,0.00020926872,0.000040306546,0.0013618196,0.000015474257,0.000112478105,0.0000817624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005784621,0.0003874547,0.01985731,0.003375005,0.0002052212,0.000013508361,0.009406214,0.03855144,0.008542766,0.2038516,0.03488109,0.68034995],"study_design_scores_gemma":[0.0048838714,0.00037865908,0.0033461447,0.0019012664,0.00011136593,0.0006051345,0.0034894734,0.88139266,0.0009205582,0.0017629388,0.09984813,0.001359819],"about_ca_topic_score_codex":0.000004396355,"about_ca_topic_score_gemma":7.8137305e-7,"teacher_disagreement_score":0.8428412,"about_ca_system_score_codex":0.0000399409,"about_ca_system_score_gemma":0.00002321743,"threshold_uncertainty_score":0.30938473},"labels":[],"label_agreement":null},{"id":"W2563669235","doi":"10.1016/j.nuclphysb.2017.01.015","title":"The complete 1/N expansion of a SYK–like tensor model","year":2017,"lang":"en","type":"article","venue":"Nuclear Physics B","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":162,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Tensor (intrinsic definition); Point (geometry); Order (exchange); Function (biology); Mathematics; Series (stratigraphy); Third order; Series expansion; Term (time); Pure mathematics; Mathematical analysis; Physics; Geometry; Quantum mechanics","score_opus":0.09733683784065719,"score_gpt":0.3323194751487582,"score_spread":0.234982637308101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563669235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9162561,0.000016063934,0.020137284,0.0042858873,0.0001695965,0.000660641,0.00013346128,0.00024089895,0.058100056],"genre_scores_gemma":[0.9894441,0.000010050847,0.009777341,0.00011867733,0.00005731058,0.00000835617,0.0000020145392,0.000026857571,0.0005553191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946415,0.000013949676,0.00014808732,0.00011195558,0.00014940136,0.00011246913],"domain_scores_gemma":[0.99872446,0.000084028856,0.00020098707,0.0008641311,0.000091180926,0.000035221346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007221166,0.000075443255,0.00012390653,0.000006841816,0.00072325475,0.00006921052,0.000382986,0.00002839492,0.000013551494],"category_scores_gemma":[0.00002642397,0.000054991957,0.00008600157,0.000021748081,0.00014159255,0.00007250208,0.000092172675,0.00008776405,0.00010231713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011439195,0.00008253209,0.000011274698,0.000015356663,0.000017791564,2.5109017e-7,0.0003066782,0.000053488828,0.027688207,0.9575034,0.011064443,0.003245137],"study_design_scores_gemma":[0.00043538457,0.00002679712,0.0009012308,0.000036595997,0.00004106611,0.0000022398617,0.00015154268,0.17721236,0.0012839413,0.8074093,0.012335636,0.00016394883],"about_ca_topic_score_codex":0.000007214821,"about_ca_topic_score_gemma":0.0000016866137,"teacher_disagreement_score":0.17715888,"about_ca_system_score_codex":0.000009676922,"about_ca_system_score_gemma":0.000010609138,"threshold_uncertainty_score":0.5562764},"labels":[],"label_agreement":null},{"id":"W2564479228","doi":"10.1145/2983640","title":"A Tensor-Based Framework for Software-Defined Cloud Data Center","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cloud computing; Computer science; Tensor (intrinsic definition); Big data; Data center; Software; Distributed computing; Data mining; Theoretical computer science; Computer network; Mathematics","score_opus":0.10639891469318016,"score_gpt":0.3729609067405157,"score_spread":0.26656199204733555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564479228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008074191,0.000067233814,0.97711533,0.017994853,0.00007933087,0.0016355437,0.0016226792,0.0005942791,0.0000833317],"genre_scores_gemma":[0.21553478,0.00014672901,0.78216213,0.00049110857,0.00012293574,0.0011213832,0.00025964485,0.00006008976,0.00010118571],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805534,0.00011483502,0.0006131423,0.0006691374,0.00019383978,0.00035369355],"domain_scores_gemma":[0.98184747,0.010975659,0.00025897432,0.0064570257,0.000258519,0.0002023364],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00037729365,0.0002895161,0.0003122467,0.0001892012,0.0013505014,0.000086378226,0.0023121,0.00017183617,0.000056476994],"category_scores_gemma":[0.00045637586,0.00024016766,0.0001342072,0.00039722995,0.0003748954,0.00013283237,0.00014713476,0.00030569715,0.00007251058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006022911,0.0029145165,0.00044972252,0.00009272725,0.00019098466,2.1509749e-7,0.00024818358,0.000042360974,0.0010856584,0.18295792,0.0024926018,0.8094649],"study_design_scores_gemma":[0.0056897886,0.00022685842,0.0009663321,0.00069629424,0.0005184885,0.000031645097,0.0003221469,0.05987673,0.0010751772,0.5731882,0.35594282,0.0014655541],"about_ca_topic_score_codex":0.000009775392,"about_ca_topic_score_gemma":0.000022296075,"teacher_disagreement_score":0.8079993,"about_ca_system_score_codex":0.00006349315,"about_ca_system_score_gemma":0.00007264978,"threshold_uncertainty_score":0.99994963},"labels":[],"label_agreement":null},{"id":"W2573911918","doi":"10.1098/rspa.2017.0480","title":"Quantum algorithm for multivariate polynomial interpolation","year":2018,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation of Sri Lanka; Canadian Institute for Advanced Research; U.S. Department of Defense","keywords":"Conjecture; Polynomial; Order (exchange); Mathematics; Field (mathematics); Univariate; Combinatorics; Discrete mathematics; Multivariate statistics; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.023206416601953748,"score_gpt":0.2882376747083941,"score_spread":0.26503125810644035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573911918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8397615,0.000005235326,0.15835412,0.0006911571,0.00006831198,0.0003503906,0.000011790996,0.000093205344,0.0006642693],"genre_scores_gemma":[0.8316415,2.5057395e-7,0.16803502,0.000022052222,0.00019300233,0.00003065891,1.3541975e-7,0.000007593719,0.00006979587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993665,0.0000014868808,0.00016166289,0.00015693008,0.00015668417,0.00015671963],"domain_scores_gemma":[0.99951893,0.00022615225,0.00008068845,0.000043615903,0.00008471844,0.000045869165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021055479,0.000096163305,0.00016036474,0.000011411448,0.00021385853,0.00004952827,0.00019542713,0.00003487493,0.0000048777056],"category_scores_gemma":[0.0001294898,0.00006015827,0.00014402885,0.00015046984,0.0003337164,0.00008028716,0.00007785985,0.00006747296,0.0000018106728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005466325,0.00025296997,0.000020439633,0.00029863324,0.000043633867,5.499035e-9,0.00301732,0.000013404576,0.03428003,0.9579458,0.0027283593,0.0013939061],"study_design_scores_gemma":[0.0001147439,0.000059882994,0.00014857098,0.000058189715,0.00002281944,7.170528e-7,0.00015486177,0.78163415,0.004060657,0.21361439,0.000059354526,0.000071669536],"about_ca_topic_score_codex":0.0000019978318,"about_ca_topic_score_gemma":2.5316224e-8,"teacher_disagreement_score":0.78162074,"about_ca_system_score_codex":0.000009586859,"about_ca_system_score_gemma":0.0000062869676,"threshold_uncertainty_score":0.2453183},"labels":[],"label_agreement":null},{"id":"W2577122409","doi":"10.1609/aaai.v30i1.10214","title":"Common and Discriminative Subspace Kernel-Based Multiblock Tensor Partial Least Squares Regression","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Discriminative model; Multilinear map; Tensor (intrinsic definition); Kernel (algebra); Pattern recognition (psychology); Artificial intelligence; Mathematics; Computer science; Linear subspace; Subspace topology; Discrete mathematics","score_opus":0.13102826435870088,"score_gpt":0.3652290948497541,"score_spread":0.2342008304910532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577122409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775901,0.000010535686,0.0049123373,0.0143756885,0.000092160735,0.0005816255,0.000038512575,0.00010088501,0.0022981707],"genre_scores_gemma":[0.9979038,0.00001532763,0.0014160214,0.00009056591,0.000046451583,0.000058866906,6.2126884e-7,0.000019257805,0.0004490876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986349,0.000027051414,0.00042333503,0.00035961406,0.00031623343,0.0002389186],"domain_scores_gemma":[0.99846756,0.00036256647,0.00039234644,0.00022153324,0.0004553413,0.000100673955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022574012,0.00021682975,0.00027085756,0.00008275903,0.00023378595,0.000075750424,0.00043365,0.000085259795,0.00011943726],"category_scores_gemma":[0.00051759614,0.00011832013,0.00009151225,0.00020049221,0.00051115954,0.0001350016,0.00011152266,0.00015985883,0.000042328124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020536486,0.00032017147,0.0012868651,0.00006367483,0.0000125728875,3.165784e-7,0.00090858317,0.0000016164345,0.18658437,0.78333503,0.00051972247,0.026761688],"study_design_scores_gemma":[0.000086671826,0.00012871038,0.0009785038,0.000675075,0.00003322972,0.0000027564693,0.0010641874,0.0036869461,0.7629997,0.23004876,0.00010333298,0.00019210255],"about_ca_topic_score_codex":0.000019102585,"about_ca_topic_score_gemma":0.000020080486,"teacher_disagreement_score":0.57641536,"about_ca_system_score_codex":0.000034151482,"about_ca_system_score_gemma":0.000029787041,"threshold_uncertainty_score":0.4824955},"labels":[],"label_agreement":null},{"id":"W2589197426","doi":"10.1007/s00211-017-0869-7","title":"Newton–Noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor","year":2017,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Tensor (intrinsic definition); Numerical analysis; Newton's method; Applied mathematics; Mathematical analysis; Pure mathematics; Nonlinear system","score_opus":0.13041365272414635,"score_gpt":0.3979500100665251,"score_spread":0.26753635734237874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589197426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.827417,0.00009516125,0.115059644,0.022703944,0.00036472594,0.0037187452,0.0002514689,0.00029340308,0.03009592],"genre_scores_gemma":[0.9344178,0.000003868738,0.060168765,0.000101744394,0.00016523073,0.0005128828,0.000016039374,0.000047681846,0.004566029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879295,0.000037874117,0.00045770573,0.0002674359,0.00022177318,0.00022225095],"domain_scores_gemma":[0.99737,0.00054331624,0.00074911525,0.0010762073,0.0002140194,0.000047312533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047091857,0.00019320463,0.00032891994,0.000059544127,0.0008931656,0.00019900582,0.0005005113,0.00008757285,0.00019258351],"category_scores_gemma":[0.00070936495,0.00013508384,0.00020423505,0.000075777396,0.00014285737,0.00028161795,0.00007902073,0.00013298549,0.000067214016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007018503,0.000596286,0.00034667473,0.0005508625,0.00017343684,9.146328e-7,0.010206741,0.000016939899,0.04740307,0.87017274,0.06731982,0.0031423455],"study_design_scores_gemma":[0.0021134182,0.00021283593,0.0047269245,0.00063093245,0.00037807148,0.00005320036,0.005830889,0.018852495,0.12295297,0.8061351,0.037284102,0.0008290406],"about_ca_topic_score_codex":0.000017334645,"about_ca_topic_score_gemma":0.000009481629,"teacher_disagreement_score":0.10700076,"about_ca_system_score_codex":0.000027069842,"about_ca_system_score_gemma":0.00003378456,"threshold_uncertainty_score":0.6869598},"labels":[],"label_agreement":null},{"id":"W2597184788","doi":"10.1080/03081087.2017.1301873","title":"Corrigendum to ‘Rank classification of tensors over ’","year":2017,"lang":"en","type":"erratum","venue":"Linear and Multilinear Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Rank (graph theory); Product (mathematics); Action (physics); Direct product; Pure mathematics; Group (periodic table); Group action; Combinatorics; Algebra over a field; Geometry; Physics; Quantum mechanics","score_opus":0.0800506802927653,"score_gpt":0.3639882757321359,"score_spread":0.2839375954393706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597184788","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37939274,0.004649587,0.03991608,0.01605483,0.10065921,0.020414934,0.014331993,0.0034822067,0.4210984],"genre_scores_gemma":[0.046773337,0.00066476077,0.04239303,0.0006360323,0.0038601535,0.00022863301,0.0014046353,0.00031158584,0.9037278],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99819976,0.00004702138,0.0006077686,0.0005380376,0.00033472004,0.00027270542],"domain_scores_gemma":[0.99775636,0.000095126365,0.00051499327,0.0011228239,0.00028485636,0.00022586397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019629986,0.00035489074,0.0006451017,0.0001937075,0.00022638428,0.00005953438,0.00041314142,0.0005097351,0.0002486291],"category_scores_gemma":[0.00038713138,0.0003251451,0.00019752515,0.00011006155,0.00014574063,0.00007057054,0.00012747952,0.0005427651,0.0001518534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039966857,0.00021385489,0.00010560662,0.00030787967,0.00008590909,0.0000031449833,0.0003449369,6.858853e-7,0.0013867184,0.00955884,0.98425454,0.0036979397],"study_design_scores_gemma":[0.0006702911,0.000082368795,0.007844013,0.00027735552,0.00020831278,0.000010071736,0.00008492176,0.008948692,0.0006744714,0.0034618736,0.9772234,0.00051421695],"about_ca_topic_score_codex":0.00006141175,"about_ca_topic_score_gemma":0.000053373475,"teacher_disagreement_score":0.48262942,"about_ca_system_score_codex":0.000028328388,"about_ca_system_score_gemma":0.00009108929,"threshold_uncertainty_score":0.99992007},"labels":[],"label_agreement":null},{"id":"W2604930203","doi":"10.1016/j.inffus.2017.04.002","title":"High-order possibilistic c-means algorithms based on tensor decompositions for big data in IoT","year":2017,"lang":"en","type":"article","venue":"Information Fusion","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Big data; Computer science; Cluster analysis; Internet of Things; Tensor (intrinsic definition); Data mining; Algorithm; Artificial intelligence; Mathematics","score_opus":0.09565623818988435,"score_gpt":0.3603582001379818,"score_spread":0.2647019619480975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604930203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15486974,0.0000051188017,0.8146372,0.011726214,0.0013580925,0.00319612,0.003645364,0.00040910684,0.010153048],"genre_scores_gemma":[0.80681735,0.0000054633388,0.18803737,0.0013753833,0.00029166337,0.00029601486,0.0028929913,0.000028835291,0.00025493576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987485,0.000026404587,0.0005504742,0.00020971955,0.00025572765,0.00020919203],"domain_scores_gemma":[0.9972913,0.00036985325,0.00037338433,0.0016447124,0.00023942666,0.00008129016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036976716,0.00016062622,0.00019411108,0.00024043968,0.0007372152,0.00026151427,0.0006425002,0.00010690161,0.00007600189],"category_scores_gemma":[0.0006738974,0.00014720729,0.000051995077,0.00012348431,0.00005363634,0.00052403467,0.00012550176,0.00013722504,0.00017227995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009358511,0.0048284,0.0028036155,0.001192717,0.0001177053,0.000012196061,0.0028652959,0.015619049,0.005195158,0.31784686,0.11582017,0.532763],"study_design_scores_gemma":[0.0055890814,0.00020732499,0.036610335,0.0003197881,0.000076576944,0.000009156365,0.00021347906,0.8621891,0.00093248906,0.04221968,0.050990645,0.0006423124],"about_ca_topic_score_codex":0.00007250802,"about_ca_topic_score_gemma":0.00010266231,"teacher_disagreement_score":0.8465701,"about_ca_system_score_codex":0.00007202463,"about_ca_system_score_gemma":0.00006446871,"threshold_uncertainty_score":0.6002939},"labels":[],"label_agreement":null},{"id":"W2608366086","doi":"10.1090/crmp/041/04","title":"Sparse tensor-product Fokker–Planck-based methods for nonlinear bead-spring chain models of dilute polymer solutions","year":2007,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Spring (device); Chain (unit); Fokker–Planck equation; Nonlinear system; Product (mathematics); Bead; Statistical physics; Polymer; Tensor (intrinsic definition); Physics; Materials science; Mathematics; Thermodynamics; Mathematical analysis; Geometry; Quantum mechanics; Composite material","score_opus":0.13490132966230475,"score_gpt":0.37034759681369606,"score_spread":0.2354462671513913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608366086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003731521,0.001835198,0.9283843,0.0019612222,0.00021926902,0.00207094,0.00044886456,0.0004843105,0.064222746],"genre_scores_gemma":[0.14258093,0.00009591479,0.8480591,0.001201398,0.002617808,0.00051465206,0.00035874973,0.0007355515,0.0038358574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971472,0.000010381601,0.0009512838,0.00088401313,0.00037442584,0.0006326681],"domain_scores_gemma":[0.9965058,0.0009227796,0.0008867729,0.000495084,0.000999563,0.00019003215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078878604,0.0007183713,0.0010273792,0.0005082452,0.00035816376,0.00006980961,0.00044907315,0.00065530743,0.00007303759],"category_scores_gemma":[0.0004608986,0.00068697234,0.0005783775,0.00016891512,0.00021005215,0.00011851848,0.00009306182,0.0007183822,0.0000117980935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000815266,0.0001084634,0.000007723384,0.0006455173,0.00018560735,7.53912e-7,0.00027344885,0.00007317347,0.016431091,0.9728205,0.0002314741,0.009140686],"study_design_scores_gemma":[0.00058711774,0.000099119796,0.000005010137,0.0005106514,0.00064725615,0.000020850972,0.000013396261,0.011221481,0.08981715,0.8825308,0.01375009,0.0007970926],"about_ca_topic_score_codex":0.000014386388,"about_ca_topic_score_gemma":0.0000130128965,"teacher_disagreement_score":0.14220777,"about_ca_system_score_codex":0.000118235796,"about_ca_system_score_gemma":0.00013340103,"threshold_uncertainty_score":0.99955815},"labels":[],"label_agreement":null},{"id":"W2619090350","doi":"10.1063/1.4983695","title":"An intertwined method for making low-rank, sum-of-product basis functions that makes it possible to compute vibrational spectra of molecules with more than 10 atoms","year":2017,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Institutes of Health; Natural Sciences and Engineering Research Council of Canada; Wellcome Trust; Wellcome","keywords":"Basis (linear algebra); Rank (graph theory); Matrix (chemical analysis); Basis function; Product (mathematics); Spectral line; Sequence (biology); Computational chemistry; Mathematics; Chemistry; Physics; Mathematical analysis; Combinatorics; Quantum mechanics; Geometry","score_opus":0.05775930115895453,"score_gpt":0.36558147467995694,"score_spread":0.3078221735210024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619090350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.413505,0.0000057833727,0.5832472,0.0028063478,0.000027302882,0.00016814643,0.000043820448,0.000008746989,0.00018768387],"genre_scores_gemma":[0.75097865,0.0000010700135,0.24865277,0.000093217815,0.00021775898,0.0000052218406,0.000006145154,0.000017913611,0.000027233684],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909925,0.00003827535,0.0003553016,0.00011229105,0.0002745511,0.00012029947],"domain_scores_gemma":[0.99804825,0.00034161966,0.0006904295,0.00047695378,0.00037596305,0.00006677578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026847358,0.00012793219,0.00031634353,0.000036956237,0.00013373273,0.000045915393,0.0004978332,0.000030353245,0.000023068396],"category_scores_gemma":[0.000061953215,0.00008389414,0.00015619006,0.00008602117,0.000118604294,0.00017935311,0.000043759563,0.00013982541,0.0000012498647],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082382734,0.0006911472,0.00016692208,0.00014227699,0.00031502257,7.4850965e-7,0.0012977433,0.00084507436,0.967034,0.0227375,0.0034797455,0.0024660353],"study_design_scores_gemma":[0.0005644874,0.00015993205,0.0005996667,0.00021052588,0.00022658591,0.000024505274,0.00024194932,0.0045646112,0.9331534,0.060068604,0.00006368957,0.00012206006],"about_ca_topic_score_codex":0.0000026703954,"about_ca_topic_score_gemma":0.0000016059706,"teacher_disagreement_score":0.33747366,"about_ca_system_score_codex":0.00002176019,"about_ca_system_score_gemma":0.000047942034,"threshold_uncertainty_score":0.3421104},"labels":[],"label_agreement":null},{"id":"W2740868391","doi":"10.24963/ijcai.2017/257","title":"Fast Recursive Low-rank Tensor Learning for Regression","year":2017,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Tensor (intrinsic definition); Computer science; Rank (graph theory); Regression; Predictability; Set (abstract data type); Scale (ratio); Algorithm; Artificial intelligence; Data mining; Machine learning; Theoretical computer science; Mathematics; Statistics","score_opus":0.06138969775447265,"score_gpt":0.375715730530891,"score_spread":0.31432603277641835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740868391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47378147,0.000030703137,0.31179667,0.018743519,0.00039995415,0.0021007105,0.000041186348,0.0007843486,0.19232145],"genre_scores_gemma":[0.86118084,0.000011460106,0.085912645,0.00017567346,0.00018119178,0.0001591709,0.000017915767,0.000033010903,0.052328072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994606,0.0000140926895,0.00014074713,0.00016399295,0.000083240724,0.00013732699],"domain_scores_gemma":[0.99904764,0.00018442985,0.00017803647,0.00041494373,0.000117789205,0.00005714549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099406425,0.00008484246,0.00012626819,0.000025840964,0.0007827638,0.000093287854,0.00020111943,0.00005576233,0.00021917393],"category_scores_gemma":[0.00037207542,0.000063959946,0.00008054113,0.000016659807,0.00004228934,0.00008803061,0.000039205086,0.00009219742,0.00011793381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008043062,0.00028899766,0.0010375463,0.00012663532,0.000048553964,0.0000030993508,0.0007089206,0.000014521497,0.014944815,0.83620304,0.121187285,0.025356164],"study_design_scores_gemma":[0.004006337,0.00024903024,0.010508635,0.00056939945,0.00014978531,0.00003557563,0.0019429517,0.006979491,0.05477548,0.7394412,0.18041368,0.0009284063],"about_ca_topic_score_codex":0.0000038939556,"about_ca_topic_score_gemma":0.000005187272,"teacher_disagreement_score":0.38739938,"about_ca_system_score_codex":0.0000142615745,"about_ca_system_score_gemma":0.000008603981,"threshold_uncertainty_score":0.60204655},"labels":[],"label_agreement":null},{"id":"W2744816398","doi":"10.1145/3063593","title":"A Tucker Deep Computation Model for Mobile Multimedia Feature Learning","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computation; Speedup; Computer science; Tucker decomposition; Deep learning; Artificial intelligence; Feature (linguistics); Server; Machine learning; Parallel computing; Algorithm; Tensor (intrinsic definition); Tensor decomposition; Mathematics; Computer network","score_opus":0.06013025682110174,"score_gpt":0.37236190494088983,"score_spread":0.3122316481197881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744816398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003943297,0.0001215321,0.98889726,0.0035574308,0.000055949426,0.0024453725,0.00013752878,0.0004441672,0.00039747098],"genre_scores_gemma":[0.5039634,0.0001758596,0.49308416,0.00008969568,0.000061761035,0.0020281689,0.00013911363,0.000048149228,0.00040965475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982547,0.00009178994,0.0005132157,0.00056931743,0.00021263532,0.00035829557],"domain_scores_gemma":[0.9934946,0.002409018,0.0004989251,0.0029974012,0.00038059815,0.00021950061],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00037338788,0.0003295415,0.0003638909,0.00018934702,0.005633045,0.0003215943,0.0015188941,0.00020737463,0.000013042247],"category_scores_gemma":[0.00018288378,0.0003521129,0.00019934909,0.00017453828,0.00044884795,0.00027359236,0.00012672828,0.00066449423,0.000035311186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039552073,0.0016099386,0.00018811012,0.00011075041,0.00018488035,2.752886e-7,0.002855876,0.019630615,0.0016723447,0.015191193,0.0005569882,0.9579595],"study_design_scores_gemma":[0.0011129576,0.000057764348,0.00038868966,0.00005223713,0.00014588864,0.00000939162,0.0003371814,0.96441764,0.00015128436,0.024913115,0.00804595,0.0003679016],"about_ca_topic_score_codex":0.000019853598,"about_ca_topic_score_gemma":0.000075131466,"teacher_disagreement_score":0.9575916,"about_ca_system_score_codex":0.000072506526,"about_ca_system_score_gemma":0.00005528961,"threshold_uncertainty_score":0.99989307},"labels":[],"label_agreement":null},{"id":"W2746512809","doi":"10.1190/segam2017-17783114.1","title":"Incoherent noise attenuation via randomized CP decomposition","year":2017,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Noise (video); Computer science; Rank (graph theory); Tensor (intrinsic definition); Algorithm; Decomposition; Tensor decomposition; Matrix decomposition; Theoretical computer science; Physics; Mathematics; Artificial intelligence; Combinatorics; Geometry","score_opus":0.04382938397629275,"score_gpt":0.3699521270238548,"score_spread":0.32612274304756206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746512809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27394858,0.000010631209,0.6397089,0.006945904,0.00020691335,0.0013733273,0.000009503931,0.00032452177,0.07747172],"genre_scores_gemma":[0.9622232,0.0000069240214,0.035543934,0.00020305239,0.00009681325,0.00020854267,0.000026412305,0.000015632979,0.0016755147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991561,0.00007281977,0.0003113774,0.00017598383,0.00016177665,0.00012193051],"domain_scores_gemma":[0.99867773,0.00024621666,0.00028171076,0.00061710936,0.000106540865,0.000070689326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034388213,0.000112175934,0.00027104266,0.00004514653,0.00051187666,0.00015046757,0.00022123069,0.000057919653,0.00063873804],"category_scores_gemma":[0.00013261303,0.000091208116,0.0001412409,0.000025118426,0.00008861005,0.00018043294,0.00005167832,0.00007357922,0.00040338156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032622872,0.000672324,0.00042641954,0.00005006666,0.00013807863,0.0000032841033,0.0002952487,0.000010629214,0.040004212,0.9205108,0.020420685,0.014205938],"study_design_scores_gemma":[0.09048671,0.000029898689,0.005324589,0.000058393154,0.00021447381,0.000025108533,0.000043929063,0.01188946,0.021682026,0.8676304,0.002160946,0.0004540301],"about_ca_topic_score_codex":0.00004532021,"about_ca_topic_score_gemma":0.000032016604,"teacher_disagreement_score":0.68827456,"about_ca_system_score_codex":0.000035067293,"about_ca_system_score_gemma":0.000009655013,"threshold_uncertainty_score":0.69937336},"labels":[],"label_agreement":null},{"id":"W2746990344","doi":"10.1190/segam2017-17782228.1","title":"5D seismic reconstruction via parallel matrix factorization with randomized QR decomposition","year":2017,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Matrix decomposition; QR decomposition; Factorization; Computer science; Rank (graph theory); Algorithm; Tensor (intrinsic definition); Matrix (chemical analysis); Tensor decomposition; Mathematics; Combinatorics; Physics; Chemistry","score_opus":0.029903866577705874,"score_gpt":0.3311684247697618,"score_spread":0.30126455819205594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746990344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1411913,0.0000051070983,0.8468785,0.001406247,0.00012851614,0.0007593778,0.0000075567978,0.00024686297,0.00937648],"genre_scores_gemma":[0.87793195,0.000016889422,0.12007635,0.000068625355,0.000088434484,0.00012939861,0.00003990189,0.000023676159,0.0016247884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989976,0.000079249745,0.0003475418,0.00024613948,0.00017212104,0.00015733024],"domain_scores_gemma":[0.9986024,0.0001869815,0.0004287117,0.0005620452,0.00014102264,0.0000788332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021635923,0.00016449943,0.00034703992,0.00007385772,0.00062491675,0.00020774039,0.00018447159,0.00008997696,0.00035421527],"category_scores_gemma":[0.000058630074,0.00012453999,0.00010804193,0.000049888877,0.00013766295,0.0003739242,0.000025590944,0.00010373629,0.00012203631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015727691,0.0006797216,0.0025993693,0.00016251422,0.0005224251,0.000008985955,0.0006593016,0.00060413056,0.017376492,0.9328983,0.0044969954,0.02426409],"study_design_scores_gemma":[0.11734207,0.00010144185,0.002894752,0.00014240245,0.00042645843,0.0004246012,0.00015924228,0.080053076,0.008660084,0.787891,0.0010488783,0.000856031],"about_ca_topic_score_codex":0.000052553027,"about_ca_topic_score_gemma":0.000025581561,"teacher_disagreement_score":0.73674065,"about_ca_system_score_codex":0.00004833298,"about_ca_system_score_gemma":0.00001968602,"threshold_uncertainty_score":0.50785935},"labels":[],"label_agreement":null},{"id":"W2759845240","doi":"10.1137/16m1084717","title":"Discrete Fourier Transform Tensors and Their Ranks","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Rank (graph theory); Tensor (intrinsic definition); Discrete Fourier transform (general); Dimension (graph theory); Generalization; Tensor contraction; Tensor field; Tensor product; Symmetric tensor; Pure mathematics; Tensor density; Mathematical analysis; Fourier transform; Combinatorics; Fourier analysis; Exact solutions in general relativity; Fractional Fourier transform","score_opus":0.023471862087207213,"score_gpt":0.34247139287467526,"score_spread":0.31899953078746807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759845240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.292552,0.0006684331,0.66237277,0.025766013,0.00004053365,0.0011115026,0.00028631566,0.0001407217,0.017061725],"genre_scores_gemma":[0.98906237,0.0008371786,0.008072356,0.00012528499,0.00019642919,0.00010173154,0.000011570435,0.000020724627,0.0015723404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897724,0.0000339698,0.00038103198,0.0002572234,0.00016294743,0.00018757215],"domain_scores_gemma":[0.9985343,0.00017114118,0.0003526005,0.00061093026,0.000099537094,0.00023148487],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00034374092,0.00018252275,0.00036098028,0.00022137597,0.0018012812,0.0004897289,0.0002699101,0.00007439448,0.00012589115],"category_scores_gemma":[0.00002903598,0.00012765756,0.00027063987,0.00020338345,0.00015424826,0.00015304085,0.000032734544,0.00027278275,0.000015316378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071353184,0.0004946745,0.005184141,0.000073988136,0.0027574268,0.0000067969586,0.0008038488,0.000110484674,0.0017435256,0.8453682,0.0027060516,0.1406795],"study_design_scores_gemma":[0.0018848734,0.00012270622,0.03418575,0.00005827173,0.0032507062,0.00021658829,0.0009950834,0.009621623,0.000836645,0.7890844,0.15893656,0.00080682634],"about_ca_topic_score_codex":0.000006536867,"about_ca_topic_score_gemma":0.000021061822,"teacher_disagreement_score":0.6965104,"about_ca_system_score_codex":0.000017565691,"about_ca_system_score_gemma":0.0000135920145,"threshold_uncertainty_score":0.99949825},"labels":[],"label_agreement":null},{"id":"W2768480272","doi":"10.1002/cpa.21861","title":"The Landscape of the Spiked Tensor Model","year":2019,"lang":"en","type":"preprint","venue":"Communications on Pure and Applied Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Lambda; Mathematics; Combinatorics; Unit vector; Maxima; Rank (graph theory); Polynomial; Estimator; Exponential function; Tensor (intrinsic definition); Degree (music); Mathematical analysis; Physics; Geometry; Statistics; Quantum mechanics","score_opus":0.06979842427746022,"score_gpt":0.3231111371011944,"score_spread":0.25331271282373413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768480272","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30577755,0.0032115406,0.07962065,0.06809567,0.0006244823,0.018254954,0.0015471159,0.0009859625,0.52188206],"genre_scores_gemma":[0.8672725,0.0011198694,0.12821428,0.0003135012,0.00003621222,0.0007226824,0.000047399066,0.00008010326,0.0021934733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985093,0.000052060743,0.0006812312,0.0002581725,0.0003090352,0.00019020314],"domain_scores_gemma":[0.9915474,0.0015249139,0.00073767104,0.0059870356,0.00015066165,0.000052323874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004232809,0.0002925049,0.00045000704,0.00005727633,0.00060382637,0.00010744854,0.0023849711,0.00024574436,0.000008611502],"category_scores_gemma":[0.0001109659,0.0001702335,0.00019006507,0.0001593405,0.00036245692,0.00001589577,0.0018050341,0.00084079104,0.00002703456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000547583,0.000317832,0.0000087233775,0.00026640325,0.00006735634,1.6542716e-8,0.0006970285,0.00054681784,0.000247707,0.9887528,0.008423074,0.0006667749],"study_design_scores_gemma":[0.00028074445,0.0000126187915,0.000057145255,0.0002647164,0.0002107795,0.000003535737,0.0007042457,0.0578663,0.0005039715,0.93697876,0.002865903,0.00025130436],"about_ca_topic_score_codex":7.591649e-7,"about_ca_topic_score_gemma":0.000009682136,"teacher_disagreement_score":0.56149495,"about_ca_system_score_codex":0.000025226938,"about_ca_system_score_gemma":0.00009380668,"threshold_uncertainty_score":0.69419205},"labels":[],"label_agreement":null},{"id":"W2785761199","doi":"10.48550/arxiv.1802.04868","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":395,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Simple (philosophy); Embedding; Computer science; Theoretical computer science; Link (geometry); Factorization; Graph embedding; Tying; Artificial intelligence; Algorithm","score_opus":0.13757808140572042,"score_gpt":0.28085417601112767,"score_spread":0.14327609460540724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785761199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.807194,0.000029285744,0.18473731,0.00007755363,0.000354826,0.0011930445,0.00031091145,0.0003588774,0.0057441667],"genre_scores_gemma":[0.9951166,0.000037287475,0.002563295,0.000021571554,0.00018837341,0.000016299966,0.00014340988,0.0000338228,0.0018793759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883336,0.00005736435,0.00025127485,0.00058868557,0.000036216534,0.00023309117],"domain_scores_gemma":[0.9987154,0.00025803832,0.00019093616,0.0005578882,0.00018750473,0.00009023834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020819677,0.00020844868,0.00027263773,0.00030450648,0.00014513692,0.000032741136,0.00034683436,0.0003048707,0.00011183098],"category_scores_gemma":[0.00006025322,0.00025606618,0.00020853347,0.00032648104,0.00007519213,0.00008213268,0.00025573804,0.00030484152,0.00007583068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006528467,0.00036784797,0.0025460313,0.00037813364,0.00009666773,0.000008536099,0.0004787626,0.005790415,0.00012514903,0.974498,0.0154065825,0.00023859728],"study_design_scores_gemma":[0.0005741592,0.000032159638,0.00076932344,0.00010194507,0.00009625556,0.0000010805588,0.00009786253,0.20205244,0.00011610879,0.79266536,0.0032731907,0.00022009421],"about_ca_topic_score_codex":0.00001595143,"about_ca_topic_score_gemma":0.00009819836,"teacher_disagreement_score":0.19626203,"about_ca_system_score_codex":0.00017691233,"about_ca_system_score_gemma":0.00006749854,"threshold_uncertainty_score":0.99998915},"labels":[],"label_agreement":null},{"id":"W2788615233","doi":"10.3390/math6010013","title":"Iterative Methods for Computing Vibrational Spectra","year":2018,"lang":"en","type":"article","venue":"Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Eigenvalues and eigenvectors; Basis (linear algebra); Grid; Matrix (chemical analysis); Hamiltonian (control theory); Quadrature (astronomy); Hamiltonian matrix; Applied mathematics; Algorithm; Computer science; Mathematics; Physics; Chemistry; Symmetric matrix; Mathematical optimization; Quantum mechanics; Geometry; Optics","score_opus":0.09770630229374164,"score_gpt":0.450016614239556,"score_spread":0.3523103119458144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788615233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054442445,0.0000064913443,0.9818491,0.0006395347,0.000092755734,0.00048698374,0.00002042178,0.00016681434,0.011293685],"genre_scores_gemma":[0.017702974,4.717217e-7,0.9810955,0.00022807848,0.00037035192,0.000052154934,0.000013841825,0.00002831687,0.000508342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991474,0.000040596136,0.00035609785,0.00017443021,0.00010517958,0.00017628443],"domain_scores_gemma":[0.9980343,0.0012655791,0.00016273913,0.0002634528,0.00021839218,0.000055538174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043553143,0.00012708215,0.0002045936,0.00005391406,0.00026635375,0.00007345319,0.00015054371,0.000052508047,0.00027487305],"category_scores_gemma":[0.00028305504,0.00011319257,0.00009071184,0.00013768057,0.00008345251,0.00006254071,0.00003452055,0.00006585492,0.00009133367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032259604,0.00016509449,0.0000032290493,0.00006256015,0.00002925315,1.2515507e-7,0.0023320436,0.0000010167237,0.008803942,0.9807452,0.0058094924,0.0020448081],"study_design_scores_gemma":[0.00026112015,0.000060317063,0.000022957436,0.000033409146,0.000033302003,0.000016825215,0.00024383479,0.06383972,0.03557998,0.8946993,0.005057744,0.00015154378],"about_ca_topic_score_codex":2.7366096e-7,"about_ca_topic_score_gemma":0.000001323017,"teacher_disagreement_score":0.08604596,"about_ca_system_score_codex":0.000028854794,"about_ca_system_score_gemma":0.000021232436,"threshold_uncertainty_score":0.46158588},"labels":[],"label_agreement":null},{"id":"W2790705522","doi":"10.1007/s11590-018-1234-1","title":"Complementarity problems over a hypermatrix (tensor) set","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uniqueness; Complementarity (molecular biology); Complementarity theory; Tensor (intrinsic definition); Combinatorics; Mathematics; Computational intelligence; Order (exchange); Mathematical physics; Physics; Pure mathematics; Mathematical analysis; Computer science; Quantum mechanics; Artificial intelligence","score_opus":0.05394148092549266,"score_gpt":0.32752160638490413,"score_spread":0.27358012545941146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790705522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16112821,0.0000048233996,0.8178345,0.015188104,0.00017746112,0.00074132753,0.00011344593,0.00040903653,0.004403121],"genre_scores_gemma":[0.41855285,0.000008531799,0.56147027,0.018148815,0.00046998722,0.00014117548,0.00039121826,0.00007111994,0.00074603123],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910015,0.00004509606,0.0002717787,0.00021362225,0.00018071155,0.00018861402],"domain_scores_gemma":[0.9993584,0.00006265315,0.000119024284,0.0002962513,0.00009697192,0.000066675995],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000104369494,0.00012313588,0.00013048484,0.00007393767,0.00022851107,0.00006623318,0.0001409893,0.00003859844,0.002458395],"category_scores_gemma":[0.000020894417,0.00012247551,0.000054292505,0.0002133201,0.00009309551,0.00013445612,0.00003792213,0.00007662866,0.00016287348],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003504265,0.0004723418,0.0047244104,0.00009091735,0.00014785485,0.000004482497,0.002729537,0.03122141,0.017567534,0.06668806,0.87585205,0.0004663808],"study_design_scores_gemma":[0.007546978,0.00026723376,0.007937697,0.00017480223,0.00039076497,0.00013383199,0.00047015998,0.54603165,0.0049984567,0.025633361,0.4040844,0.002330654],"about_ca_topic_score_codex":0.000017955845,"about_ca_topic_score_gemma":0.000010036993,"teacher_disagreement_score":0.5148102,"about_ca_system_score_codex":0.000051656072,"about_ca_system_score_gemma":0.000009185561,"threshold_uncertainty_score":0.9984535},"labels":[],"label_agreement":null},{"id":"W2790987616","doi":"10.1002/nla.2202","title":"Nonlinearly preconditioned L‐BFGS as an acceleration mechanism for alternating least squares with application to tensor decomposition","year":2018,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Nonlinear system; Tensor (intrinsic definition); Acceleration; Nonlinear conjugate gradient method; Robustness (evolution); Mathematics; Conjugate gradient method; Quasi-Newton method; Applied mathematics; Mathematical optimization; Computer science; Newton's method; Geometry; Gradient descent; Physics; Artificial intelligence","score_opus":0.030350149289128103,"score_gpt":0.3549142863738016,"score_spread":0.3245641370846735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790987616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10638217,0.0000061627825,0.87960213,0.002592034,0.000057756104,0.008965252,0.001027447,0.00086260505,0.00050444657],"genre_scores_gemma":[0.433711,0.0000040558416,0.53280705,0.00094864384,0.0011779271,0.026494836,0.0044665607,0.00021228596,0.00017763673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578935,0.00011309483,0.001037302,0.0017569122,0.0007034454,0.00059990276],"domain_scores_gemma":[0.9944063,0.00037457581,0.00093173096,0.0017183657,0.0019700606,0.0005989793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002803679,0.0007651781,0.00075673993,0.00034515938,0.00092278176,0.00040165387,0.00087435055,0.0004469214,0.00013898835],"category_scores_gemma":[0.00007908484,0.0006852209,0.00019630766,0.0006681595,0.0001459379,0.0003395679,0.00019305182,0.00061777513,0.00037319877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013767823,0.0044595497,0.00023645154,0.0007718762,0.00066638447,0.0000033206074,0.0012863381,0.005356652,0.011452295,0.95847636,0.002036799,0.013877191],"study_design_scores_gemma":[0.0035506398,0.0036120485,0.0009747469,0.00053586776,0.0012892014,0.00018499886,0.00053970783,0.21083222,0.031245489,0.7340007,0.009903446,0.0033309404],"about_ca_topic_score_codex":0.0001016674,"about_ca_topic_score_gemma":0.00010790531,"teacher_disagreement_score":0.34679508,"about_ca_system_score_codex":0.00025171405,"about_ca_system_score_gemma":0.00026519087,"threshold_uncertainty_score":0.9995599},"labels":[],"label_agreement":null},{"id":"W2791529266","doi":"10.1109/tetc.2018.2801464","title":"Tensor-Based Multiple Clustering Approaches for Cyber-Physical-Social Applications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Euclidean distance; Ranking (information retrieval); Similarity (geometry); Correlation clustering; Tensor (intrinsic definition); Clustering high-dimensional data; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.0998356847540566,"score_gpt":0.35029781150461065,"score_spread":0.250462126750554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791529266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06896618,0.00000183462,0.9279986,0.0012073918,0.00016916504,0.00071125984,0.00002571299,0.00024559698,0.00067424844],"genre_scores_gemma":[0.9043976,3.555034e-7,0.09444495,0.00015901426,0.00052623166,0.0003042174,0.0000056669273,0.000036360998,0.00012559004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987913,0.000043938373,0.00035373124,0.00036330614,0.000150522,0.00029723512],"domain_scores_gemma":[0.9988931,0.00055374147,0.00011574242,0.00029046062,0.00009586527,0.000051091793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001793935,0.00017830064,0.00022970472,0.00017307508,0.00073522737,0.000043466418,0.00020730933,0.00008264172,0.000011335975],"category_scores_gemma":[0.000013938058,0.00019834733,0.00015726221,0.0003590689,0.00009390829,0.00004920045,0.0000034146208,0.00023173219,0.0000130235585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023768669,0.006135156,0.00048195047,0.00077044324,0.00026519637,0.0000028845975,0.013206712,0.19582729,0.0065294486,0.110801145,0.0014076732,0.6643344],"study_design_scores_gemma":[0.0010217802,0.00006063007,0.00017441167,0.00005567492,0.000040730538,0.0000021305746,0.0002999302,0.97306037,0.007782539,0.012546339,0.004640346,0.00031512632],"about_ca_topic_score_codex":0.000011157087,"about_ca_topic_score_gemma":0.00007653984,"teacher_disagreement_score":0.8354314,"about_ca_system_score_codex":0.00009550807,"about_ca_system_score_gemma":0.000023345005,"threshold_uncertainty_score":0.80883694},"labels":[],"label_agreement":null},{"id":"W2796165036","doi":"10.1109/tsp.2018.2879031","title":"Learning Tensors From Partial Binary Measurements","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Bounded function; Binary number; Matrix norm; Mathematics; Rank (graph theory); Sample complexity; Combinatorics; Context (archaeology); Matrix (chemical analysis); Low-rank approximation; Order (exchange); Norm (philosophy); Discrete mathematics; Computational complexity theory; Algorithm; Computer science; Pure mathematics; Mathematical analysis; Physics; Arithmetic; Artificial intelligence; Eigenvalues and eigenvectors","score_opus":0.09392853624470889,"score_gpt":0.3342651369320856,"score_spread":0.24033660068737672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796165036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22680405,0.000016697371,0.7709214,0.0005065757,0.00008825476,0.00017533102,0.000008751842,0.00026199355,0.001216927],"genre_scores_gemma":[0.99456453,0.000001530902,0.0044071837,0.00024219968,0.00021405147,0.000061827704,0.0000021555559,0.00003029092,0.00047623404],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884975,0.00008825924,0.00026402637,0.000259353,0.00033008895,0.00020849954],"domain_scores_gemma":[0.9993185,0.00015796251,0.000110161636,0.00017256335,0.00016595087,0.00007489991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001780944,0.00014713535,0.00013365969,0.000068000256,0.0011131333,0.000098822675,0.00016263631,0.0000671139,0.0006353267],"category_scores_gemma":[0.0000065409567,0.00011700117,0.000082436716,0.00026374112,0.00014587921,0.0001470325,0.0000011073653,0.0003138301,0.00027772668],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068886095,0.0024939284,0.0002901662,0.0001277491,0.00043226162,0.000012707849,0.011388667,0.013063488,0.38093668,0.0006183125,0.0037013688,0.58624583],"study_design_scores_gemma":[0.002692168,0.0009399653,0.000704348,0.0006484226,0.00071034336,0.000041967825,0.0030054606,0.16376916,0.7892778,0.026192984,0.010687939,0.0013294747],"about_ca_topic_score_codex":0.000015195949,"about_ca_topic_score_gemma":0.00001123729,"teacher_disagreement_score":0.76776046,"about_ca_system_score_codex":0.000043850556,"about_ca_system_score_gemma":0.000041171195,"threshold_uncertainty_score":0.85614336},"labels":[],"label_agreement":null},{"id":"W2797346236","doi":"10.1109/focs.2018.00088","title":"Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Polytope; Mathematics; Kronecker delta; Tensor (intrinsic definition); Scaling; Algorithm; Discrete mathematics; Pure mathematics; Geometry; Quantum mechanics","score_opus":0.08355092090534687,"score_gpt":0.36928202406498906,"score_spread":0.2857311031596422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797346236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24268536,0.00028991012,0.74192494,0.0059235627,0.00050661474,0.0032298118,0.00061434106,0.00050444313,0.0043210173],"genre_scores_gemma":[0.16281077,0.00009968781,0.8217201,0.00081791694,0.0008901526,0.0017738729,0.00018247112,0.00014769622,0.011557327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985221,0.000027313938,0.000427009,0.0005443521,0.00020802792,0.0002711747],"domain_scores_gemma":[0.99868166,0.00020149224,0.00021036618,0.0005482542,0.00021979117,0.0001384152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029262595,0.00028026794,0.00039101983,0.0001117051,0.00021031738,0.00011931625,0.00021794338,0.00019824844,0.00022300497],"category_scores_gemma":[0.000041558687,0.00023222223,0.00015173017,0.000052277912,0.00011844767,0.000008664562,0.0003220722,0.00017375506,0.000046977828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075396914,0.0014832553,0.00008607353,0.0014527561,0.00035396966,0.0000030775968,0.0009110616,0.00026307267,0.00068170024,0.8527111,0.13528202,0.006696552],"study_design_scores_gemma":[0.0013971506,0.00017053242,0.00087673886,0.00041836774,0.00038364952,0.000031159023,0.0004371724,0.33696902,0.0030031253,0.58314294,0.07200209,0.0011680675],"about_ca_topic_score_codex":0.000020755697,"about_ca_topic_score_gemma":0.0000026370317,"teacher_disagreement_score":0.33670595,"about_ca_system_score_codex":0.00005415242,"about_ca_system_score_gemma":0.00003678103,"threshold_uncertainty_score":0.94697475},"labels":[],"label_agreement":null},{"id":"W2799867926","doi":"10.1002/cpe.4473","title":"Distributed geometric nonnegative matrix factorization and hierarchical alternating least squares–based nonnegative tensor factorization with the MapReduce paradigm","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wroclawskie Centrum Sieciowo-Superkomputerowe, Politechnika Wroclawska; Canadian Institute for Advanced Research","keywords":"Matrix decomposition; Non-negative matrix factorization; Multilinear map; Computer science; Factorization; Dimensionality reduction; Computation; Curse of dimensionality; Tensor (intrinsic definition); Matrix (chemical analysis); Algorithm; Mathematics; Artificial intelligence","score_opus":0.037413872453637066,"score_gpt":0.3647767161157716,"score_spread":0.32736284366213453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799867926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38323736,0.000082108745,0.61341417,0.00265365,0.00005433289,0.00033243484,0.000050243772,0.00005340413,0.00012230431],"genre_scores_gemma":[0.9931118,0.00004233161,0.0063200756,0.00025468538,0.00008710824,0.000082244034,0.00007296096,0.000012653562,0.000016165044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987316,0.00017532715,0.00027016108,0.00038255707,0.0002612377,0.0001790871],"domain_scores_gemma":[0.9972512,0.0018105285,0.00034695098,0.000131086,0.00034924387,0.00011096342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016363959,0.0001898961,0.00017107521,0.000097952645,0.0007348228,0.00025024868,0.000093188755,0.000058674013,0.000017526772],"category_scores_gemma":[0.00058891065,0.0001381094,0.00001729567,0.00056781626,0.0004526348,0.00067197194,0.000042133484,0.00018423237,0.0000025292206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014011404,0.0016249955,0.015410712,0.00048155035,0.00039015556,0.000027570959,0.20295104,0.0008861322,0.005609689,0.6501807,0.0018231765,0.11921313],"study_design_scores_gemma":[0.012613313,0.0045171077,0.110342294,0.000919166,0.001006492,0.0006821945,0.12508589,0.6125291,0.017679997,0.0811662,0.029622275,0.0038359442],"about_ca_topic_score_codex":0.00002318026,"about_ca_topic_score_gemma":0.0000040860914,"teacher_disagreement_score":0.611643,"about_ca_system_score_codex":0.000019981988,"about_ca_system_score_gemma":0.000043681324,"threshold_uncertainty_score":0.56517375},"labels":[],"label_agreement":null},{"id":"W2802552971","doi":"10.1109/tcss.2018.2813320","title":"A Distributed HOSVD Method With Its Incremental Computation for Big Data in Cyber-Physical-Social Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Big data; Computer science; Scalability; Computation; Dimensionality reduction; Tensor (intrinsic definition); Noise (video); Singular value decomposition; Cyber-physical system; Data mining; Artificial intelligence; Theoretical computer science; Distributed computing; Algorithm; Mathematics; Database","score_opus":0.12441489177833089,"score_gpt":0.3895373254667616,"score_spread":0.26512243368843075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802552971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048374165,0.0000066116627,0.94481176,0.00048804024,0.00069973455,0.0016874061,0.0035890976,0.00019121465,0.00015195586],"genre_scores_gemma":[0.98987967,3.7572804e-7,0.0072356807,0.00004556208,0.0013597907,0.00057611073,0.0007813236,0.00005151389,0.00006999596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768513,0.00029670147,0.000592839,0.0005334569,0.0005857147,0.00030614718],"domain_scores_gemma":[0.99803936,0.00087127346,0.0003239962,0.0001932142,0.00048817587,0.000083955565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045936462,0.00026435175,0.00047076002,0.00017991009,0.00094225554,0.00017117478,0.00029804537,0.00013449941,0.000004984162],"category_scores_gemma":[0.00001147266,0.00026202668,0.00010624809,0.00065297994,0.0001083852,0.00019790133,0.0000056920057,0.00020303158,0.000035106645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030798712,0.014631985,0.00014616082,0.002434101,0.003460886,0.00002605894,0.02261545,0.51232266,0.0061977324,0.35891855,0.04173705,0.03442949],"study_design_scores_gemma":[0.0044722594,0.00039689674,0.0009985783,0.00017207881,0.00027460128,0.00003892441,0.0020835074,0.97948205,0.00033307433,0.00902722,0.0019731733,0.00074762723],"about_ca_topic_score_codex":0.00023563362,"about_ca_topic_score_gemma":0.0001336173,"teacher_disagreement_score":0.9415055,"about_ca_system_score_codex":0.000322406,"about_ca_system_score_gemma":0.00011664356,"threshold_uncertainty_score":0.9999832},"labels":[],"label_agreement":null},{"id":"W2808531674","doi":"10.24963/ijcai.2018/504","title":"Joint Learning of Phenotypes and Diagnosis-Medication Correspondence via Hidden Interaction Tensor Factorization","year":2018,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heuristics; Computer science; Factorization; Tensor (intrinsic definition); Artificial intelligence; Machine learning; Poisson distribution; Matrix decomposition; Medical diagnosis; Pattern recognition (psychology); Data mining; Mathematics; Algorithm; Statistics; Medicine","score_opus":0.04675466994228429,"score_gpt":0.3286242398606789,"score_spread":0.2818695699183946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808531674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64571154,0.000015260299,0.3508617,0.0006103749,0.0001178717,0.0002127416,0.0000028374056,0.00012385007,0.0023438677],"genre_scores_gemma":[0.9881545,0.000031570693,0.010936956,0.000054865748,0.000089683745,0.000034901175,0.000011986435,0.000010154588,0.00067541463],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993608,0.00004566457,0.0002417643,0.00014474824,0.00013277277,0.000074221985],"domain_scores_gemma":[0.999224,0.0002330574,0.00018887757,0.0001297598,0.00018111084,0.000043191823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121589794,0.00007123305,0.00011057554,0.000080095066,0.00009766414,0.000018063196,0.000051204373,0.00004771779,0.0007105199],"category_scores_gemma":[0.00025790298,0.000062495674,0.000021891501,0.000115698705,0.00007691717,0.00013398063,0.000024839384,0.00007718628,0.000067405694],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019118829,0.001010707,0.07286718,0.0003817332,0.00014140477,0.0000012083881,0.009902079,0.000013850078,0.36551908,0.33536646,0.016397486,0.19820763],"study_design_scores_gemma":[0.0018447938,0.001071135,0.23668018,0.0004750871,0.00027864042,0.00007057891,0.003925531,0.049693465,0.44884035,0.2203586,0.035801288,0.00096034363],"about_ca_topic_score_codex":0.000025347998,"about_ca_topic_score_gemma":0.0000098486435,"teacher_disagreement_score":0.34244296,"about_ca_system_score_codex":0.000022022143,"about_ca_system_score_gemma":0.00000945527,"threshold_uncertainty_score":0.7779694},"labels":[],"label_agreement":null},{"id":"W2900800369","doi":"10.1016/j.laa.2020.01.039","title":"Exact recovery in the hypergraph stochastic block model: A spectral algorithm","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Hypergraph; Stochastic block model; Mathematics; Algorithm; Block (permutation group theory); Combinatorics; Statistics","score_opus":0.03562181014026161,"score_gpt":0.29029807622208653,"score_spread":0.2546762660818249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900800369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18163356,0.0004763651,0.782181,0.028722282,0.000025293226,0.0028416815,0.00035910413,0.0003801952,0.0033804844],"genre_scores_gemma":[0.9623337,0.00009167765,0.033867463,0.0024417758,0.00025975503,0.00077614817,0.000048411173,0.00003331546,0.00014776483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910843,0.000030510484,0.000265123,0.0002781447,0.00014209824,0.00017568191],"domain_scores_gemma":[0.9993153,0.00022028394,0.000067397494,0.00025369818,0.000039712344,0.000103585735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009499825,0.00013604645,0.00015919039,0.00005131488,0.00016643519,0.00004328487,0.00022537129,0.000059967457,0.000027368187],"category_scores_gemma":[0.00003372345,0.00010789666,0.00006608173,0.00042273552,0.00003640389,0.00007277272,0.000033637534,0.00021117028,0.00007206374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020249208,0.0006134458,0.000015190263,0.00007167477,0.000054376254,0.0000025916179,0.0024796731,0.0021876425,0.0034100076,0.9761483,0.0058682924,0.0091285305],"study_design_scores_gemma":[0.0006095372,0.00008481714,0.00022989653,0.000018321549,0.000102730184,0.00004409268,0.0005031446,0.67711896,0.00044425036,0.3142053,0.006250391,0.00038856966],"about_ca_topic_score_codex":0.0000032377216,"about_ca_topic_score_gemma":0.000004875748,"teacher_disagreement_score":0.78070015,"about_ca_system_score_codex":0.000009774735,"about_ca_system_score_gemma":0.000023567416,"threshold_uncertainty_score":0.4399898},"labels":[],"label_agreement":null},{"id":"W2901166078","doi":"10.1109/tsusc.2018.2881439","title":"Improved Multi-Order Distributed HOSVD with Its Incremental Computing for Smart City Services","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Huazhong University of Science and Technology; Canada Research Chairs; Shenzhen Fundamental Research Program; Royal Society of Canada","keywords":"Big data; Computer science; Adaptability; Distributed computing; Tree (set theory); Operationalization; Data processing; Data mining; Data science; Database","score_opus":0.030183311862901647,"score_gpt":0.31109342348925734,"score_spread":0.2809101116263557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901166078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3257131,0.0000051949014,0.67253006,0.00017486792,0.0000930366,0.0009812324,0.00006765964,0.0003354493,0.00009943032],"genre_scores_gemma":[0.9123617,8.0454333e-7,0.08668408,0.00020304785,0.00011356364,0.000061899766,0.00003169939,0.000053017837,0.00049021543],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814636,0.000060425213,0.00044457777,0.0004949963,0.00020279079,0.0006508427],"domain_scores_gemma":[0.99780756,0.00038913704,0.00023619088,0.0003602118,0.0010637954,0.00014308556],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00036165948,0.0003000388,0.00031297214,0.00015170423,0.0016203162,0.00016380938,0.00026769022,0.00010740092,0.00006050521],"category_scores_gemma":[0.000016056349,0.0002853971,0.00011227345,0.0006119262,0.000097428485,0.0001882885,0.0000099851995,0.00025493055,0.000012388148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013816148,0.06443857,0.009495017,0.03983204,0.012126275,0.00035207675,0.07843629,0.15143703,0.24921471,0.21062627,0.010651643,0.15957393],"study_design_scores_gemma":[0.0048820046,0.000680418,0.0006019736,0.0002483373,0.0002271444,0.000044432436,0.007571634,0.9072242,0.075391755,0.0010284899,0.0012723749,0.0008272434],"about_ca_topic_score_codex":0.00013410232,"about_ca_topic_score_gemma":0.00010810687,"teacher_disagreement_score":0.75578713,"about_ca_system_score_codex":0.00022150844,"about_ca_system_score_gemma":0.00008000959,"threshold_uncertainty_score":0.9999598},"labels":[],"label_agreement":null},{"id":"W2904119337","doi":"10.1145/3233773","title":"A Deep Bayesian Tensor-Based System for Video Recommendation","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Tencent","keywords":"Computer science; Recommender system; Surprise; Exploit; Artificial intelligence; Ranking (information retrieval); Machine learning; Tensor (intrinsic definition); Metric (unit); Cluster analysis; Bayesian probability; Information retrieval; Collaborative filtering; Latent variable","score_opus":0.038135568599120005,"score_gpt":0.306795895461837,"score_spread":0.268660326862717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904119337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007595949,0.0000018500783,0.9906396,0.0011169327,0.0007309647,0.0015738762,0.00021087694,0.0006254462,0.0043408093],"genre_scores_gemma":[0.95619226,7.195661e-7,0.041257292,0.00048562585,0.00015835407,0.0015741566,0.00015628122,0.000028869696,0.00014643208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984037,0.000074933385,0.00084892707,0.00018412281,0.00024299927,0.00024529576],"domain_scores_gemma":[0.99771905,0.0005102904,0.00039277322,0.000670972,0.00058981654,0.000117123425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004155247,0.00020264403,0.0002494122,0.00036015452,0.00065159774,0.00020248353,0.00026284865,0.00012565537,0.00013050053],"category_scores_gemma":[0.000085785316,0.00019382947,0.00015205523,0.00036495482,0.000048285037,0.0006945527,0.0000028713912,0.00011939857,0.00054897874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021367134,0.0021442727,0.00017852083,0.008211018,0.0011474128,0.0000018875945,0.011236277,0.020807873,0.0015575805,0.62616044,0.0785866,0.24783142],"study_design_scores_gemma":[0.005200606,0.00072121737,0.00009359678,0.000529768,0.0002673433,0.00009651963,0.008400592,0.54250956,0.007971285,0.004758107,0.42845035,0.0010010723],"about_ca_topic_score_codex":0.000021720312,"about_ca_topic_score_gemma":0.000012907655,"teacher_disagreement_score":0.95543265,"about_ca_system_score_codex":0.00023269176,"about_ca_system_score_gemma":0.00004905429,"threshold_uncertainty_score":0.7904137},"labels":[],"label_agreement":null},{"id":"W2909294622","doi":"10.1109/tnse.2019.2929155","title":"HO-OTSVD: A Novel Tensor Decomposition and Its Incremental Decomposition for Cyber–Physical–Social Networks (CPSN)","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Singular value decomposition; Orthogonalization; Tensor (intrinsic definition); Lanczos resampling; Computer science; Tensor decomposition; Tucker decomposition; Decomposition; Adjacency matrix; Theoretical computer science; Matrix decomposition; Distributed computing; Mathematics; Algorithm; Eigenvalues and eigenvectors","score_opus":0.019971534297515935,"score_gpt":0.2905657392360518,"score_spread":0.27059420493853586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909294622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54743344,0.000017884484,0.4514786,0.00018158929,0.00021052458,0.00047916063,0.000021329612,0.000107935775,0.00006954714],"genre_scores_gemma":[0.9888181,0.000019418296,0.010614405,0.0001263572,0.00021311056,0.00013943543,0.000005484662,0.000026216274,0.000037462174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988038,0.000009121366,0.00020952662,0.00036938133,0.00023306755,0.00037510195],"domain_scores_gemma":[0.9993488,0.00022183954,0.00006156541,0.0001298234,0.00010867659,0.00012928093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026577665,0.00018846893,0.0002148675,0.00012577372,0.00061372045,0.00012033744,0.0001217571,0.00007144571,0.000011214358],"category_scores_gemma":[0.000004248023,0.00019398773,0.00006954327,0.0004238457,0.000064502485,0.0003340516,0.0000045077163,0.00017767289,0.000009115483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021009773,0.00082405534,0.00003888216,0.00024058607,0.00013713365,0.0000014249256,0.0010571359,0.41370627,0.5138874,0.05969592,0.00071651937,0.009484585],"study_design_scores_gemma":[0.000981597,0.00016527508,0.0008849655,0.00009949135,0.00008077476,0.000033500324,0.000065265245,0.98950106,0.006764735,0.0007532144,0.0003066238,0.00036351566],"about_ca_topic_score_codex":0.0000028800603,"about_ca_topic_score_gemma":0.0000029928237,"teacher_disagreement_score":0.57579476,"about_ca_system_score_codex":0.00008746706,"about_ca_system_score_gemma":0.000021883248,"threshold_uncertainty_score":0.79105896},"labels":[],"label_agreement":null},{"id":"W2919046304","doi":"10.48550/arxiv.1903.00813","title":"Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Catalan number; Mathematics; Enumeration; Bijection; Hypercube; Combinatorics; Generalization; Functional equation; Arity; Binary tree; Binary number; Discrete mathematics; Arithmetic","score_opus":0.11530920800697195,"score_gpt":0.23067743545995656,"score_spread":0.11536822745298461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919046304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89319354,0.000024010096,0.10429126,0.00027201587,0.000113543356,0.0009822038,0.0001269281,0.00004810439,0.0009483759],"genre_scores_gemma":[0.99706113,0.00003711497,0.0015311834,0.00004848549,0.000028287479,0.000006917609,0.000028259226,0.000015168382,0.0012434437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999376,0.000044268312,0.00015655252,0.0002785697,0.00003995181,0.000104662235],"domain_scores_gemma":[0.998901,0.00021332926,0.00019428458,0.0005262015,0.00012819971,0.000036952475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009371625,0.00012055477,0.00018898424,0.0000550582,0.00012272301,0.000016034575,0.00020289884,0.00013723277,0.000024976294],"category_scores_gemma":[0.000050486386,0.00011046891,0.00015793966,0.00011713239,0.00006556095,0.000055054505,0.00015432629,0.0001450123,0.000007537752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021889273,0.00013687166,0.0010171927,0.00030816736,0.00009999195,6.68392e-7,0.00023220704,0.0100426795,0.0011733123,0.98537874,0.0014995076,0.0000887594],"study_design_scores_gemma":[0.0006075176,0.00003718339,0.0023567637,0.00014849854,0.00043398704,0.0000039194547,0.00014955434,0.0585329,0.0021032705,0.9340375,0.0013384998,0.0002503872],"about_ca_topic_score_codex":0.000010372821,"about_ca_topic_score_gemma":0.000022138396,"teacher_disagreement_score":0.10386758,"about_ca_system_score_codex":0.00004896945,"about_ca_system_score_gemma":0.000047575395,"threshold_uncertainty_score":0.45047915},"labels":[],"label_agreement":null},{"id":"W2939066948","doi":"10.3390/sym11040556","title":"System Identification Based on Tensor Decompositions: A Trilinear Approach","year":2019,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Multilinear map; Nonlinear system; Tensor (intrinsic definition); Computer science; Context (archaeology); Bilinear interpolation; Nonlinear system identification; System identification; Identification (biology); Linear system; Curse of dimensionality; Mathematical optimization; Algorithm; Applied mathematics; Mathematics; Artificial intelligence; Measure (data warehouse); Data mining","score_opus":0.027529352859798614,"score_gpt":0.3011408063701561,"score_spread":0.2736114535103575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939066948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7163197,0.00004252685,0.1395456,0.0008621419,0.00045951194,0.0025688086,0.00018458882,0.0012973794,0.13871977],"genre_scores_gemma":[0.97180104,4.8813774e-7,0.026272595,0.00024355072,0.0000843513,0.00016023371,0.00009334231,0.000034151504,0.001310262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871916,0.00008935672,0.0003781932,0.0003525859,0.00028217168,0.00017852582],"domain_scores_gemma":[0.99862486,0.0002876577,0.00016249596,0.0007396926,0.00010546774,0.00007982974],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029693855,0.0001497129,0.00021878835,0.00020936537,0.00013142252,0.0000643628,0.0002024505,0.000097127115,0.00009762966],"category_scores_gemma":[0.000046109693,0.00013788023,0.00013394162,0.0003927464,0.00002259484,0.000046525438,0.00001613357,0.00015033109,0.0017212565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055412227,0.0007644504,0.0009204256,0.00046038596,0.00004143964,0.0000017002552,0.000063819105,0.0002333605,0.0059941174,0.9851701,0.005714203,0.0005805522],"study_design_scores_gemma":[0.005357565,0.00031498153,0.016145937,0.0005690584,0.00032492148,0.00010424541,0.0025151928,0.91680366,0.023090715,0.026287392,0.0070133237,0.0014730134],"about_ca_topic_score_codex":0.0000030995864,"about_ca_topic_score_gemma":2.1141642e-7,"teacher_disagreement_score":0.95888275,"about_ca_system_score_codex":0.000111040856,"about_ca_system_score_gemma":0.00002410007,"threshold_uncertainty_score":0.99905604},"labels":[],"label_agreement":null},{"id":"W2950784786","doi":"10.48550/arxiv.1004.4641","title":"Chunky and Equal-Spaced Polynomial Multiplication","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Multiplication (music); Polynomial; Product (mathematics); Feature (linguistics); Computer science; Time complexity; Algorithm; Algebra over a field; Arithmetic; Mathematics; Theoretical computer science; Combinatorics; Pure mathematics","score_opus":0.11378005192518088,"score_gpt":0.24345700891062105,"score_spread":0.12967695698544018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950784786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9260364,0.000013101157,0.068950355,0.0004190543,0.000163766,0.00055312354,0.00007652926,0.00028832388,0.003499318],"genre_scores_gemma":[0.9932876,0.000057322628,0.004203141,0.00006464626,0.00012856838,0.000005462376,0.000054880245,0.000031095828,0.0021672384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988597,0.000054318618,0.00018629586,0.0006497808,0.000053210682,0.00019671407],"domain_scores_gemma":[0.9984412,0.00019482765,0.00025943722,0.0008288439,0.00011188958,0.00016378956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000126712,0.00023962859,0.0002692669,0.00014223662,0.00017615044,0.00005921015,0.00034236678,0.00041523844,0.00010303663],"category_scores_gemma":[0.000055738827,0.00028264167,0.00012225097,0.0001495747,0.00013042426,0.0000803328,0.00044111893,0.0006503099,0.0000861261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009688766,0.00044430175,0.0016667121,0.0002212518,0.00015611405,0.000025792968,0.00053543726,0.0010494463,0.010693485,0.977443,0.0066160304,0.0010515464],"study_design_scores_gemma":[0.0031108898,0.00006838406,0.009912227,0.00016518842,0.0006663418,0.00002677597,0.00040136575,0.14752603,0.0035998174,0.81898403,0.013740402,0.0017985699],"about_ca_topic_score_codex":0.0000652533,"about_ca_topic_score_gemma":0.000090881826,"teacher_disagreement_score":0.158459,"about_ca_system_score_codex":0.00007199344,"about_ca_system_score_gemma":0.000053348896,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W2951215707","doi":"10.48550/arxiv.1609.08063","title":"Modeling Parallel Wiener-Hammerstein Systems Using Tensor Decomposition of Volterra Kernels","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Nonlinear system identification; Block (permutation group theory); Interpretability; Tensor (intrinsic definition); Nonlinear system; Identification (biology); Kernel (algebra); System identification; Mathematics; Tensor decomposition; Computer science; Mathematical optimization; Artificial intelligence; Discrete mathematics; Data modeling; Pure mathematics","score_opus":0.20521471365683042,"score_gpt":0.2744396346288421,"score_spread":0.06922492097201166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951215707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47523347,0.00003368848,0.5230647,0.000031125583,0.00015462577,0.0003863197,0.00009154202,0.000108342974,0.0008962042],"genre_scores_gemma":[0.99427336,0.000055451957,0.0047522658,0.000017424378,0.00012494334,0.000004579882,0.000037129248,0.000056504086,0.0006783384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980507,0.00016281627,0.0005531427,0.0007654898,0.00013578392,0.0003320794],"domain_scores_gemma":[0.9977802,0.00014507619,0.0005618278,0.0009875067,0.00036171966,0.0001636684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021800323,0.00037311314,0.00061816943,0.0003025268,0.0001663929,0.000047390666,0.0005560832,0.00036576905,0.000047059057],"category_scores_gemma":[0.000023793584,0.00037860704,0.00034235604,0.00022708472,0.00010735214,0.00017515966,0.00039049008,0.00031660422,0.000033347507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613043,0.0001818715,0.00014930322,0.00025414574,0.00018497459,0.000024291729,0.000116544514,0.66969365,0.0037640368,0.32544103,0.00010260464,0.000026246747],"study_design_scores_gemma":[0.0006108137,0.000020831756,0.00001820742,0.0006157586,0.00029863216,0.000011960789,0.00021291325,0.8827372,0.00025634354,0.11477723,0.00002550796,0.00041456328],"about_ca_topic_score_codex":0.00019941082,"about_ca_topic_score_gemma":0.000009991998,"teacher_disagreement_score":0.5190399,"about_ca_system_score_codex":0.0003042179,"about_ca_system_score_gemma":0.00009713048,"threshold_uncertainty_score":0.9998666},"labels":[],"label_agreement":null},{"id":"W2951244983","doi":"10.48550/arxiv.1405.2096","title":"Optimization on the Hierarchical Tucker manifold - applications to tensor completion","year":2014,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Tensor (intrinsic definition); Subspace topology; Mathematical optimization; Overfitting; Manifold (fluid mechanics); Computer science; Conjugate gradient method; Scalability; Algorithm; Optimization problem; Gradient descent; Mathematics; Theoretical computer science; Artificial intelligence; Artificial neural network; Pure mathematics","score_opus":0.11241534572183058,"score_gpt":0.3412388485841592,"score_spread":0.2288235028623286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951244983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24587205,0.0000124857,0.6925963,0.03667804,0.00022562259,0.0042062104,0.0002173706,0.00067438156,0.019517519],"genre_scores_gemma":[0.9585443,0.000016454007,0.030964602,0.0046824245,0.0006259109,0.0031125494,0.0003872793,0.00009514439,0.0015713042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800867,0.00017197337,0.0005312928,0.000656796,0.0003524449,0.00027884252],"domain_scores_gemma":[0.9972063,0.00063078216,0.0002719488,0.0015059946,0.0002184691,0.00016653017],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033738735,0.00033410062,0.00037155536,0.00014116145,0.000400708,0.00010352616,0.00063681306,0.0002561121,0.0004657173],"category_scores_gemma":[0.0001578325,0.00026022203,0.00019046527,0.00022450718,0.000067498266,0.00002757081,0.00034156267,0.0006935006,0.0016822042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049936738,0.0009213991,0.0034742511,0.00019081001,0.00015621445,0.0000018310992,0.0004032575,0.033143334,0.00086202,0.888921,0.07138841,0.00048753797],"study_design_scores_gemma":[0.0018009982,0.00039122187,0.11748714,0.0010392944,0.0009249367,0.000047908932,0.0003585122,0.093561105,0.0026731123,0.3407725,0.4372172,0.003726063],"about_ca_topic_score_codex":0.000010127215,"about_ca_topic_score_gemma":0.0000061081505,"teacher_disagreement_score":0.7126723,"about_ca_system_score_codex":0.00010479045,"about_ca_system_score_gemma":0.00003535831,"threshold_uncertainty_score":0.999985},"labels":[],"label_agreement":null},{"id":"W2951364546","doi":"10.48550/arxiv.math/0609054","title":"On the ideals of Secant Varieties to certain rational varieties","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Embedding; Variety (cybernetics); Pure mathematics; Product (mathematics); Projective variety; Projective test; Geometry; Computer science; Statistics","score_opus":0.08873804861913319,"score_gpt":0.32764793151689753,"score_spread":0.23890988289776433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951364546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95212305,0.0000287739,0.02242548,0.01232473,0.0002066333,0.00090701925,0.00023396991,0.0001265832,0.011623763],"genre_scores_gemma":[0.9911116,0.0000057699967,0.0037020587,0.001050023,0.00016973667,0.00035235463,0.00010184839,0.000036660847,0.003469991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984363,0.00011835405,0.00054939406,0.00033505983,0.00037183083,0.00018908035],"domain_scores_gemma":[0.9975244,0.0010308988,0.0003164842,0.00082593865,0.00024308497,0.00005918313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034871197,0.00025191435,0.00035084906,0.000095320735,0.00017765409,0.00005363431,0.00044255017,0.00018296072,0.00045319297],"category_scores_gemma":[0.00023852917,0.00018780424,0.0001758841,0.00013132751,0.00010409783,0.000023338052,0.0002760992,0.0004034493,0.0001565965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019900393,0.00020542518,0.0020896932,0.00009575986,0.000074405056,9.957398e-7,0.0006977214,0.000780748,0.0010988655,0.91942567,0.075472094,0.00003873731],"study_design_scores_gemma":[0.00016495114,0.000050569244,0.04276003,0.00011307044,0.00007960148,0.000002645765,0.00019858434,0.00021356026,0.0055130287,0.9449673,0.005608507,0.00032810864],"about_ca_topic_score_codex":0.00014141666,"about_ca_topic_score_gemma":0.00005176185,"teacher_disagreement_score":0.06986359,"about_ca_system_score_codex":0.000059896363,"about_ca_system_score_gemma":0.000112960806,"threshold_uncertainty_score":0.76584345},"labels":[],"label_agreement":null},{"id":"W2951706336","doi":"10.48550/arxiv.1306.2663","title":"Large Margin Low Rank Tensor Analysis","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Generalization; Computer science; Artificial intelligence; Nonlinear dimensionality reduction; Manifold (fluid mechanics); Margin (machine learning); Pattern recognition (psychology); Curse of dimensionality; Dimensionality reduction; Similarity (geometry); Rank (graph theory); Euclidean space; Object (grammar); Cognition; Feature vector; Mathematics; Machine learning; Pure mathematics; Image (mathematics); Psychology","score_opus":0.08061920354587528,"score_gpt":0.2293455989999257,"score_spread":0.14872639545405042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951706336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7923524,0.00001821594,0.19893408,0.00024117551,0.00010704626,0.00059707725,0.00026162888,0.00036883052,0.0071195755],"genre_scores_gemma":[0.98274636,0.00006900725,0.002059375,0.00013712033,0.00007243777,0.000007652194,0.00016861812,0.000036315356,0.014703119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829787,0.00012057987,0.00029071225,0.00083142094,0.000097016244,0.0003623911],"domain_scores_gemma":[0.99769145,0.0001940427,0.00032822823,0.0013435447,0.00024006773,0.00020267525],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017598204,0.00033411742,0.0005850491,0.00048112107,0.00018515471,0.00008117764,0.00067527685,0.00034339697,0.0023985256],"category_scores_gemma":[0.000039558996,0.00036830522,0.0006521488,0.00093629904,0.0000750433,0.00009923756,0.0005251737,0.00051996234,0.0009610866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003485754,0.0008129011,0.0052972184,0.00023618137,0.0022757337,0.000098578595,0.0002923797,0.014903919,0.00009434471,0.95926285,0.016635783,0.00005526055],"study_design_scores_gemma":[0.0016899299,0.000025510935,0.009797212,0.000117610485,0.0055813333,0.000004658589,0.00056061166,0.29024884,0.00017445082,0.6838193,0.0065871826,0.0013933764],"about_ca_topic_score_codex":0.00006510184,"about_ca_topic_score_gemma":0.00006968176,"teacher_disagreement_score":0.27544355,"about_ca_system_score_codex":0.00014292689,"about_ca_system_score_gemma":0.000049560716,"threshold_uncertainty_score":0.9998769},"labels":[],"label_agreement":null},{"id":"W2952042704","doi":"10.48550/arxiv.1111.6091","title":"An adaptive algebraic multigrid algorithm for low-rank canonical tensor decomposition","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Rank (graph theory); Tensor (intrinsic definition); Mathematics; Relaxation (psychology); Computation; Algebraic number; Multiplicative function; Algorithm; Decomposition; Applied mathematics; Mathematical optimization; Pure mathematics; Mathematical analysis; Combinatorics","score_opus":0.12335943587844318,"score_gpt":0.26682248994398045,"score_spread":0.14346305406553728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952042704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26122284,0.00001564052,0.73493487,0.000054294676,0.00024167114,0.0014114303,0.00063835975,0.00041758857,0.0010632972],"genre_scores_gemma":[0.9034189,0.000037052945,0.09504072,0.00012211321,0.00022295337,0.000038946335,0.0003597803,0.00007961072,0.00067995064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977555,0.00015819864,0.00039347715,0.0011599574,0.00009687876,0.00043593717],"domain_scores_gemma":[0.9973739,0.00033179673,0.00040527942,0.0011260771,0.0004204237,0.00034253875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002033616,0.00046242843,0.00056201767,0.00023234065,0.0003102196,0.00006043712,0.00078145106,0.000520979,0.00019359104],"category_scores_gemma":[0.000026283888,0.00053397304,0.00044614382,0.00021857623,0.00017488674,0.00019958401,0.00025298956,0.0005649436,0.00010402089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005569219,0.0032551447,0.00019739116,0.00031222875,0.00072416564,0.00014774587,0.0007158148,0.005798598,0.0012593522,0.97771734,0.003790064,0.005525243],"study_design_scores_gemma":[0.0020492808,0.00033115374,0.00089661754,0.00019814215,0.0007093281,0.00001843713,0.0002958884,0.4678313,0.0019945607,0.5241711,0.0003828582,0.0011212837],"about_ca_topic_score_codex":0.00014703318,"about_ca_topic_score_gemma":0.00011268185,"teacher_disagreement_score":0.64219606,"about_ca_system_score_codex":0.00027015395,"about_ca_system_score_gemma":0.00017567819,"threshold_uncertainty_score":0.99971116},"labels":[],"label_agreement":null},{"id":"W2953019997","doi":"10.1103/physrevb.100.235118","title":"Tensor renormalization group centered about a core tensor","year":2019,"lang":"en","type":"article","venue":"Physical review. B./Physical review. B","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Canada First Research Excellence Fund","keywords":"Renormalization group; Mathematics; Scaling; Tensor (intrinsic definition); Lattice (music); Granularity; Row; Statistical physics; Pure mathematics; Physics; Mathematical physics; Geometry; Computer science","score_opus":0.049859046473733876,"score_gpt":0.4146013800713177,"score_spread":0.3647423335975838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953019997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85911155,0.05137079,0.022128452,0.015554472,0.00065352424,0.018005086,0.0005451472,0.0018280986,0.030802894],"genre_scores_gemma":[0.8870496,0.08754335,0.0027159706,0.017976843,0.0011895983,0.0013160539,0.00059156737,0.00025561202,0.001361371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604094,0.00029371952,0.0011160194,0.00096112373,0.0008956877,0.0006925075],"domain_scores_gemma":[0.9961665,0.0006681865,0.0007263454,0.0016077132,0.00041419629,0.00041703598],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038760755,0.0006630408,0.0019520766,0.00006552505,0.00017306095,0.0000621713,0.00072628754,0.000072109455,0.0005185179],"category_scores_gemma":[0.0006941078,0.0005199835,0.0010957231,0.0009876204,0.00012661851,0.0003258259,0.00019981565,0.00055819034,0.0051701223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021673903,0.0019212873,0.00042694557,0.010795573,0.00009780038,0.0000050883173,0.000067787965,0.0000014675195,0.012258228,0.9159698,0.050210394,0.008223949],"study_design_scores_gemma":[0.0016165378,0.0005730708,0.0050219838,0.036523014,0.0019996974,0.000057577203,0.000025884223,0.012540667,0.0016828879,0.53191984,0.4058071,0.0022317327],"about_ca_topic_score_codex":0.0000072440316,"about_ca_topic_score_gemma":0.0000021806504,"teacher_disagreement_score":0.38404995,"about_ca_system_score_codex":0.00011727784,"about_ca_system_score_gemma":0.000044592256,"threshold_uncertainty_score":0.99972516},"labels":[],"label_agreement":null},{"id":"W2953272550","doi":"10.48550/arxiv.1106.5068","title":"Cayley's hyperdeterminant: a combinatorial approach via representation theory","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Invariant (physics); Enumeration; Combinatorics; Integer (computer science); Representation theory; Polynomial; Homogeneous; Simple (philosophy); Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.14773369026133498,"score_gpt":0.24335563586643014,"score_spread":0.09562194560509515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953272550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5932984,0.00001561857,0.353251,0.00002457194,0.00068718847,0.0009874195,0.000050830993,0.00044130805,0.051243655],"genre_scores_gemma":[0.9940574,0.000027371456,0.0031241628,0.00002960559,0.000150444,0.000011363673,0.00008135708,0.000046846802,0.0024714095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982687,0.00026450667,0.00028354384,0.0008308873,0.0000923206,0.00026002037],"domain_scores_gemma":[0.99789894,0.00022936729,0.00036411002,0.0011949504,0.00016662662,0.0001460052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025962363,0.0003099956,0.0004068143,0.00018005821,0.00020181439,0.000044376757,0.00063758646,0.00037056598,0.00017568187],"category_scores_gemma":[0.00005299634,0.0003489726,0.00027957087,0.00026659557,0.00015867813,0.000115278424,0.00051095657,0.00052606297,0.00012925518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102508835,0.000502858,0.0002466002,0.000111889014,0.00010897343,0.000033413427,0.00057445734,0.0004401241,0.000099009296,0.99707735,0.0005106066,0.00019221651],"study_design_scores_gemma":[0.00070939434,0.000026614316,0.0003043742,0.000037661375,0.00032870643,0.000011790102,0.00025321232,0.0114989495,0.00056806055,0.9857287,0.00013077115,0.000401811],"about_ca_topic_score_codex":0.00008485469,"about_ca_topic_score_gemma":0.0000059122085,"teacher_disagreement_score":0.40075904,"about_ca_system_score_codex":0.00012409236,"about_ca_system_score_gemma":0.000059012717,"threshold_uncertainty_score":0.9998962},"labels":[],"label_agreement":null},{"id":"W2954734636","doi":"10.1109/tem.2019.2912928","title":"Tensor-Train-Based High-Order Dominant Eigen Decomposition for Multimodal Prediction Services","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Engineering Management","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities; Shenzhen Fundamental Research Program; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Computation; Tensor (intrinsic definition); Big data; Curse of dimensionality; Data mining; Artificial intelligence; Algorithm; Machine learning; Mathematics; Database","score_opus":0.009589296351073215,"score_gpt":0.2542805308584959,"score_spread":0.24469123450742267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954734636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1017538,0.000004063977,0.89522886,0.00027100163,0.00050142535,0.001509249,0.00015208438,0.00038889493,0.00019059534],"genre_scores_gemma":[0.8829106,0.0000073588612,0.11554622,0.00011736443,0.000043822503,0.0007895408,0.000047743528,0.000055431043,0.0004819224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885803,0.000014138962,0.0003114856,0.00034538834,0.00021005594,0.00026090536],"domain_scores_gemma":[0.9992403,0.00014303734,0.000068808615,0.00039294563,0.00008105927,0.00007388127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001241081,0.00022560284,0.00019819444,0.00025669852,0.00014281312,0.000046437166,0.00015347681,0.00008200848,0.00013480395],"category_scores_gemma":[9.128396e-7,0.00023361843,0.00013789549,0.00021811076,0.000010038723,0.000100033096,0.0000014420284,0.00012283935,0.00009933616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103874736,0.0007517859,0.000009394539,0.001046702,0.0002600148,0.0000021827836,0.0001240058,0.9628285,0.019470593,0.011121362,0.00019394608,0.004087651],"study_design_scores_gemma":[0.0037893339,0.00025972878,0.0015246003,0.00028044518,0.00036156797,0.000004696552,0.00014646095,0.9455861,0.0411814,0.0014839428,0.004835493,0.0005462424],"about_ca_topic_score_codex":0.000009994083,"about_ca_topic_score_gemma":0.0000051230395,"teacher_disagreement_score":0.7811568,"about_ca_system_score_codex":0.00012251941,"about_ca_system_score_gemma":0.0000070000224,"threshold_uncertainty_score":0.9526683},"labels":[],"label_agreement":null},{"id":"W2963626304","doi":"10.1002/nla.1963","title":"A nonlinearly preconditioned conjugate gradient algorithm for rank‐<i>R</i> canonical tensor approximation","year":2014,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Preconditioner; Conjugate gradient method; Convergence (economics); Mathematics; Rank (graph theory); Tensor (intrinsic definition); Acceleration; Nonlinear conjugate gradient method; Nonlinear system; Algorithm; Applied mathematics; Mathematical optimization; Computer science; Iterative method; Pure mathematics; Gradient descent; Combinatorics; Artificial intelligence; Artificial neural network","score_opus":0.019395089764698913,"score_gpt":0.28877605997942274,"score_spread":0.26938097021472385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963626304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035434929,0.000012879973,0.9888576,0.002449051,0.00003648563,0.0029399106,0.0004105985,0.0005051383,0.0012448414],"genre_scores_gemma":[0.09040556,0.000005400363,0.8969364,0.001060035,0.0005748688,0.009291874,0.00096027873,0.00010858155,0.00065699103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978486,0.00008082278,0.00064935215,0.0006505525,0.00033108745,0.00043961668],"domain_scores_gemma":[0.9974237,0.00077324436,0.00031709878,0.00072566513,0.0004347567,0.00032554474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002754039,0.00031796718,0.00045492803,0.00010788038,0.00048603013,0.0000792795,0.0003293302,0.0001492975,0.00011335323],"category_scores_gemma":[0.00009527326,0.00026994382,0.0001799606,0.00052433915,0.00017397695,0.00014271076,0.00003612998,0.00025420336,0.00021711407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013296871,0.0028479712,0.00010681717,0.00015419356,0.00022043168,7.9293494e-7,0.00022550802,0.00017098051,0.0012235354,0.9156867,0.006253873,0.07297618],"study_design_scores_gemma":[0.005686503,0.0010002371,0.0006781157,0.000066034656,0.00052449893,0.00011162271,0.0001226045,0.41768643,0.0042586518,0.22748362,0.34104988,0.0013317959],"about_ca_topic_score_codex":0.000012028534,"about_ca_topic_score_gemma":0.000007916099,"teacher_disagreement_score":0.68820316,"about_ca_system_score_codex":0.00007521245,"about_ca_system_score_gemma":0.000082864535,"threshold_uncertainty_score":0.99997526},"labels":[],"label_agreement":null},{"id":"W2964162214","doi":"10.1090/proc/14274","title":"On the first and second eigenvalue of finite and infinite uniform hypergraphs","year":2018,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Science Foundation of Jiangxi Province; Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Government of Jiangxi Province; National Natural Science Foundation of China","keywords":"Eigenvalues and eigenvectors; Mathematics; Pure mathematics; Finite set; Combinatorics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.02147293581004314,"score_gpt":0.27051273084178634,"score_spread":0.2490397950317432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964162214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98815477,0.000007819525,0.00018506215,0.0025915601,0.0000069442117,0.00028648056,0.00001768826,0.0000263044,0.008723371],"genre_scores_gemma":[0.9866174,0.00002238734,0.012291474,0.0008711021,0.000023856039,0.00002664416,1.6261536e-7,0.000016230357,0.00013078017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918795,0.0000058000674,0.00029962472,0.0001541842,0.00020716194,0.00014529463],"domain_scores_gemma":[0.99823684,0.0009801587,0.0004031219,0.00017277572,0.00015562685,0.000051505976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032747848,0.00013061262,0.00028384078,0.000018843013,0.00022730549,0.000026607375,0.00025008305,0.00003528235,0.00007830467],"category_scores_gemma":[0.00030960003,0.00007164874,0.00013751994,0.00032340523,0.0016866588,0.000045493343,0.00015500907,0.00013554982,0.000004591688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015084049,0.00013919512,0.0009541942,0.00030621456,0.0000755836,1.3073901e-8,0.0034555225,1.011179e-7,0.0032576304,0.98599136,0.0056066746,0.00019843738],"study_design_scores_gemma":[0.00020542095,0.00018251977,0.0040376205,0.00014704178,0.00007790985,0.000009005497,0.0024601656,0.0015035389,0.008831936,0.9816388,0.0007725248,0.00013352645],"about_ca_topic_score_codex":0.0000030019066,"about_ca_topic_score_gemma":9.914403e-7,"teacher_disagreement_score":0.012106412,"about_ca_system_score_codex":0.000010060169,"about_ca_system_score_gemma":0.000007873127,"threshold_uncertainty_score":0.62145644},"labels":[],"label_agreement":null},{"id":"W2964285749","doi":"10.1016/j.laa.2013.03.021","title":"On Kruskal’s theorem that every 3 × 3 × 3 array has rank at most 5","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Mathematics; Rank (graph theory); Kruskal's algorithm; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Spanning tree","score_opus":0.03849920406538472,"score_gpt":0.28142836041825625,"score_spread":0.24292915635287154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964285749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8517954,0.0004651156,0.047751285,0.02121951,0.00012307771,0.0052823634,0.00031284947,0.0009968955,0.0720535],"genre_scores_gemma":[0.98444617,0.00008969755,0.0048067183,0.0015511939,0.00017606573,0.0016498038,0.000105592786,0.00005057317,0.0071241814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988822,0.000034661927,0.00027438882,0.00037569954,0.00019211374,0.00024097055],"domain_scores_gemma":[0.9985538,0.00048004932,0.00012288702,0.00054714596,0.000112976355,0.00018312129],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000092332484,0.00020606774,0.0002082138,0.00007544567,0.00057565264,0.00009923466,0.00021333083,0.00011038427,0.0015358467],"category_scores_gemma":[0.000040404168,0.00017495015,0.000075429685,0.00022726029,0.00010354559,0.000127274,0.000057412246,0.00016645889,0.0031802435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008871603,0.00025100575,0.000079526195,0.00003088689,0.00003448529,2.2521832e-7,0.00021832106,0.0000029386792,0.019085843,0.95196724,0.026766263,0.0015543636],"study_design_scores_gemma":[0.0010778748,0.00006453389,0.0026444157,0.00004648227,0.00010350863,0.00003636068,0.00022702063,0.0011921572,0.03975173,0.7380159,0.216169,0.0006710612],"about_ca_topic_score_codex":0.000007591136,"about_ca_topic_score_gemma":0.000005428341,"teacher_disagreement_score":0.21395141,"about_ca_system_score_codex":0.000034081197,"about_ca_system_score_gemma":0.000020094383,"threshold_uncertainty_score":0.9993769},"labels":[],"label_agreement":null},{"id":"W2970059119","doi":"10.1109/icip.2019.8803602","title":"Point Cloud Denoising Based on Tensor Tucker Decomposition","year":2019,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Tucker decomposition; Tensor (intrinsic definition); Point cloud; Thresholding; Noise reduction; Laplacian matrix; Computer science; Gaussian noise; Noise (video); Algorithm; Point (geometry); Mathematics; Tensor decomposition; Laplace operator; Artificial intelligence; Mathematical analysis; Geometry; Image (mathematics)","score_opus":0.026172830167646488,"score_gpt":0.3229735169913719,"score_spread":0.2968006868237254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970059119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84939605,0.0000029424666,0.06461629,0.0035503479,0.00016749029,0.0005875123,0.000011464794,0.00040787604,0.08126005],"genre_scores_gemma":[0.9560063,4.5709686e-7,0.038752202,0.0024125164,0.000077725956,0.000024078181,0.000020886218,0.00002721157,0.0026786327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991567,0.00003884835,0.00022209693,0.00022745362,0.00018716393,0.00016773134],"domain_scores_gemma":[0.99910396,0.00027085756,0.00007045652,0.00041488704,0.00006689596,0.00007295507],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000127701,0.00012374781,0.00014916486,0.0000835788,0.000087784814,0.000048188627,0.00010600899,0.000060033904,0.002281754],"category_scores_gemma":[0.00001969076,0.00010505526,0.00009343547,0.000118688615,0.000015177266,0.000061084094,0.000015984342,0.00010627049,0.002508162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009791412,0.0009399823,0.0015361239,0.00007495215,0.000032044598,0.000005226139,0.0001293024,0.00046520474,0.058079146,0.8926912,0.044837162,0.0011117265],"study_design_scores_gemma":[0.008788581,0.0010097947,0.024570206,0.0006498331,0.00025357277,0.00012980642,0.0008577449,0.1805375,0.22802289,0.5047344,0.047890507,0.0025551936],"about_ca_topic_score_codex":0.0000047410126,"about_ca_topic_score_gemma":0.00000263149,"teacher_disagreement_score":0.38795683,"about_ca_system_score_codex":0.000056467892,"about_ca_system_score_gemma":0.000013762877,"threshold_uncertainty_score":0.9986303},"labels":[],"label_agreement":null},{"id":"W2972517792","doi":"10.1515/forum-2019-0275","title":"On hyperquadrics containing projective varieties","year":2020,"lang":"en","type":"preprint","venue":"Forum Mathematicum","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Research Foundation of Korea","keywords":"Variety (cybernetics); Mathematics; Codimension; Projective variety; Lemma (botany); Pure mathematics; Projective space; Degree (music); Fano plane; Generalization; Twisted cubic; Quadratic equation; Projective test; Combinatorics; Discrete mathematics; Mathematical analysis; Complex projective space; Geometry; Physics","score_opus":0.08712281804060903,"score_gpt":0.3454514891998677,"score_spread":0.2583286711592586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972517792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08894224,0.00014799752,0.6185908,0.028068434,0.001496614,0.008603459,0.0007333865,0.004152037,0.24926504],"genre_scores_gemma":[0.8936826,0.000011121737,0.10062312,0.0015967662,0.00025442892,0.001304922,0.0001739176,0.00020639623,0.002146704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977479,0.00008318262,0.0006764449,0.00061797927,0.0004830596,0.00039146128],"domain_scores_gemma":[0.997245,0.0009966921,0.00058087957,0.00086480693,0.00016632158,0.00014626124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024383595,0.00048800453,0.00078049675,0.00014254946,0.00022696829,0.00018826578,0.0005214285,0.00033251566,0.00019891736],"category_scores_gemma":[0.0006919283,0.00043890913,0.00031948206,0.0001684513,0.00007895502,0.000055316814,0.0005741677,0.00093279866,0.00038569683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030955576,0.00028304785,0.000006900735,0.000755068,0.00013420546,0.000008167033,0.0031597924,0.000021629794,0.000083043116,0.9685468,0.026791586,0.00017878534],"study_design_scores_gemma":[0.0002895505,0.00014248649,0.000011493665,0.0004544779,0.00013289675,0.000015374999,0.0018313385,0.0040672044,0.00054884807,0.99031687,0.0017273129,0.00046213175],"about_ca_topic_score_codex":0.000006174572,"about_ca_topic_score_gemma":0.00000341148,"teacher_disagreement_score":0.80474037,"about_ca_system_score_codex":0.00014103246,"about_ca_system_score_gemma":0.00011750609,"threshold_uncertainty_score":0.9998063},"labels":[],"label_agreement":null},{"id":"W2979740536","doi":"10.1145/3323926","title":"A Distributed Tensor-Train Decomposition Method for Cyber-Physical-Social Services","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Cyber-Physical Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; St. Francis Xavier University","funders":"","keywords":"Tensor (intrinsic definition); Decomposition; Computer science; Tensor decomposition; Representation (politics); Scale (ratio); Big data; Order (exchange); Interpretation (philosophy); Theoretical computer science; Distributed computing; Mathematics; Data mining; Pure mathematics; Geography; Ecology; Programming language; Cartography","score_opus":0.02929942267681448,"score_gpt":0.357332827020621,"score_spread":0.32803340434380657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979740536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40348253,0.0000069963935,0.58878964,0.0016646255,0.00034408126,0.0024333408,0.0019554598,0.0005783118,0.0007450138],"genre_scores_gemma":[0.98267144,0.000001571649,0.014063986,0.00017501849,0.0005768882,0.0012976141,0.0003776598,0.00010097301,0.00073483627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973638,0.00025970503,0.0005747465,0.0007459617,0.00050910556,0.00054669526],"domain_scores_gemma":[0.99645406,0.001842112,0.00030007862,0.00091908,0.0002737511,0.00021092981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002475358,0.0004599622,0.00083780393,0.00013782125,0.0005949653,0.00018351477,0.0005759484,0.00020908908,0.00004574497],"category_scores_gemma":[0.00001741449,0.00042491092,0.0006689541,0.0005499433,0.00005943945,0.0002549676,0.000014829182,0.00039612947,0.00048410505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011839168,0.0166824,0.000109096305,0.0034695342,0.002343271,0.0000114807,0.009997927,0.008590204,0.2801382,0.63081825,0.004920287,0.041735437],"study_design_scores_gemma":[0.015559631,0.0025154704,0.004304707,0.0013959304,0.003090423,0.00018006515,0.007869333,0.3571121,0.043657202,0.49208596,0.06691315,0.0053160186],"about_ca_topic_score_codex":0.00014371032,"about_ca_topic_score_gemma":0.00002529313,"teacher_disagreement_score":0.57918894,"about_ca_system_score_codex":0.00020030567,"about_ca_system_score_gemma":0.0000318988,"threshold_uncertainty_score":0.9998203},"labels":[],"label_agreement":null},{"id":"W2981420153","doi":"10.1111/1365-2478.12894","title":"Random noise attenuation via the randomized canonical polyadic decomposition","year":2019,"lang":"en","type":"article","venue":"Geophysical Prospecting","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Singular value decomposition; Rank (graph theory); Noise (video); Tensor (intrinsic definition); Algorithm; Noise reduction; Low-rank approximation; Mathematics; Matrix decomposition; Computer science; Filter (signal processing); Artificial intelligence; Physics; Geometry","score_opus":0.014226423740965796,"score_gpt":0.3005228603434406,"score_spread":0.28629643660247484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981420153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9471951,0.00002451052,0.04051272,0.003202225,0.00021176605,0.0021782143,0.0000047387016,0.0002691831,0.0064015235],"genre_scores_gemma":[0.9952221,0.0000019864578,0.0031664406,0.00030464696,0.0003490522,0.0002397584,0.000017002913,0.000028724451,0.00067031273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984351,0.0002153655,0.00044965625,0.00031784826,0.00031176646,0.00027027357],"domain_scores_gemma":[0.99734044,0.0018223108,0.0002408282,0.0004187895,0.0001053795,0.00007224437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063667534,0.00017524733,0.0004641557,0.00003748529,0.0003334127,0.00008692945,0.00019603044,0.00006682866,0.00018066072],"category_scores_gemma":[0.00019352019,0.00011840502,0.00029642487,0.00023615923,0.000104992396,0.000120659424,0.000058253187,0.00031591294,0.00076566567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010981873,0.0010152988,0.0012117653,0.000121157595,0.00030544528,0.0000043139403,0.0016349196,0.00021187172,0.13601771,0.8413021,0.0016606104,0.0055329595],"study_design_scores_gemma":[0.13789552,0.00011156331,0.0064912653,0.0001288308,0.00041151393,0.00006620049,0.00022111184,0.06788365,0.009844506,0.7756979,0.0004972174,0.0007507455],"about_ca_topic_score_codex":0.000075162505,"about_ca_topic_score_gemma":0.000008383681,"teacher_disagreement_score":0.12691365,"about_ca_system_score_codex":0.0000747999,"about_ca_system_score_gemma":0.000026149786,"threshold_uncertainty_score":0.98413384},"labels":[],"label_agreement":null},{"id":"W2988137070","doi":"10.1002/nla.2297","title":"Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Acceleration; Mathematics; Gradient descent; Nonlinear system; Conjugate gradient method; Robustness (evolution); Tensor (intrinsic definition); Nonlinear conjugate gradient method; Mathematical optimization; Line search; Applied mathematics; Algorithm; Rate of convergence; Computer science; Artificial intelligence; Geometry; Key (lock)","score_opus":0.03470059674419496,"score_gpt":0.3201134359785043,"score_spread":0.2854128392343093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988137070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07140324,0.000012469339,0.9209508,0.0056696017,0.00001216917,0.0015581966,0.00008107878,0.00018514058,0.00012734282],"genre_scores_gemma":[0.6196093,0.000004266674,0.378618,0.00041165145,0.0001424894,0.0010783939,0.00006400765,0.000035478886,0.00003643614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855477,0.000045908746,0.00050351,0.0004360024,0.00024559407,0.00021422846],"domain_scores_gemma":[0.9984966,0.00052985665,0.0002810334,0.00022063602,0.00028591062,0.00018597045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009352371,0.00019734683,0.00031233797,0.000043191492,0.00028585555,0.00005549329,0.00016096442,0.00008499203,0.0000605116],"category_scores_gemma":[0.00008398619,0.0001790603,0.00007333384,0.00038337227,0.00006323574,0.00013049944,0.000040131683,0.00016190842,0.000011001994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004849272,0.0009270637,0.00084863143,0.00042059398,0.00018772575,0.0000010679479,0.00049323036,0.0007946434,0.07734317,0.9106843,0.0016280526,0.0061865984],"study_design_scores_gemma":[0.008351467,0.0037818174,0.006013777,0.00021764859,0.0009811107,0.00018327875,0.0012319435,0.70110786,0.07738822,0.16837822,0.03034116,0.0020235002],"about_ca_topic_score_codex":0.000014361781,"about_ca_topic_score_gemma":0.000010177507,"teacher_disagreement_score":0.74230605,"about_ca_system_score_codex":0.00003854425,"about_ca_system_score_gemma":0.000055443244,"threshold_uncertainty_score":0.7301867},"labels":[],"label_agreement":null},{"id":"W2996814955","doi":"10.18280/ria.330611","title":"A Nonlinear Tensor-Based Machine Learning Algorithm for Image Classification","year":2019,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Beijing Union University","keywords":"Artificial intelligence; Computer science; Tensor (intrinsic definition); Pattern recognition (psychology); Nonlinear system; Image (mathematics); Machine learning; Algorithm; Computer vision; Mathematics; Physics; Geometry","score_opus":0.07057550152249059,"score_gpt":0.33823635606169455,"score_spread":0.26766085453920396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996814955","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022221578,0.000033492845,0.9725048,0.0012938975,0.00011102384,0.0009588649,0.00007870476,0.00023663908,0.0025609983],"genre_scores_gemma":[0.36752057,0.000019697642,0.61929244,0.00026007634,0.00017423186,0.00031249184,0.00027939866,0.00008217407,0.0120589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878407,0.000043134958,0.000426005,0.00036721048,0.00012889039,0.00025066835],"domain_scores_gemma":[0.9985286,0.0005319174,0.00018340912,0.0004549616,0.00022510166,0.00007600211],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003103426,0.0001551608,0.00021414542,0.00009657868,0.00018004814,0.000061693274,0.00021803443,0.00008146413,0.0006316355],"category_scores_gemma":[0.00014315562,0.00015348392,0.00015512729,0.00025617075,0.000048940274,0.00008231689,0.000022077367,0.00019266889,0.0013662815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016231106,0.003611711,0.0014980233,0.0010180861,0.00013892255,0.000010849348,0.0018949342,0.009518471,0.36891392,0.21296299,0.0073420843,0.39292768],"study_design_scores_gemma":[0.000108452026,0.00009602732,0.000014961937,0.000040151008,0.00002041682,0.0000067687406,0.0003472673,0.9136213,0.04968785,0.0067461254,0.029127723,0.00018293604],"about_ca_topic_score_codex":0.000006088562,"about_ca_topic_score_gemma":0.0000023283271,"teacher_disagreement_score":0.90410286,"about_ca_system_score_codex":0.00004566434,"about_ca_system_score_gemma":0.000027383576,"threshold_uncertainty_score":0.9994113},"labels":[],"label_agreement":null},{"id":"W3000659041","doi":"10.1186/s12859-019-3312-5","title":"Optimization and expansion of non-negative matrix factorization","year":2020,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Institute for Cancer Research","funders":"Natural Sciences and Engineering Research Council of Canada; Prostate Cancer Canada; Government of Ontario; Canadian Institutes of Health Research; Ontario Genomics; Genome Canada; Government of Canada; Ontario Institute for Cancer Research; Ontario Genomics Institute; Movember Foundation","keywords":"Non-negative matrix factorization; Computer science; Matrix (chemical analysis); Matrix decomposition; Computational biology; Biology; Mathematics; Physics; Chemistry","score_opus":0.044048035217136294,"score_gpt":0.30938569971251123,"score_spread":0.26533766449537494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000659041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015877264,0.000004954021,0.9825208,0.00018643976,0.00002086657,0.0003210225,0.000036479367,0.00006918265,0.00096295855],"genre_scores_gemma":[0.20856601,0.000019033781,0.7912152,0.0000961863,0.00002364821,0.000008960129,0.00003509957,0.000010337954,0.000025558253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993037,0.000013288761,0.00038907677,0.000073029376,0.00014259372,0.0000783061],"domain_scores_gemma":[0.9993095,0.000138256,0.00024850864,0.00012190249,0.00010614249,0.00007571387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056019755,0.000092184964,0.00015430966,0.00004506541,0.000058645943,0.000023345288,0.00007005116,0.00006096328,0.00004683788],"category_scores_gemma":[0.00014654879,0.00008297893,0.000033123684,0.00020352328,0.00003655343,0.00021055428,0.000037512564,0.00005379953,0.000013914446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005016463,0.0009955904,0.0112472195,0.014832122,0.00037797747,0.0000023707098,0.15639521,0.2337619,0.028745532,0.5002096,0.03303947,0.019891284],"study_design_scores_gemma":[0.00045657335,0.000056344965,0.00033283647,0.000030150826,0.000027678148,0.0000018486179,0.0010827935,0.9906546,0.004343929,0.0028146575,0.00008848124,0.0001101331],"about_ca_topic_score_codex":0.0000014136815,"about_ca_topic_score_gemma":5.054037e-7,"teacher_disagreement_score":0.7568927,"about_ca_system_score_codex":0.000010685833,"about_ca_system_score_gemma":0.000026263657,"threshold_uncertainty_score":0.33837825},"labels":[],"label_agreement":null},{"id":"W3008797530","doi":"10.1109/access.2020.2977050","title":"Tensor Completion Methods for Collaborative Intelligence","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Science and Engineering Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tensor (intrinsic definition); Deep learning; Feature (linguistics); Artificial intelligence; Cloud computing; Enhanced Data Rates for GSM Evolution; Pattern recognition (psychology); Big data; Workload; Data mining; Machine learning; Algorithm; Mathematics; Geometry","score_opus":0.32479351335010836,"score_gpt":0.519641986399115,"score_spread":0.1948484730490066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008797530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051912777,0.000016722639,0.98347384,0.009115936,0.0000906712,0.0006923918,0.00006780448,0.00014861331,0.0012027693],"genre_scores_gemma":[0.2758289,0.000010390447,0.7186973,0.0046363603,0.00023628592,0.00044480787,0.000023332246,0.000029678682,0.00009295101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932015,0.000064725726,0.00022648534,0.00020031101,0.000072931805,0.000115400435],"domain_scores_gemma":[0.9986987,0.00061571086,0.00010939932,0.00015462666,0.00033725513,0.000084275125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013345342,0.000092076436,0.00017457276,0.000026393287,0.00011442879,0.0000854761,0.00029520434,0.000040568222,0.00011595619],"category_scores_gemma":[0.00023021591,0.00008484641,0.000046961388,0.00041446043,0.000030099309,0.00013247247,0.000028198123,0.00006688066,0.000051285933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019780442,0.00035998342,0.00014532919,0.00034353422,0.000130891,0.0000016596451,0.0037097011,0.0003343713,0.0705893,0.7186972,0.14403655,0.061453708],"study_design_scores_gemma":[0.00058097363,0.00013632898,0.00029500513,0.00003298647,0.00010448392,0.0000046512328,0.0006574191,0.037649114,0.28106982,0.52850854,0.15048836,0.00047232263],"about_ca_topic_score_codex":0.0000026613393,"about_ca_topic_score_gemma":0.0000032018022,"teacher_disagreement_score":0.27063763,"about_ca_system_score_codex":0.000017039476,"about_ca_system_score_gemma":0.0000227928,"threshold_uncertainty_score":0.34599364},"labels":[],"label_agreement":null},{"id":"W3008903234","doi":"10.4230/lipics.ccc.2020.35","title":"Geometric Rank of Tensors and Subrank of Matrix Multiplication","year":2020,"lang":"en","type":"preprint","venue":"UvA-DARE (University of Amsterdam)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Rank (graph theory); Mathematics; Strassen algorithm; Combinatorics; Matrix multiplication; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.04372526490211509,"score_gpt":0.2836267991078776,"score_spread":0.2399015342057625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008903234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96089536,0.00016790681,0.034150977,0.0016069809,0.000044656837,0.00080799276,0.0008088238,0.00008803402,0.0014292727],"genre_scores_gemma":[0.9612412,0.00015833497,0.03807409,0.000013761971,0.00001869392,0.000001314375,0.00010149075,0.000020714248,0.0003704378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99877053,0.00006767581,0.00037000835,0.00038009117,0.00028590977,0.00012575509],"domain_scores_gemma":[0.997761,0.0002849457,0.00089049124,0.00059434806,0.00036821226,0.00010099831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014336864,0.0001966141,0.00067126274,0.0004557721,0.000072613075,0.000008625849,0.00045210533,0.00023370607,0.00015924765],"category_scores_gemma":[0.000079844445,0.00024566057,0.00024171312,0.00048784915,0.00022193206,0.00007529444,0.00052400003,0.00025304774,0.000011081963],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003883023,0.00870352,0.053032678,0.073549815,0.0066002966,0.00011357685,0.08131264,0.0017986597,0.27673206,0.32078454,0.06673495,0.10675425],"study_design_scores_gemma":[0.022401737,0.0014437806,0.57926357,0.0048564477,0.0067977183,0.00009347106,0.0343707,0.028130423,0.04401908,0.25592867,0.017767657,0.0049267593],"about_ca_topic_score_codex":0.00018988899,"about_ca_topic_score_gemma":0.000018476485,"teacher_disagreement_score":0.5262309,"about_ca_system_score_codex":0.0000386416,"about_ca_system_score_gemma":0.00005380626,"threshold_uncertainty_score":0.9999996},"labels":[],"label_agreement":null},{"id":"W3010021662","doi":"10.1038/s41598-020-60884-9","title":"Author Correction: Speed-dependent and mode-dependent modulations of spatiotemporal modules in human locomotion extracted via tensor decomposition","year":2020,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Rehabilitation Institute; University Health Network","funders":"","keywords":"Decomposition; Tensor decomposition; Tensor (intrinsic definition); Computer science; Mode (computer interface); Biological system; Biology; Mathematics; Human–computer interaction; Pure mathematics; Ecology","score_opus":0.049647368760940044,"score_gpt":0.34054069931525466,"score_spread":0.2908933305543146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010021662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94270724,0.000014216906,0.054012615,0.0010865913,0.00087279675,0.0007210172,0.00001581569,0.00014934195,0.00042037485],"genre_scores_gemma":[0.99305654,9.2308113e-7,0.005814766,0.00002063316,0.00006177763,0.000030241896,0.00016746848,0.00002309618,0.00082452927],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759555,0.00008865489,0.0009650298,0.00065467606,0.00050416373,0.00019192956],"domain_scores_gemma":[0.9984466,0.000054678938,0.0005819829,0.00049005885,0.00026333344,0.00016338233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053208985,0.0001727921,0.00028862458,0.0002461765,0.0003064745,0.00013345137,0.00009817177,0.00010670418,0.00015500929],"category_scores_gemma":[0.00009460742,0.00018117654,0.00007980491,0.00046258443,0.0001381078,0.00028010012,0.000060388047,0.00018117171,0.00000883375],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045715155,0.0013875494,0.015560263,0.0001947758,0.000052495314,0.00012509375,0.0030077733,0.011206322,0.94937736,0.0061795325,0.0084445,0.0044186073],"study_design_scores_gemma":[0.0013358222,0.0002060213,0.080056675,0.00024239748,0.00017028692,0.00072866696,0.0006606822,0.37657097,0.2387147,0.29947317,0.0009182561,0.0009223675],"about_ca_topic_score_codex":0.00008115567,"about_ca_topic_score_gemma":0.00011163397,"teacher_disagreement_score":0.71066266,"about_ca_system_score_codex":0.0000758444,"about_ca_system_score_gemma":0.000033913977,"threshold_uncertainty_score":0.7388165},"labels":[],"label_agreement":null},{"id":"W3011285915","doi":"10.1016/j.jcta.2019.105190","title":"The partition rank of a tensor and k-right corners in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math>","year":2020,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Partition (number theory); Combinatorics; Rank (graph theory); Discrete mathematics","score_opus":0.01948802082768114,"score_gpt":0.2484689187412446,"score_spread":0.22898089791356346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011285915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5414868,0.0011135282,0.0007625414,0.0025397602,0.004308172,0.000072973904,0.00029941316,0.00016492815,0.44925186],"genre_scores_gemma":[0.9898454,0.0019597185,0.001903568,0.0013719994,0.0028024483,0.00076712656,0.00038235512,0.00069806434,0.0002693268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9900302,0.00091010146,0.0029779612,0.0013511259,0.0026704744,0.0020601016],"domain_scores_gemma":[0.9896075,0.0027957312,0.0038427315,0.0020575891,0.00038242879,0.0013140102],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033741563,0.0008997054,0.0005251543,0.000558919,0.0018067266,0.0016984296,0.0023525099,0.002175475,0.5013272],"category_scores_gemma":[0.0022964622,0.0015698752,0.0019445221,0.0014303868,0.0023588557,0.001865099,0.0014303116,0.0022595138,0.00080822856],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053136963,0.00042686876,0.000011433345,0.0010274693,0.0016018288,0.0010470472,0.003553734,0.00054019276,0.0026452756,0.7290144,0.25404838,0.0007696908],"study_design_scores_gemma":[0.0056218714,0.0027546308,0.00011486046,0.0016947059,0.0022141167,0.0027542654,0.006359453,0.008379348,0.9541298,0.006472547,0.007899631,0.0016047525],"about_ca_topic_score_codex":0.0004538122,"about_ca_topic_score_gemma":0.00045409883,"teacher_disagreement_score":0.95148456,"about_ca_system_score_codex":0.000024256522,"about_ca_system_score_gemma":0.0018126179,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W3012129924","doi":"10.48550/arxiv.2003.05101","title":"Tensorized Random Projections","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Random projection; Projection (relational algebra); Dimension (graph theory); Rank (graph theory); Gaussian; Tensor (intrinsic definition); Distortion (music); Random matrix; Algorithm; Mathematics; Computer science; Decomposition; Euclidean geometry; Combinatorics; Geometry; Physics","score_opus":0.1888783030525406,"score_gpt":0.24979311228992346,"score_spread":0.06091480923738285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012129924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31842262,0.000034794328,0.6310402,0.0026231937,0.00062315335,0.002581123,0.0003217442,0.0020062781,0.042346917],"genre_scores_gemma":[0.99020094,0.000077450335,0.004143346,0.00014336884,0.00016149943,0.00001105914,0.00006119672,0.000040855346,0.0051602833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986609,0.00011453791,0.0002394501,0.00070574717,0.00006880447,0.00021056671],"domain_scores_gemma":[0.9984845,0.0002322849,0.00024034787,0.0007135642,0.00015817597,0.00017114705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009844444,0.00026647985,0.0004134356,0.00014283322,0.00021027363,0.000054222397,0.00045974943,0.0002433722,0.0002681961],"category_scores_gemma":[0.0001045547,0.0002985946,0.0003392893,0.0004091383,0.000087453795,0.00006602846,0.00038540742,0.00061024335,0.00033008985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023123424,0.00038538585,0.00021580058,0.00021521196,0.0003310255,0.00011153292,0.0003077377,0.003443979,0.0006430365,0.9678908,0.02612913,0.00009512619],"study_design_scores_gemma":[0.002711808,0.00003254254,0.00019872715,0.0000818628,0.0005227476,0.000010508174,0.00022730751,0.044939343,0.00023409356,0.9393924,0.0110582085,0.0005904644],"about_ca_topic_score_codex":0.00003625252,"about_ca_topic_score_gemma":0.000016766977,"teacher_disagreement_score":0.6717783,"about_ca_system_score_codex":0.00011722858,"about_ca_system_score_gemma":0.00010944102,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W301566927","doi":"10.1016/j.laa.2015.04.015","title":"Optimization on the Hierarchical Tucker manifold – Applications to tensor completion","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Subspace topology; Mathematics; Conjugate gradient method; Overfitting; Mathematical optimization; Manifold (fluid mechanics); Algorithm; Scalability; Optimization problem; Gradient descent; Computer science; Theoretical computer science; Artificial intelligence; Artificial neural network","score_opus":0.08230579605464176,"score_gpt":0.3296400954964969,"score_spread":0.24733429944185514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W301566927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018969595,0.000074732096,0.9240396,0.038992804,0.000040536554,0.0047031664,0.00019382259,0.00048393352,0.012501778],"genre_scores_gemma":[0.85435504,0.000073005314,0.121256545,0.007960528,0.0009627057,0.011687473,0.00038240728,0.00012448127,0.0031978372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986493,0.000067150846,0.00035879368,0.00040781093,0.00029106968,0.00022589689],"domain_scores_gemma":[0.9982995,0.00041065985,0.00010674705,0.00058939593,0.00027951028,0.00031422242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025684782,0.00019388317,0.00018824682,0.00011109045,0.0004727075,0.00008149949,0.00028909624,0.00009111609,0.0001272984],"category_scores_gemma":[0.000102110214,0.00014858879,0.00005915839,0.0005397072,0.000053371565,0.00007090494,0.0000825075,0.00021336842,0.0007603188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011742355,0.00022376138,0.00001857442,0.000010495807,0.00001557523,1.4645126e-7,0.00015363439,0.0005149886,0.00034369357,0.9885709,0.00935933,0.000777122],"study_design_scores_gemma":[0.00094970415,0.00018956154,0.0008871443,0.000039703173,0.00014220938,0.000046253484,0.0005392682,0.05575865,0.001200814,0.25368127,0.6858504,0.0007150266],"about_ca_topic_score_codex":0.0000031446148,"about_ca_topic_score_gemma":0.000003550567,"teacher_disagreement_score":0.83538544,"about_ca_system_score_codex":0.000043345615,"about_ca_system_score_gemma":0.000034009165,"threshold_uncertainty_score":0.9772614},"labels":[],"label_agreement":null},{"id":"W3016369572","doi":"10.1109/ojcoms.2020.2987543","title":"A Tensor Based Framework for Multi-Domain Communication Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tensor (intrinsic definition); Theoretical computer science; Distributed computing; Topology (electrical circuits); Mathematics","score_opus":0.3011576138005281,"score_gpt":0.43455081353152736,"score_spread":0.13339319973099928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016369572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057080365,0.000612488,0.8753108,0.11568529,0.00015799757,0.0019649975,0.000117781114,0.000045837558,0.00039677726],"genre_scores_gemma":[0.29000652,0.0000993397,0.707381,0.0021931517,0.000057218836,0.00014216772,0.000005955317,0.000027802946,0.000086847394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983277,0.00047314074,0.0007331064,0.00011404171,0.00020772683,0.00014430353],"domain_scores_gemma":[0.99467283,0.001635878,0.0010663363,0.0018902277,0.00060956285,0.00012514647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010632003,0.00013604676,0.00032944998,0.000018183699,0.00093246053,0.00024555062,0.0051733917,0.00010985558,0.00001596687],"category_scores_gemma":[0.00046061917,0.00010110052,0.00048868364,0.0003603372,0.00020096012,0.0001949124,0.00044984368,0.00058252475,0.000008402845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114528804,0.0016326583,0.00051002833,0.00017449608,0.00059114624,2.7062293e-7,0.009868382,0.0010810596,0.004196978,0.7345741,0.24668829,0.0005680766],"study_design_scores_gemma":[0.008307254,0.00030308068,0.0008122381,0.0016840553,0.0008646594,0.000091119226,0.018433351,0.34906858,0.0017364173,0.29303363,0.32470453,0.00096109294],"about_ca_topic_score_codex":0.000007663195,"about_ca_topic_score_gemma":0.000004452226,"teacher_disagreement_score":0.44154045,"about_ca_system_score_codex":0.00010159526,"about_ca_system_score_gemma":0.00015638715,"threshold_uncertainty_score":0.9613535},"labels":[],"label_agreement":null},{"id":"W3016516060","doi":"10.3390/e22040467","title":"Weyl Prior and Bayesian Statistics","year":2020,"lang":"en","type":"article","venue":"Entropy","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Univariate; Prior probability; Gaussian; Applied mathematics; Statistical manifold; Manifold (fluid mechanics); Pure mathematics; Statistical inference; Metric (unit); Exponential family; Bayesian probability; Statistics; Multivariate statistics; Information geometry; Physics; Scalar curvature; Geometry","score_opus":0.03159040966157418,"score_gpt":0.3042446233928518,"score_spread":0.27265421373127763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016516060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07188476,0.000046048393,0.91089517,0.014353841,0.000041853895,0.00029730768,0.00014581752,0.00021916338,0.0021160399],"genre_scores_gemma":[0.73375124,0.000013638356,0.2644497,0.0012839219,0.00011384323,0.000012611044,0.0000114724335,0.000015497788,0.00034807558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966025,0.000012032425,0.00009593897,0.000095025665,0.00006406487,0.000072705516],"domain_scores_gemma":[0.9997057,0.00007280902,0.000031039275,0.000079737896,0.000016138578,0.00009458524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000017674101,0.000049046612,0.00007307393,0.000008288344,0.000053067808,0.000022684948,0.000043863376,0.000016957676,0.00034041723],"category_scores_gemma":[0.00004749183,0.000045661385,0.00001240367,0.00004064367,0.000020054067,0.00001900337,0.000017741882,0.000050815022,0.000097968325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004268823,0.00002660277,0.00020858114,0.000020555848,0.0000081535645,0.0000032600317,0.00037057442,3.188842e-7,0.0028239163,0.9495254,0.045608055,0.0014003101],"study_design_scores_gemma":[0.0018455453,0.00016607372,0.004708764,0.00002181437,0.00011393247,0.00002433972,0.0004007591,0.016037054,0.006186016,0.7414653,0.2285654,0.00046505872],"about_ca_topic_score_codex":8.615899e-7,"about_ca_topic_score_gemma":6.8096244e-7,"teacher_disagreement_score":0.6618665,"about_ca_system_score_codex":0.0000054935667,"about_ca_system_score_gemma":0.000006357065,"threshold_uncertainty_score":0.372733},"labels":[],"label_agreement":null},{"id":"W3016873192","doi":"10.48550/arxiv.1810.05846","title":"Nesterov Acceleration of Alternating Least Squares for Canonical Tensor Decomposition: Momentum Step Size Selection and Restart Mechanisms","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Acceleration; Gradient descent; Tensor (intrinsic definition); Line search; Robustness (evolution); Mathematics; Proximal Gradient Methods; Mathematical optimization; Convergence (economics); Algorithm; Computer science; Convex optimization; Regular polygon; Applied mathematics; Artificial intelligence; Physics; Artificial neural network; Geometry","score_opus":0.11269099910736664,"score_gpt":0.27506825403341545,"score_spread":0.16237725492604882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016873192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62509066,0.0000041745807,0.3736761,0.00013649368,0.000109794906,0.00064748514,0.000066809844,0.000088399975,0.00018012382],"genre_scores_gemma":[0.96375483,0.00002241307,0.035434213,0.000040472052,0.00012702789,0.00001759317,0.00005822046,0.00003333343,0.0005118941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986257,0.000092901595,0.00036309264,0.0006131295,0.000094616196,0.00021057577],"domain_scores_gemma":[0.9982678,0.00039994283,0.0004684689,0.0003622057,0.00040972666,0.0000918242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019692302,0.0002462661,0.00035118283,0.00013291361,0.00025509283,0.000073719275,0.00024464904,0.00023142266,0.000066025365],"category_scores_gemma":[0.00006808081,0.00028703344,0.0001434309,0.00015879626,0.00008067218,0.00014702286,0.00021847451,0.00021988685,0.000004974775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055941666,0.00074040686,0.0016324827,0.0011016771,0.00039921963,0.000012810264,0.00042491234,0.008188012,0.023861604,0.96053356,0.002181725,0.00036417673],"study_design_scores_gemma":[0.0021963327,0.00047831165,0.002171555,0.00040722569,0.0005679631,0.000027588767,0.0003935146,0.3738109,0.0120315375,0.60689723,0.00029434095,0.0007234736],"about_ca_topic_score_codex":0.000067348716,"about_ca_topic_score_gemma":0.0001468176,"teacher_disagreement_score":0.36562288,"about_ca_system_score_codex":0.00015653856,"about_ca_system_score_gemma":0.00007922109,"threshold_uncertainty_score":0.99995816},"labels":[],"label_agreement":null},{"id":"W3020586295","doi":"10.1109/tpds.2020.2990429","title":"aeSpTV: An Adaptive and Efficient Framework for Sparse Tensor-Vector Product Kernel on a High-Performance Computing Platform","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Supercomputer; Parallel computing; Leverage (statistics); FLOPS; Thread (computing); Kernel (algebra); Tensor (intrinsic definition); Sparse matrix; Tensor product; Computational science; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.07216470640477066,"score_gpt":0.2944106034335115,"score_spread":0.22224589702874084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020586295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38363457,0.000025352769,0.6141145,0.00043009064,0.00011519953,0.0008173862,0.0006980179,0.00014906829,0.000015776915],"genre_scores_gemma":[0.9908754,0.0000139993135,0.008534895,0.00012969869,0.00012871901,0.00020757584,0.000051391107,0.00002971366,0.00002855722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986119,0.000041749492,0.0003979983,0.0004858597,0.0001925905,0.00026988404],"domain_scores_gemma":[0.9988935,0.00034354496,0.00015291835,0.0002573999,0.0001035248,0.00024912885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013143409,0.0002536275,0.0003606481,0.000052636547,0.00047167967,0.00009835776,0.00010493393,0.00011280328,0.0000064207143],"category_scores_gemma":[0.00001778168,0.0002197932,0.000060948423,0.00019621801,0.00006882259,0.00007809139,0.0000021383732,0.0002581595,0.000014965973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021327464,0.0016814597,0.000065318505,0.0007966026,0.00028260812,0.00000672918,0.0023560445,0.854228,0.001206283,0.13207543,0.0011431421,0.004025598],"study_design_scores_gemma":[0.0022935066,0.0014875937,0.0011326494,0.00035300423,0.00016504941,0.000046330675,0.0014186358,0.9888932,0.0011680174,0.0019397425,0.0004801159,0.00062214234],"about_ca_topic_score_codex":0.00001797719,"about_ca_topic_score_gemma":0.0000023850841,"teacher_disagreement_score":0.60724086,"about_ca_system_score_codex":0.000044275625,"about_ca_system_score_gemma":0.000020697262,"threshold_uncertainty_score":0.89629066},"labels":[],"label_agreement":null},{"id":"W3023588015","doi":"10.1109/tfuzz.2020.2992634","title":"An Edge-Cloud-Aided High-Order Possibilistic c-Means Algorithm for Big Data Clustering","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cluster analysis; Autoencoder; Cloud computing; Computer science; Big data; Enhanced Data Rates for GSM Evolution; Algorithm; Data stream clustering; Data mining; CURE data clustering algorithm; Feature (linguistics); Correlation clustering; Computation; Artificial intelligence; Deep learning","score_opus":0.12452096412800735,"score_gpt":0.33112661588150877,"score_spread":0.20660565175350143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023588015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002308436,0.000023440401,0.989549,0.00079289166,0.0022906577,0.0014792848,0.0027310431,0.00054857024,0.00027670208],"genre_scores_gemma":[0.9278344,0.00001122032,0.06827912,0.0004064624,0.0017579078,0.00059223163,0.00024889363,0.00013029446,0.0007394657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979813,0.00011213531,0.0006105626,0.0006952567,0.00027919552,0.00032152273],"domain_scores_gemma":[0.9976998,0.000368359,0.00015902324,0.0012729914,0.00019589081,0.00030393104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023624592,0.0002770485,0.00040916077,0.00010280273,0.00039922737,0.00017894492,0.00063059956,0.00014257427,0.000029953264],"category_scores_gemma":[0.000021018883,0.0002731719,0.00010523639,0.0003814389,0.00004988476,0.00021800718,0.000004487093,0.00023514335,0.0001309835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007894634,0.010641042,0.000018388078,0.00617672,0.0027077163,0.00008040009,0.011395326,0.1551413,0.08215813,0.02405136,0.09507921,0.6117609],"study_design_scores_gemma":[0.0023352115,0.00044906558,0.000014336952,0.00015975993,0.00039953296,0.00004822294,0.0012411609,0.97858644,0.0018979213,0.0022420322,0.011861427,0.0007648827],"about_ca_topic_score_codex":0.00010889012,"about_ca_topic_score_gemma":0.00010118506,"teacher_disagreement_score":0.92552596,"about_ca_system_score_codex":0.00006881608,"about_ca_system_score_gemma":0.00006680988,"threshold_uncertainty_score":0.99997205},"labels":[],"label_agreement":null},{"id":"W3026289647","doi":"10.1007/978-3-030-45247-6_15","title":"An Introduction to the Waring Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Unione Matematica Italiana","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.02560291618424219,"score_gpt":0.26941303109454107,"score_spread":0.2438101149102989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026289647","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007269087,0.00024362562,0.18033493,0.68605834,0.0009814096,0.00873176,0.00048318578,0.00084111176,0.12159872],"genre_scores_gemma":[0.71895665,0.000024551973,0.18736893,0.007247569,0.004957237,0.00038278088,0.00033365778,0.00071696955,0.08001165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983193,0.000069745394,0.0006324395,0.0003793507,0.00042490184,0.00017422385],"domain_scores_gemma":[0.99750584,0.00023673176,0.00048270277,0.0015018152,0.00016945665,0.00010342512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025366354,0.00033791852,0.0004923813,0.00007891841,0.00023859863,0.000076083496,0.00085291226,0.00019436264,0.00039195467],"category_scores_gemma":[0.00020048527,0.00019333826,0.00022995048,0.00014055274,0.000096542564,0.000051629682,0.00016570791,0.00041921806,0.00017044855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012673409,0.000048179743,7.544588e-7,0.0006522618,0.00014129769,6.038666e-7,0.00071015075,0.0006324281,0.0021656335,0.97123593,0.023798,0.0006020903],"study_design_scores_gemma":[0.00011341451,0.000077268414,0.000011841458,0.00043618356,0.00037725823,0.000029022252,0.000027730623,0.00038430214,0.00530906,0.9332342,0.059652817,0.00034688239],"about_ca_topic_score_codex":0.000006141671,"about_ca_topic_score_gemma":0.00003341834,"teacher_disagreement_score":0.7182297,"about_ca_system_score_codex":0.00006413272,"about_ca_system_score_gemma":0.000030283221,"threshold_uncertainty_score":0.78841054},"labels":[],"label_agreement":null},{"id":"W3029815899","doi":"10.3390/a13060135","title":"A Recursive Least-Squares Algorithm for the Identification of Trilinear Forms","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Recursive least squares filter; Algorithm; Impulse response; Least-squares function approximation; Identification (biology); Impulse (physics); Rank (graph theory); Tensor (intrinsic definition); Mathematics; Computer science; Tensor decomposition; System identification; Rank condition; Mathematical optimization; Applied mathematics; Adaptive filter; Statistics; Data mining","score_opus":0.0642865499699324,"score_gpt":0.340926401923273,"score_spread":0.2766398519533406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029815899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018937885,0.00012512243,0.98901516,0.0073546222,0.000082860955,0.0009962135,0.00030084956,0.00008736625,0.00014399017],"genre_scores_gemma":[0.32251802,0.00018764204,0.6697142,0.0023679421,0.0012369285,0.0017462793,0.0002794029,0.00014931743,0.0018002552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904615,0.00002011943,0.0004379445,0.00018980008,0.00017263384,0.00013332695],"domain_scores_gemma":[0.99870175,0.00050422276,0.00025343182,0.0002676098,0.00021234584,0.000060644434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002006873,0.00010042487,0.00017603932,0.00002675612,0.00014081105,0.000027334012,0.00024740005,0.000050295024,0.00003794839],"category_scores_gemma":[0.00018560233,0.00007104587,0.00014264569,0.0002146471,0.00006538282,0.000074562966,0.00002707749,0.00008203014,0.000033019227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069842805,0.00043164345,0.000014072146,0.00016437718,0.00028828238,0.0000018404471,0.0043979683,0.000044244647,0.0069473963,0.26849073,0.034382228,0.68476737],"study_design_scores_gemma":[0.0021414359,0.0003468653,0.0002493482,0.000034309156,0.00032868923,0.000019978435,0.0036203298,0.6112204,0.06934293,0.23624018,0.07604502,0.00041051387],"about_ca_topic_score_codex":0.0000048994325,"about_ca_topic_score_gemma":0.0000010575541,"teacher_disagreement_score":0.68435687,"about_ca_system_score_codex":0.000013674802,"about_ca_system_score_gemma":0.000022070464,"threshold_uncertainty_score":0.28971663},"labels":[],"label_agreement":null},{"id":"W3033538417","doi":"10.1109/tii.2020.2999622","title":"Support Multimode Tensor Machine for Multiple Classification on Industrial Big Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Support vector machine; Computer science; Artificial intelligence; Machine learning; Context (archaeology); Big data; Data mining; Binary classification; Tensor (intrinsic definition); Data classification; Statistical classification; Feature extraction; Structured support vector machine; Pattern recognition (psychology); Contextual image classification; Image (mathematics); Mathematics","score_opus":0.4926474357201112,"score_gpt":0.36892885570776945,"score_spread":0.12371858001234176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033538417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0141004175,0.0000011911213,0.9652681,0.0058726086,0.0014923611,0.0030591562,0.008438209,0.00054654584,0.0012214096],"genre_scores_gemma":[0.97763544,0.000012319006,0.017124642,0.0019604613,0.0013084706,0.0004304878,0.0010711291,0.000085556814,0.0003714743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744153,0.000071788054,0.001294355,0.00034947653,0.00046484952,0.00037798943],"domain_scores_gemma":[0.9968338,0.0011279186,0.00048810814,0.0010583911,0.00016065862,0.00033110793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039394447,0.00036082775,0.00045310665,0.00020509498,0.00044459722,0.00014061322,0.0007257836,0.0005003738,0.000164003],"category_scores_gemma":[0.00036105278,0.00034098004,0.00018630113,0.00046890968,0.000084340885,0.00039362028,0.000008822159,0.00093553675,0.00027195385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005281658,0.0044668033,0.00012794661,0.00033885363,0.00091116986,0.0000044695553,0.005464157,0.016417608,0.0027740074,0.008975114,0.45321625,0.50202197],"study_design_scores_gemma":[0.019236147,0.0015959195,0.00001829958,0.00013511909,0.000605293,0.000016474598,0.0017711269,0.7617848,0.02034699,0.0010656381,0.19220966,0.0012145438],"about_ca_topic_score_codex":0.00002034763,"about_ca_topic_score_gemma":0.000020078814,"teacher_disagreement_score":0.9635351,"about_ca_system_score_codex":0.00011507013,"about_ca_system_score_gemma":0.00019505965,"threshold_uncertainty_score":0.9999042},"labels":[],"label_agreement":null},{"id":"W3033693759","doi":"10.18280/isi.250202","title":"A Novel Log-Based Tensor Completion Algorithm","year":2020,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hebei Province; Department of Education of Hebei Province; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Mathematics; Matrix norm; Rank (graph theory); Algorithm; Generalization; Function (biology); Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.05270963583783972,"score_gpt":0.28248854674855994,"score_spread":0.22977891091072022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033693759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015416627,0.000007889128,0.97702855,0.0013925874,0.00006612016,0.00048805613,0.00016573425,0.0005247307,0.0049097333],"genre_scores_gemma":[0.718948,0.000001952581,0.2773345,0.0030637009,0.00011815574,0.00013032038,0.00035692262,0.000021327389,0.000025115985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988163,0.000028359822,0.00055988115,0.00012722611,0.00026098455,0.00020721153],"domain_scores_gemma":[0.99897027,0.000113421,0.0002875389,0.00020548736,0.00028435313,0.000138911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014929955,0.00016459142,0.00021768422,0.00010454513,0.00024052268,0.0001465619,0.00017042231,0.00008987249,0.000155806],"category_scores_gemma":[0.00023030727,0.0001621263,0.00009347758,0.00036176073,0.00008678008,0.0007597465,0.000030687075,0.00013066932,0.0004248509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030146225,0.0009928929,0.0010888842,0.0029833426,0.0002938364,0.000008940774,0.026054038,0.0041876193,0.024707606,0.5134351,0.06729831,0.35864797],"study_design_scores_gemma":[0.0040632733,0.0003507151,0.0071792784,0.00025696369,0.0001318002,0.00009967084,0.0021825086,0.8427594,0.0063399044,0.05509668,0.08042612,0.0011137446],"about_ca_topic_score_codex":0.000014534451,"about_ca_topic_score_gemma":0.000001494441,"teacher_disagreement_score":0.8385717,"about_ca_system_score_codex":0.0001151014,"about_ca_system_score_gemma":0.000046515077,"threshold_uncertainty_score":0.6611319},"labels":[],"label_agreement":null},{"id":"W3036176725","doi":"10.1007/978-3-030-40794-0_9","title":"Tensor-Based Feature Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Information fusion and data science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Tensor (intrinsic definition); Feature (linguistics); Feature learning; Feature vector; Representation (politics); Computer science; Artificial intelligence; Transformation matrix; Matrix (chemical analysis); Rationality; Transformation (genetics); Pattern recognition (psychology); Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.07037117138720562,"score_gpt":0.32440874453539126,"score_spread":0.25403757314818565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036176725","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000120316145,0.00003275912,0.016375253,0.0073751155,0.00012600873,0.0005769667,0.0008175325,0.00041610937,0.97415996],"genre_scores_gemma":[0.083541736,0.0012755007,0.357578,0.040258113,0.0011177381,0.00010729125,0.029745288,0.00025003598,0.48612627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987941,0.00000625597,0.0002861427,0.00027843332,0.0005111116,0.00012396599],"domain_scores_gemma":[0.99862105,0.00009353105,0.0003045801,0.0006307303,0.00018487709,0.00016526369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031848028,0.00016378865,0.00016579256,0.00019347969,0.00048670836,0.00028817455,0.0006476406,0.00011934351,0.00032402668],"category_scores_gemma":[0.0002827526,0.00014095844,0.000027055326,0.0001215221,0.00024595147,0.0012975512,0.0004520967,0.00036270998,0.00043983536],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011187651,0.000010060792,0.000005467421,0.00009983063,0.0000041685653,0.000001291476,0.00020164116,0.000009045224,0.00018713892,0.9048148,0.076204635,0.01845076],"study_design_scores_gemma":[0.00019276925,0.000027113561,0.000034671168,0.00010207678,0.000017544722,0.000011776799,0.000058378697,0.016432704,0.0000324551,0.011346376,0.97153693,0.0002072274],"about_ca_topic_score_codex":0.0000013889498,"about_ca_topic_score_gemma":0.000001060789,"teacher_disagreement_score":0.8953323,"about_ca_system_score_codex":0.00002567164,"about_ca_system_score_gemma":0.00014313388,"threshold_uncertainty_score":0.5748118},"labels":[],"label_agreement":null},{"id":"W3037008335","doi":"10.1109/jiot.2020.3004826","title":"Edge–Cloud-Aided Differentially Private Tucker Decomposition for Cyber–Physical–Social Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Cyber-physical system; Decomposition; Enhanced Data Rates for GSM Evolution; Edge computing; Computer security; Distributed computing; Artificial intelligence; Operating system","score_opus":0.04923406306194937,"score_gpt":0.33332512771810346,"score_spread":0.2840910646561541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037008335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71771365,0.000013727178,0.27900594,0.0019501075,0.0005619259,0.00032599748,0.000022277056,0.000071702656,0.00033467574],"genre_scores_gemma":[0.9892615,0.0000030089252,0.008507897,0.00036766543,0.0015408596,0.000030780517,0.000010291895,0.000040286537,0.00023767292],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985621,0.00007441214,0.00063961855,0.00019779788,0.0003061708,0.00021989597],"domain_scores_gemma":[0.9985996,0.00019650767,0.00066105305,0.000115161936,0.00026596317,0.00016170397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017206899,0.00018499543,0.00042684848,0.000064575506,0.00013759824,0.00017422842,0.00039121573,0.000085729065,0.0000480326],"category_scores_gemma":[0.00006963178,0.00016450744,0.0003550105,0.00008979145,0.0000516659,0.00020898542,0.000041698517,0.00032117934,0.000026147429],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006115115,0.0010936889,0.00010373721,0.00065235747,0.00080845837,0.000015446303,0.018864993,0.000059836046,0.6168132,0.18000597,0.17883869,0.0021321704],"study_design_scores_gemma":[0.010245716,0.0017935889,0.0010300096,0.0015248631,0.0014816738,0.0008047839,0.0011428193,0.12213181,0.46560776,0.35906246,0.033238616,0.0019358791],"about_ca_topic_score_codex":0.000006571885,"about_ca_topic_score_gemma":4.499897e-7,"teacher_disagreement_score":0.2715479,"about_ca_system_score_codex":0.000061629056,"about_ca_system_score_gemma":0.000022010223,"threshold_uncertainty_score":0.6708419},"labels":[],"label_agreement":null},{"id":"W3037951614","doi":"10.1016/j.laa.2021.02.019","title":"The tensor rank problem over the quaternions","year":2021,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Quaternion; Rank (graph theory); Tensor (intrinsic definition); Simple (philosophy); Combinatorics; Upper and lower bounds; Symmetric tensor; Pure mathematics; Decomposition; Algebra over a field; Mathematical analysis; Geometry; Exact solutions in general relativity; Chemistry","score_opus":0.02683223370056843,"score_gpt":0.30756374178514645,"score_spread":0.28073150808457803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037951614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5210986,0.007927682,0.121816464,0.28117126,0.00047105207,0.010557084,0.0007634232,0.001648859,0.054545563],"genre_scores_gemma":[0.9277001,0.0020301593,0.016314872,0.003710992,0.0009569248,0.005253427,0.0001651678,0.000116461975,0.04375188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990843,0.000058684265,0.00027462575,0.00024635575,0.00014843671,0.00018759527],"domain_scores_gemma":[0.9983885,0.0006914548,0.000090161375,0.00058130844,0.00017033573,0.000078183395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016626775,0.00011924499,0.000113142516,0.000016909144,0.0011271177,0.00012277816,0.00022953395,0.000053673266,0.000118463126],"category_scores_gemma":[0.000061134444,0.00006936079,0.00007416291,0.00028981053,0.00009106635,0.00005083914,0.00008508793,0.00017738796,0.00018511617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019503489,0.000086863765,0.000049142578,0.000012692862,0.00003113286,3.3897888e-7,0.00014420763,0.0000016077075,0.0015411973,0.98654485,0.009231763,0.0023542487],"study_design_scores_gemma":[0.0002710098,0.000008145884,0.0018705304,0.000009466352,0.000070050315,0.000036661055,0.00026332948,0.0013050708,0.0016964581,0.23702903,0.7572935,0.0001466948],"about_ca_topic_score_codex":0.0000037608534,"about_ca_topic_score_gemma":0.000028675779,"teacher_disagreement_score":0.74951583,"about_ca_system_score_codex":0.000010257279,"about_ca_system_score_gemma":0.000037967504,"threshold_uncertainty_score":0.8668992},"labels":[],"label_agreement":null},{"id":"W3039070800","doi":"10.48550/arxiv.2007.01996","title":"On the Asymptotic Linear Convergence Speed of Anderson Acceleration, Nesterov Acceleration, and Nonlinear GMRES","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized minimal residual method; Mathematics; Preconditioner; Acceleration; Convergence (economics); Applied mathematics; Nonlinear system; Fixed point; Mathematical analysis; Linear system; Physics","score_opus":0.2062707078361858,"score_gpt":0.2569184581879256,"score_spread":0.05064775035173977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039070800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9503078,0.0000118092075,0.046035692,0.0019014735,0.000105667496,0.00064877985,0.00005636624,0.000102669095,0.00082973053],"genre_scores_gemma":[0.9977615,0.000112253205,0.0010937318,0.00033950247,0.00008237334,0.000001902408,0.000050386087,0.000024178209,0.00053416216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998803,0.000115135306,0.00029744516,0.0005372882,0.00010380827,0.00014327702],"domain_scores_gemma":[0.9982732,0.0004435903,0.0003477377,0.000594778,0.00023697013,0.000103729486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013602147,0.0002441379,0.0003120043,0.00008999396,0.00019587367,0.000079681085,0.00044173456,0.00017182744,0.00017662188],"category_scores_gemma":[0.00013505878,0.00021906421,0.00011373769,0.00026716583,0.00015431579,0.00016350158,0.00026773894,0.00037636334,0.00003633514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010446667,0.00027271977,0.0018691929,0.0002726347,0.00017153117,0.000016098196,0.00079652475,0.00802502,0.0015976314,0.9838789,0.0029555208,0.000039772953],"study_design_scores_gemma":[0.0014265818,0.00021529339,0.004764979,0.00029039348,0.00047532673,0.000007784379,0.0009518907,0.53243756,0.0081413975,0.4498938,0.0005528551,0.0008421085],"about_ca_topic_score_codex":0.000023815695,"about_ca_topic_score_gemma":0.000018249733,"teacher_disagreement_score":0.5339851,"about_ca_system_score_codex":0.000042517528,"about_ca_system_score_gemma":0.00007912609,"threshold_uncertainty_score":0.89331794},"labels":[],"label_agreement":null},{"id":"W3042374971","doi":"10.1093/bioinformatics/btaa488","title":"Factorized embeddings learns rich and biologically meaningful embedding spaces using factorized tensor decomposition","year":2020,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute; Institute for Research in Immunology and Cancer","funders":"Canadian Institutes of Health Research; Institut de Valorisation des Données; Canada First Research Excellence Fund; Canadian Institute for Advanced Research","keywords":"Representation (politics); Computer science; Tensor (intrinsic definition); Dimensionality reduction; Embedding; Curse of dimensionality; Rank (graph theory); Sample (material); Artificial intelligence; Multifactor dimensionality reduction; Matrix decomposition; Theoretical computer science; Pattern recognition (psychology); Gene; Mathematics; Biology","score_opus":0.08759766551448768,"score_gpt":0.35351002339032034,"score_spread":0.2659123578758327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042374971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7819094,0.000025131421,0.21491869,0.0013515935,0.000059543752,0.00048742877,0.00008489912,0.00044249077,0.0007207909],"genre_scores_gemma":[0.7182931,0.000028546234,0.28056946,0.00086876046,0.00013195189,0.000011645873,0.0000459076,0.000029459447,0.000021174239],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983827,0.000053470023,0.0006914491,0.00025161653,0.00027613572,0.00034463685],"domain_scores_gemma":[0.99856454,0.00032242358,0.00043399932,0.00019162182,0.00015320523,0.00033418587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000159928,0.00030364277,0.0004648637,0.00007564558,0.00031159917,0.0002534032,0.00021771113,0.00018487018,0.00014152464],"category_scores_gemma":[0.00038969648,0.00025441215,0.000111285866,0.00030169205,0.00008225903,0.0003746755,0.00013556505,0.00025416643,0.00006638919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012672193,0.0011102816,0.014248842,0.0046107196,0.0014876911,0.000045083612,0.15214095,0.0034616867,0.6657314,0.12004456,0.023973368,0.011878218],"study_design_scores_gemma":[0.0029619434,0.00042286282,0.0005296991,0.00015106474,0.00029638945,0.00006474439,0.007533985,0.96581316,0.006996482,0.005151428,0.008869844,0.001208415],"about_ca_topic_score_codex":0.000003421546,"about_ca_topic_score_gemma":4.4508752e-7,"teacher_disagreement_score":0.96235144,"about_ca_system_score_codex":0.000051763003,"about_ca_system_score_gemma":0.00002906341,"threshold_uncertainty_score":0.9999908},"labels":[],"label_agreement":null},{"id":"W3044908563","doi":"10.4171/dm/791","title":"Rost Multipliers of Lifted Kronecker Tensor Products","year":2020,"lang":"en","type":"article","venue":"Documenta Mathematica","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Kronecker delta; Tensor product; Kronecker product; Tensor (intrinsic definition); Pure mathematics; Algebra over a field; Physics","score_opus":0.06639058567454487,"score_gpt":0.3263655318449989,"score_spread":0.259974946170454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044908563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8890052,0.00012491118,0.022965519,0.043099254,0.00015271503,0.0039749094,0.0002579968,0.00080140115,0.039618112],"genre_scores_gemma":[0.81815106,0.000006863447,0.18040732,0.00053257734,0.00007312727,0.000093665265,0.000021743,0.000048708,0.00066495634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986032,0.00003598086,0.0005529017,0.00030086815,0.0002941404,0.00021290332],"domain_scores_gemma":[0.9988272,0.00018757538,0.00025090604,0.00046531527,0.000114193695,0.00015480611],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012679384,0.00018302305,0.00036077035,0.000047674108,0.00007333524,0.00003637475,0.00026695602,0.000055024753,0.0010395187],"category_scores_gemma":[0.00038797272,0.00015889853,0.000096039475,0.00030824242,0.000090828384,0.00012589511,0.00008320556,0.00011445942,0.0005026202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010494949,0.0016263105,0.00025220445,0.0016821927,0.00038451696,0.000011048181,0.011190908,0.0000071093987,0.27332622,0.5939451,0.115894124,0.0015753197],"study_design_scores_gemma":[0.00481342,0.00044345943,0.0006120309,0.0004292389,0.00082838535,0.00007470594,0.00470344,0.005378109,0.60302156,0.3270402,0.051095825,0.0015596261],"about_ca_topic_score_codex":0.0000017594058,"about_ca_topic_score_gemma":3.7453063e-7,"teacher_disagreement_score":0.32969534,"about_ca_system_score_codex":0.000020806012,"about_ca_system_score_gemma":0.000023933215,"threshold_uncertainty_score":0.99987364},"labels":[],"label_agreement":null},{"id":"W3047460132","doi":"10.1007/jhep11(2020)084","title":"Dual S-matrix bootstrap. Part I. 2D theory","year":2020,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Institut Périmètre de physique théorique; Simons Foundation","keywords":"Duality (order theory); Observable; Bootstrapping (finance); Dual (grammatical number); Convergence (economics); Symmetry (geometry)","score_opus":0.04286409814806524,"score_gpt":0.30422210195146304,"score_spread":0.2613580038033978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047460132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17345446,0.0002629268,0.81323683,0.0076401005,0.00048425718,0.0000955033,0.000055871722,0.00013963382,0.00463041],"genre_scores_gemma":[0.99069303,0.00004600764,0.0063754516,0.00090949895,0.0015867446,0.000002830015,0.000004756006,0.00002467006,0.00035702277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906033,0.000050063198,0.0004081226,0.00009551138,0.00025804914,0.00012794547],"domain_scores_gemma":[0.9989474,0.00020140084,0.00039950345,0.00014783061,0.00014760469,0.00015626157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011060445,0.00011611252,0.00026019156,0.000022601138,0.000069794194,0.00002890136,0.00016806314,0.00004496564,0.00014068269],"category_scores_gemma":[0.00003625914,0.00009604355,0.00018433304,0.00015163874,0.000039128983,0.00012439692,0.000027581073,0.00017807572,0.000023400013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030784693,0.00013739613,0.000004133265,0.000009954219,0.00007275455,0.000015430056,0.00013890363,0.00015034857,0.0010099337,0.96735734,0.029641632,0.0014314052],"study_design_scores_gemma":[0.0004500805,0.00009847806,0.000030089199,0.00001874666,0.00008781516,0.00004156716,0.00007942852,0.00007117452,0.008772988,0.96094173,0.029293213,0.00011467134],"about_ca_topic_score_codex":0.0000013445483,"about_ca_topic_score_gemma":3.935144e-7,"teacher_disagreement_score":0.81723857,"about_ca_system_score_codex":0.000018281075,"about_ca_system_score_gemma":0.000044471126,"threshold_uncertainty_score":0.39165422},"labels":[],"label_agreement":null},{"id":"W3080991741","doi":"10.48550/arxiv.2008.10766","title":"Channel-Directed Gradients for Optimization of Convolutional Neural Networks","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Computation; Discretization; Generalization; Benchmark (surveying); Smoothing; Channel (broadcasting); Mathematical optimization; Algorithm; Mathematics","score_opus":0.12898135070328254,"score_gpt":0.23293016385167029,"score_spread":0.10394881314838775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080991741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033934567,0.000014140337,0.96416396,0.00016516839,0.00021885436,0.0007391646,0.00026076735,0.00025220268,0.00025120145],"genre_scores_gemma":[0.99154025,0.00002832829,0.007481437,0.00004904427,0.00009652126,0.00000820925,0.0004940195,0.000026979196,0.0002752007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990372,0.000054121745,0.00024182272,0.0004500556,0.000050065075,0.00016674382],"domain_scores_gemma":[0.998731,0.00018868042,0.00036062856,0.00031096174,0.0003034644,0.00010523549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006447561,0.00018702475,0.00030487293,0.000096983335,0.00010353414,0.000014499649,0.00030589433,0.0002006826,0.000049017475],"category_scores_gemma":[0.000056784564,0.00022912704,0.00022142215,0.00026832116,0.000077020086,0.000055083197,0.00019048307,0.00021794009,0.0000030027375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006731669,0.00011119441,0.000053489654,0.00009083643,0.00008055128,0.0000027149,0.000044461987,0.88296825,0.000008536895,0.11506911,0.0014946241,0.000008911705],"study_design_scores_gemma":[0.0005573332,0.000027889735,0.000093608505,0.000032578817,0.00015651669,0.0000013015408,0.000025174464,0.90865743,0.000024789084,0.09020518,0.00003845588,0.0001797505],"about_ca_topic_score_codex":0.000009939165,"about_ca_topic_score_gemma":0.0000031153986,"teacher_disagreement_score":0.9576057,"about_ca_system_score_codex":0.00007450101,"about_ca_system_score_gemma":0.000037104113,"threshold_uncertainty_score":0.93435293},"labels":[],"label_agreement":null},{"id":"W3091528227","doi":"10.1109/lsp.2020.3028006","title":"A Complete Discriminative Tensor Representation Learning for Two-Dimensional Correlation Analysis","year":2020,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Discriminative model; Representation (politics); Tensor (intrinsic definition); Pattern recognition (psychology); Canonical correlation; Correlation; Linear discriminant analysis","score_opus":0.0880582341947177,"score_gpt":0.34963411800444544,"score_spread":0.26157588380972774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091528227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17831762,0.000008179261,0.8114948,0.009507514,0.000023002627,0.00034988427,0.00002418574,0.00016964928,0.00010511983],"genre_scores_gemma":[0.9673291,1.0817787e-7,0.029430816,0.0027038718,0.0001718104,0.00009441498,0.00017636559,0.000026736867,0.00006677114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873805,0.0000845564,0.00034295904,0.00037436193,0.0002730193,0.00018706427],"domain_scores_gemma":[0.99889094,0.0004363679,0.00030285263,0.00008950401,0.00018497212,0.00009534319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012911107,0.00015249991,0.00026154149,0.00012740737,0.0003831046,0.00009402438,0.00010877379,0.000036371228,0.000054415865],"category_scores_gemma":[0.000086645756,0.00014836856,0.00018154024,0.0006175749,0.00006881476,0.00019601597,0.000014549032,0.0001838503,0.000020475072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021859338,0.0001364982,0.0012351621,0.00017350286,0.00044458214,0.0000063397197,0.005168354,0.3929358,0.5812436,0.0017825686,0.008436671,0.008218356],"study_design_scores_gemma":[0.0008453026,0.00005419326,0.00092405046,0.000034938093,0.0007855797,0.000003801922,0.00029991995,0.9888692,0.003958422,0.0036935585,0.00026191096,0.00026912612],"about_ca_topic_score_codex":0.0000066609473,"about_ca_topic_score_gemma":0.0000017267031,"teacher_disagreement_score":0.7890115,"about_ca_system_score_codex":0.000040415525,"about_ca_system_score_gemma":0.00001949384,"threshold_uncertainty_score":0.60502946},"labels":[],"label_agreement":null},{"id":"W3092057726","doi":"10.1007/s11854-023-0289-9","title":"A note on Fourier restriction and nested Polynomial Wolff axioms","year":2023,"lang":"fr","type":"article","venue":"Journal d Analyse Mathématique","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Axiom; Conjecture; Mathematics; Fourier transform; Polynomial; Combinatorics; Range (aeronautics); Fourier series; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry; Engineering","score_opus":0.034076189972169386,"score_gpt":0.3339062749361032,"score_spread":0.2998300849639338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092057726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91291636,0.0004845307,0.02003615,0.060976777,0.0012482776,0.0005041982,0.00010877095,0.00032012624,0.0034047894],"genre_scores_gemma":[0.9214865,0.008440397,0.026270056,0.002253091,0.0043311887,0.0001103858,0.00008822047,0.00025110893,0.036769032],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974639,0.00035077703,0.0009189506,0.0003300943,0.0004583018,0.00047801613],"domain_scores_gemma":[0.9977159,0.00062453037,0.0006004594,0.00041783566,0.00021314593,0.00042816665],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009047082,0.0003369042,0.0004961369,0.00076363084,0.00059622945,0.00047985298,0.00020681495,0.00034365975,0.0004040713],"category_scores_gemma":[0.00034889972,0.00031649167,0.00030467537,0.0013233786,0.00010633666,0.00030287477,0.00007375492,0.00095958594,0.0010732545],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003576231,0.0018132076,0.00087389245,0.00079655816,0.0011954261,0.0013492346,0.010123928,0.0023080322,0.014634692,0.2444534,0.65265584,0.069438145],"study_design_scores_gemma":[0.006244082,0.0012944349,0.07125649,0.0031568254,0.0027564852,0.0069026025,0.004404458,0.33983132,0.002664211,0.31671983,0.2421169,0.0026523715],"about_ca_topic_score_codex":0.00005980734,"about_ca_topic_score_gemma":0.000038524107,"teacher_disagreement_score":0.41053897,"about_ca_system_score_codex":0.0002420798,"about_ca_system_score_gemma":0.00014659524,"threshold_uncertainty_score":0.9999287},"labels":[],"label_agreement":null},{"id":"W3113608201","doi":"","title":"High-dimensional quantile tensor regression","year":2020,"lang":"en","type":"article","venue":"CityU Scholars","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Shenzhen Research Institute, City University of Hong Kong; National Natural Science Foundation of China; City University of Hong Kong","keywords":"Quantile regression; Tensor (intrinsic definition); Regression; Econometrics; Quantile; Mathematics; Computer science; Statistics; Artificial intelligence; Pure mathematics","score_opus":0.07385700183305119,"score_gpt":0.3350480108015665,"score_spread":0.2611910089685153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113608201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98654175,0.00003873512,0.0018096513,0.009901956,0.00009239843,0.000210661,0.000038586364,0.0003147674,0.0010515061],"genre_scores_gemma":[0.9556959,0.000003263969,0.040951245,0.0027422658,0.00013883029,0.000021079184,0.000026051815,0.000025214678,0.0003960978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990479,0.00005073174,0.00022925949,0.00026379697,0.0002500255,0.00015828149],"domain_scores_gemma":[0.99923915,0.00010897667,0.00009272281,0.0002638908,0.00009762216,0.00019763794],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000109637534,0.0001222889,0.00017950818,0.000035683344,0.00019564595,0.000070764734,0.00018390633,0.00007774435,0.0008615876],"category_scores_gemma":[0.00026048336,0.00010345419,0.0000827676,0.00020144181,0.000037027232,0.00015360661,0.00007048676,0.00028185121,0.00084837753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010583648,0.00046582226,0.0020421408,0.000087563436,0.00006581551,0.000041922747,0.0003767537,0.000056710654,0.18157595,0.48340654,0.32786205,0.003912866],"study_design_scores_gemma":[0.007365753,0.00049936026,0.05532042,0.00052390026,0.00035409117,0.00016531203,0.0004913829,0.009345775,0.15928805,0.4741828,0.2899136,0.0025495375],"about_ca_topic_score_codex":0.000003040752,"about_ca_topic_score_gemma":7.154437e-7,"teacher_disagreement_score":0.05327828,"about_ca_system_score_codex":0.000017918457,"about_ca_system_score_gemma":0.000020241732,"threshold_uncertainty_score":0.9999296},"labels":[],"label_agreement":null},{"id":"W3120764419","doi":"10.1007/s11464-020-0884-3","title":"On intervals and sets of hypermatrices (tensors)","year":2020,"lang":"en","type":"article","venue":"Frontiers of Mathematics in China","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Interval (graph theory); Positive-definite matrix; Combinatorics; Order (exchange); Regular polygon; Extreme point; Set (abstract data type); Pure mathematics; Discrete mathematics; Geometry; Eigenvalues and eigenvectors; Physics","score_opus":0.03591064661656725,"score_gpt":0.305404374305912,"score_spread":0.26949372768934476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120764419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98399174,0.00014131474,0.0106698945,0.001352432,0.000032607983,0.00027630542,0.000046944006,0.000034171604,0.0034545718],"genre_scores_gemma":[0.83964604,0.00003491977,0.16017991,0.00007330692,0.000009064195,0.000008462437,0.0000022208867,0.000015518182,0.000030561892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990845,0.000028527855,0.0004822644,0.00013693245,0.00017117918,0.00009662334],"domain_scores_gemma":[0.9991887,0.00022653434,0.00028479635,0.00020786052,0.00003333757,0.00005873974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016506633,0.00011374521,0.00039736612,0.00009753572,0.000019266708,0.0000075981807,0.00018263457,0.00005495795,0.000025814556],"category_scores_gemma":[0.0003068791,0.00010035436,0.000065180495,0.00015981248,0.00007261006,0.0000464945,0.000049923514,0.000110565205,0.000004535396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118096505,0.0023052224,0.004282439,0.0040653297,0.00020921123,0.000009754223,0.03373792,0.00013954857,0.0047771684,0.8411012,0.10662823,0.0026258596],"study_design_scores_gemma":[0.0013523168,0.00025810837,0.0031966877,0.00032440206,0.000092218674,0.00001043196,0.0027666378,0.021091554,0.00937147,0.9608825,0.00034957626,0.000304136],"about_ca_topic_score_codex":0.0000023204682,"about_ca_topic_score_gemma":7.7983225e-7,"teacher_disagreement_score":0.14951001,"about_ca_system_score_codex":0.000010451623,"about_ca_system_score_gemma":0.000007812745,"threshold_uncertainty_score":0.40923318},"labels":[],"label_agreement":null},{"id":"W3121013072","doi":"10.1109/tits.2020.3044466","title":"Diagnosing Spatiotemporal Traffic Anomalies With Low-Rank Tensor Autoregression","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec","keywords":"Autoregressive model; Computer science; Data mining; Tensor (intrinsic definition); Data set; Artificial intelligence; Data modeling; Set (abstract data type); Rank (graph theory); Machine learning; Mathematics; Econometrics","score_opus":0.03737141860003043,"score_gpt":0.2958990533756125,"score_spread":0.25852763477558205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121013072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4310543,0.00006510638,0.56686103,0.00028650655,0.00050142355,0.0005482959,0.00019498853,0.00036092664,0.0001274144],"genre_scores_gemma":[0.99418426,0.0000835881,0.0036605957,0.00008401932,0.000078351106,0.00040541802,0.000120080746,0.000076583565,0.0013070819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975738,0.00013248663,0.0008668779,0.0005499733,0.00056798774,0.0003088586],"domain_scores_gemma":[0.9982901,0.00036560872,0.0002632982,0.0004895053,0.0004091143,0.0001823713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015444898,0.00035036026,0.00044142356,0.00021900772,0.00039943279,0.00013818366,0.00014703823,0.00017210226,0.000334496],"category_scores_gemma":[0.0000055351697,0.00030624898,0.00022010256,0.0005636144,0.00009002746,0.00022758813,2.4027827e-7,0.00030181897,0.00010181138],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014732328,0.012205639,0.003017289,0.003600054,0.0018677688,0.0008814831,0.021267053,0.8338141,0.021470292,0.05264623,0.0072504557,0.04050639],"study_design_scores_gemma":[0.0073909084,0.0014035018,0.0098166,0.008028533,0.0019420063,0.0006322865,0.02098347,0.046840265,0.87280434,0.0018380894,0.023584282,0.00473573],"about_ca_topic_score_codex":0.000037688576,"about_ca_topic_score_gemma":0.00035830584,"teacher_disagreement_score":0.85133404,"about_ca_system_score_codex":0.00011152843,"about_ca_system_score_gemma":0.000114408416,"threshold_uncertainty_score":0.99993896},"labels":[],"label_agreement":null},{"id":"W3126076084","doi":"","title":"Toward Rapid Automated Moment Tensor Solutions for Canada","year":2019,"lang":"en","type":"article","venue":"AGU Fall Meeting Abstracts","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Moment (physics); Computer science; Physics","score_opus":0.049830265706836,"score_gpt":0.292204787697876,"score_spread":0.24237452199104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126076084","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97861016,0.00003676324,0.00031111235,0.0038093259,0.0002852301,0.0009026431,0.00011112619,0.0006458224,0.015287812],"genre_scores_gemma":[0.9846164,0.000004025484,0.013539148,0.00040256587,0.00007245453,0.00013465385,0.000054399,0.000032319105,0.0011440073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863434,0.000022773862,0.00041580855,0.00026306027,0.00022680454,0.00043720688],"domain_scores_gemma":[0.99865,0.00053088623,0.0002069236,0.00031909964,0.00016103206,0.00013206303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029251727,0.00015664488,0.00021237887,0.000045478748,0.0002057899,0.00004257936,0.0001766695,0.000070587346,0.00002183535],"category_scores_gemma":[0.00017129841,0.00015267706,0.00007992212,0.00009852839,0.000017055881,0.000052165862,0.000036041158,0.00011243641,0.00010653925],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000862398,0.0012204039,0.0044682384,0.0010618988,0.0004679493,0.000027497099,0.0013852098,0.015537708,0.02938236,0.087457165,0.8559277,0.002977646],"study_design_scores_gemma":[0.008517327,0.00049990887,0.13437018,0.0011966415,0.0006269839,0.00018806581,0.0040026787,0.13502978,0.017111078,0.044153024,0.65067273,0.0036316186],"about_ca_topic_score_codex":0.0905306,"about_ca_topic_score_gemma":0.12094385,"teacher_disagreement_score":0.20525496,"about_ca_system_score_codex":0.00015735078,"about_ca_system_score_gemma":0.0001867691,"threshold_uncertainty_score":0.9155256},"labels":[],"label_agreement":null},{"id":"W3135491679","doi":"10.1016/j.bspc.2021.102523","title":"Higher order tensor decomposition for proportional myoelectric control based on muscle synergies","year":2021,"lang":"en","type":"article","venue":"Biomedical Signal Processing and Control","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Matrix decomposition; Tensor (intrinsic definition); Computer science; Curse of dimensionality; Kinematics; Factorization; Matrix (chemical analysis); Tucker decomposition; Control theory (sociology); Pattern recognition (psychology); Artificial intelligence; Mathematics; Control (management); Algorithm; Tensor decomposition","score_opus":0.018319409186574053,"score_gpt":0.2994295976742046,"score_spread":0.28111018848763053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135491679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01453604,0.00035153187,0.9656917,0.017995957,0.00006795856,0.00060533837,0.00012759276,0.00022474253,0.00039915487],"genre_scores_gemma":[0.9884672,0.0000022317656,0.00760356,0.0028877708,0.00027733116,0.00034887652,0.00008329422,0.000023670877,0.0003060481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862254,0.000066801345,0.00034439267,0.0003481772,0.00034793175,0.0002701376],"domain_scores_gemma":[0.99862343,0.0005834681,0.00013823104,0.000111284935,0.00037326643,0.00017030408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021104941,0.00016963559,0.0002780937,0.000085889755,0.00034956235,0.00010698854,0.00007627301,0.00012942786,0.00025196528],"category_scores_gemma":[0.000110360794,0.00013603907,0.0000885239,0.00027455753,0.00012937372,0.000060656927,0.000006598462,0.0001341008,0.0000065099016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002234682,0.007788631,0.0004869748,0.0015506166,0.00042366263,0.00009783604,0.00014546687,0.00030751072,0.27531353,0.08512461,0.026527837,0.59999865],"study_design_scores_gemma":[0.02840715,0.0013274931,0.00792073,0.0005868984,0.0008198985,0.00007540412,0.000108809625,0.76349205,0.004183146,0.12439369,0.067444876,0.00123985],"about_ca_topic_score_codex":0.0000014309561,"about_ca_topic_score_gemma":5.4847175e-7,"teacher_disagreement_score":0.9739312,"about_ca_system_score_codex":0.0000355646,"about_ca_system_score_gemma":0.00019161258,"threshold_uncertainty_score":0.5547512},"labels":[],"label_agreement":null},{"id":"W3138044305","doi":"10.3390/sym13030481","title":"Tensor-Based Adaptive Filtering Algorithms","year":2021,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Algorithm; Adaptive filter; Tensor (intrinsic definition); Computer science; System identification; Signal processing; Finite impulse response; Impulse response; Impulse (physics); Filter (signal processing); Rank (graph theory); Mathematics; Digital signal processing; Data mining","score_opus":0.0669231010285452,"score_gpt":0.33034385134100613,"score_spread":0.2634207503124609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138044305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22800814,0.00027470535,0.6525566,0.005642577,0.0005018027,0.0005067817,0.00022724872,0.000981426,0.11130073],"genre_scores_gemma":[0.71097565,0.0000026774142,0.2860232,0.00073486916,0.00012087996,0.00003778831,0.000024858457,0.000027227306,0.0020528338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993407,0.000033816934,0.0001557572,0.00019087056,0.00013212657,0.00014668645],"domain_scores_gemma":[0.99928105,0.00019247722,0.000047828824,0.0003076889,0.00010485397,0.000066089924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006460437,0.000089662455,0.00012936682,0.000046264267,0.000087654385,0.000028531242,0.000084993895,0.000049472223,0.000443253],"category_scores_gemma":[0.00007469338,0.00008951178,0.00008203986,0.00024389043,0.000023517776,0.000034556197,0.00003152986,0.000107578766,0.00018269457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024237042,0.00096034113,0.0007619858,0.00013122975,0.0001533841,0.00017427579,0.00027030316,0.000042131618,0.043903224,0.8865844,0.04052057,0.026473911],"study_design_scores_gemma":[0.0029520968,0.0001503685,0.008753874,0.00028557665,0.00020901875,0.00020879103,0.0021667134,0.0241814,0.42981333,0.46081495,0.069085084,0.0013787993],"about_ca_topic_score_codex":0.0000030558613,"about_ca_topic_score_gemma":0.0000021658652,"teacher_disagreement_score":0.48296753,"about_ca_system_score_codex":0.000030338178,"about_ca_system_score_gemma":0.00003523568,"threshold_uncertainty_score":0.48533094},"labels":[],"label_agreement":null},{"id":"W3139119893","doi":"10.1109/tii.2021.3065719","title":"A Distributed Hierarchical Deep Computation Model for Federated Learning in Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Edge computing; Computation; Bandwidth (computing); Artificial intelligence; Edge device; Deep learning; Distributed computing; Big data; Machine learning; Enhanced Data Rates for GSM Evolution; Data modeling; Data mining; Computer network; Algorithm; Cloud computing; Database","score_opus":0.0979936206294948,"score_gpt":0.3357521216312969,"score_spread":0.23775850100180212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139119893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08224121,0.0000014444514,0.9160694,0.00042384153,0.00017671796,0.0005268788,0.0001292016,0.00019773025,0.00023361336],"genre_scores_gemma":[0.9488492,0.00000304818,0.050466955,0.000159972,0.000056911984,0.00007870907,0.00021507838,0.000024323424,0.00014578631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983817,0.000083162086,0.0008905363,0.0001474102,0.00021095343,0.0002862863],"domain_scores_gemma":[0.9985165,0.00081537035,0.000204071,0.00013461044,0.00022301594,0.000106428764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027618726,0.00018332615,0.00030173289,0.0001643842,0.0004500178,0.00014707918,0.00009204586,0.00025116885,0.000020505717],"category_scores_gemma":[0.000098314005,0.0002010372,0.00013051018,0.00054751785,0.000040393297,0.00018061187,0.00000277857,0.00076240674,0.000013977698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008871975,0.00042724475,0.0000073413357,0.000053551386,0.000046084722,0.0000015919439,0.0018660494,0.96926975,0.00015014243,0.0029978848,0.0007334703,0.024358178],"study_design_scores_gemma":[0.0023928734,0.000055158067,0.0000050233393,0.00007618398,0.00004100117,0.000014271876,0.00087153347,0.98872834,0.0024454147,0.004948577,0.00021576953,0.00020585692],"about_ca_topic_score_codex":0.0000034913671,"about_ca_topic_score_gemma":0.000031552423,"teacher_disagreement_score":0.866608,"about_ca_system_score_codex":0.00015942758,"about_ca_system_score_gemma":0.00018182056,"threshold_uncertainty_score":0.81980586},"labels":[],"label_agreement":null},{"id":"W3154986566","doi":"10.1007/978-3-030-73100-7_4","title":"Tensor Multi-linear MMSE Estimation Using the Einstein Product","year":2021,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tensor (intrinsic definition); Estimator; Minimum mean square error; Outer product; Computer science; Mathematics; Algorithm; Tensor product; Applied mathematics; Pure mathematics; Statistics","score_opus":0.0891865329417268,"score_gpt":0.3656836136092793,"score_spread":0.2764970806675525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154986566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065837894,0.03938963,0.92847264,0.00022113428,0.001485925,0.0025976875,0.000039760656,0.0002245122,0.020984897],"genre_scores_gemma":[0.49554947,0.0052906433,0.35281086,0.0003010112,0.0025979686,0.00014132849,0.00017764287,0.00043855334,0.14269254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982986,0.00005541262,0.0007758577,0.0004547095,0.00021916257,0.00019624535],"domain_scores_gemma":[0.9985218,0.00035512345,0.00049445266,0.0004243999,0.00015817153,0.000046050718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034212033,0.0002913831,0.00045020535,0.00009942032,0.00024328005,0.0000890558,0.00017199658,0.00010866453,0.000015816251],"category_scores_gemma":[0.000076636235,0.00022651065,0.000089973255,0.00007029151,0.0000847634,0.00008909109,0.0001066031,0.000348546,0.000011953738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008929785,0.00010607958,0.00009000134,0.0011718187,0.00008992249,0.000027036516,0.0009078257,0.056594875,0.00015497528,0.89241064,0.000084614985,0.048353296],"study_design_scores_gemma":[0.0002836313,0.00002887831,0.000009404305,0.0046271207,0.00011357839,0.00026444634,0.0009065033,0.8894933,0.00034381336,0.020884268,0.0823609,0.0006841415],"about_ca_topic_score_codex":0.000024000936,"about_ca_topic_score_gemma":0.000021860928,"teacher_disagreement_score":0.87152636,"about_ca_system_score_codex":0.00009103401,"about_ca_system_score_gemma":0.000030309326,"threshold_uncertainty_score":0.9236836},"labels":[],"label_agreement":null},{"id":"W3155581945","doi":"10.1109/tii.2021.3074152","title":"Federated Tensor Decomposition-Based Feature Extraction Approach for Industrial IoT","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Foundation for Innovation","keywords":"Computer science; Dimension (graph theory); Data mining; Tensor (intrinsic definition); Decomposition; Feature extraction; Dimensionality reduction; Tensor decomposition; Big data; Data modeling; Machine learning; Artificial intelligence; Database; Mathematics","score_opus":0.1128814839262955,"score_gpt":0.3448710913636853,"score_spread":0.23198960743738983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155581945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024359332,0.000004056935,0.96908236,0.0013014138,0.0009824883,0.0015227041,0.0007118765,0.00039293594,0.0016428494],"genre_scores_gemma":[0.7707147,0.000008281195,0.22151218,0.0014389417,0.0010729913,0.0013024164,0.0008924669,0.00013224379,0.00292579],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99776506,0.000121044744,0.0009709152,0.0002833789,0.00043903117,0.00042058053],"domain_scores_gemma":[0.9975115,0.0009158465,0.000411024,0.00041459856,0.0005186744,0.00022837115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032684935,0.00037740578,0.0004696543,0.00026891162,0.00089183386,0.00032264003,0.00017957439,0.0008292368,0.00023560312],"category_scores_gemma":[0.00009766335,0.00038187922,0.0003643135,0.00075182813,0.00007288795,0.0002599275,0.000001996453,0.001083054,0.000042044252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055903876,0.017779583,0.00007752005,0.00099958,0.0024327852,0.0000318934,0.0024610762,0.2514851,0.025292024,0.015740123,0.51482123,0.16328871],"study_design_scores_gemma":[0.023759555,0.00082554313,0.000012232672,0.00036963666,0.0011863108,0.00025480738,0.0038566021,0.42075762,0.4967642,0.002565591,0.04761909,0.0020287933],"about_ca_topic_score_codex":0.0000070898623,"about_ca_topic_score_gemma":0.0000076755905,"teacher_disagreement_score":0.74757016,"about_ca_system_score_codex":0.00025237008,"about_ca_system_score_gemma":0.00043810878,"threshold_uncertainty_score":0.9998633},"labels":[],"label_agreement":null},{"id":"W3160129277","doi":"","title":"On convergence of matrix and tensor approximate diagonalization algorithms by unitary transformations","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Convergence (economics); Unitary state; Unitary transformation; Unitary matrix; Tensor (intrinsic definition); Mathematics; Algorithm; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Physics","score_opus":0.0190430690287734,"score_gpt":0.27073771319829276,"score_spread":0.25169464416951937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160129277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1956491,0.0006904389,0.78534013,0.0059246086,0.00011956909,0.0012770382,0.000937008,0.00024427567,0.009817857],"genre_scores_gemma":[0.9131727,0.0011941626,0.076824956,0.000095701405,0.000011298929,0.00019762262,0.0020424172,0.00007052328,0.00639058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970601,0.001267927,0.00064828334,0.00046663883,0.0003545305,0.0002025204],"domain_scores_gemma":[0.99540675,0.0016757178,0.0005410151,0.0010702776,0.0011870831,0.000119164324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014705096,0.00027893067,0.00039015102,0.00017543812,0.00020142106,0.00010400283,0.00048958673,0.00023636174,0.00016410353],"category_scores_gemma":[0.00040720098,0.00029145088,0.00013595003,0.00026389994,0.00018082911,0.0001123815,0.000240434,0.00037725407,0.000025958667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017943412,0.0012038928,0.00042514902,0.0009825499,0.00012201183,6.3559264e-7,0.005857174,0.00020126895,0.004147634,0.9750871,0.0073061585,0.0046484917],"study_design_scores_gemma":[0.0027709603,0.000005008897,0.00239895,0.005018094,0.00044875807,0.00003181753,0.00074463343,0.37700498,0.113056056,0.48608866,0.010597794,0.0018342756],"about_ca_topic_score_codex":0.0001397362,"about_ca_topic_score_gemma":0.000041338626,"teacher_disagreement_score":0.71752363,"about_ca_system_score_codex":0.000052413314,"about_ca_system_score_gemma":0.0000934961,"threshold_uncertainty_score":0.99995375},"labels":[],"label_agreement":null},{"id":"W3161019910","doi":"10.3390/s21103555","title":"A Kalman Filter for Multilinear Forms and Its Connection with Tensorial Adaptive Filters","year":2021,"lang":"en","type":"article","venue":"Sensors","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Multilinear map; Kalman filter; Adaptive filter; Tensor (intrinsic definition); Algorithm; Extended Kalman filter; Computer science; Context (archaeology); Mathematics; Invariant extended Kalman filter; Filter (signal processing); Artificial intelligence","score_opus":0.04993205294080435,"score_gpt":0.3074780558820816,"score_spread":0.2575460029412773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161019910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99315655,0.000016711525,0.0042031654,0.0008655787,0.00008188644,0.00054006954,0.00011639721,0.00010533593,0.00091430236],"genre_scores_gemma":[0.9632661,0.000007723499,0.033776533,0.00019378364,0.00018439618,0.000105514846,0.000043383538,0.000033293432,0.0023892669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932194,0.000023410654,0.00015567122,0.0002432507,0.000096852535,0.00015888068],"domain_scores_gemma":[0.99922717,0.00027207955,0.00006870022,0.00015433971,0.0002074973,0.000070189315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005830844,0.00011770131,0.00016727147,0.000036388654,0.00013831593,0.000028817733,0.00003506482,0.000059469727,0.000055826808],"category_scores_gemma":[0.0000989865,0.00009402922,0.000054128413,0.00009187748,0.000029759594,0.000058477646,0.000015385549,0.00007503342,0.000014475139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027115638,0.0013459333,0.00038101897,0.0005902564,0.0009296151,0.00010242152,0.0076251123,0.00093730295,0.09056548,0.86532223,0.022229806,0.0072592595],"study_design_scores_gemma":[0.0220897,0.001967671,0.0031702223,0.00044395015,0.00091453845,0.0010960057,0.015628075,0.26615983,0.47273862,0.12758063,0.0856745,0.002536256],"about_ca_topic_score_codex":0.0000027387441,"about_ca_topic_score_gemma":0.00003442222,"teacher_disagreement_score":0.7377416,"about_ca_system_score_codex":0.000019243984,"about_ca_system_score_gemma":0.000017827593,"threshold_uncertainty_score":0.38344002},"labels":[],"label_agreement":null},{"id":"W3166592160","doi":"10.1016/j.inffus.2021.05.014","title":"A tensor-network-based big data fusion framework for Cyber–Physical–Social Systems (CPSS)","year":2021,"lang":"en","type":"article","venue":"Information Fusion","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Foundation for Innovation","keywords":"Computer science; Big data; Tensor decomposition; Tensor (intrinsic definition); External Data Representation; Tucker decomposition; Data mining; Data science; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.09798327447700858,"score_gpt":0.34463952610559273,"score_spread":0.24665625162858415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166592160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07894764,0.000050434694,0.908356,0.004089453,0.001258749,0.0016167273,0.0013482297,0.00058193743,0.0037507908],"genre_scores_gemma":[0.8774436,0.000023799059,0.10791956,0.0022343795,0.0030213455,0.00046840016,0.00838928,0.00006085863,0.0004387387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984466,0.00006887758,0.00058147905,0.00022910148,0.00039619853,0.00027778442],"domain_scores_gemma":[0.9976148,0.00062794395,0.000387771,0.0008080406,0.00047059747,0.00009084819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031221117,0.0001838614,0.00028645777,0.00008177556,0.00057576067,0.00022090643,0.00034262665,0.00018861389,0.00006038533],"category_scores_gemma":[0.0003837713,0.00017322971,0.000120043514,0.0004424642,0.00003249598,0.0004506619,0.00018866129,0.00019194392,0.00019538586],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015920193,0.0006489975,0.00010117448,0.0007417576,0.00007379489,0.00000279479,0.0020624266,0.0012002941,0.0017023016,0.6298926,0.2906721,0.07274258],"study_design_scores_gemma":[0.0021199286,0.00007784106,0.0008319295,0.00044292517,0.00017507077,0.000019780318,0.0010525909,0.18715456,0.0012521731,0.11532317,0.6908558,0.00069425703],"about_ca_topic_score_codex":0.000008480152,"about_ca_topic_score_gemma":0.000006010838,"teacher_disagreement_score":0.8004365,"about_ca_system_score_codex":0.00006127297,"about_ca_system_score_gemma":0.00010005424,"threshold_uncertainty_score":0.7064103},"labels":[],"label_agreement":null},{"id":"W3170257148","doi":"10.1109/ojsp.2021.3084541","title":"A Tensor Framework for Multi-Linear Complex MMSE Estimation","year":2021,"lang":"en","type":"article","venue":"IEEE Open Journal of Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Covariance; Estimator; Mathematics; Minimum mean square error; Tensor product; Applied mathematics; Algorithm; Computer science; Mathematical optimization; Pure mathematics; Statistics","score_opus":0.26780788103721254,"score_gpt":0.4623984886535521,"score_spread":0.19459060761633956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170257148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018504862,0.00008520033,0.9794626,0.0014081638,0.00005919622,0.00027832497,0.000015298236,0.000017708217,0.00016861976],"genre_scores_gemma":[0.3472789,0.0000026163564,0.65210474,0.0002901604,0.00014674987,0.000012755764,0.0000039361107,0.000019916124,0.00014025407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988173,0.00004915919,0.00061097724,0.00014726986,0.00021593878,0.00015933905],"domain_scores_gemma":[0.9978301,0.0003200867,0.0006545757,0.00012388354,0.00096004497,0.00011129647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041979158,0.00012043571,0.0003198197,0.00006209427,0.00028465912,0.000306285,0.0003343439,0.00007205277,0.00016807264],"category_scores_gemma":[0.00025031343,0.0001056955,0.000117950694,0.0002103,0.00003815829,0.00042027823,0.000034138095,0.00023183093,0.000010496592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012650805,0.0065629934,0.00037500053,0.002463553,0.0006862363,0.0003220208,0.0070045036,0.012369049,0.35876837,0.101930946,0.030167982,0.47808427],"study_design_scores_gemma":[0.0035825155,0.0002085555,0.0003027354,0.001826077,0.00030026087,0.0009873821,0.0013118528,0.4439828,0.04809932,0.4952447,0.0036670829,0.00048668837],"about_ca_topic_score_codex":7.917412e-7,"about_ca_topic_score_gemma":0.0000010482286,"teacher_disagreement_score":0.47759756,"about_ca_system_score_codex":0.00004108915,"about_ca_system_score_gemma":0.00021314941,"threshold_uncertainty_score":0.43101373},"labels":[],"label_agreement":null},{"id":"W3174048467","doi":"10.48550/arxiv.2106.11827","title":"Lower and Upper Bounds on the VC-Dimension of Tensor Network Models","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Dimension (graph theory); Mathematics; Tensor (intrinsic definition); Upper and lower bounds; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.11438509385522522,"score_gpt":0.22211115428968278,"score_spread":0.10772606043445757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174048467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9781673,0.000048449412,0.015219263,0.00040613435,0.00012355683,0.0003272173,0.000022819486,0.000063834195,0.005621412],"genre_scores_gemma":[0.99642205,0.00014020856,0.0013198622,0.00021830716,0.00004968371,0.000002004019,0.000015026606,0.00002289729,0.0018099821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990074,0.000101490965,0.00018467204,0.00045784735,0.00007668295,0.00017189958],"domain_scores_gemma":[0.9983918,0.000351673,0.00020308686,0.0008179177,0.00016467397,0.00007084317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015560108,0.0001985662,0.00029053574,0.00005972851,0.00017034594,0.0000412933,0.00026020076,0.00019276542,0.00013961754],"category_scores_gemma":[0.000022529639,0.00016875524,0.00017071512,0.0002035941,0.00013142104,0.00005592853,0.00041810673,0.00037177082,0.00001156482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004534202,0.00020329695,0.00026087384,0.00006073209,0.00011388684,0.000024539588,0.00018132685,0.07975654,0.00010821103,0.9157254,0.0034891502,0.000030662573],"study_design_scores_gemma":[0.0004292977,0.000052373318,0.00073932944,0.00038278612,0.00029091074,0.0000066941375,0.0004345251,0.16046932,0.0002411559,0.8360199,0.0005504825,0.00038322707],"about_ca_topic_score_codex":0.000018182323,"about_ca_topic_score_gemma":0.000011303519,"teacher_disagreement_score":0.08071279,"about_ca_system_score_codex":0.000046284767,"about_ca_system_score_gemma":0.000044807595,"threshold_uncertainty_score":0.68816394},"labels":[],"label_agreement":null},{"id":"W3176251287","doi":"10.1109/jiot.2021.3092360","title":"Tensor Graph Attention Network for Knowledge Reasoning in Internet of Things","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Theoretical computer science; Premise; Graph; Knowledge representation and reasoning; Artificial intelligence","score_opus":0.03914019874936194,"score_gpt":0.3253981482133418,"score_spread":0.28625794946397987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176251287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75769204,0.0003011017,0.238599,0.00043645344,0.0006605782,0.00021157684,0.000004488676,0.000035144392,0.0020596161],"genre_scores_gemma":[0.88725334,0.000035890564,0.109921336,0.0001509602,0.00017016933,0.00001681177,0.0000077429695,0.00003259714,0.0024111602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983249,0.00009678264,0.0009291855,0.00020277523,0.00019934958,0.00024701766],"domain_scores_gemma":[0.99803656,0.00040466667,0.0007525546,0.00019783701,0.00052779185,0.000080614365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008138717,0.00015570366,0.00041427065,0.00017416776,0.000043824366,0.00006375382,0.00032503315,0.000112499205,0.00011439493],"category_scores_gemma":[0.0003084182,0.0001480871,0.00033922817,0.00023993941,0.000059704238,0.000290947,0.000058821726,0.0004090548,0.00000666188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009820971,0.004114837,0.02804069,0.001928812,0.0015509,0.00011971267,0.058347877,0.0002975819,0.16969036,0.41379133,0.29791915,0.02321664],"study_design_scores_gemma":[0.006510867,0.0007012363,0.008456097,0.011478109,0.00055274286,0.002244463,0.002863652,0.059368253,0.17688528,0.72110456,0.008727939,0.0011068104],"about_ca_topic_score_codex":0.00003277764,"about_ca_topic_score_gemma":0.000016334361,"teacher_disagreement_score":0.3073132,"about_ca_system_score_codex":0.0000727704,"about_ca_system_score_gemma":0.00004726246,"threshold_uncertainty_score":0.60388166},"labels":[],"label_agreement":null},{"id":"W3178270665","doi":"10.1109/iccvw54120.2021.00466","title":"A unified framework for non-negative matrix and tensor factorisations with a smoothed Wasserstein loss","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Tensor (intrinsic definition); Metric (unit); Matrix (chemical analysis); Dual (grammatical number); Mathematics; Mathematical optimization; Applied mathematics; Regular polygon; Space (punctuation); Function (biology); Algorithm; Computer science; Algebra over a field; Pure mathematics; Geometry","score_opus":0.05118225196005899,"score_gpt":0.3581749316541139,"score_spread":0.3069926796940549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178270665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26907468,0.000022390994,0.7245924,0.002782534,0.000073354044,0.002004978,0.0002964397,0.00023898548,0.0009142423],"genre_scores_gemma":[0.46997136,0.00001594166,0.52680874,0.000086587635,0.000071396826,0.0007804843,0.000096300224,0.000051261562,0.002117933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853736,0.000046749698,0.00039025987,0.0005867535,0.00019971521,0.00023914663],"domain_scores_gemma":[0.99691653,0.001517968,0.00030322414,0.0007187639,0.00040733686,0.0001361876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011622887,0.00034483333,0.0005340158,0.00010935365,0.00020240918,0.00024461813,0.00020370571,0.00038347405,0.00018246376],"category_scores_gemma":[0.00022937245,0.0002783581,0.00015015228,0.00018020233,0.00010054343,0.000058643327,0.00016949167,0.0004914814,0.0000070478086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111709494,0.00046402463,0.00045580012,0.0008006948,0.00059378264,0.000008170934,0.0053288266,0.00007244444,0.00057686603,0.98977196,0.0016416172,0.00017412222],"study_design_scores_gemma":[0.0012745193,0.00009899504,0.0015072286,0.0006401007,0.00045248176,0.000020503909,0.0067546843,0.0024418242,0.003094795,0.98235047,0.00059165084,0.0007727346],"about_ca_topic_score_codex":0.00005504486,"about_ca_topic_score_gemma":0.00011492835,"teacher_disagreement_score":0.20089671,"about_ca_system_score_codex":0.00007594766,"about_ca_system_score_gemma":0.00015462073,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W3178347231","doi":"10.1049/itr2.12099","title":"Rail transit OD‐matrix completion via manifold regularized tensor factorisation","year":2021,"lang":"en","type":"article","venue":"IET Intelligent Transport Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Manifold (fluid mechanics); Transit (satellite); Matrix (chemical analysis); Computer science; Matrix decomposition; Algebra over a field; Mathematics; Transport engineering; Physics; Engineering; Pure mathematics; Public transport; Materials science; Mechanical engineering","score_opus":0.0679966865238819,"score_gpt":0.31970764138725155,"score_spread":0.25171095486336964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178347231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1415886,0.0002673363,0.8531978,0.0007315175,0.0007762665,0.0010741594,0.00020147722,0.000508307,0.0016545173],"genre_scores_gemma":[0.9900361,0.000074399904,0.0037267846,0.00007498704,0.0002362264,0.00015556724,0.0006905581,0.00006650188,0.004938917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99737096,0.00014062031,0.0010659987,0.00051568396,0.00056785304,0.00033891326],"domain_scores_gemma":[0.9984083,0.00013678553,0.00023920793,0.0006459384,0.000391895,0.0001778635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033739745,0.00031649703,0.00057804043,0.000113232956,0.00020772826,0.000072427705,0.00021518563,0.00022164582,0.0007373227],"category_scores_gemma":[0.000016087624,0.00031535898,0.00034939076,0.0003436148,0.00003717545,0.00012799977,0.000007115689,0.00023321118,0.00030759512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020860955,0.0018923256,0.0032990011,0.0017275558,0.00067080715,0.00020453303,0.0056159035,0.0011399655,0.3097786,0.66757685,0.006927684,0.00095818395],"study_design_scores_gemma":[0.0079412125,0.0005047708,0.028244782,0.0020958036,0.0026309919,0.0022498688,0.011441427,0.03183577,0.24521564,0.115598984,0.54679406,0.005446681],"about_ca_topic_score_codex":0.00009252543,"about_ca_topic_score_gemma":0.00008472024,"teacher_disagreement_score":0.84947103,"about_ca_system_score_codex":0.00013384502,"about_ca_system_score_gemma":0.000053885666,"threshold_uncertainty_score":0.99992985},"labels":[],"label_agreement":null},{"id":"W3178568068","doi":"10.3390/network1020005","title":"Multi-Domain Communication Systems and Networks: A Tensor-Based Approach","year":2021,"lang":"en","type":"article","venue":"Network","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Computer science; Transmission (telecommunications); Domain (mathematical analysis); Frequency domain; Multiplexing; MIMO; Tensor algebra; Electronic engineering; Physical layer; Topology (electrical circuits); Theoretical computer science; Channel (broadcasting); Mathematics; Wireless; Telecommunications; Engineering; Algebra over a field","score_opus":0.05520534064176455,"score_gpt":0.3034051072146086,"score_spread":0.24819976657284407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178568068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021290932,0.0038127985,0.96760005,0.001014872,0.00012071338,0.0006117531,0.00001461578,0.0002930284,0.0052412325],"genre_scores_gemma":[0.5497872,0.0000813925,0.44865334,0.0003856651,0.00020562856,0.00016443846,0.00013616773,0.000031780168,0.0005543819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989889,0.00022045107,0.00025702134,0.00022129867,0.000108402695,0.0002039068],"domain_scores_gemma":[0.99880874,0.00035677466,0.00010800088,0.0005387305,0.00010433483,0.00008343151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027665994,0.00011984002,0.00020574174,0.000019471596,0.00025937523,0.00009306448,0.00011857796,0.00009687054,0.00001853592],"category_scores_gemma":[0.000027893697,0.00011743919,0.00005018895,0.000271831,0.000057705347,0.000036135658,0.00005480357,0.00016808766,0.000010015734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000339847,0.0010899367,0.005194215,0.00017719666,0.00014274867,0.000012360542,0.00035872596,0.10700023,0.00022483713,0.79279566,0.0915311,0.0014390342],"study_design_scores_gemma":[0.0012818994,0.000016329639,0.0030508623,0.00017885225,0.00006988146,0.000063580424,0.00044086095,0.95465326,0.000010971384,0.017801931,0.02209473,0.0003368454],"about_ca_topic_score_codex":0.000006050364,"about_ca_topic_score_gemma":0.000010888612,"teacher_disagreement_score":0.84765303,"about_ca_system_score_codex":0.00002516571,"about_ca_system_score_gemma":0.000026840495,"threshold_uncertainty_score":0.4789031},"labels":[],"label_agreement":null},{"id":"W3189608635","doi":"10.1109/icc42927.2021.9500957","title":"A Tensor based Precoder and Receiver for MIMO GFDM systems","year":2021,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Precoding; Tensor (intrinsic definition); Channel (broadcasting); Orthogonal frequency-division multiplexing; Computer science; MIMO-OFDM; Control theory (sociology); Interference (communication); Frequency domain; Topology (electrical circuits); Mathematics; Electronic engineering; Algorithm; Telecommunications; Engineering; Mathematical analysis; Geometry","score_opus":0.0691470913764628,"score_gpt":0.3325845956879464,"score_spread":0.2634375043114836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189608635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10237058,0.00030545043,0.8269739,0.010467134,0.00027099435,0.0020989128,0.00025364914,0.00053461525,0.05672474],"genre_scores_gemma":[0.52128154,0.000016115568,0.394876,0.0015605125,0.00014773,0.0007476769,0.00006682082,0.000053979624,0.081249654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999531,0.000020542297,0.00014070621,0.00015694102,0.00005830649,0.00009250552],"domain_scores_gemma":[0.9992543,0.00033190366,0.000034510795,0.00018682583,0.00014167541,0.00005077488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006810577,0.00006309797,0.000115966686,0.000020132657,0.00007017906,0.000048205242,0.00003526264,0.000041261028,0.0002434805],"category_scores_gemma":[0.00006158922,0.000053540112,0.00004078933,0.00005783491,0.000013671172,0.000028766362,0.000010048698,0.000029941331,0.000022084605],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003935494,0.0004809659,0.000341556,0.00056939654,0.000087929126,0.000004677732,0.00022674458,0.000030298173,0.012951173,0.6828647,0.30059722,0.0018059417],"study_design_scores_gemma":[0.004961864,0.00014501224,0.0018608874,0.00022826093,0.00029780073,0.00014104358,0.001572837,0.12824313,0.029831976,0.12940267,0.7024092,0.0009053229],"about_ca_topic_score_codex":0.0000034002064,"about_ca_topic_score_gemma":0.000009358396,"teacher_disagreement_score":0.5534621,"about_ca_system_score_codex":0.00001015064,"about_ca_system_score_gemma":0.000020052445,"threshold_uncertainty_score":0.26659408},"labels":[],"label_agreement":null},{"id":"W3190122703","doi":"10.1109/isscs52333.2021.9497456","title":"A Tensorial Affine Projection Algorithm","year":2021,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Ministry of Education","keywords":"Multilinear map; Identification (biology); Affine transformation; Tensor (intrinsic definition); Projection (relational algebra); Algorithm; Computer science; System identification; Space (punctuation); Mathematics; Data modeling; Pure mathematics","score_opus":0.04702315278518103,"score_gpt":0.338342309241975,"score_spread":0.29131915645679396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190122703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05115683,0.000026282814,0.66604954,0.0077861217,0.0008060057,0.0005851182,0.000037052814,0.0011686861,0.27238435],"genre_scores_gemma":[0.037322193,0.000010505127,0.8937177,0.000544019,0.0010508634,0.00011081295,0.000046986854,0.000028155851,0.06716874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999563,0.00001845853,0.00011963982,0.00012719518,0.00009031891,0.000081409475],"domain_scores_gemma":[0.99960846,0.00005611919,0.000025192498,0.00016569645,0.00011338012,0.00003116344],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000044178167,0.000051633724,0.00007553998,0.000022349088,0.00006422707,0.000026806729,0.000034394663,0.00003443475,0.0014820069],"category_scores_gemma":[0.000045525234,0.000045442845,0.000044720935,0.00016197067,0.000009451597,0.00003541478,0.000017622204,0.000052982505,0.00016233035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007109686,0.00065783726,0.000028337367,0.000019348203,0.0000432863,0.000016676662,0.0001948601,9.167477e-7,0.025028802,0.7600687,0.12781581,0.086118326],"study_design_scores_gemma":[0.0018957604,0.000063951826,0.0006184548,0.000022771454,0.00008720785,0.00037564282,0.00067195407,0.007023151,0.11218243,0.46350875,0.41309157,0.00045835436],"about_ca_topic_score_codex":0.0000053508184,"about_ca_topic_score_gemma":0.000011316076,"teacher_disagreement_score":0.29655996,"about_ca_system_score_codex":0.000017022807,"about_ca_system_score_gemma":0.000025072552,"threshold_uncertainty_score":0.9994308},"labels":[],"label_agreement":null},{"id":"W3190268122","doi":"10.1109/tii.2021.3100978","title":"An Incremental Boolean Tensor Factorization for Knowledge Reasoning in Artificial Intelligence of Things","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Interpretability; Theoretical computer science; Artificial intelligence; Graph; Machine learning","score_opus":0.14798447833846134,"score_gpt":0.362838364592646,"score_spread":0.21485388625418467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190268122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13201642,0.0000018509136,0.8664109,0.00007492923,0.00030663196,0.00050291285,0.00011904847,0.00006798431,0.0004993472],"genre_scores_gemma":[0.96648127,0.000005901625,0.033174243,0.00005404302,0.00007440284,0.00007984863,0.000047546117,0.000019478122,0.000063293104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99848884,0.00005704361,0.0009651625,0.00012222705,0.00018122372,0.00018547307],"domain_scores_gemma":[0.998765,0.0004003212,0.00025153928,0.00027503617,0.00022891835,0.00007919649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003152449,0.00014803099,0.00025242023,0.0002062342,0.00015742937,0.0000587627,0.00014803128,0.00020039918,0.0000905908],"category_scores_gemma":[0.00009175911,0.00015757719,0.000101345526,0.00047594754,0.000046930305,0.00046461128,0.0000018006748,0.00030800732,0.000011489633],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011283,0.010590595,0.00017473091,0.00077606796,0.00038384082,0.000004639645,0.077026285,0.03445893,0.04792811,0.43149516,0.001375545,0.3946578],"study_design_scores_gemma":[0.001156326,0.00040518687,0.00001388293,0.0003378718,0.00012812561,0.000013659231,0.0183962,0.13514967,0.81645036,0.026995488,0.0004941537,0.0004590791],"about_ca_topic_score_codex":0.000015580657,"about_ca_topic_score_gemma":0.000041867497,"teacher_disagreement_score":0.83446485,"about_ca_system_score_codex":0.00011503863,"about_ca_system_score_gemma":0.00013873991,"threshold_uncertainty_score":0.64258116},"labels":[],"label_agreement":null},{"id":"W3192889988","doi":"10.1109/icalt52272.2021.00057","title":"IRT++: Improving Student Response Prediction With Gaussian Initialisation and Other Modifications","year":2021,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interpretability; Item response theory; Computer science; Simple (philosophy); Convergence (economics); Machine learning; Artificial intelligence; Extension (predicate logic); Model parameter; Gaussian; Gaussian process; Gradient descent; Mathematics; Statistics; Artificial neural network","score_opus":0.05809367413002877,"score_gpt":0.3396688124459596,"score_spread":0.28157513831593084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192889988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85477346,0.000015374342,0.12996522,0.0033258512,0.000029370189,0.00032852896,0.000055624812,0.0002266642,0.011279918],"genre_scores_gemma":[0.97259027,0.0000026621701,0.025256183,0.00030622396,0.00004083892,0.00010150656,0.00001399702,0.000016834214,0.0016715087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993259,0.000087480206,0.00017489129,0.0001905532,0.00013572577,0.00008548352],"domain_scores_gemma":[0.9993686,0.000156513,0.00006281439,0.00025674276,0.000096649535,0.00005865772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016460057,0.0000754968,0.000079262194,0.000048922288,0.00016089522,0.000086334025,0.000040952647,0.000038085942,0.00017514788],"category_scores_gemma":[0.000048593054,0.000063028696,0.000017725615,0.00014028641,0.000035799643,0.000099333294,0.00001966723,0.000061665894,0.000014171463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019238982,0.0007136309,0.0030441699,0.00004940346,0.000084846666,0.00000804693,0.0040037422,0.00003203505,0.11018924,0.87701654,0.0023189941,0.002346963],"study_design_scores_gemma":[0.01007713,0.00089095114,0.5516708,0.00035226104,0.0009193049,0.0010879051,0.037085548,0.020292101,0.13524063,0.18819502,0.052141976,0.0020464151],"about_ca_topic_score_codex":0.000010394866,"about_ca_topic_score_gemma":0.000043669388,"teacher_disagreement_score":0.68882155,"about_ca_system_score_codex":0.00003209866,"about_ca_system_score_gemma":0.000043380216,"threshold_uncertainty_score":0.25702354},"labels":[],"label_agreement":null},{"id":"W3196986231","doi":"10.1214/24-ba1428","title":"Scalable Spatiotemporally Varying Coefficient Modeling with Bayesian Kernelized Tensor Regression","year":2024,"lang":"en","type":"article","venue":"Bayesian Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Gibbs sampling; Markov chain Monte Carlo; Covariance; Covariate; Bayesian inference; Hyperparameter; Mathematics; Computer science; Kernel (algebra); Bayesian probability; Artificial intelligence; Data mining; Algorithm; Machine learning; Pattern recognition (psychology); Statistics","score_opus":0.029045937899116445,"score_gpt":0.3099755801192388,"score_spread":0.28092964222012234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196986231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025806727,0.00018117462,0.9670696,0.001452228,0.00003312591,0.00028912557,0.000026365691,0.00055516436,0.004586482],"genre_scores_gemma":[0.9018617,0.000018493669,0.09606945,0.00010363467,0.00006400056,0.000055802284,0.00008374374,0.00005482285,0.0016883204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799955,0.00008222398,0.0005184429,0.0006065045,0.00047031825,0.0003229776],"domain_scores_gemma":[0.99876267,0.00014063147,0.000119467055,0.00063711643,0.00015192987,0.00018819196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030358686,0.0002742015,0.0004901983,0.00061966636,0.00027738322,0.00028409468,0.00022072987,0.000104937106,0.0006681058],"category_scores_gemma":[0.00003259336,0.00020151242,0.0003389135,0.0022750061,0.00004519715,0.00014973353,0.000042293,0.00021139276,0.00008607637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060517044,0.002807615,0.0077218497,0.001654039,0.013850627,0.00072225323,0.0066963164,0.46229354,0.011677577,0.44743785,0.021006085,0.023527078],"study_design_scores_gemma":[0.0002748604,0.000024192803,0.00005174367,0.00020301095,0.0016010295,0.000013537393,0.00013790096,0.9872292,0.00034266297,0.009411472,0.00041571382,0.00029466941],"about_ca_topic_score_codex":0.000069144815,"about_ca_topic_score_gemma":0.000056679597,"teacher_disagreement_score":0.876055,"about_ca_system_score_codex":0.00009754137,"about_ca_system_score_gemma":0.00007034836,"threshold_uncertainty_score":0.8217438},"labels":[],"label_agreement":null},{"id":"W3197057273","doi":"10.1109/tim.2021.3105236","title":"Improving the Signal-to-Noise-Ratio of Free Induction Decay Signals Using a New Multilinear Singular Value Decomposition-Based Filter","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China; Wuhan Municipal Science and Technology Bureau; Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Singular value decomposition; Noise reduction; Noise (video); Signal-to-noise ratio (imaging); SIGNAL (programming language); Interference (communication); Filter (signal processing); Noise measurement; Mathematics; Algorithm; Physics; Acoustics; Computer science; Statistics; Artificial intelligence; Telecommunications","score_opus":0.08582058538581315,"score_gpt":0.3226535991598306,"score_spread":0.23683301377401744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197057273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2383091,0.000017322143,0.7598885,0.00097640924,0.00016037273,0.00052172376,0.000042592455,0.000045890814,0.000038074195],"genre_scores_gemma":[0.9229332,0.000004044281,0.07630364,0.00057270855,0.00004664825,0.00006422221,0.0000079542815,0.000024361198,0.000043206997],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99824136,0.00016907117,0.0005254632,0.0003101081,0.00058721454,0.00016675546],"domain_scores_gemma":[0.9987667,0.00014184545,0.00020039959,0.0003651889,0.0003839735,0.00014186949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037018934,0.00018658755,0.00020257787,0.00015575132,0.00040090576,0.00008587882,0.00010961553,0.00007081677,0.00023327536],"category_scores_gemma":[0.00002276317,0.00016766362,0.00012149073,0.00033721255,0.000046924448,0.0001335023,0.0000028327943,0.00015397975,0.0000059355557],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069960595,0.00036955514,0.00001052862,0.00004783806,0.000088439236,7.9177994e-7,0.0006058114,0.024614744,0.95275134,0.0008467174,0.00011514026,0.020479154],"study_design_scores_gemma":[0.0014092493,0.000095589945,0.00015972205,0.00013397732,0.00021769022,0.00001104389,0.0004370797,0.032153536,0.96394527,0.0011947596,0.00006541084,0.00017668579],"about_ca_topic_score_codex":0.00012220527,"about_ca_topic_score_gemma":0.000077539255,"teacher_disagreement_score":0.68462414,"about_ca_system_score_codex":0.0001801077,"about_ca_system_score_gemma":0.000250378,"threshold_uncertainty_score":0.68371236},"labels":[],"label_agreement":null},{"id":"W3197686036","doi":"10.1109/tcyb.2021.3106485","title":"Multiview PCA: A Methodology of Feature Extraction and Dimension Reduction for High-Order Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dimensionality reduction; Computer science; Principal component analysis; Artificial intelligence; Dimension (graph theory); Projection (relational algebra); Tensor (intrinsic definition); Feature (linguistics); Pattern recognition (psychology); Mathematics; Algorithm; Combinatorics","score_opus":0.1529325046986833,"score_gpt":0.3962758409918483,"score_spread":0.243343336293165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197686036","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04511934,0.00016840875,0.9514614,0.0019517783,0.00041891958,0.00043165288,0.00031385315,0.000068681096,0.00006598372],"genre_scores_gemma":[0.45105404,0.0004354063,0.546994,0.000058241298,0.000052261148,0.00006206328,0.00008185589,0.00002986827,0.001232302],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989264,0.00014311922,0.0002871853,0.00037791935,0.00013130282,0.00013409993],"domain_scores_gemma":[0.998126,0.00076402636,0.00014628064,0.00062645227,0.00028077164,0.00005652843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024265496,0.00014033765,0.00026503834,0.00007741821,0.00013962816,0.00001717381,0.00010175822,0.00016528794,0.000057779813],"category_scores_gemma":[0.00006143824,0.00014156064,0.000056657744,0.00023122985,0.00007162851,0.000099526296,0.000003983103,0.00020562102,0.0000041682483],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023278924,0.00236445,0.0000041297008,0.00054087944,0.00039328838,0.0000051223424,0.0009668765,0.0011762658,0.7818839,0.04802538,0.0075676125,0.15683931],"study_design_scores_gemma":[0.0023287302,0.00026681946,0.0003315722,0.00019270713,0.0010350767,0.0003631868,0.0007489287,0.008322064,0.91757506,0.056429435,0.011917437,0.0004889808],"about_ca_topic_score_codex":0.000017991,"about_ca_topic_score_gemma":0.00006838643,"teacher_disagreement_score":0.4059347,"about_ca_system_score_codex":0.000024872206,"about_ca_system_score_gemma":0.000040306386,"threshold_uncertainty_score":0.5772675},"labels":[],"label_agreement":null},{"id":"W3202635391","doi":"10.1109/tits.2021.3113608","title":"Low-Rank Autoregressive Tensor Completion for Spatiotemporal Traffic Data Imputation","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":153,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Canada Foundation for Innovation","keywords":"Missing data; Imputation (statistics); Autoregressive model; Computer science; Data mining; Matrix completion; Time series; Minification; Temporal database; Regularization (linguistics); Algorithm; Econometrics; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning","score_opus":0.18377282755485508,"score_gpt":0.27077406332608006,"score_spread":0.08700123577122498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202635391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6061443,0.000012225472,0.3919813,0.0004940052,0.000092605034,0.00037703023,0.00034108825,0.00019166025,0.0003657955],"genre_scores_gemma":[0.98772997,0.000010432762,0.009809606,0.00009593836,0.00007564349,0.0000026451332,0.0010330543,0.000020539082,0.0012222014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902713,0.00006352637,0.0001807465,0.0004932064,0.00006183164,0.00017354183],"domain_scores_gemma":[0.9985329,0.00027175026,0.00016374739,0.00066320813,0.00028418674,0.00008420607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011632866,0.0001281363,0.00018074088,0.000068374626,0.00021892482,0.000040467497,0.00029261262,0.00008020906,0.00011610054],"category_scores_gemma":[0.00010746987,0.00014715936,0.00008669618,0.00026055996,0.00005755688,0.00024716216,0.00008724804,0.0000886274,0.000054624194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016403405,0.0010651347,0.00067337265,0.00024363921,0.00019505821,0.0001319194,0.00047907507,0.020288773,0.0021457113,0.94440407,0.026840396,0.0033688152],"study_design_scores_gemma":[0.0027507113,0.00007312406,0.0031207835,0.00008348847,0.00028665934,0.000028095303,0.00066804065,0.87785673,0.002095445,0.10527161,0.0072609913,0.00050430733],"about_ca_topic_score_codex":0.000005433128,"about_ca_topic_score_gemma":0.00005376671,"teacher_disagreement_score":0.85756797,"about_ca_system_score_codex":0.0000694356,"about_ca_system_score_gemma":0.00007470127,"threshold_uncertainty_score":0.60009843},"labels":[],"label_agreement":null},{"id":"W3207498650","doi":"10.1109/tnse.2021.3119324","title":"Tensor Train-Based Multiple Clusterings for Big Data in Cyber-Physical-Social Systems and Its Efficient Implementations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Big data; Tensor (intrinsic definition); Overhead (engineering); Implementation; Parallel computing; Data mining; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.08272881589556075,"score_gpt":0.3230384472093226,"score_spread":0.24030963131376187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207498650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43028867,0.000026230777,0.56842935,0.00038081818,0.00027349996,0.00036929492,0.00015486736,0.0000613447,0.000015924405],"genre_scores_gemma":[0.99558276,0.00000574762,0.0040519475,0.000052051393,0.0001163355,0.00015123677,0.0000080517775,0.000013391685,0.000018464458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906576,0.000010905027,0.00018320541,0.00031329313,0.00016911227,0.00025769975],"domain_scores_gemma":[0.99925256,0.00036552953,0.00003137508,0.00018737544,0.00008674056,0.00007641642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002910411,0.00010370245,0.00014503961,0.00010134905,0.00038458212,0.000095307034,0.00012532632,0.000027905518,0.0000014140498],"category_scores_gemma":[0.000026213871,0.000107635955,0.000024535646,0.00059105223,0.0000450803,0.000085144165,0.00000485414,0.00009337564,7.3844484e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001819457,0.00031454774,0.000015735637,0.0002004796,0.00002445608,0.0000029911366,0.0010139409,0.9449914,0.042195328,0.004928711,0.00024662865,0.006047565],"study_design_scores_gemma":[0.0005598118,0.000018333416,0.00033811753,0.000050990522,0.000025331468,0.0000065844947,0.00022171657,0.99607176,0.0017672299,0.000058344405,0.0007450046,0.00013679598],"about_ca_topic_score_codex":0.0000069547414,"about_ca_topic_score_gemma":0.000036632693,"teacher_disagreement_score":0.5652941,"about_ca_system_score_codex":0.00004592094,"about_ca_system_score_gemma":0.00006169348,"threshold_uncertainty_score":0.43892667},"labels":[],"label_agreement":null},{"id":"W3211104423","doi":"10.1007/s10013-022-00558-3","title":"The Set of Orthogonal Tensor Trains","year":2022,"lang":"en","type":"article","venue":"Vietnam Journal of Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tensor (intrinsic definition); Rank (graph theory); Extension (predicate logic); Set (abstract data type); Quadratic equation; Pure mathematics; Decomposition; Invariants of tensors; Symmetric tensor; Type (biology); Algebra over a field; Mathematical analysis; Combinatorics; Exact solutions in general relativity; Geometry","score_opus":0.05796193281343756,"score_gpt":0.32933150031069386,"score_spread":0.27136956749725627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211104423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96328306,0.0004343549,0.02376344,0.0072968286,0.0003715176,0.0005383718,0.0001908863,0.000045714136,0.0040758126],"genre_scores_gemma":[0.9280112,0.00007894508,0.07054078,0.00014402697,0.00017188194,0.000032499942,0.0000031068005,0.000045147925,0.00097243447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981076,0.00010444359,0.0009465485,0.000067714966,0.0006190164,0.0001546724],"domain_scores_gemma":[0.99739563,0.000853773,0.001123567,0.00030777155,0.0002480607,0.00007117309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012736318,0.00010942786,0.0003120981,0.00008627991,0.00039459928,0.000022782922,0.00049782766,0.000026024874,0.00032958627],"category_scores_gemma":[0.000259113,0.000072574796,0.00026320489,0.00023602897,0.00008648796,0.000047528687,0.00008442918,0.0003259865,0.000006318771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056746492,0.0013400605,0.0001630787,0.0002319237,0.00034292619,0.000025666206,0.0066776513,0.0002601407,0.006097777,0.9320024,0.048568163,0.004233438],"study_design_scores_gemma":[0.0015144277,0.0005494412,0.00035370202,0.000110026835,0.0003296809,0.002481559,0.021901134,0.0022629658,0.0012919424,0.88295573,0.08593798,0.00031142044],"about_ca_topic_score_codex":1.8338135e-7,"about_ca_topic_score_gemma":0.0000012101427,"teacher_disagreement_score":0.049046706,"about_ca_system_score_codex":0.00004226302,"about_ca_system_score_gemma":0.000083357925,"threshold_uncertainty_score":0.36087388},"labels":[],"label_agreement":null},{"id":"W3217437752","doi":"10.1063/5.0075412","title":"Computing vibrational energy levels by solving linear equations using a tensor method with an imposed rank","year":2021,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rank (graph theory); Tensor (intrinsic definition); Basis (linear algebra); Orthogonalization; Applied mathematics; Mathematics; Basis function; Hamiltonian (control theory); Realization (probability); Tensor product; Algorithm; Mathematical analysis; Mathematical optimization; Pure mathematics; Combinatorics; Geometry","score_opus":0.07816383131306777,"score_gpt":0.3602719052322727,"score_spread":0.28210807391920495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217437752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16937384,0.000023963426,0.829784,0.0006595594,0.000016587592,0.00003575848,0.000015479136,0.000016131873,0.00007468306],"genre_scores_gemma":[0.5908869,0.0000014625579,0.4084258,0.00030819923,0.00033311805,6.129328e-7,0.0000114606555,0.000019726805,0.000012715169],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988782,0.00015627984,0.000405477,0.00009819416,0.0003209263,0.00014094642],"domain_scores_gemma":[0.99770314,0.0011084828,0.00041143573,0.00019762607,0.00048964337,0.00008965454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030571112,0.00011726791,0.00023566857,0.00001694284,0.00016192296,0.000042551237,0.00018497983,0.000043487133,0.00003026865],"category_scores_gemma":[0.00009986162,0.000081253755,0.00009338535,0.00022460606,0.000053539596,0.00017078151,0.000036627185,0.00024437084,9.184543e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030677962,0.00023255339,0.0000030407207,0.000008135742,0.00007547485,0.0000019333518,0.0003151863,0.001979605,0.97231096,0.024086088,0.00028305317,0.00067330356],"study_design_scores_gemma":[0.0006317239,0.000034905574,0.0000046910523,0.00004941074,0.00018087875,0.00019578534,0.00017973005,0.18871558,0.71464694,0.095146485,0.000075768075,0.00013808],"about_ca_topic_score_codex":0.0000030257772,"about_ca_topic_score_gemma":4.5373963e-7,"teacher_disagreement_score":0.42151308,"about_ca_system_score_codex":0.000045097626,"about_ca_system_score_gemma":0.00013561406,"threshold_uncertainty_score":0.3313432},"labels":[],"label_agreement":null},{"id":"W3217735989","doi":"10.4171/aihpd/178","title":"Perturbing isoradial triangulations","year":2024,"lang":"en","type":"article","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Institut Périmètre de physique théorique; Institut Henri Poincaré; University of Miami; Saint Petersburg State University; European Commission","keywords":"Geology; Geometry; Mathematics","score_opus":0.04279290230407783,"score_gpt":0.3193144170895309,"score_spread":0.27652151478545306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217735989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.610796,0.0033780308,0.29364887,0.009365374,0.003397347,0.001195373,0.000466081,0.0018008976,0.07595209],"genre_scores_gemma":[0.9969938,0.00015058933,0.0007790712,0.0002012995,0.00039183346,0.000102415186,0.000052267816,0.00004213403,0.0012865962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989095,0.000054029624,0.00030732033,0.00032604072,0.00011945645,0.00028366345],"domain_scores_gemma":[0.9987043,0.00062654377,0.00007171916,0.0003195962,0.000118842974,0.0001590018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013856364,0.00023809086,0.00023502047,0.00014531502,0.000550338,0.00034249623,0.00016001075,0.00007078623,0.00005752805],"category_scores_gemma":[0.00005237585,0.00021590616,0.00021199616,0.0004438195,0.00010059982,0.00042088283,0.00006836773,0.00040861015,0.000066612374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058938945,0.0002281544,0.00006432308,0.000054431566,0.000118935954,0.0000075870425,0.0015129023,0.000023454782,0.0009792427,0.9846947,0.0072006253,0.0051097535],"study_design_scores_gemma":[0.00024027779,0.000031403204,0.00011942956,0.00011327065,0.00006288956,0.000107189015,0.00034846875,0.017235946,0.00058060815,0.82979095,0.15112907,0.00024050253],"about_ca_topic_score_codex":0.000023958039,"about_ca_topic_score_gemma":0.000017005219,"teacher_disagreement_score":0.38619784,"about_ca_system_score_codex":0.00012239188,"about_ca_system_score_gemma":0.000107305634,"threshold_uncertainty_score":0.88043976},"labels":[],"label_agreement":null},{"id":"W38648097","doi":"10.2196/53241","title":"Nobelprize.org eductaional material","year":2011,"lang":"en","type":"article","venue":"JMIR Formative Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.24837148336171405,"score_gpt":0.47812406330187346,"score_spread":0.2297525799401594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38648097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89953125,0.0000036132449,0.00050829735,0.00044461622,0.00011450537,0.0004967345,0.000077330165,0.000120913595,0.09870276],"genre_scores_gemma":[0.99371517,0.0000048636293,0.004262695,0.000040061186,0.00014249799,0.00039252036,0.00002498438,0.000019184741,0.0013980513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855655,0.00015594727,0.000256522,0.00016005564,0.00049689773,0.00037402293],"domain_scores_gemma":[0.9990352,0.00016007679,0.000058111393,0.00030567945,0.00031315797,0.00012780576],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055832864,0.000100835394,0.0001345372,0.00018500119,0.0003110905,0.000038886035,0.00030389274,0.00006903192,0.0041417],"category_scores_gemma":[0.000041591324,0.000083972016,0.000060587674,0.00030907572,0.00019374922,0.00024210998,0.0001555592,0.00030905582,0.0019394119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010887366,0.000866308,0.00023284307,0.00007685038,0.00003564082,0.000004904109,0.011353037,2.6370401e-8,0.010331112,0.9087687,0.06703641,0.0011853027],"study_design_scores_gemma":[0.0010001957,0.00038259686,0.036628276,0.000075401855,0.000009897541,0.00006088191,0.003122276,0.000091688584,0.08640252,0.8315857,0.04022793,0.00041265393],"about_ca_topic_score_codex":0.000013062847,"about_ca_topic_score_gemma":0.0000022838801,"teacher_disagreement_score":0.0973047,"about_ca_system_score_codex":0.00006677885,"about_ca_system_score_gemma":0.00005508287,"threshold_uncertainty_score":0.9988377},"labels":[],"label_agreement":null},{"id":"W4200023254","doi":"10.1016/j.neucom.2021.11.108","title":"Predefined-time convergent neural networks for solving the time-varying nonsingular multi-linear tensor equations","year":2021,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Invertible matrix; Artificial neural network; Convergence (economics); Applied mathematics; Tensor (intrinsic definition); Mathematics; Invariant (physics); LTI system theory; Computer science; Mathematical optimization; Linear system; Mathematical analysis; Artificial intelligence; Pure mathematics","score_opus":0.05781329295032648,"score_gpt":0.31599939765656476,"score_spread":0.25818610470623826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200023254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07503107,0.000092702525,0.9189368,0.0035206284,0.00028994575,0.0011412344,0.000024692774,0.0004888588,0.00047404488],"genre_scores_gemma":[0.7752613,0.000003893087,0.21912824,0.0024795318,0.00084653,0.00013014713,0.00011493738,0.00013059434,0.0019048591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840003,0.00010780443,0.0005023879,0.00041209275,0.00018084269,0.00039685864],"domain_scores_gemma":[0.99674374,0.0021860965,0.00022678914,0.0004599518,0.00029471001,0.000088693356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027753724,0.00020870421,0.00026163357,0.000043626424,0.00094419933,0.0001353221,0.00023382362,0.00007312568,0.00013578663],"category_scores_gemma":[0.0006037302,0.0001826062,0.00022046789,0.00028662715,0.000045351775,0.00006555034,0.00016475315,0.00025995614,0.00006450337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000855504,0.001985555,0.00082251435,0.0003668517,0.0005162195,0.00009703682,0.0028033578,0.6533014,0.23272304,0.05301333,0.025081255,0.029203886],"study_design_scores_gemma":[0.000559036,0.000017424227,0.00011686815,0.0000370009,0.000082238774,0.00004537979,0.000033036642,0.99560565,0.0012895851,0.00088461116,0.0011417891,0.00018739665],"about_ca_topic_score_codex":0.0000020741218,"about_ca_topic_score_gemma":0.0000012348937,"teacher_disagreement_score":0.7002302,"about_ca_system_score_codex":0.00002969579,"about_ca_system_score_gemma":0.000039362218,"threshold_uncertainty_score":0.7446465},"labels":[],"label_agreement":null},{"id":"W4207006620","doi":"10.1145/3491223","title":"TT-TSVD: A Multi-modal Tensor Train Decomposition with Its Application in Convolutional Neural Networks for Smart Healthcare","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Singular value decomposition; Tensor (intrinsic definition); Convolutional neural network; Computer science; Reduction (mathematics); Modalities; Decomposition; Data mining; Tensor decomposition; Artificial intelligence; Big data; Pattern recognition (psychology); Algorithm; Mathematics; Chemistry","score_opus":0.05554688708277145,"score_gpt":0.35205559600128217,"score_spread":0.2965087089185107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207006620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013149536,0.00027148423,0.970727,0.010245257,0.000061459075,0.004528888,0.0006165348,0.00035242326,0.000047393],"genre_scores_gemma":[0.7764616,0.000070784736,0.2121911,0.00046423145,0.00006255288,0.00997878,0.0006517905,0.00006110882,0.000058026002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746114,0.0003052159,0.00078286673,0.0007022993,0.0002935449,0.0004549333],"domain_scores_gemma":[0.995219,0.0021892583,0.00034973188,0.0017512805,0.00028518983,0.00020552415],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005415979,0.0003433942,0.0003915323,0.00038409056,0.0027859698,0.00006744997,0.0010368174,0.00012089428,0.000027339342],"category_scores_gemma":[0.000029868499,0.00037805928,0.00014192918,0.00094916334,0.00023678494,0.0001370172,0.000103744496,0.0008432353,0.0000063397565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008551954,0.0154279275,0.0037015951,0.00040556947,0.0004666979,0.000002500663,0.004678497,0.16377582,0.0041727247,0.20901309,0.00051728834,0.5969831],"study_design_scores_gemma":[0.0027323759,0.00021700168,0.0026161394,0.000035575813,0.00009620197,0.000069540925,0.00090916076,0.9810825,0.000046024594,0.0049522812,0.006767076,0.00047613145],"about_ca_topic_score_codex":0.000112150294,"about_ca_topic_score_gemma":0.00047240683,"teacher_disagreement_score":0.8173067,"about_ca_system_score_codex":0.0002756361,"about_ca_system_score_gemma":0.00009205903,"threshold_uncertainty_score":0.99986714},"labels":[],"label_agreement":null},{"id":"W4210405460","doi":"10.1145/3483448","title":"Feature Extraction of High-dimensional Data Based on J-HOSVD for Cyber-Physical-Social Systems","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Management Information Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Feature extraction; Robustness (evolution); Data mining; Dimensionality reduction; Artificial intelligence; Big data; Pattern recognition (psychology); Benchmark (surveying); Machine learning","score_opus":0.05146768431163548,"score_gpt":0.32249296021106755,"score_spread":0.27102527589943204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210405460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010517711,0.000009249285,0.9706441,0.003379274,0.0016130039,0.0046886085,0.0057570282,0.00041382015,0.0029772143],"genre_scores_gemma":[0.9902318,0.0000018266837,0.004969574,0.00022629637,0.00009078279,0.0018575903,0.0014275367,0.000026641444,0.0011679379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980537,0.00012809921,0.00054954755,0.00025804437,0.00081692234,0.00019366729],"domain_scores_gemma":[0.9976928,0.00043782766,0.000528461,0.0011304,0.00015859642,0.00005188176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005366656,0.00020153145,0.00030502432,0.00042822026,0.0008041326,0.000101598256,0.00060796086,0.00006389789,0.000047539666],"category_scores_gemma":[0.000017246019,0.00020466791,0.00013291677,0.0004493513,0.000024675597,0.0005671116,0.00003218652,0.00023815587,0.00004681455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006010211,0.0018235596,0.0000033144122,0.001605264,0.00044895688,0.0000015816665,0.0006355832,0.5740753,0.00014549612,0.29797262,0.110753745,0.011933588],"study_design_scores_gemma":[0.004171734,0.00049519906,0.00022759844,0.00017347402,0.00051186135,0.000018972158,0.005415926,0.634354,0.00020224857,0.0030158132,0.35075763,0.000655554],"about_ca_topic_score_codex":0.000033407145,"about_ca_topic_score_gemma":0.0000013200831,"teacher_disagreement_score":0.9797141,"about_ca_system_score_codex":0.00019673811,"about_ca_system_score_gemma":0.000025580859,"threshold_uncertainty_score":0.83461154},"labels":[],"label_agreement":null},{"id":"W4211105203","doi":"10.1145/3491255","title":"Quantized Tensor Neural Network","year":2021,"lang":"en","type":"article","venue":"ACM/IMS Transactions on Data Science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Artificial neural network; Computer science; Artificial intelligence; Deep learning; Machine learning; Mathematics","score_opus":0.1596832134277979,"score_gpt":0.39083364715414226,"score_spread":0.23115043372634436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211105203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18273325,0.000121396166,0.78608876,0.02135972,0.0014389982,0.0007860752,0.0012220311,0.0009082753,0.005341474],"genre_scores_gemma":[0.8434577,0.000058937123,0.1542929,0.0010092111,0.0000926651,0.000036739566,0.00007923273,0.000021575897,0.0009510147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981957,0.000050476658,0.00028123535,0.00066163065,0.00044142196,0.00036954615],"domain_scores_gemma":[0.9961671,0.000442264,0.00007261415,0.0029858781,0.00017165179,0.00016048615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044295954,0.00013676025,0.00017172398,0.00008167191,0.00083866913,0.00018221243,0.001658244,0.000044359218,0.00059394736],"category_scores_gemma":[0.00026445437,0.00012719128,0.0000596504,0.0014457499,0.00031803423,0.00069683575,0.00006594269,0.00023518315,0.0002070199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023393882,0.0059555904,0.0005730638,0.00017681018,0.00028160168,0.00019159047,0.0012466179,0.012709961,0.16986403,0.50246054,0.13697018,0.16933605],"study_design_scores_gemma":[0.006704404,0.0004699184,0.017142273,0.00047137783,0.0009437872,0.001681905,0.0029313446,0.2705031,0.09456358,0.3235555,0.2770638,0.003969017],"about_ca_topic_score_codex":0.000010285869,"about_ca_topic_score_gemma":0.000051925817,"teacher_disagreement_score":0.66072446,"about_ca_system_score_codex":0.000034411336,"about_ca_system_score_gemma":0.0001547013,"threshold_uncertainty_score":0.65033066},"labels":[],"label_agreement":null},{"id":"W4220804418","doi":"10.5772/intechopen.102765","title":"Identification of Multilinear Systems: A Brief Overview","year":2022,"lang":"en","type":"book-chapter","venue":"IntechOpen eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Multilinear map; Nonlinear system; Identification (biology); Computer science; Context (archaeology); System identification; Tensor (intrinsic definition); Nonlinear system identification; Multidimensional systems; Separable space; Theoretical computer science; Mathematics; Data modeling; Physics; Pure mathematics","score_opus":0.0887579075520936,"score_gpt":0.345304649958902,"score_spread":0.25654674240680836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220804418","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011831914,0.000509324,0.0024506173,0.00009228629,0.00027225233,0.0018803885,0.00065390527,0.00022778819,0.9937951],"genre_scores_gemma":[0.022974951,0.000096367614,0.00072732894,0.000097013246,0.00009807729,0.00040003957,0.00009440635,0.00013519777,0.9753766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807143,0.000036962905,0.001019424,0.00036250346,0.0003852005,0.00012445962],"domain_scores_gemma":[0.99766344,0.00018712482,0.00091819436,0.00094862236,0.0002245504,0.000058049034],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033951976,0.00025442123,0.0005165869,0.00016986656,0.00010513533,0.000050810144,0.0005047585,0.00018613538,0.0014841001],"category_scores_gemma":[0.000045494216,0.00026768818,0.00024654483,0.000021105434,0.000092398215,0.000037932416,0.0002030078,0.0003961362,0.00017140018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009808991,0.000032978773,1.6524716e-7,0.00031534157,0.000089422334,0.0000037622997,0.00012245002,0.0000019903518,0.0017785412,0.98996335,0.004915269,0.0027669189],"study_design_scores_gemma":[0.0002479455,0.00003382224,9.4140773e-7,0.00039974242,0.00016406347,0.000034668632,0.000056026773,0.00018362825,0.0016686544,0.13438514,0.86252815,0.00029718777],"about_ca_topic_score_codex":0.00003810926,"about_ca_topic_score_gemma":0.00000979468,"teacher_disagreement_score":0.8576129,"about_ca_system_score_codex":0.000117456286,"about_ca_system_score_gemma":0.0000639952,"threshold_uncertainty_score":0.9999775},"labels":[],"label_agreement":null},{"id":"W4224442812","doi":"10.1109/msmc.2021.3114538","title":"Tensor-Based Knowledge Fusion and Reasoning for Cyberphysical-Social Systems: Theory and Framework","year":2022,"lang":"en","type":"article","venue":"IEEE Systems Man and Cybernetics Magazine","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Theoretical computer science; Knowledge representation and reasoning; Big data; Artificial intelligence; Data mining","score_opus":0.027479245115961278,"score_gpt":0.30684529109873315,"score_spread":0.27936604598277187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224442812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9512684,0.0026696725,0.03670418,0.00047016563,0.00061032304,0.002287169,0.0003415395,0.00027775063,0.0053708483],"genre_scores_gemma":[0.9937061,0.000029847162,0.0015620182,0.00008050957,0.00033970055,0.00046554202,0.000023401446,0.00005651828,0.0037363789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984902,0.0002976735,0.00036980212,0.0003924686,0.00019576987,0.00025406454],"domain_scores_gemma":[0.9983646,0.000953025,0.00020881253,0.000241794,0.00010388323,0.00012788667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006432487,0.00022596591,0.00040016888,0.000093716575,0.00073448016,0.00014682948,0.000110795605,0.000100945574,0.000013423395],"category_scores_gemma":[0.000061539744,0.00021867004,0.0000583817,0.00014982464,0.00012359399,0.000033859604,0.00007141037,0.00023110084,0.0000076159877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009771652,0.0002288901,0.00013960495,0.00067811564,0.00005405193,0.0000046839596,0.0014786668,0.00005588906,0.002145891,0.9850822,0.009055378,0.0009789114],"study_design_scores_gemma":[0.010227778,0.0016770284,0.007981334,0.001782524,0.0013592413,0.0006974145,0.01043826,0.16275531,0.00039515833,0.3050542,0.4942939,0.003337886],"about_ca_topic_score_codex":0.000011267842,"about_ca_topic_score_gemma":0.000004352456,"teacher_disagreement_score":0.680028,"about_ca_system_score_codex":0.000046103512,"about_ca_system_score_gemma":0.000025246667,"threshold_uncertainty_score":0.8917105},"labels":[],"label_agreement":null},{"id":"W4225656449","doi":"10.1109/access.2022.3160187","title":"The Tensor Multi-Linear Channel and Its Shannon Capacity","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Notation; Channel (broadcasting); Precoding; Domain (mathematical analysis); Computer science; Mathematics; Theoretical computer science; Topology (electrical circuits); Pure mathematics; MIMO; Mathematical analysis","score_opus":0.1867681659927632,"score_gpt":0.38627520862362347,"score_spread":0.19950704263086028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225656449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99184024,0.000077946825,0.0026376524,0.004008087,0.0002371231,0.00045684507,0.00011673586,0.00013012074,0.00049524655],"genre_scores_gemma":[0.99721396,0.000017278875,0.0006053792,0.00061774283,0.0000864249,0.00029580042,0.0000042337715,0.000017508304,0.0011416733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993313,0.00005484636,0.0001519226,0.00016162923,0.00015216396,0.00014812146],"domain_scores_gemma":[0.9993797,0.00019571937,0.000080024605,0.00021952135,0.00007409246,0.000050973355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018343024,0.000082690545,0.00009468738,0.000029005896,0.0008423541,0.00007116149,0.00034444616,0.00002182957,0.00006749646],"category_scores_gemma":[0.000042080665,0.000062570114,0.000030433943,0.00017324026,0.00002732844,0.00009111308,0.00012995154,0.00016733633,0.000024105842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042017445,0.005485894,0.0022853443,0.00071451475,0.0006973884,0.0000710577,0.016720058,0.0033616503,0.101052836,0.60494447,0.25042737,0.013819248],"study_design_scores_gemma":[0.0060921083,0.00024852675,0.015234089,0.00006390061,0.00028477964,0.00039768708,0.0028536918,0.42805123,0.070000865,0.25405362,0.2206519,0.0020676064],"about_ca_topic_score_codex":0.000017948554,"about_ca_topic_score_gemma":0.00002963916,"teacher_disagreement_score":0.4246896,"about_ca_system_score_codex":0.00002239416,"about_ca_system_score_gemma":0.000010097375,"threshold_uncertainty_score":0.6478792},"labels":[],"label_agreement":null},{"id":"W4229791652","doi":"10.31234/osf.io/pr8kd","title":"The memory tesseract: Mathematical equivalence between composite and separate storage memory models","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Carleton University","funders":"","keywords":"Unification; Computer science; Memory model; Equivalence (formal languages); Storage model; Computer data storage; Tensor (intrinsic definition); Auxiliary memory; Theoretical computer science; Artificial intelligence; Mathematics; Parallel computing; Shared memory; Pure mathematics; Programming language","score_opus":0.09051695469425543,"score_gpt":0.3571670243566651,"score_spread":0.26665006966240967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229791652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58138716,0.0007426333,0.26293525,0.005090085,0.0003400201,0.0038203644,0.0003687363,0.00085044885,0.14446531],"genre_scores_gemma":[0.9458285,0.00019249087,0.03025649,0.000266622,0.00022435977,0.00029324638,0.00007265062,0.00010753002,0.022758098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975482,0.0001588125,0.00076436385,0.0006541055,0.0004704425,0.00040404475],"domain_scores_gemma":[0.99530536,0.0023631211,0.00041688894,0.0015365257,0.00017791208,0.00020016647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007050142,0.0004632692,0.00071683625,0.00007809979,0.00039513636,0.00037310392,0.00077593955,0.0003327465,0.00016592053],"category_scores_gemma":[0.000051667495,0.00032627225,0.00019392437,0.000091504364,0.0002201574,0.00014640049,0.0011160008,0.0009008695,0.0003399754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062310355,0.00063291384,0.00016637324,0.0033315816,0.00081673375,0.000022213388,0.0031019133,0.0061002127,0.0022400392,0.94420093,0.034861676,0.004463104],"study_design_scores_gemma":[0.00033876635,0.00001924545,0.00023907075,0.00027003512,0.00025192284,0.000028611543,0.00024488676,0.060023487,0.0009831507,0.9366912,0.00035396684,0.0005556113],"about_ca_topic_score_codex":0.000012351138,"about_ca_topic_score_gemma":0.0000034672762,"teacher_disagreement_score":0.36444137,"about_ca_system_score_codex":0.00007294704,"about_ca_system_score_gemma":0.000083780826,"threshold_uncertainty_score":0.99991894},"labels":[],"label_agreement":null},{"id":"W4231767232","doi":"10.1007/978-1-4939-7131-2_100469","title":"Homogeneity Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Homogeneity (statistics); Mathematics; Statistics","score_opus":0.06590848720974263,"score_gpt":0.32851591009723835,"score_spread":0.2626074228874957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231767232","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012897984,0.000015324224,0.01705319,0.00016537475,0.000025191812,0.00013214063,0.000084621046,0.00018793331,0.98220724],"genre_scores_gemma":[0.0011067342,0.00001441558,0.018038152,0.00017963316,0.00015262364,0.000009422548,0.000083835395,0.00002940512,0.9803858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992869,0.000004317474,0.00023437162,0.00023767464,0.0001497766,0.000086990716],"domain_scores_gemma":[0.99901026,0.000072260715,0.000130153,0.0006052674,0.000115917486,0.000066156594],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006278807,0.00015958423,0.00031843653,0.00017546349,0.000067930465,0.000022608376,0.00015308602,0.00017336928,0.04883084],"category_scores_gemma":[0.000006323199,0.00013984271,0.00035717562,0.000056639306,0.00005689778,0.000014058933,0.000042168183,0.00009746367,0.0026565085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6523594e-7,0.000014169804,0.0000033003103,0.000005948318,0.0005622492,8.100904e-7,0.000014211855,8.9267026e-8,0.0000070990327,0.9109953,0.08821303,0.00018305433],"study_design_scores_gemma":[0.00003763012,0.0000069213943,0.000021083762,0.0000052807363,0.0012424794,0.0000018995447,0.0000023948028,0.00003065022,0.00005960855,0.67827797,0.3201514,0.00016269997],"about_ca_topic_score_codex":0.0000029415473,"about_ca_topic_score_gemma":0.00008373477,"teacher_disagreement_score":0.2327173,"about_ca_system_score_codex":0.000025857016,"about_ca_system_score_gemma":0.000012574839,"threshold_uncertainty_score":0.99812},"labels":[],"label_agreement":null},{"id":"W4233974870","doi":"10.1007/978-1-4939-7131-2_101334","title":"Tensor Decomposition","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Decomposition; Chemistry; Organic chemistry","score_opus":0.058710707546639374,"score_gpt":0.34099597049566155,"score_spread":0.2822852629490222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233974870","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009643837,0.00001708594,0.0065367213,0.0005385566,0.000094400966,0.0003222051,0.000057317706,0.00039395076,0.9919433],"genre_scores_gemma":[0.0004561893,0.000018641987,0.03613847,0.00049085997,0.00041614182,0.000022194534,0.00009661231,0.000076872966,0.962284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990647,0.000006099356,0.00031870566,0.0002899358,0.00018693594,0.00013364389],"domain_scores_gemma":[0.9989661,0.00011557177,0.00016823235,0.0004957182,0.00016688103,0.000087508524],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006267828,0.00023562668,0.0002628397,0.00009988654,0.00010748674,0.00003754809,0.00016474127,0.00025789026,0.02976553],"category_scores_gemma":[0.00000848868,0.00021243196,0.00016920244,0.000014879988,0.00007955604,0.000035257402,0.00004421373,0.00016771702,0.0074785682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029378275,0.000018082706,2.3036183e-7,0.000013945844,0.000028105233,0.0000017069242,0.00001692618,1.8963066e-8,0.000074710355,0.7548813,0.24458393,0.00037808175],"study_design_scores_gemma":[0.000086119275,0.000022218346,0.0000032980545,0.00004440127,0.00005578308,0.000022687764,0.000003184229,0.000013694031,0.0001523447,0.61120903,0.38820362,0.00018359847],"about_ca_topic_score_codex":9.219255e-7,"about_ca_topic_score_gemma":0.000007680131,"teacher_disagreement_score":0.14367227,"about_ca_system_score_codex":0.0000511329,"about_ca_system_score_gemma":0.000018092656,"threshold_uncertainty_score":0.99329424},"labels":[],"label_agreement":null},{"id":"W4237698854","doi":"10.1007/978-1-4614-6170-8_110012","title":"Homogeneity Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Homogeneity (statistics); Mathematics; Statistics","score_opus":0.05307208160447776,"score_gpt":0.3136455422301744,"score_spread":0.26057346062569664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237698854","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029550207,0.000013033793,0.09731418,0.00023971348,0.00001818131,0.000112319736,0.000042271447,0.0001737791,0.902057],"genre_scores_gemma":[0.003922289,0.000013182012,0.013526959,0.00025511923,0.00009570251,0.000010596164,0.00008893743,0.000030336409,0.98205686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999292,0.000005993817,0.00024314954,0.00022620159,0.00014889581,0.00008373801],"domain_scores_gemma":[0.99899894,0.00011608851,0.00013855557,0.00060384144,0.00007400159,0.00006855159],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000756694,0.00016186778,0.0003719976,0.00017174776,0.0000587185,0.00002101107,0.00014720108,0.00016966996,0.0098302895],"category_scores_gemma":[0.0000074344293,0.00014237936,0.00039346877,0.00004467032,0.00003040648,0.00000744758,0.000034078945,0.000120005716,0.0011915051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.8942405e-7,0.000008101086,0.000004124863,0.000008218845,0.0004213234,4.886974e-7,0.000004386281,7.639824e-7,0.0000058338974,0.96994114,0.028908527,0.0006966182],"study_design_scores_gemma":[0.000044160548,0.000004699726,0.000027312808,0.0000051972374,0.0012911964,0.0000016820164,8.248625e-7,0.000084698724,0.000029536903,0.5777517,0.42058492,0.00017410766],"about_ca_topic_score_codex":0.000003608276,"about_ca_topic_score_gemma":0.00006156173,"teacher_disagreement_score":0.39218944,"about_ca_system_score_codex":0.000021798221,"about_ca_system_score_gemma":0.000008778649,"threshold_uncertainty_score":0.99958616},"labels":[],"label_agreement":null},{"id":"W4240094840","doi":"10.1002/0470013192.bsa459","title":"Optimal Scaling","year":2005,"lang":"en","type":"other","venue":"Encyclopedia of Statistics in Behavioral Science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scaling; Transformation (genetics); Variety (cybernetics); Column (typography); Computer science; Scale (ratio); Ordinal data; Matrix (chemical analysis); Key (lock); Algorithm; Data Matrix; Multidimensional scaling; Mathematics; Statistics; Artificial intelligence; Physics; Geometry","score_opus":0.03822121135356509,"score_gpt":0.3766746153828547,"score_spread":0.3384534040292896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240094840","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010158112,0.00009370961,0.03429562,0.00005061534,0.00046172328,0.00072511507,0.0015796679,0.00019593915,0.9524395],"genre_scores_gemma":[0.0034995736,0.0002327266,0.82519186,0.000011838342,0.00014396672,0.000041059746,0.000029649957,0.0001443613,0.17070498],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983943,0.000017320306,0.000418296,0.00034950115,0.0005307859,0.00028976088],"domain_scores_gemma":[0.9990656,0.0000908557,0.00029887134,0.00036874847,0.000070662725,0.0001052564],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025607628,0.00018209532,0.000295507,0.00038205305,0.000053870917,0.00002372323,0.00052271684,0.00011654039,0.002558471],"category_scores_gemma":[0.00008058346,0.00018367422,0.0000315588,0.0004922784,0.0005766488,0.000055163237,0.00009577541,0.00021697428,0.00005623111],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007836132,0.0015555655,0.0015274667,0.00016408214,0.000007039632,0.00004060954,0.0010294991,0.000047885136,0.00057181064,0.4340815,0.49722356,0.063743174],"study_design_scores_gemma":[0.0015915671,0.00023305668,0.009411598,0.0012379696,0.00029412072,0.00003356776,0.0005812835,0.0011596858,0.0005702416,0.041575402,0.94094175,0.0023697792],"about_ca_topic_score_codex":0.00017153966,"about_ca_topic_score_gemma":0.00021176375,"teacher_disagreement_score":0.79089624,"about_ca_system_score_codex":0.00008711056,"about_ca_system_score_gemma":0.00015192165,"threshold_uncertainty_score":0.9983533},"labels":[],"label_agreement":null},{"id":"W4240954477","doi":"10.1016/b978-0-08-044894-7.01348-8","title":"Multidimensional Scaling","year":2010,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multidimensional scaling; Similarity (geometry); Set (abstract data type); Multidimensional analysis; Computer science; Variety (cybernetics); Space (punctuation); Scaling; Object (grammar); Multidimensional data; Scale (ratio); Data set; Data mining; Theoretical computer science; Mathematics; Artificial intelligence; Geography; Machine learning; Cartography; Image (mathematics); Statistics; Geometry","score_opus":0.035947023293803414,"score_gpt":0.30015456327842993,"score_spread":0.26420753998462654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240954477","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002103835,0.000061102095,0.000089171226,0.0001666998,0.00023266017,0.00043389274,0.000054175423,0.00019875186,0.99855316],"genre_scores_gemma":[0.00027458605,0.000007056473,0.04818783,0.00032987166,0.00036385027,0.00004121747,0.000036308295,0.00010263052,0.95065665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987511,0.000010107978,0.00041397518,0.00034981262,0.000289022,0.00018598404],"domain_scores_gemma":[0.9987053,0.00019425544,0.00023419569,0.00060287677,0.0001280903,0.000135249],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013996674,0.00030734405,0.00037075684,0.00009645197,0.00018488061,0.000026171721,0.00018490534,0.00041589476,0.001425869],"category_scores_gemma":[0.000021580145,0.00028844675,0.00025085892,0.000006030916,0.000117269985,0.000016284432,0.00008961032,0.00074392546,0.001104194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034838458,0.00001700289,2.8607053e-7,0.000036571328,0.00004570501,0.000008064468,0.00007012275,6.169106e-8,0.0014414919,0.5691955,0.00051372417,0.428668],"study_design_scores_gemma":[0.00012366343,0.00000504895,0.000001958968,0.000113000926,0.00006308947,0.000020877953,0.0000015296235,0.000006540904,0.0003643872,0.32337102,0.6757028,0.00022605044],"about_ca_topic_score_codex":8.771306e-8,"about_ca_topic_score_gemma":0.0000057534457,"teacher_disagreement_score":0.6751891,"about_ca_system_score_codex":0.000032130036,"about_ca_system_score_gemma":0.000050054434,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W4241693471","doi":"10.23952/jnva.4.2020.1.07","title":"Tensor variational inequalities: theoretical results, numerical methods and applications to an economic equilibrium model","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per il Calcolo Scientifico; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Variational inequality; Tensor (intrinsic definition); Mathematical economics; Applied mathematics; Inequality; Mathematics; General equilibrium theory; Mathematical optimization; Economics; Statistical physics; Physics; Mathematical analysis; Pure mathematics; Microeconomics","score_opus":0.0696455019492705,"score_gpt":0.40214206658467017,"score_spread":0.33249656463539967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241693471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010558559,0.000019103909,0.9730298,0.015505112,0.000012582423,0.00013134365,0.00049772474,0.000020468526,0.00022531148],"genre_scores_gemma":[0.22059302,0.000013875612,0.77740824,0.0012504053,0.00057673815,0.00001578998,0.00008938594,0.000014131403,0.000038413455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831176,0.00020102477,0.00085921935,0.00026326883,0.00023963628,0.00012506389],"domain_scores_gemma":[0.9977981,0.0009851931,0.00036728586,0.00015568706,0.00029113924,0.0004026136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009711835,0.0001387661,0.00043902505,0.00021554578,0.00010943188,0.00009474561,0.00016237769,0.00007384877,0.0001511019],"category_scores_gemma":[0.00038658985,0.00011834551,0.00016888433,0.000384872,0.000056953868,0.00019136845,0.000059824175,0.000169504,0.000006853937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017323751,0.00018937363,0.00020213102,0.000013425226,0.0006412987,7.3612966e-7,0.0007872096,0.03567293,0.00067280437,0.9604518,0.00037031723,0.00082473655],"study_design_scores_gemma":[0.0004235022,0.00008872085,0.0011458993,0.000002855793,0.0007372659,0.000015517991,0.000112336034,0.8554193,0.0000315819,0.1404911,0.0013995908,0.00013236114],"about_ca_topic_score_codex":0.000005015881,"about_ca_topic_score_gemma":0.0000013011742,"teacher_disagreement_score":0.8199607,"about_ca_system_score_codex":0.000036889207,"about_ca_system_score_gemma":0.00011265547,"threshold_uncertainty_score":0.482599},"labels":[],"label_agreement":null},{"id":"W4251360357","doi":"10.1002/9781118445112.stat06456","title":"Optimal Scaling","year":2014,"lang":"en","type":"other","venue":"Wiley StatsRef: Statistics Reference Online","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scaling; Transformation (genetics); Variety (cybernetics); Column (typography); Scale (ratio); Ordinal data; Matrix (chemical analysis); Key (lock); Computer science; Data Matrix; Interval (graph theory); Multidimensional scaling; Algorithm; Mathematics; Statistics; Artificial intelligence; Combinatorics; Connection (principal bundle); Geometry","score_opus":0.06851394283590133,"score_gpt":0.36800897850302366,"score_spread":0.2994950356671223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251360357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006299336,0.00030571787,0.8272268,0.00016474914,0.00028412446,0.0006380118,0.03860527,0.0009288128,0.1317835],"genre_scores_gemma":[0.00013710665,0.00072379265,0.73980427,0.0001889077,0.00046921277,0.000056541954,0.006374392,0.0006724256,0.25157335],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975532,0.00010473922,0.0006817024,0.000651097,0.0005176791,0.0004915765],"domain_scores_gemma":[0.9975764,0.00042172498,0.0006295042,0.0009202448,0.00018384607,0.000268278],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015005717,0.0005486624,0.00074676395,0.00028536582,0.00012058345,0.00008653304,0.0005098528,0.00039352584,0.007017299],"category_scores_gemma":[0.0002139585,0.0005214373,0.00008006213,0.00019484501,0.0001815001,0.000027530536,0.00011828413,0.00060118275,0.0010059493],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007795978,0.00025478128,0.0000040450877,0.00019407317,0.000070102484,0.000009994939,0.000029230585,0.00000705928,0.000025789144,0.2304648,0.75944275,0.009489573],"study_design_scores_gemma":[0.0005180063,0.000070181035,0.000016032283,0.00056588475,0.00017322143,0.000013637868,0.00004950659,0.0019852836,0.000011255464,0.07614982,0.91973823,0.0007089382],"about_ca_topic_score_codex":0.00007572575,"about_ca_topic_score_gemma":0.0002691363,"teacher_disagreement_score":0.16029547,"about_ca_system_score_codex":0.00006494818,"about_ca_system_score_gemma":0.00011920735,"threshold_uncertainty_score":0.9997719},"labels":[],"label_agreement":null},{"id":"W4283696279","doi":"10.1109/msp.2022.3163870","title":"Reproducibility in Matrix and Tensor Decompositions: Focus on model match, interpretability, and uniqueness","year":2022,"lang":"en","type":"article","venue":"IEEE Signal Processing Magazine","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Baycrest Hospital","funders":"National Institute on Aging; Norges Forskningsråd; National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health; U.S. Department of Health and Human Services","keywords":"Interpretability; Uniqueness; Focus (optics); Computer science; Audit; Tensor (intrinsic definition); Matrix (chemical analysis); Point (geometry); Artificial intelligence; Algorithm; Theoretical computer science; Mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Physics; Accounting; Geometry","score_opus":0.04122156571030822,"score_gpt":0.3400429608258426,"score_spread":0.2988213951155344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283696279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97266334,0.00025240023,0.022075022,0.0030783066,0.000024894805,0.0006101788,0.00007480354,0.00018024762,0.0010408048],"genre_scores_gemma":[0.98656327,0.000006807196,0.012614807,0.00019286868,0.000024170226,0.00020747476,0.000008231543,0.000030350626,0.00035202454],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980072,0.00015385987,0.00044919233,0.00095468137,0.00022504502,0.00021005633],"domain_scores_gemma":[0.9988795,0.00021819361,0.00013956339,0.00059482094,0.00008412902,0.00008380739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010973675,0.00018873771,0.00028917825,0.00015970132,0.00033107147,0.000081094826,0.00015537004,0.000047409343,0.000059689337],"category_scores_gemma":[0.000069425165,0.00018848634,0.00003927615,0.0002970711,0.00012542531,0.0001443595,0.0001354965,0.00034784418,0.0000047433327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003048465,0.011384167,0.0129176825,0.0042720004,0.00015251567,0.00019372973,0.013065174,0.041214857,0.5178761,0.19952393,0.007253958,0.18909742],"study_design_scores_gemma":[0.0009201855,0.00018120653,0.002035188,0.00013951058,0.00004862884,0.0001919772,0.00019834795,0.21527262,0.00407346,0.77638113,0.0001410281,0.00041673222],"about_ca_topic_score_codex":0.00001114501,"about_ca_topic_score_gemma":0.000020413403,"teacher_disagreement_score":0.5768572,"about_ca_system_score_codex":0.00011206129,"about_ca_system_score_gemma":0.00007364835,"threshold_uncertainty_score":0.76862496},"labels":[],"label_agreement":null},{"id":"W4283820924","doi":"10.1609/aaai.v36i3.20261","title":"Handling Slice Permutations Variability in Tensor Recovery","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Subspace topology; Algorithm; Exploit; Tensor contraction; Computer science; Mathematics; Exact solutions in general relativity; Artificial intelligence; Pure mathematics; Mathematical analysis","score_opus":0.12533328613039185,"score_gpt":0.34758533996514046,"score_spread":0.2222520538347486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283820924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9667402,0.0000043119694,0.0045992024,0.005553434,0.00019624319,0.00076085713,0.000052575673,0.00008617378,0.022007015],"genre_scores_gemma":[0.99688756,0.000005119676,0.0022662566,0.00017698725,0.000027339624,0.00021250157,0.0000015759374,0.000013318897,0.00040934607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985377,0.00005150924,0.0005522668,0.00031807213,0.0003388992,0.00020155155],"domain_scores_gemma":[0.9986951,0.00045331987,0.00029324586,0.00021249262,0.00030182963,0.000044017783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009871795,0.0001308354,0.00020472334,0.00012204738,0.00036520866,0.000059674912,0.00061052217,0.000039871305,0.00066976575],"category_scores_gemma":[0.0010128053,0.00011401738,0.00010234785,0.0006422901,0.000121083176,0.00011048167,0.00019152906,0.00038305594,0.00002666221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005913192,0.0004195055,0.00035772184,0.000029298722,0.000007694405,1.7677111e-7,0.001247557,0.00020738668,0.02171453,0.9712203,0.00022422108,0.0045124395],"study_design_scores_gemma":[0.000031911062,0.00007157268,0.0004727476,0.000050765044,0.000017347502,0.000005543652,0.0026321681,0.011477116,0.049512476,0.9354038,0.00017444973,0.00015008035],"about_ca_topic_score_codex":0.000036751706,"about_ca_topic_score_gemma":0.000017026321,"teacher_disagreement_score":0.03581651,"about_ca_system_score_codex":0.0001069078,"about_ca_system_score_gemma":0.00007556056,"threshold_uncertainty_score":0.7333465},"labels":[],"label_agreement":null},{"id":"W4285133964","doi":"10.1109/tgrs.2022.3179275","title":"Efficient Tensor Completion Methods for 5-D Seismic Data Reconstruction: Low-Rank Tensor Train and Tensor Ring","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Matrix decomposition; Rank (graph theory); Computer science; Tensor contraction; Matrix (chemical analysis); Algorithm; Cartesian tensor; Mathematics; Tensor field; Tensor density; Exact solutions in general relativity; Geometry; Physics; Combinatorics; Mathematical analysis","score_opus":0.07786585200162596,"score_gpt":0.3602344492309203,"score_spread":0.2823685972292943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285133964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16909148,0.00003010116,0.8278195,0.0015810621,0.00042085143,0.0006349037,0.00021013788,0.0001373221,0.00007465045],"genre_scores_gemma":[0.2834987,0.000031749416,0.71558154,0.00039847696,0.000057702204,0.000005622037,0.000011239378,0.000031607207,0.00038335708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801785,0.00020377368,0.0004156238,0.0007604572,0.00025133055,0.00035096525],"domain_scores_gemma":[0.998357,0.0006641986,0.00016004263,0.00057144416,0.000105889005,0.00014141953],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010272228,0.00022089217,0.00031057475,0.00026342558,0.002277708,0.000108154636,0.00020390419,0.00006582807,0.00002579904],"category_scores_gemma":[0.000045295215,0.00021345532,0.000083982326,0.0004464912,0.00031596376,0.0001054525,0.000015793978,0.0003376749,0.0000025457534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065832835,0.00011502755,5.640143e-7,0.00007220771,0.000028335015,0.000003088251,0.0005904901,0.0034069573,0.02313669,0.0002372742,0.000069187954,0.97227436],"study_design_scores_gemma":[0.0007093855,0.000095957854,0.00007876151,0.00007012737,0.000105231156,0.0010610612,0.0013790412,0.98903286,0.0020224273,0.0031376209,0.00201921,0.00028831867],"about_ca_topic_score_codex":0.00006335579,"about_ca_topic_score_gemma":0.00001392171,"teacher_disagreement_score":0.9856259,"about_ca_system_score_codex":0.000077681565,"about_ca_system_score_gemma":0.00004651327,"threshold_uncertainty_score":0.9990212},"labels":[],"label_agreement":null},{"id":"W4285505181","doi":"10.1109/tii.2022.3190549","title":"Jointly Low-Rank Tensor Completion for Estimating Missing Spatiotemporal Values in Logistics Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Imputation (statistics); Missing data; Exploit; Data mining; Rank (graph theory); Trajectory; Matrix completion; Artificial intelligence; Machine learning; Mathematics","score_opus":0.1619201742071927,"score_gpt":0.3428514528192143,"score_spread":0.1809312786120216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285505181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031859756,0.000003474869,0.9633817,0.00044779514,0.0014449612,0.0016490923,0.000647359,0.00021203619,0.0003538209],"genre_scores_gemma":[0.8950525,0.0000018655501,0.1033223,0.00019477912,0.0002316756,0.00079213,0.00010629612,0.000049403563,0.0002490664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975267,0.0001381365,0.0013699257,0.0001690249,0.0004583578,0.00033787458],"domain_scores_gemma":[0.9979682,0.00090941286,0.00052772945,0.00035013305,0.00014096947,0.000103530845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080080214,0.0002428716,0.00042620895,0.00037701608,0.0008987389,0.00015236736,0.00023908453,0.00015937959,0.00009393266],"category_scores_gemma":[0.000105715146,0.00026352727,0.00015320907,0.00046566018,0.000071131966,0.00022575415,0.0000050387007,0.00070712634,0.000016465892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025341864,0.0009322567,0.000023896846,0.0003638502,0.00008303008,0.0000029041403,0.0027930324,0.9658332,0.00020630959,0.009119928,0.00900099,0.01138719],"study_design_scores_gemma":[0.0027800153,0.00028622273,0.0000067904175,0.00018379313,0.0000953623,0.00003853004,0.0031317095,0.98372394,0.00081154425,0.0065699928,0.001974227,0.00039790312],"about_ca_topic_score_codex":0.00006898091,"about_ca_topic_score_gemma":0.000007169415,"teacher_disagreement_score":0.86319274,"about_ca_system_score_codex":0.0004126568,"about_ca_system_score_gemma":0.00013036952,"threshold_uncertainty_score":0.9999817},"labels":[],"label_agreement":null},{"id":"W4285732454","doi":"10.3390/sym14071460","title":"The Minimum-Norm Least Squares Solutions to Quaternion Tensor Systems","year":2022,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Quaternion; Norm (philosophy); Mathematics; Tensor (intrinsic definition); Least-squares function approximation; Pure mathematics; Geometry","score_opus":0.0511561823783001,"score_gpt":0.3130702990485122,"score_spread":0.2619141166702121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285732454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8933864,0.0010205815,0.029323505,0.035750974,0.002814309,0.0033044782,0.000788752,0.0011774533,0.032433517],"genre_scores_gemma":[0.992705,0.000004208548,0.00065473025,0.000256323,0.00013355682,0.00058217003,0.000013109359,0.000024998006,0.00562594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988293,0.00012592705,0.00027273287,0.0001955287,0.00030638775,0.00027014234],"domain_scores_gemma":[0.9989192,0.00035855413,0.00008991292,0.00047330683,0.00006500069,0.000094053554],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00037759295,0.00010455465,0.00012557508,0.000087794135,0.0014056793,0.00009020926,0.00031843613,0.000026516302,0.00009939329],"category_scores_gemma":[0.0000822589,0.00008176959,0.000082135375,0.00035362213,0.000032238706,0.000033016368,0.00017008354,0.00017047764,0.0003182373],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002231196,0.00023703894,0.00030966583,0.000030433295,0.00004553625,0.0000029723171,0.0004634562,0.00015108047,0.0022160106,0.78756577,0.20755929,0.0013964413],"study_design_scores_gemma":[0.0008181341,0.0002840521,0.004249247,0.00004760106,0.00010539887,0.00015216936,0.017601356,0.0051489607,0.00047894736,0.052567594,0.9178581,0.000688444],"about_ca_topic_score_codex":0.00005836499,"about_ca_topic_score_gemma":0.00001734216,"teacher_disagreement_score":0.73499817,"about_ca_system_score_codex":0.00011302965,"about_ca_system_score_gemma":0.00002375077,"threshold_uncertainty_score":0.9998944},"labels":[],"label_agreement":null},{"id":"W4286891768","doi":"10.48550/arxiv.2110.15479","title":"The Set of Orthogonal Tensor Trains","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Rank (graph theory); Mathematics; Set (abstract data type); Extension (predicate logic); Quadratic equation; Decomposition; Pure mathematics; Invariants of tensors; Type (biology); Algebra over a field; Applied mathematics; Combinatorics; Computer science; Geometry","score_opus":0.17111979242357392,"score_gpt":0.2480399177449049,"score_spread":0.07692012532133097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286891768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9678448,0.000037157362,0.025531003,0.0004297497,0.00013407026,0.00030808794,0.000175212,0.00009658353,0.005443341],"genre_scores_gemma":[0.995585,0.0001280207,0.0009952282,0.00003985374,0.000055555996,0.0000021417884,0.000053490145,0.000019411136,0.0031212727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990145,0.00010534222,0.0002349691,0.0003919121,0.0000777031,0.00017558542],"domain_scores_gemma":[0.9981839,0.0004045857,0.0002772954,0.0008189718,0.00023469048,0.0000805517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016450093,0.0001739325,0.00026568671,0.00006109844,0.00018894464,0.00003966011,0.0005118606,0.00017010959,0.00015771651],"category_scores_gemma":[0.00006544735,0.00015600077,0.0002910928,0.00023990747,0.00016988766,0.00003884454,0.00034902565,0.00037759924,0.000019092655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025607247,0.0001472532,0.0006412066,0.000114051145,0.0002128197,0.000052787742,0.00036007926,0.0025906938,0.0002633955,0.9932969,0.002040085,0.00025510398],"study_design_scores_gemma":[0.0012652864,0.00005766472,0.008003906,0.0003053353,0.00077196135,0.00003280822,0.0048432467,0.030416526,0.0012749213,0.9408324,0.011231941,0.0009640528],"about_ca_topic_score_codex":0.000013749437,"about_ca_topic_score_gemma":0.00008529488,"teacher_disagreement_score":0.052464567,"about_ca_system_score_codex":0.0000539443,"about_ca_system_score_gemma":0.00012946532,"threshold_uncertainty_score":0.6361526},"labels":[],"label_agreement":null},{"id":"W4288374796","doi":"10.48550/arxiv.1904.03858","title":"The Kikuchi Hierarchy and Tensor PCA","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Banff International Research Station for Mathematical Innovation and Discovery; Johns Hopkins University; National Science Foundation","keywords":"Hessian matrix; Tensor (intrinsic definition); Hierarchy; Mathematics; Algorithm; Statistical inference; Theoretical computer science; Computer science; Discrete mathematics; Applied mathematics; Pure mathematics","score_opus":0.10748845762231672,"score_gpt":0.2285682961902354,"score_spread":0.12107983856791867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288374796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9520589,0.00011519743,0.024794536,0.0013521552,0.0002984983,0.00091682596,0.00008895066,0.000280344,0.020094575],"genre_scores_gemma":[0.9834373,0.00036910834,0.0007317401,0.00010819403,0.00006301819,0.0000028280156,0.000013967489,0.000026748916,0.015247089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895585,0.00008711,0.0001648531,0.0005102272,0.000060848484,0.0002210924],"domain_scores_gemma":[0.9981771,0.00051033293,0.00018251837,0.00092038326,0.00010275288,0.00010690576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015654742,0.00021090574,0.00023308334,0.000079613295,0.0003173636,0.00009128536,0.0004871596,0.00018501744,0.00005051493],"category_scores_gemma":[0.000046634552,0.0001791031,0.00013672751,0.00014552518,0.00017833406,0.000052582454,0.00056675763,0.0004846227,0.00016485272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030367415,0.000073821175,0.001182206,0.000083987485,0.000102500635,0.000017264967,0.00012963994,0.00095557014,0.000044810757,0.9910404,0.00603192,0.00030750778],"study_design_scores_gemma":[0.00056883675,0.000029357327,0.0030670038,0.000078985526,0.00019982675,0.000011398685,0.0002982168,0.023182109,0.000062351995,0.9462764,0.025781222,0.0004442937],"about_ca_topic_score_codex":0.00001948022,"about_ca_topic_score_gemma":0.000022337887,"teacher_disagreement_score":0.044764005,"about_ca_system_score_codex":0.00006498084,"about_ca_system_score_gemma":0.00005533972,"threshold_uncertainty_score":0.7303612},"labels":[],"label_agreement":null},{"id":"W4293508040","doi":"10.1214/22-ejs2035","title":"Improved estimation in tensor regression with multiple change-points","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Estimator; Tensor (intrinsic definition); Context (archaeology); Applied mathematics; Regression; Statistics; Pure mathematics","score_opus":0.025661414888054183,"score_gpt":0.308099937728837,"score_spread":0.2824385228407828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293508040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24553113,0.00021426585,0.75169885,0.0016898388,0.00009441744,0.00053807633,0.00014032409,0.000031859872,0.00006124321],"genre_scores_gemma":[0.89445317,0.000036435504,0.10520934,0.000094660376,0.00003329794,0.000043302796,0.000016893862,0.000020465626,0.000092454866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889827,0.000086701824,0.00038123716,0.00009519344,0.00028131317,0.0002572728],"domain_scores_gemma":[0.99894655,0.00028739386,0.00047251603,0.00012495645,0.000120125704,0.000048440368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040061626,0.00009693014,0.00019206356,0.00014740674,0.00012831998,0.000014844557,0.00014236894,0.000020618745,0.000107204556],"category_scores_gemma":[0.00013947247,0.00007764713,0.000028172954,0.00020880249,0.000021976679,0.00008631325,0.00002676605,0.0004972578,0.0000013968482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023483373,0.0036076219,0.0071072583,0.00023948475,0.00033907895,0.0002737676,0.0064561954,0.002530692,0.012031075,0.8740683,0.018888399,0.07210975],"study_design_scores_gemma":[0.008253499,0.0036210113,0.0070854756,0.00021049769,0.00020817074,0.0016777522,0.001870123,0.29206884,0.0016774304,0.678127,0.0045726364,0.0006275466],"about_ca_topic_score_codex":0.000009548753,"about_ca_topic_score_gemma":0.000065886976,"teacher_disagreement_score":0.648922,"about_ca_system_score_codex":0.00031945982,"about_ca_system_score_gemma":0.00014589512,"threshold_uncertainty_score":0.3166358},"labels":[],"label_agreement":null},{"id":"W4300582220","doi":"10.48550/arxiv.1111.6091","title":"An adaptive algebraic multigrid algorithm for low-rank canonical tensor\\n decomposition","year":2011,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Rank (graph theory); Tensor (intrinsic definition); Mathematics; Relaxation (psychology); Multiplicative function; Algebraic number; Computation; Applied mathematics; Decomposition; Algorithm; Pure mathematics; Mathematical analysis; Combinatorics","score_opus":0.10483292272040505,"score_gpt":0.2550927736559139,"score_spread":0.1502598509355088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300582220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21572067,0.000041523097,0.7768498,0.00008573694,0.000541765,0.0032207307,0.0013644837,0.00044052087,0.0017347743],"genre_scores_gemma":[0.90528846,0.00025371942,0.0913611,0.00021737843,0.00045098364,0.000068767564,0.00068185787,0.00018487292,0.0014928959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99430764,0.00048712792,0.00108981,0.002783307,0.00021928456,0.0011128552],"domain_scores_gemma":[0.993424,0.0007802465,0.0011563187,0.0024522012,0.0011842697,0.001002948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000507182,0.0011940432,0.0013490331,0.00052448665,0.0010158976,0.00017719693,0.0017798847,0.001259376,0.00087434804],"category_scores_gemma":[0.0000499191,0.0014827955,0.0011727735,0.00064859947,0.0005964167,0.00059299683,0.0005289722,0.0012753151,0.00056747295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017879651,0.0095986985,0.00026141564,0.00067486666,0.0019401035,0.0003152868,0.0019352463,0.021196391,0.002772319,0.9436896,0.0019219975,0.013906144],"study_design_scores_gemma":[0.0039673136,0.000860617,0.0010472744,0.00043155812,0.0017406993,0.000046482946,0.0008770973,0.7765652,0.0026837622,0.2091546,0.0006399289,0.0019854696],"about_ca_topic_score_codex":0.0003331804,"about_ca_topic_score_gemma":0.00018843536,"teacher_disagreement_score":0.75536877,"about_ca_system_score_codex":0.0007597537,"about_ca_system_score_gemma":0.0005051656,"threshold_uncertainty_score":0.99876213},"labels":[],"label_agreement":null},{"id":"W4302196109","doi":"","title":"In Praise of an Alternative BRDF Parametrization","year":2015,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Praise; Parametrization (atmospheric modeling); Bidirectional reflectance distribution function; Computer science; Reflectivity; Psychology; Optics; Physics; Social psychology","score_opus":0.03777879838743096,"score_gpt":0.3046572855705475,"score_spread":0.2668784871831165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302196109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62978303,0.00062798325,0.2884521,0.019195963,0.00038077534,0.001669219,0.00045561086,0.0001792335,0.059256077],"genre_scores_gemma":[0.7783854,0.00036926125,0.2051605,0.00010634807,0.000049071274,0.00019392415,0.00097506854,0.00008313886,0.014677274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901108,0.0069365446,0.0011957202,0.00080937525,0.0005921274,0.00035542098],"domain_scores_gemma":[0.98944634,0.002351691,0.0013193903,0.0023193657,0.0042594858,0.0003037533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0063708317,0.000400626,0.00064969354,0.0004249132,0.00015478385,0.00019066854,0.0012558429,0.00040823818,0.0003904661],"category_scores_gemma":[0.0030832742,0.0004725237,0.0001942937,0.00095307326,0.00038216144,0.00036340323,0.0006507166,0.00068539864,0.000112967165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024878686,0.0035760687,0.0007101462,0.00025517333,0.00007446473,0.000005561077,0.0181769,0.0008197978,0.0027617188,0.9601662,0.0012343033,0.012194765],"study_design_scores_gemma":[0.0031706789,0.0000036744655,0.0064834156,0.0048564277,0.00022053621,0.00004552143,0.0010305807,0.2196818,0.14954534,0.5778621,0.03580122,0.0012987108],"about_ca_topic_score_codex":0.0024518096,"about_ca_topic_score_gemma":0.0024295247,"teacher_disagreement_score":0.38230413,"about_ca_system_score_codex":0.0002935566,"about_ca_system_score_gemma":0.0003880931,"threshold_uncertainty_score":0.99977267},"labels":[],"label_agreement":null},{"id":"W4310054753","doi":"10.1109/jtehm.2022.3219775","title":"Explainable Tensor Multi-Task Ensemble Learning Based on Brain Structure Variation for Alzheimer’s Disease Dynamic Prediction","year":2022,"lang":"en","type":"article","venue":"IEEE Journal of Translational Engineering in Health and Medicine","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Janssen Alzheimer Immunotherapy Research And Development; Johnson and Johnson Pharmaceutical Research and Development; Janssen Research and Development; National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; Meso Scale Diagnostics; Johnson and Johnson; Genentech; IXICO; H. Lundbeck A/S; Servier; Eisai; Pfizer; Biogen; BioClinica; Alzheimer's Disease Neuroimaging Initiative; Novartis Pharmaceuticals Corporation; Engineering and Physical Sciences Research Council; Eli Lilly and Company; Bristol-Myers Squibb; F. Hoffmann-La Roche; Alzheimer's Drug Discovery Foundation; National Institute on Aging; Innovate UK; Alzheimer's Association; Foundation for the National Institutes of Health","keywords":"Artificial intelligence; Computer science; Machine learning; Ensemble learning; Neuroimaging; Multiple kernel learning; Multi-task learning; Cognition; Alzheimer's Disease Neuroimaging Initiative; Functional magnetic resonance imaging; Pattern recognition (psychology); Task (project management); Support vector machine; Psychology; Cognitive impairment; Kernel method; Neuroscience","score_opus":0.03476800841063807,"score_gpt":0.3261177109128619,"score_spread":0.2913497025022238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310054753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07334301,0.00089518324,0.89354664,0.030824622,0.00041684828,0.0007937647,0.00012852011,0.000046124238,0.0000053047506],"genre_scores_gemma":[0.9827504,0.00002150395,0.016374828,0.0005476688,0.00014422146,0.000046116405,0.000071243725,0.000018830786,0.000025152185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.000060388647,0.0004935683,0.00010898241,0.0002738615,0.00014053991],"domain_scores_gemma":[0.99867773,0.00079466176,0.00021419491,0.000058016,0.000071846625,0.00018354318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005859885,0.00009525325,0.00019847375,0.00028232584,0.00017488057,0.0000051135494,0.000050152623,0.000025754689,0.00002263853],"category_scores_gemma":[0.00025206665,0.000088360444,0.00004072106,0.00013916873,0.000010456266,0.000058519992,0.000001913681,0.00030441178,6.2435014e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030246336,0.00010716232,0.00029092847,0.00024072004,0.00001892364,0.0000031132454,0.0006896957,0.993482,0.0013296424,0.0019534444,0.00043562584,0.0011462898],"study_design_scores_gemma":[0.0036492106,0.00061809085,0.010719681,0.00018820215,0.000037534846,0.000027223363,0.000081868144,0.97903585,0.0000099545205,0.0022517173,0.0033020254,0.00007863491],"about_ca_topic_score_codex":0.000004682739,"about_ca_topic_score_gemma":0.0000019003211,"teacher_disagreement_score":0.90940744,"about_ca_system_score_codex":0.00008404926,"about_ca_system_score_gemma":0.00013895774,"threshold_uncertainty_score":0.36032343},"labels":[],"label_agreement":null},{"id":"W4312335457","doi":"10.1007/978-3-031-06947-5_2","title":"Shannon Capacity of Tensor Channels Under a Family of Power Constraints","year":2022,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Generalization; Channel (broadcasting); Tensor (intrinsic definition); Domain (mathematical analysis); Channel capacity; Power (physics); Focus (optics); Transmission (telecommunications); Constraint (computer-aided design); Frequency domain; Mathematics; Computer science; Space (punctuation); Topology (electrical circuits); Theoretical computer science; Telecommunications; Pure mathematics; Mathematical analysis; Physics; Combinatorics; Geometry","score_opus":0.0665942363153673,"score_gpt":0.2956151947206492,"score_spread":0.22902095840528186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312335457","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08606485,0.007289115,0.0073514627,0.0102265,0.00013070935,0.0027267777,0.0016981285,0.00070105033,0.8838114],"genre_scores_gemma":[0.98278755,0.0011664915,0.006200783,0.00014364463,0.0000054463508,0.000102792364,0.00005828432,0.000045586836,0.009489451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882054,0.000045218185,0.000620701,0.00022177146,0.00017210693,0.00011963629],"domain_scores_gemma":[0.9975774,0.00026704744,0.0007593104,0.0011074126,0.00025549394,0.000033293225],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022224212,0.00019990631,0.0005478071,0.00036296016,0.00012541215,0.0000065401564,0.0005428025,0.0003848282,0.0015319043],"category_scores_gemma":[0.000029516537,0.00020851255,0.00010924744,0.000100712314,0.0010202542,0.000030095736,0.00033190515,0.00047355887,0.000006725746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070774267,0.000087848566,0.0000037636594,0.000049183134,0.00009213436,2.7937702e-7,0.000112286674,0.0000015130306,0.00755431,0.9900667,0.00049525424,0.0015296218],"study_design_scores_gemma":[0.00028326374,0.00012258373,0.000021465732,0.00014190114,0.00007580259,0.000021928143,0.00045355535,0.00001361583,0.0024845155,0.97478294,0.021401178,0.00019723778],"about_ca_topic_score_codex":0.000009470528,"about_ca_topic_score_gemma":0.0000032787882,"teacher_disagreement_score":0.8967227,"about_ca_system_score_codex":0.000028889328,"about_ca_system_score_gemma":0.00004002321,"threshold_uncertainty_score":0.9993808},"labels":[],"label_agreement":null},{"id":"W4312799022","doi":"10.1109/iwaenc53105.2022.9914787","title":"Acoustic System Identification with Partially Time-Varying Models Based on Tensor Decompositions","year":2022,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"National Key Research and Development Program of China; National Science Foundation","keywords":"Finite impulse response; Impulse response; Computer science; LTI system theory; System identification; Linear filter; Microphone; Infinite impulse response; Algorithm; Speech recognition; Filter (signal processing); Acoustics; Linear system; Mathematics; Digital filter; Data modeling; Physics; Telecommunications","score_opus":0.03526491605262385,"score_gpt":0.2816687745280188,"score_spread":0.24640385847539495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312799022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038345564,0.0000038730386,0.92448294,0.0015633825,0.00006254441,0.0009987341,0.0001574901,0.0009900571,0.0333954],"genre_scores_gemma":[0.978558,1.6770966e-7,0.018149756,0.00038408823,0.000028887054,0.00081535534,0.00011312888,0.00003907319,0.0019115367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986316,0.000114363174,0.00034017427,0.0003147588,0.0004066658,0.00019246046],"domain_scores_gemma":[0.99884415,0.00028076646,0.0001556891,0.0005259814,0.00010620561,0.000087237284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022003692,0.00014622211,0.00017254175,0.00014157093,0.00079433445,0.000075594005,0.00020705005,0.000027848424,0.0006475363],"category_scores_gemma":[0.0000092136925,0.00013105133,0.00007118496,0.00030766305,0.000025849311,0.00009516306,0.00003596682,0.00015361432,0.00019132564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009750951,0.0007540672,0.0000129805785,0.00007150388,0.000042019812,0.00001143155,0.00012887464,0.756745,0.018395143,0.21695957,0.006658714,0.00012320114],"study_design_scores_gemma":[0.0005183583,0.00009824643,0.00005862547,0.000031239,0.00009980786,0.00004187856,0.0002171184,0.99173826,0.0012650411,0.0055445777,0.00018042502,0.00020642541],"about_ca_topic_score_codex":0.0000059657455,"about_ca_topic_score_gemma":0.000004015423,"teacher_disagreement_score":0.9402124,"about_ca_system_score_codex":0.0001868411,"about_ca_system_score_gemma":0.000053753327,"threshold_uncertainty_score":0.70900685},"labels":[],"label_agreement":null},{"id":"W4319653486","doi":"10.48550/arxiv.2302.03160","title":"Stretching maps for tensors","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Construct (python library); Symmetry (geometry); Mathematics; Algebraic number; Order (exchange); Pure mathematics; Algebra over a field; Invariants of tensors; Algebraic structure; Mathematical analysis; Computer science; Geometry","score_opus":0.24912995725061926,"score_gpt":0.26575926596096794,"score_spread":0.016629308710348678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319653486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8325942,0.000008368313,0.15989624,0.00073422526,0.00039279799,0.0013001547,0.0007719982,0.001197449,0.003104532],"genre_scores_gemma":[0.9804221,0.00003384919,0.0056165922,0.00006054502,0.00013152589,0.000011674661,0.00017006212,0.00006729605,0.013486373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988176,0.000042830216,0.00020333558,0.0006310716,0.000052606272,0.00025250632],"domain_scores_gemma":[0.99839,0.00044071802,0.00020899215,0.0007152535,0.00013421179,0.000110790425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016240834,0.00022863064,0.00029238677,0.00017916971,0.00018573459,0.00004773457,0.00047982033,0.00023844329,0.00004463377],"category_scores_gemma":[0.00008050016,0.00026963637,0.00029588785,0.00021588868,0.000051992807,0.00005482933,0.00036051348,0.0003462665,0.00018885668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022837756,0.00011070809,0.00033706747,0.00025168233,0.00013955249,0.00003112373,0.00017364562,0.019141726,0.00004072451,0.95496786,0.02469895,0.000084153166],"study_design_scores_gemma":[0.00039625083,0.000015419002,0.0001774128,0.00009284176,0.00018366353,0.0000016062755,0.0003453614,0.053689573,0.00007575911,0.94204384,0.0026469324,0.00033131815],"about_ca_topic_score_codex":0.000029617637,"about_ca_topic_score_gemma":0.000037388996,"teacher_disagreement_score":0.15427963,"about_ca_system_score_codex":0.00011422115,"about_ca_system_score_gemma":0.000052235224,"threshold_uncertainty_score":0.99997556},"labels":[],"label_agreement":null},{"id":"W4320002729","doi":"10.1109/ojcoms.2023.3240406","title":"Capacity Performance of Tensor Multi-Domain Communication Systems With Discrete Signalling Constellations","year":2023,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Channel capacity; Tensor (intrinsic definition); Covariance; Constellation; Estimator; Computer science; Mathematics; Topology (electrical circuits); Channel (broadcasting); Gaussian; Limit (mathematics); Coding (social sciences); Mathematical optimization; Algorithm; Telecommunications; Physics","score_opus":0.1634124708187748,"score_gpt":0.3605079207027732,"score_spread":0.1970954498839984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320002729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9746377,0.00021656876,0.01521054,0.006636706,0.00010446439,0.001192787,0.00009319332,0.00005504601,0.0018530254],"genre_scores_gemma":[0.8776743,0.00049065676,0.12137203,0.000046764515,0.000016090346,0.00004068582,0.00000798745,0.000022251968,0.0003292636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998208,0.0004359074,0.00080313574,0.00009851895,0.0003021121,0.00015234544],"domain_scores_gemma":[0.99521923,0.0009741346,0.001287548,0.0017364385,0.0007150952,0.000067570094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015240118,0.00013409513,0.00033692754,0.000057456116,0.00097582384,0.00011540248,0.0030335032,0.000069781236,0.000010174507],"category_scores_gemma":[0.00006172075,0.00009119636,0.00022963584,0.00078231806,0.0005344389,0.00031913733,0.0004449164,0.0004759834,0.00000886111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000484212,0.006535959,0.08733185,0.00142796,0.0059054303,0.0000026713258,0.072270855,0.13096508,0.11162192,0.46624482,0.11524515,0.0019640962],"study_design_scores_gemma":[0.015272007,0.00082853966,0.05047907,0.009976691,0.0023108132,0.0010119813,0.06536835,0.7569681,0.015597626,0.047414158,0.03227786,0.0024948257],"about_ca_topic_score_codex":0.00003228216,"about_ca_topic_score_gemma":0.000024962595,"teacher_disagreement_score":0.626003,"about_ca_system_score_codex":0.00009100968,"about_ca_system_score_gemma":0.00013207256,"threshold_uncertainty_score":0.75053465},"labels":[],"label_agreement":null},{"id":"W4323022420","doi":"10.1109/tits.2023.3247961","title":"Low-Rank Hankel Tensor Completion for Traffic Speed Estimation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Canada Foundation for Innovation","keywords":"Matrix completion; Algorithm; Computer science; Hyperparameter; Tensor (intrinsic definition); Matrix norm; Mathematical optimization; Low-rank approximation; Mathematics","score_opus":0.08315372593801956,"score_gpt":0.3379218660780011,"score_spread":0.25476814013998156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323022420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18595882,0.000008110075,0.80873096,0.00035131446,0.0009707294,0.0020782864,0.00078009005,0.0010495143,0.00007220708],"genre_scores_gemma":[0.9933089,0.000040215895,0.0030433503,0.000066041524,0.00009544106,0.0010453278,0.00055507664,0.00008825942,0.00175741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975121,0.000075344076,0.0010466523,0.00050046213,0.0004942874,0.00037114116],"domain_scores_gemma":[0.9982041,0.0006369434,0.00025672378,0.00040536057,0.00034015492,0.00015669558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038908303,0.00032209003,0.00042314158,0.00051239773,0.00045680546,0.00010041818,0.00019369973,0.0001856721,0.00013464285],"category_scores_gemma":[0.000011842387,0.00033130834,0.00035449927,0.0008048776,0.00006285831,0.0001838505,1.8783818e-7,0.00019713168,0.00063911115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027207754,0.0009448183,0.000009880313,0.00087593525,0.0002230953,0.0000054957595,0.0025780064,0.949559,0.007024743,0.022358889,0.005618642,0.01052945],"study_design_scores_gemma":[0.0027861139,0.00047412788,0.00075410714,0.0006821954,0.0005498877,0.0000248917,0.0030430707,0.9197911,0.0574667,0.0055393567,0.00766582,0.001222641],"about_ca_topic_score_codex":0.00002268692,"about_ca_topic_score_gemma":0.000060004757,"teacher_disagreement_score":0.80735004,"about_ca_system_score_codex":0.00012184225,"about_ca_system_score_gemma":0.000039377468,"threshold_uncertainty_score":0.9999139},"labels":[],"label_agreement":null},{"id":"W4324283457","doi":"10.1007/978-3-031-06440-1_1","title":"Introduction","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Scope (computer science); Political science; Section (typography); Business; Geography; Computer science; Advertising","score_opus":0.06770331474931003,"score_gpt":0.31231748126240666,"score_spread":0.24461416651309664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324283457","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021311107,0.0000033557822,0.0018548602,0.0051044417,0.00020303341,0.0001498916,0.000017162172,0.00065463013,0.9920105],"genre_scores_gemma":[0.000015419104,0.00002435219,0.0040969127,0.00008228335,0.0010918432,0.000014000201,0.00006386714,0.00005385231,0.99455744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994913,0.0000020035538,0.00016176137,0.00017601132,0.00010722609,0.00006173701],"domain_scores_gemma":[0.99948466,0.000059498492,0.00006862017,0.00030839763,0.00004861689,0.000030179588],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000047085334,0.00010409544,0.00012919155,0.000069704845,0.00004176963,0.000014677265,0.00006724358,0.000119171316,0.0070622247],"category_scores_gemma":[0.000012986875,0.0000961048,0.00007666062,0.000015191674,0.000019472487,0.000014774639,0.000023840978,0.0001303396,0.010426642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.42067e-7,0.0000027786014,1.4301805e-8,0.000006891652,0.000009916797,4.161821e-7,0.0000036064112,6.493064e-8,0.000013036491,0.58774394,0.41168925,0.0005297508],"study_design_scores_gemma":[0.000019344518,0.000002824363,6.699708e-7,0.0000053105546,0.00001603795,0.0000033448332,0.0000017446428,0.0000035671756,0.000020284806,0.522581,0.47728592,0.00005995667],"about_ca_topic_score_codex":5.700006e-7,"about_ca_topic_score_gemma":0.0000048859674,"teacher_disagreement_score":0.065596685,"about_ca_system_score_codex":0.000021550033,"about_ca_system_score_gemma":0.00000778487,"threshold_uncertainty_score":0.99384546},"labels":[],"label_agreement":null},{"id":"W4362575656","doi":"10.22215/etd/2023-15405","title":"TC-GVF: Tensor Core GPU Based Vector Fitting Via Accelerated Tall-Skinny QR Solvers","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Gachon University; Nvidia","keywords":"Computer science; Parallel computing; Tensor (intrinsic definition); Convergence (economics); Computational science; Speedup; Factorization; Multi-core processor; Set (abstract data type); CUDA; General-purpose computing on graphics processing units; QR decomposition; Algorithm; Mathematics; Computer graphics (images)","score_opus":0.1005501877717839,"score_gpt":0.3679465451712774,"score_spread":0.2673963573994935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362575656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91246986,0.00006188504,0.0072017084,0.0016892758,0.0022601737,0.0040337197,0.0005766122,0.006026063,0.06568068],"genre_scores_gemma":[0.69274926,0.00002839105,0.03420326,0.0012447046,0.0006596173,0.0011824792,0.019272523,0.00071370415,0.24994607],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976423,0.00004400454,0.0007644875,0.000635992,0.0004640065,0.0004492495],"domain_scores_gemma":[0.99764377,0.0005958575,0.00050095766,0.00063706335,0.00044466552,0.00017765748],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001810468,0.0004967676,0.000576327,0.0003001663,0.00036426185,0.00015920655,0.0004182254,0.00050273,0.0030062369],"category_scores_gemma":[0.00021297176,0.0004775331,0.0003114955,0.00066993135,0.000033996173,0.000085233354,0.000028956158,0.0005119258,0.0013337655],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040885824,0.0017000296,0.0004032567,0.0029303213,0.0010814117,0.00013717118,0.0034813094,0.00020992749,0.15053435,0.06803471,0.76365125,0.00742741],"study_design_scores_gemma":[0.02096699,0.0012277262,0.08788563,0.0070860754,0.0062558716,0.0001262822,0.039140206,0.25989857,0.2561053,0.1909568,0.11022604,0.020124493],"about_ca_topic_score_codex":0.000090678775,"about_ca_topic_score_gemma":0.00036218995,"teacher_disagreement_score":0.6534252,"about_ca_system_score_codex":0.00012449824,"about_ca_system_score_gemma":0.00017053107,"threshold_uncertainty_score":0.99976766},"labels":[],"label_agreement":null},{"id":"W4364322627","doi":"10.1109/tcss.2022.3227458","title":"Tensor-Based Baum–Welch Algorithms in Coupled Hidden Markov Model for Responsible Activity Prediction","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Machine learning; Hidden Markov model; Distrust; Tensor (intrinsic definition); Big data; Data mining; Mathematics","score_opus":0.07810676939060002,"score_gpt":0.34728629780789216,"score_spread":0.26917952841729215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364322627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10834568,0.0000025376262,0.8870777,0.0013556632,0.00037765008,0.0013157604,0.0010035728,0.00042929224,0.000092154194],"genre_scores_gemma":[0.98285884,0.0000016749148,0.014200931,0.00006122482,0.0001482675,0.0014749555,0.000109009015,0.000053001477,0.0010921009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981736,0.00015723358,0.00048631165,0.0003883393,0.0004901446,0.0003043671],"domain_scores_gemma":[0.99811316,0.0012241605,0.00016200253,0.00016023651,0.00025510968,0.00008532942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053536927,0.00020754062,0.00032600045,0.00040205737,0.00063043536,0.00007391539,0.00013902786,0.00019575711,0.000018991963],"category_scores_gemma":[0.000018596716,0.00023372364,0.00020344587,0.0007917845,0.00005461537,0.00012764521,0.0000014156603,0.00022547791,0.000051299357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039682497,0.00068612205,0.000021093876,0.00014858202,0.00008292799,0.0000023508749,0.0005670778,0.98391616,0.0017283985,0.005822799,0.0035093026,0.0031183593],"study_design_scores_gemma":[0.0015925734,0.000053605785,0.0010398858,0.00004320448,0.000039639068,0.0000027240926,0.00014438838,0.9818743,0.0002007358,0.014737699,0.0000678993,0.00020333588],"about_ca_topic_score_codex":0.00007372247,"about_ca_topic_score_gemma":0.00005228217,"teacher_disagreement_score":0.87451315,"about_ca_system_score_codex":0.00033658897,"about_ca_system_score_gemma":0.0002274043,"threshold_uncertainty_score":0.95309734},"labels":[],"label_agreement":null},{"id":"W4364856218","doi":"10.1109/tii.2023.3266401","title":"Tensor-Based Lyapunov Deep Neural Networks Offloading Control Strategy With Cloud–Fog–Edge Orchestration","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Orchestration; Quality of service; Enhanced Data Rates for GSM Evolution; Edge computing; Lyapunov optimization; Distributed computing; Artificial neural network; Computer network; Artificial intelligence; Lyapunov equation","score_opus":0.09010082933644514,"score_gpt":0.3031708338836976,"score_spread":0.21307000454725245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364856218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10123129,0.0000018672035,0.8948814,0.00046674215,0.0005503447,0.0010788684,0.00011370873,0.00080553914,0.0008702168],"genre_scores_gemma":[0.9968016,0.000004187061,0.0020201614,0.0003360485,0.00031774785,0.00024110898,0.000063985906,0.000052257677,0.00016289811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978373,0.00009884742,0.0009482675,0.00019394129,0.00042689042,0.000494757],"domain_scores_gemma":[0.997985,0.0007833127,0.00035698517,0.00047438638,0.00018659014,0.00021373309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036500717,0.00033559944,0.00039215095,0.0003393789,0.0005224017,0.00021206494,0.00024734053,0.00037503213,0.000119124255],"category_scores_gemma":[0.00002301574,0.00030406466,0.00016585205,0.0011212358,0.00011921759,0.00039267476,0.000001403635,0.00085877767,0.00013334643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032445675,0.00023530221,0.000025546091,0.000040380684,0.00012309909,0.0000054725274,0.00036632209,0.9770454,0.00008152766,0.0024825102,0.0020057014,0.01726427],"study_design_scores_gemma":[0.0043524965,0.00041708685,0.00003868293,0.000067882436,0.00020998527,0.000022160719,0.00090867985,0.9911524,0.0013421098,0.00064530777,0.00041577392,0.00042744254],"about_ca_topic_score_codex":0.00001366143,"about_ca_topic_score_gemma":0.00002713749,"teacher_disagreement_score":0.89557034,"about_ca_system_score_codex":0.00012460392,"about_ca_system_score_gemma":0.000115529685,"threshold_uncertainty_score":0.9999412},"labels":[],"label_agreement":null},{"id":"W4366850781","doi":"10.48550/arxiv.2304.10658","title":"Linear to multi-linear algebra and systems using tensors","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor algebra; Algebra over a field; Linear algebra; Tensor (intrinsic definition); Tensor contraction; Tensor product; Tensor product of Hilbert spaces; Multilinear algebra; Multivector; Linear system; Mathematics; Cartesian tensor; Computer science; Pure mathematics; Algebra representation; Tensor density; Cellular algebra; Tensor field; Exact solutions in general relativity; Mathematical analysis; Geometry","score_opus":0.3283661630865402,"score_gpt":0.29264565646008545,"score_spread":0.03572050662645476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366850781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.796456,0.000015356749,0.20183767,0.00011072253,0.00021034235,0.00068941474,0.00013200578,0.00042377977,0.00012471854],"genre_scores_gemma":[0.975657,0.000048966085,0.018165978,0.00006155375,0.00014561026,0.000004361305,0.000029853427,0.00007673931,0.0058099492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985524,0.000085935964,0.00026649554,0.00074783445,0.00007813027,0.00026924175],"domain_scores_gemma":[0.99847037,0.00019021431,0.0001945103,0.0007193779,0.00018207297,0.00024346619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018732334,0.0002817563,0.0003953849,0.00028403228,0.00019290514,0.000055965847,0.00035275475,0.00026724956,0.000019386081],"category_scores_gemma":[0.00008204868,0.0003239461,0.00012959096,0.0003950221,0.00006889582,0.00006055133,0.00065952266,0.0003769647,0.00026263396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007358035,0.00046423188,0.0036063741,0.0010946135,0.0004803378,0.00037218822,0.0010997325,0.642777,0.0015453827,0.34571546,0.0027155248,0.00005552904],"study_design_scores_gemma":[0.00050864404,0.000021098245,0.0005654572,0.0002829806,0.00024405004,0.000012632694,0.00066023483,0.9781054,0.0000779061,0.018289084,0.00069594634,0.00053652364],"about_ca_topic_score_codex":0.00021998046,"about_ca_topic_score_gemma":0.000030567084,"teacher_disagreement_score":0.3353284,"about_ca_system_score_codex":0.00012760615,"about_ca_system_score_gemma":0.000051474955,"threshold_uncertainty_score":0.99992126},"labels":[],"label_agreement":null},{"id":"W4367191582","doi":"10.19086/da.73322","title":"geometric-rank-of-tensors-and-subrank-of-matrix-multiplication","year":2023,"lang":"","type":"preprint","venue":"Discrete Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Strassen algorithm; Combinatorics; Matrix multiplication; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics","score_opus":0.052503720976420136,"score_gpt":0.35744533678563467,"score_spread":0.30494161580921453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367191582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5049475,0.0014016626,0.48457646,0.0019905923,0.00016269898,0.0021732496,0.0032093932,0.00032035433,0.0012180728],"genre_scores_gemma":[0.972053,0.002981689,0.021191902,0.000022441558,0.00009617811,0.0002940223,0.0013638192,0.00011926083,0.001877695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935228,0.00030506452,0.0031061121,0.001466427,0.0010592301,0.00054034265],"domain_scores_gemma":[0.99009055,0.0024765409,0.0031945866,0.0028125215,0.0011116765,0.00031412605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011436243,0.000784388,0.002896601,0.0039705965,0.0002717457,0.0001200615,0.0010184208,0.00069676567,0.00056696055],"category_scores_gemma":[0.00089678256,0.000797245,0.002593891,0.009158232,0.00041515753,0.00014359577,0.0008164371,0.0006603761,0.00019491334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000990943,0.006508461,0.15594791,0.021374844,0.16079994,0.000036868594,0.019639406,0.12082704,0.045034785,0.4294418,0.003338323,0.036059685],"study_design_scores_gemma":[0.003732289,0.00032580097,0.18915771,0.0012543844,0.13449053,0.00001148475,0.004916944,0.49820122,0.02208198,0.13936195,0.002166094,0.0042996104],"about_ca_topic_score_codex":0.00060268765,"about_ca_topic_score_gemma":0.000078081845,"teacher_disagreement_score":0.46710548,"about_ca_system_score_codex":0.00009547286,"about_ca_system_score_gemma":0.00009803103,"threshold_uncertainty_score":0.9994478},"labels":[],"label_agreement":null},{"id":"W4376123207","doi":"10.48550/arxiv.2305.05622","title":"Multilinear Hyperquiver Representations","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Division of Materials Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Multilinear map; Quiver; Hypergraph; Tensor (intrinsic definition); Mathematics; Representation (politics); Dimension (graph theory); Eigenvalues and eigenvectors; Tuple; Linear subspace; Pure mathematics; Variety (cybernetics); Algebra over a field; Discrete mathematics","score_opus":0.28622343688893837,"score_gpt":0.2895679401618224,"score_spread":0.0033445032728840474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376123207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81549144,0.000013135642,0.16926488,0.0010160815,0.0005733614,0.0010135465,0.0003961627,0.0017511717,0.010480216],"genre_scores_gemma":[0.96589243,0.0000733318,0.004295585,0.0000748133,0.00010363665,0.0000071205177,0.00013509905,0.00005609364,0.029361859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865067,0.00008109442,0.00023202207,0.00073221937,0.00007750692,0.00022648853],"domain_scores_gemma":[0.99806887,0.00035143422,0.00019968965,0.0010719612,0.0001724624,0.00013560223],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012126938,0.00022554964,0.00026825187,0.00020323035,0.00019261068,0.000045852586,0.00050076836,0.00023459957,0.0002652223],"category_scores_gemma":[0.00010503154,0.00027091848,0.00025578137,0.00038471632,0.000105519546,0.00007913465,0.0005942272,0.00044872737,0.00093483523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036521524,0.0004227377,0.0024254092,0.00015785228,0.00027906793,0.00023022994,0.000459914,0.053414688,0.00024153737,0.89780754,0.044409808,0.00011467011],"study_design_scores_gemma":[0.00073169864,0.000015124474,0.0028957701,0.00009216723,0.00030563952,0.0000056694184,0.00056854775,0.15156493,0.00024099977,0.8389665,0.0040260274,0.00058695785],"about_ca_topic_score_codex":0.000109369576,"about_ca_topic_score_gemma":0.00006500467,"teacher_disagreement_score":0.1649693,"about_ca_system_score_codex":0.00010214745,"about_ca_system_score_gemma":0.00006273674,"threshold_uncertainty_score":0.9999743},"labels":[],"label_agreement":null},{"id":"W4377115366","doi":"10.13001/ela.2023.7635","title":"Bounding real tensor optimizations via the numerical range","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounding overwatch; Eigenvalues and eigenvectors; Semidefinite programming; Numerical range; Linear algebra; Tensor (intrinsic definition); Numerical linear algebra; Matrix (chemical analysis); Tensor product; Rank (graph theory); Subspace topology; Range (aeronautics); Linear programming; Upper and lower bounds; Positive-definite matrix; Numerical analysis; Algebra over a field; Combinatorics; Pure mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.02920302873916053,"score_gpt":0.3254095091602312,"score_spread":0.2962064804210707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377115366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53356075,0.00055429724,0.42632726,0.034770157,0.00045346766,0.00067184685,0.00001652399,0.00044372166,0.003201971],"genre_scores_gemma":[0.98940784,0.0005706047,0.0077234237,0.0002473241,0.00067383784,0.000015619968,0.000009369742,0.000047163932,0.0013048295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868584,0.00009077627,0.00045002403,0.00009908068,0.0002812563,0.00039302948],"domain_scores_gemma":[0.9988348,0.00042527658,0.00028277416,0.00021386494,0.00016323366,0.00008007714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006651675,0.00010603572,0.00020359959,0.00012414271,0.00031186367,0.000042165288,0.00029367825,0.00005011982,0.00015106493],"category_scores_gemma":[0.00015299792,0.000071995055,0.00017103898,0.00062356435,0.000044940913,0.00009434325,0.000030249597,0.00046529452,0.00013743047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009417391,0.00038085924,0.0005441845,0.000027277416,0.00043254832,0.000033394146,0.0016247685,0.0015019043,0.0029301455,0.95391726,0.035508323,0.0030051454],"study_design_scores_gemma":[0.002834827,0.0006709214,0.0037090972,0.00009426816,0.00054933707,0.0017220874,0.0011264976,0.06223643,0.0015200544,0.82976675,0.09512022,0.000649489],"about_ca_topic_score_codex":0.000003814115,"about_ca_topic_score_gemma":0.0000045354004,"teacher_disagreement_score":0.45584708,"about_ca_system_score_codex":0.000081278165,"about_ca_system_score_gemma":0.00013518495,"threshold_uncertainty_score":0.2935873},"labels":[],"label_agreement":null},{"id":"W4378952188","doi":"10.1063/5.0149832","title":"Computing vibrational energy levels using a canonical polyadic tensor method with a fixed rank and a contraction tree","year":2023,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Université Paris-Saclay; Compute Canada","keywords":"Wave function; Tensor (intrinsic definition); Inverse; Contraction (grammar); Rank (graph theory); Tree (set theory); Mathematics; Physics; Computer science; Quantum mechanics; Combinatorics; Pure mathematics; Geometry","score_opus":0.0695368673051236,"score_gpt":0.35097201046346627,"score_spread":0.28143514315834267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378952188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56934065,0.0000138318555,0.4293896,0.0010711161,0.000017898423,0.000053564832,0.000006526653,0.000025239462,0.000081561244],"genre_scores_gemma":[0.9427874,0.00000383075,0.056668036,0.00019280578,0.00031146308,0.0000012054525,0.0000023076336,0.000016558002,0.00001641141],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991465,0.000091749425,0.00030425945,0.00007647326,0.00025061416,0.00013036377],"domain_scores_gemma":[0.99816287,0.0011987169,0.0003169054,0.000103282284,0.00014483875,0.00007337088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028383377,0.000097515,0.00022529956,0.0000308772,0.00010075866,0.000027485716,0.00010454078,0.00004159235,0.000006875764],"category_scores_gemma":[0.00005939035,0.000061988976,0.00006556412,0.00023296286,0.00007491649,0.000089744986,0.000027337508,0.00021218645,0.0000010896316],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015287072,0.00009978978,0.000026449412,0.000014517656,0.000115542534,0.0000039942843,0.00028809553,0.00046675943,0.97333527,0.021552185,0.0007170343,0.0032274805],"study_design_scores_gemma":[0.0040602507,0.00016562146,0.0014395531,0.00022824385,0.0007566745,0.0018812666,0.0004569683,0.20060708,0.48844734,0.30115697,0.00035795377,0.0004420979],"about_ca_topic_score_codex":0.00000790657,"about_ca_topic_score_gemma":0.0000013164356,"teacher_disagreement_score":0.48488796,"about_ca_system_score_codex":0.000037441136,"about_ca_system_score_gemma":0.000074532996,"threshold_uncertainty_score":0.2527837},"labels":[],"label_agreement":null},{"id":"W4381331525","doi":"10.1016/j.jmva.2023.105206","title":"Tensor Stein-rules in a generalized tensor regression model","year":2023,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Estimator; Tensor (intrinsic definition); Applied mathematics; Covariate; Context (archaeology); Asymptotic distribution; Statistics; Pure mathematics","score_opus":0.07984146258435315,"score_gpt":0.3837853891623493,"score_spread":0.3039439265779961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381331525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750216,0.000033387743,0.02249291,0.0020048672,0.000033589586,0.00011651454,0.000026043108,0.00005786592,0.00021324866],"genre_scores_gemma":[0.9229622,0.00012224428,0.07440162,0.000112195805,0.00008712866,0.000013576218,0.000017301822,0.000027617109,0.0022561387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810827,0.0001347469,0.0009287988,0.00018961352,0.00040741192,0.00023115145],"domain_scores_gemma":[0.99825454,0.00030922002,0.00067881466,0.00031942854,0.00031401016,0.00012398529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438566,0.00016603713,0.0006745072,0.0012861724,0.00009033714,0.000045856417,0.0002606857,0.000101427424,0.000100175304],"category_scores_gemma":[0.0002914499,0.00011802391,0.00054575305,0.0017413902,0.000025088324,0.00014263592,0.00004955102,0.0002416636,0.000046111003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010200089,0.003307449,0.021591198,0.00019487318,0.009116603,0.000667869,0.009919702,0.53888834,0.3104117,0.064419806,0.032879,0.00758344],"study_design_scores_gemma":[0.0022699228,0.000035893405,0.021108719,0.00010029732,0.0015956049,0.000018618504,0.00038066733,0.9191966,0.0010843162,0.05340779,0.00053575466,0.00026582042],"about_ca_topic_score_codex":0.000037792546,"about_ca_topic_score_gemma":0.000037670885,"teacher_disagreement_score":0.38030824,"about_ca_system_score_codex":0.00007820013,"about_ca_system_score_gemma":0.00004418459,"threshold_uncertainty_score":0.48128754},"labels":[],"label_agreement":null},{"id":"W4383312765","doi":"10.1088/1361-6579/ace510","title":"ETucker: a constrained tensor decomposition for single trial ERP extraction","year":2023,"lang":"en","type":"article","venue":"Physiological Measurement","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor decomposition; Extraction (chemistry); Decomposition; Tensor (intrinsic definition); Computer science; Artificial intelligence; Mathematics; Chemistry; Chromatography; Pure mathematics","score_opus":0.34906108780742046,"score_gpt":0.41865683166488765,"score_spread":0.0695957438574672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383312765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94140226,0.000021341888,0.045576375,0.00399083,0.0005279653,0.0044279965,0.00010243159,0.001544931,0.0024058651],"genre_scores_gemma":[0.9901892,0.000004673303,0.008017938,0.00018566831,0.00030859688,0.0011402568,0.00007739608,0.000017709284,0.00005859456],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864787,0.000092581635,0.0003684811,0.0003245584,0.00029250162,0.0002740076],"domain_scores_gemma":[0.9989838,0.00031481544,0.00014554634,0.0002167068,0.00024868504,0.00009043027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005060742,0.00015626274,0.00025211755,0.00006252201,0.00022428703,0.000036467314,0.000113183,0.00009538279,0.00010372708],"category_scores_gemma":[0.00035168888,0.00012501887,0.0001956726,0.00020359088,0.00005479377,0.00005501711,0.000022468268,0.000100202604,0.00015641395],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019987775,0.001005342,0.0000012805217,0.000036187175,0.00004595885,0.0000012659289,0.000036494424,0.00002360811,0.9452795,0.032256614,0.01615514,0.0031598648],"study_design_scores_gemma":[0.039623667,0.0028637762,0.0026677835,0.00012912157,0.00023988192,0.000027142565,0.00028481675,0.0037633986,0.07864723,0.8601661,0.010718676,0.00086845376],"about_ca_topic_score_codex":0.0000019659653,"about_ca_topic_score_gemma":0.0000019892404,"teacher_disagreement_score":0.8666322,"about_ca_system_score_codex":0.00011796893,"about_ca_system_score_gemma":0.000019757768,"threshold_uncertainty_score":0.5098121},"labels":[],"label_agreement":null},{"id":"W4385553849","doi":"10.1137/22m1531907","title":"A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Imaging Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"National Key Research and Development Program of China; Research Grants Council, University Grants Committee; National Natural Science Foundation of China","keywords":"Algorithm; Mathematics; S transform; Computer science; Matrix norm; Tensor (intrinsic definition); Artificial intelligence; Mathematical optimization; Geometry; Physics","score_opus":0.07202506911643215,"score_gpt":0.3541081900783005,"score_spread":0.2820831209618684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385553849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9711728,0.000033877423,0.0043700063,0.020701459,0.00013819005,0.0007717742,0.000021126589,0.00026987633,0.002520904],"genre_scores_gemma":[0.99513346,0.00003857681,0.0038152456,0.0005470199,0.00014733603,0.000062709005,0.0000049393275,0.000022892888,0.00022780367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987113,0.000033147586,0.0003140238,0.0002775469,0.00034741755,0.00031659458],"domain_scores_gemma":[0.99920803,0.00023314462,0.00017731251,0.00011106902,0.00014531711,0.00012512764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092386757,0.00013138817,0.00017764645,0.00027086408,0.0012148876,0.00024117476,0.00024508144,0.000034407858,0.000024641904],"category_scores_gemma":[0.000100453406,0.0001066673,0.00008057152,0.00053527893,0.000103955615,0.00034484634,0.00001801371,0.0001960641,0.00008067034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012199092,0.00048517532,0.0010780816,0.00019848761,0.000054975535,0.000010325333,0.002524486,0.00023476704,0.29089245,0.63562876,0.01332942,0.055441096],"study_design_scores_gemma":[0.0038393454,0.001063157,0.020098396,0.00039279685,0.00015282769,0.0010102353,0.0067806356,0.2958087,0.0061902814,0.574488,0.088974684,0.0012009505],"about_ca_topic_score_codex":0.0000038173393,"about_ca_topic_score_gemma":0.0000022265538,"teacher_disagreement_score":0.29557395,"about_ca_system_score_codex":0.000045525998,"about_ca_system_score_gemma":0.00002735057,"threshold_uncertainty_score":0.9344056},"labels":[],"label_agreement":null},{"id":"W4385633790","doi":"10.1016/j.sigpro.2023.109216","title":"Recursive least-squares algorithm based on a third-order tensor decomposition for low-rank system identification","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Recursive least squares filter; Adaptive filter; Rank (graph theory); Impulse response; Mathematics; Matrix decomposition; Computational complexity theory; Least-squares function approximation; Kronecker product; Finite impulse response; Computer science; Mathematical optimization; Kronecker delta; Statistics","score_opus":0.03647775312829842,"score_gpt":0.34155362725061617,"score_spread":0.30507587412231774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385633790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013503468,0.00002770036,0.98188674,0.0013337522,0.00010245011,0.0011771269,0.00014191268,0.0009815365,0.00084533426],"genre_scores_gemma":[0.94182885,0.000001199632,0.056173977,0.00022013349,0.00023448982,0.00077253755,0.0002989218,0.00006766627,0.00040224168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842525,0.00006880445,0.00045573353,0.0004157845,0.00034089698,0.00029350628],"domain_scores_gemma":[0.9984449,0.00041511687,0.00029516197,0.00023827574,0.0005216117,0.00008491055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040977504,0.00019771415,0.00023077786,0.00025099688,0.0005943377,0.00019294565,0.00017622804,0.00011017764,0.000021266142],"category_scores_gemma":[0.00006864573,0.00019056088,0.000115734736,0.0006452422,0.000045668025,0.00016895308,0.000014489833,0.00013438772,0.00018927653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011760131,0.0029718243,0.00012218145,0.013856127,0.00028537837,0.00005861565,0.0053697736,0.018271925,0.17557555,0.13844943,0.058048215,0.58581495],"study_design_scores_gemma":[0.0010944764,0.000115400224,0.00026935557,0.0010439308,0.000113782786,0.000012516527,0.0013748475,0.9457608,0.015798876,0.03350039,0.0005282968,0.00038732088],"about_ca_topic_score_codex":0.0000025531206,"about_ca_topic_score_gemma":0.000001121599,"teacher_disagreement_score":0.92832536,"about_ca_system_score_codex":0.00012176598,"about_ca_system_score_gemma":0.00007986141,"threshold_uncertainty_score":0.7770847},"labels":[],"label_agreement":null},{"id":"W4385737293","doi":"10.3390/sym15081560","title":"An Iterative Wiener Filter Based on a Fourth-Order Tensor Decomposition","year":2023,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Wiener filter; Mathematics; Tensor (intrinsic definition); Kronecker delta; Filter (signal processing); Algorithm; Mathematical optimization; Tensor product; Adaptive filter; Filter design; Applied mathematics; Computer science","score_opus":0.039071188953253816,"score_gpt":0.35834807820768716,"score_spread":0.3192768892544333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385737293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9012356,0.000004235599,0.075141855,0.004677165,0.0002224167,0.00065476226,0.00019250934,0.0011330218,0.016738446],"genre_scores_gemma":[0.95446867,0.0000011322045,0.04241777,0.0016306288,0.0001455753,0.0001362602,0.00021583635,0.00004340571,0.00094070437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989421,0.00009520698,0.00021383008,0.00030130576,0.00022149697,0.00022610095],"domain_scores_gemma":[0.99891543,0.00031655387,0.00007201567,0.00046877487,0.000119876444,0.00010731904],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016164636,0.0001560081,0.00016001936,0.00025157703,0.00018065295,0.00007144045,0.00014175074,0.000083332045,0.00040833568],"category_scores_gemma":[0.000059999642,0.00013691625,0.00008037349,0.0006607696,0.00003204269,0.000114990704,0.000017251086,0.00014133536,0.0009075949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045207617,0.0048350967,0.0060807597,0.00029722296,0.00027309332,0.00017415133,0.0037077288,0.004810907,0.11657727,0.53798354,0.30476463,0.020043503],"study_design_scores_gemma":[0.0046448866,0.0010879702,0.04457297,0.00035487177,0.00019707739,0.0000467976,0.00104902,0.6556783,0.05352528,0.22036986,0.016651964,0.0018209955],"about_ca_topic_score_codex":0.000003578168,"about_ca_topic_score_gemma":0.000004304895,"teacher_disagreement_score":0.6508674,"about_ca_system_score_codex":0.000038261776,"about_ca_system_score_gemma":0.000018348865,"threshold_uncertainty_score":0.9998703},"labels":[],"label_agreement":null},{"id":"W4385882083","doi":"10.1109/bmsb58369.2023.10211188","title":"Novel Personalized Multimedia Recommendation Systems Using Tensor Singular-Value-Decomposition","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Singular value decomposition; Computer science; Recommender system; Multimedia; Tensor decomposition; Decomposition; Tensor (intrinsic definition); Information retrieval; Artificial intelligence; Mathematics","score_opus":0.1190994709113317,"score_gpt":0.3896650378705325,"score_spread":0.2705655669592008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385882083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38041237,0.000014539903,0.6071139,0.0027999391,0.00064806483,0.0012275546,0.00015401635,0.0020731902,0.0055564605],"genre_scores_gemma":[0.52280486,0.000017848044,0.46905065,0.0005276094,0.0005181375,0.00019981728,0.001081806,0.00014696526,0.0056523364],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986965,0.00007300348,0.00042960094,0.0003058415,0.00022975527,0.00026527143],"domain_scores_gemma":[0.99897134,0.00034818886,0.00017285133,0.0002528578,0.00014921895,0.0001055336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036525025,0.00017215587,0.00024516822,0.00020480754,0.00029072084,0.00011038858,0.0001164326,0.00010055967,0.00035230108],"category_scores_gemma":[0.0000816383,0.00016424383,0.000109169785,0.00048483623,0.000044457975,0.00015237581,0.000041002513,0.00010943567,0.00042244256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006614011,0.0007496319,0.00017899736,0.00019617601,0.00017887044,0.0000068719605,0.0012174427,0.00095332076,0.62137526,0.34241855,0.029108074,0.0035506685],"study_design_scores_gemma":[0.0017412892,0.000034266468,0.00060217525,0.00010001381,0.0001111504,0.000098176875,0.0009617257,0.97663784,0.0029845424,0.007943912,0.008336675,0.0004482423],"about_ca_topic_score_codex":0.00008539282,"about_ca_topic_score_gemma":0.0000029376472,"teacher_disagreement_score":0.9756845,"about_ca_system_score_codex":0.000120642224,"about_ca_system_score_gemma":0.000024517049,"threshold_uncertainty_score":0.6697669},"labels":[],"label_agreement":null},{"id":"W4386570219","doi":"10.1016/j.cam.2023.115559","title":"Computing the extremal nonnegative solutions of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e1182\" altimg=\"si3.svg\"><mml:mi>M</mml:mi></mml:math>-tensor equation with a nonnegative right-side vector","year":2023,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tensor (intrinsic definition); Convergence (economics); Applied mathematics; Invertible matrix; Mathematical proof; Numerical analysis; Mathematical analysis; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.034236055271423364,"score_gpt":0.2707205369192474,"score_spread":0.23648448164782404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386570219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9205992,0.000021763184,0.07699191,0.001139272,0.000094146424,0.00015515204,0.000067130495,0.00004824563,0.0008831398],"genre_scores_gemma":[0.94044733,0.000013677448,0.058992643,0.00016096998,0.00022709859,0.000051104846,0.00003202627,0.00004586358,0.000029257953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786884,0.000056294808,0.00084087887,0.00020310178,0.0007597031,0.000271156],"domain_scores_gemma":[0.995607,0.0023472004,0.0014174837,0.0002643831,0.00026336755,0.00010056161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067067595,0.00022106977,0.00026818208,0.00009912814,0.0007100599,0.00011710273,0.0003268257,0.0001214969,0.0000124574835],"category_scores_gemma":[0.00019632657,0.00015745105,0.0002157738,0.00041655428,0.00033574543,0.00017524009,0.00017701263,0.00037737752,0.000058572627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005852519,0.00021446584,0.0000020595382,0.00018916884,0.00022547117,0.0000085649,0.003121456,0.014204296,0.00076022954,0.98076403,0.00026587976,0.0001858301],"study_design_scores_gemma":[0.000739558,0.00012686074,0.0003116018,0.00036466715,0.00026778923,0.00029752107,0.002413293,0.8627646,0.0014927137,0.13096583,0.00008655249,0.00016899714],"about_ca_topic_score_codex":0.000006047322,"about_ca_topic_score_gemma":0.0000136638355,"teacher_disagreement_score":0.8497982,"about_ca_system_score_codex":0.000022210517,"about_ca_system_score_gemma":0.00021566957,"threshold_uncertainty_score":0.6420667},"labels":[],"label_agreement":null},{"id":"W4386645607","doi":"10.1002/sta4.615","title":"A modified partial envelope tensor response regression","year":2023,"lang":"en","type":"article","venue":"Stat","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Envelope (radar); Estimator; Mathematics; Consistency (knowledge bases); Multivariate statistics; Applied mathematics; Regression analysis; Regression; Linear regression; Dimensionality reduction; Statistics; Computer science; Artificial intelligence; Geometry","score_opus":0.10489743131836093,"score_gpt":0.38393872167020576,"score_spread":0.27904129035184483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386645607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98838097,0.0000059963977,0.0033870437,0.0048552095,0.000092965834,0.0002479077,0.000060618935,0.00061985786,0.0023494577],"genre_scores_gemma":[0.98241717,0.000011214657,0.004376117,0.00017129678,0.00005844836,0.0000988824,0.000027228672,0.000024502891,0.012815122],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992313,0.00009027725,0.00017273582,0.00016665715,0.00015650106,0.00018253694],"domain_scores_gemma":[0.9991548,0.00038122322,0.000052688956,0.0002940783,0.00004237756,0.00007481357],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026314214,0.0000840174,0.0001097446,0.000079561345,0.00015006907,0.000024590589,0.00010005359,0.00004462337,0.00018623187],"category_scores_gemma":[0.0002152493,0.0000669617,0.000048224865,0.00027645216,0.000031239055,0.00003913767,0.00004301544,0.00007816912,0.0010970564],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014674331,0.00028878715,0.00027656325,0.00006741316,0.00005196101,0.000101741585,0.003325502,0.000101267964,0.093971826,0.2234942,0.66895014,0.007903178],"study_design_scores_gemma":[0.003303512,0.00020740197,0.027081683,0.00019720012,0.00008293904,0.000048679525,0.0017199222,0.014913809,0.03995217,0.5345923,0.37693766,0.0009627466],"about_ca_topic_score_codex":0.0000024781352,"about_ca_topic_score_gemma":0.0000013418869,"teacher_disagreement_score":0.31109807,"about_ca_system_score_codex":0.000020967844,"about_ca_system_score_gemma":0.00002148587,"threshold_uncertainty_score":0.9996807},"labels":[],"label_agreement":null},{"id":"W4386797719","doi":"10.1016/j.aml.2023.108861","title":"A note on Newton–Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensor","year":2023,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounded function; Quadratic growth; Constant (computer programming); Convergence (economics); Sequence (biology); Combinatorics; Tensor (intrinsic definition); Quadratic equation; Applied mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.05296986112414553,"score_gpt":0.32763578983850167,"score_spread":0.27466592871435613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386797719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7041455,0.000004069812,0.25470468,0.032546505,0.00016325766,0.0035604986,0.0000939503,0.0006166129,0.004164946],"genre_scores_gemma":[0.8379082,0.0000019647705,0.15807137,0.0026443782,0.0002318272,0.00059543195,0.00007201716,0.00009873267,0.00037608345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985125,0.000020543965,0.00055398257,0.00030312553,0.00030735825,0.0003024827],"domain_scores_gemma":[0.9967896,0.0021047224,0.00040166732,0.00056997844,0.00009034592,0.000043736425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050873647,0.00022936218,0.00033958672,0.00015406558,0.00030605955,0.000063553525,0.00027265903,0.00007063756,0.00001824479],"category_scores_gemma":[0.0001502792,0.00017288903,0.00016181504,0.00044513308,0.00010504273,0.000048136353,0.00005951854,0.00016026518,0.00013887577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003595612,0.00030549002,0.000003662845,0.0004801594,0.00007672691,9.043435e-7,0.009370537,0.0009661658,0.18734595,0.7215084,0.07867518,0.0012309111],"study_design_scores_gemma":[0.0033602864,0.00022182183,0.0005152993,0.00074175064,0.00045620874,0.000024020957,0.00822304,0.19433627,0.13083124,0.649126,0.010864712,0.0012993367],"about_ca_topic_score_codex":0.0000029537491,"about_ca_topic_score_gemma":0.0000023240239,"teacher_disagreement_score":0.1933701,"about_ca_system_score_codex":0.00004950456,"about_ca_system_score_gemma":0.000019202042,"threshold_uncertainty_score":0.705021},"labels":[],"label_agreement":null},{"id":"W4387314795","doi":"10.23919/ursigass57860.2023.10265592","title":"Multidimensional Optical Diffraction using Tensor Train Decompositions","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tensor (intrinsic definition); Diffraction; Computer science; Planar; Decomposition; Tensor decomposition; Aperture (computer memory); Algorithm; Mathematics; Physics; Optics; Geometry; Computer graphics (images)","score_opus":0.10832684114535103,"score_gpt":0.3892752841619538,"score_spread":0.28094844301660277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387314795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91545177,0.0000019437778,0.07468704,0.0024475288,0.00010348876,0.00027060564,0.000024340377,0.000834432,0.0061788587],"genre_scores_gemma":[0.73056597,0.0000029548578,0.26661822,0.0002778155,0.00011058322,0.000048635262,0.000061450344,0.000030731062,0.0022836162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991157,0.000030566694,0.00024538563,0.00020582332,0.00019042718,0.00021211874],"domain_scores_gemma":[0.9991257,0.00043715883,0.000046574285,0.00020680533,0.00007387204,0.00010984707],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012753475,0.00010838189,0.00013222352,0.00013404152,0.00027586473,0.000026192689,0.00006522111,0.00006753953,0.00059088646],"category_scores_gemma":[0.00006120918,0.0000979155,0.00009653591,0.00034817887,0.00004422177,0.000091516464,0.000033720684,0.00011498007,0.00084905745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012200149,0.0003715305,0.00012259198,0.000014150242,0.0000367571,0.000011381476,0.00011674867,0.00030531565,0.28075674,0.7025127,0.014769565,0.00097032235],"study_design_scores_gemma":[0.002894558,0.00010979486,0.05997302,0.00011498976,0.00029548668,0.00049609016,0.0018047706,0.5340704,0.03316497,0.34806246,0.017679332,0.0013341425],"about_ca_topic_score_codex":0.0000072451953,"about_ca_topic_score_gemma":0.000005026744,"teacher_disagreement_score":0.5337651,"about_ca_system_score_codex":0.000046423746,"about_ca_system_score_gemma":0.000018678087,"threshold_uncertainty_score":0.9999289},"labels":[],"label_agreement":null},{"id":"W4388032305","doi":"10.48550/arxiv.2310.17827","title":"A hierarchy of eigencomputations for polynomial optimization on the sphere","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hierarchy; Eigenvalues and eigenvectors; Homogeneous polynomial; Polynomial; Norm (philosophy); Semidefinite programming; Upper and lower bounds; Tensor product; Computation; Combinatorics; Discrete mathematics; Applied mathematics; Mathematical optimization; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.23692606262448673,"score_gpt":0.2631305185265006,"score_spread":0.026204455902013868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388032305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10198209,0.0000031189954,0.8938088,0.00090096466,0.00017924487,0.0010979668,0.00032330942,0.00019041025,0.0015141262],"genre_scores_gemma":[0.9852401,0.0000218771,0.012098808,0.00006176449,0.00008396564,0.000017266524,0.0001079175,0.000037456837,0.002330834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916905,0.00006712679,0.00021360534,0.00035654168,0.000056934034,0.00013671412],"domain_scores_gemma":[0.9980783,0.00089370477,0.00027773355,0.0005270878,0.0001742226,0.000048957307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014270742,0.00015451381,0.0002057262,0.000119676464,0.00018714361,0.000024229206,0.00039630677,0.0001437618,0.00009734484],"category_scores_gemma":[0.000092306705,0.00014387532,0.00022488994,0.00030122997,0.000083843304,0.00003147796,0.00017065057,0.00021015774,0.000031929107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002735939,0.00009054916,0.000021218122,0.000054314343,0.00006245981,0.0000013892152,0.000111228095,0.5826559,0.000011846691,0.41100582,0.005917841,0.000040089628],"study_design_scores_gemma":[0.00034767753,0.000041697727,0.00010357261,0.00008278697,0.00014318399,4.96792e-7,0.00027599736,0.544564,0.00012397785,0.45377815,0.000356306,0.00018214737],"about_ca_topic_score_codex":0.000023377233,"about_ca_topic_score_gemma":0.000022941838,"teacher_disagreement_score":0.88325804,"about_ca_system_score_codex":0.00007578903,"about_ca_system_score_gemma":0.0000923731,"threshold_uncertainty_score":0.5867065},"labels":[],"label_agreement":null},{"id":"W4388623247","doi":"10.1109/iseee58596.2023.10310482","title":"Iterative Wiener Filter Based on Third-Order Tensor Decomposition and Coordinate Descent Method","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Wiener filter; Coordinate descent; Algorithm; Finite impulse response; Kronecker product; Matrix decomposition; Computer science; Impulse response; Wiener deconvolution; Filter design; Kronecker delta; Mathematical optimization; Tensor product; Iterative method; Tensor (intrinsic definition); Filter (signal processing); Mathematics; Blind deconvolution; Deconvolution","score_opus":0.05286332385413682,"score_gpt":0.38070564655764133,"score_spread":0.3278423227035045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388623247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17216764,0.0000066075468,0.7722755,0.01876063,0.00013215124,0.0011337759,0.00009905135,0.0012288697,0.03419578],"genre_scores_gemma":[0.598825,0.000006521835,0.38948178,0.0042263893,0.000064477594,0.00023801089,0.00009810394,0.00004890559,0.0070108254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904895,0.000109531895,0.00020997821,0.00028466547,0.00015777165,0.00018911477],"domain_scores_gemma":[0.99892515,0.0005543599,0.000059937884,0.0002483998,0.00012503461,0.000087126864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022777074,0.00015112324,0.00017100821,0.00014693331,0.00017858091,0.00007245722,0.00007283222,0.00006251029,0.0003639364],"category_scores_gemma":[0.000049252376,0.0001187204,0.00005359977,0.00033709282,0.000031555308,0.00007201354,0.000031573552,0.0001074111,0.00024941788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021684097,0.0011962361,0.00078625476,0.00018677361,0.00015059105,0.000038579954,0.0018285379,0.0016950788,0.048847992,0.7011695,0.23225626,0.011627367],"study_design_scores_gemma":[0.0037109763,0.00038542235,0.015591591,0.00022463544,0.00016600009,0.000040024734,0.00062751654,0.72149074,0.063799016,0.17561975,0.017279567,0.001064776],"about_ca_topic_score_codex":0.000005058889,"about_ca_topic_score_gemma":0.000004835198,"teacher_disagreement_score":0.71979564,"about_ca_system_score_codex":0.000027990893,"about_ca_system_score_gemma":0.000011237902,"threshold_uncertainty_score":0.48412776},"labels":[],"label_agreement":null},{"id":"W4388820672","doi":"10.1109/apsipaasc58517.2023.10317157","title":"Coupled Transformed Induced Tensor Nuclear Norm for Robust Tensor Completion","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Youth Foundation","keywords":"Tensor (intrinsic definition); Singular value decomposition; Matrix norm; Computer science; Unitary transformation; Algorithm; Matrix decomposition; Representation (politics); Theoretical computer science; Artificial intelligence; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.1465151743967936,"score_gpt":0.34488642834357813,"score_spread":0.19837125394678454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388820672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92395353,0.0000017823171,0.051121958,0.0112783,0.00014570291,0.002302118,0.00014234312,0.0022070382,0.008847247],"genre_scores_gemma":[0.9339225,0.000010985951,0.059291888,0.00093619246,0.00016005451,0.0004775039,0.0002280162,0.00010849978,0.004864355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887437,0.000016336478,0.00035309794,0.00025893317,0.00019232328,0.00030494566],"domain_scores_gemma":[0.999006,0.0003482677,0.00007524644,0.00028920197,0.00017499017,0.000106339976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019273872,0.00015733963,0.0002557496,0.00013181771,0.00028592846,0.000050395214,0.00016801596,0.00010530848,0.00062562246],"category_scores_gemma":[0.000083182254,0.00013739044,0.00015536451,0.00036632628,0.00003282251,0.00008105391,0.000016630502,0.000102006874,0.0007233365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016932462,0.00060746516,0.00008064746,0.00027352368,0.00013862082,0.000003830226,0.0012129754,0.00010340365,0.17985405,0.66213393,0.1527086,0.0027136207],"study_design_scores_gemma":[0.011944595,0.0007492846,0.020231923,0.00014756781,0.00045119453,0.0000766243,0.0057703382,0.64530736,0.010443735,0.17706662,0.12567477,0.0021359674],"about_ca_topic_score_codex":0.000014627482,"about_ca_topic_score_gemma":0.00003491106,"teacher_disagreement_score":0.645204,"about_ca_system_score_codex":0.000043092317,"about_ca_system_score_gemma":0.000017168677,"threshold_uncertainty_score":0.9297268},"labels":[],"label_agreement":null},{"id":"W4390098046","doi":"10.1109/focs57990.2023.00079","title":"Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond","year":2023,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"National Science Foundation","keywords":"Quantum entanglement; Variety (cybernetics); Linear subspace; Mathematics; Rank (graph theory); Dimension (graph theory); Time complexity; Tensor (intrinsic definition); Polynomial; Subspace topology; Degeneracy (biology); Intersection (aeronautics); Field (mathematics); Quantum computer; Discrete mathematics; Combinatorics; Quantum; Pure mathematics; Quantum mechanics; Physics","score_opus":0.04927050754117019,"score_gpt":0.3501297681485778,"score_spread":0.30085926060740764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390098046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8952827,0.000015843083,0.08677847,0.0025806478,0.00012687568,0.0004583914,0.00013735528,0.00073085254,0.013888878],"genre_scores_gemma":[0.95867455,0.000020250132,0.039912794,0.00017489056,0.0000548197,0.000024772235,0.000054016746,0.000021009202,0.001062913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917257,0.000030980184,0.00033117115,0.00017456968,0.00012894032,0.00016174154],"domain_scores_gemma":[0.9990932,0.00042536194,0.00009663216,0.00021194559,0.00010217677,0.000070718765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015028934,0.000099552555,0.00016582299,0.0001527783,0.00026954708,0.000021610946,0.00008104885,0.000045055418,0.00019728814],"category_scores_gemma":[0.000034986882,0.0000947418,0.000063248,0.00043436594,0.00007270694,0.000052372845,0.00007311165,0.00008674525,0.00006447852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051407815,0.00024342457,0.00074798096,0.00007258182,0.00007124044,0.0000017188296,0.001361322,0.00007859548,0.009547702,0.96422637,0.023395784,0.00024815043],"study_design_scores_gemma":[0.0020417594,0.0002952518,0.013545442,0.00009858749,0.00029293043,0.00012715744,0.015408503,0.13862897,0.017776107,0.79608995,0.01489615,0.00079921354],"about_ca_topic_score_codex":0.0000170089,"about_ca_topic_score_gemma":0.000014879362,"teacher_disagreement_score":0.16813643,"about_ca_system_score_codex":0.00001457216,"about_ca_system_score_gemma":0.00001402118,"threshold_uncertainty_score":0.38634586},"labels":[],"label_agreement":null},{"id":"W4390597122","doi":"10.5383/juspn.17.02.003","title":"Low Rank Graph Regularization Embedding for 2D+3D Facial Expression Recognition","year":2022,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hebei Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Embedding; Tensor (intrinsic definition); Facial expression; Regularization (linguistics); Graph embedding; Rank (graph theory); Pattern recognition (psychology); Support vector machine; Graph; Computer science; Artificial intelligence; Mathematics; Theoretical computer science; Combinatorics; Pure mathematics","score_opus":0.03549677848626891,"score_gpt":0.29689852905576325,"score_spread":0.26140175056949433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390597122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32395434,0.0010924282,0.6708909,0.0003610694,0.00201763,0.0012482393,0.00012933432,0.00005618849,0.00024985147],"genre_scores_gemma":[0.99161595,0.00017592097,0.0059195613,0.000117661664,0.0016152584,0.00017352469,0.000063226864,0.000038023165,0.0002808476],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856436,0.0001845904,0.00063582597,0.00015634837,0.00027970364,0.00017914458],"domain_scores_gemma":[0.9982777,0.00033638728,0.0008126764,0.00012380224,0.00035461527,0.00009481375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066893967,0.00013415523,0.00033021616,0.00014008529,0.0006361761,0.000092754155,0.00012217928,0.00009089647,0.000046229598],"category_scores_gemma":[0.000058882593,0.00012063298,0.00015923602,0.00015540316,0.000022835788,0.00014725646,0.000041887193,0.0002626328,5.0865043e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040245685,0.002968439,0.0010661021,0.0030702467,0.0012323398,0.00016222912,0.017114496,0.33369127,0.12987922,0.037811942,0.35007712,0.118902],"study_design_scores_gemma":[0.023659494,0.006048223,0.0008220489,0.005559396,0.0020515898,0.008787115,0.031755764,0.52909094,0.0089096185,0.23934877,0.14053424,0.003432773],"about_ca_topic_score_codex":0.0000032611788,"about_ca_topic_score_gemma":0.0000017725826,"teacher_disagreement_score":0.66766167,"about_ca_system_score_codex":0.000064921805,"about_ca_system_score_gemma":0.000032510045,"threshold_uncertainty_score":0.49192703},"labels":[],"label_agreement":null},{"id":"W4390738662","doi":"10.1109/access.2024.3352597","title":"Orthogonal Tensor Recovery Based on Non-Convex Regularization and Rank Estimation","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Mathematics; Rank (graph theory); Cartesian tensor; Tensor density; Applied mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Tensor field; Pure mathematics; Combinatorics; Exact solutions in general relativity","score_opus":0.0384202557798864,"score_gpt":0.34826829803445325,"score_spread":0.30984804225456686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390738662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2635914,0.000023170323,0.72519934,0.00417909,0.0004154375,0.0005792907,0.000061644285,0.00038820208,0.005562454],"genre_scores_gemma":[0.9872899,0.000006943469,0.010867002,0.0008993608,0.000119214215,0.00009693845,0.00006588539,0.000030522035,0.0006242495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924546,0.00002673194,0.00020339186,0.0002482457,0.00016969042,0.00010649514],"domain_scores_gemma":[0.9992976,0.00031000376,0.000053090753,0.00021933966,0.00006830792,0.00005162465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000137382,0.000112497066,0.00012455473,0.00014316142,0.00010142158,0.00027697865,0.000110780966,0.000073242125,0.000113566544],"category_scores_gemma":[0.00005081408,0.000101709535,0.000042410575,0.0002940399,0.00002492508,0.00028677686,0.00001320591,0.00010418265,0.00008206037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005576794,0.0014011674,0.0018447352,0.0032651676,0.00032810224,0.000096396216,0.0009791704,0.030780189,0.037540976,0.53867126,0.18359911,0.20093602],"study_design_scores_gemma":[0.0005515138,0.00005201281,0.0042352495,0.00029600502,0.00008526283,0.00001579602,0.000008771263,0.821951,0.008041404,0.16269624,0.0017857457,0.0002810367],"about_ca_topic_score_codex":0.0000032606154,"about_ca_topic_score_gemma":0.0000033505391,"teacher_disagreement_score":0.7911708,"about_ca_system_score_codex":0.000029309567,"about_ca_system_score_gemma":0.00003820065,"threshold_uncertainty_score":0.41475946},"labels":[],"label_agreement":null},{"id":"W4390956094","doi":"10.1109/tce.2024.3355064","title":"An Adaptive Rank-Based Tensor Ring Completion Model for Intelligent Transportation Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fundamental Research Funds for the Central Universities; Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Rank (graph theory); Computer science; Pruning; Kernel (algebra); Bayesian probability; Algorithm; Ring (chemistry); Bayesian inference; Artificial intelligence; Data mining; Mathematical optimization; Mathematics; Geometry","score_opus":0.06601193932888896,"score_gpt":0.3320654461814597,"score_spread":0.2660535068525708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390956094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017667979,0.000338058,0.97898394,0.00026342925,0.00025422845,0.0012505633,0.0005776148,0.0006230024,0.000041172578],"genre_scores_gemma":[0.9839755,0.00007562063,0.0144481,0.0000866479,0.00003229808,0.0009603972,0.00008734658,0.000078592966,0.00025547543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845415,0.00005738797,0.00045707446,0.00044259147,0.00023870337,0.0003501184],"domain_scores_gemma":[0.9988743,0.00040714178,0.000074547934,0.00033588693,0.0001937959,0.00011434027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021371742,0.00024957664,0.0002640083,0.00023187252,0.00029838987,0.000115522234,0.00014288466,0.0001320195,0.00003469427],"category_scores_gemma":[0.000002585661,0.00025443174,0.0002196023,0.00025564485,0.00005098053,0.00016124103,1.3476834e-7,0.0003354549,0.00003642257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051254546,0.001064861,0.0000019159581,0.000435246,0.0003616283,0.000003082738,0.0008007505,0.74502134,0.014889977,0.22201996,0.0006900278,0.014198646],"study_design_scores_gemma":[0.0004949377,0.00024800914,0.0000024783478,0.0001051219,0.00032650813,0.00000585685,0.00009091658,0.9764274,0.012880819,0.0072052977,0.0019307093,0.0002819634],"about_ca_topic_score_codex":0.000015849679,"about_ca_topic_score_gemma":0.00018356091,"teacher_disagreement_score":0.9663075,"about_ca_system_score_codex":0.00026125443,"about_ca_system_score_gemma":0.00019171229,"threshold_uncertainty_score":0.9999908},"labels":[],"label_agreement":null},{"id":"W4391536396","doi":"10.3389/fams.2023.1259836","title":"Linear to multi-linear algebra and systems using tensors","year":2024,"lang":"en","type":"article","venue":"Frontiers in Applied Mathematics and Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebra over a field; Linear algebra; Mathematics; Linear system; Multilinear algebra; Pure mathematics; Algebra representation; Cellular algebra; Mathematical analysis; Geometry","score_opus":0.052679173140480644,"score_gpt":0.33117619320859937,"score_spread":0.2784970200681187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391536396","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014921412,0.00038225428,0.98293364,0.0000638062,0.00020623597,0.00073082675,0.00031541302,0.00011805291,0.00032834368],"genre_scores_gemma":[0.016396185,0.000094118026,0.9829947,0.000052405183,0.000061005314,0.00007398726,0.00001609201,0.00006118694,0.00025033127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868137,0.000013370763,0.0005103952,0.00034051258,0.00019136356,0.00026301265],"domain_scores_gemma":[0.99919236,0.00028202622,0.00007529091,0.0002417841,0.000042815605,0.00016571266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029471156,0.00022857594,0.00041505447,0.00023358421,0.000111701054,0.00013992349,0.00010169474,0.00010272635,0.000008251753],"category_scores_gemma":[0.000077230645,0.0002116772,0.000023274812,0.00025246703,0.00008473235,0.000032429845,0.00007144777,0.00019046415,0.000014168162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008376653,0.00014679352,0.000042034946,0.0014064673,0.00007060814,0.000021927928,0.0021877096,0.00026885775,0.0009229513,0.9814274,0.009178339,0.004318544],"study_design_scores_gemma":[0.00027296875,0.000017033019,0.000015000448,0.00018086802,0.00008871093,0.000027455088,0.0014693417,0.8438054,0.00004600562,0.15176535,0.0020591232,0.00025280812],"about_ca_topic_score_codex":0.0000074747677,"about_ca_topic_score_gemma":0.0000034491486,"teacher_disagreement_score":0.8435365,"about_ca_system_score_codex":0.000048855058,"about_ca_system_score_gemma":0.00002693959,"threshold_uncertainty_score":0.8631946},"labels":[],"label_agreement":null},{"id":"W4391564802","doi":"10.1007/s11749-023-00915-5","title":"Change-point detection in a tensor regression model","year":2024,"lang":"en","type":"article","venue":"Test","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regression; Econometrics; Regression analysis; Point (geometry); Mathematics; Tensor (intrinsic definition); Statistics; Statistical physics; Computer science; Physics; Pure mathematics; Geometry","score_opus":0.10017456302058811,"score_gpt":0.35940688321485004,"score_spread":0.2592323201942619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391564802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9158798,0.00046961955,0.051321905,0.009743801,0.0002873425,0.0013543363,0.000073703035,0.00216673,0.018702766],"genre_scores_gemma":[0.99433476,0.000012574828,0.0043772794,0.000117276766,0.00007346236,0.00016271685,0.0000032382973,0.00001634938,0.0009023216],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999569,0.000008634391,0.00012313273,0.00013750953,0.00007054266,0.00009118957],"domain_scores_gemma":[0.9996537,0.00013450487,0.000018298148,0.00014730231,0.000017090028,0.000029110271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008013209,0.00006435719,0.00007163209,0.00009238925,0.000034658206,0.000027153328,0.000046657053,0.00004272656,0.000051072173],"category_scores_gemma":[0.000054168377,0.000051680126,0.0000314718,0.00018108998,0.0000111684085,0.00007471869,0.000016314112,0.00010571726,0.00017672582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046074514,0.001869418,0.0008644003,0.000979261,0.000037539994,0.00012454198,0.012654033,0.0001289521,0.37727508,0.2882801,0.03684065,0.28089997],"study_design_scores_gemma":[0.00027874694,0.000046306235,0.0018030255,0.00043458177,0.000023487404,0.000049024533,0.00015952834,0.6265397,0.0128109185,0.35515186,0.002473646,0.00022914878],"about_ca_topic_score_codex":0.000009473208,"about_ca_topic_score_gemma":0.00005125336,"teacher_disagreement_score":0.6264108,"about_ca_system_score_codex":0.00004292318,"about_ca_system_score_gemma":0.0000073956558,"threshold_uncertainty_score":0.22715119},"labels":[],"label_agreement":null},{"id":"W4391629159","doi":"10.1016/j.disc.2024.113915","title":"On a relationship between the characteristic and matching polynomials of a uniform hypertree","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Stroke Consortium; China Scholarship Council; Natural Science Foundation of Jiangxi Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Hyperbolic tree; Counterexample; Tree (set theory); Exponent; Conjecture; Boundary (topology); Matching (statistics); Discrete mathematics; Pure mathematics; Hyperbolic geometry","score_opus":0.06615074844130979,"score_gpt":0.3378207297208488,"score_spread":0.271669981279539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391629159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656432,0.000058348724,0.027026435,0.0019406164,0.000040870193,0.00039831325,0.00014579823,0.0001374141,0.004608998],"genre_scores_gemma":[0.99040496,0.000005114854,0.008985544,0.00004488405,0.000059697464,0.000037007154,0.00001623617,0.000031358228,0.00041518448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910027,0.000034695124,0.00041470004,0.0001455787,0.00017919495,0.00012553376],"domain_scores_gemma":[0.9958351,0.0036193624,0.00012487921,0.00034922926,0.000023600067,0.000047815298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034770934,0.00013509233,0.00023426961,0.00008233149,0.00013572455,0.00009133082,0.00014491894,0.000056687048,0.00003096635],"category_scores_gemma":[0.00026117876,0.0000857928,0.00007993789,0.00016505698,0.00008319758,0.00006370846,0.00004630824,0.00017272435,0.000048681908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025580391,0.000030031651,0.00024907157,0.00040790794,0.00003664339,0.0000011723755,0.0023794228,9.0816485e-7,0.00025628685,0.9958651,0.00042493566,0.00034595912],"study_design_scores_gemma":[0.00010392849,0.000030443955,0.0051331483,0.00038375086,0.0001429376,0.000018059793,0.0004711245,0.0010799697,0.00024564448,0.99204,0.00022653889,0.00012449845],"about_ca_topic_score_codex":0.0000034579991,"about_ca_topic_score_gemma":0.0000015602761,"teacher_disagreement_score":0.024761768,"about_ca_system_score_codex":0.000019676423,"about_ca_system_score_gemma":0.000017137761,"threshold_uncertainty_score":0.3498529},"labels":[],"label_agreement":null},{"id":"W4392411623","doi":"10.2196/53241","title":"Creating High-Quality Synthetic Health Data: Framework for Model Development and Validation","year":2024,"lang":"en","type":"article","venue":"JMIR Formative Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Children's Hospital of Eastern Ontario; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quality (philosophy); Computer science; Model validation; Data quality; Data science; Data mining; Engineering; Operations management","score_opus":0.37240777582468176,"score_gpt":0.5654031685451946,"score_spread":0.1929953927205128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392411623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14687747,0.00011814333,0.84634274,0.0041570356,0.000037801154,0.0012612682,0.0003066142,0.0001681604,0.0007307685],"genre_scores_gemma":[0.73370695,0.000023554974,0.26504907,0.000045475757,0.0000453216,0.00065008644,0.00019858868,0.000020599799,0.00026036156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983782,0.00017517837,0.00041678434,0.00030180637,0.00041499853,0.00031304223],"domain_scores_gemma":[0.99696034,0.0022795068,0.00007074042,0.0004119293,0.00016691981,0.000110583635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029730243,0.00009907831,0.00017709918,0.00015373953,0.00059291406,0.00023017748,0.00022090701,0.00006364262,0.00001930839],"category_scores_gemma":[0.00030620355,0.0000842848,0.000023616236,0.00026636725,0.00007350097,0.00035905934,0.0002069402,0.00032160734,0.000039929502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010304947,0.00009470518,0.0000030589185,0.00089919654,0.000025184343,1.6455903e-7,0.0103491815,0.000009588987,0.00007831346,0.96327156,0.004773046,0.020485705],"study_design_scores_gemma":[0.00017945979,0.000057609148,0.00019616478,0.00051456346,0.000005345998,0.000003558989,0.0017415151,0.07783832,0.0019988534,0.91158766,0.005724833,0.00015214032],"about_ca_topic_score_codex":0.000008605577,"about_ca_topic_score_gemma":0.0000040485834,"teacher_disagreement_score":0.5868295,"about_ca_system_score_codex":0.00016440316,"about_ca_system_score_gemma":0.00021618849,"threshold_uncertainty_score":0.45602754},"labels":[],"label_agreement":null},{"id":"W4392763661","doi":"10.3390/app14062430","title":"Wiener Filter Using the Conjugate Gradient Method and a Third-Order Tensor Decomposition","year":2024,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Wiener filter; Conjugate gradient method; Robustness (evolution); Algorithm; Mathematical optimization; Mathematics; Tensor decomposition; Applied mathematics; Third order; Computer science; Tensor (intrinsic definition)","score_opus":0.07959954090645134,"score_gpt":0.3947157876944449,"score_spread":0.31511624678799355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392763661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6390189,0.0002792046,0.33606002,0.006091026,0.00020851883,0.000687765,0.000018615283,0.00030146836,0.017334525],"genre_scores_gemma":[0.8475498,0.000010008641,0.15140826,0.000712717,0.00006916784,0.00006859022,0.0000017588916,0.0000109060275,0.0001687966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907124,0.000042691016,0.00017977666,0.00031650555,0.00020375257,0.00018605913],"domain_scores_gemma":[0.99927026,0.0004416498,0.0000445975,0.0001621859,0.00003173872,0.00004957579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059832324,0.00010995413,0.00011262113,0.000073044335,0.00054210663,0.00029308553,0.00016737824,0.000034667813,0.000057143963],"category_scores_gemma":[0.00001236555,0.00006525018,0.000035760037,0.00043823628,0.00030205914,0.00009713517,0.00005606039,0.00010287532,0.000027592125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031874788,0.000028427985,0.000013824089,0.000021896389,0.000017759274,0.0000014111056,0.0010444417,0.00015814672,0.05549112,0.93948966,0.0016269074,0.002103232],"study_design_scores_gemma":[0.00023059302,0.00004237972,0.00027968956,0.000072511764,0.00013253398,0.00016934515,0.0012452946,0.13155639,0.01571139,0.8374065,0.012804906,0.00034843283],"about_ca_topic_score_codex":0.000011098693,"about_ca_topic_score_gemma":0.0000062199924,"teacher_disagreement_score":0.20853092,"about_ca_system_score_codex":0.00001687556,"about_ca_system_score_gemma":0.00002838995,"threshold_uncertainty_score":0.41695008},"labels":[],"label_agreement":null},{"id":"W4392979711","doi":"10.1109/jiot.2024.3378202","title":"Sparse Bayesian Tensor Completion for Data Recovery in Intelligent IoT Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Missing data; Bayesian probability; Artificial intelligence; Bayesian inference; Big data; Data mining; Machine learning; Data modeling; Domain knowledge; Database","score_opus":0.14068777719434333,"score_gpt":0.3738669681349511,"score_spread":0.2331791909406078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392979711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14594023,0.00042674423,0.8490444,0.0013804851,0.0019380838,0.0004898247,0.00009653506,0.00007997382,0.00060375564],"genre_scores_gemma":[0.9650646,0.00004499906,0.0331189,0.00012871526,0.00033099783,0.000022365173,0.000024611796,0.000037071695,0.0012277672],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986146,0.000056310597,0.00073288585,0.00021919941,0.00020882019,0.00016815483],"domain_scores_gemma":[0.99885964,0.00039648765,0.0002372635,0.0003215965,0.000113965405,0.00007103143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090743136,0.000121808465,0.00026624333,0.00024314022,0.000034294957,0.00020581024,0.00052160793,0.00007013982,0.000085725245],"category_scores_gemma":[0.0001330201,0.00010524236,0.000113717,0.000111860456,0.00003191215,0.00017282012,0.00005440065,0.00031421753,0.00002750671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005183941,0.001292916,0.00049107644,0.0028208524,0.00087104604,0.00015626408,0.0072166366,0.0014871864,0.030486533,0.17942543,0.7405479,0.034685746],"study_design_scores_gemma":[0.0006234967,0.0002581739,0.000071337716,0.0036330626,0.00015062036,0.0014283811,0.00061360345,0.8188237,0.0054088663,0.11239795,0.056227323,0.00036352253],"about_ca_topic_score_codex":0.00006781707,"about_ca_topic_score_gemma":0.000012038808,"teacher_disagreement_score":0.81912434,"about_ca_system_score_codex":0.000116986994,"about_ca_system_score_gemma":0.00003784992,"threshold_uncertainty_score":0.4291659},"labels":[],"label_agreement":null},{"id":"W4394636026","doi":"10.4230/lipics.approx/random.2022.21","title":"Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Rank (graph theory); Undecidable problem; Tensor (intrinsic definition); Mathematics; Domain (mathematical analysis); Computational complexity theory; Conjecture; Polynomial; Time complexity; Matrix (chemical analysis); Symmetric tensor; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Decidability; Exact solutions in general relativity; Mathematical analysis","score_opus":0.06372568142230997,"score_gpt":0.33636613014081457,"score_spread":0.27264044871850457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394636026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92995626,0.000081855345,0.051929135,0.0008295447,0.0009192025,0.0055643125,0.0016529097,0.00034420844,0.008722604],"genre_scores_gemma":[0.96396995,0.00007854989,0.025093406,0.0014346454,0.00035340205,0.004269817,0.0039630723,0.00019173157,0.0006454318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954866,0.00024377731,0.0020692847,0.00053324667,0.000780457,0.00088661764],"domain_scores_gemma":[0.99621123,0.0005971823,0.0011720966,0.0015726436,0.00026419573,0.00018265635],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017029009,0.0007738151,0.0009605998,0.00050169136,0.00097530254,0.0006472476,0.0014831914,0.00046169764,0.00031925112],"category_scores_gemma":[0.0001946312,0.0006532728,0.0006046845,0.00049952796,0.00012872362,0.0002958583,0.0010741549,0.0027309558,0.0001292103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006644884,0.011149507,0.029732909,0.0218697,0.0042651547,0.0031802468,0.2952945,0.066810116,0.00063900265,0.38891098,0.11471465,0.06276876],"study_design_scores_gemma":[0.021138145,0.0009797594,0.002845833,0.0012929289,0.0017099049,0.008630726,0.035474382,0.5200708,0.00071670284,0.21067746,0.18977721,0.0066861706],"about_ca_topic_score_codex":0.00011923673,"about_ca_topic_score_gemma":0.00048497762,"teacher_disagreement_score":0.45326066,"about_ca_system_score_codex":0.0003322711,"about_ca_system_score_gemma":0.00017297859,"threshold_uncertainty_score":0.9995918},"labels":[],"label_agreement":null},{"id":"W4394910414","doi":"10.1109/mcse.2024.3368956","title":"Tensor Computations—Part I","year":2023,"lang":"en","type":"article","venue":"Computing in Science & Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Tensor (intrinsic definition); Computation; Physics; Mathematical physics; Computer science; Mathematics; Pure mathematics; Algorithm","score_opus":0.05264023556262729,"score_gpt":0.3402714258353571,"score_spread":0.28763119027272976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394910414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9341782,0.000005827293,0.06371381,0.00025051064,0.0002595848,0.00012777146,0.0000014532593,0.00070413394,0.0007587644],"genre_scores_gemma":[0.9621523,0.0000011417915,0.037663512,0.00003261901,0.0000646977,0.0000078803205,0.0000019853258,0.000011848977,0.00006403031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990106,0.000007231304,0.00022711071,0.00022776038,0.00021988756,0.0003073986],"domain_scores_gemma":[0.99933857,0.00029614705,0.000037962247,0.00019890322,0.00006040471,0.000068037945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006153408,0.00008104676,0.00010750886,0.00037673855,0.00016462563,0.00007085847,0.0002809489,0.00002064991,0.00000827017],"category_scores_gemma":[0.00030273097,0.00008594742,0.000026673422,0.0022259245,0.000066076456,0.00009799386,0.00009814842,0.00011153133,0.00012510753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5164794e-7,0.00006429469,0.0027730197,0.00003642489,0.000004002757,0.000013570361,0.0014504596,0.51636165,0.019987876,0.45469874,0.0022036533,0.0024054276],"study_design_scores_gemma":[0.00014443177,0.000006119004,0.03346734,0.00008108538,0.0000021558349,0.000011595894,0.00010927976,0.95827883,0.0009216795,0.004743675,0.0020769988,0.00015679937],"about_ca_topic_score_codex":0.0000018621462,"about_ca_topic_score_gemma":5.744844e-7,"teacher_disagreement_score":0.44995508,"about_ca_system_score_codex":0.000060349368,"about_ca_system_score_gemma":0.000029771902,"threshold_uncertainty_score":0.35048342},"labels":[],"label_agreement":null},{"id":"W4395005329","doi":"10.5539/apr.v16n1p190","title":"About a Solution of (∂^3 x^ν)/(∂x^μ ∂x^μ ∂x^μ )=M:\\{M=0,M&gt;0\\} in Tensor Satisfying Binary Law 2","year":2024,"lang":"en","type":"article","venue":"Applied Physics Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary number; Tensor (intrinsic definition); Mathematical physics; Physics; Materials science; Mathematics; Pure mathematics; Arithmetic","score_opus":0.15643054401318285,"score_gpt":0.4393992303372343,"score_spread":0.2829686863240515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395005329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81187993,0.00075867726,0.009778231,0.0009388533,0.00012989047,0.0021773,0.00009354853,0.00047256524,0.17377101],"genre_scores_gemma":[0.9940977,0.00004695918,0.0048426795,0.00004167839,0.00014081704,0.00038975003,0.000034125747,0.000052356954,0.00035395226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997946,0.00010635419,0.00041572575,0.0004082194,0.00066710275,0.00045659617],"domain_scores_gemma":[0.9982717,0.0009164733,0.000049057377,0.0004927442,0.00016374022,0.00010628282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008142836,0.0001541129,0.00026879538,0.00025290123,0.00017170394,0.000083892584,0.00028146885,0.00010392467,0.00007720285],"category_scores_gemma":[0.0000350483,0.0001508453,0.00009223016,0.0013741314,0.00028035275,0.00011863091,0.00014920245,0.00059598114,0.00030033704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025211844,0.00022547085,0.00003442415,0.0003036878,0.000023281036,0.000006110025,0.0008285393,0.00003506715,0.13425669,0.85678196,0.0025995958,0.0048799836],"study_design_scores_gemma":[0.00050471316,0.00006556295,0.00037444805,0.00033177392,0.000016706317,0.0000041799776,0.00044280424,0.009905858,0.026718011,0.9546874,0.0066799736,0.0002685433],"about_ca_topic_score_codex":0.00009324427,"about_ca_topic_score_gemma":0.000029827801,"teacher_disagreement_score":0.18221776,"about_ca_system_score_codex":0.00013261319,"about_ca_system_score_gemma":0.00011924739,"threshold_uncertainty_score":0.6151293},"labels":[],"label_agreement":null},{"id":"W4396910359","doi":"10.1007/978-3-031-54908-3_1","title":"Introduction","year":2024,"lang":"en","type":"book-chapter","venue":"Compact textbooks in mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Computer science","score_opus":0.06039587419689805,"score_gpt":0.3292959561955844,"score_spread":0.2689000819986863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396910359","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105466905,0.0002738009,0.0012208435,0.0016367187,0.00040384647,0.0007210418,0.00006712014,0.00051166554,0.9950595],"genre_scores_gemma":[0.0015756626,0.000055953624,0.009798957,0.000057640533,0.0010279003,0.000026918264,0.00005192344,0.00022186263,0.98718315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979456,0.0000110429755,0.0009060949,0.00047996128,0.00038132383,0.0002759848],"domain_scores_gemma":[0.9981252,0.0003597891,0.00031615977,0.0010051143,0.000086934975,0.00010679261],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030679276,0.0004979732,0.00073978544,0.00043429784,0.000077792436,0.00011575962,0.00035442653,0.00036068287,0.0027193604],"category_scores_gemma":[0.00006167826,0.00047111066,0.00027180984,0.00006518158,0.00012570141,0.000054357137,0.00008360363,0.00086036493,0.0042930376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023119087,0.00007721556,3.305102e-7,0.0005279011,0.000058544883,0.000014949213,0.0003552856,0.000004088775,0.0000520052,0.8748128,0.123790346,0.00030425447],"study_design_scores_gemma":[0.000104200815,0.000016883303,0.0000012309469,0.00050923374,0.00011027575,0.00006422808,0.00003514148,0.00039347468,0.000052222324,0.7220239,0.27636352,0.0003256633],"about_ca_topic_score_codex":0.0000011787398,"about_ca_topic_score_gemma":0.000011477764,"teacher_disagreement_score":0.15278886,"about_ca_system_score_codex":0.00026071834,"about_ca_system_score_gemma":0.000050070237,"threshold_uncertainty_score":0.99977404},"labels":[],"label_agreement":null},{"id":"W4398147710","doi":"10.1016/j.isatra.2024.05.023","title":"Quadrotors’ double-loop controller design with tensor product model transformation and partial fully actuated method","year":2024,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Transformation (genetics); Controller (irrigation); Model transformation; Tensor product; Fuzzy logic; Mathematics; Computer science; Control (management); Artificial intelligence","score_opus":0.08276827114933696,"score_gpt":0.3494632787812505,"score_spread":0.26669500763191356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398147710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007285325,0.000054554093,0.98640287,0.0035535365,0.00005109253,0.0015199041,0.00006821523,0.00054767594,0.0005168439],"genre_scores_gemma":[0.8591135,0.00002575817,0.13846044,0.00007948401,0.000047702535,0.00087685644,0.0000133715685,0.000047320034,0.0013355284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988469,0.000074402626,0.00032865017,0.0003323549,0.00019799548,0.000219697],"domain_scores_gemma":[0.99930936,0.00023443718,0.000042746742,0.00019990526,0.000101324054,0.00011221991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027412453,0.00020488814,0.00023929658,0.00013981416,0.00026455187,0.00014706398,0.00007436124,0.00007931929,0.00014462975],"category_scores_gemma":[0.0000047960584,0.00015981539,0.00008837077,0.0003035264,0.000059983933,0.00036189292,0.0000013257371,0.00023709888,0.000035562225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004852165,0.0026914277,0.000009520973,0.0015293778,0.0027533986,0.000033916476,0.03783115,0.20457807,0.2055117,0.41183737,0.007459538,0.120912366],"study_design_scores_gemma":[0.003010339,0.00014210139,0.000017689075,0.000097832904,0.00077153824,0.00019394275,0.00030704934,0.9399315,0.034997646,0.015796212,0.0042789667,0.00045519203],"about_ca_topic_score_codex":0.00002190273,"about_ca_topic_score_gemma":0.000021804371,"teacher_disagreement_score":0.8518282,"about_ca_system_score_codex":0.000040055034,"about_ca_system_score_gemma":0.000077786004,"threshold_uncertainty_score":0.65170825},"labels":[],"label_agreement":null},{"id":"W4398229804","doi":"10.48550/arxiv.2405.12325","title":"A canonical polyadic tensor basis for fast Bayesian estimation of multi-subject fMRI activation patterns","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Bayesian probability; Basis (linear algebra); Computer science; Subject (documents); Artificial intelligence; Pattern recognition (psychology); Psychology; Cognitive psychology; Mathematics; Pure mathematics; Geometry","score_opus":0.10391420078392223,"score_gpt":0.2688453596700338,"score_spread":0.1649311588861116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398229804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40004826,0.00000637134,0.5979305,0.0002641369,0.00009657595,0.0007720849,0.00045532643,0.00016717185,0.0002595953],"genre_scores_gemma":[0.983698,0.000014914941,0.014830323,0.000039205835,0.000060186252,0.000023726765,0.00015627389,0.00005305454,0.0011242959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998591,0.000071301576,0.00036433578,0.0006601643,0.00008842369,0.00022474068],"domain_scores_gemma":[0.99830705,0.00040668837,0.00035519822,0.0006318302,0.00018716729,0.00011207879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015746869,0.00028177194,0.00039681114,0.00031500065,0.00010992046,0.000044255175,0.0003417907,0.00031393097,0.00009070677],"category_scores_gemma":[0.000120004384,0.0003150401,0.0003527288,0.000299045,0.00006968903,0.00007612603,0.00027214456,0.00039584894,0.00002533521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004398353,0.0022763454,0.0025808997,0.00647181,0.0013466949,0.00005408249,0.0024475355,0.105014555,0.0051602544,0.86372393,0.00338246,0.007101566],"study_design_scores_gemma":[0.00087711716,0.00006845668,0.0018621555,0.00073665916,0.0006698289,0.0000051084858,0.0003541189,0.8090701,0.0047121732,0.1810431,0.00008551534,0.00051563105],"about_ca_topic_score_codex":0.00017220149,"about_ca_topic_score_gemma":0.000114393726,"teacher_disagreement_score":0.7040556,"about_ca_system_score_codex":0.00026842428,"about_ca_system_score_gemma":0.00018051638,"threshold_uncertainty_score":0.99993014},"labels":[],"label_agreement":null},{"id":"W4399068194","doi":"10.1007/jhep05(2024)299","title":"Improving the five-point bootstrap","year":2024,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Point (geometry); Statistics; Econometrics; Mathematics; Computer science; Geometry","score_opus":0.027771642728328823,"score_gpt":0.2907864636718424,"score_spread":0.2630148209435136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399068194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061540384,0.0005252148,0.92873657,0.005451369,0.0007539843,0.00006362718,0.000014748043,0.000097339514,0.002816739],"genre_scores_gemma":[0.99338216,0.000035151326,0.0043438007,0.0002210754,0.0008708849,0.0000039342713,0.0000012332727,0.000019096497,0.0011226913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993326,0.000028391192,0.00027822994,0.00007316036,0.00018938007,0.00009824544],"domain_scores_gemma":[0.9992763,0.00025032676,0.00016413056,0.00016709653,0.00009781571,0.000044364453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013339527,0.000082965686,0.00013285453,0.00003110661,0.000083282954,0.00009118348,0.00017896836,0.000027604043,0.00003401366],"category_scores_gemma":[0.000014394774,0.00005017481,0.00016381593,0.00014126509,0.000033735767,0.0001380207,0.00002438203,0.00018941227,0.000010375292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035206263,0.000051383333,4.5305413e-7,0.000015484344,0.000053359207,0.00001132408,0.00013022321,0.00008120241,0.0019847257,0.9696714,0.014972929,0.013023995],"study_design_scores_gemma":[0.00011911706,0.000040358394,0.000022865795,0.000052164254,0.00007793454,0.00009868584,0.000082619415,0.0011554144,0.009326431,0.97402674,0.014923875,0.00007378636],"about_ca_topic_score_codex":0.000020593428,"about_ca_topic_score_gemma":0.0000025885238,"teacher_disagreement_score":0.93184173,"about_ca_system_score_codex":0.00003287655,"about_ca_system_score_gemma":0.000047699203,"threshold_uncertainty_score":0.20460694},"labels":[],"label_agreement":null},{"id":"W4399527102","doi":"10.1109/tcpmt.2024.3410298","title":"TC-GVF: Tensor Core GPU-Based Vector Fitting via Accelerated Tall-Skinny QR Solvers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Components Packaging and Manufacturing Technology","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational science; Tensor (intrinsic definition); Parallel computing; Computer science; Core (optical fiber); Computer graphics (images); CUDA; Mathematics; Geometry","score_opus":0.052529132840329756,"score_gpt":0.3024098454241697,"score_spread":0.24988071258383995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399527102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6335509,0.000049323644,0.36030596,0.0029251578,0.00042748576,0.00034298844,0.000053918357,0.0022435752,0.000100717974],"genre_scores_gemma":[0.99060565,0.000023302793,0.008578832,0.00019182471,0.000040358544,0.0001324395,0.000017791173,0.000079225094,0.00033056992],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982236,0.000034812376,0.0004163471,0.00063632126,0.0002145259,0.00047440655],"domain_scores_gemma":[0.9988976,0.00032036612,0.00009784002,0.0005102302,0.00004736963,0.0001265602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013751083,0.00036520054,0.00035759434,0.00079246436,0.000573903,0.00014332792,0.0002710983,0.00027408838,0.00012863753],"category_scores_gemma":[0.0000074698855,0.00035652643,0.00014142825,0.0003389259,0.00019541969,0.00011889188,0.000008240623,0.0007762113,0.00009542813],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037835786,0.0028044512,0.00024422212,0.0019604939,0.0017660211,0.0005035906,0.0014223002,0.0079021705,0.7400428,0.017176006,0.0068545314,0.21894506],"study_design_scores_gemma":[0.0017147686,0.00020383052,0.0005129364,0.0007487978,0.00032411458,0.00029398478,0.00025200626,0.061934955,0.8978954,0.025422446,0.009661173,0.0010356029],"about_ca_topic_score_codex":0.000029700132,"about_ca_topic_score_gemma":0.000012937178,"teacher_disagreement_score":0.3570548,"about_ca_system_score_codex":0.00012459695,"about_ca_system_score_gemma":0.00003198091,"threshold_uncertainty_score":0.99988866},"labels":[],"label_agreement":null},{"id":"W4400193754","doi":"10.1016/j.patcog.2024.110735","title":"Poisson tensor completion with transformed correlated total variation regularization","year":2024,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sichuan Province Science and Technology Support Program; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Regularization (linguistics); Poisson distribution; Variation (astronomy); Tensor (intrinsic definition); Total variation denoising; Applied mathematics; Algorithm; Statistics; Computer science; Artificial intelligence; Pure mathematics; Physics; Image (mathematics)","score_opus":0.039902147148397,"score_gpt":0.28265462941553154,"score_spread":0.24275248226713453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400193754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37153536,0.000015685859,0.623991,0.0013145492,0.00017364616,0.0005845742,0.00013314575,0.00062292535,0.0016290729],"genre_scores_gemma":[0.99334574,0.000011633547,0.0041745347,0.00012715819,0.0001399456,0.00016256726,0.001564304,0.000049536662,0.00042455335],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888825,0.00006875491,0.00030964118,0.00030871484,0.0002515953,0.00017303083],"domain_scores_gemma":[0.99939996,0.00014350605,0.000082933904,0.00015156296,0.00016039629,0.000061667095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015688247,0.00016365825,0.00015401003,0.00016201942,0.00013439449,0.00013380162,0.000041592364,0.000113454735,0.0005899977],"category_scores_gemma":[0.000021190035,0.00014402298,0.0000666117,0.00034423202,0.000026724707,0.0002730344,0.0000060404204,0.00017216745,0.0004248589],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055214553,0.0020430158,0.0014194398,0.0021758243,0.00088497077,0.00013724457,0.0104791215,0.00020281094,0.104189664,0.04555186,0.0096836,0.8226803],"study_design_scores_gemma":[0.0068866005,0.0012768974,0.10971242,0.00382272,0.0020115003,0.0022933965,0.0008002327,0.33025688,0.027739191,0.5076554,0.0046089985,0.0029357537],"about_ca_topic_score_codex":0.000021087539,"about_ca_topic_score_gemma":0.000018353707,"teacher_disagreement_score":0.8197445,"about_ca_system_score_codex":0.000088145054,"about_ca_system_score_gemma":0.000021337124,"threshold_uncertainty_score":0.6460061},"labels":[],"label_agreement":null},{"id":"W4400411415","doi":"10.1109/tbc.2024.3417342","title":"Multimedia Classification via Tensor Linear Discriminant Analysis","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Linear discriminant analysis; Tensor (intrinsic definition); Computer science; Discriminant; Pattern recognition (psychology); Artificial intelligence; Speech recognition; Mathematics","score_opus":0.08644760922550569,"score_gpt":0.35410896379214324,"score_spread":0.26766135456663753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400411415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037142344,0.000027895388,0.96003014,0.0006984256,0.00030747114,0.00025542625,0.000081188104,0.0006509364,0.0008061928],"genre_scores_gemma":[0.951664,0.000014691182,0.046417464,0.000056684745,0.000112706526,0.00013298796,0.00001811973,0.00004351966,0.0015398463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.000055623896,0.00043423456,0.00043291805,0.00025372897,0.00024337089],"domain_scores_gemma":[0.99873966,0.0005917113,0.000075280026,0.00038955023,0.000087706976,0.00011607375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018203273,0.00019881403,0.00023976757,0.00048196575,0.0003140509,0.00009196759,0.0001353603,0.00009835334,0.00034775495],"category_scores_gemma":[0.000018441664,0.00017823782,0.00032527745,0.0012225597,0.000057307065,0.00014324041,0.0000011150175,0.00033480403,0.00040064545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010900029,0.002394497,0.000099897254,0.0006955139,0.0030142358,0.000073168216,0.005652941,0.02219626,0.26337507,0.011322738,0.002412232,0.6886545],"study_design_scores_gemma":[0.00020978891,0.00004230165,0.0006388989,0.000101063655,0.0018847951,0.000031993328,0.00031683967,0.97914416,0.01393971,0.0019894277,0.0013745035,0.00032650118],"about_ca_topic_score_codex":0.00002744801,"about_ca_topic_score_gemma":0.00003337186,"teacher_disagreement_score":0.9569479,"about_ca_system_score_codex":0.00008918292,"about_ca_system_score_gemma":0.00002554879,"threshold_uncertainty_score":0.72683275},"labels":[],"label_agreement":null},{"id":"W4400693123","doi":"10.1137/23m1599355","title":"Memory Capacity of Two Layer Neural Networks with Smooth Activations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Mathematics of Data Science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Layer (electronics); Computer science; Artificial neural network; Neuroscience; Psychology; Artificial intelligence; Materials science; Nanotechnology","score_opus":0.14205692219987792,"score_gpt":0.38760655590766235,"score_spread":0.24554963370778443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400693123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6326084,0.00005071726,0.361712,0.001002238,0.00018586259,0.00032885163,0.00019627475,0.000077247605,0.0038383508],"genre_scores_gemma":[0.81879896,0.000012113414,0.18102592,0.00003351904,0.00006051992,0.000003144139,0.0000045475053,0.000014830433,0.000046412246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833506,0.000029378893,0.0005017904,0.00023778068,0.0006925247,0.00020346702],"domain_scores_gemma":[0.9977947,0.0005986884,0.00036068098,0.00088837894,0.00023702784,0.000120524106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012279013,0.00012861007,0.00024179746,0.00023476487,0.00020204096,0.00013860072,0.0011224514,0.000027623188,0.0000776756],"category_scores_gemma":[0.00020584781,0.00008778934,0.000051829607,0.0008296863,0.0004052052,0.00096646254,0.00014262827,0.00033822592,0.0000058581354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022856142,0.0011101355,0.000042306754,0.00047772698,0.00010914124,0.000016064832,0.0016012199,0.0052737105,0.049838062,0.9318297,0.0044195754,0.0052594915],"study_design_scores_gemma":[0.0008418424,0.00037980606,0.0003440842,0.0017020208,0.00025427638,0.00077617134,0.0010763978,0.65713197,0.026954858,0.3094869,0.00055325264,0.0004984529],"about_ca_topic_score_codex":0.0000023534747,"about_ca_topic_score_gemma":0.0000035656253,"teacher_disagreement_score":0.65185827,"about_ca_system_score_codex":0.000036868554,"about_ca_system_score_gemma":0.00014071786,"threshold_uncertainty_score":0.35799456},"labels":[],"label_agreement":null},{"id":"W4400887522","doi":"10.1063/5.0219434","title":"Using nested tensor train contracted basis functions with group theoretical techniques to compute (ro)-vibrational spectra of molecules with non-Abelian groups","year":2024,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Reims Champagne-Ardenne; Université Paris-Saclay; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Hamiltonian (control theory); Tensor (intrinsic definition); Eigenvalues and eigenvectors; Symmetry (geometry); Basis (linear algebra); Molecule; Symmetry group; Computational chemistry; Physics; Molecular physics; Chemistry; Quantum mechanics; Mathematics; Pure mathematics; Geometry","score_opus":0.02180364736805859,"score_gpt":0.28778773388979884,"score_spread":0.26598408652174027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400887522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3929083,0.000010012873,0.60503817,0.001488062,0.0000154726,0.00020152383,0.00002748144,0.000044834378,0.00026613384],"genre_scores_gemma":[0.85004157,0.0000020058899,0.14949575,0.00016618619,0.0002445934,0.0000063820544,0.0000072013177,0.000031226056,0.000005060667],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988867,0.000055698813,0.00041220372,0.000121297046,0.00037006065,0.00015406341],"domain_scores_gemma":[0.99872774,0.00049432454,0.00019388279,0.00019498414,0.00027874275,0.00011034599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021009296,0.00016669312,0.00030740962,0.00006405012,0.00006568637,0.000048598515,0.00020613447,0.000054238037,0.000032578777],"category_scores_gemma":[0.000021016895,0.000095594165,0.000110128385,0.00045723998,0.00032547317,0.000118859454,0.000022110507,0.00035230917,0.0000024755739],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024619073,0.00034569876,0.000013256894,0.00005304829,0.00018674556,0.000007915219,0.00034606058,0.00014679841,0.72460884,0.27273285,0.0007636221,0.0005489927],"study_design_scores_gemma":[0.0008226136,0.00062736217,0.00026769584,0.0009143876,0.0008830062,0.00076591625,0.00033412786,0.015605489,0.6886075,0.29067886,0.00012858293,0.0003644884],"about_ca_topic_score_codex":0.0000019921488,"about_ca_topic_score_gemma":6.2339245e-7,"teacher_disagreement_score":0.4571333,"about_ca_system_score_codex":0.00005204983,"about_ca_system_score_gemma":0.00006442845,"threshold_uncertainty_score":0.38982168},"labels":[],"label_agreement":null},{"id":"W4401163230","doi":"10.1109/tits.2024.3430039","title":"Convolutional Low-Rank Tensor Representation for Structural Missing Traffic Data Imputation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Imputation (statistics); Representation (politics); Computer science; Missing data; Convolutional neural network; Tensor (intrinsic definition); Rank (graph theory); Artificial intelligence; Data mining; Pattern recognition (psychology); Natural language processing; Mathematics; Machine learning; Combinatorics; Pure mathematics","score_opus":0.11187706007114423,"score_gpt":0.3801490533734013,"score_spread":0.2682719933022571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401163230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050442934,0.0002468136,0.9415738,0.0005120452,0.002006664,0.0016792412,0.002827641,0.00066888414,0.000041984906],"genre_scores_gemma":[0.98987,0.000046655176,0.0069999737,0.000048358714,0.00023034438,0.00050511584,0.0015956874,0.00007837737,0.0006254563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973182,0.000087488836,0.0010461258,0.0007692517,0.00048844,0.00029046985],"domain_scores_gemma":[0.9979218,0.0008941692,0.00017133883,0.0005820367,0.00029138246,0.00013922616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003351274,0.00030206062,0.00032339865,0.00034858403,0.0004045567,0.00026909745,0.00029432707,0.00016710535,0.00014923533],"category_scores_gemma":[0.000014255597,0.0002958957,0.00024553746,0.00049425795,0.00007644094,0.00054106326,4.6099723e-7,0.0002459277,0.000086356245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077204104,0.00095958525,0.00003613683,0.003930538,0.0014368868,0.000033321416,0.0076792235,0.6821906,0.010940492,0.14433137,0.015155809,0.13253403],"study_design_scores_gemma":[0.000915792,0.00013825284,0.0001968267,0.00066694705,0.0005820526,0.00006197854,0.0015577932,0.969467,0.010961591,0.007952107,0.0068236943,0.0006760072],"about_ca_topic_score_codex":0.000039465325,"about_ca_topic_score_gemma":0.000061117506,"teacher_disagreement_score":0.9394271,"about_ca_system_score_codex":0.00015146083,"about_ca_system_score_gemma":0.00011338848,"threshold_uncertainty_score":0.99994934},"labels":[],"label_agreement":null},{"id":"W4401287998","doi":"10.1515/math-2024-0031","title":"Matrix stretching","year":2024,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Tensor product; Injective function; Tensor (intrinsic definition); Pure mathematics; Matrix (chemical analysis); Symmetry (geometry); Product (mathematics); Algebraic number; Tensor product of Hilbert spaces; Algebra over a field; Tensor product of algebras; Tensor contraction; Mathematical analysis; Geometry; Materials science","score_opus":0.08468956082795183,"score_gpt":0.42957890255156006,"score_spread":0.34488934172360824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401287998","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20794812,0.00044961256,0.16984932,0.0077950684,0.00064577506,0.0029172488,0.00015807795,0.0020123255,0.60822445],"genre_scores_gemma":[0.3367323,0.000020600557,0.63419074,0.00013138379,0.00015385795,0.00015926488,0.000017872651,0.000096620315,0.028497368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913836,0.000019153013,0.0003132689,0.00020178324,0.00016626835,0.00016117934],"domain_scores_gemma":[0.9990306,0.00039509527,0.00005227409,0.00042165746,0.000031096548,0.00006930552],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032372828,0.00012769774,0.00019300697,0.00006099435,0.00011632464,0.0006553711,0.00049074733,0.00005042701,0.0009785193],"category_scores_gemma":[0.000055625344,0.00010645481,0.00007494957,0.00021545927,0.000022899205,0.0002149287,0.00018866447,0.00014347468,0.0012670031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.7448216e-7,0.000098823926,0.0000021200315,0.0001987551,0.000028036484,0.000008942089,0.0008508931,0.0000014828853,0.0005860027,0.9581901,0.03869128,0.0013430188],"study_design_scores_gemma":[0.0001013067,0.00001085062,0.0000037520324,0.00022240015,0.000050094462,0.000058946523,0.00047982545,0.009504332,0.0007905154,0.9538975,0.034715008,0.00016549455],"about_ca_topic_score_codex":0.000004480957,"about_ca_topic_score_gemma":0.000003984152,"teacher_disagreement_score":0.5797271,"about_ca_system_score_codex":0.00003422346,"about_ca_system_score_gemma":0.000034610035,"threshold_uncertainty_score":0.99993473},"labels":[],"label_agreement":null},{"id":"W4401499346","doi":"10.3389/fninf.2024.1399391","title":"A canonical polyadic tensor basis for fast Bayesian estimation of multi-subject brain activation patterns","year":2024,"lang":"en","type":"article","venue":"Frontiers in Neuroinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tensor (intrinsic definition); Human Connectome Project; Functional magnetic resonance imaging; Bayesian probability; Canonical correlation; Artificial intelligence; Population; Scalar (mathematics); Curse of dimensionality; Bayes estimator; Pattern recognition (psychology); Working memory; Basis function; Machine learning; Mathematics; Cognition; Psychology; Neuroscience","score_opus":0.02836119733561122,"score_gpt":0.313061369486997,"score_spread":0.28470017215138577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401499346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07409825,0.000017549715,0.92302054,0.001222534,0.00027017356,0.0008243121,0.00020665316,0.00014064115,0.00019935661],"genre_scores_gemma":[0.6634228,0.0000136936105,0.335815,0.00026071043,0.000034579763,0.000135998,0.000078283745,0.000039609076,0.0001992887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986478,0.000037907113,0.0007164775,0.00016580023,0.00020439197,0.00022763712],"domain_scores_gemma":[0.99886495,0.00054330745,0.00017459398,0.000295698,0.000053852462,0.00006760353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023491602,0.00016870398,0.00028155348,0.00036451677,0.000066621586,0.00006837533,0.0001748694,0.00009933133,0.000014656754],"category_scores_gemma":[0.0004459414,0.00016410016,0.00013102268,0.00035130332,0.00004521488,0.00032939392,0.000027042623,0.00018523753,0.000004949076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048647693,0.002513284,0.010364116,0.016060933,0.0006457128,0.000027423273,0.03909066,0.01833672,0.0069525666,0.14957716,0.3438776,0.41206735],"study_design_scores_gemma":[0.00056226883,0.00007110896,0.0016251878,0.00031258757,0.000043429416,0.000009889997,0.00062535977,0.98509157,0.0022288517,0.008037418,0.0012041705,0.00018814587],"about_ca_topic_score_codex":0.000010632971,"about_ca_topic_score_gemma":0.0000118129265,"teacher_disagreement_score":0.96675485,"about_ca_system_score_codex":0.00011263958,"about_ca_system_score_gemma":0.000090088375,"threshold_uncertainty_score":0.66918105},"labels":[],"label_agreement":null},{"id":"W4401626153","doi":"10.20944/preprints202408.0929.v1","title":"The BiCG Algorithm for Solving the Minimal Frobenius Norm Solution of Generalized Sylvester Tensor Equation over the Quaternions","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quaternion; Matrix norm; Sylvester equation; Mathematics; Tensor (intrinsic definition); Convergence (economics); Norm (philosophy); Algorithm; Sylvester matrix; Applied mathematics; Exact solutions in general relativity; Mathematical optimization; Algebra over a field; Mathematical analysis; Pure mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.19152233562894075,"score_gpt":0.39329379332824477,"score_spread":0.20177145769930402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401626153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8621513,0.0004482015,0.11198113,0.016925437,0.0014064244,0.00504518,0.00050719857,0.00034384552,0.0011912497],"genre_scores_gemma":[0.9817965,0.0001504072,0.010993512,0.00022823694,0.0006060493,0.0027942804,0.000114544935,0.00010103323,0.003215449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743533,0.00019907342,0.00093671074,0.0006268006,0.000439936,0.0003621582],"domain_scores_gemma":[0.995787,0.0014587737,0.0006642112,0.0016955837,0.0003335373,0.00006087292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014815808,0.00035334023,0.0003732208,0.00008315828,0.0006858016,0.00014756218,0.0009829953,0.0002566852,0.00014393352],"category_scores_gemma":[0.00031582091,0.00019317403,0.0005503624,0.00015808726,0.0002412587,0.000055409404,0.0013869508,0.000724334,0.0002224775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037258104,0.0014844013,0.008656892,0.0019197458,0.0037847594,0.000005042316,0.019713221,0.001518384,0.106338896,0.793682,0.023174848,0.039349232],"study_design_scores_gemma":[0.0011938977,0.000042166135,0.03819034,0.0005144736,0.0013510552,0.000024517496,0.00077815034,0.23226301,0.028857455,0.67172426,0.024234945,0.00082573364],"about_ca_topic_score_codex":0.00020688215,"about_ca_topic_score_gemma":0.00009345675,"teacher_disagreement_score":0.23074463,"about_ca_system_score_codex":0.00013270558,"about_ca_system_score_gemma":0.00013332308,"threshold_uncertainty_score":0.7877408},"labels":[],"label_agreement":null},{"id":"W4401758534","doi":"10.1016/j.laa.2024.08.013","title":"The determinant of {±1}-matrices and oriented hypergraphs","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017830019581672664,"score_gpt":0.30795868979055235,"score_spread":0.29012867020887967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401758534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94368964,0.017612481,0.028155487,0.0052004945,0.00009394769,0.0015836135,0.00018316325,0.0003868677,0.003094316],"genre_scores_gemma":[0.9929161,0.002097575,0.0038498614,0.000042589818,0.00007105991,0.00030406704,0.000009544586,0.000016944827,0.0006922354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944746,0.000013062454,0.00020839325,0.00016166257,0.00007783114,0.0000916086],"domain_scores_gemma":[0.999195,0.00046879036,0.000046634523,0.00018092769,0.000056738118,0.000051911607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095945965,0.0000763315,0.00009315311,0.00004880122,0.00024041666,0.000042762433,0.00008029937,0.000035781362,0.000010676802],"category_scores_gemma":[0.000021544107,0.000050494982,0.000034032382,0.0002693651,0.00008050738,0.000048809205,0.00003729152,0.000072238036,0.000015340687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001850744,0.000030084377,0.000029734383,0.000076298034,0.000019149285,2.2723617e-7,0.00013290312,1.2163726e-7,0.0027404437,0.9831235,0.00054438715,0.013301309],"study_design_scores_gemma":[0.0002881258,0.00006408814,0.0011694628,0.000098863944,0.00021376574,0.00007485224,0.00045889328,0.013243051,0.009073498,0.36396667,0.6110634,0.00028526533],"about_ca_topic_score_codex":0.0000022248703,"about_ca_topic_score_gemma":0.000003984335,"teacher_disagreement_score":0.6191568,"about_ca_system_score_codex":0.0000033324854,"about_ca_system_score_gemma":0.000012581274,"threshold_uncertainty_score":0.20591256},"labels":[],"label_agreement":null},{"id":"W4402014004","doi":"10.1007/978-3-031-70362-1_15","title":"Graphical Model-Based Lasso for Weakly Dependent Time Series of Tensors","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Series (stratigraphy); Lasso (programming language); Graphical model; Algorithm; Time series; Artificial intelligence; Theoretical computer science; Applied mathematics; Machine learning; Mathematics; Programming language; Geology","score_opus":0.02534541485026531,"score_gpt":0.28632744140858646,"score_spread":0.26098202655832115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402014004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026839136,0.000056496116,0.99546534,0.0014709427,0.00015290815,0.0005284013,0.00012087721,0.00011437402,0.0018222637],"genre_scores_gemma":[0.13515317,0.0000070692504,0.8595126,0.0005629152,0.00020588688,0.00006925452,0.000026161939,0.00008195953,0.0043809665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829847,0.0000073552605,0.0004146113,0.0005968666,0.00043556502,0.00024715337],"domain_scores_gemma":[0.9984675,0.00053827587,0.00016062689,0.0005349579,0.00022102012,0.00007763165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030060022,0.0002708936,0.00040006358,0.00040362013,0.000098657634,0.000085085114,0.0005860316,0.00022354908,0.000030297753],"category_scores_gemma":[0.00005219802,0.00023261369,0.0001875167,0.0001971903,0.00048206252,0.000068325964,0.00013402096,0.00032539028,0.000022862985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004226628,0.00012744997,0.0000058746996,0.00048240882,0.00004297718,0.00001178305,0.00029955016,0.0866253,0.0039876695,0.89602935,0.00040265633,0.011942693],"study_design_scores_gemma":[0.000090667,0.000054130483,0.0000017620017,0.00017564207,0.00002602292,0.000008145086,7.693361e-8,0.3913463,0.0025155607,0.60531884,0.0002948712,0.00016797525],"about_ca_topic_score_codex":0.000001270401,"about_ca_topic_score_gemma":0.00001897474,"teacher_disagreement_score":0.304721,"about_ca_system_score_codex":0.000076319,"about_ca_system_score_gemma":0.00018124556,"threshold_uncertainty_score":0.9485711},"labels":[],"label_agreement":null},{"id":"W4402313870","doi":"10.3390/sym16091167","title":"The BiCG Algorithm for Solving the Minimal Frobenius Norm Solution of Generalized Sylvester Tensor Equation over the Quaternions","year":2024,"lang":"en","type":"article","venue":"Symmetry","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Matrix norm; Quaternion; Sylvester equation; Tensor (intrinsic definition); Mathematics; Norm (philosophy); Convergence (economics); Sylvester matrix; Algorithm; Exact solutions in general relativity; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis; Pure mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.05211534162158197,"score_gpt":0.3339578734230112,"score_spread":0.2818425318014292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402313870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16092502,0.0012970943,0.8167911,0.016584119,0.0009697441,0.0019011467,0.00029295534,0.0002427986,0.0009960169],"genre_scores_gemma":[0.9643657,0.00007064862,0.031389963,0.00042057037,0.00060310325,0.0005314371,0.00005088059,0.000057623933,0.002510028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989324,0.000071757066,0.0003740265,0.00018407144,0.00022685614,0.0002108806],"domain_scores_gemma":[0.997579,0.0017364135,0.00013087923,0.00041780245,0.00010693143,0.000028968341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005977091,0.00012791461,0.00013174817,0.00005342246,0.0005491407,0.0001690579,0.0002722725,0.00006798325,0.000034060802],"category_scores_gemma":[0.000111075824,0.00006107501,0.00020433035,0.00024091228,0.0001149899,0.00008686913,0.000056928075,0.0001452267,0.000031248128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026506787,0.00012879836,0.000088047804,0.00010623579,0.00026503752,6.895943e-7,0.0013654366,0.000011636928,0.014302703,0.8619588,0.049887925,0.07185817],"study_design_scores_gemma":[0.001095044,0.000112077774,0.0043177693,0.00017520147,0.00055025495,0.000034267887,0.0013840562,0.5743854,0.011044772,0.32461888,0.08186612,0.00041613294],"about_ca_topic_score_codex":0.000050623174,"about_ca_topic_score_gemma":0.000037043144,"teacher_disagreement_score":0.80344075,"about_ca_system_score_codex":0.00004448658,"about_ca_system_score_gemma":0.00003772114,"threshold_uncertainty_score":0.42236018},"labels":[],"label_agreement":null},{"id":"W4402616002","doi":"10.1017/s0963548324000233","title":"A new formula for the determinant and bounds on its tensor and Waring ranks","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Mathematics; Mathematical economics; Algebra over a field; Pure mathematics; Statistics","score_opus":0.08689395350699279,"score_gpt":0.34970296613357243,"score_spread":0.26280901262657963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402616002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87100816,0.0011081473,0.122113146,0.0027221788,0.00043714265,0.0017715625,0.0000088773395,0.00036463886,0.00046616915],"genre_scores_gemma":[0.98972976,0.000016286844,0.009821712,0.000068758956,0.00007590557,0.000039330484,0.0000012298644,0.000024070805,0.00022297127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989804,0.00002933629,0.00028492484,0.00035748794,0.00012770144,0.00022015293],"domain_scores_gemma":[0.9971058,0.0023834524,0.000058445752,0.00028168698,0.00008127029,0.00008939546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924472,0.00015492148,0.00018917845,0.000045641475,0.0004662533,0.00025847575,0.00014355469,0.00006739456,0.0000027434398],"category_scores_gemma":[0.00031358903,0.00011195016,0.00006739941,0.00017035323,0.000047748395,0.00006576085,0.00013695892,0.00020447373,0.000002750951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010551476,0.000062013685,0.00018678849,0.0004966394,0.000024661886,0.0000011401248,0.0008417969,0.000010115846,0.0001701416,0.95625067,0.00061641756,0.04132906],"study_design_scores_gemma":[0.00045194107,0.00009410954,0.0010902475,0.00015453322,0.000059748592,0.000030460067,0.000043932934,0.121305756,0.00047449706,0.8718238,0.0043068076,0.00016416666],"about_ca_topic_score_codex":0.0000043135674,"about_ca_topic_score_gemma":0.0000021203218,"teacher_disagreement_score":0.121295646,"about_ca_system_score_codex":0.00006745325,"about_ca_system_score_gemma":0.000040084473,"threshold_uncertainty_score":0.4565195},"labels":[],"label_agreement":null},{"id":"W4402978094","doi":"10.1109/tcbb.2024.3471930","title":"MG-TCCA: Tensor Canonical Correlation Analysis Across Multiple Groups","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Biology and Bioinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute on Aging; Canadian Institutes of Health Research; GE Healthcare; Genentech; IXICO; U.S. National Library of Medicine; H. Lundbeck A/S; Pfizer; Novartis Pharmaceuticals Corporation; Biogen; Alzheimer's Drug Discovery Foundation; Merck; Takeda Pharmaceutical Company; Eli Lilly and Company; Servier","keywords":"Canonical correlation; Correlation; Tensor (intrinsic definition); Canonical analysis; Canonical correspondence analysis; Mathematics; Statistics; Geology; Pure mathematics; Paleontology","score_opus":0.029186359324651,"score_gpt":0.33807272609567635,"score_spread":0.3088863667710253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402978094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1092923,0.00003841786,0.8887781,0.0005827286,0.00021078972,0.00021259685,0.00042729525,0.00024283981,0.0002149699],"genre_scores_gemma":[0.95440614,0.000029305489,0.044833474,0.00027358404,0.000038314825,0.000044177345,0.00018242604,0.000011480257,0.00018106843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887747,0.000046635963,0.00050494145,0.00022388368,0.00013801239,0.00020905273],"domain_scores_gemma":[0.9982089,0.0013578286,0.00008315481,0.00015346544,0.00010168206,0.00009498637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020347834,0.0001783801,0.00024504273,0.00025246275,0.00039546654,0.000091857575,0.00009007422,0.00018592893,0.00009151384],"category_scores_gemma":[0.000014917441,0.00014949807,0.00018692386,0.00062950916,0.00017257812,0.00016705191,0.0000029483406,0.00028658344,0.00012572976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004056472,0.001822942,0.003993295,0.00088273233,0.006858137,0.000021485646,0.0101261595,0.3785013,0.0006406702,0.4041031,0.0058067376,0.1868378],"study_design_scores_gemma":[0.00041323024,0.00009059643,0.002157038,0.0000278954,0.00034428664,0.000048159363,0.00019726763,0.9692561,0.00010019429,0.026348365,0.0007934364,0.00022344958],"about_ca_topic_score_codex":0.000009658382,"about_ca_topic_score_gemma":0.000053364714,"teacher_disagreement_score":0.8451139,"about_ca_system_score_codex":0.000049774975,"about_ca_system_score_gemma":0.000045435077,"threshold_uncertainty_score":0.6096355},"labels":[],"label_agreement":null},{"id":"W4403075406","doi":"10.1016/j.ifacol.2024.08.498","title":"Tensor Train Discrete Grid-Based Filters: Breaking the Curse of Dimensionality","year":2024,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Curse of dimensionality; Curse; Tensor (intrinsic definition); Grid; Computer science; Algorithm; Artificial intelligence; Mathematics; Geometry; Sociology","score_opus":0.054077765865036084,"score_gpt":0.3672022558879268,"score_spread":0.3131244900228907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403075406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8886203,0.0006837892,0.021914328,0.07964257,0.00066631805,0.0012718148,0.0028480191,0.00083547184,0.0035173781],"genre_scores_gemma":[0.786643,0.000009195535,0.21028721,0.0012317931,0.00037612036,0.000072063405,0.00018200389,0.000053471886,0.0011451055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987992,0.00007954538,0.00036211716,0.00027566322,0.00028649642,0.00019699412],"domain_scores_gemma":[0.99851257,0.0008219874,0.000094678864,0.00043070098,0.00007148115,0.0000685808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030185774,0.00017253894,0.00022484403,0.000058469042,0.00012857208,0.000046171815,0.00021507287,0.000064449014,0.00045234675],"category_scores_gemma":[0.00009602151,0.000110306864,0.00022238983,0.00026346793,0.00016708624,0.00006757009,0.00003307447,0.00020685667,0.000052731015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026764735,0.002119059,0.00062269997,0.0019035101,0.000859718,0.00012595822,0.0076315836,0.0008653998,0.29437107,0.6534956,0.009145824,0.028591942],"study_design_scores_gemma":[0.0071010604,0.0007766241,0.024368525,0.0049935775,0.0027128763,0.00048339323,0.008026238,0.47627026,0.07146122,0.23800874,0.16177319,0.0040242956],"about_ca_topic_score_codex":0.000029930989,"about_ca_topic_score_gemma":0.000027416301,"teacher_disagreement_score":0.47540486,"about_ca_system_score_codex":0.000032237454,"about_ca_system_score_gemma":0.000053490097,"threshold_uncertainty_score":0.49528795},"labels":[],"label_agreement":null},{"id":"W4403789673","doi":"10.5539/apr.v16n2p99","title":"Property of Tensor Satisfying Binary Law 5","year":2024,"lang":"en","type":"article","venue":"Applied Physics Research","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary number; Tensor (intrinsic definition); Property (philosophy); Law; Computer science; Mathematics; Geometry; Arithmetic; Philosophy; Political science","score_opus":0.22480062107934265,"score_gpt":0.4476800263704843,"score_spread":0.22287940529114167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403789673","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23648092,0.0002192618,0.007688702,0.0018686745,0.00010035603,0.0022190898,0.0000943919,0.00065983617,0.75066876],"genre_scores_gemma":[0.99210143,0.000013539603,0.005796987,0.00003695164,0.0001411468,0.00024245973,0.000013510486,0.000040728217,0.0016132193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867994,0.00005207867,0.00021725701,0.0002679082,0.00051431224,0.00026852294],"domain_scores_gemma":[0.9987707,0.0005635491,0.00002468261,0.00041526768,0.00015886601,0.000066948734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045960094,0.000096945834,0.00016395809,0.00007722838,0.00017505014,0.00007229564,0.00022526667,0.00005186526,0.00011333372],"category_scores_gemma":[0.000013978889,0.00006792909,0.000064482716,0.00066109234,0.00022939597,0.00006202206,0.0001244053,0.00037758995,0.00039964519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008729056,0.00012369404,0.0000068041954,0.00024399807,0.000027433187,0.0000025042973,0.00031462955,0.000008801463,0.12997772,0.8544357,0.008053634,0.006796386],"study_design_scores_gemma":[0.00017729726,0.00003833162,0.00006129821,0.000107935535,0.000016315831,0.0000027309834,0.00020563471,0.0025794809,0.06381695,0.90967077,0.023171496,0.00015177992],"about_ca_topic_score_codex":0.000045667293,"about_ca_topic_score_gemma":0.0000033009935,"teacher_disagreement_score":0.75562054,"about_ca_system_score_codex":0.000042116924,"about_ca_system_score_gemma":0.00006187993,"threshold_uncertainty_score":0.5136764},"labels":[],"label_agreement":null},{"id":"W4404569111","doi":"10.48550/arxiv.2411.09816","title":"Learning Fine-grained Parameter Sharing via Sparse Tensor Decomposition","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Alberta Innovates","keywords":"Tensor (intrinsic definition); Computer science; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.11095075603748983,"score_gpt":0.2582313782133282,"score_spread":0.14728062217583837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404569111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90583396,0.000030629384,0.08744086,0.0003253458,0.0002759237,0.0005522003,0.000045219538,0.0009142462,0.0045815855],"genre_scores_gemma":[0.98721844,0.000026613501,0.0046622325,0.00006555409,0.00014596239,0.000009641729,0.00013404855,0.00007882561,0.0076586595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998016,0.000096332355,0.00034806706,0.0010845829,0.00010060007,0.00035443684],"domain_scores_gemma":[0.9982801,0.00031292316,0.00026539405,0.00081586227,0.00014803559,0.00017766749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020630685,0.00040423372,0.00043194846,0.0003373463,0.00023682858,0.00015692042,0.0005443264,0.00035192887,0.00031110973],"category_scores_gemma":[0.000070027425,0.00046265213,0.00040431443,0.00040330374,0.00008591325,0.00008745187,0.0010780307,0.0012560249,0.00073816284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001908833,0.0007703331,0.0036487803,0.0014042044,0.0009860179,0.0008834701,0.0011232225,0.10883706,0.0035121918,0.8711852,0.005785149,0.0016735159],"study_design_scores_gemma":[0.00034959862,0.000040651707,0.00032927218,0.00026615252,0.0004305603,0.00002179986,0.00008817963,0.29752472,0.00033322026,0.69949836,0.00058913726,0.00052837364],"about_ca_topic_score_codex":0.000043647568,"about_ca_topic_score_gemma":0.000032664426,"teacher_disagreement_score":0.18868767,"about_ca_system_score_codex":0.0002308047,"about_ca_system_score_gemma":0.000044954104,"threshold_uncertainty_score":0.9997825},"labels":[],"label_agreement":null},{"id":"W4405002901","doi":"10.1007/978-3-031-72630-9_26","title":"Handling the Non-smooth Challenge in Tensor SVD: A Multi-objective Tensor Recovery Framework","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of British Columbia","funders":"","keywords":"Computer science; Tensor (intrinsic definition); Tensor decomposition; Singular value decomposition; Lanczos tensor; Algorithm; Algebra over a field; Tensor field; Tensor density; Mathematics; Exact solutions in general relativity; Pure mathematics; Mathematical analysis","score_opus":0.03840319060337078,"score_gpt":0.31044943515594087,"score_spread":0.2720462445525701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405002901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090353825,0.00059621147,0.98910713,0.0030136374,0.0008978001,0.0010648118,0.000034643643,0.00015680536,0.0042254236],"genre_scores_gemma":[0.30077052,0.0002865692,0.69074786,0.002728734,0.0014048562,0.00022484141,0.000010979301,0.00020533425,0.0036203088],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972572,0.000030763345,0.0005650619,0.001119173,0.00053053186,0.0004972784],"domain_scores_gemma":[0.99646246,0.002059075,0.00022479796,0.000990041,0.00017089325,0.00009270868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006356718,0.00048377246,0.0005491978,0.00058481237,0.0002596058,0.00030413424,0.0010723885,0.00043851454,0.000049633596],"category_scores_gemma":[0.00022261197,0.00034761746,0.00019694587,0.0005408363,0.0005102928,0.0001282301,0.00041274322,0.0017745346,0.00013572321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011032895,0.0009177304,0.00015080611,0.0008901247,0.00022529303,0.0004939434,0.027813183,0.028493457,0.00070016127,0.4357729,0.000501872,0.5039302],"study_design_scores_gemma":[0.0002510086,0.000091547125,0.0002438096,0.0018583677,0.000033483877,0.00003549282,0.000007752409,0.08186029,0.00016075336,0.913706,0.0012092785,0.0005421994],"about_ca_topic_score_codex":0.00002166319,"about_ca_topic_score_gemma":0.00028635556,"teacher_disagreement_score":0.503388,"about_ca_system_score_codex":0.0003153577,"about_ca_system_score_gemma":0.00018035567,"threshold_uncertainty_score":0.9998976},"labels":[],"label_agreement":null},{"id":"W4405033697","doi":"10.21468/scipostphyscore.8.4.067","title":"Fractal decompositions and tensor network representations of Bethe wavefunctions","year":2025,"lang":"en","type":"preprint","venue":"SciPost Physics Core","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Institut de Ciències Fotòniques; Canadian Institute for Advanced Research","keywords":"Wave function; Fractal; Tensor (intrinsic definition); Mathematics; Physics; Statistical physics; Pure mathematics; Mathematical physics; Mathematical analysis; Quantum mechanics","score_opus":0.06853633399500149,"score_gpt":0.37099731360553406,"score_spread":0.3024609796105326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405033697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56779724,0.000927052,0.3123833,0.009972823,0.0030328766,0.007123784,0.012855207,0.0015396074,0.08436811],"genre_scores_gemma":[0.786143,0.00019343673,0.20556086,0.00042663893,0.0011385758,0.00074054097,0.0020766794,0.00009557,0.0036247077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982544,0.000073574905,0.00059603906,0.0005536102,0.00026119687,0.00026114],"domain_scores_gemma":[0.9971422,0.0008088071,0.00045234084,0.0010439393,0.00043584057,0.00011686615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001416723,0.00031238786,0.0005190873,0.000109174325,0.00045446274,0.00007345482,0.00032099982,0.00022727955,0.0000808345],"category_scores_gemma":[0.00007090847,0.0003240287,0.00027687236,0.00043601767,0.0002520572,0.00008082664,0.00062360516,0.0006407119,0.00001535616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003655018,0.0008701415,0.0019833897,0.00059182657,0.0005992295,0.000002787401,0.0010306186,0.0039738645,0.0025726573,0.93734217,0.04827987,0.0027169264],"study_design_scores_gemma":[0.00032053323,0.00003145859,0.0054917126,0.00045530824,0.00056646706,0.0000074334707,0.00017775488,0.00541447,0.00057180447,0.98557675,0.0010343906,0.00035191688],"about_ca_topic_score_codex":0.000045016957,"about_ca_topic_score_gemma":0.000030995772,"teacher_disagreement_score":0.21834575,"about_ca_system_score_codex":0.000048623737,"about_ca_system_score_gemma":0.00015744676,"threshold_uncertainty_score":0.9999212},"labels":[],"label_agreement":null},{"id":"W4405384795","doi":"10.1002/nla.2608","title":"Quaternion Tensor Completion via <scp>QR</scp> Decomposition and Nuclear Norm Minimization","year":2024,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Quaternion; Singular value decomposition; Robustness (evolution); Mathematics; Tensor (intrinsic definition); Matrix completion; Matrix norm; Mathematical optimization; Matrix decomposition; Minification; Singular value; Generalization; Algorithm; Computer science; Artificial intelligence; Mathematical analysis; Pure mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.01797523011889221,"score_gpt":0.2937145160819113,"score_spread":0.2757392859630191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405384795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06792718,0.00012003804,0.92536753,0.00199936,0.000047355465,0.0012136148,0.00009180335,0.0010491301,0.0021840066],"genre_scores_gemma":[0.84154314,0.000053131087,0.15584956,0.00046438945,0.00031668955,0.00075326505,0.0005036327,0.00011861032,0.00039760812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832344,0.00006123161,0.00044258233,0.0005778738,0.00031055333,0.0002842998],"domain_scores_gemma":[0.9985835,0.00048129674,0.00013263847,0.00040953673,0.00017099852,0.00022202608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120008204,0.0002668258,0.00027873085,0.00016751798,0.00038849137,0.00018120512,0.00017093406,0.00013569105,0.00009740958],"category_scores_gemma":[0.000030999432,0.00023260547,0.00008183876,0.0006863258,0.00013381572,0.00021686734,0.000051173054,0.00026770498,0.00058547466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041510102,0.0010806768,0.0006663635,0.00043881987,0.00021582635,0.000009483281,0.0012043143,0.00022242378,0.011310773,0.9484992,0.013549696,0.022760894],"study_design_scores_gemma":[0.0012990411,0.00045676943,0.0072750812,0.00023743084,0.00054837327,0.00052370655,0.00048577442,0.36682606,0.0015567457,0.11322842,0.50690365,0.0006589673],"about_ca_topic_score_codex":0.000017473925,"about_ca_topic_score_gemma":0.0000043836653,"teacher_disagreement_score":0.8352708,"about_ca_system_score_codex":0.00007571246,"about_ca_system_score_gemma":0.000027427512,"threshold_uncertainty_score":0.9485376},"labels":[],"label_agreement":null},{"id":"W4405529663","doi":"10.1016/j.laa.2024.12.010","title":"On the maximal ranks of some third-order quaternion tensors","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Quaternion; Order (exchange); Pure mathematics; Third order; Algebra over a field; Geometry; Theology","score_opus":0.03198494979118157,"score_gpt":0.30765101874433476,"score_spread":0.2756660689531532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405529663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8955149,0.0016079743,0.054622993,0.03184596,0.00015315559,0.0027703093,0.0003374525,0.00076528476,0.012381941],"genre_scores_gemma":[0.9937504,0.00018401621,0.0025904314,0.0005286056,0.00019320972,0.000531659,0.000028696299,0.000034604873,0.0021583813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921805,0.00002866443,0.00025842586,0.00022694204,0.0001464522,0.000121474004],"domain_scores_gemma":[0.99890184,0.0005973527,0.00005670279,0.00031539964,0.000077738994,0.000050936524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014268693,0.00011790006,0.00013213516,0.00006565419,0.00016515116,0.000042688458,0.00015313923,0.00006600037,0.00017905592],"category_scores_gemma":[0.000042792795,0.00007824551,0.00006441902,0.0002683732,0.00006531591,0.00006361509,0.000034761593,0.00017156775,0.0003058503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004740343,0.00008421025,0.0000030046838,0.000055710956,0.000025725778,2.3154996e-7,0.00017184192,0.0000053414396,0.0023276391,0.9929345,0.003316609,0.0010703946],"study_design_scores_gemma":[0.00024771388,0.000056131586,0.00019383566,0.00008043487,0.000096396754,0.000012071052,0.0001624382,0.01535147,0.0075148335,0.8995856,0.07647725,0.00022181073],"about_ca_topic_score_codex":0.0000031456964,"about_ca_topic_score_gemma":0.000001051708,"teacher_disagreement_score":0.098235466,"about_ca_system_score_codex":0.000008806177,"about_ca_system_score_gemma":0.000018531899,"threshold_uncertainty_score":0.3931189},"labels":[],"label_agreement":null},{"id":"W4406053661","doi":"10.1016/j.ins.2024.121833","title":"Improving preference disaggregation in multicriteria decision making: Incorporating time series analysis and a multi-objective approach","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Preference; Series (stratigraphy); Time series; Computer science; Decision analysis; Econometrics; Operations research; Machine learning; Mathematical optimization; Artificial intelligence; Data mining; Statistics; Mathematics","score_opus":0.043528293611673506,"score_gpt":0.34129733944197516,"score_spread":0.29776904583030167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406053661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39110962,0.0000063238263,0.6061106,0.00007912596,0.000019266625,0.00028152284,0.000010292318,0.00005402676,0.0023292631],"genre_scores_gemma":[0.7242269,0.0000011828305,0.27564055,0.00004765333,0.0000026845607,0.000044515848,0.000008947589,0.0000011317213,0.00002643213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990882,0.00004117086,0.0004246484,0.00015794196,0.00017975926,0.00010825848],"domain_scores_gemma":[0.9992265,0.00026195825,0.00025174377,0.00012533487,0.00011284469,0.00002159327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000578933,0.00008911961,0.00015144615,0.0006280693,0.0002766681,0.00031712884,0.00014496589,0.00004538668,0.000008777072],"category_scores_gemma":[0.00046521286,0.000075793876,0.000029438226,0.0017846066,0.00014125108,0.0018103217,0.00007867699,0.00006621197,0.000006887005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016700246,0.0005211593,0.12179812,0.00047863775,0.00018199903,7.557838e-7,0.031686164,0.0063459696,0.0065889517,0.30858013,0.00019528405,0.5234558],"study_design_scores_gemma":[0.00034622801,0.000018961107,0.08141923,0.00009265941,0.000046533314,0.0000024442415,0.0027351994,0.883991,0.0005539178,0.030632177,0.000017222492,0.00014445564],"about_ca_topic_score_codex":0.0000462885,"about_ca_topic_score_gemma":0.00008302188,"teacher_disagreement_score":0.877645,"about_ca_system_score_codex":0.000043760716,"about_ca_system_score_gemma":0.000048544956,"threshold_uncertainty_score":0.30907845},"labels":[],"label_agreement":null},{"id":"W4406940898","doi":"10.1007/978-3-031-79029-4_5","title":"A Novel Genetic Algorithm Approach for Discriminative Subspace Optimization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Discriminative model; Subspace topology; Genetic algorithm; Algorithm; Optimization algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","score_opus":0.037909874601596304,"score_gpt":0.30212238473931813,"score_spread":0.26421251013772185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406940898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014097463,0.000056673067,0.9943718,0.00041735702,0.00018926346,0.0010628909,0.00008082198,0.00008248481,0.0037373297],"genre_scores_gemma":[0.0004597786,0.000009740536,0.99726665,0.0003253563,0.00016702684,0.000100540004,0.000048838046,0.000028261149,0.0015938313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983425,0.000009628063,0.00031745178,0.0007487804,0.00031510525,0.0002665333],"domain_scores_gemma":[0.9984058,0.0005359724,0.00019552291,0.0005105972,0.00028645183,0.00006563188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020452031,0.0002941689,0.0003332027,0.0003663628,0.00020856503,0.00013367998,0.0006102233,0.00019168825,0.000016523907],"category_scores_gemma":[0.00008055609,0.00027269838,0.00010681069,0.00027231083,0.0003007849,0.00007931571,0.00018502389,0.0002624667,0.00000164753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000831116,0.00023090282,0.0000011897562,0.00022747168,0.000032769683,0.000002110278,0.0009403331,0.2949846,0.00009508294,0.13233809,0.0002525902,0.57088655],"study_design_scores_gemma":[0.00023589504,0.000035258632,0.0000058329542,0.000111666486,0.000032659802,0.000012148643,6.825184e-7,0.8283997,0.0002357898,0.17045738,0.00021552421,0.00025745042],"about_ca_topic_score_codex":0.0000045631955,"about_ca_topic_score_gemma":0.0000059902327,"teacher_disagreement_score":0.57062906,"about_ca_system_score_codex":0.00017101286,"about_ca_system_score_gemma":0.00017261908,"threshold_uncertainty_score":0.9999725},"labels":[],"label_agreement":null},{"id":"W4407306309","doi":"10.1007/s11004-024-10175-0","title":"Tracing Sedimentary Origins in Multivariate Geochronology via Constrained Tensor Factorization","year":2025,"lang":"en","type":"article","venue":"Mathematical Geosciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Geochronology; Tracing; Multivariate statistics; Geology; Sedimentary rock; Factorization; Hydrogeology; Paleontology; Statistics; Mathematics; Computer science; Algorithm","score_opus":0.032693303497775425,"score_gpt":0.340948537877476,"score_spread":0.30825523437970054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407306309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37186843,0.000012564386,0.615257,0.003398813,0.00018366546,0.0005587057,0.000017632952,0.00018387199,0.008519297],"genre_scores_gemma":[0.95163697,0.0000015429598,0.047340102,0.0003534726,0.000016441132,0.00007151909,0.000006160316,0.000006716448,0.00056705606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868006,0.00006338658,0.00046596708,0.00031224117,0.00018690203,0.00029146756],"domain_scores_gemma":[0.9989868,0.00058859645,0.00009411475,0.00022122484,0.000047280148,0.000062002255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033688187,0.00014505381,0.00027021518,0.00021277502,0.00015825947,0.000051129995,0.00024005922,0.00008693831,0.00044534542],"category_scores_gemma":[0.00026179707,0.00011821429,0.000053878855,0.00059295277,0.0002585096,0.00013435069,0.0000495614,0.00013987756,0.00006721275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064418286,0.00048328112,0.0006485582,0.00009697766,0.00001446329,0.0000042171505,0.0006224559,0.000019143323,0.007976555,0.98726267,0.00020666374,0.0026585576],"study_design_scores_gemma":[0.00053227454,0.00003030548,0.0035438295,0.00010805256,0.000026243513,0.000011778455,0.0004514882,0.025916442,0.0030217767,0.9655941,0.00058826077,0.00017545038],"about_ca_topic_score_codex":0.0000903545,"about_ca_topic_score_gemma":0.000031281397,"teacher_disagreement_score":0.57976854,"about_ca_system_score_codex":0.0000948822,"about_ca_system_score_gemma":0.000060993276,"threshold_uncertainty_score":0.487622},"labels":[],"label_agreement":null},{"id":"W4407831903","doi":"10.1109/icdm59182.2024.00045","title":"A Bayesian Hierarchical Model for Orthogonal Tucker Decomposition with Oblivious Tensor Compression","year":2024,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tucker decomposition; Decomposition; Tensor decomposition; Compression (physics); Tensor (intrinsic definition); Computer science; Bayesian probability; Mathematics; Artificial intelligence; Physics; Pure mathematics; Chemistry; Thermodynamics","score_opus":0.04204152547561275,"score_gpt":0.35816079560456976,"score_spread":0.316119270128957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407831903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04627182,0.0000233789,0.9462585,0.0032640602,0.00003455558,0.0006198396,0.00009097857,0.00054352306,0.0028933396],"genre_scores_gemma":[0.76033384,0.0000024877875,0.23661362,0.0002981807,0.00006963119,0.00027584404,0.00006937515,0.0000399705,0.0022970708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989676,0.00002317397,0.00025156167,0.00033552354,0.00020172581,0.00022044257],"domain_scores_gemma":[0.9992505,0.0002711052,0.000033926935,0.00023173363,0.00008591899,0.00012685501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009595135,0.00016426724,0.00017815916,0.00010969726,0.0001713812,0.00011541632,0.00011069229,0.00007943364,0.00016705332],"category_scores_gemma":[0.00000939492,0.0001145755,0.000111624504,0.00015135034,0.00005271553,0.00011177013,0.000026460097,0.00015914296,0.000041568375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001398152,0.0003616702,0.000031265074,0.0001801437,0.00007008094,0.000008817505,0.00033364477,0.0008423622,0.0067473967,0.96380323,0.023194218,0.004287341],"study_design_scores_gemma":[0.00035261785,0.000061327686,0.00006528909,0.000103506456,0.00005604083,0.000068903486,0.000019016536,0.7848875,0.0004387463,0.21231218,0.0014693154,0.00016554707],"about_ca_topic_score_codex":0.0000017410708,"about_ca_topic_score_gemma":0.000017240409,"teacher_disagreement_score":0.78404516,"about_ca_system_score_codex":0.000034181892,"about_ca_system_score_gemma":0.000052103907,"threshold_uncertainty_score":0.46722534},"labels":[],"label_agreement":null},{"id":"W4407895373","doi":"10.1016/j.jmva.2025.105427","title":"Markov switching multiple-equation tensor regressions","year":2025,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"NextGenerationEU; Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Università Ca' Foscari Venezia","keywords":"Mathematics; Markov chain; Tensor (intrinsic definition); Applied mathematics; Statistics; Econometrics; Pure mathematics","score_opus":0.043905920161001886,"score_gpt":0.36576551414396224,"score_spread":0.3218595939829604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407895373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29036278,0.00006317416,0.7046711,0.0031328849,0.00012092366,0.00013323962,0.000008492141,0.000040563937,0.0014668886],"genre_scores_gemma":[0.9094378,0.00002440213,0.08921855,0.00015883885,0.000071662245,0.000006203025,0.0000055004684,0.000009839149,0.0010672469],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837035,0.00016412229,0.00086998625,0.00015588659,0.00028832522,0.00015131097],"domain_scores_gemma":[0.99721396,0.0010805952,0.00080551306,0.0003218698,0.00048695537,0.00009111069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006886496,0.0001370618,0.00048553696,0.0008924979,0.00021648323,0.00006402253,0.00024523563,0.00008725781,0.00013561695],"category_scores_gemma":[0.0011166692,0.000103524646,0.0005571538,0.0013560167,0.000017374368,0.00016271221,0.000041420117,0.0002737946,0.000008814872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011319951,0.006223932,0.16467549,0.00032287513,0.040357187,0.0001542786,0.005409688,0.017136725,0.34893134,0.3050828,0.031653136,0.07892057],"study_design_scores_gemma":[0.006822045,0.00011827827,0.31644905,0.0007402496,0.02201997,0.00005196495,0.0020636683,0.47170565,0.009872095,0.15846244,0.010808406,0.00088619784],"about_ca_topic_score_codex":0.000034009852,"about_ca_topic_score_gemma":0.000029105704,"teacher_disagreement_score":0.619075,"about_ca_system_score_codex":0.000084612344,"about_ca_system_score_gemma":0.00005666213,"threshold_uncertainty_score":0.42216125},"labels":[],"label_agreement":null},{"id":"W4408432897","doi":"10.1017/9781009489188.011","title":"Achieving Organizational Alignment for Performance","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Business; Computer science; Process management","score_opus":0.03197273341712346,"score_gpt":0.2391876454481105,"score_spread":0.20721491203098705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408432897","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017686802,0.000014545583,0.017511377,0.00007585483,0.0000890585,0.0007075509,0.00056179636,0.00015678325,0.98070616],"genre_scores_gemma":[0.0007305955,0.000030109122,0.0042263125,0.000094395444,0.000085086474,0.0000044493463,0.00017105568,0.000033193875,0.9946248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992222,0.000009166198,0.00017404153,0.0002997014,0.00015091758,0.00014392794],"domain_scores_gemma":[0.9990403,0.00016412392,0.00016660096,0.0003472487,0.0002132029,0.00006850724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000054642307,0.00021289768,0.00024130152,0.000107474785,0.00028335646,0.0000261821,0.00029203904,0.00017998308,0.000012465381],"category_scores_gemma":[0.000012029107,0.00025915075,0.00013014872,0.000008177761,0.00006190735,0.000035897447,0.0001544793,0.00015414172,0.000008046729],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001783723,0.000012239466,0.000001500062,0.0001727665,0.000078227305,0.0000020305956,0.000013207858,0.0000010217196,0.00005368761,0.88793325,0.11141214,0.00030208786],"study_design_scores_gemma":[0.00043919656,0.000020686162,0.0000088355555,0.00019630571,0.00025273912,0.000004243759,0.000011193759,0.00014703636,0.0005139441,0.0004504537,0.9976789,0.00027649192],"about_ca_topic_score_codex":0.0000018424975,"about_ca_topic_score_gemma":2.2898621e-7,"teacher_disagreement_score":0.8874828,"about_ca_system_score_codex":0.00017542642,"about_ca_system_score_gemma":0.00008646522,"threshold_uncertainty_score":0.99998605},"labels":[],"label_agreement":null},{"id":"W4408503389","doi":"10.21468/scipostphys.18.3.096","title":"Generative learning of continuous data by tensor networks","year":2025,"lang":"en","type":"article","venue":"SciPost Physics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal; Perimeter Institute","funders":"Canadian Institute for Advanced Research","keywords":"Generative grammar; Computer science; Tensor (intrinsic definition); Artificial intelligence; Mathematics; Geometry","score_opus":0.04274866320332639,"score_gpt":0.34404443539146395,"score_spread":0.3012957721881376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408503389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07072933,0.0002913547,0.910775,0.0015366812,0.00018324798,0.0005438469,0.0003028427,0.00022599525,0.015411676],"genre_scores_gemma":[0.9742011,0.00003091435,0.018826123,0.0003459404,0.00015170182,0.000025756113,0.00048022962,0.000024640798,0.005913607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930036,0.000049399077,0.00021014837,0.00021347818,0.00009878629,0.000127808],"domain_scores_gemma":[0.99897844,0.00021071268,0.00012749727,0.000534918,0.00011964409,0.00002877099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011270672,0.00009391012,0.00019761069,0.000018165974,0.00012522421,0.000026776986,0.00031590153,0.00004218917,0.000023196477],"category_scores_gemma":[0.000058204947,0.00008925647,0.000038069928,0.00024695264,0.00007458239,0.00008042068,0.00015875255,0.00015699322,0.0000117366535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002040992,0.00049572834,0.00091540936,0.000059794493,0.00018752224,8.008972e-7,0.00032074927,0.0008776584,0.025531007,0.67338586,0.2823649,0.015840156],"study_design_scores_gemma":[0.0024871177,0.00018829449,0.0012803948,0.00036418583,0.00058512687,0.000004674904,0.0012348715,0.329341,0.06893877,0.4710957,0.12348957,0.0009903021],"about_ca_topic_score_codex":0.0000063624684,"about_ca_topic_score_gemma":0.0000017680015,"teacher_disagreement_score":0.90347177,"about_ca_system_score_codex":0.00001240939,"about_ca_system_score_gemma":0.000024666278,"threshold_uncertainty_score":0.36397734},"labels":[],"label_agreement":null},{"id":"W4408609844","doi":"10.1101/2025.03.17.643624","title":"randPedPCA: Rapid approximation of principal components from large pedigrees","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pedigree chart; Principal component analysis; Principal (computer security); Mathematics; Computer science; Artificial intelligence; Biology; Genetics","score_opus":0.03490179435241681,"score_gpt":0.27464142522781815,"score_spread":0.23973963087540134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408609844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95836854,0.0003915988,0.034770638,0.0002505769,0.0006415889,0.0014429035,0.0034566652,0.00055844366,0.000119052565],"genre_scores_gemma":[0.95752674,0.00010402515,0.041603874,0.00009100672,0.0002608091,0.00032341384,0.000007500847,0.00006391239,0.000018712613],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99723667,0.00017745874,0.00096140575,0.0007710357,0.0004736815,0.0003797417],"domain_scores_gemma":[0.9966279,0.00029738457,0.0008406634,0.0015257476,0.0005455236,0.00016277753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005064109,0.000483557,0.00083613675,0.00028625922,0.00016494779,0.00009207914,0.00067208277,0.0004995184,0.0001671482],"category_scores_gemma":[0.00021242828,0.0005231978,0.00026915953,0.00035957704,0.00008686246,0.00010339709,0.0005438582,0.0005915962,0.000042952102],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025582078,0.00401993,0.012377143,0.004289772,0.0014438684,0.000021423286,0.00023889764,0.00008519631,0.80755925,0.16408202,0.0056146,0.000012079452],"study_design_scores_gemma":[0.008943456,0.000106206775,0.28152278,0.0043623676,0.001953904,3.0391405e-8,0.0000418592,0.0106396945,0.66223025,0.00307997,0.023630483,0.0034889595],"about_ca_topic_score_codex":0.000042804728,"about_ca_topic_score_gemma":0.0000030430076,"teacher_disagreement_score":0.26914564,"about_ca_system_score_codex":0.00014020086,"about_ca_system_score_gemma":0.00024385119,"threshold_uncertainty_score":0.99972194},"labels":[],"label_agreement":null},{"id":"W4409534108","doi":"10.1016/j.jsc.2025.102449","title":"Linear preservers of secant varieties and other varieties of tensors","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Directorate for Mathematical and Physical Sciences; National Science Foundation","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.032607690337990575,"score_gpt":0.34204714740758524,"score_spread":0.30943945706959464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409534108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9148243,0.00013150509,0.082751065,0.00067091023,0.00006725353,0.00012282308,0.000009634579,0.000011103153,0.0014113843],"genre_scores_gemma":[0.98327535,0.000019627321,0.01644465,0.00005186415,0.000028681727,0.0000013823054,7.0796733e-7,0.000006529241,0.00017122185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991302,0.000049281814,0.00053349306,0.00005762404,0.00017155321,0.0000578492],"domain_scores_gemma":[0.99872404,0.0002868709,0.000501345,0.000081960665,0.0003780454,0.000027731709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024531127,0.00006779385,0.00025852502,0.00018280548,0.00003497449,0.000010716401,0.00008486341,0.000044272616,0.000019216179],"category_scores_gemma":[0.000086340435,0.000057550176,0.000072133655,0.00016806346,0.00006757871,0.000063152394,0.000025107554,0.000090018075,4.0570026e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002451709,0.00073440105,0.0077728825,0.001079662,0.00058156444,0.0000023844186,0.009858568,0.007117612,0.013063031,0.9476632,0.007608204,0.00427334],"study_design_scores_gemma":[0.0021004179,0.000329883,0.04137237,0.00046539056,0.00036306938,0.000058924215,0.0032822941,0.024435032,0.013457928,0.91107404,0.0028594965,0.00020116336],"about_ca_topic_score_codex":0.000018190185,"about_ca_topic_score_gemma":0.000002277497,"teacher_disagreement_score":0.06845102,"about_ca_system_score_codex":0.000013627384,"about_ca_system_score_gemma":0.000053976237,"threshold_uncertainty_score":0.23468281},"labels":[],"label_agreement":null},{"id":"W4409677710","doi":"10.1007/s10115-025-02381-x","title":"A Bayesian hierarchical model for orthogonal Tucker decomposition with oblivious tensor compression","year":2025,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tucker decomposition; Tensor decomposition; Decomposition; Compression (physics); Tensor (intrinsic definition); Bayesian probability; Mathematics; Computer science; Artificial intelligence; Algorithm; Pattern recognition (psychology); Pure mathematics; Chemistry; Physics","score_opus":0.022339431200952747,"score_gpt":0.32378291151621913,"score_spread":0.30144348031526635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409677710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026341474,0.000095425436,0.95416147,0.0004073281,0.000092335395,0.00110456,0.0000868695,0.00015652912,0.017553987],"genre_scores_gemma":[0.98977023,0.000010629544,0.007997139,0.00018321132,0.00004527226,0.0005013629,0.00013958229,0.000010093548,0.001342463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906915,0.000036794678,0.00047353326,0.00013609856,0.00012067453,0.00016372457],"domain_scores_gemma":[0.999095,0.00016421107,0.00014271503,0.00019169367,0.00032159087,0.00008479263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017944587,0.00014772416,0.00022977252,0.00021540927,0.00030310257,0.0001423012,0.00009018325,0.00009999698,0.0000043284654],"category_scores_gemma":[0.000021820488,0.00011346453,0.00005160233,0.00018622029,0.000045061694,0.00061504904,0.000031470292,0.000102420505,0.000019925188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017817535,0.00019027399,0.00024967958,0.00086336234,0.00006498961,1.9566343e-7,0.0019867462,0.0006843399,0.00028484597,0.963722,0.02507124,0.0067041456],"study_design_scores_gemma":[0.0013768254,0.000055569235,0.000440285,0.00032990024,0.00005118426,0.000026355308,0.00022383576,0.953728,0.00008766598,0.009869594,0.033627175,0.00018361578],"about_ca_topic_score_codex":0.000002157563,"about_ca_topic_score_gemma":0.000005205286,"teacher_disagreement_score":0.9634288,"about_ca_system_score_codex":0.00003977707,"about_ca_system_score_gemma":0.00006752692,"threshold_uncertainty_score":0.4626949},"labels":[],"label_agreement":null},{"id":"W4410224310","doi":"10.1016/j.amc.2025.129504","title":"Low-rank reduced biquaternion tensor ring decomposition and tensor completion","year":2025,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Tensor (intrinsic definition); Rank (graph theory); Ring (chemistry); Decomposition; Tensor product of Hilbert spaces; Symmetric tensor; Tensor contraction; Algebra over a field; Pure mathematics; Tensor product; Combinatorics; Mathematical analysis; Exact solutions in general relativity","score_opus":0.02707958797396616,"score_gpt":0.32131969428051205,"score_spread":0.2942401063065459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410224310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60033566,0.000022908556,0.39518476,0.0005665973,0.000040401777,0.00054909516,0.0000068131894,0.000171464,0.0031222776],"genre_scores_gemma":[0.85112226,0.00003173582,0.14837638,0.0001835219,0.000032637603,0.00011053309,0.000050100363,0.000023204118,0.000069651906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987946,0.000021462633,0.00048536874,0.00033963434,0.0001721506,0.00018679118],"domain_scores_gemma":[0.99905497,0.0003644407,0.00020552495,0.00019210517,0.00011027851,0.00007266677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023576553,0.00021487332,0.00031898322,0.00019253851,0.00032404318,0.00014416287,0.00007892842,0.000100058125,0.000010402681],"category_scores_gemma":[0.000024546176,0.00020934077,0.00004335306,0.00021487467,0.00007390446,0.0000755951,0.00006741411,0.00012645195,0.000016441816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003107001,0.00036334607,0.000041545656,0.0006846141,0.000057396872,0.0000010705279,0.00078433525,0.00008259511,0.0880612,0.88741684,0.0006065237,0.021869482],"study_design_scores_gemma":[0.0016231483,0.000053511005,0.0044081532,0.00036587397,0.00017558286,0.00004042544,0.0006619216,0.10078894,0.014621075,0.87660325,0.00023028738,0.00042783254],"about_ca_topic_score_codex":0.0000047984126,"about_ca_topic_score_gemma":0.0000028406173,"teacher_disagreement_score":0.25078654,"about_ca_system_score_codex":0.000040290095,"about_ca_system_score_gemma":0.000013509291,"threshold_uncertainty_score":0.85366684},"labels":[],"label_agreement":null},{"id":"W4410644684","doi":"10.1007/978-3-031-92383-8_14","title":"Markov Switching Tensor Regressions","year":2025,"lang":"en","type":"book-chapter","venue":"Contributions to statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor (intrinsic definition); Markov chain; Mathematics; Computer science; Statistics; Pure mathematics","score_opus":0.02698737649853611,"score_gpt":0.35420399611453224,"score_spread":0.32721661961599613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410644684","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019940005,0.00009520995,0.6778537,0.0029261613,0.0002594387,0.0008656088,0.034505215,0.00026312014,0.28322956],"genre_scores_gemma":[0.00040747557,0.00008094674,0.19158036,0.0007442891,0.0002338663,0.00015989332,0.0012189324,0.00007272868,0.8055015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980549,0.00003400799,0.000734745,0.000491257,0.0003183411,0.0003667173],"domain_scores_gemma":[0.99594146,0.0015291327,0.00030595035,0.0009151501,0.0010122077,0.0002961074],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001906822,0.0004161461,0.00060284254,0.00031842262,0.0006007003,0.00009907569,0.00035775022,0.00034858487,0.0012385703],"category_scores_gemma":[0.001581686,0.0004200747,0.00016470203,0.00010966227,0.00006425523,0.00003324316,0.00018980869,0.00061601494,0.00073035696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062276367,0.00002869391,8.635343e-7,0.00003123774,0.000058151763,0.000010913,0.0000157539,8.844167e-7,0.00003143652,0.5845867,0.41126984,0.0039592916],"study_design_scores_gemma":[0.00020995321,0.000018531224,0.000016932467,0.00034929844,0.00025213376,0.0000092036435,0.000005958669,0.00013482556,0.00001690012,0.5120377,0.48665392,0.00029463193],"about_ca_topic_score_codex":0.0000055429755,"about_ca_topic_score_gemma":0.000033666183,"teacher_disagreement_score":0.52227193,"about_ca_system_score_codex":0.00033827618,"about_ca_system_score_gemma":0.0002764394,"threshold_uncertainty_score":0.9998251},"labels":[],"label_agreement":null},{"id":"W4410737808","doi":"10.1007/978-981-96-2482-9_5","title":"Dynamic Tensor Least Angle Regression Using L1 Homotopy","year":2025,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Regression; Mathematics; Tensor (intrinsic definition); Homotopy; Statistics; Pure mathematics","score_opus":0.051644941845671984,"score_gpt":0.3145558481268599,"score_spread":0.2629109062811879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410737808","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06771669,0.015211145,0.099147715,0.013859967,0.0041887662,0.012084905,0.0024438526,0.019302575,0.7660444],"genre_scores_gemma":[0.1920426,0.00076781027,0.03554164,0.00012543112,0.00015150956,0.00037194305,0.00045732438,0.00020604147,0.7703357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983096,0.000012262409,0.0007823885,0.00046773732,0.00022312335,0.00020488836],"domain_scores_gemma":[0.9979396,0.00010359106,0.0006231843,0.00074096903,0.000576176,0.000016509572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001996785,0.0003802187,0.0005598483,0.00088312675,0.00035990227,0.000118933815,0.00025116894,0.00071601383,0.000018612818],"category_scores_gemma":[0.00013082135,0.00032042005,0.000067738416,0.0003987771,0.00021161146,0.00008997074,0.00018779228,0.00040820148,0.000014685566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004114924,0.000021142576,0.00008119782,0.00038292145,0.00006468558,0.0000038452263,0.000017124428,8.478249e-7,0.0006384372,0.98465556,0.010201037,0.003929071],"study_design_scores_gemma":[0.0004219428,0.000054262142,0.00008645883,0.0032022428,0.0001423879,0.00013541077,0.0007842995,0.0013298442,0.0002716976,0.7091611,0.28365594,0.0007544267],"about_ca_topic_score_codex":0.00001579158,"about_ca_topic_score_gemma":0.000009310496,"teacher_disagreement_score":0.2754945,"about_ca_system_score_codex":0.00012214873,"about_ca_system_score_gemma":0.000066499335,"threshold_uncertainty_score":0.9999248},"labels":[],"label_agreement":null},{"id":"W4411059592","doi":"10.1145/3712593","title":"Tensor-empowered Incomplete Multimodal Learning with Modality Reconstruction for Edge Intelligence","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Modality (human–computer interaction); Enhanced Data Rates for GSM Evolution; Artificial intelligence; Tensor (intrinsic definition); Computer vision; Human–computer interaction; Mathematics","score_opus":0.05041442200270725,"score_gpt":0.35246392138635757,"score_spread":0.30204949938365033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411059592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008866074,0.00007625338,0.9824345,0.0049876017,0.000054444576,0.0020376514,0.00010074949,0.00048171895,0.00096098956],"genre_scores_gemma":[0.56333137,0.00012086901,0.4349592,0.000112995316,0.000027757262,0.0011507893,0.00006377153,0.00002552692,0.0002076909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981999,0.000153003,0.0006410973,0.0005581901,0.00014640288,0.00030141746],"domain_scores_gemma":[0.99355364,0.003609912,0.00025864536,0.002021497,0.0004261702,0.00013013712],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00036493305,0.00029350372,0.00034684653,0.0003111177,0.002205597,0.00011508725,0.0008879142,0.00014375188,0.0000195448],"category_scores_gemma":[0.00012015784,0.00028983512,0.00012918317,0.00073756266,0.0004828447,0.00012506096,0.00007024662,0.0005836181,0.000014369505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087435394,0.0011135975,0.0005519021,0.00013640345,0.0002377853,1.3666285e-7,0.0007937414,0.0019632673,0.0013693246,0.09440032,0.000085219894,0.8992609],"study_design_scores_gemma":[0.003071618,0.00033637477,0.002830545,0.0005786361,0.0006238091,0.00007039145,0.004032446,0.716036,0.003147924,0.22923595,0.038739864,0.001296441],"about_ca_topic_score_codex":0.000048483766,"about_ca_topic_score_gemma":0.00006580838,"teacher_disagreement_score":0.8979644,"about_ca_system_score_codex":0.00009916782,"about_ca_system_score_gemma":0.000081911865,"threshold_uncertainty_score":0.99995536},"labels":[],"label_agreement":null},{"id":"W4411404946","doi":"10.1017/9781009180108.013","title":"Principal Component Analysis and Low-Rank Models","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Principal component analysis; Rank (graph theory); Component (thermodynamics); Mathematics; Statistics; Combinatorics; Physics","score_opus":0.03782565170106075,"score_gpt":0.2459316832808854,"score_spread":0.20810603157982466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411404946","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008972816,0.000039721795,0.02421405,0.00004182482,0.0000337297,0.00044351735,0.0006211245,0.00017490155,0.97353387],"genre_scores_gemma":[0.0057611424,0.000071591894,0.0015900428,0.00005817661,0.000028793464,0.0000020397033,0.0001092707,0.000022990407,0.99235594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998903,0.00002835083,0.00022946433,0.00046402554,0.0002017665,0.00017344218],"domain_scores_gemma":[0.99875134,0.00015125253,0.00019757522,0.000606587,0.00014503064,0.00014821794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006565432,0.00029532748,0.00053173397,0.0003779112,0.00020665927,0.00004281808,0.00029926945,0.00025255617,0.000008212313],"category_scores_gemma":[0.0000037810464,0.000349295,0.00030931624,0.000023418106,0.00015177327,0.000047777638,0.00031967022,0.00030194555,0.000004257509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025658095,0.000022556449,0.0000011167731,0.00012118054,0.00083901384,0.000030485695,0.000034872803,0.000014343328,0.000031137446,0.9889963,0.009648586,0.00023472187],"study_design_scores_gemma":[0.0016342412,0.000036108962,0.00010173827,0.00040171313,0.010424907,0.000016357359,0.000056607936,0.017126499,0.00034650357,0.0065914025,0.96191967,0.0013442347],"about_ca_topic_score_codex":0.00005374754,"about_ca_topic_score_gemma":0.0000060978564,"teacher_disagreement_score":0.98240495,"about_ca_system_score_codex":0.000113626156,"about_ca_system_score_gemma":0.00004623503,"threshold_uncertainty_score":0.99989593},"labels":[],"label_agreement":null},{"id":"W4412825786","doi":"10.1093/bib/bbaf372","title":"ConvNTC: convolutional neural tensor completion for detecting “A–A–B” type biological triplets","year":2025,"lang":"en","type":"article","venue":"Briefings in Bioinformatics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multilinear map; Tensor (intrinsic definition); Computer science; Convolutional neural network; Artificial intelligence; Tensor algebra; Context (archaeology); Nonlinear system; Theoretical computer science; Pattern recognition (psychology); Mathematics; Algebra over a field; Physics; Pure mathematics; Biology","score_opus":0.08588467673509687,"score_gpt":0.3492596114861307,"score_spread":0.26337493475103385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412825786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6031109,0.000097459146,0.3750706,0.009256922,0.0006422057,0.0027834973,0.00019854729,0.00064543844,0.008194443],"genre_scores_gemma":[0.7672177,0.00001621942,0.22735333,0.0046093664,0.00006643294,0.00017227385,0.00014641816,0.000017908163,0.00040035349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987786,0.000025149291,0.0006609783,0.00014770003,0.00011971319,0.00026788405],"domain_scores_gemma":[0.9985745,0.0007962163,0.00019412267,0.0001904769,0.00020121486,0.000043466116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027788,0.00014963996,0.00026871773,0.0001650373,0.00020743611,0.000055480632,0.00017322201,0.00013421677,0.000036779766],"category_scores_gemma":[0.0008472768,0.00013776195,0.000088573426,0.0003677692,0.000097982105,0.00010617322,0.0000559593,0.00016586526,0.000021650061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023764872,0.000365497,0.0031822377,0.0005179944,0.000070115915,0.0000016458971,0.00070325326,0.00009704923,0.0026689302,0.9288715,0.04892784,0.014356252],"study_design_scores_gemma":[0.0057744496,0.00028063124,0.018778926,0.00032464642,0.00008319289,0.00008647797,0.00095324527,0.58529204,0.0024642344,0.26972842,0.115384996,0.0008487395],"about_ca_topic_score_codex":0.000011719289,"about_ca_topic_score_gemma":0.000008046205,"teacher_disagreement_score":0.6591431,"about_ca_system_score_codex":0.00008522148,"about_ca_system_score_gemma":0.00004515874,"threshold_uncertainty_score":0.5617769},"labels":[],"label_agreement":null},{"id":"W4413121896","doi":"10.1109/ims40360.2025.11103850","title":"Towards Tensor-Train Solution of Vector Volume Integral Equation in 3D with $log N$ Complexity","year":2025,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tensor (intrinsic definition); Integral equation; Volume (thermodynamics); Computer science; Volume integral; Mathematics; Applied mathematics; Mathematical analysis; Physics; Pure mathematics","score_opus":0.08677643446391338,"score_gpt":0.3415007786016193,"score_spread":0.25472434413770595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413121896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3323772,0.000010557609,0.6296307,0.0040760916,0.00004041719,0.0005164277,0.000030490459,0.0001414039,0.033176765],"genre_scores_gemma":[0.9006914,0.0000010927224,0.09783299,0.000112676425,0.000009852413,0.000040894356,0.000025255658,0.0000062500585,0.0012796073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992585,0.00004803054,0.00029478868,0.00014985837,0.00012499093,0.000123784],"domain_scores_gemma":[0.99948627,0.00007644371,0.00008384256,0.00020663063,0.00012195056,0.000024860983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001745155,0.00009089363,0.00018780891,0.00013127987,0.000042877648,0.000012690146,0.00010111545,0.000056026653,0.00026383414],"category_scores_gemma":[0.00007023425,0.00007338954,0.000039255483,0.000338342,0.000096489326,0.000060790706,0.000023664174,0.00010363025,0.000015683918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004520069,0.00033884667,0.0034271858,0.000069328984,0.000021518248,4.827191e-7,0.0002649532,0.0000208412,0.0035226094,0.985539,0.0025926263,0.004157362],"study_design_scores_gemma":[0.0023033363,0.00019951421,0.3715303,0.00027199692,0.000085027204,0.000007334519,0.00091775577,0.117102064,0.005739492,0.49982,0.0016396386,0.0003835727],"about_ca_topic_score_codex":0.0002754408,"about_ca_topic_score_gemma":0.0006474506,"teacher_disagreement_score":0.5683142,"about_ca_system_score_codex":0.00008132468,"about_ca_system_score_gemma":0.0000555144,"threshold_uncertainty_score":0.29927388},"labels":[],"label_agreement":null},{"id":"W4414350851","doi":"10.1139/facets-2025-0011","title":"Blossoming instantiations in FRAM: a temporal tensor framework for socio-technical systems","year":2025,"lang":"en","type":"article","venue":"FACETS","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sociotechnical system; Ambiguity; Encoding (memory); Dimension (graph theory); Scheme (mathematics)","score_opus":0.056682032350682886,"score_gpt":0.38526309058003205,"score_spread":0.3285810582293492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414350851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30157682,0.0001436734,0.6850322,0.0070681265,0.00028187415,0.0019724453,0.00016164234,0.00041723062,0.0033460069],"genre_scores_gemma":[0.8991837,0.0000039457796,0.09920411,0.00021455159,0.00004474472,0.0005543134,0.000020683989,0.000015688784,0.00075825397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990562,0.000034228964,0.00038241185,0.00021750049,0.00010418213,0.00020547678],"domain_scores_gemma":[0.99886125,0.0006238574,0.00009669816,0.0003007733,0.00007709008,0.000040339895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019190954,0.00011223647,0.00023540967,0.00013341599,0.00016344465,0.000060938753,0.00016505808,0.00020416298,0.00002181393],"category_scores_gemma":[0.0003734721,0.00011152778,0.00008645082,0.00031384034,0.000035251804,0.000052508865,0.000037844562,0.00021902085,0.00002551825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009072616,0.0001945969,0.0028371443,0.0000936431,0.000018295337,6.007111e-7,0.00016404853,0.000025322446,0.00093322166,0.9857279,0.009872157,0.00012401585],"study_design_scores_gemma":[0.0012453009,0.000034882763,0.009185473,0.0005806558,0.0000671805,0.0000065716713,0.0009429722,0.0042191036,0.0005243287,0.948247,0.03461041,0.00033612526],"about_ca_topic_score_codex":0.000013764545,"about_ca_topic_score_gemma":0.00002356539,"teacher_disagreement_score":0.5976069,"about_ca_system_score_codex":0.000096647105,"about_ca_system_score_gemma":0.00005562313,"threshold_uncertainty_score":0.4547971},"labels":[],"label_agreement":null},{"id":"W4415724501","doi":"10.1002/sta4.70116","title":"Tensor Train Recurrent Network Language Model Prediction","year":2025,"lang":"en","type":"article","venue":"Stat","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Tensor (intrinsic definition); Convolutional neural network; Recurrent neural network; Matrix product state; Computation; Data compression; Reduction (mathematics); Artificial neural network","score_opus":0.034987884450652,"score_gpt":0.34953639972592204,"score_spread":0.31454851527527006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415724501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17235391,0.00029281125,0.7455716,0.0040540914,0.0004071489,0.00086290913,0.00044336665,0.0007666084,0.075247556],"genre_scores_gemma":[0.87301826,0.00004540143,0.1021252,0.0010338008,0.00023976057,0.00022613033,0.00013580601,0.000029864437,0.023145748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995077,0.000020360436,0.00014990728,0.00012351654,0.00007359346,0.00012491301],"domain_scores_gemma":[0.99964595,0.0000674175,0.000032860353,0.00019224231,0.00002981253,0.00003169404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008776641,0.000064830776,0.00008602879,0.00003181961,0.000085493775,0.000016885864,0.00006750449,0.00003419879,0.000063846026],"category_scores_gemma":[0.00002434806,0.000059475515,0.000042949145,0.0001336278,0.000017020146,0.000028131359,0.000016851789,0.00008281906,0.000026348795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002365911,0.00017333376,0.000104154155,0.00005547329,0.00003607119,0.0000013786367,0.0010713056,0.0015219375,0.0011605595,0.5629283,0.41535315,0.017570669],"study_design_scores_gemma":[0.00067453325,0.00003235879,0.00085849804,0.00010464534,0.000079124606,0.000003053487,0.0005751291,0.2260148,0.0004459043,0.7489743,0.022063876,0.0001737491],"about_ca_topic_score_codex":0.0000017141729,"about_ca_topic_score_gemma":0.000011107874,"teacher_disagreement_score":0.7006644,"about_ca_system_score_codex":0.000030833766,"about_ca_system_score_gemma":0.000019103145,"threshold_uncertainty_score":0.24253412},"labels":[],"label_agreement":null},{"id":"W4416078682","doi":"10.1145/3746252.3761083","title":"Oblivious Johnson--Lindenstrauss embeddings for compressed Tucker decompositions","year":2025,"lang":"","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Intersection (aeronautics); Field (mathematics); Algebra over a field; Upper and lower bounds","score_opus":0.0340284891429637,"score_gpt":0.36619074126531315,"score_spread":0.33216225212234946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416078682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019545548,0.00043169,0.8447722,0.014613669,0.000971928,0.0043023066,0.0008331522,0.00069997495,0.113829486],"genre_scores_gemma":[0.7898095,0.00016606855,0.16239178,0.003348858,0.00025046855,0.0011976229,0.00022708779,0.000103974715,0.042504646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647397,0.000096326454,0.0013858532,0.00090439623,0.0003240856,0.0008153855],"domain_scores_gemma":[0.9956658,0.0018473316,0.00035264026,0.0010975958,0.00073632254,0.0003003311],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032570216,0.000603416,0.00082300935,0.00048442036,0.0012111439,0.0005084615,0.0006947895,0.00043101385,0.002086117],"category_scores_gemma":[0.0001191674,0.0006413293,0.0006735756,0.0008535948,0.00026644501,0.00021532935,0.0001868368,0.00043194985,0.0004349801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008982175,0.0017858931,0.000045445722,0.00046231668,0.00042722392,0.0000024705014,0.00026487064,0.00010098995,0.00648726,0.722479,0.26562756,0.0022271408],"study_design_scores_gemma":[0.007633255,0.00024879802,0.0011339752,0.0011221347,0.0020079575,0.000060387963,0.0010554176,0.09578669,0.03289349,0.5886907,0.2676491,0.0017181162],"about_ca_topic_score_codex":0.000027501806,"about_ca_topic_score_gemma":0.00005159631,"teacher_disagreement_score":0.77026397,"about_ca_system_score_codex":0.00019313757,"about_ca_system_score_gemma":0.00023672754,"threshold_uncertainty_score":0.9996038},"labels":[],"label_agreement":null},{"id":"W4416247092","doi":"10.48550/arxiv.2510.19516","title":"Probabilistic PCA on tensors","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Identifiability; Multilinear map; Probabilistic logic; Principal component analysis; Estimator; Tensor (intrinsic definition); Kronecker delta; Gaussian; Sparse PCA; Expectation–maximization algorithm","score_opus":0.09097254457846796,"score_gpt":0.341070032919232,"score_spread":0.25009748834076406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416247092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108102,0.000101328864,0.0018847447,0.00776035,0.0010207868,0.0034577677,0.0005250945,0.00060345227,0.073836304],"genre_scores_gemma":[0.9428364,0.00021852463,0.0037545627,0.0018054298,0.00047961317,0.001137601,0.00018243499,0.00010205896,0.049483355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954531,0.0002573092,0.001466633,0.0015918682,0.00052665744,0.000704427],"domain_scores_gemma":[0.994331,0.0012071425,0.0007146448,0.0029199664,0.0005051516,0.00032209966],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00040448195,0.0009153086,0.0010830538,0.00032841606,0.00054402347,0.0001462947,0.0011352987,0.000764342,0.0027782947],"category_scores_gemma":[0.00078024436,0.0009217955,0.000658518,0.0005280066,0.00029330386,0.00006513719,0.00074945687,0.001726924,0.009103439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003716405,0.010190079,0.034254085,0.007004026,0.0015808013,0.00007931516,0.003623976,0.0054684742,0.0017439808,0.8679362,0.061285395,0.006462025],"study_design_scores_gemma":[0.004346438,0.00073613925,0.20278032,0.009017397,0.0033979884,0.00006905251,0.0011391646,0.011002094,0.0069484524,0.5038191,0.25097197,0.005771887],"about_ca_topic_score_codex":0.000030756477,"about_ca_topic_score_gemma":0.000016175096,"teacher_disagreement_score":0.36411712,"about_ca_system_score_codex":0.0003847779,"about_ca_system_score_gemma":0.00035248627,"threshold_uncertainty_score":0.99932325},"labels":[],"label_agreement":null},{"id":"W4416678022","doi":"10.1016/j.neucom.2025.132074","title":"Deep tensor decomposition: A survey","year":2025,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Deep learning; Multilinear map; Tensor (intrinsic definition); Matrix decomposition; Nonlinear system; Deep neural networks; Curse of dimensionality; Artificial neural network","score_opus":0.045539079690275534,"score_gpt":0.3663864689848994,"score_spread":0.32084738929462386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416678022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5865764,0.000037312526,0.3832477,0.0014912742,0.0003094354,0.0005037425,0.000007671251,0.0007072845,0.027119178],"genre_scores_gemma":[0.97404176,0.0000015909884,0.023959095,0.0013660731,0.00007157524,0.000021227403,0.000013657366,0.000017989894,0.00050701573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998984,0.00012850201,0.00030244075,0.00027152707,0.000110631714,0.00020294101],"domain_scores_gemma":[0.998546,0.000904432,0.00008436444,0.00029543374,0.000117737,0.000052048195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022295635,0.00012328412,0.00017224507,0.000105765816,0.00027796725,0.000067538465,0.00019994781,0.000048285834,0.00004825822],"category_scores_gemma":[0.00014123088,0.000126246,0.00007173084,0.0004246321,0.000027319946,0.000038943723,0.00008577963,0.00014977316,0.00007171426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007305004,0.0010392754,0.03869344,0.00023811625,0.00013627239,0.000032939308,0.000424023,0.00076039106,0.009008883,0.84843576,0.059372846,0.041785024],"study_design_scores_gemma":[0.002377329,0.000089556095,0.6117938,0.0002594102,0.00012610405,0.00012403737,0.00012419753,0.14369951,0.0052089603,0.20936029,0.025917144,0.0009196879],"about_ca_topic_score_codex":0.000010068965,"about_ca_topic_score_gemma":0.000016903055,"teacher_disagreement_score":0.63907546,"about_ca_system_score_codex":0.000025076934,"about_ca_system_score_gemma":0.00001957357,"threshold_uncertainty_score":0.5148162},"labels":[],"label_agreement":null},{"id":"W4416894713","doi":"10.1007/s10915-025-03140-4","title":"Reduced biquaternion tensors and applications in color video processing","year":2025,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Singular value decomposition; Compression (physics); Inverse; Tensor decomposition; Tensor product; Quaternion; Data compression","score_opus":0.03259310032987307,"score_gpt":0.34666795804203515,"score_spread":0.3140748577121621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416894713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96032006,0.00008766329,0.038024213,0.0007634807,0.000102458456,0.00017388612,9.558821e-7,0.000019988564,0.00050731807],"genre_scores_gemma":[0.9843899,0.0000018558013,0.015221086,0.000031908192,0.000042781467,0.0000030713645,8.7059146e-7,0.0000046335667,0.0003038987],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906945,0.000033590808,0.00048858137,0.00014791549,0.00014526519,0.00011518236],"domain_scores_gemma":[0.999092,0.00020660517,0.00031546978,0.000111368696,0.00022990342,0.000044656088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083731936,0.00006592026,0.00015778089,0.00037592137,0.00027545943,0.00019230536,0.00014660406,0.000030829528,0.0000040191517],"category_scores_gemma":[0.00009345233,0.00005639616,0.000038147376,0.0006797685,0.00008320218,0.000096042735,0.000049088143,0.00014685474,0.0000015297469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008284603,0.0017209977,0.02702741,0.0011291275,0.000076050914,0.000018200579,0.007589809,0.0014626205,0.4785045,0.15482599,0.010882409,0.31668004],"study_design_scores_gemma":[0.0058060777,0.0001787493,0.1721586,0.0054001105,0.00035474938,0.00048200856,0.0117871445,0.17178683,0.07016432,0.51849,0.042209834,0.0011815319],"about_ca_topic_score_codex":0.0000014883668,"about_ca_topic_score_gemma":0.000003333219,"teacher_disagreement_score":0.4083402,"about_ca_system_score_codex":0.00004967708,"about_ca_system_score_gemma":0.000069919384,"threshold_uncertainty_score":0.22997685},"labels":[],"label_agreement":null},{"id":"W4417229947","doi":"10.1109/iccv51701.2025.00026","title":"Generalized Tensor-Based Parameter-Efficient Fine-Tuning via Lie Group Transformations","year":2025,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Lie group; Generalization; Range (aeronautics); Algebra over a field; Group (periodic table); Core (optical fiber)","score_opus":0.03789521035149982,"score_gpt":0.316367237721002,"score_spread":0.27847202736950216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417229947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15304461,0.000016795513,0.82775325,0.0034465066,0.00006378532,0.0004448029,0.000019854286,0.00038131626,0.014829108],"genre_scores_gemma":[0.82713664,0.0000020324298,0.16955003,0.0012671826,0.000018628445,0.00022045724,0.000058680787,0.000015623646,0.00173072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900585,0.00004918698,0.00039980968,0.0001941271,0.00014508629,0.00020595832],"domain_scores_gemma":[0.99903226,0.00038539313,0.000063028194,0.00036796762,0.000082338134,0.00006901244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013603027,0.00014580596,0.00019486777,0.0001750417,0.00024992973,0.000058310245,0.00016405746,0.00006965488,0.0004951144],"category_scores_gemma":[0.00004528933,0.00012697518,0.00014406063,0.00039490825,0.000041459032,0.000042956344,0.000014910539,0.00011559501,0.00008724682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001672893,0.00060478237,0.000054268545,0.00006899786,0.000045000015,0.0000010881183,0.00014353108,0.0013462252,0.012319927,0.9706151,0.010910595,0.0038737885],"study_design_scores_gemma":[0.0035968386,0.00007115654,0.0008505884,0.0001241694,0.00024192556,0.000009036988,0.00020317243,0.71453524,0.021975297,0.22015929,0.037589744,0.00064353977],"about_ca_topic_score_codex":0.000013858047,"about_ca_topic_score_gemma":0.000021657033,"teacher_disagreement_score":0.7504558,"about_ca_system_score_codex":0.00004436114,"about_ca_system_score_gemma":0.000028109449,"threshold_uncertainty_score":0.54211557},"labels":[],"label_agreement":null},{"id":"W4417303627","doi":"10.1093/jrsssa/qnaf180","title":"Tensor time series change-point detection in cryptocurrency network data","year":2025,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series A (Statistics in Society)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cryptocurrency; Asset (computer security); Identification (biology); Time series; Tensor (intrinsic definition); Investment (military); Series (stratigraphy)","score_opus":0.03837087813339109,"score_gpt":0.3270443071994469,"score_spread":0.2886734290660558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417303627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049601877,0.00054573175,0.98096806,0.008133253,0.0012029957,0.0011544705,0.0021577892,0.00007266842,0.00080486416],"genre_scores_gemma":[0.051794853,0.0006622528,0.9426945,0.0014834782,0.000725986,0.00009560572,0.00008934813,0.00007002448,0.0023839385],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974102,0.00021848409,0.0011519457,0.000309889,0.00045504136,0.0004544645],"domain_scores_gemma":[0.9971984,0.0013387059,0.00052643835,0.00056829496,0.0002664436,0.00010170302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010690842,0.00026721891,0.0005664233,0.000033333938,0.00032861228,0.000118752876,0.0007953667,0.00019669256,0.0001848975],"category_scores_gemma":[0.00083995116,0.00021067291,0.00023606764,0.0007335158,0.0004063764,0.0002764405,0.0004214659,0.0009294458,0.0000083558025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021879282,0.00068828056,0.002473928,0.0004947061,0.0003349828,0.0000235864,0.0023483904,0.00048315467,0.00010164199,0.411457,0.5674678,0.013907712],"study_design_scores_gemma":[0.0014132108,0.00016749278,0.025041468,0.00048282408,0.0002607144,0.000036362846,0.0017746711,0.03922793,0.00005608156,0.9054573,0.025660198,0.00042171925],"about_ca_topic_score_codex":0.000039549643,"about_ca_topic_score_gemma":0.00023593692,"teacher_disagreement_score":0.5418076,"about_ca_system_score_codex":0.00034076552,"about_ca_system_score_gemma":0.00015777345,"threshold_uncertainty_score":0.85909915},"labels":[],"label_agreement":null},{"id":"W50112468","doi":"10.1016/b978-012763560-6/50033-7","title":"Review of Chemometrics Applied to SpectroscopyMultiway Analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kimberly-Clark (Canada)","funders":"","keywords":"Chemometrics; Table (database); Sample (material); Computer science; Exploratory analysis; Matrix (chemical analysis); Mathematics; Algorithm; Data mining; Chemistry; Data science; Machine learning; Chromatography","score_opus":0.039577036984552415,"score_gpt":0.3257568773955276,"score_spread":0.2861798404109752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50112468","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008096741,0.003479217,0.0008013843,0.00020431682,0.000035626785,0.0012434858,0.00011743726,0.00009562547,0.9940148],"genre_scores_gemma":[0.000121318495,0.0052525834,0.017815908,0.001819819,0.00013261687,0.0001377547,0.00009174468,0.00009820682,0.97453004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788225,0.000013687845,0.0009485553,0.00048261473,0.00043906813,0.00023379788],"domain_scores_gemma":[0.9975612,0.00018839972,0.0006204823,0.0011930839,0.00024608333,0.00019076238],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031715276,0.0003980693,0.0013627618,0.00082346593,0.000059356502,0.000017850161,0.00041579048,0.00021060146,0.0015926798],"category_scores_gemma":[0.00006113311,0.00038119726,0.00066247466,0.00036713458,0.000058578007,0.000010404708,0.00010721606,0.0003040986,0.00033572232],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001101905,0.00007899138,0.0000018260218,0.005449653,0.0013527402,0.000006715283,0.000106446896,8.051962e-7,0.0002770583,0.25231412,0.009045949,0.73135465],"study_design_scores_gemma":[0.000121209865,0.000020730333,0.0000037897942,0.0022856952,0.0022443717,0.0000051372194,0.0000029923447,0.0000013525507,0.00039337974,0.041454352,0.9530881,0.00037891162],"about_ca_topic_score_codex":2.2756804e-7,"about_ca_topic_score_gemma":0.00000552441,"teacher_disagreement_score":0.94404215,"about_ca_system_score_codex":0.00010747558,"about_ca_system_score_gemma":0.000044744243,"threshold_uncertainty_score":0.999864},"labels":[],"label_agreement":null},{"id":"W6893652806","doi":"10.5281/zenodo.4259498","title":"Ver!]linea.The Christmas Yule Blog (2020) completa Pelicula En Español Castellano ktq","year":2020,"lang":"es","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Entertainment; Illusion; Fandom; Entertainment industry; Movie theater","score_opus":0.05585241675540491,"score_gpt":0.2840178163549411,"score_spread":0.2281653995995362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893652806","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17322946,0.0015238862,0.039160002,0.19748342,0.00066007633,0.007886392,0.007651055,0.007072873,0.56533283],"genre_scores_gemma":[0.9875112,0.00039334522,0.0013928969,0.0021253645,0.0011714513,3.2628918e-7,0.0028196445,0.0025233529,0.0020624034],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99674374,0.00077664526,0.0006188595,0.0006930849,0.0006254461,0.0005422144],"domain_scores_gemma":[0.99749357,0.00018962732,0.00029054296,0.0009409762,0.00064856804,0.00043672224],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005812898,0.00033835068,0.00036877167,0.00010294502,0.0029378117,0.0015257212,0.0018790519,0.00014468154,0.029422587],"category_scores_gemma":[0.00067393034,0.0003124739,0.0001814876,0.0008716774,0.00031586303,0.00013721445,0.0016264451,0.0006874299,0.052335374],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011133824,0.00047687007,0.0000092052205,0.00041536914,0.00021848816,0.000059526177,0.005041802,0.00012185107,0.0093362555,0.08542929,0.8861246,0.012655424],"study_design_scores_gemma":[0.0007985795,0.00022646115,0.00033185934,0.000054981912,0.000098813354,0.00025421925,0.0010664972,0.005568129,0.0005979772,0.00057647086,0.9900767,0.00034929463],"about_ca_topic_score_codex":0.000014060637,"about_ca_topic_score_gemma":3.638091e-7,"teacher_disagreement_score":0.81428176,"about_ca_system_score_codex":0.00014216841,"about_ca_system_score_gemma":0.000010692694,"threshold_uncertainty_score":0.9999327},"labels":[],"label_agreement":null},{"id":"W6901662748","doi":"10.60692/9y50s-36c35","title":"Latent Space Model for Higher-order Networks and Generalized Tensor Decomposition","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multilinear map; Convergence (economics); Gradient descent; Smoothness; Kernel (algebra); Space (punctuation); Tensor (intrinsic definition); Estimation theory; Position (finance)","score_opus":0.08092565154312945,"score_gpt":0.2920905471584668,"score_spread":0.21116489561533733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901662748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3110727,0.0000019558813,0.68582994,0.0006384013,0.0001572774,0.0009142559,0.0001574354,0.0007489723,0.00047903747],"genre_scores_gemma":[0.98022074,7.154461e-7,0.017675534,0.00020911734,0.000081134545,0.0005006676,0.00013625843,0.000022028684,0.0011538181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989326,0.000028601231,0.0004894766,0.00015223907,0.00015719832,0.0002399063],"domain_scores_gemma":[0.9991607,0.000029910172,0.00022650883,0.00026366682,0.00022354694,0.00009568306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023178638,0.00016557843,0.00022440247,0.00017946698,0.0002448297,0.00015150473,0.000088224,0.000116044364,0.000009569886],"category_scores_gemma":[0.0000090507,0.00014305898,0.0000732104,0.00026299464,0.000020921825,0.00028642247,0.00003980786,0.000060428258,0.00015723814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051897817,0.000037423208,0.010835671,0.002800961,0.0004416987,0.0000060253356,0.06164335,0.24007452,0.00012967233,0.62848824,0.053908654,0.0011148308],"study_design_scores_gemma":[0.0012829803,0.000016216238,0.0036635203,0.000059028866,0.000051341733,0.000013470259,0.00057005574,0.9930948,0.000057054713,0.0005758261,0.00041471902,0.0002009809],"about_ca_topic_score_codex":0.0000013232491,"about_ca_topic_score_gemma":1.48459e-7,"teacher_disagreement_score":0.7530203,"about_ca_system_score_codex":0.000054086246,"about_ca_system_score_gemma":0.000011066721,"threshold_uncertainty_score":0.58337754},"labels":[],"label_agreement":null},{"id":"W6930631928","doi":"10.5281/zenodo.14930623","title":"ThrombUS+ D6.1: Product Design Specifications","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"European Commission","keywords":"Deliverable; Process (computing); Software; Systems design; System requirements; Bridging (networking); Product design specification; Functional requirement; System integration","score_opus":0.16061277608706934,"score_gpt":0.32191101234719377,"score_spread":0.16129823626012443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930631928","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002408566,0.000071522234,0.36643502,0.008180925,0.00008917567,0.0012931493,0.00012862794,0.0020848943,0.6193081],"genre_scores_gemma":[0.92731637,0.00016500795,0.043821543,0.00055515475,0.00031676466,8.186209e-7,0.0013793056,0.0019503612,0.024494693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866056,0.00025155675,0.00027299146,0.00037418108,0.00020389458,0.00023683817],"domain_scores_gemma":[0.9985254,0.000079757294,0.00008669768,0.00070764543,0.0005118834,0.000088645844],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005067317,0.000118676384,0.0001323164,0.00021895976,0.0021054046,0.00044241862,0.0007624784,0.00004052996,0.007018906],"category_scores_gemma":[0.00061800866,0.00012457633,0.000051325893,0.0007923424,0.00012869682,0.00013403068,0.00035261715,0.00019105998,0.005617329],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012402692,0.00020903796,8.4809e-7,0.000028530896,0.000029385414,9.659191e-7,0.00026034797,0.000015487542,0.007163082,0.3425995,0.63430816,0.015372247],"study_design_scores_gemma":[0.0002872782,0.000033621043,0.00055639737,0.000027062584,0.00002581091,0.000026917342,0.00021917824,0.00029106878,0.0033376894,0.04172658,0.95333105,0.00013735544],"about_ca_topic_score_codex":0.0000023204545,"about_ca_topic_score_gemma":7.3621116e-8,"teacher_disagreement_score":0.9249078,"about_ca_system_score_codex":0.000110470195,"about_ca_system_score_gemma":0.0000056125828,"threshold_uncertainty_score":0.9991937},"labels":[],"label_agreement":null},{"id":"W6930810905","doi":"10.5281/zenodo.15004090","title":"The Role of Artificial Intelligence (AI) and machine learning in social work practice","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Social work; Software deployment; Big data; Predictive analytics; Applications of artificial intelligence; Equity (law); Analytics","score_opus":0.06323048399475065,"score_gpt":0.3260768415748816,"score_spread":0.262846357580131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930810905","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1360146,0.006300175,0.21586251,0.115377456,0.00044837254,0.004104966,0.000475562,0.0060809418,0.51533544],"genre_scores_gemma":[0.99850017,0.00008826393,0.0006583013,0.00003797668,0.00006797526,8.4500776e-8,0.000063278596,0.00028848808,0.00029543438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912685,0.00022675605,0.00020647868,0.00015480397,0.00015635003,0.00012873266],"domain_scores_gemma":[0.9994366,0.00020370106,0.000054656317,0.00011205643,0.0001586997,0.000034262575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006796083,0.000058153604,0.000069500384,0.00008713261,0.0012751097,0.0004299565,0.00023110809,0.00002983812,0.0007941287],"category_scores_gemma":[0.0007363291,0.00005045238,0.000022207361,0.00057594315,0.00011271031,0.00011347614,0.0002498679,0.0002890635,0.00048343444],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036850943,0.0000634187,0.0000016567149,0.000023936727,0.000014634898,0.000002325714,0.0019570305,0.00001050471,0.0011913525,0.58210194,0.004445214,0.41015112],"study_design_scores_gemma":[0.000034584573,0.00003779693,0.00005415088,0.000025091975,0.000011407769,0.00002775277,0.0011829397,0.0038858545,0.0005041928,0.057943538,0.9362286,0.00006410698],"about_ca_topic_score_codex":0.000004558213,"about_ca_topic_score_gemma":5.365707e-7,"teacher_disagreement_score":0.9317834,"about_ca_system_score_codex":0.00003390977,"about_ca_system_score_gemma":0.0000022667423,"threshold_uncertainty_score":0.9807242},"labels":[],"label_agreement":null},{"id":"W6931190166","doi":"10.5281/zenodo.4374396","title":"Gillenia trifoliata Moench 1794","year":2007,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Taxon; Lauraceae; Bark (sound); Genus; Vitis vinifera","score_opus":0.07399852000351889,"score_gpt":0.3152555322707648,"score_spread":0.2412570122672459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931190166","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09463625,0.00007272405,0.12494627,0.0028882036,0.00016495872,0.0011154904,0.0003531533,0.0034322015,0.7723907],"genre_scores_gemma":[0.985274,0.000039003102,0.00748954,0.00033347597,0.00026694773,6.800559e-8,0.0007349928,0.0015254656,0.0043364996],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986182,0.000106780004,0.00030766276,0.00030822828,0.0003137141,0.00034541497],"domain_scores_gemma":[0.99871546,0.00007113168,0.000105520754,0.0005292216,0.0003823962,0.0001962843],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008270466,0.000121523924,0.00013205038,0.00019231295,0.0015972499,0.00030379664,0.0007118533,0.0000651048,0.011761202],"category_scores_gemma":[0.00044370617,0.00012657479,0.00006148323,0.00050093204,0.00009398632,0.00013665073,0.00041045362,0.00021952021,0.008697292],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005636052,0.00032776254,0.000003907473,0.000051112827,0.000042685082,0.000014750511,0.00080105884,0.0000040098726,0.010285758,0.3316491,0.59309334,0.06367016],"study_design_scores_gemma":[0.00045122352,0.00006691963,0.00049286697,0.000013571156,0.0000150493615,0.00010634274,0.00020924014,0.000085120075,0.0015605693,0.010710393,0.986131,0.00015770122],"about_ca_topic_score_codex":0.0000054824995,"about_ca_topic_score_gemma":4.255144e-7,"teacher_disagreement_score":0.89063776,"about_ca_system_score_codex":0.00009973422,"about_ca_system_score_gemma":0.0000018911225,"threshold_uncertainty_score":0.9997025},"labels":[],"label_agreement":null},{"id":"W6932013645","doi":"10.5683/sp3/h1fmza","title":"Navigating challenges in applied animal behaviour and welfare research: A focus group study","year":2024,"lang":"en","type":"dataset","venue":"Borealis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Focus group; Animal welfare; Thematic analysis; Prejudice (legal term); Welfare; Ethology","score_opus":0.17675256655781238,"score_gpt":0.42686968442336815,"score_spread":0.2501171178655558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6932013645","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026260894,0.0005446054,5.160331e-7,0.002120727,0.000022319322,0.001300395,0.9926371,0.00010351341,0.0006447436],"genre_scores_gemma":[0.04751869,0.00042377028,0.0004176662,0.000013872551,0.00017635484,0.0013333472,0.950049,0.00006220379,0.0000051438424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979563,0.000164672,0.00043208746,0.00063038536,0.00048656223,0.00032999137],"domain_scores_gemma":[0.9987332,0.00027659195,0.0001006677,0.0007220091,0.000057324236,0.00011020657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009092809,0.00026613084,0.00040124226,0.00016629393,0.00018393842,0.00014346294,0.00033569496,0.00023732249,0.000044981174],"category_scores_gemma":[0.000065672895,0.00025082554,0.000049776583,0.00025754655,0.000078573845,0.00003070977,0.00033429082,0.0013419156,0.000041745232],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016200114,0.00066027534,0.000020422383,0.00027292466,0.000032067826,0.0001065316,0.0009296852,1.854341e-8,0.0000033989322,0.015978001,0.97984105,0.002139396],"study_design_scores_gemma":[0.00070019846,0.00031257377,0.0032993841,0.00045221244,0.00018471095,0.000028850774,0.015127391,0.000006061435,0.0000048467796,0.030688858,0.9487028,0.000492105],"about_ca_topic_score_codex":0.006031005,"about_ca_topic_score_gemma":0.042088006,"teacher_disagreement_score":0.044892598,"about_ca_system_score_codex":0.00007887457,"about_ca_system_score_gemma":0.00001879008,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W6957967604","doi":"10.60692/a08zx-tj103","title":"Latent Space Model for Higher-order Networks and Generalized Tensor Decomposition","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multilinear map; Convergence (economics); Gradient descent; Smoothness; Kernel (algebra); Space (punctuation); Tensor (intrinsic definition); Estimation theory; Position (finance)","score_opus":0.08092565154312945,"score_gpt":0.2920905471584668,"score_spread":0.21116489561533733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957967604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3110727,0.0000019558813,0.68582994,0.0006384013,0.0001572774,0.0009142559,0.0001574354,0.0007489723,0.00047903747],"genre_scores_gemma":[0.98022074,7.154461e-7,0.017675534,0.00020911734,0.000081134545,0.0005006676,0.00013625843,0.000022028684,0.0011538181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989326,0.000028601231,0.0004894766,0.00015223907,0.00015719832,0.0002399063],"domain_scores_gemma":[0.9991607,0.000029910172,0.00022650883,0.00026366682,0.00022354694,0.00009568306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023178638,0.00016557843,0.00022440247,0.00017946698,0.0002448297,0.00015150473,0.000088224,0.000116044364,0.000009569886],"category_scores_gemma":[0.0000090507,0.00014305898,0.0000732104,0.00026299464,0.000020921825,0.00028642247,0.00003980786,0.000060428258,0.00015723814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051897817,0.000037423208,0.010835671,0.002800961,0.0004416987,0.0000060253356,0.06164335,0.24007452,0.00012967233,0.62848824,0.053908654,0.0011148308],"study_design_scores_gemma":[0.0012829803,0.000016216238,0.0036635203,0.000059028866,0.000051341733,0.000013470259,0.00057005574,0.9930948,0.000057054713,0.0005758261,0.00041471902,0.0002009809],"about_ca_topic_score_codex":0.0000013232491,"about_ca_topic_score_gemma":1.48459e-7,"teacher_disagreement_score":0.7530203,"about_ca_system_score_codex":0.000054086246,"about_ca_system_score_gemma":0.000011066721,"threshold_uncertainty_score":0.58337754},"labels":[],"label_agreement":null},{"id":"W6991873386","doi":"","title":"Invariance Des Spectres De Parole Par Analyse Des Correlations Canoniques.","year":2022,"lang":"fr","type":"article","venue":"Canadian acoustics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Noise (video); Signal processing; Invariant (physics)","score_opus":0.03273695194616575,"score_gpt":0.27801337494420425,"score_spread":0.2452764229980385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991873386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7276644,0.0074763484,0.20525669,0.0116275875,0.0011059982,0.0011864158,0.008574176,0.00030841996,0.036799956],"genre_scores_gemma":[0.90386766,0.00026635142,0.07480129,0.0014926632,0.000239274,0.00016820329,0.00014853521,0.0000674495,0.01894859],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981447,0.00020878726,0.000395129,0.00029845323,0.00018585632,0.0007670805],"domain_scores_gemma":[0.99795824,0.0002891881,0.00015160027,0.00050884,0.00017506583,0.00091704284],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029280776,0.00023170812,0.00025330557,0.0002543995,0.0019982494,0.00013172312,0.00036884617,0.00012220621,0.005735713],"category_scores_gemma":[0.0002446269,0.00031817646,0.000119341596,0.0007910023,0.0004900993,0.00010594019,0.00006750733,0.0005347605,0.00017251812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019858253,0.00071251974,0.030971149,0.00041048785,0.00042510746,0.0006523007,0.012873559,0.0894374,0.0074668056,0.31114417,0.53408885,0.011797788],"study_design_scores_gemma":[0.00084553537,0.00019590923,0.09850562,0.0002037312,0.001476507,0.000814798,0.005833265,0.12943727,0.0005118962,0.5535584,0.20726988,0.0013471706],"about_ca_topic_score_codex":0.11421997,"about_ca_topic_score_gemma":0.20359173,"teacher_disagreement_score":0.32681897,"about_ca_system_score_codex":0.0033147256,"about_ca_system_score_gemma":0.0027644266,"threshold_uncertainty_score":0.99992704},"labels":[],"label_agreement":null},{"id":"W7019412825","doi":"","title":"A Generation Curtailed: The Lifespans of Canada’s Pensioned Veterans of the Great War","year":2023,"lang":"en","type":"article","venue":"Scholars Commons (Wilfrid Laurier University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Life expectancy; Veterans Affairs; Pension; Sample (material); Spanish Civil War; World War II; Centenarian; Expectancy theory; Longevity; Iraq war","score_opus":0.04813212946130725,"score_gpt":0.2550902827799052,"score_spread":0.20695815331859796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019412825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887444,0.0000165866,0.00020963779,0.0062732967,0.00014451337,0.00034581256,0.00019637714,0.000057092184,0.0040122787],"genre_scores_gemma":[0.9950266,0.000016948869,0.00031998576,0.00011320998,0.000025226787,0.0000024422677,0.000020266265,0.000014960003,0.004460368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988959,0.0002349141,0.000221108,0.00016039755,0.00031127987,0.00017638909],"domain_scores_gemma":[0.99858195,0.00026237685,0.00017858204,0.0007228696,0.00018804811,0.00006617045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002243651,0.00011671075,0.00018454621,0.00013521775,0.00056668883,0.000013049352,0.00056461233,0.000057783527,0.00007302738],"category_scores_gemma":[0.000098164,0.00008443898,0.00013066664,0.000989453,0.00013243227,0.00011794595,0.00015816893,0.0002375901,0.0000060961574],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013829794,0.0004227914,0.019733258,0.00014015546,0.0005275114,0.00005582342,0.00557416,0.0010164729,0.0761991,0.5441422,0.35104936,0.0010008538],"study_design_scores_gemma":[0.0044811824,0.00017718019,0.10412771,0.000369958,0.0011560194,0.000051820796,0.010916402,0.006161988,0.069947414,0.018305093,0.7831107,0.0011945283],"about_ca_topic_score_codex":0.006613081,"about_ca_topic_score_gemma":0.17566876,"teacher_disagreement_score":0.5258371,"about_ca_system_score_codex":0.0000795966,"about_ca_system_score_gemma":0.00032668604,"threshold_uncertainty_score":0.9997044},"labels":[],"label_agreement":null},{"id":"W7020846328","doi":"","title":"Modelisation Autoregressive Evolutive et Reconnaissance de La Parole","year":2022,"lang":"en","type":"article","venue":"Canadian acoustics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Autoregressive model; Noise (video); Artificial neural network; Statistical analysis","score_opus":0.03586592211283805,"score_gpt":0.32109746527646815,"score_spread":0.2852315431636301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020846328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6486033,0.00023859383,0.23010285,0.008500293,0.00046203952,0.0009927255,0.0025390103,0.00043146257,0.10812971],"genre_scores_gemma":[0.98612326,0.0000055405667,0.010827933,0.0013915766,0.000046462803,0.0001410826,0.000042261265,0.00002311996,0.0013987514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992559,0.00014553856,0.00013082322,0.00014244787,0.000113995695,0.00021130517],"domain_scores_gemma":[0.9991927,0.00024962213,0.00007437922,0.0002096754,0.000060931827,0.00021269196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025160995,0.00008169759,0.000090321555,0.00009232823,0.0003644469,0.000031968702,0.00015337685,0.00004559068,0.0004311972],"category_scores_gemma":[0.00015479347,0.00009882744,0.00003442159,0.00011195937,0.000056814395,0.000040415965,0.000024394334,0.00024244306,0.000016807944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008501947,0.000085223095,0.0004119692,0.00001887466,0.000032763095,0.00004217991,0.0032606872,0.028623711,0.004239344,0.5436819,0.41842362,0.0011711788],"study_design_scores_gemma":[0.0005639537,0.000049650247,0.012039618,0.000023376357,0.00008994778,0.00013798736,0.002487682,0.26099193,0.00012334053,0.65974975,0.06327812,0.00046463066],"about_ca_topic_score_codex":0.0024241793,"about_ca_topic_score_gemma":0.0013355158,"teacher_disagreement_score":0.3551455,"about_ca_system_score_codex":0.00068885257,"about_ca_system_score_gemma":0.00057652226,"threshold_uncertainty_score":0.47213072},"labels":[],"label_agreement":null},{"id":"W7021353060","doi":"","title":"No Borders: Bridging Cultures Through Yuri's Night","year":2013,"lang":"en","type":"article","venue":"Scholarly Commons (Embry–Riddle Aeronautical University)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Summit; Human spaceflight; Spaceflight; Space Science; Mars Exploration Program; Observatory; Space Shuttle; Space research; International Space Station; Planetarium","score_opus":0.03709070729928195,"score_gpt":0.28537330905762004,"score_spread":0.2482826017583381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021353060","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3493837,0.00019394491,0.034801926,0.016183713,0.00037922213,0.001635633,0.000121494115,0.0014716032,0.5958288],"genre_scores_gemma":[0.9148328,0.00004869932,0.043892365,0.0014242937,0.00021933892,0.000019889434,0.00007925632,0.00007944113,0.039403975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99780804,0.00022023155,0.00036259746,0.0005592301,0.00043936947,0.00061052927],"domain_scores_gemma":[0.99770284,0.00041797708,0.00014660935,0.00086953596,0.00049627427,0.00036678853],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016389537,0.00035055456,0.00040399228,0.00019555207,0.00084260124,0.00059258053,0.00088584283,0.00025720077,0.0013430937],"category_scores_gemma":[0.00026445283,0.0003512133,0.00024963272,0.00077678513,0.0002970804,0.0027144235,0.0003654019,0.0009260859,0.002881401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031068055,0.00061407936,0.00053114287,0.000038782844,0.00012254844,0.00004248197,0.0002492796,0.0000055710093,0.0025127993,0.92820555,0.066569634,0.0010770855],"study_design_scores_gemma":[0.0024800035,0.00019396553,0.005319198,0.00014730127,0.0002842227,0.00006174408,0.0013430276,0.00077475223,0.0015631047,0.12353374,0.86313605,0.0011628832],"about_ca_topic_score_codex":0.00020777782,"about_ca_topic_score_gemma":0.00008189708,"teacher_disagreement_score":0.80467176,"about_ca_system_score_codex":0.0002003756,"about_ca_system_score_gemma":0.000085888474,"threshold_uncertainty_score":0.99989396},"labels":[],"label_agreement":null},{"id":"W7023781497","doi":"","title":"Perceptions and Experiences of Precarious Employment in Canadian Libraries: An Exploratory Study","year":2019,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Exploratory research; Perception; Qualitative research; Context (archaeology); Unemployment","score_opus":0.03270478531237649,"score_gpt":0.30612802125821703,"score_spread":0.27342323594584056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023781497","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3152309,0.000004329655,0.00008907838,0.000050036062,0.00011883853,0.0023913227,0.000058217902,0.00013813487,0.68191916],"genre_scores_gemma":[0.37344134,0.00003460646,0.0017020606,0.0000419971,0.000039574166,0.0013069377,0.000024473933,0.00019751056,0.6232115],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713427,0.00041798607,0.0005377396,0.0013233307,0.0002662621,0.00032041152],"domain_scores_gemma":[0.9964534,0.00017691992,0.00028113832,0.0027213877,0.00004804037,0.00031908986],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00094934594,0.0003079963,0.00052900234,0.0004901508,0.00008352997,0.00008633642,0.0007073899,0.00027030363,0.23920494],"category_scores_gemma":[0.00022545253,0.00034023143,0.00007387463,0.00019239081,0.00017310295,0.00016770636,0.0003958332,0.00029722485,0.05897672],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052659314,0.00446145,0.056860637,0.00045371978,0.00040500413,0.00002963101,0.64778477,0.000037015645,0.0004054991,0.01775545,0.26758382,0.004170366],"study_design_scores_gemma":[0.0032381902,0.000035695844,0.025150314,0.0010530505,0.0003977544,0.0000368006,0.3691606,0.00032611194,0.00063156924,0.018547231,0.578809,0.002613657],"about_ca_topic_score_codex":0.030750437,"about_ca_topic_score_gemma":0.21933591,"teacher_disagreement_score":0.31122524,"about_ca_system_score_codex":0.00017258327,"about_ca_system_score_gemma":0.00040412918,"threshold_uncertainty_score":0.999905},"labels":[],"label_agreement":null},{"id":"W7024201596","doi":"","title":"The Return of the ‘Children of Nature’: Spectacle and Environment during Banff's Indian Days","year":2011,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Spectacle; Indigenous; Population; Interpretation (philosophy); The arts; Metis","score_opus":0.004843349630708185,"score_gpt":0.18357284638772065,"score_spread":0.17872949675701247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024201596","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055404105,0.00025610783,2.912851e-7,0.00017530224,0.000055386616,0.00054274587,0.00021655821,0.000031195606,0.993182],"genre_scores_gemma":[0.037965246,0.00041950212,0.00081994646,0.00003408242,0.00004839155,0.000013096747,0.000021198945,0.00006262481,0.96061593],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988916,0.000054059117,0.0005218638,0.000116414165,0.0002774471,0.00013861513],"domain_scores_gemma":[0.99838376,0.00012224972,0.00087347365,0.0005347932,0.000039546063,0.000046157325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014268183,0.00018302884,0.0002618867,0.00003431157,0.00009958616,0.000013779743,0.0003590135,0.00026148718,0.03711872],"category_scores_gemma":[0.000053776617,0.00012305281,0.00012098996,0.0000070658275,0.00025252445,1.6806922e-7,0.0001275232,0.00028258623,0.00019163624],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020868143,0.000042091477,0.000026509199,0.00021581931,0.00007219811,4.4151e-7,0.00029545656,0.0000028293548,0.0000053434596,0.001114178,0.99802434,0.00017989131],"study_design_scores_gemma":[0.00030144668,0.000028100021,0.00074516924,0.00016430937,0.00006156659,0.00004490611,0.000097357646,0.0000012590219,0.0004476299,0.00055346836,0.99742323,0.0001315568],"about_ca_topic_score_codex":0.00035571502,"about_ca_topic_score_gemma":0.00020852909,"teacher_disagreement_score":0.036927085,"about_ca_system_score_codex":0.000018616132,"about_ca_system_score_gemma":0.000010577112,"threshold_uncertainty_score":0.9637615},"labels":[],"label_agreement":null},{"id":"W7066531101","doi":"","title":"Hyperspectral Remote Sensing in environmental monitoring: Detailed mapping of asbestos concrete sheeting and in illegal stocking area","year":2001,"lang":"en","type":"other","venue":"Università Politecnica delle Marche (Università Politecnica delle Marche)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hyperspectral imaging; Asbestos; Stocking; Environmental impact assessment","score_opus":0.03605143161819343,"score_gpt":0.2616197812352539,"score_spread":0.2255683496170605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066531101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5394432,0.0024921556,0.0077744466,0.0019604198,0.00022610875,0.0033288845,0.0006378023,0.0007496966,0.4433873],"genre_scores_gemma":[0.6944667,0.003936261,0.12314499,0.00014788426,0.0004004235,0.000005016305,0.00027722848,0.0010311271,0.17659035],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99490637,0.0005528638,0.0009706805,0.001389517,0.00071870274,0.0014618937],"domain_scores_gemma":[0.99635994,0.0008775452,0.0008867329,0.001254665,0.00006977092,0.0005513535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061479013,0.00095172174,0.0015053404,0.0032642672,0.0003067091,0.00006016066,0.0009968623,0.0009298331,0.0009062417],"category_scores_gemma":[0.00011151332,0.0012278195,0.0004431468,0.0012896911,0.0008084863,0.00023612873,0.0011656192,0.0015686366,0.000030450456],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008894379,0.005285647,0.108986095,0.012747162,0.011051031,0.023258157,0.12911029,0.0022007443,0.2133814,0.18780431,0.12300035,0.17428043],"study_design_scores_gemma":[0.03413744,0.0008931741,0.009054396,0.014281019,0.0022036356,0.0017147443,0.18333797,0.06452169,0.0023701033,0.018527536,0.6568107,0.012147594],"about_ca_topic_score_codex":0.0044127516,"about_ca_topic_score_gemma":0.0006554137,"teacher_disagreement_score":0.5338103,"about_ca_system_score_codex":0.0017267662,"about_ca_system_score_gemma":0.00024791397,"threshold_uncertainty_score":0.9990172},"labels":[],"label_agreement":null},{"id":"W7066807569","doi":"","title":"Jam and the Playground Kids 1-26-08 - Chugger's Ottawa - 2nd Set","year":2008,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Shakedown; Crew; Set (abstract data type)","score_opus":0.01157354339207301,"score_gpt":0.2209620117175749,"score_spread":0.2093884683255019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066807569","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010509943,0.0003251083,0.000004309257,0.0007617699,0.00012281688,0.00083378074,0.00027628322,0.00033610046,0.9972347],"genre_scores_gemma":[0.0007605866,0.0005823301,0.002583535,0.00053292146,0.00019164964,0.00007019345,0.00013104081,0.00017133972,0.9949764],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822146,0.000110422814,0.00075753726,0.00022340435,0.00041698187,0.0002702035],"domain_scores_gemma":[0.99798226,0.0004718891,0.0007305981,0.0005777615,0.00011425549,0.00012320308],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002733422,0.0003785834,0.0005555365,0.00007661681,0.00019629179,0.00007975554,0.0003615727,0.0003760432,0.17230903],"category_scores_gemma":[0.0001312929,0.00029318614,0.0001868772,0.000012577656,0.00048423474,3.0731266e-7,0.00009713226,0.00034025378,0.0059795687],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004982341,0.000044249664,8.315106e-7,0.00025866373,0.000092507355,0.0000063063508,0.00031638137,0.00000788542,1.5303988e-7,0.004289332,0.99461937,0.0003144931],"study_design_scores_gemma":[0.001414704,0.000040719267,0.000006613926,0.000138715,0.00009913191,0.00031725588,0.00013691012,0.000027416056,0.0000033393042,0.0007297323,0.9967581,0.00032737147],"about_ca_topic_score_codex":0.0014094415,"about_ca_topic_score_gemma":0.0006073166,"teacher_disagreement_score":0.16632946,"about_ca_system_score_codex":0.000033219956,"about_ca_system_score_gemma":0.000025446716,"threshold_uncertainty_score":0.999952},"labels":[],"label_agreement":null},{"id":"W7093294535","doi":"10.5281/zenodo.17424833","title":"Phyllium Illiger 1798","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Espace pour la vie","funders":"","keywords":"Natural (archaeology); Type (biology); Sequence (biology); Subject (documents)","score_opus":0.0453343932041289,"score_gpt":0.29963466726476845,"score_spread":0.25430027406063954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093294535","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008819163,0.0004027913,0.07261365,0.011703488,0.0005778314,0.001846932,0.0009116062,0.0022312487,0.9008933],"genre_scores_gemma":[0.9350296,0.0006007195,0.0036441735,0.001805905,0.00057898543,3.6666665e-7,0.002465153,0.0040917215,0.051783334],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968975,0.0005000885,0.0007075543,0.0007733936,0.0004805286,0.0006409115],"domain_scores_gemma":[0.9969033,0.000112796675,0.00024302612,0.0012412791,0.0012178698,0.0002817056],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00079117663,0.0003295011,0.00035485276,0.00050662446,0.004929011,0.0017134428,0.0016982611,0.00019279247,0.044866312],"category_scores_gemma":[0.00071315095,0.00037893996,0.00018990453,0.0015374059,0.00036104073,0.0002562017,0.0016444692,0.000591584,0.03410019],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000524497,0.00068913004,0.0000012309456,0.00026583028,0.00014930955,0.0000070354768,0.0009555395,0.000021329452,0.0046255393,0.3045111,0.62078655,0.06793498],"study_design_scores_gemma":[0.0007614444,0.00010753762,0.0002449175,0.0001600037,0.00010291644,0.000051714313,0.00063447905,0.0008277802,0.001555979,0.015378574,0.9798356,0.00033902682],"about_ca_topic_score_codex":0.000007857914,"about_ca_topic_score_gemma":2.2293948e-7,"teacher_disagreement_score":0.92621046,"about_ca_system_score_codex":0.00030330042,"about_ca_system_score_gemma":0.000011646093,"threshold_uncertainty_score":0.99986625},"labels":[],"label_agreement":null},{"id":"W7096339246","doi":"","title":"Relationship between gradient and EM steps in latent variable models. http://www.cs.toronto.edu/rsalakhu/ecg","year":2003,"lang":"en","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Latent variable; Variable (mathematics); Expectation–maximization algorithm; Matrix (chemical analysis); Maximization; Latent variable model; Exponential family; Space (punctuation)","score_opus":0.09110083922928318,"score_gpt":0.30819416600430055,"score_spread":0.21709332677501736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096339246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8382491,0.00020040905,0.09835832,0.00043909322,0.00007086377,0.0007524906,0.000029944957,0.00024063794,0.06165914],"genre_scores_gemma":[0.93104386,0.000012092105,0.06497192,0.00008947405,0.000021568168,0.00008045257,0.000019127761,0.000024280174,0.0037372431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876803,0.00008836358,0.0004212709,0.00029423338,0.00017251763,0.00025558707],"domain_scores_gemma":[0.99894774,0.00041206586,0.000087320805,0.00035693785,0.000054543245,0.00014142042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003594002,0.00016441083,0.00023448067,0.00006263751,0.00013860266,0.000060417467,0.00010056746,0.00011808205,0.00020815503],"category_scores_gemma":[0.000076137156,0.0001497453,0.00004482219,0.00017867105,0.000029054434,0.0002318135,0.00003032093,0.00016320172,0.000053163538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000253775,0.00013502863,0.025572028,0.000023401433,0.000011865224,7.951101e-7,0.0005007644,0.00009649471,0.000023234517,0.97237855,0.0011316345,0.0001236846],"study_design_scores_gemma":[0.0010186295,0.000040911003,0.048509106,0.000038724953,0.00006793005,0.000013759325,0.000694296,0.0119237695,0.00009412926,0.9348813,0.0023719224,0.00034546384],"about_ca_topic_score_codex":0.00012994638,"about_ca_topic_score_gemma":0.00035298895,"teacher_disagreement_score":0.09279474,"about_ca_system_score_codex":0.00013159505,"about_ca_system_score_gemma":0.000029676388,"threshold_uncertainty_score":0.6106436},"labels":[],"label_agreement":null},{"id":"W7104381216","doi":"10.55016/ojs/cdm.v19i4.73644","title":"On the permanent of an even-dimensional non-negative polystochastic tensor of order n","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Hypercube; Order (exchange); Transversal (combinatorics); Tensor (intrinsic definition); Conjecture","score_opus":0.014606741465860275,"score_gpt":0.32863195459669126,"score_spread":0.314025213130831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104381216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4834433,0.00010693616,0.47741586,0.017317751,0.00033380912,0.0062380913,0.008550428,0.00009472949,0.0064991117],"genre_scores_gemma":[0.9747819,0.000005823769,0.022506421,0.00047891864,0.000048543974,0.0003729365,0.00008007887,0.0000467791,0.0016786095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962555,0.00022905452,0.0018010734,0.0004947041,0.0007028935,0.00051674957],"domain_scores_gemma":[0.990482,0.0044550407,0.0008785638,0.001718649,0.0022206341,0.0002451328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007988292,0.00051818206,0.00107355,0.00039597187,0.00058583956,0.000064602595,0.0007924142,0.00023543315,0.00055128604],"category_scores_gemma":[0.0040476313,0.0003842636,0.0003893638,0.0014871503,0.000540595,0.00009508235,0.00028412146,0.000429918,0.00016376501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010815231,0.0023175464,0.0000028877007,0.00040359388,0.00043830756,0.0000015579704,0.0023154353,0.0016798372,0.010931099,0.9779055,0.003799806,0.000096237025],"study_design_scores_gemma":[0.0025110615,0.00084881496,0.0005950431,0.0036301229,0.0016731845,0.00002063461,0.004261832,0.121624544,0.046237834,0.8175762,0.0002667235,0.00075396005],"about_ca_topic_score_codex":0.000021630085,"about_ca_topic_score_gemma":0.0000137151255,"teacher_disagreement_score":0.4913386,"about_ca_system_score_codex":0.00021742168,"about_ca_system_score_gemma":0.0004314852,"threshold_uncertainty_score":0.99986094},"labels":[],"label_agreement":null},{"id":"W7111141754","doi":"10.1002/cpe.70477","title":"QTTARNN: A Highly‐Efficient Attention Driven Quantized Tensor Train Recursive Neural Network for Cyber‐Physical‐Social Intelligence","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Artificial neural network; Lossless compression; Quantization (signal processing); Action (physics); Feature (linguistics); Recurrent neural network; Pattern recognition (psychology)","score_opus":0.0520028463967384,"score_gpt":0.4057809311656086,"score_spread":0.3537780847688702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111141754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6194683,0.00016619191,0.37557825,0.0035135183,0.00023390533,0.0005816727,0.000015521278,0.000074148695,0.00036853357],"genre_scores_gemma":[0.98641294,0.00004189102,0.012668287,0.00041783054,0.000105381696,0.000246455,0.000025038085,0.000007636099,0.0000745208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998901,0.00011621352,0.00031344543,0.00035222556,0.00012306766,0.00019406588],"domain_scores_gemma":[0.9980212,0.0013460482,0.00023052157,0.00009220257,0.00025209447,0.000057974714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016533157,0.00014752815,0.00021745801,0.000052325355,0.0005713615,0.0001108005,0.00009117688,0.00005531338,0.000004032623],"category_scores_gemma":[0.000320893,0.0001437505,0.00006347449,0.0002872284,0.0001621327,0.00023205209,0.00003942345,0.00012848337,0.0000029138039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002126701,0.00047144658,0.00010947146,0.00010961518,0.000054365388,0.0000022338431,0.022521485,0.0008726775,0.00081118493,0.89634866,0.0025016218,0.07598456],"study_design_scores_gemma":[0.0025337755,0.00046201138,0.0047072032,0.00029457026,0.0004704607,0.00005268613,0.03939137,0.6743277,0.0005266649,0.2587032,0.017614134,0.00091628585],"about_ca_topic_score_codex":0.000006344769,"about_ca_topic_score_gemma":0.0000015020487,"teacher_disagreement_score":0.673455,"about_ca_system_score_codex":0.00001845882,"about_ca_system_score_gemma":0.000028644043,"threshold_uncertainty_score":0.5861975},"labels":[],"label_agreement":null},{"id":"W7116731441","doi":"10.1016/j.neucom.2025.132509","title":"BERTC: A new Bayesian exponential regularized tensor completion method for sparse geomagnetic time series data","year":2025,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Missing data; Imputation (statistics); Inference; Gibbs sampling; Bayesian probability; Exponential function; Earth's magnetic field; Bayesian inference; Tensor (intrinsic definition)","score_opus":0.06373881699590099,"score_gpt":0.3618240771956584,"score_spread":0.2980852601997574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116731441","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007870727,0.000015337086,0.9833627,0.0059632277,0.00015328114,0.000822162,0.000058026955,0.0003857521,0.0013687975],"genre_scores_gemma":[0.007108719,0.0000015245018,0.9839134,0.000786735,0.00030203705,0.000046664507,0.00023969403,0.000043751403,0.007557429],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838877,0.00013301244,0.0004839973,0.0005507644,0.00015472145,0.0002887628],"domain_scores_gemma":[0.9980148,0.00076262216,0.00017760327,0.00086761283,0.000089128494,0.00008819577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033507482,0.00019392732,0.0003378344,0.000116900286,0.00034486136,0.00012579956,0.00051039126,0.000075449156,0.00010145289],"category_scores_gemma":[0.0002624949,0.00020434077,0.00009809411,0.00025955893,0.000033038945,0.00011853954,0.0003052827,0.0001405066,0.00003114708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042087265,0.00070423365,0.000103273924,0.00056799734,0.00021928728,0.000013908821,0.0005493276,0.00039864477,0.3089295,0.2455942,0.32054406,0.12195468],"study_design_scores_gemma":[0.0031385275,0.00012731183,0.0011793294,0.00018145065,0.0003653676,0.00009114863,0.00006817949,0.71380305,0.003823747,0.1253158,0.151405,0.0005010906],"about_ca_topic_score_codex":0.000021266564,"about_ca_topic_score_gemma":0.000007924222,"teacher_disagreement_score":0.7134044,"about_ca_system_score_codex":0.000020286803,"about_ca_system_score_gemma":0.000059371985,"threshold_uncertainty_score":0.83327746},"labels":[],"label_agreement":null},{"id":"W7117971241","doi":"10.1145/3712285.3787161","title":"10.1145/3712285.3787161","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Tensor (intrinsic definition); Matrix (chemical analysis); Calculus (dental); Algebra over a field","score_opus":0.019201946371351596,"score_gpt":0.2524649987642014,"score_spread":0.23326305239284983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117971241","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030155152,0.0000064530745,0.000022643004,0.0009920736,9.538629e-7,0.00020044223,0.00001959981,0.0002571317,0.9954852],"genre_scores_gemma":[0.0006034011,1.30674e-7,0.0034465813,0.00013813356,0.000066760535,0.000046219993,0.000011682102,0.000020412912,0.9956667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941885,0.000018146513,0.00015379812,0.00014716575,0.00011167309,0.00015034217],"domain_scores_gemma":[0.99944466,0.000075485696,0.000022592325,0.000316567,0.000032855874,0.00010780625],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006338983,0.000088447836,0.000114305316,0.000038459973,0.0000795227,0.000029102555,0.00014808618,0.00003842821,0.99371797],"category_scores_gemma":[0.000017940194,0.000086515516,0.000050572842,0.00014658117,0.000016469216,0.000038599046,0.000016765396,0.000057561134,0.98580205],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017194343,0.00014910396,6.852188e-8,0.000005974401,0.00001266621,0.000001726536,0.000027644073,0.000009257614,0.00031043254,0.00082572526,0.7431002,0.25553995],"study_design_scores_gemma":[0.00014085117,0.000028495742,0.00001784351,0.000007780524,0.00001417978,0.000008149476,8.652472e-7,0.000126394,0.00018288477,0.0020673187,0.9972919,0.0001133323],"about_ca_topic_score_codex":0.0000027573535,"about_ca_topic_score_gemma":6.661365e-8,"teacher_disagreement_score":0.25542662,"about_ca_system_score_codex":0.000018272462,"about_ca_system_score_gemma":0.000008797474,"threshold_uncertainty_score":0.35280004},"labels":[],"label_agreement":null},{"id":"W7117996326","doi":"10.1145/3712285.3787162","title":"10.1145/3712285.3787162","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Computation; Tensor (intrinsic definition); Matrix (chemical analysis); Sparse matrix; Sparse approximation","score_opus":0.019229452592024673,"score_gpt":0.2525451610166294,"score_spread":0.2333157084246047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117996326","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034316299,0.0000062509985,0.000019227175,0.0009849496,9.5146925e-7,0.00019965753,0.000019526695,0.00025659014,0.99508125],"genre_scores_gemma":[0.0006205194,1.3167828e-7,0.003414131,0.00012139691,0.00006667584,0.000046170342,0.000011662857,0.000020402684,0.9956989],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994205,0.00001814069,0.00015323883,0.00014695879,0.00011130896,0.00014983292],"domain_scores_gemma":[0.9994457,0.00007525343,0.000022929073,0.00031579877,0.00003273687,0.00010763137],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006302301,0.00008829521,0.00011387135,0.000037972444,0.0000782464,0.00002839376,0.00014781806,0.000038429625,0.99368864],"category_scores_gemma":[0.000017346229,0.00008638234,0.000050413964,0.00014519811,0.000016195869,0.000038500995,0.000016761747,0.000057336878,0.98563534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017196533,0.0001498779,8.438283e-8,0.00000593989,0.000012418159,0.000001736848,0.000026899797,0.000011635393,0.00025529863,0.0008112443,0.73156476,0.2671429],"study_design_scores_gemma":[0.00014066708,0.000028456474,0.000019730494,0.000007769583,0.000013942104,0.00000814525,8.438727e-7,0.00015381523,0.00014545282,0.001729135,0.99763876,0.00011327379],"about_ca_topic_score_codex":0.0000026642626,"about_ca_topic_score_gemma":6.7443956e-8,"teacher_disagreement_score":0.2670296,"about_ca_system_score_codex":0.000018056578,"about_ca_system_score_gemma":0.000008620348,"threshold_uncertainty_score":0.35225695},"labels":[],"label_agreement":null},{"id":"W7118019666","doi":"10.1145/3712285.3787185","title":"10.1145/3712285.3787185","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Computation; Tensor (intrinsic definition); Matrix (chemical analysis); Sparse matrix; Sparse approximation","score_opus":0.019182302056395324,"score_gpt":0.25242911844298876,"score_spread":0.23324681638659345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118019666","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026462607,0.000006169839,0.00002418597,0.0010167275,9.470574e-7,0.00019984355,0.000019389343,0.0002563875,0.99583006],"genre_scores_gemma":[0.0005584329,1.3340903e-7,0.0036986955,0.00014253918,0.00006577898,0.00004626135,0.000011772237,0.000020395784,0.995456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942124,0.000017909877,0.00015319794,0.00014684904,0.00011087171,0.00014990318],"domain_scores_gemma":[0.99944776,0.000074827665,0.000022529792,0.00031504,0.000032381835,0.0001074392],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000062992985,0.000087978835,0.00011392961,0.000038451984,0.000079272606,0.000029294442,0.00014757892,0.000038345694,0.99378127],"category_scores_gemma":[0.000017405842,0.000086367356,0.000050168637,0.00014504035,0.000016432119,0.000038520728,0.00001671722,0.000057488636,0.9854677],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017060553,0.00014758813,6.373535e-8,0.000005843279,0.000012448731,0.0000016476224,0.000026747339,0.000010773196,0.00026791095,0.00082077814,0.75028217,0.24840695],"study_design_scores_gemma":[0.00014114888,0.000027963504,0.000017288283,0.000007642838,0.000014005477,0.000007862084,8.661101e-7,0.00013263013,0.00017017125,0.001991699,0.9973756,0.000113143746],"about_ca_topic_score_codex":0.0000027613353,"about_ca_topic_score_gemma":6.748056e-8,"teacher_disagreement_score":0.2482938,"about_ca_system_score_codex":0.000018179095,"about_ca_system_score_gemma":0.000008743329,"threshold_uncertainty_score":0.35219586},"labels":[],"label_agreement":null},{"id":"W7126377487","doi":"10.19086/da.143834","title":"discreteness-of-asymptotic-tensor-ranks","year":2025,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Novo Nordisk Fonden; Université de Genève; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Novo Nordisk; National Centres of Competence in Research SwissMAP; Centre de Recherches Mathématiques; Erasmus+; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Villum Fonden; National Science Foundation","keywords":"Tensor (intrinsic definition); Rank (graph theory); Asymptotic analysis; Dimension (graph theory); Asymptotic analysis; Symmetric tensor; Asymptotology; Tensor product; Upper and lower bounds","score_opus":0.02302623577288685,"score_gpt":0.3527443798883812,"score_spread":0.3297181441154943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126377487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50876844,0.00015565348,0.43048635,0.0027383703,0.000079375975,0.00036205712,0.00016177008,0.00023454934,0.05701343],"genre_scores_gemma":[0.9887635,0.000018557046,0.0077520013,0.00013726986,0.00001705961,0.000038748625,0.00006656971,0.0000110486935,0.0031952574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988304,0.00005806353,0.00046213678,0.00027564395,0.00019495058,0.0001788545],"domain_scores_gemma":[0.998608,0.00035426306,0.0001573303,0.00067694846,0.00014519124,0.000058257283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001564022,0.00014663351,0.00048232047,0.0004354085,0.00011483,0.000033228498,0.0002714462,0.000072575254,0.00051425974],"category_scores_gemma":[0.00012203001,0.00012463557,0.0005324189,0.0019952275,0.0000866622,0.00006371051,0.000061282946,0.00009104032,0.00002490365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024884832,0.00016815528,0.035974614,0.000089129666,0.0033276165,0.000002285263,0.00021687163,0.00037576063,0.0028852834,0.9540555,0.0017784962,0.0011014409],"study_design_scores_gemma":[0.0017252307,0.000069243004,0.13636951,0.0001764209,0.024693012,0.0000022938414,0.0019006248,0.037483595,0.030705893,0.75758797,0.008148192,0.0011380427],"about_ca_topic_score_codex":0.000043882534,"about_ca_topic_score_gemma":0.000056336994,"teacher_disagreement_score":0.47999504,"about_ca_system_score_codex":0.000022840228,"about_ca_system_score_gemma":0.000022374594,"threshold_uncertainty_score":0.56307834},"labels":[],"label_agreement":null},{"id":"W7128252154","doi":"10.1080/03610918.2025.2519508","title":"Best linear unbiased prediction in the two-way error components model with <i>AR</i> (1) error processes","year":2025,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Component (thermodynamics); Best linear unbiased prediction; Mean squared prediction error; Mean squared error; Error analysis","score_opus":0.20194550759334612,"score_gpt":0.45851666510818984,"score_spread":0.2565711575148437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128252154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105130054,0.00007676032,0.89056903,0.0013299817,0.00002551117,0.0009383487,0.0002101661,0.000079173966,0.0016409892],"genre_scores_gemma":[0.85727453,0.000030225145,0.14143038,0.00027917032,0.000008494053,0.00018964654,0.00064608024,0.000015001012,0.00012648238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848974,0.00025453776,0.00060277415,0.00025326095,0.00024494785,0.000154717],"domain_scores_gemma":[0.99673814,0.002052458,0.00020743474,0.0006137797,0.00035308534,0.00003510566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039086211,0.00017263429,0.00020460328,0.0002834848,0.00036924548,0.000101306105,0.00038747676,0.00006735159,0.0000047053145],"category_scores_gemma":[0.00019953298,0.00015032658,0.00001743219,0.0009137363,0.00017632928,0.00017350553,0.00008693725,0.00027933883,0.0000065787076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005941003,0.0007248971,0.003159231,0.00013283471,0.000018258943,8.996863e-7,0.0022553531,0.84871113,0.00004007562,0.14172931,0.00034942033,0.0028191698],"study_design_scores_gemma":[0.001319504,0.000032090258,0.005633075,0.00015898418,0.00004766536,0.0000022781146,0.0007220908,0.899192,0.000005368849,0.09246865,0.0002927215,0.00012562856],"about_ca_topic_score_codex":0.000048129594,"about_ca_topic_score_gemma":0.0006746908,"teacher_disagreement_score":0.75214446,"about_ca_system_score_codex":0.00008147269,"about_ca_system_score_gemma":0.00009340762,"threshold_uncertainty_score":0.613014},"labels":[],"label_agreement":null},{"id":"W7129641361","doi":"10.1007/978-3-031-94050-7_5","title":"Some Stein-Rule Methods in Tensor Regression Model with High-Dimensional Data","year":2025,"lang":"en","type":"book-chapter","venue":"Emerging topics in statistics and biostatistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Estimator; Tensor (intrinsic definition); Asymptotic distribution; Regression analysis; Regression; Linear regression; Estimation theory","score_opus":0.08582428767296793,"score_gpt":0.404576303532234,"score_spread":0.31875201585926605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7129641361","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021597723,0.0010037546,0.9491719,0.0022135638,0.00048627178,0.0011585699,0.02868778,0.00010936882,0.016952805],"genre_scores_gemma":[0.000088794906,0.0007137124,0.912342,0.00023185059,0.00011041701,0.00001687988,0.0024113317,0.000059240247,0.084025756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976945,0.000064522756,0.0008319951,0.0007411959,0.00036021305,0.00030756343],"domain_scores_gemma":[0.99744517,0.0010099325,0.0003576947,0.00091669965,0.00016657982,0.000103941784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040721035,0.00045035678,0.00069482677,0.00034924396,0.00013320666,0.00006342693,0.00037250688,0.0002807838,0.00009414965],"category_scores_gemma":[0.00025854463,0.00038984447,0.000024014202,0.00009116446,0.00018420354,0.00006910885,0.0004249378,0.0006635275,0.0000032087003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029302542,0.000071261165,0.000026486858,0.00027437825,0.000040441115,0.00007944775,0.00006858817,0.000117192925,0.000016608366,0.9527685,0.03087466,0.015633117],"study_design_scores_gemma":[0.00066820876,0.000041225336,0.0001146989,0.0007798563,0.00013184587,0.0000089170135,0.000015598209,0.10958302,0.000012987261,0.8748744,0.01329726,0.0004719587],"about_ca_topic_score_codex":0.000048676597,"about_ca_topic_score_gemma":0.00020548825,"teacher_disagreement_score":0.10946582,"about_ca_system_score_codex":0.000096636366,"about_ca_system_score_gemma":0.00018455146,"threshold_uncertainty_score":0.99985534},"labels":[],"label_agreement":null},{"id":"W7133392047","doi":"","title":"More Efficient Estimation of Multivariate Additive Models Based on Tensor Decomposition and Penalization","year":2024,"lang":"en","type":"article","venue":"CityU Scholars","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Shenzhen Research Institute, City University of Hong Kong; Fujian Normal University; Shanghai University of Finance and Economics; Yunnan University; National Natural Science Foundation of China; Hong Kong Polytechnic University; City University of Hong Kong; National Science Foundation","keywords":"Estimator; Additive model; Multivariate statistics; Spline (mechanical); Nonparametric statistics; Tensor decomposition; Nonparametric regression; Tensor (intrinsic definition); Regression; Convergence (economics)","score_opus":0.03504824305842081,"score_gpt":0.3512575918807643,"score_spread":0.3162093488223435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133392047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5395673,0.000029753654,0.45838276,0.00046052798,0.00004380685,0.0003896337,0.00013080129,0.00015719063,0.0008382588],"genre_scores_gemma":[0.97092724,0.0000033968859,0.028682142,0.00012289456,0.000017435263,0.0000553816,0.00012499068,0.000021550202,0.000044988057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910766,0.00006371191,0.00025176868,0.00025001433,0.000224388,0.00010243462],"domain_scores_gemma":[0.99923146,0.00031195197,0.0000828804,0.00018715589,0.00012576445,0.000060802326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020893502,0.00012003263,0.0001410852,0.0001869383,0.000115014256,0.00010768429,0.000063498184,0.000070951486,0.00004636285],"category_scores_gemma":[0.00010034048,0.00011237995,0.000057561152,0.00024024052,0.00004934696,0.0001784321,0.000017363622,0.00014420383,0.000015780488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008606053,0.0006000366,0.000027354401,0.00033884353,0.000057932553,0.000007589853,0.0011347698,0.4172572,0.014837126,0.55419666,0.0007711535,0.010685327],"study_design_scores_gemma":[0.00031363976,0.000037169328,0.0012440267,0.00028139696,0.00005314034,0.000004818483,0.000035407564,0.95959955,0.0060765133,0.032171264,0.00007230561,0.00011075183],"about_ca_topic_score_codex":0.0000044248454,"about_ca_topic_score_gemma":5.1587574e-7,"teacher_disagreement_score":0.54234236,"about_ca_system_score_codex":0.000055695153,"about_ca_system_score_gemma":0.000025299216,"threshold_uncertainty_score":0.45827213},"labels":[],"label_agreement":null},{"id":"W7139957918","doi":"10.23919/cnc-usnc-ursi64444.2025.11420190","title":"Tensor-Train Accelerated Solution of 3D Vector Volume Integral Equation Solutions with logN Complexity","year":2025,"lang":"","type":"article","venue":"","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Integral equation; Volume (thermodynamics); Work (physics); Computational complexity theory","score_opus":0.1517021373210687,"score_gpt":0.3398519330851733,"score_spread":0.18814979576410462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139957918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05483824,0.00010778283,0.910957,0.008555648,0.00022281271,0.0017608664,0.00033976333,0.00033860476,0.022879282],"genre_scores_gemma":[0.91614467,0.00002520962,0.07408335,0.00028721147,0.000059182716,0.00014188532,0.0002792823,0.000036369314,0.008942852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996733,0.00028809186,0.0012968861,0.00062244554,0.0004312436,0.0006283071],"domain_scores_gemma":[0.996808,0.00034195624,0.0005847023,0.00084157684,0.0012680335,0.00015572766],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049945817,0.0004634172,0.00072606874,0.0004183078,0.0007153009,0.00013813358,0.00040956735,0.0003227912,0.0029845473],"category_scores_gemma":[0.00019432121,0.00042114884,0.00021147377,0.0015702535,0.00080008095,0.0002964367,0.00014427557,0.00049749,0.00021765032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002150993,0.0023155045,0.00090758083,0.00036558148,0.00043868233,0.0000014200332,0.0006160651,0.00035233438,0.016413977,0.95726484,0.016711282,0.004397648],"study_design_scores_gemma":[0.00517143,0.0007714557,0.053473417,0.0009269264,0.0014809255,0.00003264375,0.003176448,0.83980787,0.0055253166,0.08466354,0.003635879,0.0013341763],"about_ca_topic_score_codex":0.0003019717,"about_ca_topic_score_gemma":0.00061143306,"teacher_disagreement_score":0.8726013,"about_ca_system_score_codex":0.00034914774,"about_ca_system_score_gemma":0.00044124707,"threshold_uncertainty_score":0.99982405},"labels":[],"label_agreement":null},{"id":"W79536630","doi":"10.1007/978-3-642-21946-7_22","title":"Classification of Clinical Gene-Sample-Time Microarray Expression Data via Tensor Decomposition Methods","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Discriminative model; Computer science; Curse of dimensionality; Microarray analysis techniques; Tensor (intrinsic definition); Gene chip analysis; Data mining; Sample (material); Pattern recognition (psychology); Artificial intelligence; Expression (computer science); Microarray; Computational biology; Gene; Gene expression; Mathematics; Biology; Genetics","score_opus":0.18378938951214358,"score_gpt":0.4423257245730031,"score_spread":0.25853633506085955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79536630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006258926,0.00007732754,0.99665695,0.0002197119,0.00036065822,0.0005535899,0.00013338774,0.00010277772,0.0012696828],"genre_scores_gemma":[0.016801314,0.000033319793,0.98213875,0.00022303835,0.0003463596,0.000012752637,0.00023144223,0.000048919184,0.00016410914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963024,0.00018646561,0.0013983441,0.0013231784,0.00048333048,0.00030625207],"domain_scores_gemma":[0.9928097,0.0030247495,0.0010432146,0.0026073516,0.0003613767,0.00015358704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023419615,0.0003779882,0.00077887916,0.0003927118,0.00017651482,0.00006831476,0.002096482,0.0004754313,0.00020988977],"category_scores_gemma":[0.00045879488,0.0003333449,0.00017720055,0.00023956387,0.00072653446,0.00024578464,0.0007272052,0.0005883459,0.000054770608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007700054,0.00049665483,0.00021938572,0.0001438296,0.00005826782,0.000006076967,0.00046998443,0.00019266496,0.26065385,0.015724597,0.00062918535,0.7213285],"study_design_scores_gemma":[0.00052471313,0.00014978928,0.0012886272,0.0005398515,0.00011757662,0.000057098612,3.1800525e-7,0.11744064,0.05901873,0.8169269,0.003158752,0.000777033],"about_ca_topic_score_codex":0.00001073223,"about_ca_topic_score_gemma":0.0000078681605,"teacher_disagreement_score":0.8012023,"about_ca_system_score_codex":0.00007506757,"about_ca_system_score_gemma":0.00018141394,"threshold_uncertainty_score":0.99991184},"labels":[],"label_agreement":null}]}