{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002341055,0.0001230247,0.0002887156,0.0001779489,0.0001262813,0.00002378952,0.0001262461,0.00004326631,0.0001735845],"category_scores_gemma":[0.0004416231,0.00006353624,0.0001344947,0.0004588795,0.0001126685,0.00009552504,0.00008499814,0.00003599652,0.000006078355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001061296,"about_ca_system_score_gemma":0.00000601379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009318192,"about_ca_topic_score_gemma":0.00001589666,"domain_scores_codex":[0.9991574,0.00006239823,0.0002010747,0.0002533706,0.0001537891,0.0001720219],"domain_scores_gemma":[0.9990482,0.00028515,0.00008514044,0.0004768838,0.00004433289,0.00006030275],"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.00004050548,0.00004928327,0.04824511,0.0002002867,0.005740888,0.00001845532,0.002836633,0.000003364405,0.00566689,0.9182885,0.00156268,0.01734739],"study_design_scores_gemma":[0.0003669139,0.00003790723,0.0209367,0.00003789354,0.003048571,0.000004046536,0.0001887853,0.0003224667,0.003496832,0.9706147,0.0006030161,0.0003421937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9911482,0.0001860628,0.005577946,0.0005876824,0.00004038662,0.00009390824,0.00001374042,0.00005905094,0.002292966],"genre_scores_gemma":[0.9955304,0.00004986709,0.002969024,0.00004017358,0.0000495576,0.000007194975,0.000002390201,0.00001240727,0.00133894],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05232617,"threshold_uncertainty_score":0.2590933,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002141336,0.0001199448,0.0002910118,0.0002251522,0.0001190538,0.00005930861,0.0007932874,0.00004766071,0.00004991146],"category_scores_gemma":[0.00004071949,0.00008463595,0.0002807245,0.001554455,0.0001098839,0.0002969901,0.0003449549,0.00004941978,0.00002475713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003363283,"about_ca_system_score_gemma":0.00003880186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005246836,"about_ca_topic_score_gemma":0.000012805,"domain_scores_codex":[0.9986697,0.00006358177,0.0003393928,0.0003956699,0.0002895007,0.0002421316],"domain_scores_gemma":[0.9986765,0.0002162204,0.0001926536,0.0007522542,0.00007480432,0.00008754581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001808337,0.0002709945,0.09416945,0.00006748476,0.002058022,0.0000366276,0.001246724,0.004258857,0.2859126,0.547016,0.0002046652,0.06474049],"study_design_scores_gemma":[0.0002044218,0.00002199517,0.06815109,0.00004540346,0.0004562698,0.000002851408,0.00002777819,0.920617,0.006839757,0.00313145,0.000244384,0.0002576314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3252016,0.00005262321,0.6741138,0.0003529281,0.00002162,0.00003882044,0.000006919708,0.00007478264,0.0001368781],"genre_scores_gemma":[0.9721045,0.000009889664,0.02775962,0.00004169857,0.00002846541,0.00000210148,0.000005487296,0.00000583235,0.00004233268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9163581,"threshold_uncertainty_score":0.3451354,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000151823,0.00008852771,0.0001302164,0.0002704312,0.0001055987,0.0001397764,0.0001820841,0.0000240118,0.00008775693],"category_scores_gemma":[0.0000492726,0.00005742564,0.0001042474,0.0008719062,0.00002554971,0.0003263011,0.00007089856,0.00002397022,0.00002702502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001690126,"about_ca_system_score_gemma":0.00004148422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004926273,"about_ca_topic_score_gemma":0.00009034319,"domain_scores_codex":[0.9991878,0.0000443352,0.000131252,0.0002719183,0.0002384745,0.0001262457],"domain_scores_gemma":[0.9994023,0.0001672717,0.00004952553,0.0002399362,0.00005310839,0.0000878158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001685882,0.00002266255,0.02113851,0.000006601794,0.000953778,0.00000857085,0.0009865557,0.001797675,0.001493436,0.7234993,0.002886932,0.2471891],"study_design_scores_gemma":[0.001858957,0.0007411636,0.5502301,0.00009027089,0.001465527,0.00001545927,0.0003208507,0.129926,0.01256196,0.1768681,0.1239724,0.001949137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07649968,0.0002467395,0.9191919,0.002441546,0.00006376874,0.00002840622,0.000007657814,0.00004638658,0.001473898],"genre_scores_gemma":[0.9844557,0.00005267086,0.009178972,0.0002598563,0.00009011874,0.000003492129,0.00001087423,0.000002784147,0.005945534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.910013,"threshold_uncertainty_score":0.234175,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004752601,0.00005063607,0.00008672444,0.0001775718,0.00004800737,0.00004037901,0.0003162903,0.00001855081,0.00006407879],"category_scores_gemma":[0.00003449835,0.00002888131,0.00006578207,0.001895384,0.00002691799,0.00009839238,0.00003204455,0.00005295165,0.00002659663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001351965,"about_ca_system_score_gemma":0.0000121193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001568619,"about_ca_topic_score_gemma":0.0002902448,"domain_scores_codex":[0.9992284,0.0001719301,0.0001561454,0.0001408266,0.0002188347,0.00008390848],"domain_scores_gemma":[0.9994707,0.0001776319,0.00005351311,0.000250539,0.00003744457,0.00001021415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004744525,0.0001899293,0.04136759,0.000004981804,0.000250738,0.00001434726,0.006197429,0.03272137,0.001069417,0.9116546,0.0008748245,0.005607361],"study_design_scores_gemma":[0.0002181373,0.00006603128,0.3065342,0.00001034615,0.00006004737,0.000003096394,0.00009880067,0.6525902,0.00202725,0.03816799,0.0001128794,0.0001110067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.910063,0.000006893225,0.08562255,0.002344857,0.000029067,0.00005161385,0.000002786021,0.000004176168,0.001875024],"genre_scores_gemma":[0.9974885,0.000002043242,0.001586531,0.000793774,0.00004317419,0.000005848657,0.00002551527,0.000001151256,0.00005348401],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8734866,"threshold_uncertainty_score":0.1177746,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001105242,0.0004425246,0.001616773,0.001878184,0.00007651214,0.0001142409,0.0007820388,0.0003861803,0.02610666],"category_scores_gemma":[0.0009665966,0.0003874619,0.001006491,0.003548712,0.000108186,0.0001180352,0.0002896234,0.0007075345,0.01813047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001826755,"about_ca_system_score_gemma":0.0002211458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004640755,"about_ca_topic_score_gemma":0.0005273176,"domain_scores_codex":[0.9965663,0.0003995176,0.0008490438,0.0007406208,0.0008287734,0.0006157601],"domain_scores_gemma":[0.9958375,0.001997574,0.0003929816,0.001467968,0.000177017,0.0001270239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002867647,0.001147107,0.01282745,0.00302224,0.0607608,0.0001816863,0.003771271,0.0131703,0.0004154804,0.1633031,0.7395437,0.001570116],"study_design_scores_gemma":[0.007243657,0.000422521,0.001558844,0.002700439,0.06657954,0.000009159232,0.006746487,0.3788311,0.002079966,0.3002574,0.2225754,0.01099539],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.009475547,0.0021542,0.1378224,0.0006941369,0.0005475968,0.001163147,0.0008329428,0.00008993849,0.8472201],"genre_scores_gemma":[0.2845851,0.0002336268,0.0005539661,0.00004010439,0.0001773021,0.00005071811,0.001316313,0.0000821536,0.7129607],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5169683,"threshold_uncertainty_score":0.9998577,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001143624,0.000784388,0.002896601,0.003970596,0.0002717457,0.0001200615,0.001018421,0.0006967657,0.0005669605],"category_scores_gemma":[0.0008967826,0.000797245,0.002593891,0.009158232,0.0004151575,0.0001435958,0.0008164371,0.0006603761,0.0001949133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009547286,"about_ca_system_score_gemma":0.00009803103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006026877,"about_ca_topic_score_gemma":0.00007808184,"domain_scores_codex":[0.9935228,0.0003050645,0.003106112,0.001466427,0.00105923,0.0005403426],"domain_scores_gemma":[0.9900905,0.002476541,0.003194587,0.002812522,0.001111676,0.0003141261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009909431,0.006508461,0.1559479,0.02137484,0.1607999,0.00003686859,0.01963941,0.120827,0.04503478,0.4294418,0.003338323,0.03605969],"study_design_scores_gemma":[0.003732289,0.000325801,0.1891577,0.001254384,0.1344905,0.00001148475,0.004916944,0.4982012,0.02208198,0.1393619,0.002166094,0.00429961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5049475,0.001401663,0.4845765,0.001990592,0.000162699,0.00217325,0.003209393,0.0003203543,0.001218073],"genre_scores_gemma":[0.972053,0.002981689,0.0211919,0.00002244156,0.00009617811,0.0002940223,0.001363819,0.0001192608,0.001877695],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4671055,"threshold_uncertainty_score":0.9994478,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009861221,0.0002880071,0.000538888,0.000243883,0.0003175965,0.00007981164,0.0004252647,0.0001145744,0.0008286494],"category_scores_gemma":[0.00009730367,0.0001931089,0.000384031,0.001977826,0.0001379642,0.000242704,0.00008695193,0.0002774113,0.000003061025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008515392,"about_ca_system_score_gemma":0.00002513238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003608945,"about_ca_topic_score_gemma":0.0001933784,"domain_scores_codex":[0.998423,0.0001028077,0.0003035635,0.0004866338,0.0003619638,0.0003220499],"domain_scores_gemma":[0.9986579,0.0001735608,0.0001571652,0.0006588294,0.00007177673,0.0002807521],"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.0009675893,0.0001281884,0.0933628,0.0002797624,0.01532565,0.0002230339,0.01989486,0.001927336,0.001095432,0.8630043,0.002209555,0.001581462],"study_design_scores_gemma":[0.001178902,0.0008284174,0.01074117,0.00002857785,0.01067908,0.00001349513,0.003822246,0.01643734,0.003379387,0.9496696,0.001856654,0.001365134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9847443,0.0001075307,0.009370248,0.0005104254,0.00003679414,0.00017858,0.0003061096,0.0001799488,0.004566036],"genre_scores_gemma":[0.9849117,0.00001174549,0.013595,0.001066085,0.0001152655,0.000006439399,0.0001739763,0.00004167023,0.00007806716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08666527,"threshold_uncertainty_score":0.907313,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756761,0.0002444337,0.0004086099,0.001582386,0.0003445529,0.0007602458,0.0005964204,0.0001191581,0.000009990924],"category_scores_gemma":[0.00005027766,0.0002052869,0.0002119533,0.004022629,0.00007957464,0.0002129279,0.0003788639,0.0001115757,0.00000614836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003725526,"about_ca_system_score_gemma":0.0001516359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003156256,"about_ca_topic_score_gemma":0.00001910744,"domain_scores_codex":[0.9982408,0.00007163652,0.0003134539,0.0007960483,0.0003537073,0.0002243382],"domain_scores_gemma":[0.9980805,0.0004507368,0.0003066362,0.0006307251,0.0004274257,0.0001039997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001822419,0.0002420972,0.005369647,0.000600842,0.01203364,0.000006771534,0.001367566,0.8891901,0.00008729706,0.02376463,0.003655955,0.06349918],"study_design_scores_gemma":[0.0005071153,0.0002226622,0.002938926,0.000026747,0.00388752,0.000005350925,0.00003537024,0.9613285,0.0007277469,0.01939954,0.01019043,0.0007300954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003231737,0.001904662,0.9934852,0.0004048389,0.00005749992,0.0006805191,0.00005612583,0.00008619323,0.00009321074],"genre_scores_gemma":[0.5546066,0.0003385523,0.4431068,0.00009896146,0.0002830411,0.0007112085,0.0004108111,0.00001448381,0.0004295504],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5513749,"threshold_uncertainty_score":0.8371356,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001564022,0.0001466335,0.0004823205,0.0004354085,0.00011483,0.0000332285,0.0002714462,0.00007257525,0.0005142597],"category_scores_gemma":[0.00012203,0.0001246356,0.0005324189,0.001995228,0.0000866622,0.00006371051,0.00006128295,0.00009104032,0.00002490365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002284023,"about_ca_system_score_gemma":0.00002237459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004388253,"about_ca_topic_score_gemma":0.00005633699,"domain_scores_codex":[0.9988304,0.00005806353,0.0004621368,0.0002756439,0.0001949506,0.0001788545],"domain_scores_gemma":[0.998608,0.0003542631,0.0001573303,0.0006769485,0.0001451912,0.00005825728],"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.00002488483,0.0001681553,0.03597461,0.00008912967,0.003327616,0.000002285263,0.0002168716,0.0003757606,0.002885283,0.9540555,0.001778496,0.001101441],"study_design_scores_gemma":[0.001725231,0.000069243,0.1363695,0.0001764209,0.02469301,0.000002293841,0.001900625,0.0374836,0.03070589,0.757588,0.008148192,0.001138043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5087684,0.0001556535,0.4304864,0.00273837,0.00007937598,0.0003620571,0.0001617701,0.0002345493,0.05701343],"genre_scores_gemma":[0.9887635,0.00001855705,0.007752001,0.0001372699,0.00001705961,0.00003874863,0.00006656971,0.00001104869,0.003195257],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.479995,"threshold_uncertainty_score":0.5630783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}