{"meta":{"query_hash":"cbb3ce52aaf2","filters":{"venue":"Discrete Analysis"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"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/cbb3ce52aaf2","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02151046206878525,"score_gpt":0.28861734320284294,"score_spread":0.26710688113405767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864140179","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.99114823,0.0001860628,0.0055779456,0.0005876824,0.00004038662,0.00009390824,0.00001374042,0.000059050937,0.0022929665],"genre_scores_gemma":[0.9955304,0.00004986709,0.0029690235,0.00004017358,0.0000495576,0.0000071949753,0.000002390201,0.000012407271,0.0013389403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915737,0.00006239823,0.0002010747,0.00025337064,0.00015378912,0.00017202189],"domain_scores_gemma":[0.9990482,0.00028515002,0.00008514044,0.0004768838,0.000044332886,0.000060302755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002341055,0.00012302466,0.00028871556,0.00017794892,0.00012628132,0.000023789516,0.00012624612,0.000043266315,0.00017358451],"category_scores_gemma":[0.0004416231,0.00006353624,0.00013449465,0.0004588795,0.000112668524,0.00009552504,0.000084998144,0.00003599652,0.0000060783555],"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.00004050548,0.00004928327,0.04824511,0.0002002867,0.0057408884,0.000018455325,0.0028366332,0.000003364405,0.00566689,0.9182885,0.0015626798,0.017347394],"study_design_scores_gemma":[0.00036691385,0.00003790723,0.020936698,0.00003789354,0.0030485708,0.000004046536,0.00018878533,0.0003224667,0.0034968322,0.9706147,0.00060301606,0.0003421937],"about_ca_topic_score_codex":0.0000093181925,"about_ca_topic_score_gemma":0.000015896658,"teacher_disagreement_score":0.052326165,"about_ca_system_score_codex":0.000010612961,"about_ca_system_score_gemma":0.00000601379,"threshold_uncertainty_score":0.25909325},"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,"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; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete geometry; Incidence (geometry); Plane (geometry); Discrete mathematics; Geometry","score_opus":0.012326848934574397,"score_gpt":0.2466337477394108,"score_spread":0.2343068988048364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295570425","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.07649968,0.00024673954,0.9191919,0.0024415457,0.00006376874,0.000028406224,0.0000076578135,0.000046386576,0.0014738976],"genre_scores_gemma":[0.9844557,0.00005267086,0.009178972,0.00025985632,0.00009011874,0.0000034921288,0.000010874231,0.000002784147,0.005945534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99918777,0.000044335204,0.00013125199,0.00027191828,0.00023847446,0.00012624574],"domain_scores_gemma":[0.99940234,0.0001672717,0.000049525534,0.00023993621,0.00005310839,0.0000878158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015182298,0.00008852771,0.00013021636,0.00027043116,0.00010559868,0.00013977641,0.00018208406,0.000024011804,0.000087756925],"category_scores_gemma":[0.000049272603,0.000057425645,0.00010424745,0.00087190623,0.00002554971,0.00032630106,0.00007089856,0.000023970222,0.000027025017],"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.000016858821,0.000022662553,0.021138513,0.0000066017938,0.00095377804,0.00000857085,0.0009865557,0.0017976747,0.0014934357,0.7234993,0.0028869316,0.24718912],"study_design_scores_gemma":[0.001858957,0.00074116356,0.55023015,0.000090270885,0.0014655271,0.000015459269,0.00032085073,0.12992598,0.012561962,0.17686808,0.123972446,0.0019491373],"about_ca_topic_score_codex":0.000049262733,"about_ca_topic_score_gemma":0.000090343194,"teacher_disagreement_score":0.91001296,"about_ca_system_score_codex":0.000016901258,"about_ca_system_score_gemma":0.00004148422,"threshold_uncertainty_score":0.23417498},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017316600514636328,"score_gpt":0.26982399291258624,"score_spread":0.2525073923979499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543706324","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.0032317366,0.001904662,0.9934852,0.00040483894,0.000057499918,0.0006805191,0.000056125835,0.00008619323,0.000093210736],"genre_scores_gemma":[0.55460656,0.00033855232,0.44310683,0.000098961464,0.00028304112,0.0007112085,0.00041081107,0.000014483814,0.00042955045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982408,0.00007163652,0.00031345387,0.00079604826,0.00035370735,0.00022433819],"domain_scores_gemma":[0.9980805,0.00045073684,0.00030663615,0.0006307251,0.00042742566,0.0001039997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047567615,0.00024443373,0.00040860992,0.001582386,0.00034455286,0.0007602458,0.0005964204,0.00011915813,0.000009990924],"category_scores_gemma":[0.000050277657,0.00020528688,0.00021195333,0.0040226285,0.00007957464,0.00021292787,0.00037886386,0.00011157575,0.00000614836],"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.00018224193,0.00024209725,0.005369647,0.000600842,0.012033636,0.000006771534,0.0013675657,0.88919014,0.000087297056,0.023764629,0.0036559554,0.06349918],"study_design_scores_gemma":[0.00050711527,0.00022266217,0.0029389255,0.000026747002,0.0038875204,0.000005350925,0.000035370238,0.9613285,0.0007277469,0.01939954,0.010190432,0.00073009543],"about_ca_topic_score_codex":0.00003156256,"about_ca_topic_score_gemma":0.000019107438,"teacher_disagreement_score":0.55137485,"about_ca_system_score_codex":0.000037255264,"about_ca_system_score_gemma":0.00015163595,"threshold_uncertainty_score":0.8371356},"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,"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; 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","score_opus":0.010892326693498868,"score_gpt":0.2775875377245725,"score_spread":0.26669521103107363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609364824","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.910063,0.0000068932245,0.08562255,0.0023448565,0.000029067001,0.000051613853,0.000002786021,0.0000041761677,0.0018750244],"genre_scores_gemma":[0.9974885,0.0000020432421,0.0015865314,0.00079377403,0.000043174194,0.0000058486567,0.000025515266,0.0000011512564,0.000053484015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922836,0.0001719301,0.00015614537,0.0001408266,0.00021883468,0.00008390848],"domain_scores_gemma":[0.99947065,0.00017763191,0.000053513108,0.00025053901,0.000037444566,0.00001021415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047526014,0.000050636074,0.00008672444,0.00017757177,0.00004800737,0.000040379007,0.00031629027,0.000018550812,0.00006407879],"category_scores_gemma":[0.000034498345,0.000028881312,0.00006578207,0.0018953836,0.000026917995,0.00009839238,0.000032044554,0.000052951655,0.000026596632],"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.000047445246,0.0001899293,0.041367594,0.0000049818036,0.000250738,0.0000143472635,0.006197429,0.03272137,0.0010694172,0.9116546,0.0008748245,0.0056073614],"study_design_scores_gemma":[0.00021813727,0.00006603128,0.3065342,0.000010346149,0.000060047372,0.0000030963936,0.00009880067,0.6525902,0.0020272504,0.038167994,0.00011287944,0.00011100672],"about_ca_topic_score_codex":0.00015686186,"about_ca_topic_score_gemma":0.0002902448,"teacher_disagreement_score":0.8734866,"about_ca_system_score_codex":0.00001351965,"about_ca_system_score_gemma":0.000012119296,"threshold_uncertainty_score":0.117774576},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05122303814414298,"score_gpt":0.38741539513974893,"score_spread":0.33619235699560596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754430485","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.009475547,0.0021541996,0.13782236,0.0006941369,0.0005475968,0.0011631466,0.0008329428,0.00008993849,0.8472201],"genre_scores_gemma":[0.28458512,0.00023362678,0.0005539661,0.00004010439,0.00017730212,0.000050718107,0.0013163128,0.0000821536,0.7129607],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965663,0.0003995176,0.0008490438,0.0007406208,0.0008287734,0.0006157601],"domain_scores_gemma":[0.99583745,0.0019975745,0.00039298157,0.001467968,0.00017701702,0.00012702394],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001105242,0.00044252462,0.0016167727,0.0018781836,0.00007651214,0.000114240924,0.00078203884,0.0003861803,0.026106663],"category_scores_gemma":[0.00096659665,0.00038746189,0.0010064912,0.0035487118,0.000108186025,0.000118035154,0.00028962336,0.00070753455,0.018130474],"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.00028676467,0.0011471072,0.012827451,0.0030222398,0.0607608,0.00018168626,0.003771271,0.013170298,0.0004154804,0.16330314,0.7395437,0.0015701165],"study_design_scores_gemma":[0.007243657,0.00042252097,0.0015588442,0.0027004387,0.066579536,0.000009159232,0.0067464868,0.37883115,0.0020799662,0.30025744,0.22257541,0.010995391],"about_ca_topic_score_codex":0.0004640755,"about_ca_topic_score_gemma":0.0005273176,"teacher_disagreement_score":0.51696825,"about_ca_system_score_codex":0.00018267553,"about_ca_system_score_gemma":0.00022114582,"threshold_uncertainty_score":0.9998577},"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,"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":"Automorphism; Mathematics; Sigma; Combinatorics; Bijection; Discrete mathematics; Invariant (physics); Dynamical systems theory; Type (biology); Alphabet; Physics","score_opus":0.024675517939264393,"score_gpt":0.2872768801559658,"score_spread":0.26260136221670144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963809654","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.32520163,0.000052623214,0.6741138,0.00035292812,0.000021619995,0.000038820443,0.0000069197076,0.00007478264,0.0001368781],"genre_scores_gemma":[0.97210455,0.000009889664,0.02775962,0.000041698568,0.000028465407,0.0000021014803,0.0000054872958,0.0000058323503,0.000042332682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866974,0.00006358177,0.0003393928,0.00039566986,0.00028950072,0.0002421316],"domain_scores_gemma":[0.99867654,0.00021622036,0.00019265358,0.00075225416,0.000074804324,0.000087545806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021413356,0.00011994479,0.00029101185,0.00022515215,0.000119053766,0.00005930861,0.0007932874,0.000047660706,0.000049911458],"category_scores_gemma":[0.00004071949,0.00008463595,0.00028072452,0.0015544555,0.00010988386,0.00029699013,0.00034495487,0.000049419785,0.000024757128],"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.000018083372,0.00027099447,0.094169445,0.00006748476,0.0020580217,0.000036627596,0.0012467236,0.004258857,0.28591263,0.54701596,0.00020466522,0.06474049],"study_design_scores_gemma":[0.00020442181,0.00002199517,0.068151094,0.00004540346,0.00045626977,0.0000028514082,0.000027778187,0.920617,0.006839757,0.0031314502,0.00024438405,0.00025763141],"about_ca_topic_score_codex":0.000052468356,"about_ca_topic_score_gemma":0.000012804998,"teacher_disagreement_score":0.9163581,"about_ca_system_score_codex":0.000033632834,"about_ca_system_score_gemma":0.00003880186,"threshold_uncertainty_score":0.3451354},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03519003951355038,"score_gpt":0.2907537146227275,"score_spread":0.2555636751091771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046477764","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.9847443,0.000107530694,0.009370248,0.0005104254,0.000036794136,0.00017858,0.0003061096,0.00017994877,0.0045660357],"genre_scores_gemma":[0.98491174,0.000011745495,0.013594999,0.0010660851,0.00011526547,0.0000064393994,0.00017397634,0.000041670228,0.00007806716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998423,0.00010280765,0.0003035635,0.00048663377,0.0003619638,0.00032204986],"domain_scores_gemma":[0.99865794,0.00017356084,0.00015716521,0.0006588294,0.00007177673,0.0002807521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009861221,0.00028800705,0.00053888804,0.00024388301,0.0003175965,0.00007981164,0.00042526468,0.000114574446,0.0008286494],"category_scores_gemma":[0.00009730367,0.00019310888,0.00038403095,0.001977826,0.00013796423,0.000242704,0.00008695193,0.00027741128,0.0000030610254],"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.0009675893,0.00012818836,0.0933628,0.00027976237,0.01532565,0.00022303386,0.019894864,0.0019273364,0.0010954322,0.8630043,0.0022095547,0.0015814619],"study_design_scores_gemma":[0.0011789019,0.0008284174,0.010741169,0.000028577851,0.010679082,0.000013495127,0.003822246,0.016437339,0.0033793868,0.9496696,0.0018566537,0.0013651338],"about_ca_topic_score_codex":0.000036089452,"about_ca_topic_score_gemma":0.00019337842,"teacher_disagreement_score":0.08666527,"about_ca_system_score_codex":0.000008515392,"about_ca_system_score_gemma":0.000025132384,"threshold_uncertainty_score":0.907313},"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":"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}]}