{"meta":{"query_hash":"235c14bb6749","filters":{"venue":"SIAM Journal on Computing"},"cohort_total":43,"direct_labels_cover":0,"predictions_cover":43,"exported":43,"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/235c14bb6749","api":"https://metacan.xera.ac/api/v1/cohort?venue=SIAM+Journal+on+Computing"},"results":[{"id":"W1551570706","doi":"10.1137/070684008","title":"Algebraic Algorithms for Matching and Matroid Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Algebraic number; Intersection (aeronautics); Weighted matroid; Matching (statistics); Discrete mathematics; Simple (philosophy); Oriented matroid; Matrix (chemical analysis); Exponent; Rank (graph theory); Matrix multiplication; Graphic matroid; Matroid partitioning","score_opus":0.028521770577790092,"score_gpt":0.28192901818277,"score_spread":0.2534072476049799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551570706","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.0063124173,0.000989981,0.97457856,0.0017789977,0.00018405673,0.0001944401,0.00017089023,0.0007764049,0.015014303],"genre_scores_gemma":[0.13095927,0.0022303832,0.8549404,0.00079206144,0.00079594436,0.0006363788,0.000983419,0.00035328715,0.008308799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936231,0.0017974873,0.00046859233,0.0014421304,0.0021657078,0.00050296885],"domain_scores_gemma":[0.99044925,0.0051808544,0.0008457548,0.0024135627,0.00077970634,0.00033083328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026017062,0.0013922818,0.001366529,0.001986297,0.002022164,0.0052194297,0.0044035963,0.0022841687,0.012605817],"category_scores_gemma":[0.015580685,0.0008309532,0.0021282285,0.0044363947,0.0033353262,0.014654914,0.005701094,0.005853811,0.0032559172],"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.00009948654,0.00023831011,0.00029081103,0.0004428412,0.000060467853,0.000038793907,0.00018443615,0.021819923,0.0015416369,0.82854253,0.007486299,0.13925442],"study_design_scores_gemma":[0.00007520257,0.0000482628,0.00010342987,0.000040516392,0.000029019839,0.00013107595,0.00008792524,0.10333159,0.0016026623,0.8769279,0.017592391,0.00003007938],"about_ca_topic_score_codex":0.0011887221,"about_ca_topic_score_gemma":0.0017805251,"teacher_disagreement_score":0.012605817,"about_ca_system_score_codex":0.0028454254,"about_ca_system_score_gemma":0.0025556837,"threshold_uncertainty_score":0.042170644},"labels":[],"label_agreement":null},{"id":"W1944379106","doi":"10.1137/120895950","title":"Space Complexity in Polynomial Calculus","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"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":"Banff International Research Station for Mathematical Innovation and Discovery; Vetenskapsrådet; Kungliga Tekniska Högskolan; Akademie Věd České Republiky; Univerzita Karlova v Praze; Grantová Agentura České Republiky; European Commission","keywords":"Pigeonhole principle; Mathematics; Proof complexity; Polynomial; Space (punctuation); Mathematical proof; Calculus (dental); Upper and lower bounds; Linear space; PSPACE; Discrete mathematics; Resolution (logic); Combinatorics; Computational complexity theory; Geometry; Mathematical analysis; Algorithm; Computer science","score_opus":0.14288788910998224,"score_gpt":0.35842390220311937,"score_spread":0.21553601309313714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944379106","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.14651479,0.008963033,0.676444,0.01926684,0.00084209495,0.00036475528,0.0024939352,0.0027262648,0.14238426],"genre_scores_gemma":[0.81825554,0.004917121,0.14521685,0.0031871907,0.0019507429,0.0006399446,0.002013058,0.0013644797,0.022455078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873325,0.002389636,0.0006399046,0.0026689174,0.004733777,0.0022353122],"domain_scores_gemma":[0.95320976,0.036941305,0.0014587347,0.0046594734,0.0026448315,0.0010858658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004116582,0.0014716008,0.00176562,0.0025693497,0.0032213752,0.0076581165,0.0037545396,0.002046124,0.01821668],"category_scores_gemma":[0.028257003,0.00095853885,0.004355104,0.0033407963,0.006491833,0.021841561,0.008527018,0.01116402,0.0022801645],"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.0001622682,0.00006229991,0.0009331152,0.0004133343,0.00006558342,0.0001357002,0.0006916807,0.009641955,0.0019858626,0.9583592,0.0072442424,0.0203048],"study_design_scores_gemma":[0.000034011984,0.000036974205,0.0004632821,0.000050768456,0.000059998685,0.00013146638,0.00008427445,0.030493518,0.0015203515,0.9564933,0.010604553,0.000027504868],"about_ca_topic_score_codex":0.0042696614,"about_ca_topic_score_gemma":0.003117236,"teacher_disagreement_score":0.01821668,"about_ca_system_score_codex":0.0062067835,"about_ca_system_score_gemma":0.0031120603,"threshold_uncertainty_score":0.060940802},"labels":[],"label_agreement":null},{"id":"W1964502706","doi":"10.1137/s0097539701397825","title":"Genetic Design of Drugs Without Side-Effects","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China; City University of Hong Kong","keywords":"Computer science; Medicine","score_opus":0.012104865627884683,"score_gpt":0.24584351844682079,"score_spread":0.2337386528189361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964502706","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.2720774,0.036715165,0.55082005,0.010101523,0.0022363174,0.0011937028,0.003433307,0.0027357743,0.12068676],"genre_scores_gemma":[0.7914025,0.0142473765,0.1585514,0.0026464178,0.00016205014,0.0008443637,0.0011745088,0.00016001823,0.030811349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964976,0.00009551367,0.000018567183,0.00010217894,0.00007239155,0.00006161082],"domain_scores_gemma":[0.9997353,0.00008125634,0.00006316607,0.00004193366,0.000039253184,0.00003913966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047409892,0.00061033573,0.0009405992,0.00045861266,0.00028701848,0.0010757897,0.0009062725,0.0011953458,0.006569096],"category_scores_gemma":[0.0011181921,0.00033961394,0.0007942497,0.0005481275,0.0007471047,0.0008242025,0.00069174846,0.0012602246,0.0015844966],"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.0025375604,0.00068541645,0.002244267,0.002344323,0.00045586395,0.0012719798,0.0001322726,0.15004498,0.22385065,0.3166331,0.012774463,0.28702506],"study_design_scores_gemma":[0.0020603517,0.0052378224,0.0017082546,0.00047808333,0.0008326411,0.0016725911,0.00016074406,0.27592283,0.20642869,0.25516242,0.25011656,0.00021901217],"about_ca_topic_score_codex":0.00070626324,"about_ca_topic_score_gemma":0.0012595993,"teacher_disagreement_score":0.006569096,"about_ca_system_score_codex":0.0009858129,"about_ca_system_score_gemma":0.0009586233,"threshold_uncertainty_score":0.021975815},"labels":[],"label_agreement":null},{"id":"W1971650774","doi":"10.1137/s0097539702415950","title":"Counting Complexity Classes for Numeric Computations I: Semilinear Sets","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Betti number; Complexity class; Completeness (order theory); Computation; Mathematics; Class (philosophy); Discrete mathematics; Characterization (materials science); Counting problem; Euler's formula; Euler characteristic; Combinatorics; Model of computation; Transfer (computing); Computational complexity theory; Time complexity; Algorithm; Computer science; Physics; Mathematical analysis","score_opus":0.059710073086277904,"score_gpt":0.3185660829249645,"score_spread":0.2588560098386866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971650774","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.4190437,0.0010251431,0.52363986,0.0021393024,0.00012659418,0.00018406805,0.0009988266,0.00057005393,0.052272446],"genre_scores_gemma":[0.93058443,0.00035817872,0.059646036,0.00024857835,0.00022456369,0.00025866504,0.0007468959,0.00009926983,0.007833388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984238,0.00019594024,0.000110678695,0.00036152732,0.0006333642,0.00027477933],"domain_scores_gemma":[0.99483865,0.0025386664,0.0006936411,0.0009806276,0.00054231164,0.00040602975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009790722,0.0007369586,0.00071241375,0.002491046,0.0014243326,0.00525387,0.0016423013,0.0009561085,0.005935541],"category_scores_gemma":[0.0051413425,0.000373401,0.0014757034,0.002871377,0.0035538545,0.008290591,0.0024813607,0.0034605497,0.0005638263],"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.00003839201,0.000035202946,0.0007988144,0.000059314712,0.000007775138,0.00002379512,0.00017787161,0.0041281716,0.0011613871,0.9831215,0.0008309089,0.0096169505],"study_design_scores_gemma":[0.000011731965,0.000025737212,0.00089480926,0.000024655845,0.000013605478,0.00009860138,0.0000949296,0.053065196,0.003837056,0.937092,0.004817506,0.000024114432],"about_ca_topic_score_codex":0.0010255998,"about_ca_topic_score_gemma":0.00079420995,"teacher_disagreement_score":0.005935541,"about_ca_system_score_codex":0.0047292733,"about_ca_system_score_gemma":0.0009563294,"threshold_uncertainty_score":0.03431344},"labels":[],"label_agreement":null},{"id":"W2003085628","doi":"10.1137/s009753970444106x","title":"SRT Division Algorithms as Dynamical Systems","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","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","keywords":"Division (mathematics); Division algorithm; Ergodic theory; Bernoulli's principle; Mathematics; Dynamical systems theory; Entropy (arrow of time); Algorithm; Computer science; Theoretical computer science; Discrete mathematics; Arithmetic; Pure mathematics","score_opus":0.03466662451208825,"score_gpt":0.34207267008436804,"score_spread":0.3074060455722798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003085628","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.04354197,0.0013646872,0.93219715,0.0009507447,0.00016664295,0.00007556609,0.00008878567,0.0002804308,0.02133395],"genre_scores_gemma":[0.62673,0.0018046198,0.35331675,0.00032779583,0.00043889935,0.0002871859,0.00026575127,0.00016941116,0.016659493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894506,0.00029914934,0.00008129105,0.00020950058,0.0003736615,0.00009126654],"domain_scores_gemma":[0.99797946,0.0011784672,0.00019498494,0.0002798771,0.0002490345,0.00011818227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013012313,0.0003750349,0.0004767801,0.0012942818,0.0007582407,0.0020878392,0.00068600435,0.0008584461,0.0041604536],"category_scores_gemma":[0.00678826,0.00026808254,0.00059132103,0.0010751447,0.002165556,0.0039721923,0.001969313,0.0016085,0.0007472297],"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.000012035687,0.000007000618,0.00023233128,0.000025090987,0.000006819094,0.000021353826,0.000100038946,0.019257253,0.0004985593,0.9560563,0.00063744246,0.023145946],"study_design_scores_gemma":[0.000011156771,0.000013064726,0.00012316927,0.000012672176,0.0000036236138,0.000051703682,0.000026450682,0.18362884,0.0006222705,0.8091263,0.0063708443,0.000009962406],"about_ca_topic_score_codex":0.00068378315,"about_ca_topic_score_gemma":0.0005500742,"teacher_disagreement_score":0.0041604536,"about_ca_system_score_codex":0.0014466543,"about_ca_system_score_gemma":0.0006446437,"threshold_uncertainty_score":0.013918161},"labels":[],"label_agreement":null},{"id":"W2004640854","doi":"10.1137/120872310","title":"Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard","year":2013,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; European Science Foundation","keywords":"Book embedding; Planar graph; Crossing number (knot theory); Planarity testing; Combinatorics; Planar straight-line graph; Planar; Mathematics; 1-planar graph; Graph drawing; Outerplanar graph; Embedding; Polyhedral graph; Pathwidth; Graph; Discrete mathematics; Computer science; Line graph","score_opus":0.040510224570431054,"score_gpt":0.29268103438269155,"score_spread":0.2521708098122605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004640854","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.49538139,0.0012021968,0.44538927,0.0101225665,0.00029791,0.00020483023,0.0018833493,0.0019961724,0.043522317],"genre_scores_gemma":[0.8100084,0.0018710367,0.17348497,0.0011326051,0.00033080135,0.00018655213,0.003231297,0.000498127,0.009256202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978549,0.0003826412,0.00011803304,0.0008226055,0.00047335803,0.00034850396],"domain_scores_gemma":[0.98099935,0.014352877,0.0012915808,0.0021790825,0.0006302303,0.00054694404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011912703,0.0012002478,0.0014114751,0.00091524224,0.0015200279,0.0037247157,0.0027560284,0.002525947,0.0075939763],"category_scores_gemma":[0.011873999,0.0014963968,0.002078803,0.0018773556,0.0031582997,0.009729946,0.00394185,0.006701498,0.0011508294],"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.0012503389,0.00064254936,0.0072766924,0.0017138629,0.00024419982,0.0013819651,0.0008652089,0.37888464,0.02645474,0.4116366,0.029917749,0.1397315],"study_design_scores_gemma":[0.00015364544,0.00015109037,0.001733275,0.00009973938,0.00014626344,0.0012432961,0.00037496377,0.20444039,0.013332128,0.76490796,0.013338068,0.00007914149],"about_ca_topic_score_codex":0.0012870363,"about_ca_topic_score_gemma":0.0018730867,"teacher_disagreement_score":0.0075939763,"about_ca_system_score_codex":0.0014263564,"about_ca_system_score_gemma":0.0011527707,"threshold_uncertainty_score":0.025404453},"labels":[],"label_agreement":null},{"id":"W2017816090","doi":"10.1137/s0097539700379346","title":"There are No Sparse NP<sub><i>w</i></sub>-Hard Sets","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computability, Logic, AI Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Context (archaeology); Mathematics; Discrete mathematics; Computer science","score_opus":0.02927383581484306,"score_gpt":0.2552256822994979,"score_spread":0.22595184648465483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017816090","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.5803302,0.0013728044,0.3186113,0.014322512,0.0005173804,0.0002445113,0.0018556196,0.0010651959,0.08168045],"genre_scores_gemma":[0.91796184,0.0006503258,0.060568143,0.002276183,0.0004036255,0.00038608504,0.0021380307,0.00024207728,0.015373691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980673,0.0003878846,0.00010680792,0.0006402312,0.00045904302,0.00033876725],"domain_scores_gemma":[0.98000515,0.015412204,0.0012054789,0.0016011253,0.0008894997,0.00088649243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012423245,0.0006264222,0.0016037371,0.00056978106,0.0024474463,0.0040429095,0.0021875738,0.0017739605,0.010164082],"category_scores_gemma":[0.014854839,0.0008378509,0.0010588322,0.00076704496,0.0031874748,0.008442449,0.0038658583,0.004722424,0.0014802677],"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.0011767099,0.00042396475,0.006392154,0.0017410974,0.0002893231,0.0011238074,0.0011865125,0.025267059,0.017550576,0.83961815,0.02689252,0.078338124],"study_design_scores_gemma":[0.00008491971,0.00009045839,0.0009884977,0.000059541544,0.00005461312,0.0006962515,0.0005913142,0.03411468,0.0065390253,0.9453931,0.011358761,0.000028733843],"about_ca_topic_score_codex":0.0004060806,"about_ca_topic_score_gemma":0.0007258069,"teacher_disagreement_score":0.010164082,"about_ca_system_score_codex":0.0008447857,"about_ca_system_score_gemma":0.0006746025,"threshold_uncertainty_score":0.034002244},"labels":[],"label_agreement":null},{"id":"W2026753685","doi":"10.1137/s0097539700376676","title":"Classifying the Complexity of Constraints Using Finite Algebras","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":580,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Universal algebra; Surjective function; Mathematics; Constraint satisfaction; Class (philosophy); Constraint (computer-aided design); Set (abstract data type); Algebra over a field; Algebraic number; Simple (philosophy); Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.08292401402696233,"score_gpt":0.30074126066290946,"score_spread":0.21781724663594715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026753685","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.6176532,0.000811878,0.36806569,0.002157834,0.000022782488,0.00024068185,0.0007635567,0.00031601268,0.009968425],"genre_scores_gemma":[0.9341984,0.00066527724,0.06228119,0.00014777576,0.00009548265,0.00022527072,0.00091857044,0.000045659108,0.0014223414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951031,0.0016275733,0.00047832655,0.0008359481,0.001453992,0.00050107046],"domain_scores_gemma":[0.9799168,0.01498477,0.00194793,0.0018141387,0.0007426206,0.00059381325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030638054,0.00052306574,0.0011368765,0.002715432,0.0013069093,0.005754228,0.0015350342,0.0013593652,0.0032102237],"category_scores_gemma":[0.01814604,0.00048192046,0.0021861098,0.002914454,0.004282611,0.014247015,0.0026155582,0.0025133372,0.000199937],"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.00016409776,0.00020818118,0.006120481,0.00028244383,0.00013996338,0.00016895063,0.0007973919,0.099348746,0.0036255699,0.85715294,0.00092251704,0.031068861],"study_design_scores_gemma":[0.00002611031,0.000034477307,0.0011156814,0.000028464798,0.000027461847,0.0000763849,0.00018458204,0.14146283,0.0017291072,0.8542411,0.0010446494,0.000029158366],"about_ca_topic_score_codex":0.0030378264,"about_ca_topic_score_gemma":0.0022030817,"teacher_disagreement_score":0.005754228,"about_ca_system_score_codex":0.0035504303,"about_ca_system_score_gemma":0.001958695,"threshold_uncertainty_score":0.025760233},"labels":[],"label_agreement":null},{"id":"W2040746822","doi":"10.1137/s009753970343912x","title":"Dynamic Subgraph Connectivity with Geometric Applications","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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":"Omega; Combinatorics; Sublinear function; Mathematics; Exponent; Matrix multiplication; Binary logarithm; Simple (philosophy); Graph; Discrete mathematics; Degeneracy (biology)","score_opus":0.007030177447079165,"score_gpt":0.23590775653986001,"score_spread":0.22887757909278084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040746822","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.04267306,0.0008980338,0.93753433,0.0023667396,0.00012671367,0.00022513108,0.0007927977,0.0018041921,0.013578922],"genre_scores_gemma":[0.48990306,0.0012742698,0.49573725,0.0007452141,0.0004803995,0.00064134033,0.0026721116,0.00057848677,0.007967795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856865,0.0003315006,0.00006895976,0.00042259172,0.00045977492,0.00014859538],"domain_scores_gemma":[0.99508274,0.0026610787,0.0003873917,0.001317626,0.0004153507,0.00013582448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079250627,0.0009168224,0.0009179198,0.0015673588,0.00088290026,0.0015785625,0.0022677332,0.0013222949,0.009314627],"category_scores_gemma":[0.009555043,0.00070635846,0.0009405324,0.003337778,0.001563464,0.0062501226,0.004300505,0.0017351188,0.0012271275],"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.00036708772,0.00016339235,0.0032596537,0.00070089684,0.00007319445,0.0003924651,0.0004390352,0.25247473,0.01046912,0.3731921,0.030169416,0.32829896],"study_design_scores_gemma":[0.00007318158,0.00012883196,0.00069986796,0.00005204175,0.000042503885,0.00055175996,0.0001598355,0.56242824,0.006795624,0.39615417,0.032878432,0.000035427744],"about_ca_topic_score_codex":0.0017073398,"about_ca_topic_score_gemma":0.002071771,"teacher_disagreement_score":0.009314627,"about_ca_system_score_codex":0.0011771292,"about_ca_system_score_gemma":0.0008443169,"threshold_uncertainty_score":0.031160533},"labels":[],"label_agreement":null},{"id":"W2042774332","doi":"10.1137/110845045","title":"Fixed-Parameter Algorithms for Maximum Agreement Forests","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Genome Atlantic; Killam Trusts","keywords":"Bounded function; Reticulate; Phylogenetic tree; Algorithm; Mathematics; Tree (set theory); Binary number; Binary tree; Combinatorics; Approximation algorithm; Phylogenetic network; Biology","score_opus":0.020567441118703282,"score_gpt":0.26923373136356155,"score_spread":0.24866629024485826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042774332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055754078,0.00024212933,0.99105656,0.00009414648,0.00003177236,0.000058828173,0.00014134489,0.001507745,0.001292143],"genre_scores_gemma":[0.12955533,0.00019603781,0.86686426,0.00012300992,0.00006305506,0.00032868236,0.00088124274,0.0006740404,0.0013142688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964778,0.0009745214,0.00029625994,0.00074813835,0.001094799,0.00040850957],"domain_scores_gemma":[0.98740095,0.0078656385,0.0005078462,0.0024176352,0.0015237019,0.00028423406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034491923,0.0014402234,0.0013468497,0.0022311436,0.0013434842,0.0022647358,0.0044817016,0.0021326614,0.007955971],"category_scores_gemma":[0.021615464,0.00090481696,0.0019552528,0.0032523382,0.0016793878,0.0062581217,0.0040269257,0.0041405535,0.002446294],"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.00051875756,0.00028696994,0.0017627961,0.0004159566,0.00012350631,0.00014180805,0.0003424543,0.4180397,0.0066718794,0.14256145,0.010253607,0.41888118],"study_design_scores_gemma":[0.00008700204,0.000056324225,0.00018252077,0.00004378018,0.000025826906,0.000095168,0.000050970953,0.7842909,0.0034693766,0.20822488,0.0034413275,0.000031830015],"about_ca_topic_score_codex":0.0022439854,"about_ca_topic_score_gemma":0.0033780634,"teacher_disagreement_score":0.007955971,"about_ca_system_score_codex":0.0019698397,"about_ca_system_score_gemma":0.002243994,"threshold_uncertainty_score":0.026615381},"labels":[],"label_agreement":null},{"id":"W2044722214","doi":"10.1137/s0097539700369156","title":"The Efficiency of Resolution and Davis--Putnam Procedures","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pigeonhole principle; Mathematical proof; Resolution (logic); Mathematics; Class (philosophy); True quantified Boolean formula; Combinatorics; Discrete mathematics; Upper and lower bounds; Simple (philosophy); Conjunctive normal form; Binary logarithm; Satisfiability; Algorithm; Computer science","score_opus":0.012382062135946685,"score_gpt":0.2277696652962964,"score_spread":0.2153876031603497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044722214","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.15018663,0.0019771662,0.82000333,0.0027397652,0.00009993261,0.0004930202,0.00041289147,0.0026876372,0.02139957],"genre_scores_gemma":[0.599511,0.000793856,0.39304173,0.0006773879,0.00009044449,0.00053669745,0.0005335561,0.00065086037,0.0041645016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9822687,0.0069785817,0.0010126671,0.0031745322,0.0048840116,0.0016815182],"domain_scores_gemma":[0.901414,0.07960596,0.004047791,0.011811912,0.0023785685,0.00074182724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012764997,0.0012431543,0.0018459951,0.0026125682,0.0017155773,0.00424498,0.0053478396,0.00291092,0.006684665],"category_scores_gemma":[0.083145246,0.0011209617,0.0025969455,0.0030079028,0.004111991,0.008675055,0.003747622,0.0031838634,0.0014503981],"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.0019550088,0.00056848984,0.0062287743,0.0009315158,0.0004751428,0.00032884776,0.00088164926,0.22951572,0.02331573,0.45768908,0.007182367,0.2709277],"study_design_scores_gemma":[0.00030441795,0.00024841249,0.00086362497,0.00009219063,0.00016033377,0.00030952308,0.00012452879,0.70735747,0.034413397,0.2520943,0.0039570564,0.000074770265],"about_ca_topic_score_codex":0.0026514854,"about_ca_topic_score_gemma":0.0028985417,"teacher_disagreement_score":0.012764997,"about_ca_system_score_codex":0.0043814545,"about_ca_system_score_gemma":0.0036599578,"threshold_uncertainty_score":0.06750852},"labels":[],"label_agreement":null},{"id":"W2055042442","doi":"10.1137/s0097539705447116","title":"Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"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":"Polyhedron; Combinatorics; Tangent; Polytope; Regular polygon; Convex polytope; Mathematics; Line (geometry); Convex set; Connected component; Tangent space; Line segment; Convex hull; Integer points in convex polyhedra; Geometry; Algorithm; Linear programming; Convex optimization","score_opus":0.020322799490895906,"score_gpt":0.27727585342248656,"score_spread":0.2569530539315907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055042442","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.5927062,0.00022309045,0.39942923,0.00028720702,0.000015116461,0.00013676012,0.001350716,0.0012359354,0.0046156542],"genre_scores_gemma":[0.72922534,0.00021730091,0.263747,0.00005230578,0.00001627663,0.00010153916,0.0046001947,0.00026366004,0.0017763878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877316,0.00018025072,0.00007994993,0.00030750906,0.00040487354,0.00025432522],"domain_scores_gemma":[0.9970893,0.0013472956,0.0005089528,0.0006249519,0.00021583696,0.00021360374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033392187,0.0006506159,0.0009386207,0.0012795683,0.0011476534,0.0027075436,0.0018892795,0.0010911822,0.0045457445],"category_scores_gemma":[0.0041210437,0.00094688707,0.001476573,0.0021783735,0.001511117,0.0040447144,0.0020238496,0.0015229934,0.0004971294],"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.0012242808,0.0004482985,0.020121755,0.0008017331,0.00026880202,0.0014330967,0.0019542777,0.5936573,0.053070106,0.16675252,0.006483456,0.15378433],"study_design_scores_gemma":[0.000071059534,0.00012753505,0.004340559,0.00005279387,0.00004697017,0.0004340045,0.0006337464,0.89501035,0.01957421,0.07582018,0.003842179,0.000046426136],"about_ca_topic_score_codex":0.004846794,"about_ca_topic_score_gemma":0.005453473,"teacher_disagreement_score":0.004846794,"about_ca_system_score_codex":0.0010231384,"about_ca_system_score_gemma":0.00050100236,"threshold_uncertainty_score":0.015207052},"labels":[],"label_agreement":null},{"id":"W2103473460","doi":"10.1137/110833026","title":"Quantum Query Complexity of Minor-Closed Graph Properties","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"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":"Minor (academic); Mathematics; Combinatorics; Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics; Quantum; Planar graph; Physics","score_opus":0.047918382395501294,"score_gpt":0.2581324715016704,"score_spread":0.21021408910616912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103473460","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.52061474,0.0008327825,0.45481613,0.0049738125,0.000115664334,0.00039637013,0.0021844127,0.0016501001,0.014415965],"genre_scores_gemma":[0.94549173,0.00036199763,0.050044715,0.0003394215,0.00010581018,0.00017560943,0.0011782841,0.00023345459,0.002068944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961979,0.0009321015,0.00018961566,0.00085146795,0.0009664309,0.0008624251],"domain_scores_gemma":[0.9633814,0.029066727,0.0016472474,0.0041268207,0.00097444584,0.00080339867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026379041,0.00064185454,0.0017381775,0.0009752208,0.0016106763,0.0033742883,0.0029299203,0.001791263,0.0065193423],"category_scores_gemma":[0.02119683,0.000610227,0.0016257981,0.0019399575,0.002651479,0.009228634,0.0030373745,0.0032106633,0.0004962561],"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.0028666225,0.00071137125,0.009119654,0.00085396145,0.00031185578,0.0004805618,0.0009553094,0.4459418,0.030219434,0.40633726,0.014318769,0.087883435],"study_design_scores_gemma":[0.00009873712,0.00008934987,0.00089779514,0.000016083659,0.00005556713,0.00016987917,0.00013542229,0.7098543,0.0050194785,0.28227946,0.0013549969,0.000028928314],"about_ca_topic_score_codex":0.003390336,"about_ca_topic_score_gemma":0.003149214,"teacher_disagreement_score":0.0065193423,"about_ca_system_score_codex":0.0031612574,"about_ca_system_score_gemma":0.0024089047,"threshold_uncertainty_score":0.022936583},"labels":[],"label_agreement":null},{"id":"W2111071057","doi":"10.1137/060660345","title":"Distributed Selfish Load Balancing","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Computer science; Convergence (economics); Binary logarithm; Martingale (probability theory); Distributed algorithm; Load balancing (electrical power); Resource allocation; Upper and lower bounds; Mathematical optimization; Distributed computing; Mathematics; Combinatorics; Applied mathematics; Economics","score_opus":0.05869518664568,"score_gpt":0.38548288483299764,"score_spread":0.3267876981873176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111071057","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.081550285,0.00026501546,0.90452236,0.0006570722,0.00011356162,0.00013949892,0.000091094116,0.0007430756,0.011917977],"genre_scores_gemma":[0.95214385,0.00013279528,0.041024435,0.00012914387,0.00006044862,0.00014569944,0.00006898019,0.00004571538,0.006248832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989336,0.0002865924,0.000047951704,0.00025495622,0.00029744816,0.00017935707],"domain_scores_gemma":[0.99824524,0.0006265228,0.00028950564,0.00041398645,0.00023444659,0.00019035648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013880307,0.0005203918,0.00074599165,0.0003904823,0.00086647423,0.0013769633,0.0019326471,0.0008189108,0.003743517],"category_scores_gemma":[0.004234329,0.00032367246,0.00031811843,0.0004364521,0.0010532291,0.0020032446,0.0020341654,0.00062662765,0.0006186727],"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.00087062415,0.00018469674,0.0016767633,0.000186061,0.00011993909,0.00046734803,0.00051250466,0.6957894,0.022408534,0.2085415,0.005409209,0.063833416],"study_design_scores_gemma":[0.000052523632,0.000062915096,0.00017494458,0.0000065026766,0.000011099446,0.00009048703,0.000042803462,0.9533351,0.0019336893,0.04148679,0.00279134,0.00001193958],"about_ca_topic_score_codex":0.001004836,"about_ca_topic_score_gemma":0.0009908519,"teacher_disagreement_score":0.003743517,"about_ca_system_score_codex":0.0010174133,"about_ca_system_score_gemma":0.0008201747,"threshold_uncertainty_score":0.012523353},"labels":[],"label_agreement":null},{"id":"W2115404728","doi":"10.1137/s0097539704443057","title":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":128,"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":"Environment and Climate Change Canada","keywords":"Hypergraph; Combinatorics; Vertex cover; Mathematics; Cover (algebra); Vertex (graph theory); Hardness of approximation; Constant (computer programming); Combinatorial proof; Discrete mathematics; Code (set theory); Approximation algorithm; Graph; Computer science; Set (abstract data type)","score_opus":0.014186560092182231,"score_gpt":0.24357122172902834,"score_spread":0.22938466163684612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115404728","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.20777301,0.0009128733,0.76667094,0.0040902137,0.000107634594,0.00019547886,0.0015149849,0.001656332,0.017078575],"genre_scores_gemma":[0.8306049,0.0005940212,0.16289705,0.00060956285,0.0001773886,0.00017755733,0.0008883076,0.00018632958,0.003864762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961893,0.0006205583,0.00019861679,0.0009937007,0.0013991339,0.00059872953],"domain_scores_gemma":[0.9862385,0.0075341747,0.0013454822,0.0032651892,0.0009943921,0.0006222909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018200869,0.00052392646,0.0009393329,0.0012065679,0.0014252621,0.0031430079,0.002303002,0.001524575,0.006289759],"category_scores_gemma":[0.016629515,0.00094678375,0.0014897302,0.0016577456,0.00254118,0.009352597,0.005460059,0.0038254177,0.0006529469],"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.0012054602,0.00028963896,0.008078534,0.00082570675,0.0002172603,0.00086445484,0.0007667934,0.18409869,0.03292281,0.61437654,0.012032816,0.14432122],"study_design_scores_gemma":[0.00014262919,0.00021620098,0.0023810011,0.000120907054,0.00012287655,0.0009913022,0.00013286289,0.54316217,0.020177398,0.42326638,0.00916701,0.00011937816],"about_ca_topic_score_codex":0.0033635262,"about_ca_topic_score_gemma":0.0030558985,"teacher_disagreement_score":0.006289759,"about_ca_system_score_codex":0.002711235,"about_ca_system_score_gemma":0.0021537594,"threshold_uncertainty_score":0.021041334},"labels":[],"label_agreement":null},{"id":"W2116060765","doi":"10.1137/090751670","title":"Dynamic Connectivity: Connecting to Networks and Geometry","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"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":"Combinatorics; Computer science; Bounded function; Vertex (graph theory); Sublinear function; Geometric networks; Discrete mathematics; Graph; Mathematics; Graph theory","score_opus":0.028243701256946273,"score_gpt":0.25872049542655406,"score_spread":0.23047679416960778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116060765","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.04405372,0.010763789,0.88547784,0.015291748,0.00068847294,0.00015109932,0.0011904052,0.0020142312,0.040368743],"genre_scores_gemma":[0.5435597,0.015813349,0.4135932,0.0021730226,0.001978334,0.00041521856,0.0028658072,0.00118164,0.018419757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977991,0.00062004954,0.000109394954,0.00064873113,0.00063592487,0.00018682163],"domain_scores_gemma":[0.9931312,0.00343341,0.0005263296,0.002098374,0.00049398514,0.00031658224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012648905,0.0009686208,0.0010345012,0.0021556069,0.0016312879,0.004889411,0.0023028322,0.001733366,0.011478256],"category_scores_gemma":[0.012860429,0.0007532961,0.0010597944,0.004374309,0.004889007,0.0227888,0.0052471505,0.003522585,0.0017126708],"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.00006309243,0.000023948282,0.0006955308,0.0001708572,0.000025165484,0.00008750867,0.00035765438,0.021290742,0.0009012154,0.902044,0.012593271,0.0617469],"study_design_scores_gemma":[0.0000097639995,0.000028771374,0.00035829665,0.000043836146,0.000014276249,0.00023795952,0.00017195688,0.036051016,0.0009024873,0.9197417,0.042418532,0.000021488922],"about_ca_topic_score_codex":0.002442686,"about_ca_topic_score_gemma":0.0017536151,"teacher_disagreement_score":0.011478256,"about_ca_system_score_codex":0.0023145105,"about_ca_system_score_gemma":0.00067386415,"threshold_uncertainty_score":0.038398564},"labels":[],"label_agreement":null},{"id":"W2134875769","doi":"10.1137/s009753979833920x","title":"Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":107,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph factorization; Spanning tree; Matching (statistics); Connectivity; Strongly connected component; Undirected graph; Factor-critical graph; Minimum spanning tree; Line graph; Degree (music); Minimum degree spanning tree; Graph; Graph power","score_opus":0.012816955137912967,"score_gpt":0.24196167584555903,"score_spread":0.22914472070764605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134875769","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.15323713,0.00039182825,0.8361926,0.0004075152,0.000040744137,0.00025252244,0.0005661656,0.0020274434,0.0068840245],"genre_scores_gemma":[0.45966533,0.00018427696,0.5355815,0.000121863886,0.000024210334,0.00017680973,0.0012820397,0.0002804186,0.0026835534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946994,0.00012341709,0.000024859653,0.00014730549,0.000107406144,0.00012704864],"domain_scores_gemma":[0.9987923,0.0006750468,0.00017798941,0.00017279103,0.0001025153,0.000079296144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005632612,0.0008089303,0.0008137709,0.0011438542,0.00048509016,0.0006702959,0.0017352186,0.0011158395,0.003166605],"category_scores_gemma":[0.0033676769,0.0005987929,0.0009347826,0.0020659163,0.00063815416,0.0019891039,0.00091021776,0.00060920505,0.000697212],"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.0003179778,0.00016661297,0.0022185708,0.00023917654,0.000069609785,0.00025567907,0.000125265,0.85131687,0.008531609,0.019009633,0.007163382,0.11058569],"study_design_scores_gemma":[0.000034618693,0.000040085994,0.00035901152,0.000012425323,0.000012652713,0.00009053579,0.000054826392,0.97857827,0.0021338325,0.017605355,0.0010717497,0.000006639117],"about_ca_topic_score_codex":0.006139442,"about_ca_topic_score_gemma":0.0073727667,"teacher_disagreement_score":0.006139442,"about_ca_system_score_codex":0.001214118,"about_ca_system_score_gemma":0.0012416802,"threshold_uncertainty_score":0.012207389},"labels":[],"label_agreement":null},{"id":"W2407021550","doi":"10.1137/15m1009767","title":"Algorithms for Group Isomorphism via Group Extensions and Cohomology","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Finite Group Theory Research","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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Group (periodic table); Mathematics; Abelian group; Isomorphism (crystallography); Group isomorphism; Extension (predicate logic); Divide and conquer algorithms; Cohomology; Equivalence (formal languages); Quotient group; Combinatorics; Group cohomology; Normal subgroup; Time complexity; Discrete mathematics; Algebra over a field; Cyclic group; Computer science; Pure mathematics; Algorithm","score_opus":0.13736387965319666,"score_gpt":0.4026025739951591,"score_spread":0.26523869434196246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407021550","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.084463045,0.0015262241,0.8709211,0.0030983002,0.00029332677,0.0005994398,0.0013359189,0.015452695,0.022310082],"genre_scores_gemma":[0.42983156,0.0006151314,0.54878116,0.0007232058,0.0003054524,0.0006482073,0.0053486014,0.0020502384,0.011696543],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604154,0.00079198705,0.00030449143,0.001321687,0.0007938075,0.0007466329],"domain_scores_gemma":[0.9914069,0.004742746,0.00044299717,0.002537886,0.00054410496,0.0003253616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023473452,0.0017617004,0.0019226538,0.0018840905,0.0020876483,0.0039832992,0.004405863,0.0022554274,0.018243376],"category_scores_gemma":[0.011727002,0.0009268885,0.0025577643,0.003109251,0.0022599322,0.017640349,0.0068701194,0.004047712,0.0040848795],"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.00091197866,0.0007433641,0.0041911067,0.00088774227,0.00019878027,0.00033774893,0.001893248,0.040180232,0.007405236,0.3647198,0.04340035,0.5351304],"study_design_scores_gemma":[0.00033351523,0.0001653606,0.0005786648,0.00007169519,0.000090925394,0.00026109547,0.00060966314,0.1747592,0.0070845126,0.79599184,0.019989753,0.00006364327],"about_ca_topic_score_codex":0.0036162522,"about_ca_topic_score_gemma":0.0052358108,"teacher_disagreement_score":0.018243376,"about_ca_system_score_codex":0.0027631973,"about_ca_system_score_gemma":0.0035670365,"threshold_uncertainty_score":0.06103015},"labels":[],"label_agreement":null},{"id":"W2570868738","doi":"10.1137/090779152","title":"Randomized Self-Assembly for Exact Shapes","year":2010,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Tile; Constant (computer programming); Square (algebra); Point (geometry); Block (permutation group theory); Constraint (computer-aided design); Computer science; Square root; Fraction (chemistry); Discrete mathematics; Combinatorics; Mathematics; Algorithm; Geometry; Programming language","score_opus":0.008647222573215619,"score_gpt":0.2927262166789446,"score_spread":0.284078994105729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570868738","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.08559157,0.0001821022,0.90431476,0.0003548431,0.00006826697,0.00006622243,0.00008584575,0.0008370389,0.008499382],"genre_scores_gemma":[0.74623024,0.00024746355,0.23980801,0.00037775378,0.000048606904,0.00045881286,0.00026508674,0.00045147334,0.012112534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984862,0.0004159795,0.000081302314,0.00036000268,0.0004915465,0.00016496684],"domain_scores_gemma":[0.9954299,0.002397916,0.0005094697,0.0011895439,0.00027954308,0.00019363585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013360706,0.0005433544,0.00076166436,0.00062418944,0.00071644806,0.0013039266,0.0014458431,0.0010431246,0.0051579247],"category_scores_gemma":[0.009025958,0.000689814,0.0010935158,0.00052918756,0.0023397808,0.001975667,0.0019023493,0.0014899274,0.00076431094],"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.00016215771,0.000044020413,0.0006165855,0.00012047022,0.00002329767,0.000116982206,0.00013609299,0.45369706,0.01105479,0.5136839,0.0012126853,0.01913199],"study_design_scores_gemma":[0.000034879908,0.00006472247,0.00010955065,0.00001601879,0.000009565238,0.00006045647,0.000014856257,0.8387038,0.0052693994,0.15360428,0.0020933368,0.000019144281],"about_ca_topic_score_codex":0.0011375671,"about_ca_topic_score_gemma":0.0012605133,"teacher_disagreement_score":0.0051579247,"about_ca_system_score_codex":0.0014992044,"about_ca_system_score_gemma":0.00086083706,"threshold_uncertainty_score":0.017254949},"labels":[],"label_agreement":null},{"id":"W2587741488","doi":"10.1137/140998949","title":"Time-Optimal Top-$k$ Document Retrieval","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":22,"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":"Fondo Nacional de Desarrollo Científico y Tecnológico","keywords":"Computer science; Information retrieval; Top-down and bottom-up design; Document retrieval; Combinatorics; Mathematics; Programming language","score_opus":0.015024961139985544,"score_gpt":0.28698931078504725,"score_spread":0.2719643496450617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587741488","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.09880214,0.0066810865,0.83730996,0.0020453944,0.00058247504,0.00048070116,0.0065273903,0.024853516,0.022717297],"genre_scores_gemma":[0.30119798,0.0012402317,0.6716886,0.000605672,0.00042714237,0.0003329786,0.009778399,0.0010394885,0.01368939],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972344,0.00045031655,0.00035385482,0.0006487589,0.0007992956,0.0005132531],"domain_scores_gemma":[0.9974782,0.000675727,0.00021864958,0.0011466102,0.00035340906,0.00012740404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082795805,0.0011830054,0.0024168014,0.002515289,0.0014402418,0.0029556816,0.004031243,0.0019429659,0.011181025],"category_scores_gemma":[0.0066628596,0.0007977696,0.0013258689,0.0062378473,0.0011293886,0.0057044844,0.0035241116,0.0010746246,0.010521791],"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.0014810511,0.00051923434,0.001564439,0.0009905099,0.00014512842,0.00026899687,0.00037380756,0.045668844,0.037954576,0.027110431,0.06880992,0.81511295],"study_design_scores_gemma":[0.0008470632,0.00061938347,0.0022146385,0.00011634908,0.00030327414,0.00181567,0.0006256372,0.75166494,0.048327245,0.1593085,0.03394513,0.00021218901],"about_ca_topic_score_codex":0.0051042624,"about_ca_topic_score_gemma":0.010841206,"teacher_disagreement_score":0.011181025,"about_ca_system_score_codex":0.0020542704,"about_ca_system_score_gemma":0.0036564642,"threshold_uncertainty_score":0.03740424},"labels":[],"label_agreement":null},{"id":"W2750183690","doi":"10.1137/15m1052779","title":"Uniform Generation of Random Regular Graphs","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":26,"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 Waterloo","keywords":"Combinatorics; Mathematics; Random regular graph; Graph; Random graph; Discrete mathematics; Uniform distribution (continuous); Running time; Pathwidth; Line graph; Algorithm; Statistics","score_opus":0.09616762111026869,"score_gpt":0.35237947189514063,"score_spread":0.25621185078487196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750183690","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.018922333,0.000086964064,0.977371,0.0001419317,0.00003762197,0.00011220282,0.00015312895,0.0010594189,0.0021155458],"genre_scores_gemma":[0.40489656,0.0001789696,0.5874658,0.00043375188,0.000093535025,0.00074703136,0.0012381803,0.0006540145,0.0042921235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981546,0.0006310419,0.00008423663,0.0005273853,0.00040787488,0.00019481489],"domain_scores_gemma":[0.9935893,0.0031302634,0.00028528375,0.0021164399,0.00061545585,0.00026328056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019973125,0.00073450455,0.0009555685,0.001278978,0.00080987235,0.0011268352,0.0027854114,0.0010558179,0.0042624283],"category_scores_gemma":[0.01237997,0.00077570765,0.0011577741,0.000921644,0.0017288711,0.0022545068,0.0025795347,0.0017875802,0.0011004453],"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.0005341545,0.0001905205,0.0035602215,0.00026839986,0.00009116982,0.00030687326,0.0003115061,0.43121356,0.014170625,0.4239553,0.0102685755,0.11512894],"study_design_scores_gemma":[0.000047378988,0.000035144596,0.00014560184,0.000009991701,0.000010826398,0.000072355,0.000014441441,0.92476773,0.0035959473,0.06947245,0.0018140768,0.000014006044],"about_ca_topic_score_codex":0.0017154097,"about_ca_topic_score_gemma":0.0026773978,"teacher_disagreement_score":0.0042624283,"about_ca_system_score_codex":0.0012785711,"about_ca_system_score_gemma":0.0012361759,"threshold_uncertainty_score":0.014259219},"labels":[],"label_agreement":null},{"id":"W2761673598","doi":"10.1137/16m1087072","title":"Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":633,"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":"Army Research Office; Air Force Office of Scientific Research; Canadian Institute for Advanced Research; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Quantum algorithm; Quantum phase estimation algorithm; Mathematics; Quantum algorithm for linear systems of equations; Algorithm; State (computer science); Operator (biology); Quantum; Series (stratigraphy); Polynomial; Matrix (chemical analysis); Chebyshev filter; State vector; Quantum Fourier transform; Mathematical analysis; Quantum mechanics; Quantum error correction; Physics; Quantum process; Quantum dynamics","score_opus":0.02425147854645196,"score_gpt":0.2855787927311494,"score_spread":0.26132731418469746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761673598","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.0131747145,0.00024032095,0.9784163,0.0007732678,0.00010489228,0.00012554141,0.00007466581,0.00098608,0.0061041615],"genre_scores_gemma":[0.21345305,0.00025760467,0.77722,0.00039483805,0.00014196357,0.0004099977,0.00022922456,0.0002998066,0.0075934306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978562,0.0005824885,0.00016227367,0.0002773065,0.0008339479,0.00028779515],"domain_scores_gemma":[0.9957781,0.0025437393,0.0002085152,0.0008212889,0.0005388895,0.00010936313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00229976,0.0008910546,0.0010385019,0.00071466697,0.0012577171,0.0016435676,0.0018630703,0.0013769869,0.008865991],"category_scores_gemma":[0.010348272,0.0006362743,0.0009983134,0.0010223849,0.001716172,0.0038952408,0.0038212202,0.003790415,0.0021237654],"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.0004253042,0.00016677474,0.0007267463,0.0002346589,0.00010082904,0.00014050353,0.0005418847,0.14035124,0.009205927,0.67157924,0.009747969,0.16677889],"study_design_scores_gemma":[0.00013170589,0.00004939824,0.00011301914,0.00002133723,0.000018367056,0.000038356393,0.000028577757,0.7810301,0.0041723493,0.21040805,0.0039593508,0.000029311424],"about_ca_topic_score_codex":0.0026383884,"about_ca_topic_score_gemma":0.0056269346,"teacher_disagreement_score":0.008865991,"about_ca_system_score_codex":0.0017063357,"about_ca_system_score_gemma":0.002478143,"threshold_uncertainty_score":0.029659688},"labels":[],"label_agreement":null},{"id":"W2787163834","doi":"10.1137/17m1136869","title":"Structure of Protocols for XOR Functions","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Boolean function; Combinatorics; Mathematics; Parity (physics); Function (biology); Discrete mathematics; Communication complexity; Binary entropy function; Reduction (mathematics); Entropy (arrow of time); Time complexity; Parity function; Computational complexity theory; Algorithm; Boolean expression; Physics; Principle of maximum entropy; Biology; Genetics; Statistics","score_opus":0.039394675873595596,"score_gpt":0.3277555133152117,"score_spread":0.2883608374416161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787163834","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.15740937,0.0005844047,0.77713996,0.003975159,0.00022175146,0.00051574665,0.0012932693,0.0012468863,0.057613403],"genre_scores_gemma":[0.86059964,0.000683459,0.10414665,0.00083374896,0.00030303834,0.0011205098,0.0013342637,0.00040604957,0.030572556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614644,0.0010350723,0.00027040773,0.0008053989,0.0011388978,0.0006037831],"domain_scores_gemma":[0.98926735,0.005868522,0.0011188963,0.002201718,0.0009947405,0.0005487779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023169972,0.0007434198,0.0010765797,0.0014964816,0.0022520486,0.004731822,0.002190665,0.0025523251,0.010964385],"category_scores_gemma":[0.01114474,0.0010448949,0.0013869064,0.0014953158,0.0031196747,0.01004496,0.005525108,0.004575523,0.0021751835],"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.000065623,0.000032079693,0.00014498051,0.00004119079,0.000009520862,0.000064847525,0.0001865308,0.0040549845,0.0009863239,0.98850983,0.0009802985,0.004923836],"study_design_scores_gemma":[0.000030225418,0.000027789143,0.00008041208,0.000016495278,0.0000126240875,0.000052225183,0.000034691337,0.028722657,0.0012181122,0.9672624,0.002527675,0.000014726773],"about_ca_topic_score_codex":0.00056484377,"about_ca_topic_score_gemma":0.0005726489,"teacher_disagreement_score":0.010964385,"about_ca_system_score_codex":0.0026920994,"about_ca_system_score_gemma":0.0021374912,"threshold_uncertainty_score":0.036679566},"labels":[],"label_agreement":null},{"id":"W2904248248","doi":"10.1137/16m1066506","title":"Towards an Optimal Method for Dynamic Planar Point Location","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planar; Point (geometry); Mathematical optimization; Computer science; Algorithm; Mathematics; Geometry","score_opus":0.023727244238785725,"score_gpt":0.3418822705149188,"score_spread":0.31815502627613307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904248248","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.0044311984,0.00011762717,0.9917425,0.00018099429,0.000033761648,0.000038660768,0.00021263039,0.0019328339,0.0013097017],"genre_scores_gemma":[0.06491042,0.00015181299,0.9304887,0.00014490324,0.00005518422,0.00021600923,0.0009780304,0.0005694896,0.0024854615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983279,0.00021536257,0.00011107344,0.0003657119,0.000828105,0.00015193628],"domain_scores_gemma":[0.9979742,0.0005307717,0.00013838673,0.0008694997,0.00037884567,0.00010832782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088911917,0.00090123934,0.0013812121,0.0015503014,0.00081746373,0.0017876975,0.004032367,0.0015026153,0.007887103],"category_scores_gemma":[0.005760623,0.0010259725,0.0011753337,0.0023380937,0.0015572306,0.004100597,0.0058092894,0.0028363087,0.0047110766],"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.000617408,0.0002845035,0.0017100581,0.00044800914,0.0000912301,0.00010195581,0.00037167678,0.2280152,0.020036137,0.17822993,0.022991113,0.5471028],"study_design_scores_gemma":[0.00011592151,0.00007937819,0.00018957075,0.000026545544,0.00001736227,0.00007852212,0.00007212497,0.89607894,0.0050873575,0.08413285,0.014088521,0.000032840322],"about_ca_topic_score_codex":0.0042336537,"about_ca_topic_score_gemma":0.005605157,"teacher_disagreement_score":0.007887103,"about_ca_system_score_codex":0.0013056601,"about_ca_system_score_gemma":0.0019717324,"threshold_uncertainty_score":0.02638495},"labels":[],"label_agreement":null},{"id":"W2956823442","doi":"10.1137/19m1303010","title":"Maximum Rectilinear Convex Subsets","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Agencia Estatal de Investigación; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Comisión Nacional de Investigación Científica y Tecnológica; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Ministerio de Ciencia e Innovación; Gobierno de Aragón; Natural Sciences and Engineering Research Council of Canada; European Commission; Universidad de Santiago de Chile","keywords":"Convex hull; Mathematics; Combinatorics; Regular polygon; Convex set; Boundary (topology); Polygon (computer graphics); Convex polygon; Computational geometry; Orthogonal convex hull; Interior point method; Polygon covering; Point (geometry); Time complexity; Plane (geometry); Convex body; Algorithm; Geometry; Convex optimization; Mathematical analysis; Computer science","score_opus":0.01997149189643241,"score_gpt":0.27068021760967814,"score_spread":0.25070872571324576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956823442","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.106801696,0.0008082006,0.85727483,0.0007088232,0.00009318701,0.00022281139,0.0013978025,0.000800119,0.03189253],"genre_scores_gemma":[0.3736022,0.00077564846,0.60494304,0.00015419043,0.00009079312,0.0002862953,0.002961306,0.0002905219,0.0168961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926823,0.00016333406,0.000051343024,0.0001985751,0.00022441417,0.00009410003],"domain_scores_gemma":[0.9990227,0.000441834,0.00010655858,0.0002428221,0.00012205333,0.00006396757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576673,0.0009080064,0.00086364115,0.000982138,0.00051999686,0.0012699595,0.0010975108,0.00056708266,0.0072549433],"category_scores_gemma":[0.0033805235,0.0005935732,0.00085509976,0.0014061399,0.0006676475,0.0023288082,0.0017019947,0.0010793298,0.001103325],"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.0005566749,0.000122836,0.0026323926,0.0005381521,0.000085351276,0.00035977605,0.00048097558,0.3701314,0.013584062,0.2829782,0.016302103,0.31222814],"study_design_scores_gemma":[0.00008866197,0.000111688496,0.00119849,0.00008388888,0.00002679522,0.00029591133,0.00020920354,0.7603098,0.0087223565,0.20013168,0.028796094,0.000025360592],"about_ca_topic_score_codex":0.001345474,"about_ca_topic_score_gemma":0.0019341093,"teacher_disagreement_score":0.0072549433,"about_ca_system_score_codex":0.000633305,"about_ca_system_score_gemma":0.00046149455,"threshold_uncertainty_score":0.024270177},"labels":[],"label_agreement":null},{"id":"W2970866601","doi":"10.1137/20m1362899","title":"Want to Gather? No Need to Chatter!","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Node (physics); A priori and a posteriori; Computer science; Task (project management); Product (mathematics); Time complexity; Polynomial; Upper and lower bounds; Theoretical computer science; Mathematics; Algorithm; Engineering","score_opus":0.04709621463748689,"score_gpt":0.31005201720830283,"score_spread":0.26295580257081597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970866601","genre_codex":"commentary","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.09047997,0.008439689,0.141959,0.45514327,0.0057389396,0.00015252637,0.0010557191,0.0012556304,0.29577532],"genre_scores_gemma":[0.6848326,0.005316182,0.05620365,0.032085378,0.0023305186,0.00026685643,0.0010031601,0.0006141231,0.21734756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998771,0.00055041973,0.000040279512,0.00029584643,0.0001632419,0.00017920378],"domain_scores_gemma":[0.99530655,0.00264403,0.00036363452,0.00052072,0.00043043,0.00073453184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017663722,0.00048288563,0.0006906652,0.00040199826,0.002363406,0.0025998955,0.0009938986,0.003842301,0.029545657],"category_scores_gemma":[0.010975679,0.0005603312,0.00046145098,0.0005254774,0.0033793703,0.010588867,0.002658278,0.0037128543,0.011013228],"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.0006963936,0.00027275557,0.0059805876,0.0011302247,0.000101296886,0.001120459,0.007717462,0.0018865924,0.005264759,0.5554923,0.26655236,0.15378481],"study_design_scores_gemma":[0.00007748051,0.0001564597,0.0031228561,0.000332109,0.000054882257,0.0017675642,0.01180027,0.0070296475,0.0017845704,0.66934586,0.30440712,0.00012117824],"about_ca_topic_score_codex":0.0011849344,"about_ca_topic_score_gemma":0.0017024955,"teacher_disagreement_score":0.029545657,"about_ca_system_score_codex":0.0005869527,"about_ca_system_score_gemma":0.00053647987,"threshold_uncertainty_score":0.09884012},"labels":[],"label_agreement":null},{"id":"W2999758721","doi":"10.1137/21m1397854","title":"How to Trap a Gradient Flow","year":2024,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","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":"Azrieli Foundation; Microsoft Research","keywords":"Dimension (graph theory); Combinatorics; Mathematics; Logarithm; Gradient descent; Omega; Balanced flow; Upper and lower bounds; Function (biology); Polynomial; Domain (mathematical analysis); Binary logarithm; Discrete mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.027508052989913663,"score_gpt":0.27600075768863036,"score_spread":0.2484927046987167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999758721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073987454,0.00091440364,0.90485495,0.004495981,0.00030317093,0.00022687143,0.00037536712,0.0030337179,0.011808083],"genre_scores_gemma":[0.53082705,0.0005539666,0.45173275,0.0015278852,0.00013839401,0.00032483027,0.0006926425,0.0006393845,0.013563088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925417,0.00017387158,0.000039245708,0.00018853378,0.00016668446,0.00017759738],"domain_scores_gemma":[0.9976674,0.0014368236,0.00016862669,0.000325881,0.00021232213,0.00018896536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014597256,0.0008877326,0.0011531964,0.0007395599,0.0013276234,0.0016655901,0.0017054984,0.0026588216,0.008057935],"category_scores_gemma":[0.00871332,0.00073186075,0.0010652128,0.00061392784,0.0019996597,0.0041542985,0.0025714086,0.0025111374,0.0019931877],"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.00095481594,0.00040253383,0.004066353,0.0006099724,0.00016601734,0.00071535876,0.0007933792,0.3266312,0.012557698,0.4190567,0.03194681,0.20209914],"study_design_scores_gemma":[0.00008057283,0.0001468339,0.00023627418,0.00005530596,0.000026891734,0.00021056988,0.00011486546,0.8397905,0.004143529,0.14771898,0.0074356445,0.000039992217],"about_ca_topic_score_codex":0.003208218,"about_ca_topic_score_gemma":0.001771969,"teacher_disagreement_score":0.008057935,"about_ca_system_score_codex":0.0011175537,"about_ca_system_score_gemma":0.0016320266,"threshold_uncertainty_score":0.026956439},"labels":[],"label_agreement":null},{"id":"W3011353849","doi":"10.1137/20m1330762","title":"A Spectral Approach to Network Design","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Theoretical computer science","score_opus":0.024522106779222865,"score_gpt":0.22343676694356532,"score_spread":0.19891466016434245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011353849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086888514,0.00011661721,0.99494714,0.00017638168,0.000034060038,0.000017992834,0.00001751783,0.000053807846,0.0037675453],"genre_scores_gemma":[0.17364292,0.0010928945,0.8169023,0.00051748357,0.00021849012,0.00030535433,0.00012618832,0.00015362557,0.0070407265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782556,0.0009911377,0.00008346434,0.00032680915,0.00064801343,0.00012490233],"domain_scores_gemma":[0.99699867,0.0017116673,0.00018583676,0.0005968423,0.0004021239,0.000104871375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002808,0.0012105376,0.0007725503,0.0010554121,0.0008843977,0.001972455,0.0016630612,0.0012616075,0.0071595376],"category_scores_gemma":[0.0074715125,0.0006683325,0.0010717466,0.001195561,0.001995082,0.0029664398,0.0020471944,0.0032585831,0.0013013274],"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.000036570702,0.000055544937,0.00015182485,0.00013380095,0.0000286888,0.000044175078,0.00008134655,0.33240345,0.0022160131,0.6109193,0.002437618,0.051491678],"study_design_scores_gemma":[0.000012723665,0.000043070457,0.00003469705,0.000031269137,0.000009910845,0.000051709445,0.00002610851,0.65763617,0.0011241125,0.3328156,0.008203065,0.000011578557],"about_ca_topic_score_codex":0.0010063354,"about_ca_topic_score_gemma":0.0013907056,"teacher_disagreement_score":0.0071595376,"about_ca_system_score_codex":0.0015978424,"about_ca_system_score_gemma":0.0013116946,"threshold_uncertainty_score":0.023950994},"labels":[],"label_agreement":null},{"id":"W3082318583","doi":"10.1137/20m135515x","title":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Code word; Decoding methods; Block (permutation group theory); List decoding; Constant (computer programming); Block code; Upper and lower bounds; Algorithm; Discrete mathematics; Combinatorics; Computer science; Concatenated error correction code","score_opus":0.02585537324071933,"score_gpt":0.24398451927618517,"score_spread":0.21812914603546585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082318583","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.16047569,0.0017552872,0.81422764,0.0020213271,0.00019249058,0.0005352085,0.002159212,0.0028987203,0.015734421],"genre_scores_gemma":[0.6613343,0.0010520049,0.32198212,0.00114717,0.00017105087,0.00075086456,0.0026982499,0.00058810547,0.010276122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577457,0.0006898616,0.00026795344,0.00086326466,0.0016153483,0.000789049],"domain_scores_gemma":[0.9848995,0.007076781,0.0012186369,0.0044146418,0.0019023044,0.00048817048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015636308,0.0013514954,0.001496932,0.00072757155,0.00091724313,0.0021497644,0.0026459717,0.0016057212,0.0040899203],"category_scores_gemma":[0.015954532,0.00060403056,0.0011081442,0.0018291022,0.0022870707,0.0041099354,0.003935632,0.0044016317,0.0017445051],"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.0019421517,0.0003214199,0.0025777407,0.0008453699,0.00013182961,0.0005460323,0.0010423454,0.4719072,0.045210827,0.35325915,0.015418723,0.10679728],"study_design_scores_gemma":[0.000273482,0.00042313346,0.0004673967,0.0001051782,0.000079653626,0.00045055168,0.00016371804,0.7779727,0.022871982,0.18904532,0.0080269445,0.000119922],"about_ca_topic_score_codex":0.004835597,"about_ca_topic_score_gemma":0.005797877,"teacher_disagreement_score":0.004835597,"about_ca_system_score_codex":0.0027423226,"about_ca_system_score_gemma":0.004473605,"threshold_uncertainty_score":0.019897044},"labels":[],"label_agreement":null},{"id":"W3115467804","doi":"10.1137/20m1386542","title":"A Local Search Framework for Experimental Design","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":5,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Mathematical optimization; Local search (optimization); Regret; Randomized rounding; Rounding; Combinatorial search; Combinatorial optimization; Computer science; Mathematics; Beam stack search; Algorithm; Search algorithm; Approximation algorithm; Best-first search; Beam search; Machine learning","score_opus":0.04420174424423241,"score_gpt":0.3073670412413076,"score_spread":0.2631652969970752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115467804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002715962,0.00005127264,0.9986456,0.000057490743,0.0000111093905,0.000068422116,0.000017611881,0.0000715316,0.0008054189],"genre_scores_gemma":[0.046231173,0.00022138712,0.9495111,0.00026023982,0.000062480605,0.0018701992,0.00008850549,0.00011860186,0.0016363616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98350835,0.012253675,0.00054460333,0.0016225564,0.0016575948,0.00041330443],"domain_scores_gemma":[0.96709585,0.025580315,0.002058833,0.0034027016,0.0013590527,0.00050327886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022549575,0.002465859,0.0021333536,0.0022836113,0.000898547,0.0026399049,0.004230788,0.0022221452,0.009631278],"category_scores_gemma":[0.040980995,0.0015682956,0.0020920439,0.002170081,0.003927259,0.0031655142,0.0036100964,0.0048700995,0.0016308648],"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.00016269735,0.00014256069,0.00032763125,0.00028056704,0.00012579642,0.0000835637,0.00010852129,0.3567905,0.0022767333,0.5876908,0.0014880178,0.050522618],"study_design_scores_gemma":[0.00017314783,0.0002947316,0.00010252077,0.00007038204,0.00005010487,0.000056864472,0.000028977105,0.6208755,0.0014852955,0.36912268,0.007707526,0.00003224126],"about_ca_topic_score_codex":0.001058342,"about_ca_topic_score_gemma":0.00105722,"teacher_disagreement_score":0.022549575,"about_ca_system_score_codex":0.0030699188,"about_ca_system_score_gemma":0.0035487488,"threshold_uncertainty_score":0.11925495},"labels":[],"label_agreement":null},{"id":"W3126461544","doi":"10.1137/23m1573975","title":"Symmetries, Graph Properties, and Quantum Speedups","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"Army Research Office; U.S. Department of Defense; U.S. Department of Energy; Natural Sciences and Engineering Research Council of Canada; Samsung; National Science Foundation","keywords":"Permutation group; Adjacency list; Homogeneous space; Adjacency matrix; Speedup; Quantum algorithm; Mathematics; Combinatorics; Discrete mathematics; Quantum; Permutation (music); Computer science; Graph; Parallel computing; Quantum mechanics; Physics","score_opus":0.022882138199922932,"score_gpt":0.23874943412190666,"score_spread":0.21586729592198373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126461544","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.69016194,0.0007196783,0.2623648,0.0054260194,0.00016951228,0.00020285968,0.0006366664,0.0013608211,0.038957693],"genre_scores_gemma":[0.9705138,0.00020442673,0.026492862,0.00026357782,0.000067591754,0.000079780744,0.00018468646,0.00018916484,0.0020041028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980173,0.00048930134,0.00007596845,0.00039085036,0.0005593205,0.00046716895],"domain_scores_gemma":[0.98693186,0.00704269,0.00069386524,0.004538334,0.00040296753,0.00039026944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025373178,0.0006085293,0.0009641887,0.0006175284,0.001067859,0.0025534385,0.0013551029,0.0014915393,0.008250561],"category_scores_gemma":[0.013510785,0.0005126975,0.001109336,0.0008143069,0.0036232737,0.009169119,0.0020978905,0.00298697,0.00072203844],"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.0003984169,0.00018337657,0.0019851262,0.0001519564,0.00003922312,0.00013339554,0.00019166562,0.047121488,0.010332192,0.91720885,0.0034693899,0.018784862],"study_design_scores_gemma":[0.00005973705,0.00008283091,0.000645474,0.000014237751,0.000020721063,0.00011067239,0.00006691285,0.11486757,0.0060946494,0.8758157,0.002201336,0.000020260335],"about_ca_topic_score_codex":0.0009900536,"about_ca_topic_score_gemma":0.0010476301,"teacher_disagreement_score":0.008250561,"about_ca_system_score_codex":0.001886796,"about_ca_system_score_gemma":0.0016445348,"threshold_uncertainty_score":0.027600884},"labels":[],"label_agreement":null},{"id":"W3170119173","doi":"10.1137/22m1480616","title":"Unambiguous DNFs and Alon–Saks–Seymour","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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 Waterloo","funders":"European Regional Development Fund","keywords":"Mathematics; Logarithm; Combinatorics; Partition (number theory); Chromatic scale; Graph; Discrete mathematics; Extremal graph theory; Line graph; Voltage graph","score_opus":0.025012964549539742,"score_gpt":0.27128595249382187,"score_spread":0.24627298794428212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170119173","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.19888124,0.0010427736,0.7199123,0.009120461,0.00068278745,0.00017786995,0.0008208747,0.0018672129,0.067494474],"genre_scores_gemma":[0.73010635,0.00069818174,0.23897827,0.0022250551,0.00041880013,0.00022143956,0.0007487282,0.0006048866,0.025998306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970944,0.0005484389,0.00018483381,0.000792002,0.0008255192,0.00055479107],"domain_scores_gemma":[0.9938898,0.0036135598,0.00035700932,0.0011862703,0.0006326244,0.0003207486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021670382,0.00086255267,0.0009562132,0.0013099686,0.0018033509,0.0029648028,0.00251769,0.0015721666,0.009655081],"category_scores_gemma":[0.012563203,0.0006836382,0.0017689621,0.0018113082,0.0031639074,0.012699,0.004225542,0.005075205,0.0012803747],"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.00037031854,0.00014180111,0.00088323007,0.00020615714,0.000035700352,0.00025666386,0.00030036422,0.016840257,0.004529745,0.92551315,0.00697278,0.043949865],"study_design_scores_gemma":[0.00004960799,0.000043059492,0.0001970914,0.000024924466,0.00002932054,0.00011044307,0.000100794416,0.050336167,0.0032943657,0.9388625,0.006923087,0.00002863614],"about_ca_topic_score_codex":0.00548437,"about_ca_topic_score_gemma":0.0075774165,"teacher_disagreement_score":0.009655081,"about_ca_system_score_codex":0.0031019386,"about_ca_system_score_gemma":0.0018820479,"threshold_uncertainty_score":0.03229946},"labels":[],"label_agreement":null},{"id":"W4225101446","doi":"10.1137/22n975482","title":"Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Ninth; Combinatorics; Discrete mathematics; Computer science; Arithmetic; Physics","score_opus":0.03321610467084326,"score_gpt":0.2608543157344119,"score_spread":0.22763821106356866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225101446","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015203198,0.026177092,0.016517634,0.048024017,0.73166233,0.0008819553,0.009189693,0.0044380394,0.161589],"genre_scores_gemma":[0.008602785,0.0372043,0.0070009115,0.024795748,0.3844043,0.0013485355,0.01711609,0.0050428323,0.51448447],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9907198,0.0017970994,0.00083902455,0.0021215007,0.003626545,0.0008959548],"domain_scores_gemma":[0.98158115,0.004074976,0.00093865645,0.0024183812,0.00732914,0.0036576688],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0061029657,0.0033684834,0.0065384097,0.004575749,0.0042398716,0.015137607,0.0034817692,0.004122275,0.39488134],"category_scores_gemma":[0.019005848,0.001501747,0.0025463304,0.00564998,0.0022667225,0.009025447,0.0054525165,0.010276189,0.2651089],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000042162934,0.000028698654,0.00010659692,0.00016172063,0.000018316656,0.000026863723,0.00001622292,0.00006633002,0.00012331955,0.001993522,0.9810501,0.01636616],"study_design_scores_gemma":[0.000047560065,0.000059701837,0.00048322117,0.00031964487,0.000026525675,0.00009952437,0.000042201995,0.0005994765,0.00012731897,0.0033094513,0.9948567,0.000028566576],"about_ca_topic_score_codex":0.0018602463,"about_ca_topic_score_gemma":0.003552342,"teacher_disagreement_score":0.39488134,"about_ca_system_score_codex":0.005524374,"about_ca_system_score_gemma":0.005430983,"threshold_uncertainty_score":0.8631283},"labels":[],"label_agreement":null},{"id":"W4320487114","doi":"10.1137/18m1233418","title":"Inapproximability of Matrix \\(\\boldsymbol{p \\rightarrow q}\\) Norms","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Combinatorics; Hardness of approximation; Approximation algorithm; Exponential time hypothesis; Matrix (chemical analysis); Norm (philosophy); Matrix norm; Exponential function; Constant (computer programming); Discrete mathematics; Time complexity; Computer science; Physics; Eigenvalues and eigenvectors; Quantum mechanics; Mathematical analysis","score_opus":0.023548463633614986,"score_gpt":0.2929863234056024,"score_spread":0.2694378597719874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320487114","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.26851597,0.006836442,0.66630954,0.012854038,0.0009994693,0.00028389142,0.002594655,0.002481051,0.03912494],"genre_scores_gemma":[0.81679726,0.0019094197,0.15680648,0.0021518075,0.0013048192,0.00048673767,0.0034021533,0.0007209141,0.01642041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946786,0.001966302,0.00023267999,0.0012999239,0.0011216126,0.0007009217],"domain_scores_gemma":[0.9720044,0.022247154,0.0018082311,0.0014808953,0.0015640701,0.0008952679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004160213,0.0020844473,0.0018236717,0.001057286,0.001168576,0.004769187,0.0034112823,0.0030510908,0.0065402],"category_scores_gemma":[0.029404044,0.0006571618,0.0013751063,0.0019604603,0.0036054149,0.0072450726,0.0034311314,0.0051078205,0.0021185502],"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.0013190117,0.00058095437,0.0027908445,0.0013485466,0.000259856,0.00033498774,0.0006707001,0.22959612,0.0040774075,0.6140524,0.041285682,0.103683606],"study_design_scores_gemma":[0.00010376144,0.00016192035,0.00021461766,0.00007571704,0.00003144596,0.00018349379,0.00012791499,0.43697912,0.0027351922,0.55641615,0.0029388168,0.00003184022],"about_ca_topic_score_codex":0.0018174318,"about_ca_topic_score_gemma":0.0015234773,"teacher_disagreement_score":0.0065402,"about_ca_system_score_codex":0.002291859,"about_ca_system_score_gemma":0.002134882,"threshold_uncertainty_score":0.022001565},"labels":[],"label_agreement":null},{"id":"W4385404176","doi":"10.1137/20m1375851","title":"Why Extension-Based Proofs Fail","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"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; Intel Corporation; U.S. Department of Energy; Oracle; European Research Council; National Science Foundation","keywords":"Mathematical proof; Impossibility; Computer science; Extension (predicate logic); Iterated function; Theoretical computer science; Mathematics; Gas meter prover; Discrete mathematics; Asynchronous communication; Programming language","score_opus":0.02448646008733901,"score_gpt":0.27120114138653145,"score_spread":0.24671468129919244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385404176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03774154,0.006124096,0.8882785,0.028458308,0.0014159684,0.0002135385,0.00022307136,0.0021261119,0.03541883],"genre_scores_gemma":[0.75553274,0.004357979,0.22346152,0.0055763144,0.0013547762,0.00054957386,0.00033414373,0.0010582217,0.0077746892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9622871,0.019337071,0.0022836428,0.003924287,0.009802197,0.0023657386],"domain_scores_gemma":[0.76067024,0.18875091,0.007008441,0.02824485,0.013117587,0.0022079856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03777941,0.0011185181,0.0013370787,0.0018462156,0.0027595821,0.0064361785,0.004049806,0.004891151,0.0071234247],"category_scores_gemma":[0.15142049,0.0017089344,0.002182655,0.0012649803,0.013709523,0.030818477,0.00942908,0.00892132,0.0030581206],"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.00008750879,0.000034682645,0.00056013133,0.0003156047,0.00004652267,0.00035871367,0.00083823386,0.0048226905,0.00061329943,0.96575093,0.004524637,0.022047099],"study_design_scores_gemma":[0.000045173107,0.00002622322,0.000053095922,0.00009210622,0.000013647141,0.00028143247,0.0000811911,0.0067241397,0.0010391861,0.97950876,0.012106494,0.00002848777],"about_ca_topic_score_codex":0.00049860054,"about_ca_topic_score_gemma":0.00026476086,"teacher_disagreement_score":0.03777941,"about_ca_system_score_codex":0.0018022816,"about_ca_system_score_gemma":0.002423685,"threshold_uncertainty_score":0.199799},"labels":[],"label_agreement":null},{"id":"W4392238446","doi":"10.1137/18m1234849","title":"Four-Coloring \\(\\boldsymbol{P_6}\\)-Free Graphs. II. Finding an Excellent Precoloring","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced Graph Theory Research","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":"Army Research Office; National Science Foundation","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; Discrete mathematics; Graph; Line graph","score_opus":0.05692025520573841,"score_gpt":0.3279586546606393,"score_spread":0.2710383994549009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392238446","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.50726163,0.0007149943,0.43347222,0.0022173491,0.00023409691,0.00028065103,0.0024102437,0.0021395169,0.051269345],"genre_scores_gemma":[0.66079706,0.00051917916,0.296409,0.0007001156,0.00012037765,0.00017976134,0.004715343,0.0007487249,0.035810445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995116,0.00007340775,0.000022191196,0.00015495507,0.000097554606,0.00014032867],"domain_scores_gemma":[0.9985623,0.00052481523,0.00021387174,0.000394765,0.00013817911,0.0001659926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018402,0.0005514217,0.00058694463,0.00060616987,0.00127928,0.0011538579,0.0012039514,0.00049653667,0.0075937104],"category_scores_gemma":[0.0011841124,0.00054034346,0.0006947847,0.0009622983,0.00083969557,0.0025711067,0.0017618563,0.0017013882,0.0012044017],"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.0014773216,0.00048754454,0.010775159,0.0011149527,0.00014454169,0.0012948783,0.00090493815,0.061859895,0.08664287,0.48694402,0.055981386,0.29237252],"study_design_scores_gemma":[0.00008934075,0.00022262406,0.004455786,0.00007775083,0.000089160734,0.001261309,0.00036426575,0.08960989,0.066145465,0.75312656,0.08447861,0.00007922478],"about_ca_topic_score_codex":0.0013425753,"about_ca_topic_score_gemma":0.0028694102,"teacher_disagreement_score":0.0075937104,"about_ca_system_score_codex":0.0010025435,"about_ca_system_score_gemma":0.000584439,"threshold_uncertainty_score":0.0254035},"labels":[],"label_agreement":null},{"id":"W4400213152","doi":"10.1137/23m1548633","title":"Complexity Classification of Counting Graph Homomorphisms Modulo a Prime Number","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Homomorphism; Prime (order theory); Prime number; Combinatorics; Mathematics; Discrete mathematics; Graph; Computer science","score_opus":0.0611886896354861,"score_gpt":0.34249233135040036,"score_spread":0.2813036417149143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400213152","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.78696024,0.0011219803,0.1656968,0.0068895984,0.00032938973,0.00020837985,0.0013942405,0.001106152,0.03629322],"genre_scores_gemma":[0.9540845,0.0005008312,0.03327757,0.00047334132,0.0008383305,0.00013673198,0.0016885764,0.0002783133,0.008721873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970843,0.00064134935,0.00014525041,0.0008022921,0.00080549094,0.0005212522],"domain_scores_gemma":[0.97341406,0.019909149,0.0020100505,0.0022099593,0.0009647143,0.0014920215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020675804,0.0010543395,0.0016361767,0.0037310205,0.0022790334,0.007017684,0.0038066853,0.0025751805,0.00939039],"category_scores_gemma":[0.018854188,0.00070515723,0.0015806968,0.003832454,0.0034870165,0.013878396,0.0028341883,0.0042638406,0.0006699395],"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.0006319965,0.0004177339,0.009334278,0.00035548615,0.00008368833,0.00023457075,0.0008287365,0.021718334,0.0051593096,0.8991276,0.012047109,0.05006125],"study_design_scores_gemma":[0.00005914997,0.0000651688,0.0020570157,0.00003476929,0.000055430548,0.00028707628,0.00015748195,0.106707714,0.0022092278,0.88603806,0.0022930286,0.000035810845],"about_ca_topic_score_codex":0.0018471227,"about_ca_topic_score_gemma":0.0016541688,"teacher_disagreement_score":0.00939039,"about_ca_system_score_codex":0.0042730463,"about_ca_system_score_gemma":0.00186544,"threshold_uncertainty_score":0.031413972},"labels":[],"label_agreement":null},{"id":"W4401249586","doi":"10.1137/20m1322923","title":"Revisionist Simulations: A New Approach to Proving Space Lower Bounds","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Toronto","funders":"","keywords":"Space (punctuation); Computer science; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Discrete mathematics","score_opus":0.023221807404975082,"score_gpt":0.2927665417462249,"score_spread":0.2695447343412498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401249586","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.0059482674,0.0002527077,0.9839797,0.0010585497,0.0001491348,0.00007032734,0.000118807,0.0004668672,0.007955677],"genre_scores_gemma":[0.5428224,0.0014214522,0.43100166,0.0020960043,0.0017546015,0.0007967729,0.0007466665,0.0013405954,0.018019872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9857013,0.0057362053,0.00073707453,0.0017102932,0.005014528,0.0011005948],"domain_scores_gemma":[0.91554224,0.062414203,0.0025388822,0.012697153,0.004979995,0.0018275984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008654919,0.0028092726,0.002958194,0.0038732118,0.00254775,0.006287402,0.007585611,0.0038797064,0.011362282],"category_scores_gemma":[0.058985725,0.002365247,0.006055225,0.0034320315,0.007998903,0.019804044,0.013707839,0.013466058,0.0017240207],"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.0002065844,0.00008952884,0.0006881256,0.00019598247,0.00014326739,0.00016290059,0.0003571534,0.056025505,0.0018315774,0.9136015,0.0040439223,0.022653962],"study_design_scores_gemma":[0.000029149644,0.000037047725,0.00007531933,0.00003221679,0.000051201678,0.000052543117,0.000036497324,0.1859357,0.0012734968,0.80934733,0.0030995696,0.000029888814],"about_ca_topic_score_codex":0.0020607137,"about_ca_topic_score_gemma":0.0026865618,"teacher_disagreement_score":0.011362282,"about_ca_system_score_codex":0.0031455127,"about_ca_system_score_gemma":0.0026671332,"threshold_uncertainty_score":0.045772135},"labels":[],"label_agreement":null},{"id":"W4407294025","doi":"10.1137/23m1545938","title":"An Approximate Generalization of the Okamura–Seymour Theorem","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization; Mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.010563725240247072,"score_gpt":0.27351737281580957,"score_spread":0.2629536475755625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407294025","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.043800958,0.0019793322,0.8724708,0.0022631385,0.001388613,0.000109614586,0.0004104051,0.0003318143,0.07724529],"genre_scores_gemma":[0.665766,0.0028963506,0.26482487,0.001843356,0.0015003651,0.00027949814,0.0008447096,0.0008152705,0.061229568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918455,0.00017494106,0.000037466627,0.00018206575,0.00030175026,0.00011921765],"domain_scores_gemma":[0.9982743,0.00078779523,0.00010728155,0.0003647755,0.0003465131,0.00011937344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011998718,0.00083184405,0.0012986646,0.0017629545,0.0012270625,0.0016155997,0.0020255337,0.0012718557,0.010455747],"category_scores_gemma":[0.007957996,0.00038776416,0.0014402652,0.001567018,0.0016091489,0.0043540066,0.0041440506,0.0025326335,0.0018227537],"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.00014934257,0.00008148168,0.0010834225,0.00028349512,0.000069700895,0.00024298485,0.00025378383,0.026474217,0.0054072286,0.88661385,0.011951657,0.06738881],"study_design_scores_gemma":[0.00002821196,0.000067961555,0.00096703955,0.000044368826,0.000044957123,0.00029713532,0.00009082266,0.28243986,0.002096297,0.69548684,0.018397579,0.00003891049],"about_ca_topic_score_codex":0.0022062843,"about_ca_topic_score_gemma":0.002453971,"teacher_disagreement_score":0.010455747,"about_ca_system_score_codex":0.0007745702,"about_ca_system_score_gemma":0.0008967684,"threshold_uncertainty_score":0.034977973},"labels":[],"label_agreement":null},{"id":"W4413132918","doi":"10.1137/23m1549353","title":"A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fujitsu Laboratories of America; National Research Foundation Singapore; Innovation, Science and Economic Development Canada","keywords":"Communication complexity; Quantum entanglement; Upper and lower bounds; Discrete mathematics; Quantum; Quantum information science; Mathematics; Quantum cryptography; Direct product; Quantum information; Quantum key distribution; Combinatorics; Physics; Quantum mechanics","score_opus":0.0230217637800299,"score_gpt":0.29755193218593035,"score_spread":0.27453016840590044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413132918","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.020495577,0.0038472016,0.87479246,0.0058287764,0.0010212271,0.00009192696,0.00035475157,0.00024609966,0.093321994],"genre_scores_gemma":[0.6684186,0.008034166,0.2501213,0.0037341113,0.0070497743,0.00074730034,0.0007526653,0.0007715194,0.060370628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980464,0.0005446812,0.00009356876,0.00042205097,0.0007039515,0.00018941377],"domain_scores_gemma":[0.9907534,0.006670202,0.0003030852,0.0009474652,0.0010277636,0.00029810017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030567718,0.001898553,0.002135792,0.0026595944,0.0022962815,0.0041867644,0.0029438944,0.0026380185,0.0126645975],"category_scores_gemma":[0.011083789,0.0009413083,0.002679823,0.0028158498,0.0065098796,0.0149198705,0.0057546482,0.008587418,0.0025816162],"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.000010729717,0.000013189625,0.000047346428,0.00003770203,0.0000059304425,0.000018841587,0.000042325664,0.0011506303,0.00021544493,0.9923847,0.0018827884,0.0041904235],"study_design_scores_gemma":[0.00000514697,0.000008918264,0.000032606476,0.000007735572,0.0000040589534,0.00003661565,0.0000059796043,0.008796557,0.00015101301,0.9891104,0.0018322456,0.000008655806],"about_ca_topic_score_codex":0.0009654532,"about_ca_topic_score_gemma":0.00074443105,"teacher_disagreement_score":0.0126645975,"about_ca_system_score_codex":0.002308345,"about_ca_system_score_gemma":0.0014229774,"threshold_uncertainty_score":0.04236728},"labels":[],"label_agreement":null},{"id":"W4416902920","doi":"10.1137/24m1635570","title":"Exact Algorithms and Lower Bounds for Stable Instances of Euclidean \\(\\boldsymbol{k}\\)- <scp>means</scp>","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Euclidean geometry; Approximation algorithm; Upper and lower bounds; Time complexity; Euclidean domain; Euclidean distance","score_opus":0.018779879089882767,"score_gpt":0.2781844359888292,"score_spread":0.2594045568989464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416902920","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.16163744,0.005721701,0.7044347,0.013963054,0.001474941,0.00078396086,0.007108552,0.005515757,0.09935988],"genre_scores_gemma":[0.60635173,0.0018156406,0.3498165,0.0021425837,0.0012556656,0.0008134715,0.009270215,0.0035201812,0.025013939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99311674,0.0015309256,0.0003402503,0.0018664273,0.0015768494,0.0015688419],"domain_scores_gemma":[0.96524805,0.02356062,0.002208001,0.005030678,0.0022056734,0.0017469623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00514006,0.0041194097,0.0034801995,0.0034232605,0.003594494,0.0108627025,0.011533118,0.0050912993,0.038280357],"category_scores_gemma":[0.037374225,0.0020381915,0.0036928095,0.0071466793,0.0042135925,0.016624628,0.007509323,0.009172278,0.006556437],"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.0026960657,0.0015347867,0.0037288154,0.0016427634,0.0003874399,0.00022929106,0.00066248747,0.32448414,0.004455024,0.42237428,0.098804764,0.13900025],"study_design_scores_gemma":[0.00018257732,0.00013121824,0.00060488674,0.00010817316,0.00010768005,0.00014401256,0.00018220142,0.5907785,0.0021942316,0.40204766,0.0034660788,0.000052654123],"about_ca_topic_score_codex":0.0056802644,"about_ca_topic_score_gemma":0.015047399,"teacher_disagreement_score":0.038280357,"about_ca_system_score_codex":0.007616015,"about_ca_system_score_gemma":0.007833195,"threshold_uncertainty_score":0.12806058},"labels":[],"label_agreement":null},{"id":"W4417317377","doi":"10.1137/24m1653173","title":"Testing Graph Properties with the Container Method","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"","score_opus":0.03708113139195662,"score_gpt":0.2806205290011702,"score_spread":0.24353939760921356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417317377","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.32893053,0.00020970221,0.64746875,0.0010973975,0.00030871463,0.0003769825,0.002411816,0.00879916,0.010396974],"genre_scores_gemma":[0.7719459,0.00010783441,0.22040018,0.0002294328,0.0000829902,0.00038663013,0.0030756395,0.0015330812,0.002238305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920819,0.0024121408,0.00048007048,0.001958386,0.0022196837,0.00084785616],"domain_scores_gemma":[0.95743465,0.019994438,0.0024497996,0.016122116,0.0028384328,0.0011604961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036853463,0.0014597519,0.001477879,0.002051994,0.0010814772,0.001954865,0.0039734626,0.002147921,0.0083085345],"category_scores_gemma":[0.031810943,0.0009272299,0.0028701758,0.0017467005,0.0026072185,0.011233396,0.005135307,0.0027374106,0.0016635283],"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.006259054,0.0025227692,0.09929316,0.0012858345,0.00096270395,0.0017206799,0.0008604106,0.17185232,0.06316832,0.2099381,0.04720383,0.39493287],"study_design_scores_gemma":[0.00036264645,0.0010362846,0.005278906,0.00011455675,0.00020711464,0.0007070042,0.0007162181,0.74568117,0.040233556,0.19800812,0.0075532864,0.00010115326],"about_ca_topic_score_codex":0.0031076001,"about_ca_topic_score_gemma":0.0029172031,"teacher_disagreement_score":0.0083085345,"about_ca_system_score_codex":0.0008920783,"about_ca_system_score_gemma":0.002543168,"threshold_uncertainty_score":0.027794778},"labels":[],"label_agreement":null},{"id":"W4417317418","doi":"10.1137/22m1534407","title":"Cheeger’s Inequalities for Vertex Expansion and Reweighted Eigenvalues","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; Shanghai University; National Natural Science Foundation of China","keywords":"Eigenvalues and eigenvectors; Vertex (graph theory); Omega; Inequality; Minification; Series expansion","score_opus":0.09680532953350661,"score_gpt":0.3964818199507716,"score_spread":0.29967649041726496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417317418","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.03200041,0.002498612,0.8885701,0.002710722,0.00079893693,0.00009015503,0.000416751,0.00022334896,0.07269105],"genre_scores_gemma":[0.62781286,0.0055074976,0.26101637,0.0026414492,0.0016367903,0.0006669009,0.00080404716,0.0015409633,0.09837319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979006,0.0007849862,0.00008680118,0.00039173715,0.00049582997,0.00033995477],"domain_scores_gemma":[0.98931867,0.007877364,0.0004802854,0.0008679371,0.001019163,0.00043662434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020444,0.0023849278,0.0017854952,0.004375524,0.0014369068,0.0035626919,0.0041361004,0.0027957894,0.017783772],"category_scores_gemma":[0.02038225,0.00093516975,0.0018892481,0.003136523,0.0044691544,0.010155096,0.0038264152,0.008127026,0.002746069],"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.000057846493,0.000035502027,0.00012278659,0.00010392527,0.000022639382,0.000083385414,0.00015575506,0.010568254,0.0017297637,0.97135913,0.0037575974,0.012003401],"study_design_scores_gemma":[0.000010183107,0.000010242305,0.00012077188,0.000037475766,0.000013103544,0.00004947481,0.000048297665,0.08932681,0.0006004105,0.907384,0.0023747068,0.000024546804],"about_ca_topic_score_codex":0.0022333632,"about_ca_topic_score_gemma":0.0027463262,"teacher_disagreement_score":0.017783772,"about_ca_system_score_codex":0.0024993918,"about_ca_system_score_gemma":0.0010377014,"threshold_uncertainty_score":0.059492588},"labels":[],"label_agreement":null}]}