{"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09107636,0.1305591,0.27336007,0.018369906,0.006481348,0.000077288896,0.0028180783,0.0013461234,0.4759117],"genre_scores_gemma":[0.70101666,0.037079364,0.05714376,0.0049778116,0.006408632,0.00014028844,0.0022409938,0.001024243,0.18996818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990331,0.00022004846,0.0000379116,0.00026964655,0.00034412718,0.000095225616],"domain_scores_gemma":[0.9993426,0.00025124376,0.00008221425,0.00014654778,0.00011212574,0.00006525209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068764633,0.00069115474,0.00066924683,0.0013278213,0.0013351478,0.0030206724,0.0006083098,0.00071506546,0.027127717],"category_scores_gemma":[0.0030095421,0.0005467164,0.0007022996,0.0023145569,0.0019247908,0.006415597,0.00180756,0.002237243,0.006131114],"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.000048736685,0.000014226412,0.00025165817,0.00012123695,0.000017050039,0.00005194409,0.0001997943,0.0007606514,0.00068481616,0.9372803,0.028055398,0.032514144],"study_design_scores_gemma":[0.0000042571596,0.000010453578,0.0005044248,0.00004701897,0.000011212935,0.00017605374,0.000084711755,0.0016749064,0.0003629144,0.9365817,0.060529776,0.000012511713],"about_ca_topic_score_codex":0.0014696487,"about_ca_topic_score_gemma":0.0016166891,"teacher_disagreement_score":0.027127717,"about_ca_system_score_codex":0.0017574799,"about_ca_system_score_gemma":0.0005754201,"threshold_uncertainty_score":0.09075123},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2826852,0.021390535,0.32286066,0.010768429,0.0017519506,0.00013249986,0.0016467811,0.000693915,0.35807005],"genre_scores_gemma":[0.86225605,0.013092659,0.054800082,0.0014123259,0.004472382,0.00031042023,0.0022611904,0.00076922716,0.060625598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975374,0.00045687766,0.000120864875,0.00058424735,0.00088126597,0.00041935686],"domain_scores_gemma":[0.9876794,0.0068540713,0.0015472771,0.001189463,0.0010921103,0.0016376524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021167314,0.002012448,0.0019832219,0.0070431866,0.0029540383,0.006315337,0.0021944249,0.0018769698,0.024155121],"category_scores_gemma":[0.015797872,0.0012364191,0.0017030808,0.005314834,0.0059531797,0.023503795,0.0078102374,0.008989302,0.0028371923],"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.0000703231,0.00005504909,0.0014817788,0.00011287533,0.000022170307,0.000094835515,0.0002628841,0.0033166697,0.00055706996,0.97061163,0.0059669237,0.017447712],"study_design_scores_gemma":[0.000010412681,0.000028258048,0.0007798856,0.00004971977,0.000024133766,0.00016296284,0.00011824994,0.011801595,0.00024481124,0.97769094,0.0090676015,0.000021528385],"about_ca_topic_score_codex":0.0013988448,"about_ca_topic_score_gemma":0.0014355376,"teacher_disagreement_score":0.024155121,"about_ca_system_score_codex":0.0026949674,"about_ca_system_score_gemma":0.00064628856,"threshold_uncertainty_score":0.08080691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020415228,0.006253375,0.93287504,0.00182548,0.0003602995,0.00012668237,0.000629021,0.00055533415,0.036959574],"genre_scores_gemma":[0.68393457,0.011741439,0.2624662,0.0024456128,0.0025645378,0.0008676675,0.0018374417,0.0007754233,0.033367082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550265,0.0016165444,0.00018942877,0.0006759356,0.0015099627,0.000505432],"domain_scores_gemma":[0.97532517,0.015657399,0.0024110132,0.0029777237,0.002709695,0.0009189497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046763993,0.0030028522,0.0017549845,0.0022144385,0.0010652879,0.0033409025,0.0016319512,0.0017200682,0.018662995],"category_scores_gemma":[0.02872506,0.001089581,0.0013827624,0.0021614733,0.0036242655,0.005826552,0.003095677,0.0049844733,0.0038455985],"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.00019320757,0.00011730272,0.00081607146,0.0005440321,0.00008372134,0.00020013076,0.0001831522,0.06985297,0.004888243,0.8674069,0.01330743,0.04240698],"study_design_scores_gemma":[0.000034951714,0.00022816696,0.0005570754,0.00013802397,0.000048499143,0.00028738257,0.00008027238,0.17910896,0.002085593,0.8043087,0.013063736,0.00005852044],"about_ca_topic_score_codex":0.00092262664,"about_ca_topic_score_gemma":0.0012510618,"teacher_disagreement_score":0.018662995,"about_ca_system_score_codex":0.0020515,"about_ca_system_score_gemma":0.0013134567,"threshold_uncertainty_score":0.0624339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6848865,0.013250948,0.18813325,0.019339709,0.00080994825,0.00015964624,0.004742321,0.00058505475,0.08809266],"genre_scores_gemma":[0.94347775,0.0060940715,0.027015334,0.0013386451,0.0013492195,0.0003838669,0.0028326162,0.0003755644,0.017132852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953441,0.0013270796,0.00021651175,0.0014659275,0.0009626503,0.0006836434],"domain_scores_gemma":[0.9631855,0.02451807,0.003730085,0.0028138172,0.0017659265,0.0039865375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038134812,0.0015390972,0.004041713,0.0047759814,0.0047009704,0.009288132,0.0068611656,0.0045189452,0.01778877],"category_scores_gemma":[0.03999044,0.0020800103,0.0023056671,0.0041450015,0.009045612,0.022250867,0.006714534,0.005924093,0.0020606734],"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.0008257826,0.00012905222,0.013387531,0.00049268507,0.00022451497,0.0003193056,0.00094320736,0.029256165,0.0017329074,0.9164083,0.014371782,0.021908762],"study_design_scores_gemma":[0.00015166776,0.000094556206,0.0059038405,0.0001889135,0.0001457586,0.0007287078,0.00064827426,0.06837969,0.00083775277,0.91424435,0.008572307,0.00010416698],"about_ca_topic_score_codex":0.0038720127,"about_ca_topic_score_gemma":0.0023209983,"teacher_disagreement_score":0.01778877,"about_ca_system_score_codex":0.0033885206,"about_ca_system_score_gemma":0.00096166576,"threshold_uncertainty_score":0.059509337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12277018,0.13009287,0.23621711,0.027568998,0.009262753,0.00006722973,0.0011844264,0.00040221808,0.47243422],"genre_scores_gemma":[0.71465474,0.043886807,0.05406084,0.0032590549,0.006268446,0.00010657943,0.0010149452,0.00025321054,0.17649531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997842,0.000058544345,0.000012056516,0.000042063082,0.000083294435,0.00001989276],"domain_scores_gemma":[0.99978966,0.000113787886,0.000021976874,0.000024102186,0.00003286461,0.000017586615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164741,0.0005741959,0.00043351,0.000677435,0.0005573916,0.0013109972,0.0004001359,0.00051355275,0.009389418],"category_scores_gemma":[0.0012553446,0.00030190137,0.0005523165,0.0009443306,0.001424338,0.0026931586,0.0008928073,0.002177391,0.0017340578],"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.000025776111,0.000017559049,0.00011822212,0.00007678201,0.00000897092,0.000045110573,0.00018212064,0.0014846871,0.0006424475,0.97142327,0.011359893,0.014615075],"study_design_scores_gemma":[0.000010894619,0.000014374591,0.0003466778,0.000038006525,0.000007637441,0.00012712314,0.000073878306,0.004997491,0.00027970682,0.9382177,0.055876926,0.000009469048],"about_ca_topic_score_codex":0.0008749127,"about_ca_topic_score_gemma":0.0012703454,"teacher_disagreement_score":0.009389418,"about_ca_system_score_codex":0.0014971464,"about_ca_system_score_gemma":0.00043296316,"threshold_uncertainty_score":0.031410754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56776255,0.00083429535,0.41534513,0.00065305544,0.00015082139,0.00012876297,0.0016222245,0.0017164664,0.011786746],"genre_scores_gemma":[0.929145,0.00027311064,0.06377114,0.00015054623,0.0001897338,0.0000997522,0.002423752,0.00032803888,0.0036189738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853814,0.00028722358,0.0001230835,0.0005156857,0.0003241112,0.000211788],"domain_scores_gemma":[0.9946195,0.0027835343,0.0006234675,0.0010738262,0.0004722045,0.0004274593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009804023,0.0008369919,0.000930641,0.0030638436,0.0012818597,0.0037968971,0.0011315893,0.00093539164,0.0060231076],"category_scores_gemma":[0.010990332,0.0005773016,0.0015259411,0.0018006251,0.002215888,0.008105843,0.0033021788,0.001561333,0.0011491528],"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.000683695,0.0003018634,0.024302475,0.000331296,0.0001658297,0.0004339465,0.002486569,0.054831967,0.010044766,0.74150205,0.0065533496,0.15836225],"study_design_scores_gemma":[0.000025226034,0.00005063748,0.00090374827,0.000028897584,0.000023319035,0.0000779793,0.00021501964,0.07665528,0.0016213331,0.91735864,0.0030173075,0.000022697424],"about_ca_topic_score_codex":0.002059255,"about_ca_topic_score_gemma":0.0025567901,"teacher_disagreement_score":0.0060231076,"about_ca_system_score_codex":0.0016260094,"about_ca_system_score_gemma":0.0007360805,"threshold_uncertainty_score":0.02014929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5996611,0.001423368,0.25689957,0.0063340873,0.00042933458,0.000104182654,0.00070757844,0.00085226615,0.13358855],"genre_scores_gemma":[0.93000174,0.00033776337,0.030236714,0.00093103765,0.0002830601,0.00016548755,0.0005108033,0.00013119014,0.037402246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983683,0.00048634148,0.00007406644,0.00039687293,0.00043223816,0.00024215814],"domain_scores_gemma":[0.9937762,0.0033645374,0.0006199377,0.00075984607,0.0007184014,0.000761132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010644747,0.00050327776,0.0007490006,0.0017740916,0.0020626562,0.0029245813,0.0010940431,0.001514909,0.0049711196],"category_scores_gemma":[0.005436253,0.00051221345,0.0008722982,0.0008160002,0.003821498,0.004889726,0.0027983005,0.002692705,0.00088934705],"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.000017959694,0.000011071,0.00010776813,0.000013140232,0.000004681305,0.000060119273,0.000089639325,0.0005398457,0.000498722,0.99729246,0.00045526403,0.00090932794],"study_design_scores_gemma":[0.000020144385,0.000025294443,0.00018739252,0.000012832788,0.000005669843,0.00009980771,0.000046375295,0.0064878454,0.00055493007,0.98988056,0.0026666673,0.000012524357],"about_ca_topic_score_codex":0.00088750466,"about_ca_topic_score_gemma":0.0012317917,"teacher_disagreement_score":0.0049711196,"about_ca_system_score_codex":0.0018292817,"about_ca_system_score_gemma":0.0007220082,"threshold_uncertainty_score":0.016630054},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036201417,0.03912695,0.6813576,0.019902555,0.0073265447,0.00009434467,0.0021864187,0.0015547177,0.21224943],"genre_scores_gemma":[0.6450622,0.024270903,0.19089296,0.007598066,0.014534104,0.00021966167,0.0031396379,0.0018879535,0.11239455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985403,0.00038032702,0.000084687876,0.00040683008,0.0004397278,0.00014816326],"domain_scores_gemma":[0.9980787,0.00063741894,0.00025719177,0.00040684742,0.00042840999,0.00019138733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013962048,0.0012958933,0.00093473686,0.0016848575,0.0012244835,0.0041740322,0.00067089696,0.0012288586,0.009606267],"category_scores_gemma":[0.0053233486,0.00054920744,0.0010848421,0.0018444784,0.0048195357,0.01076037,0.0022469447,0.0034211266,0.004702865],"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.00004074524,0.0000112697235,0.00026438278,0.00007467664,0.000011587512,0.00006837861,0.00017665839,0.0010974525,0.0005159575,0.95772755,0.02318818,0.01682308],"study_design_scores_gemma":[0.0000048307547,0.000018040551,0.00033272136,0.000029369066,0.000006739063,0.00019838732,0.00007859465,0.0032389022,0.00041315777,0.9562448,0.039412376,0.000022094977],"about_ca_topic_score_codex":0.0009925469,"about_ca_topic_score_gemma":0.0013248572,"teacher_disagreement_score":0.009606267,"about_ca_system_score_codex":0.0016983981,"about_ca_system_score_gemma":0.00072648725,"threshold_uncertainty_score":0.0321362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1259466,0.0242871,0.49633214,0.01703061,0.0053191027,0.000047805537,0.002211941,0.0010300665,0.3277946],"genre_scores_gemma":[0.8710075,0.007232376,0.0511455,0.0032637618,0.006161712,0.00008491501,0.00115996,0.0006511035,0.059293207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883777,0.0003221226,0.000059364516,0.00028971728,0.0003539475,0.00013703154],"domain_scores_gemma":[0.9983348,0.0005922337,0.00018637796,0.0003604051,0.0003573415,0.0001687556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181086,0.0006973359,0.0005868761,0.0014587465,0.0010602872,0.003428742,0.0006627056,0.00090914307,0.010018639],"category_scores_gemma":[0.0058778664,0.0003851793,0.00092343043,0.0012868869,0.0038103703,0.0076489644,0.0015179015,0.0029832814,0.0026841327],"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.000019415307,0.000008104101,0.00019163263,0.000027797567,0.0000048130237,0.000027846068,0.00011650873,0.0005206793,0.00029538127,0.98819554,0.0054003415,0.0051920144],"study_design_scores_gemma":[0.0000030660117,0.000009287463,0.000299846,0.000012125086,0.0000034867066,0.00008354142,0.000043430216,0.0026236784,0.00016920098,0.9850734,0.01166804,0.000010908503],"about_ca_topic_score_codex":0.0010112735,"about_ca_topic_score_gemma":0.0011102294,"teacher_disagreement_score":0.010018639,"about_ca_system_score_codex":0.0018815607,"about_ca_system_score_gemma":0.00052789564,"threshold_uncertainty_score":0.03351569},"labels":[],"label_agreement":null}]}