{"meta":{"query_hash":"b63405954d2a","filters":{"venue":"Arkiv för matematik"},"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/b63405954d2a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Arkiv+f%C3%B6r+matematik"},"results":[{"id":"W2016109968","doi":"10.1007/bf02432909","title":"Projections in the space H∞ and the corona theorem for subdomains of coverings of finite bordered Riemann surfaces","year":2004,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Riemann surface; Type (biology); Holomorphic function; Mathematics; Bounded function; Space (punctuation); Domain (mathematical analysis); Covering space; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.022591686986651517,"score_gpt":0.27446723877351864,"score_spread":0.2518755517868671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016109968","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.9276693,0.0012082142,0.052642815,0.000556606,0.000073500785,0.000022191412,0.00019050697,0.000069277005,0.017567564],"genre_scores_gemma":[0.9863353,0.0006156322,0.0075357873,0.000065059605,0.00017338013,0.00002759514,0.0002642698,0.00002512298,0.0049577225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996674,0.00007322682,0.00001418349,0.00007895268,0.000096073534,0.000070173235],"domain_scores_gemma":[0.9993831,0.00018960235,0.00009214827,0.000050556744,0.000092239534,0.00019239998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006106406,0.0004232379,0.000489961,0.0011060528,0.0009991066,0.002414825,0.0004123596,0.000464435,0.0020022925],"category_scores_gemma":[0.0012034125,0.00022503089,0.0006085003,0.0006039347,0.0024783174,0.0028323007,0.0018055189,0.0010363745,0.00019602837],"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.00003729631,0.000023004079,0.00132685,0.00003761501,0.000013720259,0.00016143237,0.00041617185,0.0019718087,0.0024975264,0.98900324,0.00045254888,0.0040587815],"study_design_scores_gemma":[0.000025409594,0.00010297473,0.0041511487,0.000022536376,0.000012622728,0.00035639748,0.00043595885,0.022267444,0.0020699939,0.966122,0.0044103684,0.000023230745],"about_ca_topic_score_codex":0.0008956651,"about_ca_topic_score_gemma":0.0004820378,"teacher_disagreement_score":0.002414825,"about_ca_system_score_codex":0.00084428105,"about_ca_system_score_gemma":0.00042814153,"threshold_uncertainty_score":0.00669837},"labels":[],"label_agreement":null},{"id":"W2049562387","doi":"10.1007/s11512-009-0118-0","title":"Long and short paths in uniform random recursive dags","year":2010,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Directed acyclic graph; Combinatorics; Mathematics; Path (computing); Node (physics); Binary logarithm; Random graph; Root (linguistics); Shortest path problem; Constant (computer programming); Discrete mathematics; Graph; Computer science; Physics","score_opus":0.011368079148865715,"score_gpt":0.2503085451580031,"score_spread":0.23894046600913738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049562387","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.49011943,0.002111064,0.49377626,0.0019787715,0.00010254187,0.00016000652,0.0017079712,0.0010227016,0.009021202],"genre_scores_gemma":[0.94067144,0.0011312362,0.04719181,0.00039678783,0.00010021054,0.00028715967,0.0011375016,0.00031797396,0.008765868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981012,0.0006502157,0.00013304949,0.00042770544,0.00029122992,0.00039666594],"domain_scores_gemma":[0.9726573,0.020433903,0.002740817,0.0017957807,0.0010633552,0.0013087827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037118807,0.0005691598,0.0010613028,0.0034955137,0.0015322807,0.0021534539,0.0018917107,0.0015133296,0.0054557547],"category_scores_gemma":[0.03513972,0.0010812377,0.00090329663,0.0027377347,0.003004833,0.0059467037,0.0027516766,0.0016795133,0.00074087374],"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.00038698397,0.00007961236,0.006217264,0.00031820597,0.000057357618,0.00050156156,0.0009918549,0.15996428,0.0018077403,0.7931849,0.0043930165,0.032097355],"study_design_scores_gemma":[0.00005972787,0.000052216146,0.0011927458,0.00006746595,0.000032611584,0.000246399,0.00017560004,0.26907066,0.0007705416,0.7255554,0.0027351177,0.000041446925],"about_ca_topic_score_codex":0.003654738,"about_ca_topic_score_gemma":0.006794535,"teacher_disagreement_score":0.0054557547,"about_ca_system_score_codex":0.0027683422,"about_ca_system_score_gemma":0.0012418991,"threshold_uncertainty_score":0.020085812},"labels":[],"label_agreement":null},{"id":"W2090455477","doi":"10.1007/bf02390816","title":"Multipliers of spherical harmonics and energy of measures on the sphere","year":2003,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spherical harmonics; Measure (data warehouse); Mathematics; Laplace operator; Spin-weighted spherical harmonics; Spherical mean; Zonal spherical harmonics; Fourier transform; Harmonics; Mathematical analysis; Operator (biology); Energy (signal processing); Unit sphere; Tensor operator; Norm (philosophy); Solid harmonics; Vector spherical harmonics; Physics; Statistics; Quantum mechanics; Computer science","score_opus":0.025614377550238404,"score_gpt":0.2336392700815266,"score_spread":0.2080248925312882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090455477","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.29872793,0.0017364621,0.6664983,0.0010672405,0.00027719743,0.000049043592,0.000118998156,0.000090705485,0.031434126],"genre_scores_gemma":[0.88792324,0.0015201356,0.08350558,0.00020727528,0.00039683934,0.00008382317,0.00013619683,0.00013175093,0.026095197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965584,0.00010065712,0.000018289724,0.00006921996,0.000104400766,0.000051680945],"domain_scores_gemma":[0.9989662,0.00037179503,0.00019605231,0.00006972909,0.00020741245,0.00018878815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033371,0.0006910086,0.00038494144,0.0016700902,0.0004891306,0.0012248883,0.00069342006,0.00083589635,0.0031589018],"category_scores_gemma":[0.0033507356,0.00026192196,0.00048703427,0.00060523633,0.0015502445,0.002910423,0.0017349453,0.0010247119,0.00043423314],"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.000019855217,0.000006659309,0.00015208323,0.000027212884,0.0000057463085,0.000051980427,0.000100021614,0.0052658753,0.003151597,0.9874507,0.00025753942,0.0035106053],"study_design_scores_gemma":[0.000011970437,0.000060341004,0.0006663912,0.000024075216,0.000007224094,0.00024223868,0.000160626,0.115045674,0.0027409438,0.8778486,0.0031614194,0.000030375208],"about_ca_topic_score_codex":0.00062154565,"about_ca_topic_score_gemma":0.00045707577,"teacher_disagreement_score":0.0031589018,"about_ca_system_score_codex":0.00081805675,"about_ca_system_score_gemma":0.0003486837,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2092096082","doi":"10.1007/s11512-007-0045-x","title":"On the computational complexity of the Riemann mapping","year":2007,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DTIME; Time hierarchy theorem; Turing machine; Computational complexity theory; Boundary (topology); Computer science; Mathematics; Domain (mathematical analysis); Riemann hypothesis; Theoretical computer science; Upper and lower bounds; NSPACE; Algorithm; Discrete mathematics; Computation; Pure mathematics; Universal Turing machine; Mathematical analysis","score_opus":0.06487436475940916,"score_gpt":0.27196878163441784,"score_spread":0.20709441687500868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092096082","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.4216048,0.0023946683,0.5030166,0.010585206,0.00021758462,0.00020533633,0.00093507353,0.0009411976,0.06009954],"genre_scores_gemma":[0.9030901,0.001324669,0.085861504,0.00048420933,0.00033275792,0.00031887292,0.00088587054,0.0003408793,0.0073609785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959466,0.0014025572,0.0001905146,0.00069863955,0.0010440082,0.0007176629],"domain_scores_gemma":[0.96976376,0.02598774,0.00075927266,0.0023602007,0.00064113265,0.0004878082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035485597,0.0010306465,0.0016746616,0.0013497318,0.0020855414,0.0054679886,0.0028247947,0.0020009056,0.010040731],"category_scores_gemma":[0.0294599,0.00062622223,0.0017068222,0.0022804746,0.0056555653,0.015475608,0.005807863,0.0055318247,0.00089221983],"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.00044479128,0.000108228785,0.0013607692,0.00028417516,0.000042982745,0.00012780543,0.00038659835,0.113290034,0.0021361285,0.8549935,0.0032530483,0.023571832],"study_design_scores_gemma":[0.000043449818,0.00003487464,0.00044186716,0.000032510026,0.000024119527,0.000056060548,0.00009255505,0.2407746,0.0011922759,0.7557483,0.0015364296,0.000022950924],"about_ca_topic_score_codex":0.0029347285,"about_ca_topic_score_gemma":0.0017870237,"teacher_disagreement_score":0.010040731,"about_ca_system_score_codex":0.0037264677,"about_ca_system_score_gemma":0.0018150493,"threshold_uncertainty_score":0.0335896},"labels":[],"label_agreement":null},{"id":"W2158646882","doi":"10.1007/s11512-010-0139-8","title":"Percolation in invariant Poisson graphs with i.i.d. degrees","year":2011,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vetenskapsrådet; Göran Gustafssons Stiftelser","keywords":"Mathematics; Invariant (physics); Poisson distribution; Combinatorics; Discrete mathematics; Random graph; Homogeneous; Graph; Pure mathematics","score_opus":0.06135040055700381,"score_gpt":0.26922595059207044,"score_spread":0.20787555003506664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158646882","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.54451716,0.0004534562,0.4448972,0.0013998653,0.000078207326,0.00012777268,0.00049038185,0.0004013522,0.0076344926],"genre_scores_gemma":[0.9759911,0.0003383503,0.018089598,0.00015597763,0.00007280447,0.00012700776,0.0002184185,0.000060873346,0.00494577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981895,0.0005583612,0.00011228821,0.00042587274,0.00032120085,0.00039270296],"domain_scores_gemma":[0.99001676,0.005358621,0.0018868326,0.001128019,0.00055805314,0.0010517206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035007028,0.00072893314,0.0017785634,0.0028904963,0.0016551324,0.0029045797,0.0024515616,0.0016292033,0.0032102785],"category_scores_gemma":[0.015638422,0.0008797353,0.0016429722,0.001801695,0.004719581,0.0033396962,0.0027405247,0.001870392,0.0005586945],"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.00013333197,0.000043385407,0.0016717867,0.000044016673,0.000035738885,0.0002776625,0.00035886513,0.038325235,0.0019247045,0.95312613,0.0006582254,0.0034008324],"study_design_scores_gemma":[0.00008547086,0.000047776295,0.0010497788,0.000020813857,0.00003292004,0.0001987132,0.00012559403,0.36926642,0.0009800798,0.6274019,0.00074224145,0.000048315687],"about_ca_topic_score_codex":0.002833032,"about_ca_topic_score_gemma":0.0024526708,"teacher_disagreement_score":0.0035007028,"about_ca_system_score_codex":0.0033528765,"about_ca_system_score_gemma":0.0008801625,"threshold_uncertainty_score":0.02432698},"labels":[],"label_agreement":null},{"id":"W2503127193","doi":"10.1007/s11512-016-0238-2","title":"Restrictions of Riesz–Morrey potentials","year":2016,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Advanced Harmonic Analysis Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Riesz potential; Mathematics; Mathematical analysis","score_opus":0.05843338300354121,"score_gpt":0.3555368510645046,"score_spread":0.2971034680609634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503127193","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.34175187,0.003058045,0.4750097,0.0031126144,0.00059685187,0.00009767976,0.0006201935,0.00036825973,0.17538464],"genre_scores_gemma":[0.9527147,0.0019685028,0.017418569,0.00035136926,0.0005549442,0.00008807329,0.00046292253,0.00021130969,0.02622972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989926,0.00029730974,0.00005304531,0.0001352894,0.0003689929,0.00015289751],"domain_scores_gemma":[0.9982596,0.00074099883,0.00018235072,0.00019280217,0.00030572823,0.00031856925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210254,0.00064636435,0.0006835236,0.0016217559,0.0007159041,0.0014965843,0.00082258304,0.00066780625,0.006899544],"category_scores_gemma":[0.004776206,0.00030317568,0.0007763075,0.00051262934,0.0016450641,0.0038722723,0.0036148555,0.0026159263,0.00091487117],"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.000022741966,0.000013568741,0.00017980917,0.00005256774,0.000009134781,0.00017507964,0.00007289042,0.002342074,0.0028534885,0.9894785,0.00071161124,0.004088535],"study_design_scores_gemma":[0.00001252757,0.00004543908,0.0008220319,0.000038355684,0.000011477836,0.0007451184,0.00018318447,0.045368925,0.0024344984,0.9445966,0.0057089585,0.000032848428],"about_ca_topic_score_codex":0.0006455102,"about_ca_topic_score_gemma":0.00042162655,"teacher_disagreement_score":0.006899544,"about_ca_system_score_codex":0.0005541914,"about_ca_system_score_gemma":0.0006158929,"threshold_uncertainty_score":0.023081243},"labels":[],"label_agreement":null},{"id":"W3007853335","doi":"10.4310/arkiv.2021.v59.n2.a6","title":"A Riemann–Roch type theorem for twisted fibrations of moment graphs","year":2021,"lang":"sv","type":"preprint","venue":"Arkiv för matematik","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Riemann hypothesis; Pure mathematics; Moment (physics); Physics; Quantum mechanics","score_opus":0.038150780012252625,"score_gpt":0.30162543550851817,"score_spread":0.26347465549626553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007853335","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.6845803,0.0014591075,0.23143648,0.0023730793,0.00046926158,0.000059801096,0.00025663667,0.00036422221,0.079001],"genre_scores_gemma":[0.9874741,0.00034041397,0.006931463,0.00017106075,0.00022298488,0.000019478368,0.00006526766,0.00004488378,0.0047303913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993424,0.00016234699,0.000034959376,0.00013658997,0.00018441748,0.00013931452],"domain_scores_gemma":[0.99845123,0.00044189912,0.0002985954,0.0002308502,0.00026173453,0.00031568232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009094926,0.00055142015,0.0005301514,0.0020650534,0.00144168,0.00278594,0.00057531724,0.0013011836,0.004273618],"category_scores_gemma":[0.0025400547,0.0002921871,0.0009655217,0.0008229782,0.0031850806,0.0051376927,0.0017922027,0.0017846581,0.00061425386],"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.000011534583,0.000008913201,0.0004174045,0.00002357563,0.000005421536,0.00017516305,0.00021641633,0.0005886319,0.0014499475,0.99404246,0.00036941163,0.0026911523],"study_design_scores_gemma":[0.0000072641046,0.000029086526,0.0008404018,0.000015186894,0.000009395574,0.00062559644,0.00011859196,0.006613501,0.0013843824,0.9879292,0.0024048404,0.000022477978],"about_ca_topic_score_codex":0.00035705115,"about_ca_topic_score_gemma":0.00025202567,"teacher_disagreement_score":0.004273618,"about_ca_system_score_codex":0.00088649394,"about_ca_system_score_gemma":0.00034772186,"threshold_uncertainty_score":0.0142967105},"labels":[],"label_agreement":null},{"id":"W4244777876","doi":"10.1007/bf02385578","title":"Projections in the space H∞ and the corona theorem for subdomains of coverings of finite bordered Riemann surfaces","year":2004,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Riemann surface; Mathematics; Type (biology); Holomorphic function; Bounded function; Space (punctuation); Pure mathematics; Domain (mathematical analysis); Covering space; Mathematical analysis","score_opus":0.022591686986651517,"score_gpt":0.27446723877351864,"score_spread":0.2518755517868671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244777876","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.9276693,0.0012082142,0.052642815,0.000556606,0.000073500785,0.000022191412,0.00019050697,0.000069277005,0.017567564],"genre_scores_gemma":[0.9863353,0.0006156322,0.0075357873,0.000065059605,0.00017338013,0.00002759514,0.0002642698,0.00002512298,0.0049577225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996674,0.00007322682,0.00001418349,0.00007895268,0.000096073534,0.000070173235],"domain_scores_gemma":[0.9993831,0.00018960235,0.00009214827,0.000050556744,0.000092239534,0.00019239998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006106406,0.0004232379,0.000489961,0.0011060528,0.0009991066,0.002414825,0.0004123596,0.000464435,0.0020022925],"category_scores_gemma":[0.0012034125,0.00022503089,0.0006085003,0.0006039347,0.0024783174,0.0028323007,0.0018055189,0.0010363745,0.00019602837],"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.00003729631,0.000023004079,0.00132685,0.00003761501,0.000013720259,0.00016143237,0.00041617185,0.0019718087,0.0024975264,0.98900324,0.00045254888,0.0040587815],"study_design_scores_gemma":[0.000025409594,0.00010297473,0.0041511487,0.000022536376,0.000012622728,0.00035639748,0.00043595885,0.022267444,0.0020699939,0.966122,0.0044103684,0.000023230745],"about_ca_topic_score_codex":0.0008956651,"about_ca_topic_score_gemma":0.0004820378,"teacher_disagreement_score":0.002414825,"about_ca_system_score_codex":0.00084428105,"about_ca_system_score_gemma":0.00042814153,"threshold_uncertainty_score":0.00669837},"labels":[],"label_agreement":null},{"id":"W4367163627","doi":"10.4310/arkiv.2023.v61.n1.a1","title":"Yagita’s counter-examples and beyond","year":2023,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Samsung; Samsung Science and Technology Foundation","keywords":"Political science","score_opus":0.030614536006853432,"score_gpt":0.27724334319249305,"score_spread":0.24662880718563962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367163627","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.3904043,0.012378201,0.051650364,0.03850825,0.0024002627,0.00008920954,0.000675035,0.0010116553,0.50288266],"genre_scores_gemma":[0.95795524,0.0016094103,0.013790766,0.0016970835,0.0003959666,0.00008221745,0.00024964107,0.00011582449,0.024103908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993061,0.00015838502,0.00003341846,0.00018438263,0.00017104254,0.0001465929],"domain_scores_gemma":[0.9990349,0.00030582852,0.00010723916,0.00025258987,0.00017451246,0.00012508506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008227147,0.0005093429,0.0007468755,0.0011961557,0.0038393235,0.0026321283,0.0011182933,0.0023202323,0.00908989],"category_scores_gemma":[0.0032620633,0.00029030142,0.00052538724,0.0011594744,0.0048116017,0.0059257555,0.0038439038,0.0024887316,0.0014823681],"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.00008218073,0.000018469475,0.00070880144,0.000084244406,0.000008019571,0.00033009704,0.001051207,0.00016224726,0.0004949858,0.983286,0.006397771,0.0073758503],"study_design_scores_gemma":[0.00003995658,0.000022242408,0.0008420718,0.00009475349,0.000015699807,0.0011213066,0.0010304197,0.0013390948,0.0013471934,0.9062818,0.08784158,0.00002383858],"about_ca_topic_score_codex":0.00070503156,"about_ca_topic_score_gemma":0.0006641317,"teacher_disagreement_score":0.00908989,"about_ca_system_score_codex":0.0008737256,"about_ca_system_score_gemma":0.00043220687,"threshold_uncertainty_score":0.03040868},"labels":[],"label_agreement":null}]}