{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98521364,0.0013587073,0.0024833726,0.0022859657,0.00018962556,0.0036667867,0.00029796278,0.000026545367,0.004477373],"genre_scores_gemma":[0.9970606,0.00037830503,0.0018439889,0.00014161615,0.000032367625,0.0001721487,0.000008633414,0.000045809993,0.00031653588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975073,0.0005355521,0.0009656584,0.00028138823,0.00035354262,0.00035660798],"domain_scores_gemma":[0.9942993,0.0041189874,0.0006620891,0.0007002236,0.00017777407,0.000041623778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003678414,0.00032147957,0.00084543246,0.00009277284,0.0002428017,0.000067763205,0.0004705002,0.00016916971,0.0000566064],"category_scores_gemma":[0.0011840087,0.00018230308,0.00018642544,0.0003645447,0.0011634879,0.00014771394,0.00010754248,0.00024618473,0.000009821327],"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.0004892939,0.0003417239,0.0003274879,0.002861674,0.0001683087,0.0000041185754,0.040620565,0.0004647037,0.00058787694,0.9538547,0.00025198818,0.000027608912],"study_design_scores_gemma":[0.01133904,0.00057699345,0.0019275805,0.0021762408,0.0006072667,0.00006146904,0.059236996,0.0023985477,0.0067847106,0.91341114,0.00095467974,0.00052533986],"about_ca_topic_score_codex":0.00034172466,"about_ca_topic_score_gemma":0.00031928447,"teacher_disagreement_score":0.040443514,"about_ca_system_score_codex":0.00004114741,"about_ca_system_score_gemma":0.00016421222,"threshold_uncertainty_score":0.7434104},"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":"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.92776495,0.0016108573,0.057018597,0.0012041151,0.0039755553,0.00158726,0.00009051635,0.00017508377,0.006573069],"genre_scores_gemma":[0.9797289,0.00044588684,0.018843926,0.0002256111,0.0002033818,0.000041054143,0.000038328915,0.000032535485,0.00044037885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972723,0.00014406072,0.0007297431,0.0007835939,0.00047165493,0.00059863407],"domain_scores_gemma":[0.9979394,0.00031789416,0.00020367792,0.0011645122,0.00011424362,0.00026023487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001217058,0.00037991238,0.00059698895,0.000211165,0.00023436244,0.0005463225,0.0009775251,0.0002585571,0.00018795124],"category_scores_gemma":[0.00014194618,0.00031717046,0.00007835227,0.00040373846,0.00016943486,0.001348336,0.00096564484,0.0006697106,0.00020255461],"study_design_candidate":"design_other","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.0009642067,0.0024861768,0.08422075,0.0052864375,0.00041799797,0.0039346535,0.039022703,0.00022748548,0.0183309,0.19943248,0.028150778,0.61752546],"study_design_scores_gemma":[0.0131074535,0.00079711905,0.30803454,0.0062625404,0.00020062223,0.0011905831,0.0018041756,0.5818183,0.007717801,0.05185537,0.023080649,0.004130854],"about_ca_topic_score_codex":0.00021635085,"about_ca_topic_score_gemma":0.00032769502,"teacher_disagreement_score":0.61339456,"about_ca_system_score_codex":0.000034255972,"about_ca_system_score_gemma":0.00010331161,"threshold_uncertainty_score":0.99992806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027896417,0.0014616163,0.9652957,0.00019900239,0.00027139744,0.00018756588,0.0000047111234,0.000053752698,0.0046298746],"genre_scores_gemma":[0.86244994,0.00015010926,0.13712037,0.00008165171,0.000011716353,0.000014735394,1.9595981e-7,0.000029401115,0.0001418982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787813,0.00016045655,0.0007298586,0.00035843748,0.0005311368,0.00034197664],"domain_scores_gemma":[0.9975439,0.0010339615,0.00033295547,0.0008433897,0.0001351632,0.00011064164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006132284,0.00028927266,0.00055415905,0.000038569775,0.00007855501,0.00004358823,0.0005615537,0.00011493458,0.000048373156],"category_scores_gemma":[0.0008560604,0.00020450183,0.00010800595,0.00030019056,0.00022434541,0.00014080446,0.00015239265,0.00019735003,0.000009785639],"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.000013152167,0.00017328485,0.0000268925,0.0009753658,0.00009654642,0.0000052257897,0.001228966,0.048291042,0.0067302682,0.93868625,0.00015126761,0.003621753],"study_design_scores_gemma":[0.00062775525,0.0002793305,0.00009312741,0.001834989,0.00008107717,0.000029324305,0.0007673766,0.8209476,0.07432929,0.09930277,0.001132955,0.00057440234],"about_ca_topic_score_codex":0.000011579006,"about_ca_topic_score_gemma":0.0000020925117,"teacher_disagreement_score":0.8393835,"about_ca_system_score_codex":0.000034291115,"about_ca_system_score_gemma":0.000054530516,"threshold_uncertainty_score":0.8339343},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4080667,0.00030202582,0.54947644,0.017887125,0.0036110107,0.002369525,0.00006367444,0.00023570826,0.017987816],"genre_scores_gemma":[0.9700417,0.0000028425904,0.027850466,0.0016779524,0.00017375508,0.000013505079,0.0000048882807,0.000026509944,0.00020836451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99458164,0.00080099155,0.00143731,0.0007991383,0.0016040457,0.00077687553],"domain_scores_gemma":[0.9925396,0.0038358737,0.0009436093,0.0020542778,0.0004782561,0.00014841718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048683444,0.0004841079,0.0006461476,0.00015678581,0.0007969254,0.00029759522,0.0032468655,0.00015714396,0.00033065878],"category_scores_gemma":[0.00053859106,0.00029355104,0.00040929927,0.0013771117,0.0013082068,0.00024595286,0.0016181559,0.0006055526,0.00034870484],"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.000022731456,0.0005123823,0.0013216411,0.00051416387,0.00012760705,0.000014573637,0.0049509644,0.006750842,0.00012949602,0.979823,0.0033140818,0.0025185046],"study_design_scores_gemma":[0.00041810793,0.0001242851,0.17964128,0.0005366127,0.00002721654,0.00005172825,0.0004595229,0.2568162,0.0005354965,0.5604249,0.00055744,0.00040722667],"about_ca_topic_score_codex":0.00013594021,"about_ca_topic_score_gemma":0.000058886708,"teacher_disagreement_score":0.561975,"about_ca_system_score_codex":0.00020281551,"about_ca_system_score_gemma":0.0002001468,"threshold_uncertainty_score":0.99995166},"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":"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.31815004,0.0013706088,0.623788,0.00060858903,0.0010699867,0.004689223,0.00027072048,0.00045293578,0.049599897],"genre_scores_gemma":[0.91047823,0.000076097225,0.08870851,0.00010886773,0.000044165907,0.00012772008,0.000014646877,0.00009632084,0.00034540644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968082,0.00016645402,0.0010852662,0.0006118664,0.00059826375,0.0007299891],"domain_scores_gemma":[0.9977656,0.0006573675,0.00048014932,0.0006435462,0.00022536067,0.00022798723],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008161877,0.0005359782,0.0008496548,0.0002901041,0.00015176092,0.000118144315,0.00042231916,0.00030091841,0.0015456369],"category_scores_gemma":[0.0008660239,0.00042713503,0.000092784474,0.00065557926,0.00010921445,0.00034480388,0.00012434169,0.00041144207,0.00041698857],"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.00030968618,0.00068393804,0.0006845725,0.0033148176,0.00012860484,0.00023329134,0.009918557,0.000009576998,0.00020251717,0.98341966,0.00037084118,0.0007239372],"study_design_scores_gemma":[0.0020189406,0.0011034609,0.008019341,0.0039014125,0.00045714385,0.00015678426,0.0039722077,0.03819248,0.0006226593,0.9404357,0.00004804101,0.0010718374],"about_ca_topic_score_codex":0.00039450478,"about_ca_topic_score_gemma":0.00085898273,"teacher_disagreement_score":0.59232825,"about_ca_system_score_codex":0.00010663657,"about_ca_system_score_gemma":0.00014601633,"threshold_uncertainty_score":0.999818},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34480807,0.006937037,0.5461878,0.013480411,0.0022495722,0.0056857276,0.0016458462,0.0008881548,0.07811737],"genre_scores_gemma":[0.9585478,0.0019297878,0.010117794,0.00003422599,0.00016735506,0.0000863397,0.000009451696,0.000118657896,0.0289886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99455816,0.0005605698,0.0019789713,0.0006668344,0.0013134559,0.00092203333],"domain_scores_gemma":[0.99380684,0.002106913,0.0011891249,0.001877171,0.0007206813,0.00029929646],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014455431,0.0004818071,0.0012946122,0.00052312977,0.00028065703,0.000073093,0.0008556547,0.00030114388,0.007091365],"category_scores_gemma":[0.0030829092,0.0003343718,0.0005244807,0.0009888244,0.0005161812,0.0004890272,0.0004531554,0.00030085805,0.0029732997],"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.0003778973,0.0026050746,0.002892114,0.008968129,0.004437764,0.000211503,0.0030689805,0.000114110626,0.20950155,0.65407807,0.098737754,0.015007072],"study_design_scores_gemma":[0.0058087334,0.000717634,0.004998931,0.008608225,0.0029859787,0.00014440464,0.005967757,0.002172321,0.12552051,0.8188464,0.021742206,0.0024868965],"about_ca_topic_score_codex":0.00009723531,"about_ca_topic_score_gemma":0.00004983221,"teacher_disagreement_score":0.6137397,"about_ca_system_score_codex":0.00025054152,"about_ca_system_score_gemma":0.00027599803,"threshold_uncertainty_score":0.99991083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94940406,0.0019034222,0.025012642,0.00081005564,0.0074890885,0.0073241596,0.00038403884,0.00025635905,0.0074161454],"genre_scores_gemma":[0.9835769,0.0002641723,0.01286851,0.00009910851,0.0002489253,0.0004703574,0.00042657583,0.00017562536,0.0018698154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950746,0.00031723708,0.0021352973,0.0009901425,0.0008243208,0.0006583454],"domain_scores_gemma":[0.9937237,0.0010015961,0.0017096645,0.00207418,0.0012855905,0.00020529026],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007779022,0.00087656954,0.0019798423,0.00023982096,0.00025672786,0.00028163995,0.00090494193,0.0007907447,0.0011070906],"category_scores_gemma":[0.0006123743,0.0008040691,0.0009009196,0.0005231153,0.00024984527,0.00015974577,0.0007798812,0.0005206273,0.000033892975],"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.00015167631,0.0003934822,0.000033543078,0.013095283,0.0012116685,0.000006344038,0.006786721,0.00038347728,0.00087880506,0.9747783,0.0021676628,0.000113024216],"study_design_scores_gemma":[0.0011368272,0.00026608506,0.0001610311,0.002646119,0.0008898974,0.000012150785,0.0024159302,0.0031661014,0.0045406483,0.98347706,0.0005151651,0.0007729638],"about_ca_topic_score_codex":0.00006647286,"about_ca_topic_score_gemma":0.000024072673,"teacher_disagreement_score":0.03417282,"about_ca_system_score_codex":0.00015312462,"about_ca_system_score_gemma":0.000513929,"threshold_uncertainty_score":0.99980605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98521364,0.0013587073,0.0024833726,0.0022859657,0.00018962556,0.0036667867,0.00029796278,0.000026545367,0.004477373],"genre_scores_gemma":[0.9970606,0.00037830503,0.0018439889,0.00014161615,0.000032367625,0.0001721487,0.000008633414,0.000045809993,0.00031653588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975073,0.0005355521,0.0009656584,0.00028138823,0.00035354262,0.00035660798],"domain_scores_gemma":[0.9942993,0.0041189874,0.0006620891,0.0007002236,0.00017777407,0.000041623778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003678414,0.00032147957,0.00084543246,0.00009277284,0.0002428017,0.000067763205,0.0004705002,0.00016916971,0.0000566064],"category_scores_gemma":[0.0011840087,0.00018230308,0.00018642544,0.0003645447,0.0011634879,0.00014771394,0.00010754248,0.00024618473,0.000009821327],"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.0004892939,0.0003417239,0.0003274879,0.002861674,0.0001683087,0.0000041185754,0.040620565,0.0004647037,0.00058787694,0.9538547,0.00025198818,0.000027608912],"study_design_scores_gemma":[0.01133904,0.00057699345,0.0019275805,0.0021762408,0.0006072667,0.00006146904,0.059236996,0.0023985477,0.0067847106,0.91341114,0.00095467974,0.00052533986],"about_ca_topic_score_codex":0.00034172466,"about_ca_topic_score_gemma":0.00031928447,"teacher_disagreement_score":0.040443514,"about_ca_system_score_codex":0.00004114741,"about_ca_system_score_gemma":0.00016421222,"threshold_uncertainty_score":0.7434104},"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":"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.92026615,0.0024985448,0.0002476113,0.0020145073,0.0014185292,0.0010247036,0.00027270097,0.0008115145,0.07144571],"genre_scores_gemma":[0.9679861,0.00087270647,0.0010559951,0.00063652225,0.0003061598,0.00007136289,0.000083813684,0.00015728817,0.028830068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964156,0.00031261577,0.0010151127,0.00070150354,0.00063152297,0.00092363625],"domain_scores_gemma":[0.99616176,0.0019809683,0.0004252228,0.0010052416,0.00013639152,0.00029039173],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002187475,0.0006031379,0.0009351319,0.00037685645,0.00041795848,0.00032853737,0.00047305677,0.0003460152,0.0028417069],"category_scores_gemma":[0.0007408412,0.0005625991,0.00018746388,0.00086449186,0.00036213276,0.00040875137,0.0005156926,0.00037593476,0.008391995],"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.00012898896,0.0004485822,0.0017100576,0.015101059,0.0008767088,0.0003491738,0.01728178,0.000007060743,0.0016582421,0.79128516,0.16688444,0.004268746],"study_design_scores_gemma":[0.0013945748,0.0002088638,0.0040416443,0.0012606754,0.0005222996,0.00020477263,0.015988218,0.0009577816,0.001622946,0.94035614,0.03215054,0.0012915437],"about_ca_topic_score_codex":0.00003362731,"about_ca_topic_score_gemma":0.000018062932,"teacher_disagreement_score":0.14907098,"about_ca_system_score_codex":0.0000590375,"about_ca_system_score_gemma":0.000069874004,"threshold_uncertainty_score":0.99968255},"labels":[],"label_agreement":null}]}