{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040459614,0.00043412403,0.9544281,0.0030816756,0.0007650788,0.00020182709,0.0000012173256,0.00015562668,0.00047273593],"genre_scores_gemma":[0.576987,0.000031321964,0.42079514,0.0014270497,0.0007045104,0.0000012967615,8.6765874e-7,0.000012495467,0.000040249113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983427,0.0000675609,0.00041045976,0.0003665967,0.00032003006,0.0004926391],"domain_scores_gemma":[0.99896723,0.00026339784,0.00023761406,0.00024323277,0.00009704772,0.00019148306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009521146,0.00020839517,0.0002574793,0.00021819159,0.0008260222,0.0007316255,0.00069288566,0.00005573423,0.0000029753066],"category_scores_gemma":[0.000036265956,0.00018590635,0.00014232354,0.00027725918,0.00003357106,0.00039249065,0.00013707054,0.00046342547,0.0000056486538],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009185699,0.00009841671,0.0000355718,0.0000251586,0.00002763146,0.00003616755,0.0011415506,0.0027583581,0.00040201965,0.1682562,0.00038486658,0.8268249],"study_design_scores_gemma":[0.001066591,0.00095692335,0.0020768065,0.0003271166,0.0000090850435,0.0013934919,0.00006413714,0.39937583,0.00024817395,0.590581,0.0034878082,0.00041306214],"about_ca_topic_score_codex":0.000001821507,"about_ca_topic_score_gemma":4.584344e-7,"teacher_disagreement_score":0.82641184,"about_ca_system_score_codex":0.0000410331,"about_ca_system_score_gemma":0.00004137037,"threshold_uncertainty_score":0.7581041},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16274403,0.00006564785,0.82738745,0.0011972312,0.0021681003,0.000083341285,2.7709004e-7,0.00008255454,0.006271358],"genre_scores_gemma":[0.588158,0.0000014165698,0.4112263,0.0002445262,0.00033945474,3.1970896e-7,2.0950255e-7,0.0000064179662,0.000023375918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981178,0.0004044222,0.0004099217,0.0002449012,0.00044357427,0.00037938802],"domain_scores_gemma":[0.9989318,0.00010523167,0.00026103007,0.00033096992,0.00012287182,0.00024808518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027130812,0.00013653401,0.0002020297,0.00022834563,0.0001580033,0.0002491691,0.00088037294,0.000060401813,0.000003530774],"category_scores_gemma":[0.0003923948,0.00012676434,0.000061919374,0.00048643255,0.000053210235,0.00041365754,0.00023767742,0.0006175648,0.0000730126],"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.00019882205,0.00054707075,0.006301741,0.00002959206,0.000040182942,0.00051773986,0.009539853,0.063834354,0.0010476253,0.551865,0.010613046,0.35546502],"study_design_scores_gemma":[0.0011878104,0.00031017722,0.013228609,0.00010180951,0.0000020851814,0.0005877717,0.0001442656,0.97228223,0.0014923085,0.0048070704,0.0055747624,0.0002810851],"about_ca_topic_score_codex":0.000027302875,"about_ca_topic_score_gemma":0.0000050318868,"teacher_disagreement_score":0.9084479,"about_ca_system_score_codex":0.0003303296,"about_ca_system_score_gemma":0.00016934458,"threshold_uncertainty_score":0.51693},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6021169,0.00091862946,0.39468288,0.000021068758,0.0003430704,0.00016138452,3.2640088e-7,0.0000064927376,0.0017492727],"genre_scores_gemma":[0.95437914,0.00006692457,0.045035575,0.00016921459,0.00023514371,0.0000014754698,3.8916414e-7,0.000023226708,0.00008892061],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987241,0.0003965349,0.0002749514,0.00018367096,0.00018275798,0.0002379592],"domain_scores_gemma":[0.99933153,0.000077922734,0.00023230648,0.00018916378,0.00007369204,0.00009539296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006533883,0.00014305179,0.00018453346,0.000052589927,0.00012585559,0.000027037588,0.00016175305,0.00009340525,0.0000097076545],"category_scores_gemma":[0.00023620544,0.00012364602,0.00010299215,0.00006230698,0.00002627997,0.0000019770127,0.00002670012,0.00012878818,0.000009347069],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000055992132,0.00005177214,0.00038154089,0.000023942777,0.000059488728,0.00001566542,0.00006895294,0.00594696,0.9612208,0.00025761413,0.00010759231,0.031809676],"study_design_scores_gemma":[0.00053202215,0.0007687291,0.00041390606,0.00013111939,0.000018488,0.00021029913,0.000037261565,0.00042877096,0.9948334,0.0009159868,0.0015332082,0.00017679448],"about_ca_topic_score_codex":7.104328e-7,"about_ca_topic_score_gemma":7.644293e-8,"teacher_disagreement_score":0.35226226,"about_ca_system_score_codex":0.000010993744,"about_ca_system_score_gemma":0.000079013545,"threshold_uncertainty_score":0.50421387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02868611,0.00019001863,0.9655038,0.000738444,0.0020214014,0.00023996257,0.000006727575,0.00022250971,0.0023910068],"genre_scores_gemma":[0.533773,0.000009821172,0.4650389,0.00081915193,0.00030511344,0.0000023785801,0.000003936898,0.000019938012,0.000027779017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997409,0.00026704167,0.0006680468,0.0004698597,0.0005106225,0.00067543203],"domain_scores_gemma":[0.9973867,0.0011478006,0.0004555037,0.00037515568,0.00040756233,0.00022730108],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014383043,0.00028815592,0.00037889104,0.00027324204,0.0017628898,0.00071079115,0.0009069558,0.00007399109,0.000020642941],"category_scores_gemma":[0.00036007405,0.0002820814,0.00028126582,0.0007730462,0.0001155037,0.00040478428,0.00014326612,0.00063048006,0.000030257168],"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.000021562313,0.00053406623,0.0015509564,0.00010816541,0.00017386356,0.00008089042,0.001334654,0.06024648,0.00016254328,0.8104454,0.0057405373,0.119600855],"study_design_scores_gemma":[0.0010197703,0.00028619415,0.0013111988,0.00017468768,0.000013941111,0.0007080268,0.00015134791,0.8758022,0.0002772476,0.092461586,0.027339527,0.00045422482],"about_ca_topic_score_codex":0.000004071104,"about_ca_topic_score_gemma":0.0000025732422,"teacher_disagreement_score":0.81555575,"about_ca_system_score_codex":0.00010946412,"about_ca_system_score_gemma":0.000198208,"threshold_uncertainty_score":0.99996316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4997543,0.00013274627,0.47834048,0.0009292402,0.00092028565,0.0002459848,0.0000029367081,0.00013710019,0.01953692],"genre_scores_gemma":[0.9636979,0.000011111481,0.03426602,0.0001766726,0.001094981,0.0000010305639,0.0000015344718,0.00004406462,0.0007066748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977645,0.00012920081,0.0007849445,0.00022317137,0.0006602132,0.00043796975],"domain_scores_gemma":[0.9979992,0.0009663697,0.0003890839,0.000251697,0.00012269335,0.00027096638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013544095,0.00022754513,0.00042512149,0.00012632151,0.0003207753,0.00029214052,0.00030752434,0.0001231168,0.00011984637],"category_scores_gemma":[0.0005682017,0.00017224131,0.00019173487,0.00013321778,0.00003258604,0.00011662213,0.000110957684,0.000702524,0.00030459475],"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.000035488603,0.0010394164,0.00015063708,0.00026225587,0.00017362968,0.00025125025,0.00076507224,0.009145493,0.00033414917,0.80690634,0.0027907297,0.17814551],"study_design_scores_gemma":[0.00044954478,0.00017851949,0.000100076606,0.0005933991,0.000020352449,0.00065767276,0.000102912076,0.9259877,0.00002500665,0.06891893,0.0027227327,0.00024311017],"about_ca_topic_score_codex":0.0000023426085,"about_ca_topic_score_gemma":5.3580334e-7,"teacher_disagreement_score":0.9168422,"about_ca_system_score_codex":0.00015881626,"about_ca_system_score_gemma":0.000035421293,"threshold_uncertainty_score":0.7023797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.513966,0.00023293859,0.4809519,0.0013120996,0.0024490303,0.00023524916,0.0000071921163,0.00011817733,0.00072740536],"genre_scores_gemma":[0.743589,0.00002107827,0.25364578,0.0012853863,0.0013095821,0.000004032121,0.000014305213,0.000023783223,0.000107110594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970584,0.00023288516,0.00070286804,0.00078014034,0.0006993256,0.00052638166],"domain_scores_gemma":[0.9979073,0.00037052028,0.0005345743,0.00040585725,0.00034854695,0.00043322064],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011888712,0.0003985334,0.0004939652,0.0004822917,0.0012768313,0.0040773354,0.00083646155,0.00021305104,0.00002719181],"category_scores_gemma":[0.00014745168,0.0004058401,0.0001647607,0.0004266706,0.00005332349,0.00036316254,0.0008702753,0.001435044,0.000101737875],"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.000084942185,0.000442457,0.009172551,0.00044357002,0.00052833266,0.00025535643,0.007212163,0.2572948,0.002100705,0.09909428,0.023624787,0.59974605],"study_design_scores_gemma":[0.0018244383,0.00054659374,0.116818495,0.0051215854,0.00010448766,0.0025824904,0.00016007895,0.71866614,0.0015256414,0.12660487,0.023098864,0.002946296],"about_ca_topic_score_codex":0.0000281244,"about_ca_topic_score_gemma":0.0000035931425,"teacher_disagreement_score":0.59679973,"about_ca_system_score_codex":0.00015140702,"about_ca_system_score_gemma":0.00026658384,"threshold_uncertainty_score":0.99983937},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68166125,0.0003892379,0.30677012,0.0025659872,0.0040326975,0.00024922568,0.000002277798,0.0004730814,0.0038561167],"genre_scores_gemma":[0.9558435,0.000099719095,0.039928354,0.0020675396,0.0019458708,0.0000021220385,0.0000013148028,0.000049586935,0.000061988176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955182,0.0004942662,0.0008866053,0.00090019556,0.0010887297,0.0011120149],"domain_scores_gemma":[0.99658173,0.000597282,0.0007400036,0.0010162542,0.0005370317,0.00052771653],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018403707,0.0005139273,0.0005956636,0.000304417,0.0008094,0.0009230506,0.0021454196,0.0001667938,0.000047231206],"category_scores_gemma":[0.00027853245,0.00045833178,0.00037842555,0.00088918797,0.00008998647,0.0005673853,0.00086164393,0.001385693,0.0008553954],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010122846,0.0010958065,0.023955697,0.00008032061,0.0002087656,0.004824903,0.0013173291,0.049737368,0.005160997,0.002588424,0.015198111,0.89573103],"study_design_scores_gemma":[0.002991325,0.001374818,0.09049457,0.00086030434,0.000042157786,0.011204162,0.00017200987,0.8355356,0.0049974555,0.016318979,0.03387677,0.0021318635],"about_ca_topic_score_codex":0.0000055201904,"about_ca_topic_score_gemma":0.000006180159,"teacher_disagreement_score":0.8935992,"about_ca_system_score_codex":0.00031340524,"about_ca_system_score_gemma":0.00017347066,"threshold_uncertainty_score":0.9999226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06922815,0.0000369744,0.9256728,0.0024022018,0.00048797514,0.00007422088,8.3323437e-7,0.00004890446,0.0020478822],"genre_scores_gemma":[0.86337656,0.0000062166064,0.13584135,0.0005378395,0.00022531905,1.03708885e-7,3.1048825e-7,0.0000057221737,0.0000065746017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986017,0.00017758223,0.00047181506,0.0001678714,0.0003405268,0.00024054068],"domain_scores_gemma":[0.9987704,0.00031587514,0.0004555109,0.00021832275,0.00015150443,0.00008837064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007539427,0.0001237056,0.00016916892,0.00013976062,0.00053809804,0.00020497182,0.00046084492,0.000042112322,0.00008416779],"category_scores_gemma":[0.00011039975,0.00009359844,0.00010964713,0.00031166407,0.0003228826,0.00028943253,0.0001156947,0.00041913392,0.000012956526],"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.000008367515,0.00006198309,0.001999977,0.0000095763635,0.000047624697,0.000013306516,0.0011981213,0.38850734,0.0010243368,0.09780629,0.00008086906,0.50924224],"study_design_scores_gemma":[0.00037426886,0.000038282535,0.0073388503,0.00011235379,0.0000063594816,0.00040202867,0.000108955835,0.98885405,0.00058814883,0.0016369935,0.0004188393,0.00012086387],"about_ca_topic_score_codex":0.0000023398554,"about_ca_topic_score_gemma":0.0000029662406,"teacher_disagreement_score":0.7941484,"about_ca_system_score_codex":0.000085881016,"about_ca_system_score_gemma":0.00013105529,"threshold_uncertainty_score":0.41386697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14771299,0.0001944495,0.8496128,0.0004510735,0.00022093391,0.00013354796,8.2906826e-7,0.00010535155,0.001568069],"genre_scores_gemma":[0.92717654,0.0000056817894,0.07225835,0.00018273813,0.00027743645,0.000004034542,0.0000052792957,0.0000090947215,0.000080846956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985756,0.000087597975,0.00029226844,0.00031450452,0.0004457022,0.00028427062],"domain_scores_gemma":[0.9988307,0.00033438441,0.00025993097,0.00023785386,0.0002392903,0.0000978507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005447072,0.00015253604,0.00015644685,0.0006667955,0.00062243675,0.0003651876,0.0004286911,0.00003996265,0.000006222399],"category_scores_gemma":[0.000021836213,0.00012926095,0.0000785704,0.0022160127,0.00002741001,0.00030920937,0.00006857098,0.0003144176,0.000032680062],"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.000019747273,0.00039135217,0.002740147,0.000016287308,0.000046565397,0.00005549253,0.000059068912,0.61094284,0.0005895425,0.11026512,0.00068949483,0.27418432],"study_design_scores_gemma":[0.0015066921,0.00065619015,0.117811196,0.0000870723,0.000021580294,0.0016421347,0.00002597044,0.83944875,0.0011944725,0.025916208,0.01102208,0.00066764187],"about_ca_topic_score_codex":0.000006560366,"about_ca_topic_score_gemma":0.000007339437,"teacher_disagreement_score":0.7794635,"about_ca_system_score_codex":0.00010174484,"about_ca_system_score_gemma":0.00010415019,"threshold_uncertainty_score":0.5271109},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96546054,0.0006316783,0.0320187,0.00041067373,0.00067153864,0.00027603048,0.0000049039245,0.0000026371695,0.0005232992],"genre_scores_gemma":[0.9803897,0.000044950786,0.01766462,0.00058685313,0.0010674691,0.000010449188,0.0000064006626,0.000018927001,0.00021060502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908394,0.000033110122,0.00024904628,0.00021151136,0.000106658044,0.00031572973],"domain_scores_gemma":[0.9994192,0.000053753352,0.0001344837,0.00015431312,0.00014288462,0.000095344716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000261368,0.00014555744,0.00014096708,0.000035499,0.00023109277,0.00007826419,0.000167925,0.00006261719,0.000016987104],"category_scores_gemma":[0.00007296951,0.00012059733,0.00014500905,0.000029500681,0.00002638112,8.6704057e-7,0.00009854266,0.000100017656,0.000021362433],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014406908,0.00030211994,0.023106977,0.00006397104,0.00083863054,0.00001360705,0.0003563118,0.008978197,0.3325633,0.0002484414,0.051340375,0.582044],"study_design_scores_gemma":[0.010146631,0.011462239,0.2663156,0.00035451035,0.00020221222,0.00084679574,0.0009317919,0.0634501,0.20225704,0.028544199,0.41254863,0.0029402403],"about_ca_topic_score_codex":0.000004082832,"about_ca_topic_score_gemma":0.000003312768,"teacher_disagreement_score":0.5791037,"about_ca_system_score_codex":0.000016093856,"about_ca_system_score_gemma":0.000026261552,"threshold_uncertainty_score":0.49178162},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7292856,0.005335193,0.25785762,0.0027683466,0.0009110674,0.00014355335,5.290106e-7,0.000119917604,0.0035781797],"genre_scores_gemma":[0.99560064,0.00014320787,0.0038938483,0.00015895929,0.00015175522,2.6200223e-7,5.1853732e-8,0.000005049134,0.00004623051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891907,0.00010317315,0.00029172297,0.00016030454,0.00028236755,0.00024336234],"domain_scores_gemma":[0.9990555,0.00034931046,0.00024857177,0.00021396998,0.00006506935,0.0000675827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008886337,0.0000923079,0.00011201738,0.00007197296,0.00064180925,0.00022847274,0.00056900765,0.000027882224,0.0000031342195],"category_scores_gemma":[0.00017548827,0.00005844015,0.000048997546,0.00022477467,0.00007551815,0.00015331367,0.00015386005,0.0002292147,0.0000065885433],"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.00002267501,0.00027090524,0.00082648726,0.00006487774,0.00004760146,0.00006215707,0.004542011,0.004651112,0.0028400433,0.20481427,0.00630003,0.7755578],"study_design_scores_gemma":[0.00036755373,0.00031331886,0.0033753666,0.00025449562,0.0000045540996,0.000640563,0.00012452071,0.9855584,0.00096439454,0.0064678267,0.0017807494,0.00014825402],"about_ca_topic_score_codex":0.0000010033435,"about_ca_topic_score_gemma":3.361247e-7,"teacher_disagreement_score":0.98090726,"about_ca_system_score_codex":0.000020448548,"about_ca_system_score_gemma":0.000019792988,"threshold_uncertainty_score":0.49363425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.406796,0.00033653,0.5893268,0.0020739075,0.0010791244,0.00009359287,0.0000012487504,0.000048343278,0.00024445803],"genre_scores_gemma":[0.8043618,0.0000050221684,0.18994926,0.0041160337,0.0014630614,4.9795364e-7,0.0000031911625,0.000011443087,0.00008965184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982019,0.000050691404,0.00046355085,0.00033559828,0.00058775727,0.00036046997],"domain_scores_gemma":[0.9987259,0.00030531792,0.00018265542,0.00022882674,0.00020289292,0.00035439845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011691712,0.00018185584,0.00019011526,0.00034935924,0.00042657834,0.00023767397,0.0004465527,0.00005619168,0.000015744603],"category_scores_gemma":[0.000108773966,0.00016353218,0.00006795661,0.00047725078,0.00002238099,0.00024140115,0.00036476806,0.0003309054,0.000027708447],"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.00020592251,0.0005048725,0.004271883,0.00003736706,0.00017220252,0.00071819586,0.00094608666,0.13337637,0.011779661,0.028703367,0.0076481015,0.811636],"study_design_scores_gemma":[0.0028493637,0.0017135716,0.07951065,0.0004763155,0.000025387777,0.0024571456,0.000041817486,0.8696003,0.016120518,0.017277027,0.008962304,0.0009655943],"about_ca_topic_score_codex":0.000004293262,"about_ca_topic_score_gemma":0.000008578267,"teacher_disagreement_score":0.8106704,"about_ca_system_score_codex":0.000062008876,"about_ca_system_score_gemma":0.00008993496,"threshold_uncertainty_score":0.6668649},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77885354,0.000806064,0.2171264,0.0006930563,0.0018618541,0.000105100706,0.0000011217093,0.00013757587,0.0004153164],"genre_scores_gemma":[0.95740885,0.000009074587,0.041316256,0.00032503653,0.0009040613,4.7819344e-7,5.581801e-7,0.000019593259,0.00001610776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727285,0.000335141,0.00068666344,0.00029288352,0.00063444185,0.00077801204],"domain_scores_gemma":[0.99828696,0.00020448047,0.0005647287,0.00045844613,0.00018051118,0.0003048899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013926025,0.0002899232,0.0004398166,0.00031788432,0.0005443991,0.00018634336,0.0011093005,0.000078146106,0.000007476374],"category_scores_gemma":[0.00009868744,0.00021846528,0.00026855833,0.0005096678,0.00019120623,0.00033371747,0.00037798478,0.0007690401,0.000021855807],"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.00020192176,0.0029379197,0.024178935,0.00055705226,0.0005788146,0.0002116088,0.026201986,0.075339176,0.020912986,0.33464053,0.0036422429,0.5105968],"study_design_scores_gemma":[0.0011060397,0.0007391336,0.035801042,0.0009199399,0.000022083363,0.0014119261,0.00020320209,0.93550867,0.008721785,0.013170146,0.0015991612,0.00079689216],"about_ca_topic_score_codex":0.00001838437,"about_ca_topic_score_gemma":6.3826224e-7,"teacher_disagreement_score":0.8601695,"about_ca_system_score_codex":0.000047848305,"about_ca_system_score_gemma":0.00009104712,"threshold_uncertainty_score":0.8908756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6218022,0.00003419864,0.36505982,0.0007636981,0.00047707776,0.000049442922,0.0000033128692,0.00004545929,0.011764808],"genre_scores_gemma":[0.99626714,0.0000014852992,0.0022404662,0.0005472607,0.0006938978,1.6288894e-7,0.0000010674785,0.000007933664,0.00024056261],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973463,0.00014446242,0.0007409467,0.00024970027,0.0011370463,0.00038157112],"domain_scores_gemma":[0.9963131,0.0023073398,0.00042961436,0.00030406067,0.00041033013,0.00023553308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011467338,0.00011560637,0.00019771022,0.00014449196,0.00066668,0.0003744749,0.0006486035,0.000051711406,0.00018017126],"category_scores_gemma":[0.0019690564,0.00008550731,0.00012756293,0.0007748207,0.000047392212,0.00012795968,0.00009207082,0.00048372356,0.0005489864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020268362,0.00040268805,0.028839866,0.0000058193914,0.00007270098,0.00035669337,0.0025273082,0.022224342,0.0059718145,0.06658234,0.040037457,0.8327763],"study_design_scores_gemma":[0.0023088583,0.00042800058,0.25729066,0.00032210935,0.00003811411,0.002326264,0.0051353136,0.028040053,0.007882068,0.28497916,0.4102496,0.0009997825],"about_ca_topic_score_codex":0.0000012254981,"about_ca_topic_score_gemma":0.0000027198278,"teacher_disagreement_score":0.8317765,"about_ca_system_score_codex":0.00012477684,"about_ca_system_score_gemma":0.00007700012,"threshold_uncertainty_score":0.70562935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14171313,0.0012680396,0.84693825,0.0060341614,0.0018258863,0.00018978385,0.0000013516844,0.000083440005,0.001945971],"genre_scores_gemma":[0.92102444,0.00005518919,0.07773907,0.0007216384,0.0003526474,2.843746e-7,9.5900894e-8,0.0000073835663,0.00009923877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998602,0.000147807,0.00038547302,0.00021561248,0.00038311753,0.0002660073],"domain_scores_gemma":[0.9987816,0.0004243081,0.00025868413,0.00030307123,0.00009092391,0.00014137251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000795874,0.0001485932,0.00026938663,0.00014085596,0.00038255757,0.00023756451,0.000824835,0.00004063757,0.000018821731],"category_scores_gemma":[0.00007640564,0.000099938836,0.00016269223,0.00034544655,0.00011577071,0.0002501691,0.0002712994,0.00041582854,0.000011838955],"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.00008969784,0.00010028072,0.00040891577,0.0000144983605,0.00010041063,0.000018487735,0.0028137604,0.008232299,0.00017185173,0.09154362,0.0037424045,0.8927638],"study_design_scores_gemma":[0.004414647,0.00016013633,0.0062972615,0.0002292112,0.000014318304,0.00050895574,0.000068487774,0.95907885,0.00058101845,0.012765004,0.015624146,0.00025797085],"about_ca_topic_score_codex":0.000014930268,"about_ca_topic_score_gemma":0.000002262634,"teacher_disagreement_score":0.95084655,"about_ca_system_score_codex":0.000021239934,"about_ca_system_score_gemma":0.00007559163,"threshold_uncertainty_score":0.40753874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35577977,0.00012660274,0.64198077,0.00021711303,0.0009796217,0.000064230575,2.798736e-7,0.00010180545,0.0007497919],"genre_scores_gemma":[0.88642484,0.0000098109085,0.11258471,0.0007875398,0.00017074114,4.4442004e-7,1.621207e-7,0.000013101509,0.000008634573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984063,0.00013323005,0.0003293461,0.00039483295,0.00024906773,0.00048724422],"domain_scores_gemma":[0.998668,0.00044760155,0.00019702842,0.00029527722,0.00009619886,0.0002958675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011347994,0.00019434793,0.00025822502,0.00036237828,0.00075981347,0.0003635973,0.0006711811,0.000063038715,0.0000160282],"category_scores_gemma":[0.00015768786,0.0001852434,0.000090085836,0.00066467014,0.00003680654,0.00028889967,0.0005377204,0.00067449,0.000013384837],"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.000024917203,0.00012658292,0.0024762568,0.000013182157,0.00007255151,0.00024922937,0.002450325,0.009833244,0.00006423166,0.046482075,0.000099602505,0.9381078],"study_design_scores_gemma":[0.00045675758,0.00054932747,0.020636043,0.00022497325,0.0000076195843,0.0019966026,0.00019844255,0.9629035,0.000103976214,0.012059856,0.00046399058,0.00039892286],"about_ca_topic_score_codex":0.000011103215,"about_ca_topic_score_gemma":0.0000061454843,"teacher_disagreement_score":0.9530702,"about_ca_system_score_codex":0.000055171062,"about_ca_system_score_gemma":0.000025618116,"threshold_uncertainty_score":0.75540066},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4556739,0.00018980239,0.5347059,0.0006438525,0.0010985733,0.00013981618,9.155126e-7,0.00044158302,0.007105657],"genre_scores_gemma":[0.7538295,0.000015582036,0.24423435,0.0011049346,0.00069519284,0.0000013707975,9.57411e-7,0.000029607101,0.000088503126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996392,0.00031708353,0.000978716,0.0006235789,0.00076214364,0.0009264688],"domain_scores_gemma":[0.99743015,0.0010856303,0.00045699233,0.0005731224,0.00014085794,0.000313255],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001636367,0.00039949833,0.00047620368,0.0003030262,0.0016178886,0.0010224784,0.0016738018,0.00010941328,0.00019697478],"category_scores_gemma":[0.00013123605,0.0003822527,0.000336904,0.0011398072,0.000079410194,0.0006906153,0.0002560054,0.0013230888,0.0001012411],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039461895,0.00024930868,0.00049782725,0.00004783687,0.00012343533,0.0004534766,0.00541791,0.020816635,0.0018119992,0.015442351,0.00045187632,0.9546479],"study_design_scores_gemma":[0.0016956335,0.0004563457,0.0032648996,0.0010312159,0.00002308648,0.0035027764,0.00031009532,0.896792,0.0011290305,0.0877336,0.0028928388,0.0011684835],"about_ca_topic_score_codex":0.000016584476,"about_ca_topic_score_gemma":0.0000014379078,"teacher_disagreement_score":0.9534794,"about_ca_system_score_codex":0.00008120844,"about_ca_system_score_gemma":0.000071415576,"threshold_uncertainty_score":0.9998629},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62664485,0.00022821518,0.36727518,0.0019377563,0.0015500188,0.0006355715,0.0000120596,0.000091787515,0.00162457],"genre_scores_gemma":[0.9199875,0.000029723791,0.07834595,0.0002579062,0.001094076,0.0000056684253,0.0000027812807,0.0000643697,0.00021202513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980441,0.00022668872,0.00046961854,0.00032110722,0.00033313877,0.0006053671],"domain_scores_gemma":[0.9960416,0.0024486524,0.0005288275,0.0005310113,0.00019726981,0.00025262192],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029362077,0.00022176736,0.00043427158,0.00017922561,0.002263318,0.00033362088,0.0005652076,0.00014299393,0.0000404295],"category_scores_gemma":[0.0017900261,0.00018944495,0.0001477103,0.000049133683,0.00026832212,0.00016587024,0.00034407017,0.0007772655,0.000022319193],"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.0006787009,0.00096488686,0.0031691126,0.0003547237,0.0004884604,0.0012431203,0.0016280976,0.000038902315,0.010633247,0.6329054,0.008170182,0.33972514],"study_design_scores_gemma":[0.0041975486,0.0018696577,0.010693514,0.0004920663,0.00008210252,0.00457511,0.00021293279,0.07244861,0.00019070666,0.9005853,0.004094675,0.0005577579],"about_ca_topic_score_codex":0.0000062013346,"about_ca_topic_score_gemma":0.0000049268756,"teacher_disagreement_score":0.3391674,"about_ca_system_score_codex":0.00006831233,"about_ca_system_score_gemma":0.000027291271,"threshold_uncertainty_score":0.9990356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9449683,0.00008649461,0.053176608,0.00035625655,0.00034587015,0.00022059506,0.0000023999737,0.00006849288,0.00077499275],"genre_scores_gemma":[0.9374218,0.00006056725,0.060676463,0.000413459,0.0013174659,0.0000020968723,0.000008556332,0.000021017848,0.000078566976],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895364,0.000088946705,0.00032815692,0.00024003405,0.00013108332,0.00025814192],"domain_scores_gemma":[0.9991816,0.00012600914,0.0002700847,0.00014647984,0.00018197614,0.000093836534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011411768,0.00016600003,0.00030630315,0.00007323656,0.00026956334,0.00008051198,0.00017543946,0.0001400934,0.0000014467737],"category_scores_gemma":[0.00034436845,0.000121907695,0.00036417367,0.00006407517,0.000047186506,0.000003503504,0.000045839293,0.00030046378,0.0000017320365],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.004738671,0.000108093205,0.000058792997,0.000011168975,0.00023025511,0.0000073055917,0.000027507727,0.00006986247,0.9663279,0.00038104743,0.0012684361,0.026770934],"study_design_scores_gemma":[0.03354928,0.00048349833,0.000066052235,0.00005926554,0.000116317795,0.0003275136,0.00003316038,0.010492263,0.9208254,0.0008983343,0.03272281,0.000426088],"about_ca_topic_score_codex":7.1430884e-7,"about_ca_topic_score_gemma":0.0000026652745,"teacher_disagreement_score":0.045502502,"about_ca_system_score_codex":0.000010009018,"about_ca_system_score_gemma":0.00004517459,"threshold_uncertainty_score":0.49712515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22527264,0.00017439366,0.76063377,0.0031280299,0.0035756119,0.0001372549,0.000002088599,0.00017066798,0.0069055674],"genre_scores_gemma":[0.84576225,0.000028241719,0.15068118,0.0005414424,0.0021461288,2.7205115e-7,0.0000017777701,0.000019923034,0.0008187784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820226,0.00008488561,0.0003497973,0.00034940982,0.0005892697,0.00042438944],"domain_scores_gemma":[0.9980551,0.000108180946,0.0005166119,0.0009688973,0.000114871815,0.00023632517],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009948451,0.00017973773,0.00021915548,0.00009706301,0.0019644855,0.00199953,0.0022772697,0.000062930674,0.000059910635],"category_scores_gemma":[0.0001426118,0.0001428826,0.000120522855,0.0000728713,0.000057236157,0.0009900557,0.0011319557,0.00053856336,0.0003075216],"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.00016368348,0.00030061728,0.00075412483,0.00002305601,0.00013112611,0.0014676942,0.0012629358,0.013974339,0.0024310024,0.018151239,0.030317923,0.9310223],"study_design_scores_gemma":[0.0017091925,0.00073490385,0.0074036703,0.0004919949,0.000012626178,0.0010644387,0.00003048252,0.93490946,0.003449104,0.0031873523,0.046371106,0.00063567783],"about_ca_topic_score_codex":0.000003819177,"about_ca_topic_score_gemma":7.932452e-8,"teacher_disagreement_score":0.9303866,"about_ca_system_score_codex":0.00008000729,"about_ca_system_score_gemma":0.00008334249,"threshold_uncertainty_score":0.9993348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098567754,0.00004098937,0.8989312,0.00016931667,0.00058166095,0.00007755577,0.0000026594064,0.000013564169,0.0016153007],"genre_scores_gemma":[0.93764746,0.000012125603,0.061914176,0.000037134207,0.00033474644,3.5941912e-7,6.0017953e-7,0.000012626103,0.000040787352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901897,0.00003052118,0.00038910832,0.00010231143,0.0002896715,0.00016939103],"domain_scores_gemma":[0.9985088,0.00035524514,0.00062155764,0.00024484712,0.00018971892,0.00007981453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075174763,0.00009919053,0.0002482638,0.000057320103,0.0005835535,0.00012155455,0.0002606211,0.00004857673,0.000021410362],"category_scores_gemma":[0.0021076128,0.00007740293,0.00008778286,0.000035094356,0.0000341257,0.00007168725,0.00005093578,0.00021814424,0.0000036852832],"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.00006712219,0.00006734675,0.000018555138,0.0000713595,0.000047594498,0.000028935112,0.00016837574,0.00022707971,0.0012825057,0.9578345,0.00064628676,0.03954037],"study_design_scores_gemma":[0.0015974639,0.00024632487,0.00006937476,0.00030259538,0.000042171505,0.000108463435,0.00004822649,0.18046539,0.0032309867,0.81366307,0.00010040773,0.00012553834],"about_ca_topic_score_codex":0.0000013687518,"about_ca_topic_score_gemma":0.0000012208546,"teacher_disagreement_score":0.8390797,"about_ca_system_score_codex":0.000020750305,"about_ca_system_score_gemma":0.0000381276,"threshold_uncertainty_score":0.4488281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06978989,0.000069863054,0.92745584,0.0003203795,0.0018665523,0.00034838956,0.000006250882,0.0000697194,0.000073101095],"genre_scores_gemma":[0.75448185,0.0000048163697,0.24469519,0.000046232777,0.000716649,0.0000029816151,0.0000011487924,0.000021726632,0.000029393448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976612,0.00013082511,0.0006107493,0.0004812187,0.0006517334,0.00046431608],"domain_scores_gemma":[0.9963697,0.0008445507,0.0012909067,0.000876242,0.0004393928,0.00017921645],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013877195,0.00026583884,0.00039676044,0.00021718105,0.0018880302,0.00077094877,0.0018018822,0.00008637684,9.688048e-7],"category_scores_gemma":[0.00031183998,0.00019403071,0.00017276162,0.00013080167,0.000067623914,0.0002910534,0.00028236906,0.00054803287,0.000004665429],"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.00008962093,0.00025829428,0.00006067868,0.000051686893,0.000099813886,0.000059802907,0.0006662953,0.27046967,0.0013173341,0.011809287,0.000065753426,0.7150518],"study_design_scores_gemma":[0.001092418,0.00190527,0.00043510873,0.0009037598,0.000012091801,0.00017001988,0.000027924316,0.993282,0.0010562303,0.0007171773,0.00015693117,0.0002410771],"about_ca_topic_score_codex":0.00002455383,"about_ca_topic_score_gemma":0.00000187193,"teacher_disagreement_score":0.7228123,"about_ca_system_score_codex":0.00004950922,"about_ca_system_score_gemma":0.00018548526,"threshold_uncertainty_score":0.9994114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01727757,0.000011156626,0.97908,0.00039440123,0.0011313393,0.0014942824,0.000006594305,0.000055923785,0.00054869906],"genre_scores_gemma":[0.757471,3.059781e-7,0.24069856,0.00025677166,0.0014919167,0.000019253188,6.4230824e-7,0.000009319018,0.00005218533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988948,0.000052428575,0.00034135292,0.00020026955,0.00025395234,0.00025716398],"domain_scores_gemma":[0.99881166,0.00018644003,0.00029008204,0.00028142586,0.0003435573,0.00008682823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033144403,0.00011284475,0.00017596372,0.00016005493,0.00055218505,0.00015795266,0.0007030151,0.000044357013,0.000025889001],"category_scores_gemma":[0.00008294788,0.0000938976,0.00013601212,0.00034640558,0.00008124538,0.00017079676,0.0001315476,0.0002508145,0.0000059185077],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012988369,0.00034130368,0.0007957769,0.00012623184,0.00016107135,0.000014419463,0.0019011599,0.0024590627,0.010238765,0.21192159,0.012677979,0.75923276],"study_design_scores_gemma":[0.0035026544,0.006471359,0.006191139,0.0011368183,0.000025861878,0.0009185168,0.00015714037,0.62659526,0.041431736,0.2076504,0.10510662,0.00081248424],"about_ca_topic_score_codex":0.0000010273761,"about_ca_topic_score_gemma":0.0000017154423,"teacher_disagreement_score":0.7584203,"about_ca_system_score_codex":0.000025630163,"about_ca_system_score_gemma":0.000082642604,"threshold_uncertainty_score":0.4247017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021241136,0.000054246448,0.97532773,0.0013708118,0.0014227709,0.0001441378,0.000001339813,0.00008537971,0.0003524731],"genre_scores_gemma":[0.438732,0.0000014641098,0.5597173,0.0006125878,0.0008936314,0.0000013045053,0.0000065773775,0.00000773767,0.000027408403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852043,0.00016823714,0.00036034622,0.00033238792,0.00032968237,0.0002888919],"domain_scores_gemma":[0.99862516,0.00018988804,0.00024151252,0.00022116383,0.0005648957,0.00015737655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016256114,0.00014513182,0.00015570628,0.0002562798,0.00061676,0.0003748626,0.0005169923,0.000055535056,0.000009740704],"category_scores_gemma":[0.00012174208,0.00013483207,0.00007962514,0.00043761186,0.000021342701,0.0005145221,0.000063101004,0.00019544734,0.000022558193],"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.00006457993,0.00010656124,0.0000074115446,0.00001265153,0.000031773874,0.00000797714,0.0010476498,0.18475065,0.0012942093,0.036442824,0.000741644,0.7754921],"study_design_scores_gemma":[0.00043483044,0.0010156233,0.00081028586,0.000042436666,0.000006454563,0.00029875874,0.00004237252,0.9846827,0.002084344,0.008169403,0.002245953,0.0001668456],"about_ca_topic_score_codex":0.0000023553746,"about_ca_topic_score_gemma":0.000002442471,"teacher_disagreement_score":0.79993206,"about_ca_system_score_codex":0.000118086326,"about_ca_system_score_gemma":0.00019943881,"threshold_uncertainty_score":0.5498292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113271,0.0004246352,0.8770235,0.0020622339,0.0029505296,0.00004621042,5.7055814e-7,0.00009853308,0.0041227504],"genre_scores_gemma":[0.90095073,0.000029671008,0.095441125,0.0019292678,0.0011691182,4.2771973e-7,0.0000048651805,0.000010837998,0.00046398098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844474,0.00018941103,0.00034799657,0.00030413023,0.00043676756,0.00027694032],"domain_scores_gemma":[0.998788,0.0002522151,0.00017385333,0.0002423896,0.00038522604,0.00015832618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006449372,0.0001314978,0.00017015084,0.00014913338,0.00043145852,0.00045847034,0.00037180728,0.000050473976,0.000055410044],"category_scores_gemma":[0.0001809403,0.00012825352,0.00011427597,0.00065925415,0.00001407321,0.00026902117,0.00015519273,0.00040701023,0.00013839667],"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.00002508717,0.00031846663,0.0006680049,0.000026426282,0.00010216753,0.0014238233,0.00074259436,0.12429998,0.0052598165,0.059190016,0.008440485,0.79950315],"study_design_scores_gemma":[0.001409443,0.00030370764,0.00657611,0.00019343615,0.000013324424,0.005676563,0.000078565485,0.8380751,0.032479968,0.02322861,0.09137536,0.0005898228],"about_ca_topic_score_codex":6.2119136e-7,"about_ca_topic_score_gemma":7.137744e-7,"teacher_disagreement_score":0.7989133,"about_ca_system_score_codex":0.00006558293,"about_ca_system_score_gemma":0.00024983648,"threshold_uncertainty_score":0.5230027},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025408517,0.000025628346,0.93246704,0.056193296,0.0032263147,0.0004884684,0.0000028714237,0.00022254563,0.004832953],"genre_scores_gemma":[0.37655625,0.00003004892,0.5826017,0.03709234,0.003087095,0.00000907137,0.0000050522335,0.00007934156,0.0005390557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678737,0.00026513095,0.0006829875,0.0007553587,0.0008709016,0.0006382767],"domain_scores_gemma":[0.99745834,0.00013113963,0.00032807695,0.0006330118,0.00044513357,0.0010042973],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010296346,0.0003646731,0.00047979463,0.00043359856,0.0003530753,0.0015430386,0.0024529404,0.00013523188,0.00006703558],"category_scores_gemma":[0.00024961913,0.00033292378,0.0002195464,0.0005508241,0.000013139412,0.000126703,0.003295695,0.0017664076,0.001353997],"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.000042297324,0.00012047286,0.000071456554,0.00009776972,0.0000960515,0.00030600867,0.0078161135,0.8611285,0.0007173545,0.005758736,0.03375869,0.09008652],"study_design_scores_gemma":[0.00044371613,0.0006528504,0.0002845609,0.0011648154,0.000006246534,0.000101936086,0.00005794068,0.95433,0.0002066206,0.0023023745,0.03977306,0.0006758589],"about_ca_topic_score_codex":0.0000068436057,"about_ca_topic_score_gemma":7.035558e-7,"teacher_disagreement_score":0.3740154,"about_ca_system_score_codex":0.00020393352,"about_ca_system_score_gemma":0.00031046142,"threshold_uncertainty_score":0.99991226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020338024,0.00039003903,0.9748621,0.012029186,0.008198528,0.00047187542,0.0000056120634,0.0009114595,0.0010973834],"genre_scores_gemma":[0.31124797,0.000020313388,0.6860756,0.0010088758,0.0013126109,0.000014027852,0.0000031180823,0.00006118089,0.0002562904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967391,0.0001472973,0.00062339846,0.0009603064,0.00089605316,0.00063385064],"domain_scores_gemma":[0.9977888,0.00018823569,0.0004086689,0.0008402543,0.00030404548,0.00046998102],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010045898,0.00050434854,0.000514071,0.0010836882,0.00029578563,0.003297692,0.0022741249,0.00021967867,0.0000057688085],"category_scores_gemma":[0.00024123599,0.0004556618,0.00039097323,0.00070383376,0.000030050422,0.00011852806,0.003055731,0.0023370765,0.00006220116],"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.000015660153,0.00016911849,0.000015512622,0.00022334726,0.00018127891,0.0007124736,0.004678656,0.51905036,0.00006118567,0.11242939,0.02776258,0.33470044],"study_design_scores_gemma":[0.00016016388,0.00036804832,0.000043111853,0.0020107885,0.000025148396,0.0005354777,0.000030465488,0.92273825,0.000343958,0.07052966,0.0026391498,0.000575793],"about_ca_topic_score_codex":0.0000019965505,"about_ca_topic_score_gemma":5.388684e-7,"teacher_disagreement_score":0.40368786,"about_ca_system_score_codex":0.00042712636,"about_ca_system_score_gemma":0.00026103726,"threshold_uncertainty_score":0.9999646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007109428,0.00021624741,0.97885144,0.00006195024,0.0006274653,0.00017167578,8.7142547e-7,0.0004725992,0.012488324],"genre_scores_gemma":[0.8401999,0.0000058234905,0.15839607,0.00031387707,0.0009968806,0.000006348522,9.684514e-7,0.000040714243,0.000039422524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988491,0.00012125009,0.0002382473,0.00012689397,0.00025670545,0.00040783067],"domain_scores_gemma":[0.99962384,0.000069846166,0.000042151052,0.00011876004,0.000012245837,0.00013315273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008757351,0.00013690225,0.00016745696,0.0001275302,0.00043552465,0.00008365234,0.00027882415,0.000025710286,0.000044618457],"category_scores_gemma":[0.000009204793,0.00013951471,0.00007933591,0.00034259396,0.0000054864963,0.000039429287,0.000068910595,0.00074695324,0.000014372202],"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.000010522457,0.000023616823,0.000025999048,0.000004640476,0.000020910647,0.000034208286,0.00024919503,0.9579285,0.00037698826,0.00089519826,0.02861437,0.011815901],"study_design_scores_gemma":[0.00031030586,0.00061759097,0.00024443105,0.000055658777,0.000012868632,0.0011412663,0.00012773591,0.97139263,0.0008955316,0.0031668216,0.021585768,0.00044936626],"about_ca_topic_score_codex":5.425691e-7,"about_ca_topic_score_gemma":3.0221074e-8,"teacher_disagreement_score":0.8330905,"about_ca_system_score_codex":0.00019063291,"about_ca_system_score_gemma":0.000018647213,"threshold_uncertainty_score":0.5689245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46705088,0.0007072309,0.52325815,0.0021420731,0.001963124,0.00036400757,0.000018653574,0.0003910223,0.0041048406],"genre_scores_gemma":[0.9085384,0.000023398523,0.09019168,0.0009275797,0.00021477076,0.0000024956296,0.0000021683668,0.000022140779,0.00007737217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970749,0.0004413547,0.0005127992,0.000531221,0.00083395647,0.00060578727],"domain_scores_gemma":[0.99820036,0.00053769926,0.00039608893,0.00041771057,0.00017494182,0.00027321486],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014481182,0.00028909545,0.00042783492,0.00024239755,0.0025811594,0.00046988516,0.00096577336,0.000041390365,0.00004178911],"category_scores_gemma":[0.0000544344,0.00025536324,0.00010555478,0.00070931565,0.0002965744,0.00029231954,0.0008964291,0.0015004711,0.0000068005243],"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.0010554807,0.0020111275,0.016909601,0.0001511014,0.0007661996,0.00450922,0.009192819,0.2441956,0.00061266654,0.48390332,0.0073353113,0.22935757],"study_design_scores_gemma":[0.001993008,0.0021179547,0.0020184345,0.00021298905,0.000021305552,0.008428136,0.0007676331,0.9650052,0.00014429845,0.009647093,0.0089972075,0.00064672896],"about_ca_topic_score_codex":0.000046024375,"about_ca_topic_score_gemma":0.000015676102,"teacher_disagreement_score":0.72080964,"about_ca_system_score_codex":0.00014493449,"about_ca_system_score_gemma":0.0002790435,"threshold_uncertainty_score":0.99998987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024227682,0.00019677529,0.99450654,0.00049405295,0.0019729037,0.00017172289,0.0000023314196,0.00011066279,0.000122259],"genre_scores_gemma":[0.73482955,0.000001485334,0.2640859,0.0006534274,0.00038256356,0.0000060684874,8.5320926e-7,0.000012216102,0.000027959724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981867,0.00027372225,0.0002796785,0.00028633312,0.0005350422,0.0004385106],"domain_scores_gemma":[0.9988983,0.00051228754,0.00013125522,0.00021011905,0.00007619614,0.00017180802],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001083108,0.00013049335,0.00015666615,0.0001261129,0.0015512074,0.00036447067,0.0007039541,0.000038409093,0.000058930807],"category_scores_gemma":[0.000030368023,0.0001284919,0.00014390651,0.00042810914,0.000026328735,0.00011454556,0.00031692628,0.00080368004,0.000011958914],"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.0000684766,0.0001614614,0.000003889701,0.0000020984385,0.000025483467,0.00008391874,0.00041340047,0.83608407,0.00008764147,0.031061515,0.0026086671,0.12939939],"study_design_scores_gemma":[0.00047793845,0.0011533549,0.000014908212,0.000021539861,0.000002001528,0.0006123366,0.00047160016,0.984828,0.0018854251,0.004809988,0.005557954,0.00016493358],"about_ca_topic_score_codex":0.0000013798236,"about_ca_topic_score_gemma":2.1986894e-8,"teacher_disagreement_score":0.73240674,"about_ca_system_score_codex":0.00024940376,"about_ca_system_score_gemma":0.00008764336,"threshold_uncertainty_score":0.99974865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4114347,0.013261269,0.56119615,0.0070429244,0.0051901895,0.00016846534,0.0000016126037,0.0007643075,0.0009403665],"genre_scores_gemma":[0.9810745,0.00010925898,0.016936088,0.00071398047,0.001056881,4.2135693e-7,4.215563e-7,0.000027478667,0.000080959355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792516,0.0001463177,0.00041780312,0.0005085262,0.00047556983,0.00052661967],"domain_scores_gemma":[0.99897873,0.00026531282,0.00011086039,0.00028516995,0.00010348222,0.00025646976],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010456356,0.00026874707,0.00026460382,0.00050477666,0.00061852083,0.0017836924,0.00068333826,0.000072447845,0.00000381195],"category_scores_gemma":[0.00010826196,0.00019358742,0.00013472392,0.00090966054,0.00007528649,0.00027995673,0.0003620005,0.0010859434,0.000029545008],"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.000013154926,0.00007789156,0.00013670427,0.00015758294,0.00012573521,0.0010384516,0.0024937182,0.0108972555,0.00059623003,0.13078661,0.0037857736,0.8498909],"study_design_scores_gemma":[0.0002084096,0.00033822923,0.0003758461,0.0009314898,0.0000085197025,0.0029781307,0.000040534025,0.96657336,0.00030887392,0.010241897,0.017683754,0.00031095586],"about_ca_topic_score_codex":0.000007894602,"about_ca_topic_score_gemma":3.960859e-7,"teacher_disagreement_score":0.9556761,"about_ca_system_score_codex":0.0000517188,"about_ca_system_score_gemma":0.00014641584,"threshold_uncertainty_score":0.99925256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5786389,0.00057964417,0.40094858,0.008369503,0.004815583,0.00019910753,0.0000031753068,0.0011263685,0.0053191003],"genre_scores_gemma":[0.9738891,0.00007844219,0.024349649,0.0007350097,0.0007062688,6.8339943e-7,0.0000010101588,0.000017616178,0.00022222732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982275,0.00012208137,0.00034131872,0.00035258848,0.00044484102,0.0005116813],"domain_scores_gemma":[0.99893296,0.00028115304,0.00016772175,0.0003064217,0.0000858349,0.00022588614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880792,0.00018381009,0.0002256137,0.00037276975,0.00080818875,0.00058650755,0.0007894428,0.000055911274,0.000010127031],"category_scores_gemma":[0.00008454891,0.00016750881,0.00011306411,0.0009074593,0.00005716739,0.0002613595,0.00051997276,0.00058852974,0.0001340094],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013426493,0.0001028148,0.0013275348,0.000037919173,0.00008099319,0.0012895636,0.0021057946,0.005745376,0.00030336945,0.087073945,0.008071805,0.89384747],"study_design_scores_gemma":[0.0012006696,0.00051929476,0.035227902,0.000355801,0.000011095521,0.0025213775,0.00018837163,0.8527107,0.00036384916,0.09130029,0.014950553,0.00065008504],"about_ca_topic_score_codex":0.0000075253247,"about_ca_topic_score_gemma":0.0000016536501,"teacher_disagreement_score":0.89319736,"about_ca_system_score_codex":0.00004238656,"about_ca_system_score_gemma":0.000053990836,"threshold_uncertainty_score":0.68308115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69223565,0.00010723661,0.20319633,0.024490824,0.034875236,0.001052454,0.000036310063,0.00031390745,0.043692045],"genre_scores_gemma":[0.985075,0.000008942367,0.0024296914,0.0026599239,0.009675532,0.0000031556638,0.0000013278253,0.000023996025,0.00012243753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995938,0.0013342515,0.0006112382,0.0004334077,0.0011642808,0.0005188021],"domain_scores_gemma":[0.99465054,0.0034386022,0.0007459173,0.00091683527,0.00015177939,0.00009629859],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0050843116,0.0002783452,0.00029952647,0.00027419077,0.0036331022,0.00030150122,0.0030656883,0.000049967894,0.00011971299],"category_scores_gemma":[0.00029570467,0.00017830395,0.00033273836,0.0007565481,0.00015433182,0.00015793699,0.0014624095,0.0021068063,0.00001643085],"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.00020635135,0.00051354646,0.00020876333,0.0000138675405,0.00016469505,0.000101439815,0.011281495,0.11537347,0.00016325101,0.7057207,0.042283442,0.12396895],"study_design_scores_gemma":[0.003041402,0.0101036485,0.017114842,0.0011619349,0.00008722586,0.0031979145,0.014925961,0.6172026,0.0024050935,0.21355593,0.11530747,0.001895999],"about_ca_topic_score_codex":0.0000056863187,"about_ca_topic_score_gemma":0.0000014391434,"teacher_disagreement_score":0.5018291,"about_ca_system_score_codex":0.00019005564,"about_ca_system_score_gemma":0.00011984865,"threshold_uncertainty_score":0.99766403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6731549,0.00013213503,0.31906456,0.001786447,0.002884912,0.00018562037,0.0000037710906,0.00046302038,0.0023246568],"genre_scores_gemma":[0.954082,0.000017917408,0.04532983,0.00011749308,0.0003534322,8.3138394e-7,0.000001309653,0.000012910851,0.00008423315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997647,0.00016563866,0.0006449576,0.0003662232,0.0006722194,0.0005039847],"domain_scores_gemma":[0.9982796,0.00043144295,0.00036748816,0.0005547813,0.00018948484,0.00017725551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018729519,0.00019831612,0.0003538172,0.00043503544,0.00046051553,0.00019162548,0.0014111714,0.0000741036,0.000023066279],"category_scores_gemma":[0.00014073226,0.00016380276,0.0002573056,0.0016109307,0.000107989756,0.0003133975,0.00049038674,0.0006350769,0.00008851058],"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.00007777886,0.00084922794,0.0118012745,0.00031480886,0.00022506058,0.0006103705,0.0052400846,0.025637679,0.0023875572,0.3861063,0.0076636486,0.5590862],"study_design_scores_gemma":[0.0013455148,0.0007180666,0.03836648,0.00041096043,0.000013343604,0.00053183205,0.00021181753,0.7646762,0.003868993,0.18427847,0.0049470286,0.0006312769],"about_ca_topic_score_codex":0.00000763306,"about_ca_topic_score_gemma":0.0000011274475,"teacher_disagreement_score":0.7390385,"about_ca_system_score_codex":0.00006102742,"about_ca_system_score_gemma":0.00010410196,"threshold_uncertainty_score":0.6679683},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053631242,0.0001342919,0.9340164,0.0071733287,0.002876264,0.00015650391,0.0000031095717,0.0006036189,0.0014052516],"genre_scores_gemma":[0.9908884,0.0000033814956,0.00548224,0.0029487098,0.0005282141,0.0000015971409,0.000002796505,0.000016058968,0.00012858836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799436,0.00013528748,0.0004313715,0.00035449883,0.00058387785,0.0005006188],"domain_scores_gemma":[0.9987045,0.00022169121,0.0002559997,0.00041312826,0.00020703657,0.00019766933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096175,0.00017363887,0.00023608454,0.00021719061,0.00052681036,0.0005384752,0.0008262205,0.000060765367,0.000008602512],"category_scores_gemma":[0.00011261975,0.00014308537,0.00014307044,0.0009983293,0.000022096567,0.00022639545,0.00013569994,0.00043034845,0.000296704],"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.00003783599,0.00022360038,0.0013855738,0.00010617467,0.000076159624,0.0025330016,0.0011351208,0.26728746,0.0017994936,0.023083689,0.33644977,0.36588213],"study_design_scores_gemma":[0.0005743488,0.00015201136,0.0029121991,0.00041457659,0.0000025062568,0.00018023692,0.000045375622,0.9120578,0.00027364533,0.00075982034,0.082384944,0.00024253431],"about_ca_topic_score_codex":0.000004506285,"about_ca_topic_score_gemma":8.4051135e-7,"teacher_disagreement_score":0.9372572,"about_ca_system_score_codex":0.000062577645,"about_ca_system_score_gemma":0.00011266796,"threshold_uncertainty_score":0.5834852},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6488395,0.0009389477,0.33979127,0.0010180176,0.0047639855,0.00029191945,0.0000017004568,0.0007713311,0.0035833442],"genre_scores_gemma":[0.9586318,0.00008912842,0.03981702,0.00014043514,0.00096764654,0.000007101293,7.5390324e-7,0.00006380527,0.0002823192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956971,0.00037062296,0.00070086564,0.00089392136,0.0010987441,0.0012387355],"domain_scores_gemma":[0.997331,0.00079180644,0.00020984838,0.0009689109,0.0001670322,0.0005313917],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033066573,0.00039689709,0.00038336997,0.0011443052,0.001800741,0.0014845022,0.0029920402,0.00012081554,0.000037829202],"category_scores_gemma":[0.0002632713,0.0003648375,0.00030484344,0.0014913146,0.0000821102,0.00171345,0.0016090277,0.0019081137,0.00007043378],"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.00007799803,0.000281922,0.0012449446,0.00018769971,0.00024928094,0.002732517,0.0058782306,0.06661492,0.0052888272,0.47318044,0.0010376116,0.44322562],"study_design_scores_gemma":[0.0013825689,0.0022684557,0.0025960305,0.0021748568,0.000030579704,0.0023611588,0.00036692186,0.6748782,0.006032082,0.29674062,0.009863332,0.0013052213],"about_ca_topic_score_codex":0.0000031100708,"about_ca_topic_score_gemma":0.000003134277,"teacher_disagreement_score":0.60826325,"about_ca_system_score_codex":0.0003505624,"about_ca_system_score_gemma":0.00018669615,"threshold_uncertainty_score":0.9998804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.197377,0.00025216767,0.7976754,0.0005725964,0.0008112227,0.00012643458,0.000002401736,0.00018585206,0.002996942],"genre_scores_gemma":[0.94963926,0.000018283828,0.049945578,0.00006925992,0.00024982376,0.0000012916393,0.0000014568107,0.000022510676,0.000052507086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738985,0.0002878322,0.00059273647,0.0004283275,0.00082467275,0.00047658672],"domain_scores_gemma":[0.99823064,0.0005444562,0.00029237656,0.00046189583,0.0003125759,0.00015806379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128609,0.00019267482,0.0002784541,0.0003889942,0.00039779153,0.00045496304,0.001063043,0.000065845175,0.000031679006],"category_scores_gemma":[0.0001248767,0.00017186276,0.00020108337,0.0012739304,0.0001976812,0.00057590246,0.00026330608,0.0009004793,0.0000953035],"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.000021639544,0.00011121414,0.0015701185,0.00007939956,0.00007519642,0.0001222294,0.0006179191,0.0020640183,0.0059800367,0.90615183,0.00028447848,0.08292189],"study_design_scores_gemma":[0.00035573498,0.00016648567,0.011045276,0.0006830541,0.00000954031,0.0007884529,0.00008249856,0.6610683,0.0024263994,0.32202718,0.001048147,0.00029891287],"about_ca_topic_score_codex":0.000003316961,"about_ca_topic_score_gemma":5.913738e-7,"teacher_disagreement_score":0.7522623,"about_ca_system_score_codex":0.00012469976,"about_ca_system_score_gemma":0.00014731713,"threshold_uncertainty_score":0.700836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033202495,0.00083953066,0.9815212,0.0027057717,0.0022064126,0.00019502167,0.0000022206552,0.0002205376,0.008989077],"genre_scores_gemma":[0.9268153,0.000004297766,0.0697897,0.00049770664,0.0013383867,8.2266e-7,0.0000015016999,0.000019269552,0.0015330166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980416,0.000090229376,0.00046902793,0.00048335234,0.00051562674,0.00040011384],"domain_scores_gemma":[0.99887186,0.00017467863,0.00012614357,0.0003940191,0.00011274791,0.0003205492],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082533475,0.00019346157,0.00023609349,0.00019982058,0.0005381902,0.0034124125,0.0007409902,0.000057845646,0.000010191262],"category_scores_gemma":[0.00013811566,0.0001603433,0.0001377179,0.0009518714,0.000013196296,0.00046446853,0.00019521368,0.0005123784,0.00020777163],"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.000019241517,0.00020114759,0.00008939982,0.00018834873,0.000088460736,0.00033904222,0.002694582,0.3446782,0.0003764924,0.17643826,0.09011738,0.38476944],"study_design_scores_gemma":[0.00015640834,0.000092283655,0.00010440305,0.0011146138,0.000004622145,0.0003290397,0.00002574473,0.7650986,0.000016630245,0.00077272614,0.23207651,0.00020845221],"about_ca_topic_score_codex":0.000009609247,"about_ca_topic_score_gemma":6.1234084e-7,"teacher_disagreement_score":0.92349505,"about_ca_system_score_codex":0.00016670857,"about_ca_system_score_gemma":0.00028483017,"threshold_uncertainty_score":0.99762213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12874392,0.000084103805,0.8670991,0.000777642,0.0012246505,0.000083519255,4.396809e-7,0.000036069512,0.001950558],"genre_scores_gemma":[0.9673806,0.000006121378,0.031471718,0.00078348105,0.00023689805,5.382487e-7,0.0000014895026,0.000004614437,0.00011453846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986971,0.00026737287,0.00035962166,0.00019012351,0.0003214673,0.00016429361],"domain_scores_gemma":[0.99902034,0.00010655556,0.00027863978,0.00031119457,0.00023467993,0.000048608737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000817143,0.00010547672,0.00012678723,0.00019322518,0.00043103838,0.00020784559,0.00077932095,0.000039646962,0.000004695893],"category_scores_gemma":[0.00007035481,0.000074249656,0.0000923059,0.00083663926,0.000034191984,0.00024735296,0.00013089129,0.00020138505,0.0000021543642],"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.0000063243115,0.00007091327,0.00062175014,0.0000108580825,0.00001713679,0.0000015991222,0.00023808928,0.36871296,0.0034709855,0.5661362,0.00027556907,0.060437627],"study_design_scores_gemma":[0.0002805874,0.00007132719,0.0051271254,0.000102146034,0.000006505839,0.000040966333,0.000023841149,0.939963,0.011169024,0.042566344,0.0005590938,0.00009003724],"about_ca_topic_score_codex":0.0000012420531,"about_ca_topic_score_gemma":5.401404e-7,"teacher_disagreement_score":0.8386367,"about_ca_system_score_codex":0.00004686549,"about_ca_system_score_gemma":0.00014595361,"threshold_uncertainty_score":0.33152425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026425725,0.0003191567,0.9643668,0.0060199695,0.0002946355,0.0008910669,0.000003682136,0.00024283183,0.0014361441],"genre_scores_gemma":[0.6810386,0.0000063849698,0.31771943,0.0009770162,0.00019626741,0.000029001641,0.0000030022152,0.000015145324,0.000015121792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784684,0.00024334696,0.00047906023,0.00056437356,0.00038120308,0.0004851746],"domain_scores_gemma":[0.9975707,0.00060020183,0.00031671373,0.00092999195,0.00040228068,0.00018012151],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013688271,0.0002713048,0.0003407445,0.00046628254,0.0014927466,0.00056643866,0.0016967747,0.000045164772,0.0000014802821],"category_scores_gemma":[0.000068464324,0.00021064363,0.00016835297,0.0012963349,0.000081432,0.0001245744,0.00038350327,0.0005548545,0.000006562373],"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.00008117177,0.00035307725,0.0005908781,0.00008032896,0.00017126312,0.0000065438835,0.001187465,0.06505274,0.00023951237,0.65246433,0.0010670819,0.2787056],"study_design_scores_gemma":[0.0015801047,0.00075420766,0.008567466,0.0012483704,0.000049343762,0.0002172532,0.0001601053,0.83408874,0.0015909742,0.10502316,0.045953643,0.0007666255],"about_ca_topic_score_codex":0.000008966889,"about_ca_topic_score_gemma":0.000009590807,"teacher_disagreement_score":0.769036,"about_ca_system_score_codex":0.00008469802,"about_ca_system_score_gemma":0.00016958425,"threshold_uncertainty_score":0.9998072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12500937,0.0012777752,0.86538714,0.0004537147,0.0025658344,0.0002265386,0.000008366343,0.00009492891,0.0049763354],"genre_scores_gemma":[0.7904726,0.00016360961,0.20773917,0.00066184305,0.00043920352,0.0000031980528,0.0000015679855,0.0000206114,0.00049815106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779296,0.00011150145,0.00067257055,0.0004499104,0.00041436293,0.00055866764],"domain_scores_gemma":[0.99745095,0.0013167267,0.00040992946,0.00037655138,0.00029035148,0.00015546559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014150578,0.0002601204,0.00046321677,0.00043200274,0.0007497635,0.00054477644,0.0009599129,0.00008708688,0.0000031498842],"category_scores_gemma":[0.000258743,0.00023857372,0.00020745458,0.00075651286,0.00014346132,0.00045178144,0.00033925226,0.0004738368,0.0000016050947],"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.000036775604,0.0005327894,0.0030578442,0.00031736935,0.00033697346,0.00007682512,0.0022461067,0.003409453,0.00063159707,0.26480222,0.006982285,0.71756977],"study_design_scores_gemma":[0.0031290052,0.0014063695,0.0074896268,0.0017305155,0.000055994857,0.00021722566,0.00081346784,0.72950774,0.0046967496,0.1638386,0.08672197,0.00039274094],"about_ca_topic_score_codex":0.000008829814,"about_ca_topic_score_gemma":0.0000053998515,"teacher_disagreement_score":0.7260983,"about_ca_system_score_codex":0.00006380572,"about_ca_system_score_gemma":0.00018393743,"threshold_uncertainty_score":0.9728754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014727311,0.00031570994,0.9718121,0.0066293483,0.00055166427,0.0001258338,1.7105496e-7,0.00013695014,0.0057008625],"genre_scores_gemma":[0.6925545,0.0000023719508,0.30434147,0.0026752504,0.00023807822,0.0000021133621,8.49965e-8,0.000008603486,0.00017756649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984442,0.00028633352,0.00028187138,0.00027361867,0.00034898403,0.00036501922],"domain_scores_gemma":[0.9983345,0.00079468277,0.00019307778,0.00035594794,0.0002547054,0.00006704187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380689,0.0001785153,0.00020434697,0.00021260553,0.001266473,0.00066291593,0.0011753934,0.000032080156,0.0000022467382],"category_scores_gemma":[0.00014222793,0.000095411764,0.00009423005,0.0011577827,0.00009016559,0.0002013122,0.00029729592,0.0007069971,0.0000041243366],"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.000041831456,0.000119698656,0.0014529192,0.0000386341,0.00019232518,0.00013869761,0.0014777237,0.027412869,0.0008873794,0.21325587,0.0021738643,0.7528082],"study_design_scores_gemma":[0.0014710969,0.0007742381,0.0106042875,0.001615234,0.00004371235,0.0014365145,0.0007185525,0.9231412,0.0022893655,0.043572485,0.013720008,0.00061332766],"about_ca_topic_score_codex":0.000012803889,"about_ca_topic_score_gemma":0.0000032451674,"teacher_disagreement_score":0.8957283,"about_ca_system_score_codex":0.000039119728,"about_ca_system_score_gemma":0.00014260766,"threshold_uncertainty_score":0.97408146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62045765,0.00031945913,0.36771378,0.002641454,0.00035619538,0.00046236994,0.00001092791,0.00012024008,0.0079179425],"genre_scores_gemma":[0.9425883,0.0000473381,0.054461125,0.0007630088,0.0002917793,0.000016061538,0.0000036555584,0.000025789162,0.0018028914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988275,0.00007402953,0.00054463657,0.00016093008,0.00015485728,0.00023800001],"domain_scores_gemma":[0.99718887,0.0022280202,0.00019271999,0.00017737612,0.00013575486,0.00007725739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087742554,0.0001434504,0.00029319947,0.00010518346,0.00045945842,0.00012481591,0.00013555776,0.000066151326,0.000032885553],"category_scores_gemma":[0.00070841605,0.00011227213,0.000096560565,0.0001171107,0.000039787108,0.000052758314,0.00006436396,0.00020569804,0.000003380574],"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.000017783701,0.00007818599,0.000025826404,0.0003191176,0.00003957098,0.0000011166213,0.0008093404,0.000008311074,0.00024397945,0.9826508,0.00748972,0.008316209],"study_design_scores_gemma":[0.0005632585,0.000096171636,0.00007694418,0.0007631628,0.000039789375,0.000019334175,0.0013902581,0.017558891,0.0009889557,0.9736201,0.004728083,0.00015502993],"about_ca_topic_score_codex":0.0000019861723,"about_ca_topic_score_gemma":6.466693e-7,"teacher_disagreement_score":0.32213074,"about_ca_system_score_codex":0.000041289328,"about_ca_system_score_gemma":0.000042958258,"threshold_uncertainty_score":0.45783246},"labels":[],"label_agreement":null}]}