{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"cbb3ce52aaf2","filters":{"venue":"Discrete Analysis"}},"results":[{"id":"W1864140179","doi":"10.19086/da.613","title":"Monochromatic sums and products","year":2016,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Monochromatic color; Mathematics; Combinatorics; Set (abstract data type); Field (mathematics); Ramsey theory; Multiplication (music); Fraction (chemistry); Finite set; Discrete mathematics; Number theory; Arithmetic; Pure mathematics; Computer science; Physics; Mathematical analysis","authors":[{"name":"Ben Green","is_ca":false},{"name":"Tom Sanders","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02151046206878525,"gpt":0.2886173432028429,"spread":0.2671068811340577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006876463,0.0006911547,0.0006692468,0.001327821,0.001335148,0.003020672,0.0006083098,0.0007150655,0.02712772],"category_scores_gemma":[0.003009542,0.0005467164,0.0007022996,0.002314557,0.001924791,0.006415597,0.00180756,0.002237243,0.006131114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00175748,"about_ca_system_score_gemma":0.0005754201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001469649,"about_ca_topic_score_gemma":0.001616689,"domain_scores_codex":[0.9990331,0.0002200485,0.0000379116,0.0002696466,0.0003441272,0.00009522562],"domain_scores_gemma":[0.9993426,0.0002512438,0.00008221425,0.0001465478,0.0001121257,0.00006525209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004873669,0.00001422641,0.0002516582,0.000121237,0.00001705004,0.00005194409,0.0001997943,0.0007606514,0.0006848162,0.9372803,0.0280554,0.03251414],"study_design_scores_gemma":[0.00000425716,0.00001045358,0.0005044248,0.00004701897,0.00001121293,0.0001760537,0.00008471176,0.001674906,0.0003629144,0.9365817,0.06052978,0.00001251171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09107636,0.1305591,0.2733601,0.01836991,0.006481348,0.0000772889,0.002818078,0.001346123,0.4759117],"genre_scores_gemma":[0.7010167,0.03707936,0.05714376,0.004977812,0.006408632,0.0001402884,0.002240994,0.001024243,0.1899682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02712772,"threshold_uncertainty_score":0.09075123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963809654","doi":"10.19086/da.611","title":"Computing automorphism groups of shifts using atypical equivalence classes","year":2016,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Automorphism; Mathematics; Sigma; Combinatorics; Bijection; Discrete mathematics; Invariant (physics); Dynamical systems theory; Type (biology); Alphabet; Physics","authors":[{"name":"Reem Yassawi","is_ca":false},{"name":"Anthony Quas","is_ca":false},{"name":"Ethan M. Coven","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02467551793926439,"gpt":0.2872768801559658,"spread":0.2626013622167014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009804023,0.0008369919,0.000930641,0.003063844,0.00128186,0.003796897,0.001131589,0.0009353916,0.006023108],"category_scores_gemma":[0.01099033,0.0005773016,0.001525941,0.001800625,0.002215888,0.008105843,0.003302179,0.001561333,0.001149153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001626009,"about_ca_system_score_gemma":0.0007360805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002059255,"about_ca_topic_score_gemma":0.00255679,"domain_scores_codex":[0.9985381,0.0002872236,0.0001230835,0.0005156857,0.0003241112,0.000211788],"domain_scores_gemma":[0.9946195,0.002783534,0.0006234675,0.001073826,0.0004722045,0.0004274593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000683695,0.0003018634,0.02430248,0.000331296,0.0001658297,0.0004339465,0.002486569,0.05483197,0.01004477,0.741502,0.00655335,0.1583623],"study_design_scores_gemma":[0.00002522603,0.00005063748,0.0009037483,0.00002889758,0.00002331903,0.0000779793,0.0002150196,0.07665528,0.001621333,0.9173586,0.003017307,0.00002269742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5677626,0.0008342954,0.4153451,0.0006530554,0.0001508214,0.000128763,0.001622224,0.001716466,0.01178675],"genre_scores_gemma":[0.929145,0.0002731106,0.06377114,0.0001505462,0.0001897338,0.0000997522,0.002423752,0.0003280389,0.003618974],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006023108,"threshold_uncertainty_score":0.02014929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295570425","doi":"10.19086/da990","title":"New bounds on curve tangencies and orthogonalities","year":2016,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete geometry; Incidence (geometry); Plane (geometry); Discrete mathematics; Geometry","authors":[{"name":"Jordan S. Ellenberg","is_ca":false},{"name":"József Solymosi","is_ca":true},{"name":"Joshua Zahl","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0123268489345744,"gpt":0.2466337477394108,"spread":0.2343068988048364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002116731,0.002012448,0.001983222,0.007043187,0.002954038,0.006315337,0.002194425,0.00187697,0.02415512],"category_scores_gemma":[0.01579787,0.001236419,0.001703081,0.005314834,0.00595318,0.0235038,0.007810237,0.008989302,0.002837192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002694967,"about_ca_system_score_gemma":0.0006462886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001398845,"about_ca_topic_score_gemma":0.001435538,"domain_scores_codex":[0.9975374,0.0004568777,0.0001208649,0.0005842473,0.000881266,0.0004193569],"domain_scores_gemma":[0.9876794,0.006854071,0.001547277,0.001189463,0.00109211,0.001637652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000703231,0.00005504909,0.001481779,0.0001128753,0.00002217031,0.00009483552,0.0002628841,0.00331667,0.00055707,0.9706116,0.005966924,0.01744771],"study_design_scores_gemma":[0.00001041268,0.00002825805,0.0007798856,0.00004971977,0.00002413377,0.0001629628,0.0001182499,0.01180159,0.0002448112,0.9776909,0.009067602,0.00002152839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.2826852,0.02139053,0.3228607,0.01076843,0.001751951,0.0001324999,0.001646781,0.000693915,0.35807],"genre_scores_gemma":[0.8622561,0.01309266,0.05480008,0.001412326,0.004472382,0.0003104202,0.00226119,0.0007692272,0.0606256],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02415512,"threshold_uncertainty_score":0.08080691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2609364824","doi":"10.19086/da.4438","title":"On the number of points in general position in the plane","year":2018,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Illinois at Urbana-Champaign; National Science Foundation","keywords":"General position; Clique; Collinearity; Type (biology); Plane (geometry); Upper and lower bounds; Position (finance); Discrete geometry","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01089232669349887,"gpt":0.2775875377245725,"spread":0.2666952110310736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003813481,0.001539097,0.004041713,0.004775981,0.00470097,0.009288132,0.006861166,0.004518945,0.01778877],"category_scores_gemma":[0.03999044,0.00208001,0.002305667,0.004145002,0.009045612,0.02225087,0.006714534,0.005924093,0.002060673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003388521,"about_ca_system_score_gemma":0.0009616658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003872013,"about_ca_topic_score_gemma":0.002320998,"domain_scores_codex":[0.9953441,0.00132708,0.0002165117,0.001465927,0.0009626503,0.0006836434],"domain_scores_gemma":[0.9631855,0.02451807,0.003730085,0.002813817,0.001765926,0.003986537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008257826,0.0001290522,0.01338753,0.0004926851,0.000224515,0.0003193056,0.0009432074,0.02925617,0.001732907,0.9164083,0.01437178,0.02190876],"study_design_scores_gemma":[0.0001516678,0.00009455621,0.005903841,0.0001889135,0.0001457586,0.0007287078,0.0006482743,0.06837969,0.0008377528,0.9142444,0.008572307,0.000104167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6848865,0.01325095,0.1881333,0.01933971,0.0008099483,0.0001596462,0.004742321,0.0005850547,0.08809266],"genre_scores_gemma":[0.9434777,0.006094072,0.02701533,0.001338645,0.001349219,0.0003838669,0.002832616,0.0003755644,0.01713285],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01778877,"threshold_uncertainty_score":0.05950934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754430485","doi":"10.19086/da.11075","title":"Diophantine equations in semiprimes","year":2019,"lang":"en","type":"paratext","venue":"Discrete Analysis","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Diophantine equation; Integer (computer science); Mathematics; Product (mathematics); Homogeneous; Prime (order theory); Degree (music); Combinatorics; Pure mathematics; Discrete mathematics; Physics; Geometry; Computer science","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.05122303814414298,"gpt":0.3874153951397489,"spread":0.336192356995606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164741,0.0005741959,0.00043351,0.000677435,0.0005573916,0.001310997,0.0004001359,0.0005135527,0.009389418],"category_scores_gemma":[0.001255345,0.0003019014,0.0005523165,0.0009443306,0.001424338,0.002693159,0.0008928073,0.002177391,0.001734058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001497146,"about_ca_system_score_gemma":0.0004329632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008749127,"about_ca_topic_score_gemma":0.001270345,"domain_scores_codex":[0.9997842,0.00005854434,0.00001205652,0.00004206308,0.00008329444,0.00001989276],"domain_scores_gemma":[0.9997897,0.0001137879,0.00002197687,0.00002410219,0.00003286461,0.00001758662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002577611,0.00001755905,0.0001182221,0.00007678201,0.00000897092,0.00004511057,0.0001821206,0.001484687,0.0006424475,0.9714233,0.01135989,0.01461507],"study_design_scores_gemma":[0.00001089462,0.00001437459,0.0003466778,0.00003800652,0.000007637441,0.0001271231,0.00007387831,0.004997491,0.0002797068,0.9382177,0.05587693,0.000009469048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1227702,0.1300929,0.2362171,0.027569,0.009262753,0.00006722973,0.001184426,0.0004022181,0.4724342],"genre_scores_gemma":[0.7146547,0.04388681,0.05406084,0.003259055,0.006268446,0.0001065794,0.001014945,0.0002532105,0.1764953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009389418,"threshold_uncertainty_score":0.03141075,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Swastik Kopparty","is_ca":true},{"name":"Guy Moshkovitz","is_ca":false},{"name":"Jeroen Zuiddam","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05250372097642014,"gpt":0.3574453367856347,"spread":0.3049416158092145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001396205,0.001295893,0.0009347369,0.001684858,0.001224483,0.004174032,0.000670897,0.001228859,0.009606267],"category_scores_gemma":[0.005323349,0.0005492074,0.001084842,0.001844478,0.004819536,0.01076037,0.002246945,0.003421127,0.004702865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001698398,"about_ca_system_score_gemma":0.0007264873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009925469,"about_ca_topic_score_gemma":0.001324857,"domain_scores_codex":[0.9985403,0.000380327,0.00008468788,0.0004068301,0.0004397278,0.0001481633],"domain_scores_gemma":[0.9980787,0.0006374189,0.0002571918,0.0004068474,0.00042841,0.0001913873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004074524,0.00001126972,0.0002643828,0.00007467664,0.00001158751,0.00006837861,0.0001766584,0.001097452,0.0005159575,0.9577276,0.02318818,0.01682308],"study_design_scores_gemma":[0.000004830755,0.00001804055,0.0003327214,0.00002936907,0.000006739063,0.0001983873,0.00007859465,0.003238902,0.0004131578,0.9562448,0.03941238,0.00002209498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03620142,0.03912695,0.6813576,0.01990256,0.007326545,0.00009434467,0.002186419,0.001554718,0.2122494],"genre_scores_gemma":[0.6450622,0.0242709,0.190893,0.007598066,0.0145341,0.0002196617,0.003139638,0.001887953,0.1123945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009606267,"threshold_uncertainty_score":0.0321362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3046477764","doi":"10.19086/da.12058","title":"Finitely forcible graphons with an almost arbitrary structure","year":2020,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; European Commission; Leverhulme Trust; National Science Foundation","keywords":"Combinatorics; Mathematics; Statement (logic); Graph; Random graph; Discrete mathematics","authors":[{"name":"Jonathan A. Noel","is_ca":true},{"name":"Daniel Král͏̌","is_ca":false},{"name":"László Lovász","is_ca":true},{"name":"Jakub Sosnovec","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03519003951355038,"gpt":0.2907537146227275,"spread":0.2555636751091771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064475,0.0005032778,0.0007490006,0.001774092,0.002062656,0.002924581,0.001094043,0.001514909,0.00497112],"category_scores_gemma":[0.005436253,0.0005122134,0.0008722982,0.0008160002,0.003821498,0.004889726,0.0027983,0.002692705,0.0008893471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001829282,"about_ca_system_score_gemma":0.0007220082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008875047,"about_ca_topic_score_gemma":0.001231792,"domain_scores_codex":[0.9983683,0.0004863415,0.00007406644,0.0003968729,0.0004322382,0.0002421581],"domain_scores_gemma":[0.9937762,0.003364537,0.0006199377,0.0007598461,0.0007184014,0.000761132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001795969,0.000011071,0.0001077681,0.00001314023,0.000004681305,0.00006011927,0.00008963932,0.0005398457,0.000498722,0.9972925,0.000455264,0.0009093279],"study_design_scores_gemma":[0.00002014439,0.00002529444,0.0001873925,0.00001283279,0.000005669843,0.00009980771,0.00004637529,0.006487845,0.0005549301,0.9898806,0.002666667,0.00001252436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5996611,0.001423368,0.2568996,0.006334087,0.0004293346,0.0001041827,0.0007075784,0.0008522662,0.1335886],"genre_scores_gemma":[0.9300017,0.0003377634,0.03023671,0.0009310376,0.0002830601,0.0001654876,0.0005108033,0.0001311901,0.03740225],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00497112,"threshold_uncertainty_score":0.01663005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2543706324","doi":"10.19086/da.3118","title":"Rank bounds for design matrices with block entries and geometric applications","year":2018,"lang":"en","type":"preprint","venue":"Discrete Analysis","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Collinearity; Combinatorics; Linear subspace; Rank (graph theory); Upper and lower bounds; Matrix (chemical analysis); Scalar (mathematics); Scaling; Discrete mathematics; Pure mathematics; Geometry","authors":[{"name":"Zeev Dvir","is_ca":false},{"name":"Ankit Garg","is_ca":false},{"name":"Rafael Oliveira","is_ca":true},{"name":"József Solymosi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01731660051463633,"gpt":0.2698239929125862,"spread":0.2525073923979499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004676399,0.003002852,0.001754984,0.002214439,0.001065288,0.003340903,0.001631951,0.001720068,0.01866299],"category_scores_gemma":[0.02872506,0.001089581,0.001382762,0.002161473,0.003624266,0.005826552,0.003095677,0.004984473,0.003845599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0020515,"about_ca_system_score_gemma":0.001313457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009226266,"about_ca_topic_score_gemma":0.001251062,"domain_scores_codex":[0.9955027,0.001616544,0.0001894288,0.0006759356,0.001509963,0.000505432],"domain_scores_gemma":[0.9753252,0.0156574,0.002411013,0.002977724,0.002709695,0.0009189497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001932076,0.0001173027,0.0008160715,0.0005440321,0.00008372134,0.0002001308,0.0001831522,0.06985297,0.004888243,0.8674069,0.01330743,0.04240698],"study_design_scores_gemma":[0.00003495171,0.000228167,0.0005570754,0.000138024,0.00004849914,0.0002873826,0.00008027238,0.179109,0.002085593,0.8043087,0.01306374,0.00005852044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02041523,0.006253375,0.932875,0.00182548,0.0003602995,0.0001266824,0.000629021,0.0005553341,0.03695957],"genre_scores_gemma":[0.6839346,0.01174144,0.2624662,0.002445613,0.002564538,0.0008676675,0.001837442,0.0007754233,0.03336708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01866299,"threshold_uncertainty_score":0.0624339,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Matthias Christandl","is_ca":false},{"name":"Itai Leigh","is_ca":false},{"name":"0009-0007-4298-6284","is_ca":false},{"name":"0000-0003-2384-425X","is_ca":false},{"name":"Jeroen Zuiddam","is_ca":false},{"name":"0000-0003-0651-6238","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02302623577288685,"gpt":0.3527443798883812,"spread":0.3297181441154943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218109,0.0006973359,0.0005868761,0.001458746,0.001060287,0.003428742,0.0006627056,0.0009091431,0.01001864],"category_scores_gemma":[0.005877866,0.0003851793,0.0009234304,0.001286887,0.00381037,0.007648964,0.001517902,0.002983281,0.002684133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001881561,"about_ca_system_score_gemma":0.0005278956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001011273,"about_ca_topic_score_gemma":0.001110229,"domain_scores_codex":[0.9988378,0.0003221226,0.00005936452,0.0002897173,0.0003539475,0.0001370315],"domain_scores_gemma":[0.9983348,0.0005922337,0.000186378,0.0003604051,0.0003573415,0.0001687556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001941531,0.000008104101,0.0001916326,0.00002779757,0.000004813024,0.00002784607,0.0001165087,0.0005206793,0.0002953813,0.9881955,0.005400341,0.005192014],"study_design_scores_gemma":[0.000003066012,0.000009287463,0.000299846,0.00001212509,0.000003486707,0.00008354142,0.00004343022,0.002623678,0.000169201,0.9850734,0.01166804,0.0000109085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1259466,0.0242871,0.4963321,0.01703061,0.005319103,0.00004780554,0.002211941,0.001030067,0.3277946],"genre_scores_gemma":[0.8710075,0.007232376,0.0511455,0.003263762,0.006161712,0.00008491501,0.00115996,0.0006511035,0.05929321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001864,"threshold_uncertainty_score":0.03351569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}