{"meta":{"query_hash":"43b255e45fbe","filters":{"venue":"ACM Transactions on Algorithms"},"cohort_total":101,"direct_labels_cover":0,"predictions_cover":101,"exported":101,"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/43b255e45fbe","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Algorithms"},"results":[{"id":"W1524471135","doi":"10.1145/2963170","title":"Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":39,"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":"Matroid; Knapsack problem; Approximation algorithm; Oriented matroid; Facility location problem; Matroid partitioning; Mathematics; Weighted matroid; Combinatorics; Polynomial-time approximation scheme; Greedy algorithm; Randomized rounding; Set (abstract data type); Generalization; Computer science; Discrete mathematics; Mathematical optimization; Graphic matroid","score_opus":0.030839153407691892,"score_gpt":0.24299661658426547,"score_spread":0.21215746317657358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524471135","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.0015263843,0.000070780305,0.9860406,0.009738777,0.00026745338,0.0017370683,0.000055756052,0.00021762076,0.00034556093],"genre_scores_gemma":[0.83826977,0.0016583544,0.13320857,0.0043780394,0.002333856,0.011977038,0.00029211876,0.0002422948,0.007639926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987526,0.000007965299,0.0003221799,0.00047193127,0.00016967053,0.00027563973],"domain_scores_gemma":[0.99926454,0.000060637863,0.00007377504,0.000414224,0.00014701787,0.00003978294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029187658,0.0002123401,0.00017255322,0.00026233727,0.0003742785,0.00013015792,0.00019759304,0.000083017825,0.0001344845],"category_scores_gemma":[0.000035926805,0.00016786231,0.000063834785,0.00028032553,0.00010233079,0.00077389047,0.000020455105,0.00007591717,0.00008162218],"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.00002235247,0.0001416222,0.000029651606,0.00027354216,0.000052780968,1.2688278e-7,0.000059703212,0.00007103558,0.0009320413,0.0025639602,0.00018158575,0.9956716],"study_design_scores_gemma":[0.008656351,0.00028864757,0.0037958259,0.0002307025,0.0005911303,0.000010728863,0.0012730362,0.33695662,0.001849307,0.07418615,0.5701665,0.0019950077],"about_ca_topic_score_codex":0.00020319814,"about_ca_topic_score_gemma":0.00020034781,"teacher_disagreement_score":0.9936766,"about_ca_system_score_codex":0.00003590716,"about_ca_system_score_gemma":0.000011208276,"threshold_uncertainty_score":0.6845226},"labels":[],"label_agreement":null},{"id":"W1627731299","doi":"10.1145/2746241","title":"Sparse Sums of Positive Semidefinite Matrices","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":13,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebraic number; Positive-definite matrix; Graph; Preprocessor; Time complexity; Estimator; Spectral properties; Satisfiability","score_opus":0.04235669537589582,"score_gpt":0.27406983562542225,"score_spread":0.23171314024952644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627731299","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.00060397084,0.000069820286,0.99680346,0.00056587753,0.00037400535,0.00019513158,0.000028119322,0.00033567142,0.0010239314],"genre_scores_gemma":[0.19512711,0.000040999264,0.8044309,0.00015561469,0.000019100202,0.000037356876,0.0000039026204,0.000014542446,0.00017047189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882483,0.00004996295,0.00026473362,0.0002974045,0.0003697921,0.00019325555],"domain_scores_gemma":[0.9985592,0.00019481828,0.000113668895,0.0007421237,0.00025066524,0.00013951803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021647429,0.00014315745,0.00017513474,0.0003180934,0.000069765825,0.000046621968,0.0008158256,0.00007329854,0.000016554664],"category_scores_gemma":[0.00006226384,0.0001391824,0.000077845776,0.0007893485,0.000067064655,0.0003787157,0.00002119034,0.00013612898,0.000045314275],"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.00012851265,0.0015445444,0.0002036943,0.000057543562,0.00034893295,0.0000700466,0.009343895,0.060633026,0.0009009324,0.0695389,0.0024723734,0.8547576],"study_design_scores_gemma":[0.0039944346,0.0036720017,0.0014540668,0.0003912023,0.00019800189,0.00029374813,0.00086847437,0.64526784,0.22711577,0.11345945,0.0015032886,0.0017817093],"about_ca_topic_score_codex":0.00009556544,"about_ca_topic_score_gemma":0.0000031044183,"teacher_disagreement_score":0.8529759,"about_ca_system_score_codex":0.00006115257,"about_ca_system_score_gemma":0.000077293014,"threshold_uncertainty_score":0.5675694},"labels":[],"label_agreement":null},{"id":"W1870153077","doi":"10.1145/2850418","title":"The Traveling Salesman Problem for Lines, Balls, and Planes","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":55,"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":"Travelling salesman problem; Combinatorics; Hyperplane; Mathematics; Constant (computer programming); Plane (geometry); Bottleneck traveling salesman problem; Set (abstract data type); 2-opt; Unit (ring theory); Mathematical optimization; Computer science; Geometry","score_opus":0.02093933631693614,"score_gpt":0.25348487591014757,"score_spread":0.23254553959321142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870153077","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.0010410459,0.00011827456,0.9858696,0.012284203,0.00033868122,0.00022419624,0.000016366288,0.00007796157,0.000029707096],"genre_scores_gemma":[0.44196758,0.0004913753,0.55442905,0.00033936944,0.00026338882,0.00019209502,0.000006725337,0.000016299133,0.0022941101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928546,0.000025680478,0.00015248428,0.00024211744,0.00013506856,0.0001591975],"domain_scores_gemma":[0.9988939,0.00066997414,0.000036268295,0.0002698796,0.00007537078,0.000054587952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022489535,0.00009252522,0.00006902535,0.00005073858,0.00048290065,0.000109983965,0.00029672976,0.00003911841,0.000002637173],"category_scores_gemma":[0.00002361963,0.000054256576,0.000041280764,0.00015021152,0.000033931687,0.0002048402,0.0000070715096,0.000051065053,0.000009421557],"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.000009430184,0.000026489874,0.0000024286205,0.0000046563096,0.00001668204,4.5888788e-7,0.00007965028,0.00068720296,0.00058253197,0.007850338,0.00009544714,0.9906447],"study_design_scores_gemma":[0.0049359184,0.0013087618,0.0038413422,0.00019861477,0.00008449487,0.00022792848,0.000114850875,0.3704905,0.03801477,0.33806017,0.24155825,0.0011644161],"about_ca_topic_score_codex":0.0000055185483,"about_ca_topic_score_gemma":0.00002658272,"teacher_disagreement_score":0.98948026,"about_ca_system_score_codex":0.000016728914,"about_ca_system_score_gemma":0.000040160885,"threshold_uncertainty_score":0.37141302},"labels":[],"label_agreement":null},{"id":"W1967030015","doi":"10.1145/1159892.1159899","title":"An approximation algorithm for scheduling malleable tasks under general precedence constraints","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Computer science; Approximation algorithm; Task (project management); Schedule; Mathematical optimization; Asymptotically optimal algorithm; Algorithm; Mathematics","score_opus":0.017809104034928185,"score_gpt":0.25584251735419056,"score_spread":0.23803341331926237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967030015","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.003585701,0.00009580013,0.99299645,0.00013487134,0.000955853,0.0005532035,0.00019976578,0.0010519016,0.00042647624],"genre_scores_gemma":[0.0780278,0.000044268767,0.92051184,0.00009868876,0.00037697208,0.0002752972,0.00019041679,0.00010435844,0.00037032817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820226,0.00004087041,0.00046019215,0.00047178406,0.00030525774,0.0005196463],"domain_scores_gemma":[0.9988911,0.00012552684,0.000062662475,0.00058745296,0.00016953143,0.00016371431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025092423,0.00035252678,0.00027467156,0.00025514254,0.000367449,0.00017793835,0.0003740579,0.00025568155,0.00021384873],"category_scores_gemma":[0.000012743117,0.00038924345,0.00014576093,0.00038763514,0.00011011029,0.0004856578,0.0000033915674,0.00031847472,0.00005099396],"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.000005461484,0.00012079782,0.0000018587606,0.000016999624,0.000038296323,0.0000010746253,0.000043889268,0.7200756,0.00058631087,0.00018396042,0.000023996989,0.27890176],"study_design_scores_gemma":[0.0010845218,0.000112779686,0.00007303284,0.000032915857,0.00005226506,0.000024620264,0.00023275404,0.98161006,0.014412446,0.0017530696,0.00014799435,0.0004635361],"about_ca_topic_score_codex":0.000044230725,"about_ca_topic_score_gemma":0.000014083066,"teacher_disagreement_score":0.2784382,"about_ca_system_score_codex":0.00014877573,"about_ca_system_score_gemma":0.000051996198,"threshold_uncertainty_score":0.99985594},"labels":[],"label_agreement":null},{"id":"W1967391655","doi":"10.1145/1383369.1383382","title":"Fault-tolerant facility location","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":90,"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":"Division of Computing and Communication Foundations; National Science Foundation","keywords":"Facility location problem; Rounding; Approximation algorithm; Metric (unit); Randomized rounding; 1-center problem; Generalization; Mathematical optimization; Metric space; Mathematics; Computer science; Fault tolerance; Dual (grammatical number); Function (biology); Randomized algorithm; Algorithm; Discrete mathematics; Distributed computing","score_opus":0.04730761318528802,"score_gpt":0.24394376470476975,"score_spread":0.19663615151948172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967391655","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.10174888,0.00007081437,0.8806128,0.0066562966,0.0019902033,0.0007592377,0.000032978343,0.0008292,0.007299619],"genre_scores_gemma":[0.9937169,0.000053218017,0.0014422394,0.0019652443,0.00018738874,0.000094020405,0.000057446174,0.000015488995,0.0024680777],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998555,0.000013219774,0.00034585298,0.00040537023,0.00039738574,0.00028313856],"domain_scores_gemma":[0.9989666,0.000018515688,0.000047237576,0.00071584486,0.00022679742,0.000025033965],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020847506,0.00021126786,0.0001701723,0.00026920863,0.0005819835,0.00006343886,0.00036610555,0.0000732773,0.001643617],"category_scores_gemma":[0.00005201446,0.00020973322,0.00011641885,0.0007795873,0.0000893551,0.0007738766,0.000014153172,0.00018645053,0.0046485164],"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.00017797119,0.0021866963,0.0009806432,0.00041998265,0.00021894627,0.000033093685,0.00068242004,0.14785632,0.00017072292,0.0020476321,0.010696626,0.8345289],"study_design_scores_gemma":[0.003097142,0.000100685356,0.06536642,0.00007332407,0.00020985174,0.000020376832,0.00133747,0.27227703,0.0007933254,0.0026602831,0.65234333,0.0017207662],"about_ca_topic_score_codex":0.0015991443,"about_ca_topic_score_gemma":0.0002587343,"teacher_disagreement_score":0.891968,"about_ca_system_score_codex":0.0000629629,"about_ca_system_score_gemma":0.000024572817,"threshold_uncertainty_score":0.999269},"labels":[],"label_agreement":null},{"id":"W1973767581","doi":"10.1145/1721837.1721859","title":"Periodicity testing with sublinear samples and space","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"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":"Sublinear function; Property testing; Mathematics; Space (punctuation); Combinatorics; Binary logarithm; Constant (computer programming); Streaming algorithm; Discrete mathematics; Order (exchange); Sample space; Sample (material); Property (philosophy); Statistics; Computer science; Upper and lower bounds; Mathematical analysis; Physics","score_opus":0.03292281120173705,"score_gpt":0.24999791139832664,"score_spread":0.2170751001965896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973767581","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.039641038,0.00002317098,0.95811224,0.0013385925,0.00030082438,0.00013069686,0.000028004215,0.00026569102,0.00015976887],"genre_scores_gemma":[0.227552,0.000012488427,0.77212393,0.00013073438,0.00007094787,0.000016041646,0.0000028616848,0.0000131074585,0.000077863675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987757,0.000026940448,0.00014622418,0.0004959015,0.00028269042,0.0002725249],"domain_scores_gemma":[0.9984087,0.000269565,0.000056363602,0.0009799044,0.00010853659,0.00017693888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017504174,0.0001868661,0.00015987534,0.000121452846,0.0005242343,0.00030376416,0.00067933643,0.0000811489,0.000036222133],"category_scores_gemma":[0.000060179937,0.00014306157,0.000030074616,0.00043795267,0.00013058668,0.0006543243,0.000040957744,0.00048794303,0.000019264184],"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.000015306881,0.00016987008,0.00053457177,0.0000116951705,0.000022882117,0.000023717548,0.00033925212,0.00020635518,0.003296402,0.0011501036,0.00006333245,0.9941665],"study_design_scores_gemma":[0.0038241353,0.0019837725,0.06756431,0.00021269958,0.00009393203,0.0013258327,0.00037082558,0.84083575,0.030900689,0.0065832767,0.044251718,0.0020530778],"about_ca_topic_score_codex":0.00031035094,"about_ca_topic_score_gemma":0.00008371931,"teacher_disagreement_score":0.9921134,"about_ca_system_score_codex":0.000011224534,"about_ca_system_score_gemma":0.00006940203,"threshold_uncertainty_score":0.58338815},"labels":[],"label_agreement":null},{"id":"W1974033543","doi":"10.1145/1290672.1290680","title":"Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":378,"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":"Prefix; Encoding (memory); Trie; Computer science; Prefix code; Theoretical computer science; Tree (set theory); Combinatorics; Mathematics; Data structure; Algorithm; Decoding methods; Artificial intelligence; Programming language","score_opus":0.016770324426887896,"score_gpt":0.2608292871613097,"score_spread":0.24405896273442182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974033543","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.0016093338,0.00013545777,0.9958677,0.0008610297,0.00019811706,0.00052608846,0.000063876,0.0003250101,0.00041336264],"genre_scores_gemma":[0.32888067,0.000107978805,0.66938925,0.00068140717,0.00011961067,0.00023656513,0.000023722185,0.000032457723,0.0005283624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981673,0.000029188499,0.0002834296,0.00068587414,0.00041086902,0.00042337793],"domain_scores_gemma":[0.99811435,0.00027244142,0.000069607624,0.0010558652,0.00010061301,0.0003871014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002934815,0.0002500488,0.00020285488,0.0002942,0.0007601408,0.00020269249,0.000736518,0.00009881325,0.00002200085],"category_scores_gemma":[0.0000135085465,0.0002089819,0.000044920343,0.00077616435,0.00007860581,0.0008448109,0.000063947395,0.00028547837,0.000037660822],"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.00006698267,0.0003366775,0.00033843564,0.00001479561,0.00005210418,0.000018987519,0.00065715855,0.0018309448,0.0008252467,0.0014409065,0.0002761323,0.99414164],"study_design_scores_gemma":[0.010220899,0.0042353226,0.12718481,0.0007662281,0.00030715333,0.0013614596,0.0016554429,0.16723824,0.059439216,0.009770387,0.61270225,0.0051186047],"about_ca_topic_score_codex":0.00024417334,"about_ca_topic_score_gemma":0.00024112282,"teacher_disagreement_score":0.98902303,"about_ca_system_score_codex":0.00007350184,"about_ca_system_score_gemma":0.00007264358,"threshold_uncertainty_score":0.8522035},"labels":[],"label_agreement":null},{"id":"W1980190601","doi":"10.1145/1721837.1721842","title":"Comparison-based time-space lower bounds for selection","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":42,"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":"Upper and lower bounds; Binary logarithm; Mathematics; Combinatorics; Log-log plot; Streaming algorithm; Running time; Space (punctuation); Mathematical proof; Selection (genetic algorithm); Discrete mathematics; Randomized algorithm; Deterministic algorithm; Time complexity; Algorithm; Computer science","score_opus":0.024947962434627175,"score_gpt":0.2988886896203971,"score_spread":0.27394072718576995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980190601","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.0018620731,0.000012073216,0.99117184,0.0031646735,0.0024337855,0.00040481787,0.000034977675,0.0005874535,0.0003282865],"genre_scores_gemma":[0.21985206,0.000002573919,0.7783786,0.00046578064,0.00019882545,0.00017172101,0.000009618385,0.00003138978,0.00088942173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981883,0.00004582762,0.00031202412,0.0006194249,0.00036629298,0.0004681171],"domain_scores_gemma":[0.99795324,0.0005145979,0.0000983209,0.0010514064,0.00020329685,0.00017915672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033594866,0.00027183557,0.00027826944,0.00031123296,0.00076729245,0.0002950901,0.0012485583,0.0001814055,0.00024872035],"category_scores_gemma":[0.000050323044,0.00028078601,0.00027901182,0.0008346831,0.00013166097,0.00039375992,0.000014819938,0.0006371729,0.00016113113],"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.00012684504,0.0025119707,0.00008712661,0.000042629195,0.00015793036,0.000006251524,0.00039843563,0.009338041,0.010297984,0.011340656,0.004323654,0.9613685],"study_design_scores_gemma":[0.000992511,0.00059059676,0.00028534688,0.000015018916,0.000029043022,0.00001684017,0.000011426389,0.9131518,0.024230978,0.008891125,0.05134397,0.00044131407],"about_ca_topic_score_codex":0.00003826341,"about_ca_topic_score_gemma":0.000081834005,"teacher_disagreement_score":0.9609272,"about_ca_system_score_codex":0.00005119653,"about_ca_system_score_gemma":0.00016267376,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W1981710280","doi":"10.1145/1077464.1077467","title":"A maiden analysis of longest wait first","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multicast; Scheduling (production processes); Computer science; Competitive analysis; Combinatorics; Mathematics; Distributed computing; Mathematical optimization","score_opus":0.025029759575546602,"score_gpt":0.2748734465406962,"score_spread":0.24984368696514958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981710280","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.00064903864,0.000030220413,0.9923614,0.005903878,0.00008674043,0.00011788228,0.000017761806,0.00012143674,0.00071160175],"genre_scores_gemma":[0.5084413,0.00017572955,0.48951998,0.00037597612,0.000029205185,0.000032196058,0.0000064646356,0.000011173607,0.00140795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883777,0.000041444964,0.0002662902,0.00030117712,0.00033774177,0.00021558268],"domain_scores_gemma":[0.9986904,0.000138672,0.00006220887,0.00088004116,0.00011529012,0.00011337762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019450943,0.00011259131,0.00020566782,0.00059513765,0.00015285172,0.00006951134,0.000876472,0.00006086992,0.00057068147],"category_scores_gemma":[0.00001778995,0.00010711752,0.0001850322,0.0020262531,0.000046386678,0.00040623147,0.00001573734,0.00014538693,0.00013895998],"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.0000067960173,0.00044702334,0.000079397854,0.00000950843,0.0005653607,0.0000038292383,0.0011133549,0.52876705,0.00003940395,0.0014092966,0.00013041352,0.46742854],"study_design_scores_gemma":[0.00036531707,0.000113913535,0.0025629578,0.000010978622,0.00014176348,0.000003632725,0.000031007465,0.99000007,0.0010494663,0.000206146,0.005345894,0.00016885085],"about_ca_topic_score_codex":0.0000619455,"about_ca_topic_score_gemma":0.0002811868,"teacher_disagreement_score":0.5077923,"about_ca_system_score_codex":0.000055697503,"about_ca_system_score_gemma":0.000038210215,"threshold_uncertainty_score":0.62485623},"labels":[],"label_agreement":null},{"id":"W1987091447","doi":"10.1145/1644015.1644034","title":"Quantum algorithms for Simon's problem over nonabelian groups","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"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; Division of Computing and Communication Foundations; National Science Foundation","keywords":"Dihedral group; Mathematics; Quantum algorithm; Combinatorics; Coset; Tensor product; Discrete mathematics; Group (periodic table); Quantum; Pure mathematics; Quantum mechanics","score_opus":0.017404601045334984,"score_gpt":0.26689253997961065,"score_spread":0.24948793893427568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987091447","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.003789598,0.000121794015,0.9844785,0.007906245,0.0016526242,0.000883151,0.0000712549,0.00094957417,0.00014731276],"genre_scores_gemma":[0.18968092,0.00005317176,0.8061945,0.0026306177,0.0005528009,0.000150831,0.000019761988,0.0000721491,0.0006452798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963999,0.00009170116,0.0005899747,0.0012518142,0.00064677664,0.0010198443],"domain_scores_gemma":[0.9970974,0.00038643545,0.00017999514,0.0018010888,0.00017984271,0.00035524994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004793917,0.00057185517,0.00049255526,0.0004410957,0.00083449396,0.00037623334,0.0022377567,0.0002449581,0.000029702991],"category_scores_gemma":[0.000037229696,0.00052029185,0.00045075297,0.0010747245,0.00008643304,0.0005452799,0.00003737223,0.00065380835,0.000065040316],"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.000027435462,0.000572627,0.000004703661,0.000022409164,0.000066110144,0.000025939002,0.00048027124,0.009670495,0.00028991283,0.004548865,0.0008143438,0.9834769],"study_design_scores_gemma":[0.0017439768,0.0017447243,0.00092297024,0.000087076565,0.000041045805,0.00005713437,0.000038065566,0.9073525,0.0022070697,0.06815592,0.016774857,0.00087465113],"about_ca_topic_score_codex":0.000042073985,"about_ca_topic_score_gemma":0.000008189783,"teacher_disagreement_score":0.98260224,"about_ca_system_score_codex":0.00010797263,"about_ca_system_score_gemma":0.00012396536,"threshold_uncertainty_score":0.99972486},"labels":[],"label_agreement":null},{"id":"W1992520347","doi":"10.1145/1290672.1290684","title":"Packing element-disjoint steiner trees","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Linear programming relaxation; Disjoint sets; Upper and lower bounds; Packing problems; Matching (statistics); Terminal and nonterminal symbols; Approximation algorithm; Discrete mathematics; Linear programming; Binary logarithm; Algorithm; Computer science","score_opus":0.032282289362734744,"score_gpt":0.28109758381179123,"score_spread":0.24881529444905648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992520347","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.0019245038,0.000079315505,0.9930883,0.0015448593,0.001161878,0.00019932433,0.000013434082,0.00048562756,0.0015027577],"genre_scores_gemma":[0.45544004,0.000054166525,0.54263496,0.0008064366,0.00020735714,0.00002829058,0.00000458576,0.000029535284,0.000794624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776536,0.00004974038,0.0004255024,0.0005864945,0.0005507487,0.00062214164],"domain_scores_gemma":[0.99798834,0.00027628551,0.00008763656,0.0013460685,0.00009315831,0.00020851142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006362072,0.00026992924,0.00022603488,0.0004055619,0.00048501632,0.00018269783,0.0013973736,0.00009689166,0.00018404562],"category_scores_gemma":[0.000022688826,0.00025755906,0.00022615262,0.0009366489,0.0000953016,0.0005269711,0.00004364655,0.00040451396,0.00013876478],"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.00001009106,0.0002815597,0.000025594567,0.0000057553975,0.000055859688,0.000040863255,0.0004306989,0.0003922151,0.00035891676,0.0067283222,0.000113590904,0.9915565],"study_design_scores_gemma":[0.009973897,0.003920115,0.038031626,0.00052301347,0.0002637472,0.00072199747,0.002854803,0.31406146,0.2066982,0.20916288,0.20770757,0.0060806973],"about_ca_topic_score_codex":0.00007785656,"about_ca_topic_score_gemma":0.00017086157,"teacher_disagreement_score":0.98547584,"about_ca_system_score_codex":0.00009069228,"about_ca_system_score_gemma":0.00004153751,"threshold_uncertainty_score":0.99998766},"labels":[],"label_agreement":null},{"id":"W2003388935","doi":"10.1145/1978782.1978784","title":"How well can primal-dual and local-ratio algorithms perform?","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"Alterra Power (Canada); University of Toronto","funders":"","keywords":"Approximation algorithm; Combinatorics; Mathematics; Scheduling (production processes); Set cover problem; Steiner tree problem; Algorithm; Upper and lower bounds; Discrete mathematics; Set (abstract data type); Computer science; Mathematical optimization","score_opus":0.039176623895394745,"score_gpt":0.2333518551774825,"score_spread":0.19417523128208775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003388935","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.0022463554,0.0001269848,0.99239403,0.0023928056,0.0009406452,0.00035072383,0.000047517835,0.0004506078,0.0010503299],"genre_scores_gemma":[0.45987153,0.00022288409,0.53771317,0.0006083027,0.00014724256,0.000095902906,0.000008032377,0.00004420395,0.0012887524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973478,0.00010028551,0.00036227427,0.0009489281,0.0005619705,0.00067874196],"domain_scores_gemma":[0.99772394,0.00014983029,0.0001155276,0.0014808998,0.00015719744,0.0003726295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030447455,0.00045471586,0.00037105766,0.0003738446,0.00075133116,0.00039686039,0.0012803937,0.00019998042,0.0002023554],"category_scores_gemma":[0.000018367775,0.0004353897,0.00019108802,0.000785545,0.00041710565,0.0010174986,0.00008523687,0.00063894136,0.000060066708],"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.000016623413,0.00036433432,0.000027306343,0.000022112008,0.00009358312,0.000056571615,0.0019529797,0.00005301863,0.00005652691,0.008729119,0.00007759937,0.98855025],"study_design_scores_gemma":[0.0054899678,0.0039501134,0.009481188,0.00019999384,0.00027276273,0.0013950323,0.0037170677,0.76791984,0.07842036,0.09778697,0.027360326,0.0040063853],"about_ca_topic_score_codex":0.00032495268,"about_ca_topic_score_gemma":0.00012455735,"teacher_disagreement_score":0.98454386,"about_ca_system_score_codex":0.000100899124,"about_ca_system_score_gemma":0.00012487904,"threshold_uncertainty_score":0.9998098},"labels":[],"label_agreement":null},{"id":"W2011204371","doi":"10.1145/2229163.2229166","title":"I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Mathematics; Binary logarithm; Shortest path problem; Undirected graph; Spanning tree; Minimum spanning tree; Random graph; Path (computing); Bounded function; Enhanced Data Rates for GSM Evolution; Time complexity; Shortest-path tree; Discrete mathematics; Algorithm; Graph; Computer science","score_opus":0.04606075865658251,"score_gpt":0.28554418786670077,"score_spread":0.23948342921011825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011204371","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.0031380395,0.00028331336,0.990168,0.00064192235,0.0029014382,0.0014651349,0.00015108757,0.0009448955,0.00030619587],"genre_scores_gemma":[0.2750584,0.00010297689,0.7221321,0.00050614896,0.00044352678,0.000886934,0.000035539597,0.00010567693,0.0007287336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593997,0.00017381825,0.0006361727,0.0010201604,0.0008419721,0.0013879151],"domain_scores_gemma":[0.9956047,0.0012542767,0.00019494125,0.0019037222,0.00047154195,0.00057080155],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007974449,0.0006671331,0.0006623306,0.00059305876,0.0013054523,0.00033895366,0.0017971388,0.00023065973,0.00012452996],"category_scores_gemma":[0.0001387374,0.00051523227,0.00043530355,0.00207462,0.00031975788,0.00060329394,0.00005130658,0.0005851569,0.00006114025],"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.0009698032,0.004924691,0.00010081033,0.000071170034,0.00075239985,0.000043118238,0.002497594,0.0050067003,0.00013083173,0.012584515,0.00085776614,0.9720606],"study_design_scores_gemma":[0.022280423,0.004465521,0.0033122888,0.0004170753,0.00064205774,0.0006236488,0.00095763506,0.8825264,0.00849716,0.015838005,0.056313112,0.004126646],"about_ca_topic_score_codex":0.00008145265,"about_ca_topic_score_gemma":0.00006462154,"teacher_disagreement_score":0.96793395,"about_ca_system_score_codex":0.00016392814,"about_ca_system_score_gemma":0.00023572046,"threshold_uncertainty_score":0.9999947},"labels":[],"label_agreement":null},{"id":"W2012661148","doi":"10.1145/1798596.1798598","title":"An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cycle basis; Combinatorics; Permutation (music); Hamiltonian path; Eulerian path; Set (abstract data type); Recursion (computer science); Discrete mathematics; Directed graph; Graph; Algorithm; Lagrangian; Computer science; Pure mathematics; Line graph","score_opus":0.013359003754091013,"score_gpt":0.27905269468391103,"score_spread":0.26569369092982004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012661148","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.4239958,0.000045486962,0.57327676,0.00054535386,0.0005728403,0.00073314493,0.0006075092,0.00004626764,0.0001768485],"genre_scores_gemma":[0.96110916,0.000059539314,0.03783332,0.00018932196,0.0002198012,0.00015516477,0.00019935751,0.000045920166,0.00018842256],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989853,0.000039590577,0.00020282774,0.000359477,0.0001669577,0.00024585146],"domain_scores_gemma":[0.9984941,0.00006379013,0.000072884985,0.0011037444,0.0001468905,0.00011858798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002058132,0.00017391391,0.00013071888,0.00007034304,0.0002871278,0.000030416788,0.0006298171,0.0001493688,0.000070839276],"category_scores_gemma":[0.000020980811,0.00014823352,0.00014062962,0.0001549245,0.00011568178,0.000021799173,0.000008446247,0.00018234826,0.0000073471583],"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.00012883625,0.00057288224,0.000030827818,0.000013614593,0.0001753427,0.0000012828524,0.00041368188,0.0048999204,0.7948488,0.00017877694,0.0001208064,0.19861524],"study_design_scores_gemma":[0.0036521067,0.0031790757,0.0016001939,0.0000105155,0.0003421878,0.000043644206,0.0030879336,0.028719012,0.901488,0.0013975943,0.05569243,0.0007873089],"about_ca_topic_score_codex":0.00007998425,"about_ca_topic_score_gemma":0.0002567083,"teacher_disagreement_score":0.53711337,"about_ca_system_score_codex":0.000009039606,"about_ca_system_score_gemma":0.0000681164,"threshold_uncertainty_score":0.6044788},"labels":[],"label_agreement":null},{"id":"W2015242277","doi":"10.1145/1497290.1497295","title":"Bicriteria approximation tradeoff for the node-cost budget problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Seventh Framework Programme; Israel Science Foundation","keywords":"Approximation algorithm; Combinatorics; Mathematical optimization; Graph; Mathematics; Profit (economics); Binary logarithm; Computer science; Economics","score_opus":0.036657713358995384,"score_gpt":0.282440860536305,"score_spread":0.24578314717730965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015242277","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.00007910308,0.00009777319,0.9795135,0.017831774,0.0007447693,0.0010632778,0.000056892117,0.0003605646,0.00025230937],"genre_scores_gemma":[0.06972212,0.00010070936,0.92701775,0.0021592847,0.00020110786,0.00044838135,0.000015699872,0.000022427885,0.0003125452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982876,0.000057777168,0.00034434153,0.000527075,0.00034430093,0.00043888862],"domain_scores_gemma":[0.9980573,0.00040636412,0.00008752371,0.001238229,0.00010693082,0.00010361957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003950287,0.00025413118,0.00020497195,0.00019155326,0.0008313678,0.0003448503,0.0017222363,0.00010359685,0.0000335014],"category_scores_gemma":[0.000023119728,0.00019677289,0.00024164883,0.0007480046,0.00008080101,0.00059174834,0.000013025821,0.00030732556,0.000033452812],"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.000016836335,0.00028368254,4.933252e-7,0.00001111879,0.000033493096,0.0000015347933,0.0005767995,0.0011987356,0.00026549087,0.009691632,0.00048200265,0.9874382],"study_design_scores_gemma":[0.0017761929,0.0007272134,0.001126484,0.00006808348,0.00007395803,0.00008253956,0.00012876082,0.7873145,0.007942954,0.15896693,0.04109255,0.0006998393],"about_ca_topic_score_codex":0.000017198878,"about_ca_topic_score_gemma":0.0000060398065,"teacher_disagreement_score":0.9867383,"about_ca_system_score_codex":0.000052767988,"about_ca_system_score_gemma":0.0000502101,"threshold_uncertainty_score":0.80241656},"labels":[],"label_agreement":null},{"id":"W2020899710","doi":"10.1145/1328911.1328924","title":"Faster approximation schemes for fractional multicommodity flow problems","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Multi-commodity flow problem; Flow (mathematics); Fleischer; Representation (politics); Combinatorics; Upper and lower bounds; Flow network; Time complexity; Discrete mathematics; Tree (set theory); Maximum flow problem; Theory of computation; Approximation algorithm; Algorithm","score_opus":0.06449367461059989,"score_gpt":0.2738331663970109,"score_spread":0.20933949178641098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020899710","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.0007411924,0.000036931633,0.9953984,0.0016929548,0.00093182654,0.000581712,0.00007408127,0.00037304245,0.00016987737],"genre_scores_gemma":[0.0805874,0.000038137016,0.9180632,0.00034085335,0.00015774455,0.00038566452,0.000025641673,0.00002179541,0.00037956185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982343,0.00005308317,0.0003381735,0.0005632106,0.0004395169,0.00037174925],"domain_scores_gemma":[0.99832517,0.00035208667,0.00009576539,0.0009077545,0.00019000412,0.00012920624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021106694,0.00024555478,0.00022616785,0.0002433786,0.0009310372,0.000104178485,0.00093088223,0.00012579159,0.00007264115],"category_scores_gemma":[0.000040656723,0.00024350274,0.00024478592,0.00045592274,0.00013038501,0.0009133316,0.000024906196,0.00033601813,0.000072284456],"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.000034998775,0.0012226752,0.000031312677,0.00005804034,0.00012809056,0.000006643192,0.001068328,0.013046073,0.00023185041,0.004023817,0.0006103008,0.97953784],"study_design_scores_gemma":[0.0011972062,0.00020627992,0.0004206264,0.000026674808,0.00001541013,0.00009806198,0.000023293638,0.952027,0.0036791642,0.021981824,0.019944087,0.00038034076],"about_ca_topic_score_codex":0.000025228748,"about_ca_topic_score_gemma":0.000010019164,"teacher_disagreement_score":0.9791575,"about_ca_system_score_codex":0.00007276419,"about_ca_system_score_gemma":0.000075037315,"threshold_uncertainty_score":0.99297535},"labels":[],"label_agreement":null},{"id":"W2022248596","doi":"10.1145/2000807.2000822","title":"Carry propagation in multiplication by constants","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Computing and Communication Foundations","keywords":"Carry (investment); Adder; Constant (computer programming); Mathematics; Multiplication (music); Binary number; Arithmetic; Combinatorics; Bit (key); Variance (accounting); Discrete mathematics; Computer science; Telecommunications","score_opus":0.02137071491958299,"score_gpt":0.2148824725583402,"score_spread":0.19351175763875722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022248596","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.13808273,0.0001416268,0.8571412,0.00006664058,0.00070518604,0.000668697,0.00007162384,0.000707698,0.0024145867],"genre_scores_gemma":[0.98439467,0.0001371735,0.01510072,0.000029033603,0.000017995357,0.00017110385,0.000012951336,0.00004054812,0.0000958026],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911886,0.000021850716,0.00025300743,0.00020846397,0.00015594455,0.00024184423],"domain_scores_gemma":[0.9994264,0.000033901142,0.000024719307,0.0004160907,0.000033416534,0.00006545314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010926275,0.00016399988,0.00013186522,0.00019880602,0.00006363811,0.000014717897,0.00020636305,0.00011557138,0.00014474768],"category_scores_gemma":[0.0000073315973,0.00017227214,0.00003580899,0.00037178738,0.000041364365,0.0003320991,0.0000017833814,0.00024316367,0.00020133142],"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.00007397759,0.00061710743,0.0008967596,0.00010751959,0.00011593574,0.000015098701,0.004920736,0.01300162,0.049884155,0.000071966686,0.0008813544,0.9294138],"study_design_scores_gemma":[0.0029761957,0.00029591864,0.014834083,0.00014314645,0.000060807637,0.00002777702,0.0005229925,0.26707524,0.7097712,0.000505127,0.0026779135,0.0011096135],"about_ca_topic_score_codex":0.000075762015,"about_ca_topic_score_gemma":0.000032257125,"teacher_disagreement_score":0.92830414,"about_ca_system_score_codex":0.00014934104,"about_ca_system_score_gemma":0.000018027307,"threshold_uncertainty_score":0.70250535},"labels":[],"label_agreement":null},{"id":"W2024781872","doi":"10.1145/1798596.1798606","title":"Adaptive sampling strategies for quickselects","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Seventh Framework Programme; Consejo Superior de Investigaciones Científicas; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Mathematics; Rank (graph theory); Generalization; Statistics; Interval (graph theory); Sample (material); Range (aeronautics); Combinatorics; Relative value; Sample size determination; Value (mathematics); Sampling (signal processing); Computer science; Economics","score_opus":0.031082135522389722,"score_gpt":0.3020420511231188,"score_spread":0.27095991560072913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024781872","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.001569508,0.000017780338,0.9941828,0.0013939867,0.0015364741,0.0002661107,0.000017346014,0.00048802712,0.0005279448],"genre_scores_gemma":[0.32617846,0.000005453886,0.6729218,0.00022239126,0.0001934034,0.000100949335,0.0000028286563,0.000020922058,0.00035381602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855477,0.000037080095,0.00021369783,0.0005234715,0.0002480338,0.00042293372],"domain_scores_gemma":[0.99838555,0.00043326148,0.00007188288,0.00083569647,0.0001312906,0.00014230672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027912858,0.00022204357,0.00019111727,0.00018170854,0.0005175846,0.00029141892,0.0010628966,0.00012474354,0.000046537487],"category_scores_gemma":[0.000051370393,0.00020749471,0.00015096951,0.00039311073,0.000058252645,0.00052744645,0.000013761527,0.00070478144,0.00005650919],"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.000015910518,0.00015376389,0.000002796657,0.0000103607845,0.00004458995,0.0000031566017,0.0006521043,0.0049914313,0.0015809641,0.019257268,0.00007190128,0.97321576],"study_design_scores_gemma":[0.0015970016,0.0012524036,0.0005056012,0.00003887925,0.000042380132,0.000089117144,0.0005096231,0.87924767,0.007335421,0.0865873,0.021869501,0.0009251126],"about_ca_topic_score_codex":0.00009513043,"about_ca_topic_score_gemma":0.000063817846,"teacher_disagreement_score":0.97229064,"about_ca_system_score_codex":0.000021808974,"about_ca_system_score_gemma":0.0001641965,"threshold_uncertainty_score":0.84613883},"labels":[],"label_agreement":null},{"id":"W2027273244","doi":"10.1145/1721837.1721858","title":"A fast algorithm to generate open meandric systems and meanders","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Algorithm; Planar; Equivalence (formal languages); Simple (philosophy); Line segment; Mathematics; Line (geometry); Minor (academic); Computer science; Plane (geometry); Geometry; Discrete mathematics; Computer graphics (images)","score_opus":0.025273569158704493,"score_gpt":0.28004874856602513,"score_spread":0.25477517940732064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027273244","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.004023167,0.00004899422,0.9907494,0.0022004123,0.0020052854,0.00050021365,0.000021077689,0.00012341874,0.0003280147],"genre_scores_gemma":[0.22961794,0.000032310927,0.7673067,0.0008003223,0.000220076,0.00017935621,0.0000093092785,0.000020861864,0.0018131618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854994,0.00006309587,0.0002426941,0.0005652244,0.00031787722,0.00026116197],"domain_scores_gemma":[0.9987331,0.00011093221,0.000052200645,0.00068552245,0.00014841063,0.00026983075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036479425,0.00019046477,0.00018979465,0.00029736743,0.00043107668,0.0007866448,0.00096490997,0.00008522576,0.000028407732],"category_scores_gemma":[0.000022486207,0.00018192625,0.000046527708,0.0007932069,0.000030437932,0.0006328168,0.00006995828,0.00026735922,0.00008456143],"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.000005907172,0.000097720564,0.0000020926914,0.0000049505707,0.00003559309,0.000007061569,0.00037352555,0.016831711,0.0016358682,0.0026477273,0.000263771,0.97809404],"study_design_scores_gemma":[0.0012231818,0.00037735055,0.00062322855,0.00002424755,0.000028399367,0.00022259347,0.00012260671,0.9712955,0.0067680175,0.0034107047,0.0153138405,0.0005903796],"about_ca_topic_score_codex":0.00013152137,"about_ca_topic_score_gemma":0.00006028075,"teacher_disagreement_score":0.9775037,"about_ca_system_score_codex":0.000029889721,"about_ca_system_score_gemma":0.00008585025,"threshold_uncertainty_score":0.7585634},"labels":[],"label_agreement":null},{"id":"W2030012922","doi":"10.1145/1597036.1597043","title":"A linear-time algorithm to find a separator in a graph excluding a minor","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Time complexity; Graph; Algorithm; Separator (oil production); Minor (academic); Discrete mathematics; Physics","score_opus":0.028380276662102726,"score_gpt":0.29104313032599277,"score_spread":0.26266285366389003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030012922","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.006138503,0.00008757062,0.9876007,0.0043114885,0.00049342925,0.0005583628,0.0000594695,0.00042627504,0.00032423183],"genre_scores_gemma":[0.03613881,0.000034503213,0.9599901,0.002535832,0.00015438584,0.00012975106,0.000005054077,0.000029359098,0.0009822493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694157,0.00011859419,0.00055368844,0.0009997635,0.0005791699,0.00080718845],"domain_scores_gemma":[0.9977133,0.00024418774,0.0000826102,0.0014725416,0.00010618261,0.00038112566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004226155,0.00042851822,0.00046681912,0.0011448986,0.0003582935,0.00020820524,0.0018907669,0.00017293595,0.00010838075],"category_scores_gemma":[0.000048260168,0.0004495379,0.00028794105,0.0032821489,0.00006247234,0.0006144574,0.000045055633,0.0005836147,0.0004389653],"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.000022073602,0.0006472302,0.0000043516507,0.0000048624747,0.00003132698,0.00009517118,0.0010272196,0.0014906947,0.00072499696,0.00034623305,0.0002617895,0.99534404],"study_design_scores_gemma":[0.0043971566,0.003277374,0.008828852,0.00040571677,0.000062340536,0.000363956,0.0002001951,0.8937427,0.011074791,0.06367574,0.0113167865,0.0026544125],"about_ca_topic_score_codex":0.00008791836,"about_ca_topic_score_gemma":0.000024027417,"teacher_disagreement_score":0.9926896,"about_ca_system_score_codex":0.00012233634,"about_ca_system_score_gemma":0.00010559205,"threshold_uncertainty_score":0.9997956},"labels":[],"label_agreement":null},{"id":"W2030970869","doi":"10.1145/1597036.1597045","title":"A better approximation ratio for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Vertex cover; Cover (algebra); Relaxation (psychology); Vertex (graph theory); Maximum cut; Approximation algorithm; Set cover problem; Set (abstract data type); Discrete mathematics; Computer science; Graph","score_opus":0.027687554589769903,"score_gpt":0.26386242298239165,"score_spread":0.23617486839262175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030970869","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.00008011792,0.00005426934,0.9811441,0.01697808,0.0005024229,0.0007054021,0.000018392602,0.00022247409,0.00029476435],"genre_scores_gemma":[0.09922127,0.000048586102,0.8943051,0.005196336,0.00015734442,0.00033082857,0.000009242757,0.000017491868,0.00071379583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870163,0.00004200711,0.00024914282,0.0003929851,0.00031061852,0.00030363712],"domain_scores_gemma":[0.9983894,0.0004084414,0.00006639312,0.00097297516,0.000098746845,0.000064027336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026868202,0.00018361642,0.00014901414,0.00012048584,0.00065775454,0.00025847697,0.0011637482,0.00007491212,0.000044136],"category_scores_gemma":[0.000019151084,0.00013798138,0.00018637729,0.0004946274,0.000057270696,0.0005533231,0.000010449343,0.00023669985,0.00006175894],"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.000011823315,0.00017717363,5.679812e-7,0.000005964715,0.000034616765,0.0000010094897,0.0004102856,0.0017344996,0.0001191803,0.012915857,0.0008326843,0.98375636],"study_design_scores_gemma":[0.00095972314,0.0004527008,0.0006075534,0.000028001657,0.00003823356,0.000023289878,0.00003206939,0.80729854,0.0034795941,0.17054653,0.016215404,0.0003183467],"about_ca_topic_score_codex":0.000009477433,"about_ca_topic_score_gemma":0.0000033490426,"teacher_disagreement_score":0.983438,"about_ca_system_score_codex":0.000044062217,"about_ca_system_score_gemma":0.000043598502,"threshold_uncertainty_score":0.5626717},"labels":[],"label_agreement":null},{"id":"W2033561606","doi":"10.1145/2601071","title":"Faster Algorithms for Semi-Matching Problems","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"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":"Algorithm; Combinatorics; Bipartite graph; Binary logarithm; Matching (statistics); Mathematics; Simple (philosophy); Running time; Time complexity; Scheduling (production processes); Upper and lower bounds; Computer science; Discrete mathematics; Graph; Mathematical optimization","score_opus":0.036387628298889294,"score_gpt":0.28501888826687455,"score_spread":0.24863125996798524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033561606","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.00006897486,0.000019185878,0.9932738,0.0037996862,0.000734949,0.000677161,0.00001977749,0.0004618345,0.0009446255],"genre_scores_gemma":[0.035371076,0.000047836493,0.9592478,0.0015061588,0.000153935,0.00042173537,0.000014332542,0.000052432708,0.003184638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791294,0.00011146955,0.00037369103,0.00063808856,0.00042045407,0.0005433428],"domain_scores_gemma":[0.99804735,0.0003808646,0.00008838898,0.0010705593,0.00018883668,0.00022402752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006199311,0.00025637654,0.00024955728,0.00025490404,0.0004942336,0.0003332219,0.0012556647,0.00012953037,0.00008323667],"category_scores_gemma":[0.000044226043,0.00023723583,0.00017952095,0.0004839163,0.000053087733,0.00072001293,0.00002986062,0.0003102403,0.00012433165],"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.000008033939,0.0002604882,0.000002736902,0.00005184314,0.000054704073,0.0000011788987,0.0013154488,0.09022911,0.00029700046,0.0042004786,0.00025009015,0.9033289],"study_design_scores_gemma":[0.0012590016,0.00042313745,0.00003240682,0.000056555637,0.000014579092,0.000018612336,0.000058114296,0.9397352,0.0013954663,0.020593112,0.03599683,0.00041699936],"about_ca_topic_score_codex":0.00004304574,"about_ca_topic_score_gemma":0.000017973274,"teacher_disagreement_score":0.9029119,"about_ca_system_score_codex":0.000059364414,"about_ca_system_score_gemma":0.000055091576,"threshold_uncertainty_score":0.9674196},"labels":[],"label_agreement":null},{"id":"W2033661244","doi":"10.1145/1435375.1435378","title":"Competitive buffer management for shared-memory switches","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Competitive analysis; Computer science; Network packet; Queue; Buffer (optical fiber); Preemption; Constraint (computer-aided design); Partition (number theory); Upper and lower bounds; Online algorithm; Computer network; Operating system; Algorithm; Mathematics; Telecommunications","score_opus":0.03958810005221866,"score_gpt":0.2723584283068775,"score_spread":0.23277032825465885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033661244","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.000077532866,0.000024270132,0.99054444,0.0023328313,0.000336561,0.0005750231,0.00002915686,0.0002645061,0.005815665],"genre_scores_gemma":[0.053415913,0.00028025758,0.9352186,0.0010857559,0.000054893007,0.00043430124,0.000015623173,0.000026539736,0.009468148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879545,0.000028885532,0.00019099837,0.0004010545,0.0002859655,0.00029765474],"domain_scores_gemma":[0.99895656,0.00012089001,0.000036388672,0.00064673106,0.00011993447,0.00011950596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012916682,0.00014960249,0.00014044931,0.00018565646,0.00045590175,0.00007598549,0.00078843447,0.00005402869,0.00016405189],"category_scores_gemma":[0.000008443783,0.0001443584,0.00011607142,0.0003465543,0.00006192013,0.00038776855,0.00002159741,0.00014201076,0.00014512407],"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.00006404904,0.0016343363,0.0000114917675,0.000114977855,0.00035635865,0.00007645862,0.0044354447,0.030373333,0.00015133827,0.04859621,0.0036396205,0.91054636],"study_design_scores_gemma":[0.011054945,0.0024357755,0.0046476945,0.00026418414,0.0001133488,0.00027661567,0.0017039675,0.7360203,0.01593788,0.018685741,0.20635685,0.0025026905],"about_ca_topic_score_codex":0.000010331818,"about_ca_topic_score_gemma":0.0000051508778,"teacher_disagreement_score":0.9080437,"about_ca_system_score_codex":0.000057057423,"about_ca_system_score_gemma":0.00003778173,"threshold_uncertainty_score":0.58867645},"labels":[],"label_agreement":null},{"id":"W2048794017","doi":"10.1145/1367064.1367070","title":"Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":89,"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":"Combinatorics; Planar; Decomposition; Planar graph; Mathematics; Graph; Discrete mathematics; Computer science","score_opus":0.017709346758674253,"score_gpt":0.2716123867468868,"score_spread":0.25390303998821256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048794017","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.08109193,0.000084830004,0.91724956,0.0005011362,0.000086562446,0.000310883,0.000046670073,0.00017534579,0.00045308453],"genre_scores_gemma":[0.66772115,0.00023275611,0.3313138,0.00024422933,0.0000261848,0.00007519386,0.000012084462,0.000036339046,0.00033827676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787205,0.00017362538,0.00041087376,0.0005315916,0.0005430895,0.00046877586],"domain_scores_gemma":[0.9982444,0.00034539637,0.00007647786,0.001088836,0.000097599994,0.0001472828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030742533,0.00022769706,0.00031597418,0.00065509666,0.00023534244,0.000025157844,0.0012968454,0.00011715082,0.00006403303],"category_scores_gemma":[0.000017410683,0.00023778032,0.00017877591,0.0015035735,0.00023887932,0.00071693055,0.000021293987,0.00045912236,0.00014471282],"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.00075297133,0.0042737564,0.0004559498,0.00010900059,0.00030559322,0.0005855556,0.0074683107,0.46734884,0.028264977,0.0122855175,0.0008100294,0.4773395],"study_design_scores_gemma":[0.010711894,0.0036786383,0.0048762695,0.00040871513,0.000060822807,0.001655062,0.00029915877,0.6008521,0.24017207,0.13195059,0.0027552994,0.002579401],"about_ca_topic_score_codex":0.00004148658,"about_ca_topic_score_gemma":0.0000036318804,"teacher_disagreement_score":0.5866292,"about_ca_system_score_codex":0.000060562747,"about_ca_system_score_gemma":0.000074564814,"threshold_uncertainty_score":0.96963996},"labels":[],"label_agreement":null},{"id":"W2051835769","doi":"10.1145/1198513.1198523","title":"Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Communication source; Upper and lower bounds; Bandwidth (computing); Network packet; Scheduling (production processes); Computer network; Real-time computing; Bandwidth allocation; Channel (broadcasting); Algorithm; Mathematics; Mathematical optimization","score_opus":0.009493140495814548,"score_gpt":0.21849763498636207,"score_spread":0.20900449449054753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051835769","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.017302629,0.00016193293,0.980298,0.0005146051,0.0003976439,0.00031069256,0.000035020876,0.0004072671,0.000572202],"genre_scores_gemma":[0.41235572,0.00024018025,0.58627176,0.00020444795,0.00016739253,0.000080934966,0.000018986593,0.00010006869,0.0005605108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866706,0.000031456122,0.00029508452,0.0004013545,0.00022480123,0.0003802193],"domain_scores_gemma":[0.99915546,0.000188127,0.000030062938,0.0004259814,0.000052848187,0.0001475156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008311943,0.00031440292,0.00025871757,0.00021023168,0.00018824959,0.0000671745,0.00016667503,0.00015897093,0.0001249788],"category_scores_gemma":[0.000012107069,0.0003232996,0.00006873353,0.0002578402,0.000039181654,0.0002321898,0.0000067772316,0.00030453928,0.000054453725],"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.000043493925,0.000051244373,0.000032430667,0.000015115433,0.000049256174,0.0000091332795,0.00013080549,0.9551976,0.00037194794,0.000025883586,0.0002549363,0.04381821],"study_design_scores_gemma":[0.0021175332,0.00016694567,0.002301462,0.00017786866,0.00010831351,0.000041548326,0.0000907603,0.9825587,0.0070553496,0.001317473,0.0030928566,0.00097117963],"about_ca_topic_score_codex":0.000013179906,"about_ca_topic_score_gemma":0.00001271319,"teacher_disagreement_score":0.39505312,"about_ca_system_score_codex":0.00010976709,"about_ca_system_score_gemma":0.0000101327805,"threshold_uncertainty_score":0.9999219},"labels":[],"label_agreement":null},{"id":"W2052373622","doi":"10.1145/1328911.1328921","title":"Approximate distance oracles for geometric spanners","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Shortest path problem; Constant (computer programming); Data structure; Euclidean space; Binary logarithm; Distance; Oracle; Path (computing); Discrete mathematics; Dilation (metric space); Computational geometry; Graph; Algorithm; Computer science","score_opus":0.039160389139892775,"score_gpt":0.2687088556867836,"score_spread":0.22954846654689082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052373622","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.0020447436,0.00012852054,0.9953543,0.0011993365,0.0006345415,0.00027476653,0.000030963467,0.0002107956,0.000122055775],"genre_scores_gemma":[0.41817847,0.00009640836,0.58005345,0.0002693835,0.000096176,0.00013054903,0.00001581537,0.000013376406,0.0011463801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882674,0.000025767198,0.00021006423,0.00039968485,0.00028633463,0.00025141143],"domain_scores_gemma":[0.9989339,0.00026119943,0.00006143514,0.0005088433,0.0001382076,0.000096405034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001538712,0.00014520099,0.00013966733,0.00038874085,0.00051049795,0.00006453748,0.00051540474,0.000055441335,0.000016432885],"category_scores_gemma":[0.000048658923,0.00014375347,0.000116856594,0.0014162218,0.000043798653,0.00044230602,0.000009065736,0.00010950461,0.000040292598],"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.000029157787,0.0003553371,0.00001335398,0.000022633276,0.00005126468,0.000010902245,0.00031663704,0.06628166,0.00019063472,0.0070347115,0.00075984246,0.92493385],"study_design_scores_gemma":[0.0022090096,0.0006643855,0.0026916503,0.000029113124,0.000036142053,0.00019709459,0.00006931475,0.9015295,0.024798602,0.023794366,0.04308888,0.00089193764],"about_ca_topic_score_codex":0.000008691519,"about_ca_topic_score_gemma":0.000004076101,"teacher_disagreement_score":0.9240419,"about_ca_system_score_codex":0.00005590355,"about_ca_system_score_gemma":0.00006938434,"threshold_uncertainty_score":0.58620965},"labels":[],"label_agreement":null},{"id":"W2055000959","doi":"10.1145/1435375.1435381","title":"Distributed weighted vertex cover via maximal matchings","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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":"Vertex cover; Combinatorics; Mathematics; Vertex (graph theory); Feedback vertex set; Edge cover; Binary logarithm; Upper and lower bounds; Undirected graph; Matching (statistics); Minimum weight; Cover (algebra); Graph; Discrete mathematics","score_opus":0.023679275711912053,"score_gpt":0.2385259495041349,"score_spread":0.21484667379222283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055000959","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.004994719,0.00005186304,0.99061716,0.0018266013,0.001141843,0.00020871537,0.000112748996,0.000656626,0.00038971257],"genre_scores_gemma":[0.55167836,0.00015399077,0.44593447,0.00108665,0.00010806166,0.000072350136,0.000044863482,0.00004413622,0.00087714527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771714,0.0000800014,0.0003711237,0.0006818339,0.0005995317,0.0005503765],"domain_scores_gemma":[0.99794525,0.00022548849,0.000085425854,0.0013897071,0.00011607561,0.00023807546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001472877,0.00033267058,0.00031811334,0.00025646994,0.00090026157,0.00011222745,0.001731161,0.00014609886,0.00034090228],"category_scores_gemma":[0.000015389605,0.00032816152,0.0002679155,0.0011103222,0.00019978624,0.0007366644,0.000052327046,0.0005424341,0.0006204811],"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.00009304035,0.0019176193,0.00009450402,0.000031306998,0.00032397086,0.0005481427,0.0016760929,0.0013061878,0.00054207974,0.006694146,0.003678489,0.9830944],"study_design_scores_gemma":[0.004279176,0.0010031351,0.012350682,0.000097910895,0.00008803074,0.002208646,0.000070098904,0.7986009,0.013601128,0.11285255,0.05265109,0.0021966642],"about_ca_topic_score_codex":0.00012974246,"about_ca_topic_score_gemma":0.0000060390084,"teacher_disagreement_score":0.9808978,"about_ca_system_score_codex":0.0001027206,"about_ca_system_score_gemma":0.000082864884,"threshold_uncertainty_score":0.99991703},"labels":[],"label_agreement":null},{"id":"W2058105885","doi":"10.1145/1150334.1150337","title":"Bipartite roots of graphs","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Graph isomorphism; Complete bipartite graph; Discrete mathematics; Cograph; Time complexity; Edge-transitive graph; Line graph; Isomorphism (crystallography); Graph; Pathwidth; Voltage graph","score_opus":0.019697867541191533,"score_gpt":0.2844186336568095,"score_spread":0.264720766115618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058105885","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.008027884,0.00008783397,0.9899929,0.00048087467,0.0002191975,0.00014284457,0.000014258308,0.00016619287,0.0008679722],"genre_scores_gemma":[0.790545,0.000030447862,0.208572,0.000052969204,0.00002161468,0.00003853414,0.0000016688973,0.000015631309,0.000722159],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986404,0.000071104645,0.00024425497,0.00033554132,0.0003935164,0.00031515965],"domain_scores_gemma":[0.9984515,0.00019457343,0.00005744012,0.00111415,0.00010600116,0.00007634415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021214985,0.0001310222,0.00015602117,0.00037476872,0.00015006495,0.000036205834,0.0010853558,0.000057711648,0.000049708262],"category_scores_gemma":[0.000014417621,0.00012464143,0.00013529106,0.0011695017,0.00013250994,0.0003835977,0.000017225007,0.0002071117,0.0000674754],"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.00004205387,0.00085546414,0.00019734756,0.000027697271,0.00006876209,0.000030948857,0.00013731557,0.013964504,0.013691556,0.13916063,0.00019298919,0.8316307],"study_design_scores_gemma":[0.0012231679,0.00052574323,0.0097737545,0.000047360045,0.000019340994,0.00003992575,0.000039156646,0.023970636,0.18709607,0.77277184,0.0039847097,0.00050828705],"about_ca_topic_score_codex":0.00007312698,"about_ca_topic_score_gemma":0.000026596943,"teacher_disagreement_score":0.83112246,"about_ca_system_score_codex":0.000024163477,"about_ca_system_score_gemma":0.000033586908,"threshold_uncertainty_score":0.508273},"labels":[],"label_agreement":null},{"id":"W2060363698","doi":"10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"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; University of Alberta","funders":"","keywords":"Approximation algorithm; Combinatorics; Disjoint sets; Mathematics; Upper and lower bounds; Packing problems; Undirected graph; Binary logarithm; Log-log plot; Discrete mathematics; Graph; Algorithm","score_opus":0.041048612578643416,"score_gpt":0.285998406091064,"score_spread":0.24494979351242055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060363698","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.0011346347,0.000112016794,0.99427545,0.0015319401,0.0012205185,0.0007794464,0.00008857498,0.00044486302,0.00041254718],"genre_scores_gemma":[0.09082012,0.00008712043,0.90801126,0.00030643103,0.00020945395,0.00016054361,0.000025153466,0.00003768861,0.0003422432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747384,0.00004977693,0.0005738949,0.0008388397,0.0004409746,0.0006227055],"domain_scores_gemma":[0.99785846,0.0005454886,0.00016316162,0.0010222599,0.00019297466,0.00021766263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001316249,0.00030988164,0.00028777073,0.00039817407,0.00075527007,0.0002952195,0.0009178074,0.00016587456,0.0000054177835],"category_scores_gemma":[0.00008346747,0.00031027576,0.00016359457,0.00079382607,0.00013682873,0.0008086751,0.000041497056,0.0003338484,0.000013398858],"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.00004532666,0.00024239274,0.0000043520845,0.00004769152,0.00004842033,0.0000061795936,0.0012033955,0.0006203487,0.00018712197,0.0031692944,0.00007039793,0.9943551],"study_design_scores_gemma":[0.005206062,0.00094568264,0.0017126462,0.00021261733,0.000068784764,0.00016833175,0.00048228103,0.8287604,0.015164812,0.12767597,0.018353162,0.0012492627],"about_ca_topic_score_codex":0.00006241995,"about_ca_topic_score_gemma":0.00005176052,"teacher_disagreement_score":0.9931058,"about_ca_system_score_codex":0.00007730688,"about_ca_system_score_gemma":0.00004510627,"threshold_uncertainty_score":0.9999349},"labels":[],"label_agreement":null},{"id":"W2066369985","doi":"10.1145/2000807.2000819","title":"Cake cutting really is not a piece of cake","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Division of Information and Intelligent Systems; Division of Computer and Network Systems; Division of Computing and Communication Foundations","keywords":"Bounding overwatch; Protocol (science); Upper and lower bounds; Mathematics; Divide and conquer algorithms; Value (mathematics); Computer science; Combinatorics; Discrete mathematics; Algorithm; Statistics; Artificial intelligence","score_opus":0.04865011138230788,"score_gpt":0.2574393791545293,"score_spread":0.20878926777222143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066369985","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.0059837396,0.000035852707,0.9912901,0.00038081052,0.00039602703,0.00013581898,0.00015605378,0.00017404695,0.0014475688],"genre_scores_gemma":[0.45123672,0.00008061223,0.5480772,0.0005059662,0.000028423734,0.000019791518,0.0000035367689,0.000012480624,0.000035204397],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99856484,0.000047688594,0.0003236965,0.00044674167,0.00032301346,0.00029404226],"domain_scores_gemma":[0.99812627,0.000107792155,0.00010777559,0.0014226625,0.00010951892,0.00012599117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023847849,0.00017339678,0.00020175426,0.00022621299,0.00019707803,0.000040663992,0.0012728655,0.000098244345,0.00017725948],"category_scores_gemma":[0.000019027188,0.00017115465,0.0001824652,0.0007092383,0.00008909723,0.00049616024,0.000030459112,0.00026656262,0.00004530869],"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.00004665355,0.0007926194,0.000111345966,0.000042070864,0.00012963281,0.000028584112,0.01033206,0.000015183871,0.0006466562,0.016961537,0.00027193286,0.9706217],"study_design_scores_gemma":[0.0072028236,0.00399338,0.050954025,0.0005893999,0.00049371074,0.00048163434,0.0020391282,0.064346075,0.6758584,0.119529955,0.070379175,0.00413231],"about_ca_topic_score_codex":0.0007237629,"about_ca_topic_score_gemma":0.0000756696,"teacher_disagreement_score":0.96648943,"about_ca_system_score_codex":0.000017332502,"about_ca_system_score_gemma":0.000059037127,"threshold_uncertainty_score":0.6979484},"labels":[],"label_agreement":null},{"id":"W2072577896","doi":"10.1145/1383369.1383379","title":"The relative worst order ratio applied to seat reservation","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","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 Toronto","funders":"","keywords":"Reservation; Order (exchange); Competitive analysis; Computer science; Online algorithm; Measure (data warehouse); Quality (philosophy); Mathematical optimization; Algorithm; Mathematics; Upper and lower bounds; Data mining; Computer network","score_opus":0.04390905179000232,"score_gpt":0.27495948158162753,"score_spread":0.2310504297916252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072577896","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.00017714709,0.000011805665,0.9779905,0.018309293,0.00025786628,0.0004791648,0.000003327522,0.00019778912,0.0025730876],"genre_scores_gemma":[0.09827909,0.00027817776,0.883805,0.00264839,0.00008355641,0.00042727395,0.000008967006,0.000032659435,0.014436913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998621,0.000086528955,0.0002271256,0.00034444692,0.00043800383,0.0002828835],"domain_scores_gemma":[0.9983793,0.0003321175,0.00004301167,0.000873375,0.00023506171,0.00013711763],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002947668,0.00013159485,0.00010264103,0.00013533681,0.0013401161,0.00014634265,0.00087583606,0.000063624866,0.00004733812],"category_scores_gemma":[0.00007568448,0.000099884055,0.000048463895,0.0014035203,0.00007252896,0.0005012304,0.000024365654,0.00027842115,0.00033123998],"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.000104391904,0.00045834752,0.00003202123,0.000008931174,0.00015099072,0.000016665821,0.0116626555,0.2775945,0.0005204697,0.091855384,0.004872617,0.612723],"study_design_scores_gemma":[0.0026528684,0.00078712817,0.0044834614,0.00004749101,0.000023948123,0.000055703404,0.00047275017,0.83873314,0.0067738253,0.025196254,0.119647704,0.0011257192],"about_ca_topic_score_codex":0.000025349209,"about_ca_topic_score_gemma":0.00003310384,"teacher_disagreement_score":0.6115973,"about_ca_system_score_codex":0.000076662436,"about_ca_system_score_gemma":0.00010992792,"threshold_uncertainty_score":0.99996},"labels":[],"label_agreement":null},{"id":"W2082869103","doi":"10.1145/1125994.1125995","title":"Generating rooted and free plane trees","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"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 Guelph","funders":"","keywords":"Lexicographical order; Bounding overwatch; Mathematics; Plane (geometry); Sequence (biology); Tree (set theory); Amortized analysis; Combinatorics; Centroid; Representation (politics); Weight-balanced tree; Simple (philosophy); Algorithm; Binary search tree; Computer science; Data structure; Binary tree; Artificial intelligence; Geometry","score_opus":0.027424434934679675,"score_gpt":0.28271557075071213,"score_spread":0.25529113581603247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082869103","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.07734287,0.000081699385,0.9201622,0.00042563924,0.00048316835,0.00031580488,0.000057856763,0.0003879878,0.0007427747],"genre_scores_gemma":[0.2577959,0.000019625144,0.7405197,0.00004989524,0.0002581317,0.00006401954,0.000006743639,0.00007233953,0.0012136453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988434,0.000038909482,0.00034025303,0.0002638703,0.0002621823,0.00025139915],"domain_scores_gemma":[0.9983813,0.0006345119,0.00009854937,0.0007677011,0.000051990275,0.000065946515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012808986,0.00021554562,0.0002585173,0.00010212191,0.000245694,0.00004997733,0.0002787328,0.00011295972,0.000061903265],"category_scores_gemma":[0.00017852473,0.00020429134,0.00006194398,0.00018454758,0.000055880224,0.00012885363,0.0000124760645,0.0002344677,0.0000148553145],"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.00021799727,0.005589255,0.00010449482,0.00077480177,0.00067679014,0.00023936926,0.0028653394,0.018406643,0.032521755,0.34793812,0.0071376604,0.58352774],"study_design_scores_gemma":[0.0013831592,0.00015231171,0.00007538255,0.000059232392,0.00008122733,0.000052002964,0.00012495223,0.00958358,0.011365777,0.9762267,0.00055477925,0.0003409234],"about_ca_topic_score_codex":0.000052627347,"about_ca_topic_score_gemma":0.00012861069,"teacher_disagreement_score":0.62828857,"about_ca_system_score_codex":0.000050223796,"about_ca_system_score_gemma":0.000016837925,"threshold_uncertainty_score":0.8330759},"labels":[],"label_agreement":null},{"id":"W2083082533","doi":"10.1145/1798596.1798599","title":"An approximation algorithm for the maximum leaf spanning arborescence problem","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"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; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Subroutine; Spanning tree; Combinatorics; Mathematics; Approximation algorithm; Class (philosophy); Discrete mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.024266179078183056,"score_gpt":0.3062330322091877,"score_spread":0.2819668531310046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083082533","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.00028304599,0.00002709639,0.9958711,0.0017103849,0.0006601535,0.0009843943,0.000026827998,0.0003529081,0.00008408359],"genre_scores_gemma":[0.042200472,0.000023378121,0.95666593,0.0001789696,0.00013799347,0.00059681956,0.0000055789405,0.000034806584,0.00015604416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979324,0.00008585121,0.00027175224,0.0006537569,0.0004997123,0.0005565318],"domain_scores_gemma":[0.9968979,0.00063153653,0.00008977633,0.0019749412,0.00023208841,0.00017378521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008929633,0.0002321978,0.00016466028,0.00022495068,0.0009484427,0.00030520887,0.0025933564,0.00012366076,0.000028161527],"category_scores_gemma":[0.000054029653,0.00017887162,0.00013189197,0.00076917664,0.00021562258,0.0011502884,0.00002680971,0.0007956313,0.000035061923],"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.000011157167,0.00015866237,0.0000023281686,0.0000075842327,0.00002170044,0.0000020814634,0.0003669115,0.0015727979,0.0031870464,0.0063260365,0.000011444241,0.9883323],"study_design_scores_gemma":[0.00055189064,0.00031849023,0.00016628958,0.00001578601,0.00001512948,0.000032425112,0.00014251008,0.8670442,0.018361151,0.111151814,0.0019120652,0.00028821104],"about_ca_topic_score_codex":0.000026057109,"about_ca_topic_score_gemma":0.00002110233,"teacher_disagreement_score":0.988044,"about_ca_system_score_codex":0.00003713096,"about_ca_system_score_gemma":0.00008584627,"threshold_uncertainty_score":0.729475},"labels":[],"label_agreement":null},{"id":"W2086702855","doi":"10.1145/1978782.1978789","title":"Randomized rendezvous with limited memory","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rendezvous; Corollary; Computer science; Node (physics); State (computer science); Ring (chemistry); Discrete mathematics; Mathematics; Combinatorics; Algorithm; Physics","score_opus":0.04869198837809187,"score_gpt":0.25294687808002886,"score_spread":0.204254889701937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086702855","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.00017406131,0.000026377023,0.9885726,0.0008832695,0.00023921099,0.00045010867,0.0000032868843,0.0004403355,0.00921075],"genre_scores_gemma":[0.11604435,0.00013892332,0.8796575,0.00073419843,0.000023965857,0.00019944429,0.0000031165787,0.000027787206,0.003170728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985074,0.00019998528,0.0002496109,0.00039280526,0.00035202535,0.0002982223],"domain_scores_gemma":[0.99844164,0.00020056489,0.0000682842,0.000979711,0.00014260555,0.00016717653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042006042,0.00017671345,0.00027826117,0.00024781804,0.00021800224,0.00008525153,0.0008801475,0.00007344406,0.0003555002],"category_scores_gemma":[0.000034256394,0.00013179264,0.00011778335,0.0006246612,0.0001373829,0.0004516283,0.000013587571,0.00025566143,0.00014785702],"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.010205487,0.0014317053,0.000004170239,0.0000287513,0.00050066534,0.000121757614,0.010677647,0.01045199,0.00006342117,0.009797874,0.0002414575,0.9564751],"study_design_scores_gemma":[0.27864823,0.0015992305,0.00021104033,0.00012966176,0.0001649783,0.00026482035,0.00045781492,0.6874491,0.0129756555,0.014475479,0.0020936334,0.0015303562],"about_ca_topic_score_codex":0.00008365669,"about_ca_topic_score_gemma":0.000014303956,"teacher_disagreement_score":0.95494473,"about_ca_system_score_codex":0.000029948547,"about_ca_system_score_gemma":0.00007454791,"threshold_uncertainty_score":0.53743476},"labels":[],"label_agreement":null},{"id":"W2089187143","doi":"10.1145/2594581","title":"Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"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","keywords":"Computer science; Node (physics); Normalization property; Computer network; Theoretical computer science","score_opus":0.02026235510793927,"score_gpt":0.24898517807918782,"score_spread":0.22872282297124855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089187143","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.00051665993,0.00001577718,0.9971406,0.00094671495,0.00044408944,0.00030869714,0.0000033739627,0.0003053488,0.00031872877],"genre_scores_gemma":[0.8277739,0.00004250022,0.17064421,0.00061968854,0.00006370594,0.00012623536,0.00002043567,0.000027571541,0.0006817188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998157,0.00013739473,0.00032587253,0.000525808,0.00047561806,0.00037829095],"domain_scores_gemma":[0.99857455,0.000113383416,0.00010878678,0.00089765294,0.00010173332,0.00020389004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003231418,0.00019767231,0.00017919295,0.000097330594,0.000357267,0.00019413386,0.0004540602,0.00008299865,0.00007363873],"category_scores_gemma":[0.000016696988,0.00017298252,0.000059709975,0.0005042962,0.00007737677,0.0005441345,0.000011825356,0.00021947334,0.00005735141],"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.000009059708,0.00016694493,0.0000021976725,0.0000062494996,0.000017447874,0.000024453895,0.0002442129,0.54569256,0.0000073055494,0.000054585213,0.0008913937,0.45288357],"study_design_scores_gemma":[0.0004621021,0.0006791621,0.000043082106,0.000032462078,0.000015302128,0.00008675994,0.000036284437,0.99049073,0.00021134198,0.00055071415,0.007130246,0.00026183043],"about_ca_topic_score_codex":0.000011615674,"about_ca_topic_score_gemma":0.000021248266,"teacher_disagreement_score":0.8272573,"about_ca_system_score_codex":0.000063085354,"about_ca_system_score_gemma":0.00006598339,"threshold_uncertainty_score":0.7054022},"labels":[],"label_agreement":null},{"id":"W2090543144","doi":"10.1145/2344422.2344430","title":"An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"McMaster University","funders":"","keywords":"Tardiness; Due date; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Computer science; Retard; Mathematics; Schedule; Medicine; Operating system","score_opus":0.013286626800288642,"score_gpt":0.2519840459485223,"score_spread":0.23869741914823367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090543144","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.032840203,0.00009448821,0.9652341,0.00015678703,0.00054360233,0.00047009683,0.00020515622,0.00029715753,0.00015843073],"genre_scores_gemma":[0.61783797,0.000015873975,0.3814513,0.000018367318,0.00015548499,0.00024340746,0.000055962704,0.000063054715,0.00015859627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989735,0.000027021708,0.0002665684,0.00018656797,0.00020415583,0.00034222446],"domain_scores_gemma":[0.9988767,0.00027741282,0.000050197366,0.00054111605,0.00012598159,0.00012860188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015854994,0.00023075435,0.0002317229,0.00006918195,0.0001930317,0.000039486975,0.00027200812,0.00009808653,0.00019190948],"category_scores_gemma":[0.000012359432,0.00015960744,0.0000935993,0.00035886595,0.00007422245,0.00029419182,0.0000031115937,0.00018360109,0.000018227025],"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.00040794542,0.0015724598,0.0013521924,0.00033567418,0.0014302572,0.000004782559,0.0033283744,0.663873,0.000884955,0.00026648433,0.00033780027,0.32620606],"study_design_scores_gemma":[0.0019360475,0.00023665075,0.0028003529,0.00007242519,0.00034377893,0.00011298283,0.00084826065,0.97881734,0.013320482,0.000097140444,0.0008419468,0.0005725874],"about_ca_topic_score_codex":0.000030773732,"about_ca_topic_score_gemma":0.000009666903,"teacher_disagreement_score":0.5849977,"about_ca_system_score_codex":0.000031196698,"about_ca_system_score_gemma":0.00002146995,"threshold_uncertainty_score":0.65086025},"labels":[],"label_agreement":null},{"id":"W2099914933","doi":"10.1145/1240233.1240237","title":"Improved algorithms for weakly chordal graphs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Treewidth; Clique problem; Split graph; Discrete mathematics; Computational complexity theory; Clique; Time complexity; Algorithm; Graph; Pathwidth; Line graph; 1-planar graph","score_opus":0.03253514641846965,"score_gpt":0.32550833371528026,"score_spread":0.2929731872968106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099914933","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.0007032085,0.00007264172,0.99538195,0.000995967,0.0011149517,0.000853183,0.000053052805,0.0005044266,0.00032058917],"genre_scores_gemma":[0.074973255,0.000059172347,0.9228054,0.00042459683,0.00014089947,0.0002620081,0.00000769652,0.0000629968,0.0012639586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970211,0.00006703119,0.00044996114,0.0008842708,0.0005303677,0.0010473079],"domain_scores_gemma":[0.9967189,0.0008247365,0.000096078016,0.0017104518,0.00027994585,0.00036987476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012687291,0.00033816657,0.00029471604,0.000657415,0.0006193945,0.00015249681,0.0021794129,0.00018002339,0.00004113089],"category_scores_gemma":[0.00009688683,0.00032942547,0.0003450929,0.0014085644,0.00018688389,0.0007472446,0.00003803599,0.0005482471,0.00005552073],"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.000100858975,0.00028929624,0.000004034212,0.0000142072595,0.00007694551,0.0000145667655,0.00023028227,0.0001678723,0.0047759316,0.01114635,0.000055948753,0.9831237],"study_design_scores_gemma":[0.006594119,0.003751558,0.0013222995,0.00007829151,0.00008598708,0.0002141811,0.0004960368,0.22113922,0.28092632,0.4547879,0.02827965,0.0023244463],"about_ca_topic_score_codex":0.000032010415,"about_ca_topic_score_gemma":0.000030054862,"teacher_disagreement_score":0.98079926,"about_ca_system_score_codex":0.00011969857,"about_ca_system_score_gemma":0.0000920824,"threshold_uncertainty_score":0.9999158},"labels":[],"label_agreement":null},{"id":"W2114804538","doi":"10.1145/2151171.2151173","title":"Succinct geometric indexes supporting point location queries","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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; Carleton University","funders":"","keywords":"Point location; Point (geometry); Mathematics; Combinatorics; Bounded function; Entropy (arrow of time); Planar; Space (punctuation); Line segment; Computational geometry; Computer science; Discrete mathematics; Algorithm; Geometry","score_opus":0.02228141457167807,"score_gpt":0.27819387146114904,"score_spread":0.25591245688947095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114804538","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.0107761305,0.0002239492,0.9856727,0.0015342144,0.0011522127,0.00016458155,0.0000048380593,0.00022543078,0.0002459488],"genre_scores_gemma":[0.8199401,0.000019652782,0.17920193,0.00029023408,0.00018090848,0.000037226062,0.000011553691,0.000010219608,0.00030821035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985264,0.000063521664,0.0003299707,0.00029434232,0.0004067734,0.00037900667],"domain_scores_gemma":[0.99878436,0.00023443151,0.00011253483,0.00053519907,0.00017610416,0.0001573524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054008525,0.0001639708,0.00013857338,0.00060850085,0.0003567507,0.00012835293,0.0004078307,0.00007693358,0.000103338854],"category_scores_gemma":[0.00012437573,0.00016278322,0.00008000536,0.0021402745,0.000026649694,0.0014316572,0.000019268491,0.00018730137,0.00017681319],"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.0000065916747,0.00030946065,0.00031404677,0.000016489012,0.000036325393,0.0000020931805,0.000684463,0.013637463,0.00023957246,0.0049863374,0.00020336642,0.9795638],"study_design_scores_gemma":[0.0043207426,0.0018461721,0.3097626,0.00018549916,0.00024073603,0.00085510465,0.0012660926,0.33853137,0.24681725,0.043403096,0.04878887,0.0039824364],"about_ca_topic_score_codex":0.00004406297,"about_ca_topic_score_gemma":0.000006519771,"teacher_disagreement_score":0.97558135,"about_ca_system_score_codex":0.00009385661,"about_ca_system_score_gemma":0.0000820666,"threshold_uncertainty_score":0.66381073},"labels":[],"label_agreement":null},{"id":"W2124402683","doi":"10.1145/2229163.2229172","title":"Scalably scheduling processes with arbitrary speedup curves","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Speedup; Scheduling (production processes); Computer science; Parallel computing; Algorithm; Mathematics; Mathematical optimization","score_opus":0.03193889738509934,"score_gpt":0.2722814381290204,"score_spread":0.24034254074392106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124402683","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.000547256,0.00065165514,0.99301654,0.0034200044,0.00023840881,0.0002596128,0.0000061108335,0.00036016907,0.0015002472],"genre_scores_gemma":[0.12685293,0.0009926329,0.8694719,0.0016952883,0.00008897529,0.000076767996,0.0000054654915,0.000027499911,0.00078851124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985645,0.00005382113,0.00018644502,0.000306451,0.00043565859,0.00045316995],"domain_scores_gemma":[0.9987359,0.00016426865,0.00005163692,0.00062855246,0.00016857474,0.00025103646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002500429,0.00017618896,0.00014923136,0.00016501108,0.00027635696,0.00013180064,0.0007389693,0.00005917541,0.00013222403],"category_scores_gemma":[0.00004940868,0.00014220456,0.00004514128,0.0010389474,0.00006908988,0.0015707728,0.0000145312915,0.00029657976,0.00015711138],"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.00011506997,0.0057571945,0.002023934,0.002197348,0.0005560522,0.00004939233,0.0064930078,0.069265306,0.00043821323,0.008478162,0.0010539482,0.9035724],"study_design_scores_gemma":[0.017248878,0.0073086666,0.017575229,0.011117856,0.000655138,0.0023116316,0.00399614,0.7216121,0.12164743,0.016433977,0.06826883,0.011824118],"about_ca_topic_score_codex":0.000014465931,"about_ca_topic_score_gemma":0.0000054882357,"teacher_disagreement_score":0.89174825,"about_ca_system_score_codex":0.000030805644,"about_ca_system_score_gemma":0.00020709424,"threshold_uncertainty_score":0.57989335},"labels":[],"label_agreement":null},{"id":"W2125938788","doi":"10.1145/1978782.1978783","title":"Minimizing movement in mobile facility location problems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Facility location problem; Approximation algorithm; Computer science; 1-center problem; Simple (philosophy); Node (physics); Mathematical optimization; Mathematics; Algorithm; Physics","score_opus":0.055222972621400176,"score_gpt":0.23925645412877028,"score_spread":0.1840334815073701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125938788","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.21510366,0.00026704848,0.749302,0.0020804477,0.0030404555,0.004129795,0.000042912303,0.000982694,0.025050946],"genre_scores_gemma":[0.99439865,0.00005936038,0.0028579053,0.0012372683,0.00006493914,0.0006229401,0.000033301243,0.000017143495,0.00070850615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998545,0.000015451358,0.00043784,0.00041795734,0.00028112202,0.00030262055],"domain_scores_gemma":[0.99920046,0.000011998023,0.000056714485,0.0005853487,0.00012566695,0.000019783018],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003970779,0.00020092759,0.00016414387,0.0003996012,0.00016463918,0.0000601074,0.00034171762,0.00006800999,0.0018816793],"category_scores_gemma":[0.000025946138,0.0002070155,0.00007756897,0.00083437574,0.00004462338,0.0007562928,0.000019815989,0.00017146912,0.0011297415],"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.00010766693,0.0029821524,0.0025411686,0.0006061205,0.00009922151,0.000007198342,0.0020592557,0.063004896,0.00017172431,0.0014360844,0.00047317173,0.92651135],"study_design_scores_gemma":[0.01123228,0.00068488216,0.23590411,0.0007281662,0.00052949006,0.000003739197,0.022829311,0.3760364,0.0059395055,0.041311283,0.29940182,0.0053990013],"about_ca_topic_score_codex":0.004868009,"about_ca_topic_score_gemma":0.0021152694,"teacher_disagreement_score":0.92111236,"about_ca_system_score_codex":0.0000954866,"about_ca_system_score_gemma":0.000016008304,"threshold_uncertainty_score":0.999648},"labels":[],"label_agreement":null},{"id":"W2126874118","doi":"10.1145/2532645","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"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 Alberta; University of Waterloo","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Bounded function; Approximation algorithm; Bottleneck; Multiplicative function; Combinatorics; Logarithm; Time complexity; Discrete mathematics; Linear programming; Maximum flow problem; Mathematical optimization; Computer science","score_opus":0.038118541435952544,"score_gpt":0.2740565768001746,"score_spread":0.23593803536422203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126874118","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.00029296055,0.000020653213,0.9944653,0.002364957,0.0011542009,0.00059873157,0.000058250833,0.0004963149,0.00054865633],"genre_scores_gemma":[0.060726,0.000033897995,0.9368367,0.0011329864,0.00018024167,0.0003884232,0.000029221605,0.000037226826,0.00063527544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787974,0.00009525418,0.00036858328,0.00074305286,0.00041443514,0.00049894745],"domain_scores_gemma":[0.99753755,0.0005880643,0.000100824676,0.0014609727,0.00015089626,0.0001616843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005366337,0.00030948827,0.00029965694,0.00044463162,0.00062477565,0.0002062041,0.001317749,0.00015037411,0.000039134604],"category_scores_gemma":[0.00007444815,0.00030021308,0.00028689954,0.0008305187,0.000089372,0.00044758403,0.000021776652,0.00035762845,0.00009475736],"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.000032284686,0.000464935,0.0000010726762,0.000033446555,0.000047126392,0.0000013296149,0.00020167138,0.015294774,0.00007275412,0.0444834,0.00019209094,0.9391751],"study_design_scores_gemma":[0.0011083621,0.00092857686,0.00004705124,0.000046155146,0.00002176768,0.000013468405,0.000015887865,0.81824183,0.004296815,0.16589004,0.009052031,0.00033803296],"about_ca_topic_score_codex":0.000028672424,"about_ca_topic_score_gemma":0.000016237775,"teacher_disagreement_score":0.93883705,"about_ca_system_score_codex":0.00007179908,"about_ca_system_score_gemma":0.00004409605,"threshold_uncertainty_score":0.999945},"labels":[],"label_agreement":null},{"id":"W2127816126","doi":"10.1145/2907052","title":"Better Balance by Being Biased","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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; University of Toronto","funders":"","keywords":"Approximation algorithm; Conjecture; Combinatorics; Mathematics; Constraint (computer-aided design); Discrete mathematics","score_opus":0.01799228803662961,"score_gpt":0.24238463663410217,"score_spread":0.22439234859747256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127816126","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.0021582528,0.00004000579,0.98431253,0.011514286,0.0008173372,0.00012915125,0.00005459107,0.00042604876,0.0005478132],"genre_scores_gemma":[0.47342354,0.00016600931,0.51989007,0.0037051165,0.00019796891,0.00011085324,0.0000046297387,0.00004522051,0.0024565791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982489,0.000069607304,0.00025932645,0.0005898609,0.00038445208,0.00044785696],"domain_scores_gemma":[0.99804276,0.00038498078,0.000058686983,0.0012962121,0.000060066923,0.0001572705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018257715,0.0002281778,0.00019380664,0.00017676897,0.00033820927,0.00012023664,0.0015136638,0.00009243059,0.00021166063],"category_scores_gemma":[0.000025501895,0.00017200751,0.00015859627,0.00053980836,0.0001162157,0.0006240949,0.000029101422,0.00021314766,0.00030330534],"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.0000046294267,0.0001432442,0.000043480344,0.0000035939051,0.000033303993,0.000010907232,0.000092620474,0.000008340203,0.0023424947,0.0013026639,0.001398683,0.99461603],"study_design_scores_gemma":[0.008835967,0.001539794,0.00520379,0.00067304785,0.00010292862,0.00024800896,0.0000817307,0.0762827,0.2896279,0.3477734,0.2656777,0.0039530066],"about_ca_topic_score_codex":0.000024645748,"about_ca_topic_score_gemma":0.000004222102,"teacher_disagreement_score":0.99066305,"about_ca_system_score_codex":0.000061400264,"about_ca_system_score_gemma":0.000030693795,"threshold_uncertainty_score":0.70142627},"labels":[],"label_agreement":null},{"id":"W2128634904","doi":"10.1145/2629656","title":"Gathering Despite Mischief","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":74,"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":"Israeli Centers for Research Excellence; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Byzantine architecture; Computer science; Node (physics); Upper and lower bounds; Matching (statistics); Combinatorics; Theoretical computer science; Mathematics; Discrete mathematics; Physics; Geography","score_opus":0.020241239274524116,"score_gpt":0.2543549482875596,"score_spread":0.2341137090130355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128634904","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.00029683945,0.000011408473,0.99443024,0.0020132072,0.00031223978,0.00011200975,0.0000016152546,0.0003238785,0.0024985706],"genre_scores_gemma":[0.16460148,0.000049484355,0.8324115,0.0010285702,0.000056579564,0.000041339143,0.000001306703,0.00002051014,0.0017892049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989702,0.00007537731,0.00015448518,0.00030286596,0.00024224007,0.00025483177],"domain_scores_gemma":[0.99888,0.000111178,0.00003002796,0.0007868238,0.000056036304,0.00013588865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025493177,0.00011644645,0.00010317841,0.00013545083,0.0002417188,0.00014946314,0.0008152099,0.000052642594,0.0001190057],"category_scores_gemma":[0.000027347422,0.00010928328,0.000071665025,0.0003694365,0.00002988458,0.00033347623,0.000014256884,0.0001970868,0.00029138505],"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.000002657425,0.00011121354,0.0000050010235,0.0000063533203,0.000016438738,0.0000018907432,0.0004421088,0.025250385,0.00026471532,0.003835891,0.000050014987,0.9700133],"study_design_scores_gemma":[0.0006922196,0.0002638189,0.00035305216,0.000027250293,0.0000063671764,0.000018084178,0.000028166492,0.96009463,0.0033051437,0.0061729793,0.028727008,0.0003112889],"about_ca_topic_score_codex":0.0000139678,"about_ca_topic_score_gemma":0.000006308415,"teacher_disagreement_score":0.96970206,"about_ca_system_score_codex":0.000024736653,"about_ca_system_score_gemma":0.000023580367,"threshold_uncertainty_score":0.4456443},"labels":[],"label_agreement":null},{"id":"W2129029222","doi":"10.1145/2483699.2483702","title":"Persistent Predecessor Search and Orthogonal Point Location on the Word RAM","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":55,"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":"Point location; Data structure; Combinatorics; Mathematics; Binary search tree; Linear space; Binary logarithm; Sequence (biology); Space (punctuation); Amortized analysis; Recursion (computer science); Set (abstract data type); Subdivision; Computational geometry; Discrete mathematics; Point (geometry); Algorithm; Binary tree; Computer science; Geometry","score_opus":0.029189455842332738,"score_gpt":0.254282221392127,"score_spread":0.22509276554979424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129029222","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.023859562,0.00010399556,0.9603679,0.014400224,0.0003491744,0.00054043945,0.00001557479,0.00014020642,0.00022289359],"genre_scores_gemma":[0.9230483,0.00013887494,0.074462205,0.0011692686,0.00009471937,0.00023349104,0.000009564313,0.000021107118,0.00082247244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841,0.000117014686,0.00020586872,0.0004872182,0.000479023,0.00030087034],"domain_scores_gemma":[0.99825585,0.0003034561,0.000040094084,0.0010985171,0.00015140953,0.00015065333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028554015,0.0001847898,0.00012985514,0.00012253468,0.0005714261,0.00037227935,0.00091923674,0.00007608056,0.00014496758],"category_scores_gemma":[0.000025181263,0.00012181123,0.00008615464,0.00039620526,0.000094489245,0.0006403998,0.00005803524,0.00036118977,0.0002045202],"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.0000122358815,0.0002350459,0.000008682644,0.00000963615,0.000043711643,0.000002536109,0.00057785626,0.0034248924,0.00011473371,0.0013898878,0.0006010889,0.9935797],"study_design_scores_gemma":[0.0008227556,0.0006870441,0.010141385,0.00014066738,0.000028607672,0.00006893627,0.0007288464,0.9780358,0.0023920794,0.0035759083,0.002900634,0.00047735553],"about_ca_topic_score_codex":0.00016475495,"about_ca_topic_score_gemma":0.0000095386185,"teacher_disagreement_score":0.9931023,"about_ca_system_score_codex":0.000052454317,"about_ca_system_score_gemma":0.000053623513,"threshold_uncertainty_score":0.4967318},"labels":[],"label_agreement":null},{"id":"W2141156487","doi":"10.1145/2650183","title":"Approximating Rooted Steiner Networks","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Generalization; Undirected graph; Linear programming relaxation; Approximation algorithm; Discrete mathematics; Upper and lower bounds; Linear programming; Graph; Mathematical optimization","score_opus":0.019291360365911194,"score_gpt":0.2397969814353036,"score_spread":0.2205056210693924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141156487","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.0003890121,0.000039858314,0.99524754,0.0011612892,0.0010103454,0.00016943665,0.0000038685885,0.000615604,0.0013630178],"genre_scores_gemma":[0.2867214,0.000017675951,0.7117873,0.0007607356,0.00021818004,0.000056126384,0.00000413823,0.000026742771,0.0004077293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811053,0.00013121577,0.00036010664,0.0005640332,0.00036891262,0.00046518916],"domain_scores_gemma":[0.99784184,0.00035674023,0.00009557614,0.0014618973,0.00008271754,0.00016120606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045692426,0.00024951086,0.00025064894,0.0002118492,0.0005127229,0.00021830783,0.0015394023,0.00012038591,0.000063280255],"category_scores_gemma":[0.000049591665,0.00023858214,0.00017623608,0.0008808824,0.00008091196,0.00042513345,0.000042030395,0.0004859903,0.00008207116],"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.0000034577392,0.00013934392,0.000005966927,0.000006618673,0.000030506022,0.0000032782516,0.00013655375,0.019660125,0.0000270413,0.007915587,0.000076608005,0.97199494],"study_design_scores_gemma":[0.00047879294,0.000168775,0.00033165576,0.00003248665,0.000012435353,0.000026858199,0.000020515512,0.97875667,0.0005755624,0.014729457,0.0045433156,0.00032350156],"about_ca_topic_score_codex":0.000039839426,"about_ca_topic_score_gemma":0.000012939765,"teacher_disagreement_score":0.9716714,"about_ca_system_score_codex":0.000037717477,"about_ca_system_score_gemma":0.000022514274,"threshold_uncertainty_score":0.9729097},"labels":[],"label_agreement":null},{"id":"W2141565952","doi":"10.1145/2229163.2229173","title":"Entropy, triangulation, and point location in planar subdivisions","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Computing and Communication Foundations; Office of International Science and Engineering","keywords":"Point location; Subdivision; Triangulation; Data structure; Point (geometry); Upper and lower bounds; Preprocessor; Distribution (mathematics); Computational geometry","score_opus":0.02101595205208065,"score_gpt":0.26423632378495143,"score_spread":0.24322037173287078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141565952","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.018501967,0.00020056029,0.9782203,0.0023525048,0.0004252461,0.0001717306,0.000004219169,0.0000682203,0.000055239325],"genre_scores_gemma":[0.8838943,0.00003580345,0.11563149,0.00017590131,0.00007671224,0.000027800146,0.000011054042,0.0000055163027,0.00014137212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991101,0.0000713029,0.0002083061,0.00021425092,0.0001981236,0.00019789391],"domain_scores_gemma":[0.9993056,0.00017803149,0.000042421238,0.0003074082,0.00006023773,0.000106277024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030574403,0.00010141307,0.00009559184,0.0003162771,0.00015347326,0.00006102435,0.00017444551,0.000053716103,0.000026402298],"category_scores_gemma":[0.000043546497,0.00010181589,0.000028986511,0.00071966153,0.000018545255,0.0007537555,0.000007177843,0.00011756072,0.0000522526],"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.000018319366,0.000475182,0.0005223069,0.00001118253,0.000022387827,0.0000023983816,0.0015808812,0.017007671,0.0006553419,0.032287326,0.00018330695,0.9472337],"study_design_scores_gemma":[0.0041904016,0.0005896067,0.3110359,0.000096077354,0.00005073568,0.00016402394,0.00030714777,0.5983257,0.01115026,0.06437156,0.008688271,0.001030256],"about_ca_topic_score_codex":0.00002830492,"about_ca_topic_score_gemma":0.000016451324,"teacher_disagreement_score":0.9462034,"about_ca_system_score_codex":0.00005668358,"about_ca_system_score_gemma":0.00003460837,"threshold_uncertainty_score":0.41519314},"labels":[],"label_agreement":null},{"id":"W2144241285","doi":"10.1145/2831235","title":"The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"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; National Science Foundation","keywords":"Combinatorics; Mathematics; Planar graph; Steiner tree problem; Discrete mathematics; Cograph; Vertex (graph theory); Disjoint sets; Time complexity; Graph; 1-planar graph; Chordal graph","score_opus":0.0288699914690636,"score_gpt":0.24982395916565947,"score_spread":0.22095396769659587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144241285","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.0004860437,0.00010221172,0.9936659,0.002588199,0.0018467671,0.0005030452,0.000006046428,0.00021523086,0.00058657647],"genre_scores_gemma":[0.9193829,0.00021498838,0.078189306,0.00026938104,0.00023133217,0.00035721515,6.1599474e-7,0.000034025812,0.0013202246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746567,0.0006242327,0.00042673456,0.0005479702,0.000309993,0.00062540866],"domain_scores_gemma":[0.9963285,0.0022284822,0.0001119909,0.0011205596,0.00009854777,0.000111960515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017669938,0.00023967942,0.00025396055,0.00014314865,0.00065664767,0.00019743832,0.0012201599,0.00011263319,0.000022971946],"category_scores_gemma":[0.00003518616,0.00014169194,0.00013947212,0.00084990624,0.00009034578,0.00046373374,0.000016172566,0.000294972,0.00009685601],"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.00011161629,0.00026426816,0.00024193009,0.000009398846,0.00014035485,0.00003506561,0.00043634,0.037093945,0.00021594798,0.04899409,0.0026260326,0.909831],"study_design_scores_gemma":[0.010146974,0.0023685792,0.0044083446,0.0011757734,0.00006692043,0.00047853045,0.00044162126,0.42537364,0.005667954,0.48383987,0.063113555,0.0029182236],"about_ca_topic_score_codex":0.00027198996,"about_ca_topic_score_gemma":0.0007533091,"teacher_disagreement_score":0.91889685,"about_ca_system_score_codex":0.00013436157,"about_ca_system_score_gemma":0.0000738342,"threshold_uncertainty_score":0.57780296},"labels":[],"label_agreement":null},{"id":"W2147508044","doi":"10.1145/1824777.1824781","title":"Finding one tight cycle","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"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":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Contractible space; Homotopy; Genus; Surface (topology); Class (philosophy); Binary logarithm; Boundary (topology); Simple (philosophy); Set (abstract data type); Discrete mathematics; Pure mathematics; Computer science; Geometry; Botany; Mathematical analysis","score_opus":0.022929474871582388,"score_gpt":0.2668963827719354,"score_spread":0.243966907900353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147508044","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.016762603,0.000010898714,0.9778851,0.0027756281,0.0014239068,0.00009626784,0.0000053103186,0.00019133788,0.0008489184],"genre_scores_gemma":[0.62547827,0.000007161924,0.37334955,0.0002787894,0.00014122101,0.000020170362,0.0000041622307,0.000007158713,0.00071350625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990739,0.000023587805,0.00015236327,0.0003000364,0.00026692022,0.00018316932],"domain_scores_gemma":[0.9990955,0.00013589377,0.000036888374,0.0005673295,0.00006720417,0.00009715696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016410388,0.000103970335,0.00008883388,0.00019895905,0.00030868815,0.00012243612,0.0005086132,0.00007032509,0.00020524146],"category_scores_gemma":[0.000024249322,0.00010823382,0.00006707173,0.0005355291,0.000023859136,0.00040660857,0.00001173326,0.00030601933,0.0002726259],"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.0000034282602,0.00023038195,0.0000045290412,0.000003578719,0.000023685318,0.0000041743856,0.00020161043,0.0072946814,0.007883548,0.011248047,0.0000972222,0.9730051],"study_design_scores_gemma":[0.0015930617,0.000391718,0.00856228,0.000032539727,0.000041192216,0.0001263944,0.00003180509,0.691445,0.17237437,0.09352349,0.030941103,0.0009370425],"about_ca_topic_score_codex":0.000012505632,"about_ca_topic_score_gemma":0.000020678022,"teacher_disagreement_score":0.9720681,"about_ca_system_score_codex":0.000019220955,"about_ca_system_score_gemma":0.00005033058,"threshold_uncertainty_score":0.4413647},"labels":[],"label_agreement":null},{"id":"W2148015778","doi":"10.1145/1824777.1824782","title":"On the bichromatic <i>k</i> -set problem","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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; Conjecture; Upper and lower bounds; Mathematics; Integer (computer science); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.018571819834400153,"score_gpt":0.25108339719550715,"score_spread":0.232511577361107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148015778","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.0110831885,0.0000066694797,0.9754172,0.011081015,0.00094344007,0.00023829156,0.000007752772,0.00016116879,0.0010612635],"genre_scores_gemma":[0.7889512,0.0000069747375,0.20770109,0.0022173559,0.00011424109,0.000107670494,0.0000050548847,0.000011567576,0.000884832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989852,0.000054482258,0.00017044683,0.00028080394,0.00033259456,0.00017652051],"domain_scores_gemma":[0.9984815,0.0005334847,0.000047346006,0.000804153,0.00006424875,0.00006925412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002970773,0.00012668816,0.0000846756,0.00012467359,0.00039653073,0.00014895816,0.0007353122,0.00005752192,0.00017269819],"category_scores_gemma":[0.000042307365,0.000088663204,0.00007417716,0.00059062126,0.00003972512,0.00021534495,0.000011029132,0.0003689081,0.00037889535],"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.000008901138,0.00040374172,0.0000017214069,0.000011038877,0.000056510235,0.00000716781,0.0007534521,0.016571414,0.004635874,0.15232508,0.0031175064,0.8221076],"study_design_scores_gemma":[0.0010840963,0.000721592,0.0009560445,0.00005758797,0.00003651875,0.00014273364,0.000063134685,0.5053565,0.041256655,0.42686674,0.0227479,0.0007104886],"about_ca_topic_score_codex":0.000009638248,"about_ca_topic_score_gemma":0.000015610225,"teacher_disagreement_score":0.8213971,"about_ca_system_score_codex":0.00001632661,"about_ca_system_score_gemma":0.0000606043,"threshold_uncertainty_score":0.48700595},"labels":[],"label_agreement":null},{"id":"W2149565746","doi":"10.1145/1824777.1824786","title":"On distributing symmetric streaming computations","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computation; Sublinear function; Communication complexity; Theoretical computer science; Computational complexity theory; Class (philosophy); Streaming algorithm; Algorithm; Distributed computing; Mathematics; Upper and lower bounds; Discrete mathematics","score_opus":0.020217592333712276,"score_gpt":0.2677943535910513,"score_spread":0.24757676125733902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149565746","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.013021097,0.000011163203,0.98181266,0.0013026856,0.0019418383,0.00018354382,0.00006513024,0.0005058553,0.0011560129],"genre_scores_gemma":[0.7140565,0.000006974004,0.28542334,0.00026057317,0.00008961293,0.000028443581,0.000010448225,0.000016157588,0.000107941116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812734,0.000057000685,0.00031362858,0.0005903529,0.00046270224,0.00044895476],"domain_scores_gemma":[0.9973236,0.0010369299,0.00009064242,0.0012438054,0.00011281915,0.00019223618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026762582,0.00025275166,0.00020583326,0.0005424386,0.00089312263,0.00027455186,0.0014276059,0.00011770958,0.0000899077],"category_scores_gemma":[0.00014049342,0.0002533412,0.0001873156,0.0018386372,0.00010425452,0.00037214713,0.000036721358,0.00092913315,0.00017521594],"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.000003494106,0.00041108017,0.0000117466,0.000006049146,0.00003541625,0.000015465559,0.00016073484,0.0021528173,0.00016053762,0.07713312,0.00005951312,0.91985005],"study_design_scores_gemma":[0.0017430627,0.00076905853,0.0074069323,0.000100189296,0.000055367207,0.00016820451,0.00015935213,0.7894169,0.009301541,0.18506187,0.0045664986,0.0012510272],"about_ca_topic_score_codex":0.00006379855,"about_ca_topic_score_gemma":0.000034538858,"teacher_disagreement_score":0.918599,"about_ca_system_score_codex":0.000050380935,"about_ca_system_score_gemma":0.000059778235,"threshold_uncertainty_score":0.9999919},"labels":[],"label_agreement":null},{"id":"W2152623377","doi":"10.1145/1921659.1921663","title":"Tree exploration with logarithmic memory","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council; Royal Society","keywords":"Tree traversal; Node (physics); Traverse; Binary logarithm; Computer science; Tree (set theory); Logarithm; Graph; Upper and lower bounds; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.0695535220691234,"score_gpt":0.2535367779472618,"score_spread":0.1839832558781384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152623377","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.00012961577,0.000009739053,0.99053663,0.0010280678,0.00021319228,0.00025645792,0.0000030044905,0.00034519852,0.007478113],"genre_scores_gemma":[0.10068177,0.00006379067,0.8968768,0.00044451907,0.000027712691,0.00013216071,0.0000038923695,0.0000217825,0.0017475857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884325,0.000067443485,0.00017312191,0.000362276,0.00030501647,0.00024887978],"domain_scores_gemma":[0.9988551,0.00004321708,0.000047466845,0.00080759765,0.000117622636,0.00012896217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015780788,0.00014729271,0.00011743196,0.00021766023,0.00022339313,0.0000857399,0.0007362236,0.000064112064,0.00026666652],"category_scores_gemma":[0.000007790118,0.00012246087,0.000050506762,0.0005401477,0.000062620056,0.0011352884,0.000011150163,0.00020670582,0.0002222672],"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.000030039937,0.00037379473,0.0000052012806,0.0000069683097,0.00004248137,0.000022204575,0.0032197027,0.0029895166,0.00006859488,0.0017133099,0.00009367929,0.9914345],"study_design_scores_gemma":[0.0062688068,0.004485484,0.0021328568,0.00014193005,0.00008568359,0.0002220401,0.0020264976,0.9080893,0.04564631,0.025405113,0.0035621577,0.001933816],"about_ca_topic_score_codex":0.000055689245,"about_ca_topic_score_gemma":0.00005985586,"teacher_disagreement_score":0.9895007,"about_ca_system_score_codex":0.00003134851,"about_ca_system_score_gemma":0.000071811635,"threshold_uncertainty_score":0.49938095},"labels":[],"label_agreement":null},{"id":"W2153294698","doi":"10.1145/2344422.2344432","title":"Succinct ordinal trees based on tree covering","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"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; Dalhousie University","funders":"","keywords":"Tree traversal; Unary operation; Tree (set theory); Mathematics; Combinatorics; Sequence (biology); Set (abstract data type); Parenthesis; Representation (politics); Discrete mathematics; Computer science; Theoretical computer science; Algorithm","score_opus":0.0244141420401886,"score_gpt":0.26327157157595255,"score_spread":0.23885742953576394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153294698","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.0013038361,0.00005662837,0.9943241,0.0009601559,0.0012849844,0.00015989543,0.000040008214,0.0003409041,0.0015295036],"genre_scores_gemma":[0.70825565,0.000021738802,0.2902845,0.0006900793,0.00025935285,0.00005223608,0.000012741629,0.00002984609,0.0003938616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809945,0.00008396158,0.00025389594,0.00046843308,0.0005344643,0.0005597893],"domain_scores_gemma":[0.9977894,0.00029056583,0.000071899536,0.0015192494,0.000046854595,0.00028202488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002797802,0.00028183378,0.00022534064,0.00026160706,0.00041668268,0.0001481427,0.0011711227,0.00010762912,0.00021596957],"category_scores_gemma":[0.000024383035,0.00024099991,0.00015787732,0.00049774325,0.000039959472,0.0010440326,0.000034046458,0.00034673713,0.00028722244],"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.000038943486,0.00068340736,0.00013336574,0.000007505318,0.000025098572,0.000012676524,0.00013967926,0.005466309,0.00024245717,0.0005062113,0.00058483286,0.9921595],"study_design_scores_gemma":[0.0025016274,0.0010387714,0.023809107,0.00015866564,0.0000538799,0.00006312293,0.00007151723,0.9041783,0.015696548,0.00066792,0.05070281,0.0010577168],"about_ca_topic_score_codex":0.00009499177,"about_ca_topic_score_gemma":0.0000146841,"teacher_disagreement_score":0.9911018,"about_ca_system_score_codex":0.00010231925,"about_ca_system_score_gemma":0.000054123248,"threshold_uncertainty_score":0.98276913},"labels":[],"label_agreement":null},{"id":"W2154044080","doi":"10.1145/1824777.1824789","title":"Lower-bounded facility location","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Facility location problem; Bounded function; Constant (computer programming); Upper and lower bounds; Approximation algorithm; Mathematics; Function (biology); 1-center problem; Mathematical optimization; Computer science; Combinatorics","score_opus":0.025485742673883142,"score_gpt":0.24730241148240187,"score_spread":0.22181666880851872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154044080","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.22293383,0.000019827628,0.7345542,0.013726231,0.010212915,0.0010975598,0.00004510258,0.0012124382,0.01619793],"genre_scores_gemma":[0.9936111,0.000008275191,0.002556364,0.0016260921,0.0003007759,0.000087458604,0.000047601574,0.000015967906,0.0017463949],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986508,0.000008575887,0.0003070919,0.00040833297,0.00034709214,0.00027810058],"domain_scores_gemma":[0.9987751,0.00002194261,0.000047560137,0.0008934942,0.00023486177,0.000027024442],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033442784,0.00020476083,0.00014242131,0.0002603305,0.0004023312,0.00019236692,0.00043872537,0.00010217833,0.003906367],"category_scores_gemma":[0.00010052644,0.00020631166,0.00010955711,0.0007156612,0.0000877575,0.0008241976,0.000015967613,0.0003546259,0.004884343],"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.00010258396,0.0014366334,0.00030305283,0.00022212346,0.00010652563,0.0000053309345,0.000108809414,0.0054954807,0.0011152294,0.009298085,0.0027599453,0.9790462],"study_design_scores_gemma":[0.0019097101,0.00007561238,0.02519093,0.000031394335,0.00019300097,0.000003935222,0.00053093984,0.07502042,0.0011611527,0.014297248,0.8803299,0.0012557734],"about_ca_topic_score_codex":0.0013323413,"about_ca_topic_score_gemma":0.0019094896,"teacher_disagreement_score":0.9777904,"about_ca_system_score_codex":0.000034407032,"about_ca_system_score_gemma":0.00002413171,"threshold_uncertainty_score":0.9970042},"labels":[],"label_agreement":null},{"id":"W2160685416","doi":"10.1145/1824777.1824788","title":"Fast asynchronous Byzantine agreement and leader election with full information","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Asynchronous communication; Leader election; Quantum Byzantine agreement; Computer science; Byzantine architecture; Adversary; Protocol (science); Constant (computer programming); Computation; Theoretical computer science; Monte Carlo method; Key (lock); Distributed computing; Computer network; Byzantine fault tolerance; Computer security; Mathematics; Algorithm; Fault tolerance; Statistics","score_opus":0.006362793586701465,"score_gpt":0.21462253705399292,"score_spread":0.20825974346729145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160685416","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.012247819,0.000013388018,0.98493606,0.0013385813,0.00051251124,0.00021227318,0.000019195051,0.00013834258,0.0005818452],"genre_scores_gemma":[0.90735203,0.000016719192,0.09212033,0.00021040106,0.00006224782,0.000059169903,0.000011729782,0.0000073359483,0.00016003009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905795,0.000015726415,0.00021160334,0.00023068891,0.00026038263,0.00022362528],"domain_scores_gemma":[0.999178,0.000025590854,0.00008009972,0.00051092595,0.00011300278,0.00009239032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013146647,0.000149493,0.00012663656,0.00011794073,0.00025105287,0.00021567797,0.000307437,0.00007901488,0.000035660436],"category_scores_gemma":[0.0000058323053,0.00012291534,0.00003153078,0.0003396366,0.000047181307,0.0011131361,0.000007448446,0.0003028224,0.00006946213],"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.00001687644,0.00009248512,0.000022660495,0.000013293708,0.000027572358,0.0000024181406,0.00042038914,0.00031558503,0.0009103324,0.00049705786,0.00009529811,0.997586],"study_design_scores_gemma":[0.011446776,0.005571713,0.027748082,0.00032934934,0.00016481504,0.0024678772,0.0015365571,0.6627895,0.056431156,0.001356419,0.227021,0.0031367089],"about_ca_topic_score_codex":0.000085019594,"about_ca_topic_score_gemma":0.00013274423,"teacher_disagreement_score":0.9944493,"about_ca_system_score_codex":0.000017812612,"about_ca_system_score_gemma":0.000040820887,"threshold_uncertainty_score":0.5012342},"labels":[],"label_agreement":null},{"id":"W2160921566","doi":"10.1145/1497290.1497300","title":"Algorithms for distributional and adversarial pipelined filter ordering problems","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Information and Intelligent Systems; National Science Foundation","keywords":"Computer science; Tuple; Filter (signal processing); Algorithm; Context (archaeology); Data stream mining; Set (abstract data type); Mathematics; Data mining; Discrete mathematics","score_opus":0.03906695759045289,"score_gpt":0.27677252201348246,"score_spread":0.23770556442302956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160921566","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.00036906337,0.00009324116,0.99229956,0.00510885,0.0009486832,0.00054115884,0.00020045713,0.00034165697,0.00009734039],"genre_scores_gemma":[0.117250465,0.00009695293,0.88078654,0.00084910047,0.0004195649,0.00016035407,0.00005951595,0.00002460831,0.00035289157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794453,0.000043296728,0.00038878113,0.0007261795,0.00037516464,0.00052202574],"domain_scores_gemma":[0.9985237,0.00028194583,0.000085691325,0.000749845,0.0001584335,0.00020038325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029978782,0.00031195238,0.0002859304,0.00021055751,0.0006613604,0.0002432298,0.00089900894,0.00014033636,0.00004210932],"category_scores_gemma":[0.00005152037,0.0003093722,0.00020094028,0.0005175095,0.0001064762,0.00060869165,0.000030203877,0.00031788734,0.000013842345],"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.000039685896,0.0003677368,0.000003913122,0.000017740047,0.00005655806,0.0000064610404,0.0002719978,0.0012466479,0.00026441325,0.008003179,0.0002685877,0.9894531],"study_design_scores_gemma":[0.0048608608,0.001662445,0.0015148858,0.00011165419,0.00007723214,0.00016304148,0.00007384455,0.78104115,0.004053051,0.17272413,0.032530196,0.0011875363],"about_ca_topic_score_codex":0.000029771876,"about_ca_topic_score_gemma":0.000009121395,"teacher_disagreement_score":0.9882655,"about_ca_system_score_codex":0.00006725771,"about_ca_system_score_gemma":0.00007225067,"threshold_uncertainty_score":0.99993587},"labels":[],"label_agreement":null},{"id":"W2170132163","doi":"10.1145/1103963.1103969","title":"An <i>O</i> ( <i>VE</i> ) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","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":"University of Waterloo","funders":"","keywords":"Mathematics; Matching (statistics); Algorithm; Partition (number theory); Combinatorics; Blossom algorithm; Factor-critical graph; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01833050890336663,"score_gpt":0.3081120926644815,"score_spread":0.28978158376111485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170132163","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.0022868267,0.000069244445,0.9952482,0.000826163,0.0002673193,0.00057063554,0.0003011201,0.00029575816,0.00013472598],"genre_scores_gemma":[0.10812153,0.000064428124,0.8909701,0.00039548866,0.000063178624,0.00019029145,0.000016671258,0.000039640516,0.00013864033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977359,0.00012874357,0.0004425635,0.0006478977,0.0004948162,0.0005500855],"domain_scores_gemma":[0.9972052,0.00047358542,0.00011871083,0.0016950318,0.00024946622,0.00025798925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042863013,0.00026792617,0.00030932497,0.00044495362,0.00048001512,0.00010343759,0.0019367374,0.00012066677,0.00004237272],"category_scores_gemma":[0.0000127479225,0.0002766655,0.0003015319,0.00092310115,0.00015731437,0.0012881343,0.000024125646,0.00033614633,0.000039739458],"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.0000340953,0.0008474381,0.0000018940315,0.000012595441,0.000072341165,0.000002930264,0.0005380173,0.007986192,0.006472526,0.0096231345,0.000053918106,0.9743549],"study_design_scores_gemma":[0.0038242359,0.0022237943,0.00016390861,0.00008431721,0.00007710045,0.000114507355,0.00035009725,0.39945287,0.22935098,0.35824528,0.005039954,0.0010729323],"about_ca_topic_score_codex":0.000024057243,"about_ca_topic_score_gemma":0.000016104268,"teacher_disagreement_score":0.973282,"about_ca_system_score_codex":0.00006746763,"about_ca_system_score_gemma":0.00008455679,"threshold_uncertainty_score":0.9999685},"labels":[],"label_agreement":null},{"id":"W2170344325","doi":"10.1145/1273340.1273343","title":"Multicommodity demand flow in a tree and packing integer programs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"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":"Linear programming relaxation; Mathematics; Cardinality (data modeling); Multi-commodity flow problem; Integer programming; Knapsack problem; Mathematical optimization; Steiner tree problem; Tree (set theory); Combinatorics; Approximation algorithm; Integer (computer science); Flow network; Discrete mathematics; Computer science","score_opus":0.034100251992916296,"score_gpt":0.3108631411316437,"score_spread":0.27676288913872743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170344325","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.019872319,0.000079402955,0.97876096,0.0005390912,0.00015319351,0.0003041287,0.0000023920877,0.00014264307,0.00014587921],"genre_scores_gemma":[0.6837619,0.000028056003,0.3160321,0.00007264566,0.000014914656,0.00003194069,8.6911547e-7,0.000011643583,0.00004595334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844444,0.0000940029,0.00023761985,0.00044804136,0.00029647764,0.00047944835],"domain_scores_gemma":[0.9986227,0.00040341998,0.00003339317,0.00072234013,0.00005616775,0.00016195567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008299634,0.00016301761,0.00017000835,0.00037417957,0.00017414437,0.0001030519,0.0006771561,0.000087983426,0.0000087634935],"category_scores_gemma":[0.000051317944,0.00015111938,0.00006019714,0.000794397,0.00014359258,0.00049963105,0.000034865974,0.00049092434,0.00001483699],"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.000026486323,0.00022168728,0.00048074976,0.0000069211783,0.000011867868,0.00004143224,0.00067260105,0.00037654626,0.00013427089,0.0006120903,0.000001339997,0.997414],"study_design_scores_gemma":[0.0052895998,0.0010766085,0.030326093,0.00027128292,0.000022608345,0.00022623,0.0014096847,0.82627404,0.017625475,0.114531256,0.0017130721,0.0012340682],"about_ca_topic_score_codex":0.00004639013,"about_ca_topic_score_gemma":0.00060771307,"teacher_disagreement_score":0.99617994,"about_ca_system_score_codex":0.000074057745,"about_ca_system_score_gemma":0.000022708058,"threshold_uncertainty_score":0.61624694},"labels":[],"label_agreement":null},{"id":"W2294341534","doi":"10.1145/2151171.2151177","title":"Elimination graphs","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Discrete mathematics; Block graph; Indifference graph; Intersection graph; Pathwidth; Independent set; Line graph; Graph; 1-planar graph","score_opus":0.033869786607482716,"score_gpt":0.31175226098866454,"score_spread":0.27788247438118185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294341534","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.0016275978,0.00009687427,0.99516886,0.0011695556,0.00060880836,0.00015211292,0.000004879099,0.0002677636,0.00090357126],"genre_scores_gemma":[0.7536101,0.000054493015,0.24551016,0.00020004723,0.000043550175,0.00006476838,0.0000015001739,0.000014677248,0.00050070754],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986521,0.000092905735,0.00014748205,0.00025880753,0.00039114367,0.00045757854],"domain_scores_gemma":[0.9985064,0.00022155172,0.000033981574,0.0009716928,0.00007844778,0.00018791576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888001,0.00013000883,0.00010026184,0.00033541277,0.00027006722,0.000055950335,0.00094844424,0.000063608415,0.000082216575],"category_scores_gemma":[0.000037333524,0.00012411729,0.00009563848,0.0008747693,0.000066933084,0.0011728115,0.00001747289,0.00026694185,0.00033948003],"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.0000074006216,0.00025589974,0.000030177878,0.0000042609827,0.000020508789,0.0000021762564,0.00044001077,0.00019154092,0.0004625226,0.07194809,0.000044088476,0.9265933],"study_design_scores_gemma":[0.0031069834,0.0012665658,0.027832227,0.00008292782,0.00007088793,0.00028467432,0.0006555256,0.05089224,0.17529762,0.70672154,0.03164072,0.0021480913],"about_ca_topic_score_codex":0.0000058731125,"about_ca_topic_score_gemma":0.0000014969053,"teacher_disagreement_score":0.9244452,"about_ca_system_score_codex":0.0000525696,"about_ca_system_score_gemma":0.000019584448,"threshold_uncertainty_score":0.50613564},"labels":[],"label_agreement":null},{"id":"W2295356180","doi":"10.1145/2830567","title":"Adaptive and Approximate Orthogonal Range Counting","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"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; Center for Massive Data Algorithmics; Danmarks Grundforskningsfond","keywords":"Range (aeronautics); Mathematics; Combinatorics; Computer science; Discrete mathematics; Algorithm; Statistics; Artificial intelligence","score_opus":0.02557180926512948,"score_gpt":0.23998807247528925,"score_spread":0.21441626321015977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295356180","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.00095465546,0.000048099755,0.9955642,0.0019924673,0.00037428277,0.00018085678,0.000054582248,0.0002645979,0.0005662595],"genre_scores_gemma":[0.2991363,0.00042020078,0.696058,0.0008559849,0.00019259406,0.0001291129,0.0000054803604,0.000043842054,0.0031584643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860334,0.00004048217,0.00019210462,0.0005196199,0.0003126159,0.00033181653],"domain_scores_gemma":[0.9988912,0.00016984699,0.000061973966,0.0007194054,0.000052431762,0.000105178646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028274665,0.000187063,0.00015615424,0.00016747872,0.00025521108,0.00016662675,0.00078693574,0.000052322994,0.00006278072],"category_scores_gemma":[0.000015984539,0.00013345909,0.00006168097,0.000303563,0.000089832356,0.0012576517,0.000056398225,0.000118566124,0.00011596074],"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.000008820534,0.0000653901,0.00002867208,0.000005745794,0.000039871422,0.000014505199,0.00008653558,0.000014617383,0.00006827123,0.003948994,0.000104434,0.9956142],"study_design_scores_gemma":[0.0120554045,0.0017386419,0.013141294,0.0006292575,0.00025397367,0.00026799255,0.00062123133,0.847144,0.005443402,0.05913751,0.055882677,0.003684589],"about_ca_topic_score_codex":0.000013904663,"about_ca_topic_score_gemma":0.000006993845,"teacher_disagreement_score":0.99192953,"about_ca_system_score_codex":0.000032027132,"about_ca_system_score_gemma":0.000020436211,"threshold_uncertainty_score":0.54423034},"labels":[],"label_agreement":null},{"id":"W2463954311","doi":"10.1145/3280823","title":"Deterministic Graph Exploration with Advice","year":2018,"lang":"en","type":"preprint","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Oracle; Advice (programming); Graph; Computer science; Theoretical computer science; Time complexity; Combinatorics; A priori and a posteriori; Node (physics); Discrete mathematics; Mathematics; Algorithm","score_opus":0.04404600970732654,"score_gpt":0.2913510131177562,"score_spread":0.24730500341042966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463954311","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.00007666213,0.000020804859,0.9946108,0.0019655875,0.0009661822,0.0005675322,0.000033461714,0.0007446687,0.0010143222],"genre_scores_gemma":[0.043238174,0.0002683033,0.9539878,0.0006046419,0.00015240593,0.00049054966,0.000046600886,0.00005696418,0.0011546082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765456,0.00014147413,0.00035132992,0.0008868216,0.00059932296,0.0003664774],"domain_scores_gemma":[0.9971314,0.00012441739,0.00016592817,0.0020035172,0.0003729852,0.00020177434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025381873,0.0003570387,0.0002796038,0.0004438204,0.00036168768,0.00047073467,0.0017295361,0.00024515903,0.000109850356],"category_scores_gemma":[0.000022921085,0.0003164621,0.00012573443,0.00061393954,0.00013472945,0.00061385526,0.0000845701,0.0007091679,0.00022457722],"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.00009247544,0.0009552923,0.0000072841754,0.00023783643,0.00033685053,0.00008197261,0.0039476487,0.27996084,0.00002483569,0.0012794902,0.0008235754,0.7122519],"study_design_scores_gemma":[0.001106549,0.0012211187,0.00011446935,0.00036186745,0.00008356968,0.000050873114,0.000104774575,0.9609646,0.0007748778,0.030858802,0.0032871393,0.0010713275],"about_ca_topic_score_codex":0.000045387715,"about_ca_topic_score_gemma":0.000047276157,"teacher_disagreement_score":0.71118057,"about_ca_system_score_codex":0.00008023737,"about_ca_system_score_gemma":0.00027561205,"threshold_uncertainty_score":0.9999288},"labels":[],"label_agreement":null},{"id":"W2513395528","doi":"10.1145/2905368","title":"Data Structures for Path Queries","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"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; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Multiset; Path (computing); Combinatorics; Mathematics; Selection (genetic algorithm); Discrete mathematics; Computer science","score_opus":0.05610397486646216,"score_gpt":0.30398149261818486,"score_spread":0.2478775177517227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513395528","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.00012237205,0.00008262907,0.99412304,0.002611825,0.0010302281,0.0002288209,0.0014879482,0.00025694646,0.000056172525],"genre_scores_gemma":[0.022130849,0.0001197531,0.97658724,0.00031726598,0.00018247477,0.00006634235,0.000045676104,0.000022099715,0.0005282885],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984723,0.000032484175,0.00022575044,0.00067402516,0.0002863865,0.0003090819],"domain_scores_gemma":[0.99632084,0.00034638017,0.000064854125,0.003072193,0.00007980378,0.00011594235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018013948,0.00018511577,0.00016468915,0.000095854855,0.00033496748,0.00013112038,0.002899508,0.000082281964,0.00007211844],"category_scores_gemma":[0.00006673886,0.00011583567,0.00006674135,0.0001775908,0.000065426706,0.0013216673,0.00011224592,0.00009642701,0.000039229264],"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.000012474131,0.000053085605,0.0000025511076,0.0000057118227,0.000022709044,0.0000031219088,0.000044860597,0.00001506588,0.00041148727,0.0038509862,0.0026965362,0.9928814],"study_design_scores_gemma":[0.0035896483,0.0008749908,0.002234583,0.00019504636,0.00006870259,0.00010156955,0.00009995509,0.083555065,0.020803114,0.14164266,0.7455099,0.0013247535],"about_ca_topic_score_codex":0.00002525167,"about_ca_topic_score_gemma":0.000010604401,"teacher_disagreement_score":0.99155664,"about_ca_system_score_codex":0.000030779524,"about_ca_system_score_gemma":0.00006946218,"threshold_uncertainty_score":0.53880554},"labels":[],"label_agreement":null},{"id":"W2556309115","doi":"10.1145/3576900","title":"On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; École Normale Supérieure; Simon Fraser University; Alan Turing Institute; National Science Foundation","keywords":"Upper and lower bounds; Hypercube; Combinatorics; Mathematics; Random walk; Discrete mathematics; Random graph; Coalescence (physics); Graph; Physics; Statistics","score_opus":0.014201466148242768,"score_gpt":0.2595415855637024,"score_spread":0.2453401194154596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556309115","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.0557839,0.000108772285,0.92178446,0.010095302,0.002019608,0.0010116871,0.00023313709,0.0016859694,0.007277187],"genre_scores_gemma":[0.97774893,0.00011483021,0.01277203,0.0023226226,0.00006691449,0.00017292949,0.000020818488,0.000051351406,0.0067295576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976145,0.00009411644,0.00040519118,0.0007404267,0.00061020866,0.0005355519],"domain_scores_gemma":[0.9983001,0.00026076194,0.00009420226,0.0011007398,0.00007859439,0.00016559786],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043014192,0.0002693539,0.00029724892,0.00043829085,0.00029793775,0.00021149621,0.0013313375,0.00013777034,0.00011651345],"category_scores_gemma":[0.000051540414,0.00027023826,0.00014605549,0.0015985322,0.0000672582,0.0004053755,0.000029628505,0.0003991511,0.0037315867],"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.00010759602,0.00119334,0.00019114786,0.00011418634,0.00016872385,0.0007877452,0.013410511,0.016044015,0.0025931252,0.0064470386,0.019533778,0.9394088],"study_design_scores_gemma":[0.005766362,0.0020315354,0.003959815,0.003192503,0.000059082464,0.00033125366,0.0017011488,0.79645807,0.024660379,0.12399901,0.03464962,0.003191223],"about_ca_topic_score_codex":0.00047418458,"about_ca_topic_score_gemma":0.000045906952,"teacher_disagreement_score":0.93621755,"about_ca_system_score_codex":0.00009344468,"about_ca_system_score_gemma":0.00008726741,"threshold_uncertainty_score":0.99997497},"labels":[],"label_agreement":null},{"id":"W2618717009","doi":"10.1145/2344422.2344426","title":"The effectiveness of stackelberg strategies and tolls for network congestion games","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Price of anarchy; Nash equilibrium; Latency (audio); Computer science; Routing (electronic design automation); Mathematical optimization; Fraction (chemistry); Flow network; Mathematics; Mathematical economics; Price of stability; Computer network; Economics","score_opus":0.06770159463362163,"score_gpt":0.3755214159717994,"score_spread":0.30781982133817776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618717009","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.14882858,0.0005096503,0.84849226,0.00044921908,0.0004905565,0.0006454312,0.000058048212,0.000034378983,0.0004918519],"genre_scores_gemma":[0.99406207,0.00006997499,0.0052912817,0.000018756313,0.00007448275,0.00021828395,0.000001908082,0.000008602796,0.00025464033],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986433,0.00037381361,0.00028501678,0.00019350005,0.0002706656,0.00023374878],"domain_scores_gemma":[0.98602766,0.013089204,0.000105486164,0.00053809985,0.00016524602,0.00007430511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988065,0.000104885876,0.00017551806,0.000052722182,0.00046698484,0.0001361996,0.0003473328,0.000060644576,0.000029562661],"category_scores_gemma":[0.0003728335,0.00006603134,0.00008452478,0.00034331775,0.00024183326,0.00039946128,0.000007088428,0.00009792005,0.000017478207],"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.00046726863,0.0002198351,0.00032616543,0.0000229368,0.000089299596,1.0209067e-7,0.0004789812,0.007854429,0.0010333806,0.16280426,0.00016850827,0.8265348],"study_design_scores_gemma":[0.0010157978,0.0003973406,0.07438804,0.00006233516,0.0001100858,0.000013054836,0.0049439175,0.001428712,0.013370911,0.8843587,0.019623669,0.0002874198],"about_ca_topic_score_codex":0.0000091653055,"about_ca_topic_score_gemma":0.000012975606,"teacher_disagreement_score":0.8452335,"about_ca_system_score_codex":0.0000127167905,"about_ca_system_score_gemma":0.000032788485,"threshold_uncertainty_score":0.35917172},"labels":[],"label_agreement":null},{"id":"W2619218210","doi":"10.1145/3039870","title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Leader election; Node (physics); Logarithm; Upper and lower bounds; Computer science; String (physics); Tree (set theory); Binary logarithm; Computer network; Advice (programming); Time complexity; Simple (philosophy); Multiplicative function; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Algorithm","score_opus":0.028810953609554928,"score_gpt":0.2745985513117078,"score_spread":0.24578759770215286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619218210","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.0022512753,0.000015242859,0.9907219,0.0049255905,0.0007955822,0.00045843326,0.000035213747,0.00021853716,0.0005782453],"genre_scores_gemma":[0.6192331,0.00009318751,0.3772035,0.001022681,0.00025146524,0.0004649119,0.00003241953,0.00003719303,0.001661614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865556,0.00003596916,0.00033567587,0.0003292106,0.00026763638,0.00037594498],"domain_scores_gemma":[0.9983211,0.0001498182,0.00014641717,0.0012188664,0.00008089768,0.000082892504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028703158,0.00020238697,0.00022084513,0.00039495993,0.00089251983,0.00047305724,0.0014665471,0.0001333394,0.000038322334],"category_scores_gemma":[0.00006439346,0.00020849063,0.00016395663,0.00027615705,0.000119304364,0.0026028575,0.00001970989,0.00028268842,0.00011114156],"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.000041539173,0.00019949212,0.000011724063,0.000014686026,0.000026459476,0.0000024763335,0.0008070814,0.0009842801,0.00012239261,0.0011729187,0.0002727541,0.9963442],"study_design_scores_gemma":[0.003921564,0.0010975081,0.014898806,0.000096162024,0.00003565012,0.00007241043,0.00015146917,0.90786,0.011434965,0.027118064,0.032401085,0.00091233617],"about_ca_topic_score_codex":0.00013245438,"about_ca_topic_score_gemma":0.00014527542,"teacher_disagreement_score":0.99543184,"about_ca_system_score_codex":0.00008746435,"about_ca_system_score_gemma":0.00006306247,"threshold_uncertainty_score":0.8502001},"labels":[],"label_agreement":null},{"id":"W2621840633","doi":"10.1145/1721837.1721853","title":"Facility location with hierarchical facility costs","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Office of Naval Research; National Science Foundation","keywords":"Submodular set function; Facility location problem; Approximation algorithm; 1-center problem; Focus (optics); Constant (computer programming); Mathematical optimization; Computer science; Mathematics","score_opus":0.01986265845915096,"score_gpt":0.2383215506008372,"score_spread":0.21845889214168623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621840633","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.28297132,0.00001031683,0.69811314,0.009122478,0.001797443,0.0010447304,0.00012089515,0.00075122004,0.006068453],"genre_scores_gemma":[0.9952053,0.0000059300596,0.0025895645,0.0011032552,0.00014176335,0.00012681488,0.000119203745,0.000012142311,0.0006960381],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828434,0.000018066798,0.00032982003,0.00054661743,0.00048052202,0.00034063734],"domain_scores_gemma":[0.99857414,0.00003780599,0.000050626448,0.0009978908,0.00029340424,0.000046136196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00041322585,0.00025983827,0.00019003548,0.00024758032,0.00043356404,0.00016783092,0.00044472245,0.00011393751,0.0022379125],"category_scores_gemma":[0.000099867066,0.00022697757,0.00008894692,0.0007857124,0.00017709966,0.0007819809,0.000019156314,0.0005662721,0.002352892],"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.0002323886,0.0011159236,0.0014762239,0.0002000754,0.00010438733,0.000005874897,0.000116291114,0.0051447856,0.00038870773,0.0026470593,0.0008173906,0.9877509],"study_design_scores_gemma":[0.0060810233,0.00032537233,0.19242013,0.000098769764,0.00047931971,0.000019376901,0.0016160522,0.10917607,0.00208757,0.005911923,0.6786784,0.0031059927],"about_ca_topic_score_codex":0.0018461244,"about_ca_topic_score_gemma":0.0037083493,"teacher_disagreement_score":0.9846449,"about_ca_system_score_codex":0.000060618342,"about_ca_system_score_gemma":0.000039120634,"threshold_uncertainty_score":0.99867415},"labels":[],"label_agreement":null},{"id":"W2622743094","doi":"10.1145/2629671","title":"Distributed Selfish Load Balancing on Networks","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"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":"Division of Computer and Network Systems; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Nash equilibrium; Convergence (economics); Computer science; Logarithm; Vertex (graph theory); Potential game; Load balancing (electrical power); Mathematical optimization; Computation; Graph; Best response; Distributed algorithm; Polynomial; Coordination game; Mathematics; Distributed computing; Theoretical computer science; Mathematical economics; Algorithm","score_opus":0.013687302818713581,"score_gpt":0.24350609256702183,"score_spread":0.22981878974830824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622743094","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.000087283355,0.000008860441,0.9945712,0.0028043073,0.00059874315,0.0001643195,0.000010974916,0.00042631777,0.0013279615],"genre_scores_gemma":[0.7148296,0.00010728556,0.28053093,0.0031458298,0.00020039313,0.000081154256,0.000027596503,0.000038509435,0.0010386813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984339,0.00012098973,0.00021688749,0.0004229071,0.00042897326,0.0003763729],"domain_scores_gemma":[0.9984458,0.00025291461,0.000049833943,0.00093110907,0.00013321267,0.00018712577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039223814,0.00016808201,0.00015749011,0.00010269773,0.0003347314,0.00020383099,0.00085879426,0.00009915227,0.00008083671],"category_scores_gemma":[0.000058893806,0.00015755018,0.00008862319,0.0006100414,0.0000348413,0.0002815445,0.000016885659,0.0003644863,0.0001652515],"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.00000920177,0.00021290316,0.000011520953,0.000005299934,0.00002773014,0.000004110734,0.00016326307,0.50296783,0.000014259469,0.0023031163,0.0008093032,0.4934714],"study_design_scores_gemma":[0.00055099634,0.00022879567,0.0004061665,0.000026555961,0.000005456411,0.0000070949463,0.000009913941,0.98543006,0.00023510098,0.0008714196,0.012026575,0.00020186276],"about_ca_topic_score_codex":0.000023598439,"about_ca_topic_score_gemma":0.000011457671,"teacher_disagreement_score":0.71474236,"about_ca_system_score_codex":0.00011609407,"about_ca_system_score_gemma":0.000053390868,"threshold_uncertainty_score":0.64247096},"labels":[],"label_agreement":null},{"id":"W2623150993","doi":"10.1145/2344422.2344424","title":"All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":45,"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":"Log-log plot; Combinatorics; Binary logarithm; Mathematics; Undirected graph; Running time; Graph; Time complexity; Discrete mathematics; Algorithm","score_opus":0.030576764379670184,"score_gpt":0.2668495776188133,"score_spread":0.2362728132391431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623150993","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.0036938163,0.00023664035,0.9906369,0.0013799786,0.0015605495,0.0008104879,0.00015146147,0.0007793518,0.00075084023],"genre_scores_gemma":[0.407741,0.00018942979,0.5881047,0.0021414228,0.000249194,0.0006654902,0.00010151618,0.00009872697,0.0007085243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972229,0.00016898196,0.00051362836,0.00066305225,0.00044103776,0.000990403],"domain_scores_gemma":[0.9974713,0.00068667805,0.00010107709,0.001300728,0.000112429356,0.00032782299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007106406,0.0003972067,0.00040238557,0.0005798371,0.00034103234,0.00013168882,0.0015021593,0.00020335247,0.00010199895],"category_scores_gemma":[0.000044438162,0.00040470832,0.00032587742,0.0017552435,0.00012194462,0.000957133,0.00003894171,0.00045698576,0.00014298264],"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.00006700149,0.0035921112,0.0003422367,0.000040276067,0.00030196414,0.000027336513,0.002219144,0.0005304038,0.0013115756,0.011781938,0.0022962932,0.9774897],"study_design_scores_gemma":[0.0130897,0.0025237615,0.025193812,0.00050647254,0.00046728185,0.00044697378,0.00048554703,0.56056654,0.054156978,0.15338756,0.18256176,0.006613622],"about_ca_topic_score_codex":0.000071172944,"about_ca_topic_score_gemma":0.000049741033,"teacher_disagreement_score":0.9708761,"about_ca_system_score_codex":0.000108415574,"about_ca_system_score_gemma":0.000066802255,"threshold_uncertainty_score":0.9998405},"labels":[],"label_agreement":null},{"id":"W2623433906","doi":"10.1145/2000807.2000820","title":"Succinct indexes for strings, binary relations and multilabeled trees","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":50,"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":"String (physics); Set (abstract data type); Constant (computer programming); Binary number; Encoding (memory); Computer science; Rank (graph theory); Type (biology); Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.042778223462201795,"score_gpt":0.2595635280352131,"score_spread":0.21678530457301132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623433906","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.009994427,0.00012879644,0.9883642,0.0003352389,0.00037071822,0.00035201956,0.00008538531,0.00025223845,0.00011697336],"genre_scores_gemma":[0.37937298,0.00008454432,0.61978036,0.00009215436,0.000039213388,0.000112299866,0.000011268226,0.000019052823,0.00048814772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877226,0.000035895027,0.00024568028,0.000490772,0.00017967282,0.00027573595],"domain_scores_gemma":[0.9986624,0.00023422396,0.00007334307,0.0008137616,0.00007763869,0.00013861347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015963268,0.00019365824,0.00017843691,0.00021691255,0.00050208875,0.00008232868,0.0006773675,0.0001121162,0.00005977388],"category_scores_gemma":[0.00002698396,0.00017139007,0.00008099994,0.00029608252,0.00005854993,0.0008216684,0.000042011976,0.00019695249,0.000024198132],"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.000057162983,0.00052842766,0.00028126227,0.000014699804,0.000075309035,0.000010837023,0.0013634122,0.00021757609,0.000498174,0.0030524554,0.0003894029,0.99351126],"study_design_scores_gemma":[0.0073251575,0.002778842,0.13634278,0.00023423211,0.00019441171,0.0001195197,0.00046636898,0.7849239,0.022805603,0.026775302,0.016188899,0.0018449982],"about_ca_topic_score_codex":0.00017566782,"about_ca_topic_score_gemma":0.00003755317,"teacher_disagreement_score":0.99166626,"about_ca_system_score_codex":0.00002948634,"about_ca_system_score_gemma":0.000042096613,"threshold_uncertainty_score":0.69890845},"labels":[],"label_agreement":null},{"id":"W2624136382","doi":"10.1145/1240233.1240246","title":"Sharing the cost more efficiently","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","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":"","keywords":"Steiner tree problem; Minimum-cost flow problem; Approximation algorithm; Mathematical optimization; Mathematics; Computer science; Provisioning; Flow network; Combinatorics; Discrete mathematics; Computer network","score_opus":0.03576802905243455,"score_gpt":0.30946723761663547,"score_spread":0.27369920856420094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624136382","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.00034134052,0.000021061956,0.99249345,0.0044997805,0.0005023179,0.0002933403,0.000003299712,0.0002216471,0.0016237855],"genre_scores_gemma":[0.56498724,0.00009024928,0.42524335,0.0043592914,0.00015971917,0.00009729677,0.0000056373724,0.00004168713,0.005015543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998743,0.00002445272,0.00019256884,0.0003193376,0.00037058603,0.00035004297],"domain_scores_gemma":[0.99858886,0.00019090345,0.000035193498,0.0009772396,0.00008604389,0.00012176111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388463,0.000113003436,0.00008130392,0.00014279516,0.00048544264,0.0001920561,0.0014618346,0.000051318075,0.000079281665],"category_scores_gemma":[0.000023876446,0.000082141974,0.000073677475,0.0007458856,0.00007054385,0.00024738113,0.000029846171,0.00029356865,0.00015029334],"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.000007938769,0.00020889076,0.000020855745,0.0000048114534,0.000026591335,0.000014055873,0.0016400511,0.061786797,0.000107885295,0.0044334084,0.00014365265,0.93160504],"study_design_scores_gemma":[0.0008795942,0.00015035544,0.0029021606,0.000029386176,0.000012198073,0.000049922313,0.00038653935,0.96412724,0.004042982,0.0011930782,0.025867674,0.0003588613],"about_ca_topic_score_codex":0.00002676322,"about_ca_topic_score_gemma":0.000015566453,"teacher_disagreement_score":0.9312462,"about_ca_system_score_codex":0.000053608317,"about_ca_system_score_gemma":0.000031442734,"threshold_uncertainty_score":0.37336814},"labels":[],"label_agreement":null},{"id":"W2624146531","doi":"10.1145/2500118","title":"Morphing orthogonal planar graph drawings","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"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":"Planarity testing; Morphing; Orthogonality; Planar graph; Graph drawing; Mathematics; Graph; Planar; Book embedding; Combinatorics; Computer science; Geometry; Computer graphics (images); Line graph; 1-planar graph","score_opus":0.016831756462513593,"score_gpt":0.2365934897930276,"score_spread":0.21976173333051402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624146531","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.01296637,0.00003700859,0.98156905,0.0040763584,0.0006297291,0.00017306852,0.0000057246834,0.00021989812,0.0003227905],"genre_scores_gemma":[0.62570196,0.000019474664,0.37228113,0.0011084096,0.00011837702,0.00008256411,0.000011305763,0.000012069771,0.0006647156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880487,0.000040965784,0.00020932421,0.00036140755,0.0003459318,0.00023752714],"domain_scores_gemma":[0.99908465,0.00014902226,0.000048796242,0.00048021795,0.00011206717,0.00012524014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013305707,0.00014580393,0.00011280161,0.00028712678,0.00035021576,0.00022114259,0.000543287,0.000062181396,0.00020112307],"category_scores_gemma":[0.000015453857,0.0001422904,0.000102364036,0.0006772534,0.000028406377,0.00086036394,0.000009521951,0.00020166411,0.00044512466],"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.0000040946056,0.000193577,0.000023746656,0.000007342329,0.000056898658,0.000010169632,0.00040331998,0.022916278,0.0019501619,0.009271122,0.001028114,0.96413517],"study_design_scores_gemma":[0.001986996,0.0006536533,0.024155678,0.000076144606,0.000052262705,0.00030357562,0.00016781765,0.6233022,0.019164706,0.31762344,0.011050056,0.0014634578],"about_ca_topic_score_codex":0.00006416868,"about_ca_topic_score_gemma":0.0000059266276,"teacher_disagreement_score":0.9626717,"about_ca_system_score_codex":0.00003116499,"about_ca_system_score_gemma":0.000050324077,"threshold_uncertainty_score":0.5802434},"labels":[],"label_agreement":null},{"id":"W2735816714","doi":"10.1145/3086464","title":"Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Mathematics; Matroid; Combinatorics; Discrete mathematics; Monotone polygon; Automatic summarization; Cardinality (data modeling); Mathematical optimization; Computer science; Data mining","score_opus":0.02398333559549957,"score_gpt":0.26348549531059334,"score_spread":0.23950215971509378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735816714","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.007897792,0.00013388522,0.9846287,0.005297347,0.00097536366,0.00022753484,0.00005410901,0.00027267297,0.00051264156],"genre_scores_gemma":[0.8805505,0.0003461988,0.117832705,0.0001749538,0.000046681882,0.000056792844,0.000009953804,0.00001811795,0.00096407294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847955,0.00003874105,0.00022642312,0.00064665463,0.00029252304,0.0003161025],"domain_scores_gemma":[0.99714035,0.000090257185,0.00012824163,0.002387515,0.00009742387,0.00015620103],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00021473832,0.00022575192,0.00019942147,0.00022235111,0.002300173,0.00058296707,0.0017769787,0.000100940466,0.000057864694],"category_scores_gemma":[0.000032795597,0.0002332704,0.000104425555,0.00020926679,0.0002777577,0.0009383205,0.00008883,0.00029666556,0.00013128387],"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.000015223591,0.0002682248,0.00017872271,0.00001453573,0.00010794531,0.000012851131,0.0003176744,0.00018335013,0.0003134295,0.009512467,0.0001711262,0.9889045],"study_design_scores_gemma":[0.004311654,0.00070364523,0.22628866,0.00013111999,0.00024588747,0.0002332515,0.0008855778,0.5410001,0.007747826,0.19220719,0.023784585,0.002460502],"about_ca_topic_score_codex":0.00012827897,"about_ca_topic_score_gemma":0.000041011914,"teacher_disagreement_score":0.98644394,"about_ca_system_score_codex":0.000051779538,"about_ca_system_score_gemma":0.00003448296,"threshold_uncertainty_score":0.9989987},"labels":[],"label_agreement":null},{"id":"W2799530285","doi":"10.1145/3168005","title":"Selection and Sorting in the “Restore” Model","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","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":"University of Waterloo","funders":"","keywords":"Subroutine; Sorting; Sequence (biology); Permutation (music); Selection (genetic algorithm); Computer science; Algorithm; Space (punctuation); Computation; Order (exchange); Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.03102233657756117,"score_gpt":0.283626278682251,"score_spread":0.25260394210468984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799530285","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.010693464,0.00002361424,0.9875083,0.0010981903,0.00018931353,0.00012480159,0.0000036887252,0.000092142785,0.0002664949],"genre_scores_gemma":[0.7125269,0.000032224416,0.28674334,0.0005013279,0.000091539594,0.000030748906,0.0000011341083,0.000007983313,0.00006476953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897784,0.00006225507,0.00017452646,0.00033053124,0.0002354214,0.00021945337],"domain_scores_gemma":[0.99920774,0.00010180231,0.00004424588,0.0005532479,0.000045860845,0.000047094567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032407977,0.000116113275,0.00009150013,0.0001292794,0.0004029619,0.00014057058,0.00069082493,0.000060093487,0.00000900023],"category_scores_gemma":[0.000018610515,0.000083631494,0.00003022616,0.00044424745,0.000054464792,0.00054803636,0.000023780769,0.00024152212,0.000020520172],"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.000010219484,0.00015448077,0.00004597727,0.0000045592947,0.000008697392,0.00000435644,0.002181353,0.002830668,0.00041766107,0.002105403,0.00019356352,0.9920431],"study_design_scores_gemma":[0.00024334443,0.00013649763,0.0009294055,0.000016246546,0.000004548836,0.000035730558,0.00007030901,0.9888705,0.0010653568,0.007946439,0.000563115,0.00011848267],"about_ca_topic_score_codex":0.00009710474,"about_ca_topic_score_gemma":0.00008690911,"teacher_disagreement_score":0.9919246,"about_ca_system_score_codex":0.000028577273,"about_ca_system_score_gemma":0.000033322845,"threshold_uncertainty_score":0.34103933},"labels":[],"label_agreement":null},{"id":"W2802493366","doi":"10.1145/3173047","title":"Approximation Algorithms for Minimum-Load <i>k</i> -Facility Location","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":4,"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 Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Facility location problem; Approximation algorithm; Combinatorics; Line (geometry); Integer (computer science); Mathematics; Set (abstract data type); Steiner tree problem; Tree (set theory); Cover (algebra); Real line; Metric (unit); Algorithm; Computer science; Discrete mathematics; Mathematical optimization; Geometry","score_opus":0.047222579108341205,"score_gpt":0.274153093749903,"score_spread":0.22693051464156178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802493366","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.005161272,0.00002737836,0.9837525,0.0039859097,0.002052225,0.0012332245,0.00005823594,0.00044976865,0.0032795258],"genre_scores_gemma":[0.9494028,0.00003497873,0.037497923,0.0053912797,0.002009025,0.001132423,0.0003509038,0.00006709548,0.0041135796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979417,0.000016788228,0.0005056293,0.0006195865,0.00050951337,0.0004067825],"domain_scores_gemma":[0.99798,0.00004827528,0.0001031834,0.0008455868,0.0009893873,0.00003355864],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006960593,0.000291419,0.00022379211,0.00028096905,0.00065394765,0.00019545476,0.00046588533,0.00012464487,0.00078244385],"category_scores_gemma":[0.00018159307,0.00029903313,0.00016034012,0.00091925514,0.00014638466,0.001072482,0.00001935809,0.00014167208,0.0022095775],"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.00023665397,0.0009074337,0.000040837225,0.0004579546,0.00013201988,7.0345936e-7,0.00032773722,0.0031067089,0.00030313787,0.0023397007,0.008855997,0.9832911],"study_design_scores_gemma":[0.0030955,0.0002539827,0.0019712315,0.00007512303,0.0002922285,0.0000022284698,0.0010428949,0.541859,0.0027303956,0.010237869,0.43729842,0.0011411434],"about_ca_topic_score_codex":0.0006506072,"about_ca_topic_score_gemma":0.0004437073,"teacher_disagreement_score":0.98214996,"about_ca_system_score_codex":0.00016159505,"about_ca_system_score_gemma":0.000056528814,"threshold_uncertainty_score":0.9999462},"labels":[],"label_agreement":null},{"id":"W2884850827","doi":"10.1145/3230647","title":"Editorial","year":2018,"lang":"es","type":"editorial","venue":"ACM Transactions on Algorithms","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.014961938310364034,"score_gpt":0.29188838038813947,"score_spread":0.27692644207777545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884850827","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000137749275,0.00012420262,0.026176328,0.00031346752,0.95015615,0.0014993714,0.019040484,0.0014656824,0.001210514],"genre_scores_gemma":[0.000061417544,0.0009467824,0.012694598,0.000052040643,0.97525555,0.0005561704,0.00115554,0.0015151546,0.0077627553],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9842222,0.00086113886,0.0020224757,0.0034674525,0.006954294,0.0024724798],"domain_scores_gemma":[0.9847874,0.0036873806,0.0010552541,0.0064372937,0.0028683085,0.001164353],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0018496659,0.0027486733,0.0022200262,0.0018492133,0.002005394,0.0010804068,0.0048119924,0.007164247,0.006570674],"category_scores_gemma":[0.002076622,0.002982962,0.001754136,0.002249129,0.0014901285,0.0009195383,0.00006684702,0.0076285833,0.1265887],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013165039,0.0017473901,3.9814535e-7,0.00014125012,0.0014324997,0.000030171648,0.00033549158,0.00011486858,0.00019003286,0.000005690549,0.9507395,0.043946218],"study_design_scores_gemma":[0.0050998544,0.0027465757,0.000005976958,0.0007060533,0.0018521573,0.000015582791,0.00012207891,0.00023717241,0.0015165638,0.000657369,0.9842875,0.0027531055],"about_ca_topic_score_codex":0.00082811184,"about_ca_topic_score_gemma":0.00015466151,"teacher_disagreement_score":0.12001803,"about_ca_system_score_codex":0.0023667342,"about_ca_system_score_gemma":0.0025353841,"threshold_uncertainty_score":0.99995655},"labels":[],"label_agreement":null},{"id":"W2897951335","doi":"10.1145/3378570","title":"Periods of Iterations of Functions with Restricted Preimage Sizes","year":2020,"lang":"en","type":"preprint","venue":"ACM Transactions on Algorithms","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Mathematics; Product (mathematics); Combinatorics; Set (abstract data type); Heuristic; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.06052760702311941,"score_gpt":0.31418922274209604,"score_spread":0.2536616157189766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897951335","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.013996376,0.00003073066,0.9798245,0.0010214926,0.00020652862,0.00086245197,0.0015963012,0.00014676426,0.002314863],"genre_scores_gemma":[0.54159445,0.0000817022,0.45674032,0.00003121153,0.000064042935,0.00024611483,0.000091278314,0.00009244178,0.0010584277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978914,0.00008909306,0.0008663314,0.00044911882,0.00049504824,0.00020895599],"domain_scores_gemma":[0.9968172,0.0009045708,0.0004945815,0.0013001813,0.00034909596,0.00013439171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000126515,0.00036444818,0.0008064024,0.00024957542,0.00012494011,0.00004466002,0.0004884955,0.0003142252,0.0005142562],"category_scores_gemma":[0.0003294933,0.00030548006,0.00033093247,0.00044455743,0.00024043942,0.000083540755,0.000043288623,0.00087294047,0.000011555651],"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.0042342823,0.05383899,0.00032809895,0.051116414,0.027085353,0.0003254728,0.05572243,0.06637947,0.03952666,0.40305376,0.0077296426,0.29065943],"study_design_scores_gemma":[0.0039997105,0.0033221205,0.0013817346,0.003810017,0.0044604475,0.000069412206,0.0027288776,0.18825112,0.012672914,0.7755297,0.0013517044,0.0024222606],"about_ca_topic_score_codex":0.00004964209,"about_ca_topic_score_gemma":0.00003200288,"teacher_disagreement_score":0.5275981,"about_ca_system_score_codex":0.000045458124,"about_ca_system_score_gemma":0.00020274975,"threshold_uncertainty_score":0.99993974},"labels":[],"label_agreement":null},{"id":"W2903710486","doi":"10.1145/3459096","title":"Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Rounding; Hyperplane; Semidefinite programming; Mathematics; Approximation algorithm; Constraint satisfaction problem; Mathematical optimization; Brownian motion; Constraint (computer-aided design); Computer science; Combinatorics","score_opus":0.03982695069133185,"score_gpt":0.27301035340206586,"score_spread":0.233183402710734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903710486","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.00257695,0.000087124645,0.99243885,0.0029534528,0.00051985215,0.0007857459,0.00009623519,0.0003254999,0.00021630393],"genre_scores_gemma":[0.7957032,0.000048884936,0.20186962,0.00068843446,0.00006669696,0.0013133038,0.000005902401,0.000022976832,0.00028101477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982536,0.000092527815,0.00027607422,0.00061039795,0.00042821566,0.00033919915],"domain_scores_gemma":[0.9987417,0.00022940528,0.000066306566,0.00068271265,0.00006369554,0.00021617017],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000302062,0.00019298274,0.00017308594,0.00037426403,0.0014947684,0.00019156502,0.0007431643,0.000041923635,0.00016609556],"category_scores_gemma":[0.000017266275,0.00022242144,0.000077571734,0.0010706495,0.00005264797,0.00034413312,0.00009316365,0.00044307156,0.000045802044],"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.0000051283455,0.00015420506,0.000020546991,0.000016714817,0.000039708902,0.0000050445224,0.00091143325,0.00856865,0.00057742494,0.022107167,0.000036506357,0.9675575],"study_design_scores_gemma":[0.0040646493,0.0033596496,0.011157982,0.00016207634,0.00019659444,0.0018933114,0.0036954528,0.6152342,0.005371873,0.16443466,0.1867664,0.0036631278],"about_ca_topic_score_codex":0.00011435026,"about_ca_topic_score_gemma":0.00005187804,"teacher_disagreement_score":0.96389437,"about_ca_system_score_codex":0.00016078862,"about_ca_system_score_gemma":0.00006670437,"threshold_uncertainty_score":0.99980515},"labels":[],"label_agreement":null},{"id":"W2925520559","doi":"10.1145/3522588","title":"Network Design for <i>s</i> - <i>t</i> Effective Resistance","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":7,"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; Google (Canada)","funders":"","keywords":"Randomized rounding; Rounding; Approximation algorithm; Mathematics; Shortest path problem; Linear programming relaxation; Steiner tree problem; Combinatorics; Discrete mathematics; Mathematical optimization; Graph; Linear programming; Computer science","score_opus":0.011926888137200577,"score_gpt":0.21249345874963238,"score_spread":0.2005665706124318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925520559","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.000059921782,0.00019686758,0.9965742,0.0003529291,0.000990837,0.0010012558,0.000083282896,0.00035240708,0.00038825526],"genre_scores_gemma":[0.16154836,0.00024865253,0.8266042,0.00093411986,0.0002450833,0.008092267,0.000047069007,0.00015139006,0.0021288989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916065,0.00006477101,0.00015702531,0.00020946535,0.00013831459,0.0002697697],"domain_scores_gemma":[0.99916995,0.0003781589,0.000021024214,0.0003496142,0.000036673508,0.000044603024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030078765,0.00013266757,0.00013906509,0.0000465302,0.00045677187,0.000019525469,0.00020490495,0.00004250682,0.00007169018],"category_scores_gemma":[0.000019653698,0.00014902184,0.00008809967,0.00033272925,0.000024862155,0.0000964349,0.0000037264451,0.0002315493,0.0000070714464],"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.00008933332,0.000040351846,2.5484445e-7,0.000021349113,0.000027882688,9.513769e-7,0.00009148656,0.96517366,0.00008682612,0.00008426076,0.0069482736,0.027435387],"study_design_scores_gemma":[0.0022722986,0.000743036,0.000039912687,0.00005022761,0.00012593338,0.00001306235,0.00022903188,0.7044289,0.008193661,0.03133987,0.2517727,0.00079134066],"about_ca_topic_score_codex":0.0000026700143,"about_ca_topic_score_gemma":0.0000047384533,"teacher_disagreement_score":0.26074472,"about_ca_system_score_codex":0.00018327171,"about_ca_system_score_gemma":0.000015199725,"threshold_uncertainty_score":0.60769343},"labels":[],"label_agreement":null},{"id":"W2950424720","doi":"10.1145/2438645.2438649","title":"Delays Induce an Exponential Memory Gap for Rendezvous in Trees","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"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":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Rendezvous; Exponential function; Computer science; Psychology; Mathematics; Physics; Astronomy; Mathematical analysis","score_opus":0.05484617889239228,"score_gpt":0.29676872146558664,"score_spread":0.24192254257319434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950424720","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.005432632,0.000016949482,0.9909651,0.0019675558,0.00040004056,0.000628081,0.000009417323,0.00018466926,0.00039550348],"genre_scores_gemma":[0.4288826,0.000035914712,0.5686405,0.0004970604,0.000070446324,0.0006455782,0.000012368872,0.00002708019,0.0011884661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859446,0.000093571754,0.00026834974,0.00043099144,0.00025414993,0.00035848765],"domain_scores_gemma":[0.9988048,0.0001227632,0.00004427964,0.0007460403,0.000115203096,0.00016690452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023745844,0.0001498804,0.00015047262,0.00030195815,0.00019452507,0.0002000009,0.0008848459,0.00010493577,0.00020130076],"category_scores_gemma":[0.000023113718,0.00014672155,0.00007696409,0.00043560928,0.000039426217,0.0011454828,0.000014254359,0.00022425262,0.00008965113],"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.00001517187,0.000658308,0.0000067573083,0.000010407515,0.00002385952,0.0000050708577,0.0019072043,0.03222656,0.0011777127,0.00083597196,0.00028140418,0.9628516],"study_design_scores_gemma":[0.0019360905,0.0006493993,0.0010021408,0.000023652708,0.000008373978,0.000018020319,0.00036331246,0.9823703,0.0040697614,0.008203689,0.00093775475,0.0004174784],"about_ca_topic_score_codex":0.00029631337,"about_ca_topic_score_gemma":0.0001833594,"teacher_disagreement_score":0.9624341,"about_ca_system_score_codex":0.000057469842,"about_ca_system_score_gemma":0.00007108298,"threshold_uncertainty_score":0.5983131},"labels":[],"label_agreement":null},{"id":"W2963287397","doi":"10.1145/3301446","title":"Approximation Schemes for Clustering with Outliers","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Outlier; Facility location problem; Metric (unit); Metric space; Computer science; Overhead (engineering); Set (abstract data type); Mathematics; Data point; Integer (computer science); Euclidean distance; Combinatorics; Algorithm; Mathematical optimization; Discrete mathematics; Artificial intelligence","score_opus":0.024954656897864087,"score_gpt":0.23649300784296506,"score_spread":0.21153835094510098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963287397","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.01918429,0.000007391106,0.97358155,0.0021037064,0.0006631588,0.0009396014,0.0000062685435,0.00022617381,0.0032878572],"genre_scores_gemma":[0.9557857,0.000008963682,0.03776808,0.0016986355,0.00020630022,0.00034136767,0.000060855087,0.0000460714,0.00408404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.000003457542,0.00018437316,0.00029061272,0.00020711297,0.00021013986],"domain_scores_gemma":[0.9994109,0.00001760504,0.000043406053,0.000408948,0.00010717633,0.000011952247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016407201,0.0001495229,0.00012714707,0.00021397352,0.0001796745,0.000115723335,0.00021625408,0.0000426073,0.0005255943],"category_scores_gemma":[0.000013934589,0.00013305624,0.00007235832,0.00031020082,0.000021246262,0.0006891761,0.000008496033,0.00008322652,0.000634634],"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.00041580948,0.000565155,0.0005393701,0.001215475,0.00027714527,0.0000011206479,0.00024892643,0.11207048,0.0002768886,0.0064076902,0.0009336888,0.87704825],"study_design_scores_gemma":[0.002565039,0.00011553197,0.0012777683,0.000081908314,0.00013180442,0.0000010405071,0.0014401263,0.7418311,0.00042215097,0.0011145703,0.25041875,0.00060018135],"about_ca_topic_score_codex":0.00013456382,"about_ca_topic_score_gemma":0.00012697898,"teacher_disagreement_score":0.9366014,"about_ca_system_score_codex":0.000037247893,"about_ca_system_score_gemma":0.000009467497,"threshold_uncertainty_score":0.8157148},"labels":[],"label_agreement":null},{"id":"W2966205006","doi":"10.1145/3595180","title":"Competitive Online Search Trees on Trees","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Fonds De La Recherche Scientifique - FNRS; York University; National Science Foundation","keywords":"Ternary search tree; Weight-balanced tree; Binary search tree; Optimal binary search tree; Range tree; Self-balancing binary search tree; K-ary tree; Mathematics; Binary tree; Tree (set theory); Combinatorics; Generalization; Vertex (graph theory); Search tree; Path (computing); Interval tree; Set (abstract data type); Search algorithm; Computer science; Tree structure; Algorithm; Graph","score_opus":0.04541435443245161,"score_gpt":0.30852846220716484,"score_spread":0.2631141077747132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966205006","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.0074617425,0.000037126272,0.9827312,0.0054049185,0.0011317208,0.00031760262,0.00049285486,0.0012781112,0.0011446979],"genre_scores_gemma":[0.6258402,0.0010535138,0.3609371,0.0021041746,0.0007480059,0.00018804167,0.00043636633,0.00013628983,0.008556329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976724,0.00012304794,0.00027709783,0.00072166644,0.00069561694,0.00051020697],"domain_scores_gemma":[0.99770314,0.0004637458,0.000040375537,0.0014893656,0.00009924062,0.0002041614],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024015816,0.00027479677,0.00025680554,0.000493737,0.00048808142,0.0001728845,0.0016225098,0.00011198516,0.00013637533],"category_scores_gemma":[0.000025738103,0.00023560105,0.0001546706,0.0013280709,0.0000902915,0.00048564453,0.0000797575,0.0004829372,0.0012712685],"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.000030214202,0.0006572943,0.000007593852,0.0000069884977,0.000056345147,0.000084148094,0.00053045456,0.010542195,0.00047702508,0.005625976,0.0010088099,0.98097295],"study_design_scores_gemma":[0.0027143836,0.0020850745,0.03313168,0.0003147599,0.000038347123,0.000058264442,0.0012191831,0.8880336,0.012817174,0.004179933,0.054181937,0.001225647],"about_ca_topic_score_codex":0.00015271037,"about_ca_topic_score_gemma":0.00014026651,"teacher_disagreement_score":0.9797473,"about_ca_system_score_codex":0.00007126211,"about_ca_system_score_gemma":0.000071098715,"threshold_uncertainty_score":0.99950635},"labels":[],"label_agreement":null},{"id":"W2979731478","doi":"10.1145/3341599","title":"A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Multigraph; Mathematics; Approximation algorithm; Enhanced Data Rates for GSM Evolution; Vertex connectivity; Induced subgraph isomorphism problem; Subgraph isomorphism problem; Reduction (mathematics); Vertex cover; Discrete mathematics; Algorithm; Computer science; Graph; Line graph; Vertex (graph theory); Artificial intelligence","score_opus":0.024085918305266994,"score_gpt":0.25529014395202443,"score_spread":0.23120422564675744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979731478","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.00046779832,0.0001548828,0.9916678,0.003282127,0.001637303,0.0018824085,0.00008714333,0.00049616076,0.00032434342],"genre_scores_gemma":[0.025593853,0.0001088588,0.97118866,0.0007640984,0.00015746611,0.00080862705,0.000023551354,0.000048994498,0.0013058634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975579,0.000101400015,0.00046219357,0.00079828495,0.0004995586,0.0005806553],"domain_scores_gemma":[0.9962992,0.0012672751,0.0001591542,0.0018780342,0.00026602254,0.00013028507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057470973,0.00034776318,0.0003202496,0.00031818345,0.0007119039,0.00030951775,0.0021642004,0.00016128464,0.000107629035],"category_scores_gemma":[0.000030884486,0.00027252754,0.00037711338,0.0013198232,0.00013082926,0.0006264315,0.000043566884,0.0004310375,0.00015649058],"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.000016197157,0.00025720545,0.000004070602,0.00002666123,0.00012524726,0.0000018773735,0.0005488644,0.0004112536,0.00016079823,0.007714827,0.0002776414,0.9904553],"study_design_scores_gemma":[0.0018805917,0.0006007573,0.0003354047,0.00006236994,0.000059524187,0.000046835536,0.000218679,0.9365811,0.0034797236,0.043087315,0.0131043475,0.0005434007],"about_ca_topic_score_codex":0.000049596965,"about_ca_topic_score_gemma":0.000015152867,"teacher_disagreement_score":0.989912,"about_ca_system_score_codex":0.00006750351,"about_ca_system_score_gemma":0.00009802377,"threshold_uncertainty_score":0.9999727},"labels":[],"label_agreement":null},{"id":"W2987306417","doi":"10.1145/3359589","title":"Solving the Sigma-Tau Problem","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"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 Guelph","funders":"","keywords":"Combinatorics; Mathematics; Sigma; Successor cardinal; Cayley graph; Hamiltonian path; Permutation (music); Transposition (logic); Discrete mathematics; Graph; Traverse; Directed graph","score_opus":0.008035747002884806,"score_gpt":0.19748789890374618,"score_spread":0.18945215190086137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987306417","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.09643065,0.0006582956,0.86548895,0.0007575259,0.004637698,0.0014278193,0.00005063936,0.0017258102,0.0288226],"genre_scores_gemma":[0.99640876,0.000040371695,0.00188577,0.00007070415,0.00006373243,0.00007628178,0.0000018156732,0.00004023875,0.0014123075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921334,0.000039704242,0.00017682707,0.00016398846,0.0001562733,0.0002498525],"domain_scores_gemma":[0.99915546,0.0001349947,0.000017950742,0.000621212,0.000019479357,0.00005091685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019684264,0.0001537795,0.00013325538,0.0000741147,0.000157714,0.00004810714,0.0003505318,0.00007853262,0.00039769494],"category_scores_gemma":[0.0000030740803,0.00011432011,0.00011458154,0.0002459052,0.000028068464,0.00013098755,0.0000027046904,0.0003041284,0.0005023722],"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.0000318714,0.00017045393,0.000116043826,0.00026422064,0.0005076077,0.000010850425,0.0038801502,0.4415759,0.01013172,0.0038745562,0.0009953727,0.53844124],"study_design_scores_gemma":[0.006391887,0.001282615,0.0049247663,0.0012577077,0.0005300949,0.00046366715,0.01077164,0.56309927,0.110542215,0.06055072,0.23552392,0.0046615144],"about_ca_topic_score_codex":0.000014271597,"about_ca_topic_score_gemma":0.000008409068,"teacher_disagreement_score":0.8999781,"about_ca_system_score_codex":0.00003240486,"about_ca_system_score_gemma":0.000008248141,"threshold_uncertainty_score":0.6457146},"labels":[],"label_agreement":null},{"id":"W300354415","doi":"10.1145/1383369.1383376","title":"Improved algorithms for optimal embeddings","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Computer science; Algorithm","score_opus":0.023364205371417042,"score_gpt":0.258144936447687,"score_spread":0.23478073107626996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W300354415","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.0059374585,0.00013524438,0.98988396,0.00023599555,0.00065156986,0.00046036608,0.000074352945,0.0024320201,0.00018903782],"genre_scores_gemma":[0.09386933,0.0004576749,0.9045166,0.00006889277,0.00013178546,0.00039424314,0.000010256289,0.0001051418,0.00044611946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863064,0.000006175879,0.00029223654,0.000350147,0.00015843783,0.000562359],"domain_scores_gemma":[0.99896044,0.00021082585,0.00002643688,0.00061833416,0.000067715315,0.00011627178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000062430096,0.00030239555,0.00028346342,0.00015872272,0.00028637645,0.000020873633,0.00044640907,0.0002391633,0.000054207296],"category_scores_gemma":[0.00004896193,0.00030885273,0.00017913867,0.0003573629,0.00016277199,0.00023902752,0.000008443096,0.0004352641,0.00004540342],"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.000041585987,0.00012389272,0.0000019900172,0.000035144356,0.0001474351,0.000018218796,0.00015470556,0.30826712,0.002154226,0.00011595743,0.0005899957,0.6883497],"study_design_scores_gemma":[0.0011838224,0.0003984385,0.00005011268,0.000024822719,0.000046350597,0.00008976375,0.00013838688,0.9592038,0.026376463,0.0013566617,0.010496946,0.0006344625],"about_ca_topic_score_codex":0.0000036100562,"about_ca_topic_score_gemma":0.0000015984001,"teacher_disagreement_score":0.6877153,"about_ca_system_score_codex":0.000118922566,"about_ca_system_score_gemma":0.000015367363,"threshold_uncertainty_score":0.99993634},"labels":[],"label_agreement":null},{"id":"W3004834866","doi":"10.1145/3527171","title":"Deterministic Leader Election in Anonymous Radio Networks","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Leader election; Computer science; Communication source; Computer network; Graph; Connectivity; Combinatorics; Discrete mathematics; Mathematics; Topology (electrical circuits); Theoretical computer science; Physics","score_opus":0.015879433619937346,"score_gpt":0.24396178351696318,"score_spread":0.22808234989702583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004834866","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.0015856767,0.00012809431,0.9954665,0.0006173626,0.0014794841,0.00021585586,0.000020499687,0.00017934204,0.00030723124],"genre_scores_gemma":[0.9908214,0.000017416443,0.00758066,0.00030438037,0.000063923064,0.00024834534,0.000007182738,0.000015030349,0.00094163895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984599,0.00013107949,0.00029326184,0.00044434756,0.00031057658,0.00036086683],"domain_scores_gemma":[0.99903995,0.00009278026,0.0000654729,0.0006984461,0.000028281138,0.00007508294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026179658,0.00015579528,0.00018804784,0.00019956427,0.00043574805,0.00009379638,0.0008447984,0.000058056256,0.00010640668],"category_scores_gemma":[0.0000081358085,0.00017161954,0.00008784239,0.0010777861,0.000025920166,0.00023799173,0.000020259638,0.00051666977,0.000019963798],"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.000026718715,0.00045715424,0.000041553856,0.000007753714,0.000026530366,0.0001317597,0.00054049713,0.29970634,0.000091395705,0.00040919814,0.0006761458,0.697885],"study_design_scores_gemma":[0.0009400753,0.0003958805,0.0014753505,0.000016537575,0.000009367015,0.0003023529,0.00015903114,0.9770865,0.00017028619,0.00048187212,0.018598456,0.0003642884],"about_ca_topic_score_codex":0.000118504635,"about_ca_topic_score_gemma":0.0000441344,"teacher_disagreement_score":0.98923576,"about_ca_system_score_codex":0.00021941,"about_ca_system_score_gemma":0.00006123986,"threshold_uncertainty_score":0.6998442},"labels":[],"label_agreement":null},{"id":"W3093330059","doi":"10.1145/3679015","title":"Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Coding theory and cryptography","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 Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Construct (python library); Combinatorics; Greedy algorithm; Mathematics; Space (punctuation); De Bruijn graph; Computer science; Algorithm; Discrete mathematics; Theoretical computer science","score_opus":0.014745811284684978,"score_gpt":0.2426197850901976,"score_spread":0.22787397380551264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093330059","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.15169853,0.00036774858,0.8446991,0.0016309315,0.00081239507,0.0001724457,0.00003083718,0.00021103435,0.00037698602],"genre_scores_gemma":[0.97363394,0.000052385643,0.026058858,0.00008605188,0.00002221573,0.000027864402,2.548852e-7,0.0000075162116,0.00011092424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990326,0.00010317896,0.00016896236,0.00031261155,0.00019627648,0.00018635413],"domain_scores_gemma":[0.99900794,0.00025321095,0.00003163389,0.00060252094,0.00003714884,0.00006753347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024241519,0.00012204496,0.00011266332,0.00016189473,0.00028922563,0.00013060465,0.0006120063,0.00006153017,0.000025142932],"category_scores_gemma":[0.000011545776,0.00008899804,0.00013118569,0.00082041504,0.00022701648,0.00011418002,0.000027180946,0.0002472069,0.0000055983414],"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.000019979288,0.00026032215,0.00017847335,0.00012452486,0.00027249966,0.000007174541,0.0064483704,0.013473532,0.0056203636,0.12357085,0.000048835293,0.84997505],"study_design_scores_gemma":[0.0011676443,0.0010610216,0.014294693,0.0011144897,0.0005074019,0.0011807142,0.0013061134,0.59326255,0.109500244,0.26972336,0.0056506232,0.0012311531],"about_ca_topic_score_codex":0.000046485777,"about_ca_topic_score_gemma":0.000018554327,"teacher_disagreement_score":0.8487439,"about_ca_system_score_codex":0.000028115064,"about_ca_system_score_gemma":0.00008171945,"threshold_uncertainty_score":0.36292347},"labels":[],"label_agreement":null},{"id":"W3099896668","doi":"10.1145/2701615","title":"A Bounded Budget Network Creation Game","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":25,"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":"Vertex (graph theory); Combinatorics; Mathematics; Nash equilibrium; Bounded function; Neighbourhood (mathematics); Undirected graph; Graph; Best response; Discrete mathematics; Mathematical optimization","score_opus":0.14643101472649359,"score_gpt":0.3982721749475645,"score_spread":0.25184116022107095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099896668","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.018882787,0.00004341285,0.96505755,0.004141791,0.00068183383,0.0003043254,0.000037943482,0.00019837134,0.01065196],"genre_scores_gemma":[0.9538248,0.000013968185,0.03433277,0.0007040947,0.0002743563,0.00013861616,0.0000098847595,0.00002250879,0.010678989],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975775,0.00022934853,0.0004741535,0.0004825665,0.00092359487,0.0003128408],"domain_scores_gemma":[0.9969852,0.000924386,0.00013197697,0.0013496,0.0003221489,0.00028666973],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018733997,0.00016932144,0.00022938315,0.00018283242,0.00031087102,0.00025579875,0.00091314653,0.00011107081,0.0007777867],"category_scores_gemma":[0.00050883286,0.00013888489,0.00014094528,0.0012918672,0.00015834592,0.00033390566,0.0000122300435,0.0002444048,0.0032129714],"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.00016113701,0.0005473851,0.00009590032,0.0000018172025,0.00006662428,0.000007195935,0.0022174146,0.045655977,0.00011750043,0.018084463,0.011747375,0.9212972],"study_design_scores_gemma":[0.00083587354,0.00020900027,0.0011598933,0.000011056994,0.00004043494,0.00002978123,0.0011182465,0.009590411,0.0008195586,0.8228446,0.16306143,0.00027967463],"about_ca_topic_score_codex":0.000033710843,"about_ca_topic_score_gemma":0.000035761776,"teacher_disagreement_score":0.934942,"about_ca_system_score_codex":0.00007234596,"about_ca_system_score_gemma":0.00011079671,"threshold_uncertainty_score":0.9975631},"labels":[],"label_agreement":null},{"id":"W3115470548","doi":"10.1145/3402926","title":"Deterministic APSP, Orthogonal Vectors, and More","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"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":"University of Waterloo; National Science Foundation","keywords":"Satisfiability; Deterministic algorithm; Combinatorics; Mathematics; Binary logarithm; Randomized algorithm; Discrete mathematics; Matching (statistics); Algorithm; Statistics","score_opus":0.0392331204555236,"score_gpt":0.2640326974534066,"score_spread":0.22479957699788297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115470548","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.0056505185,0.00009137609,0.98587865,0.007290508,0.00040476775,0.00015526952,0.000039246595,0.0003382594,0.00015138881],"genre_scores_gemma":[0.70774424,0.00008858836,0.28875417,0.003097074,0.0001686041,0.000038767623,0.0000048787324,0.000024504949,0.000079175436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985559,0.000047106,0.00022668173,0.0005608017,0.00031462667,0.00029487928],"domain_scores_gemma":[0.99883056,0.00019327429,0.000047107413,0.0005917165,0.000044922777,0.00029241218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008627064,0.00021489758,0.00020760199,0.000109538276,0.00033872915,0.00015857507,0.0008884301,0.00007598787,0.00006972215],"category_scores_gemma":[0.00003734467,0.00021254689,0.00011040526,0.00055543025,0.00014277485,0.00030480212,0.00004649137,0.00034208136,0.00005447955],"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.000016152715,0.00012740493,0.000060064624,0.00002626929,0.000052109994,0.00007735227,0.0012902163,0.0002590914,0.00013811386,0.0033383113,0.00010003829,0.9945149],"study_design_scores_gemma":[0.002859617,0.0019270676,0.016475128,0.00010344172,0.00012377194,0.0004704086,0.00041115956,0.9158303,0.004358043,0.029262587,0.026326627,0.0018518505],"about_ca_topic_score_codex":0.000011928443,"about_ca_topic_score_gemma":0.000005337295,"teacher_disagreement_score":0.992663,"about_ca_system_score_codex":0.000017436869,"about_ca_system_score_gemma":0.00004926183,"threshold_uncertainty_score":0.86674106},"labels":[],"label_agreement":null},{"id":"W3117062007","doi":"10.1145/3474057","title":"Algorithms for Weighted Independent Transversals and Strong Colouring","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Chromatic scale; Mathematical proof; Partition (number theory); Mathematics; Graph partition; Combinatorics; Discrete mathematics; Graph; Computer science; Algorithm","score_opus":0.04069205520459028,"score_gpt":0.31724421791541285,"score_spread":0.27655216271082256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117062007","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.0032812897,0.00025596816,0.9931882,0.0020063191,0.00041428886,0.00044082018,0.00006845423,0.0002097218,0.00013490648],"genre_scores_gemma":[0.18279834,0.00028818008,0.8149157,0.0002807121,0.000081593906,0.00029016053,0.000010396429,0.000051084644,0.0012838376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781567,0.00012327859,0.0002844321,0.0007616003,0.00045859715,0.0005564258],"domain_scores_gemma":[0.9979749,0.0005793076,0.000051587733,0.0009321025,0.00022155531,0.00024057478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037846412,0.00023566134,0.00026897184,0.00024432683,0.0004867187,0.00019301473,0.00079599564,0.00012862228,0.000059477636],"category_scores_gemma":[0.00003950006,0.0002451428,0.00015664587,0.000641551,0.000104527535,0.00059559353,0.000036103684,0.00039564568,0.000014296308],"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.00005834571,0.00033603597,0.000014110414,0.000045957262,0.00018641373,0.00009373252,0.00072085694,0.0009177349,0.0027440544,0.013918944,0.000028758632,0.98093504],"study_design_scores_gemma":[0.010048569,0.0015643053,0.0011752875,0.00019161763,0.00015890972,0.00040080055,0.0016336977,0.3802839,0.34955826,0.24231018,0.01080386,0.0018706362],"about_ca_topic_score_codex":0.000010611645,"about_ca_topic_score_gemma":0.000023365974,"teacher_disagreement_score":0.9790644,"about_ca_system_score_codex":0.00008946986,"about_ca_system_score_gemma":0.00013272204,"threshold_uncertainty_score":0.9996633},"labels":[],"label_agreement":null},{"id":"W3134377377","doi":"10.1145/3477910","title":"A Simple Algorithm for Optimal Search Trees with Two-way Comparisons","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"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":"Hong Kong University of Science and Technology; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Simple (philosophy); Correctness; Running time; Algorithm; Time complexity; Mathematics; Optimal binary search tree; Computer science; Search algorithm; SIMPLE algorithm; Search tree; Theoretical computer science; Interval tree","score_opus":0.035216390213666564,"score_gpt":0.3036884071578162,"score_spread":0.2684720169441496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134377377","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.0005489112,0.00013295296,0.99643815,0.001191649,0.00039774494,0.00042075737,0.00037214253,0.00034418254,0.00015351227],"genre_scores_gemma":[0.02140493,0.000047341593,0.97705275,0.00031812533,0.00015921879,0.00019756707,0.00010999048,0.000045848723,0.00066424214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714917,0.000117685115,0.0003669676,0.00101256,0.0006430766,0.0007105253],"domain_scores_gemma":[0.99691486,0.00046465092,0.00007891282,0.0018484835,0.00038105887,0.00031204778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026461238,0.00036604193,0.00041930916,0.00020331176,0.0007817433,0.0004078637,0.0013847587,0.00011554779,0.00012515971],"category_scores_gemma":[0.000016338754,0.00031253486,0.00020808587,0.00088967144,0.00010964683,0.00078471797,0.00008881642,0.00044482565,0.00005998086],"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.000030651918,0.00062750344,0.000010416743,0.000011377284,0.00012351162,0.00007929176,0.00024758044,0.013504919,0.0002581606,0.0005311375,0.0011305517,0.98344487],"study_design_scores_gemma":[0.002784763,0.0006778021,0.00040268732,0.000053914187,0.000053707987,0.00018859943,0.00035813576,0.9496602,0.020465719,0.0005291899,0.024258591,0.0005666983],"about_ca_topic_score_codex":0.00014881439,"about_ca_topic_score_gemma":0.000099965124,"teacher_disagreement_score":0.9828782,"about_ca_system_score_codex":0.00008538899,"about_ca_system_score_gemma":0.00027725767,"threshold_uncertainty_score":0.99993265},"labels":[],"label_agreement":null},{"id":"W3210535977","doi":"10.1145/3614094","title":"Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i>","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","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":"Université de Sherbrooke","funders":"","keywords":"Combinatorics; Graph; Mathematics; Time complexity; Degree (music); Tree (set theory); Function (biology); Discrete mathematics; Constant (computer programming); Computer science; Physics","score_opus":0.031538997989108974,"score_gpt":0.303262989034617,"score_spread":0.27172399104550804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210535977","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.0021427225,0.000038143357,0.99140966,0.0030827164,0.0007407068,0.00073218206,0.000100320496,0.00063503755,0.0011184836],"genre_scores_gemma":[0.22841683,0.00047164553,0.75792235,0.0023832922,0.0002586187,0.0013581321,0.000053685853,0.00021876159,0.008916706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786615,0.00010302805,0.00033079038,0.0006401014,0.00034288276,0.0007170506],"domain_scores_gemma":[0.9977031,0.0010647445,0.000053754662,0.00093455944,0.00008634401,0.00015753914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007700645,0.00020861898,0.00024834057,0.0007159714,0.0002828209,0.00010176653,0.0012364819,0.00010741861,0.00003945432],"category_scores_gemma":[0.00012080351,0.00021855837,0.00016122032,0.0021490853,0.00012148881,0.00051124784,0.000036563535,0.0003654542,0.00051138544],"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.00018131308,0.00022118367,0.000015811092,0.000024046141,0.000056958783,0.00006896644,0.00063414883,0.0032688235,0.0069656456,0.0017399199,0.0023540854,0.9844691],"study_design_scores_gemma":[0.015524219,0.002726623,0.00052450737,0.00043658572,0.000063358675,0.00018706077,0.0014597293,0.58918494,0.11389314,0.17993183,0.092711896,0.0033560835],"about_ca_topic_score_codex":0.000015731193,"about_ca_topic_score_gemma":0.000015935082,"teacher_disagreement_score":0.981113,"about_ca_system_score_codex":0.000111586625,"about_ca_system_score_gemma":0.00012186659,"threshold_uncertainty_score":0.89125514},"labels":[],"label_agreement":null},{"id":"W4235156957","doi":"10.1145/3196275","title":"Completeness for First-order Properties on Sparse Structures with Algorithmic Applications","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of California, San Diego; National Science Foundation","keywords":"Tuple; Exponential time hypothesis; Mathematics; Completeness (order theory); Property (philosophy); Combinatorics; Time complexity; Set (abstract data type); Order (exchange); PSPACE; Exponential function; Class (philosophy); Discrete mathematics; Data structure; Algorithm; Computational complexity theory; Computer science","score_opus":0.050926100854386855,"score_gpt":0.26676406540761133,"score_spread":0.21583796455322446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235156957","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.00061680126,0.00004810978,0.99363214,0.0029959627,0.0005559009,0.0013640673,0.000108487504,0.00047222152,0.00020632695],"genre_scores_gemma":[0.20848474,0.00002967548,0.7877857,0.001125556,0.00048584977,0.0016927321,0.000015438518,0.00006154105,0.00031877193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765533,0.000049617367,0.0003460063,0.00090057193,0.0004841912,0.0005642845],"domain_scores_gemma":[0.997243,0.0002559859,0.0001157226,0.0017460192,0.00046460528,0.00017468428],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00016720296,0.0004051044,0.0003328986,0.0003361409,0.0013784914,0.00025960137,0.0017794917,0.00012133546,0.00006499121],"category_scores_gemma":[0.000018716257,0.0003199335,0.00014907827,0.0010410383,0.00046644046,0.0003831388,0.000035105262,0.0003097048,0.00009059356],"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.00020366587,0.000833329,0.0000096789245,0.00008624747,0.00025596347,0.000006583178,0.0013031183,0.0041912743,0.00020623695,0.028358782,0.00033170084,0.96421343],"study_design_scores_gemma":[0.0065734494,0.007685511,0.001914101,0.00036864108,0.00021615747,0.0002867511,0.0006623112,0.6436961,0.03268001,0.142,0.16089272,0.0030241888],"about_ca_topic_score_codex":0.00006266345,"about_ca_topic_score_gemma":0.00014714776,"teacher_disagreement_score":0.9611892,"about_ca_system_score_codex":0.00007539761,"about_ca_system_score_gemma":0.00011274831,"threshold_uncertainty_score":0.99992526},"labels":[],"label_agreement":null},{"id":"W4289389740","doi":"10.1145/3239561","title":"Windrose Planarity","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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; Planar graph; Planarity testing; Mathematics; Planar; Graph drawing; Vertex (graph theory); Monotone polygon; Embedding; Partition (number theory); Planar straight-line graph; Graph; Discrete mathematics; Geometry; Line graph; Pathwidth; Computer science","score_opus":0.02577832039923237,"score_gpt":0.27611472930724423,"score_spread":0.25033640890801184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289389740","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.003360214,0.00001632381,0.99186635,0.0024981834,0.0010342244,0.00008679668,0.000007987364,0.00018908425,0.00094084954],"genre_scores_gemma":[0.7043523,0.0000084969115,0.29338714,0.0009879277,0.00026807893,0.000015797685,0.0000048855572,0.0000070152896,0.0009683257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909055,0.000037348127,0.00015156149,0.00030356896,0.00024364432,0.00017333424],"domain_scores_gemma":[0.99911445,0.00009153498,0.0000333218,0.0005649582,0.000108433196,0.00008727649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001574394,0.000101194906,0.00008531668,0.000156486,0.00033662896,0.000095879615,0.0004925448,0.000053670035,0.00012383658],"category_scores_gemma":[0.000020127034,0.0001003369,0.00005591249,0.00055931165,0.000049342736,0.00035472604,0.000011286258,0.00012583139,0.0004716535],"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.000010419868,0.00019445735,0.000008403278,0.0000027987594,0.000026683925,0.0000068191594,0.00032761417,0.0019245762,0.00035486682,0.0054395595,0.00078790763,0.9909159],"study_design_scores_gemma":[0.002130843,0.0019770842,0.01275781,0.000044245826,0.0000430783,0.00026233098,0.00006901952,0.6837581,0.092396714,0.10846218,0.09695443,0.0011441902],"about_ca_topic_score_codex":0.00001935185,"about_ca_topic_score_gemma":0.000017770824,"teacher_disagreement_score":0.9897717,"about_ca_system_score_codex":0.000033231452,"about_ca_system_score_gemma":0.000056888537,"threshold_uncertainty_score":0.6062309},"labels":[],"label_agreement":null},{"id":"W4300181884","doi":"10.1145/1328911.1328925","title":"Hierarchical bin buffering","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","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":"University of New Brunswick; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bin; Computer science; Mathematics; Theoretical computer science; Algorithm","score_opus":0.033526213156717014,"score_gpt":0.2591905613860787,"score_spread":0.2256643482293617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300181884","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.0040415186,0.000060713843,0.99286276,0.0012318466,0.000719901,0.00011875814,0.000016626596,0.00043206709,0.00051578763],"genre_scores_gemma":[0.25308776,0.00022108354,0.7453219,0.0005303461,0.00014718882,0.000046338657,0.0000064792507,0.000024563675,0.0006143041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841696,0.000056637615,0.00023565945,0.00051311817,0.00041850665,0.0003591076],"domain_scores_gemma":[0.99823195,0.00015347634,0.00004052674,0.0013270848,0.000047217796,0.0001997562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011541931,0.00019588477,0.00018299559,0.00019185393,0.00059326726,0.00007379983,0.0013754064,0.000094807896,0.000096942866],"category_scores_gemma":[0.000018188353,0.00017309318,0.00011660683,0.00047762293,0.000087082495,0.0006172143,0.000055459444,0.00040584223,0.0002724046],"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.000012193343,0.0003054663,0.00001780508,0.000005438209,0.000027592887,0.00013532086,0.00042416088,0.0008890948,0.0004563938,0.0011995449,0.0005888412,0.9959381],"study_design_scores_gemma":[0.004402859,0.0014485616,0.015018904,0.00019483009,0.000045291497,0.0023095892,0.00010464333,0.8008988,0.048020624,0.021714412,0.10338373,0.0024577654],"about_ca_topic_score_codex":0.000060771385,"about_ca_topic_score_gemma":0.0000026478651,"teacher_disagreement_score":0.9934804,"about_ca_system_score_codex":0.00005374766,"about_ca_system_score_gemma":0.000065638545,"threshold_uncertainty_score":0.7058535},"labels":[],"label_agreement":null},{"id":"W4318820632","doi":"10.1145/3582500","title":"Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Alberta","funders":"","keywords":"Mathematics; Combinatorics; Approximation algorithm; Bounded function; Vehicle routing problem; Euclidean geometry; Treewidth; Discrete mathematics; Graph; Routing (electronic design automation); Pathwidth; Computer science; Line graph","score_opus":0.05042969397683607,"score_gpt":0.3004710953604926,"score_spread":0.25004140138365655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318820632","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.17752542,0.000014075308,0.8190044,0.00023344271,0.0007340459,0.000661167,0.00008505082,0.0016244601,0.000117936615],"genre_scores_gemma":[0.6778869,0.00005124642,0.32128644,0.000043243213,0.000045952096,0.00017501826,0.00008796405,0.00012012928,0.00030308275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998061,0.00010958361,0.00063276844,0.00037977612,0.00036695143,0.00044992406],"domain_scores_gemma":[0.9981407,0.00086038763,0.00013373098,0.0005798304,0.00018122018,0.0001041305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081939896,0.0002981848,0.0003919572,0.00063050335,0.00037624108,0.000079933016,0.00026208663,0.00021356945,0.000043337637],"category_scores_gemma":[0.00028075217,0.00028751427,0.00019919443,0.0016167519,0.00007340715,0.00025195754,0.000006386779,0.0002966208,0.000025683537],"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.00042957222,0.0003395802,0.0000451217,0.00039308076,0.00042614422,0.0000057673287,0.002086816,0.71841425,0.03553833,0.0016282311,0.00032270525,0.24037042],"study_design_scores_gemma":[0.0017931082,0.00025160558,0.00013449133,0.00012749077,0.00006499189,0.000003187242,0.00027782298,0.85787755,0.13703199,0.00170529,0.0004179436,0.00031451235],"about_ca_topic_score_codex":0.000021884496,"about_ca_topic_score_gemma":0.000012492449,"teacher_disagreement_score":0.5003615,"about_ca_system_score_codex":0.00013739131,"about_ca_system_score_gemma":0.000043743763,"threshold_uncertainty_score":0.9999577},"labels":[],"label_agreement":null},{"id":"W4327814720","doi":"10.1145/3588437","title":"Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"","keywords":"Treasure; Combinatorics; Mathematics; Graph; Discrete mathematics; Node (physics); Algorithm; Computer science","score_opus":0.035051444683297794,"score_gpt":0.288405559114852,"score_spread":0.2533541144315542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327814720","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.004474002,0.000016810525,0.9908914,0.0024806145,0.00046185424,0.00033816742,0.0000217907,0.0007059787,0.00060935784],"genre_scores_gemma":[0.7584311,0.0003393387,0.23756845,0.0006072823,0.00004053889,0.00028897208,0.00003059659,0.000054783144,0.002638956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998226,0.00012140652,0.00030072962,0.00048537023,0.00040552314,0.00046095427],"domain_scores_gemma":[0.99869263,0.00021841754,0.00004152642,0.00080304855,0.000078239966,0.0001661154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003259152,0.00018646417,0.0001873881,0.0006984965,0.00022631935,0.00013806373,0.00091996306,0.00010672229,0.00010310522],"category_scores_gemma":[0.00003977181,0.00018058937,0.00010550732,0.0025036747,0.000059191505,0.00036559004,0.000022949827,0.0003252817,0.0004317431],"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.000029597068,0.00057597813,0.00012287518,0.000029100998,0.000059747887,0.0002546066,0.002144704,0.10996587,0.0002580203,0.0024523987,0.00033491108,0.8837722],"study_design_scores_gemma":[0.0012026923,0.0003287623,0.004805686,0.000044674154,0.000009920333,0.000028875396,0.00012400099,0.9865959,0.000639135,0.0040462827,0.0017962159,0.000377836],"about_ca_topic_score_codex":0.00004813733,"about_ca_topic_score_gemma":0.000045235494,"teacher_disagreement_score":0.88339436,"about_ca_system_score_codex":0.000059121037,"about_ca_system_score_gemma":0.00009512836,"threshold_uncertainty_score":0.7364221},"labels":[],"label_agreement":null},{"id":"W4386326626","doi":"10.1145/3617996","title":"A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Polynomial and algebraic computation","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":"","keywords":"Mathematics; Invertible matrix; Integer (computer science); Combinatorics; Dimension (graph theory); Matrix multiplication; Matrix (chemical analysis); Multiplication (music); Hermite polynomials; Bounded function; Integer matrix; Freivalds' algorithm; Binary logarithm; Discrete mathematics; Algorithm; Symmetric matrix; Mathematical analysis; Pure mathematics; Computer science","score_opus":0.01897168193906021,"score_gpt":0.28207983003865267,"score_spread":0.2631081480995925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386326626","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.0075026345,0.000035568297,0.98898846,0.0017683667,0.0009180532,0.00040518085,0.000032230502,0.00031262691,0.00003688316],"genre_scores_gemma":[0.48435694,0.000022846138,0.51409805,0.00036324395,0.00026559422,0.00008268629,0.000015385913,0.000038393886,0.0007568433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854404,0.00004883851,0.00037740014,0.00034596355,0.00029592687,0.00038785682],"domain_scores_gemma":[0.99825794,0.00078534684,0.0001282699,0.0006266471,0.00012646841,0.00007533571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046285108,0.00018375581,0.00022054576,0.00026247423,0.00042438554,0.0000983956,0.0009700337,0.000071828734,0.000008744961],"category_scores_gemma":[0.000035225195,0.00014321093,0.00024549803,0.001129551,0.00007612217,0.00030223528,0.00004952799,0.0002089224,0.000052887615],"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.0000061204055,0.00006122353,0.0000015591862,0.00001389781,0.000046129986,0.0000036934807,0.0011850315,0.0026168178,0.0001723755,0.000564709,0.000119256314,0.99520916],"study_design_scores_gemma":[0.0006240787,0.00019111003,0.00034608875,0.000042799173,0.000024801097,0.000032294975,0.0001423155,0.9851027,0.0052294326,0.006712237,0.0013628626,0.00018927538],"about_ca_topic_score_codex":0.000058019403,"about_ca_topic_score_gemma":0.00000919994,"teacher_disagreement_score":0.9950199,"about_ca_system_score_codex":0.00004459544,"about_ca_system_score_gemma":0.00008894457,"threshold_uncertainty_score":0.5839972},"labels":[],"label_agreement":null},{"id":"W4401390257","doi":"10.1145/3686798","title":"Automorphisms and Isomorphisms of Maps in Linear Time","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agentúra na Podporu Výskumu a Vývoja; Grantová Agentura České Republiky","keywords":"Automorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.018948114718378872,"score_gpt":0.2882847886829304,"score_spread":0.2693366739645515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401390257","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.0040168366,0.00043748706,0.99285483,0.0016913008,0.0003232968,0.0002024772,0.000044154953,0.00022590753,0.00020372211],"genre_scores_gemma":[0.52286565,0.00040333,0.472747,0.00017183118,0.000052991618,0.00008845542,0.0000064614637,0.000055825814,0.0036084368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987295,0.0000774048,0.00023309035,0.0004140002,0.00028716732,0.00025882028],"domain_scores_gemma":[0.9988322,0.00037129677,0.000021627235,0.0006428067,0.000041698597,0.00009032317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036189728,0.00013606464,0.00018367865,0.0005368525,0.00006463061,0.00005099104,0.0006310869,0.000074847,0.00008158011],"category_scores_gemma":[0.00002250284,0.000128445,0.00006628957,0.001079701,0.00016012804,0.00041261033,0.000029057901,0.00035350406,0.00014867666],"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.000031268326,0.00025435796,0.000013174379,0.00007931012,0.00006401921,0.00018690409,0.0010563988,0.002236562,0.006861897,0.016246783,0.00012605183,0.9728433],"study_design_scores_gemma":[0.0010780969,0.0007644742,0.00049202214,0.00030995562,0.00002037942,0.00018660892,0.000067509005,0.77122694,0.033780254,0.18585518,0.005684709,0.0005338395],"about_ca_topic_score_codex":0.000021979817,"about_ca_topic_score_gemma":0.0000046025752,"teacher_disagreement_score":0.9723094,"about_ca_system_score_codex":0.000041687006,"about_ca_system_score_gemma":0.00006082088,"threshold_uncertainty_score":0.5237835},"labels":[],"label_agreement":null},{"id":"W4401422447","doi":"10.1145/3677608","title":"Tight Bounds for Monotone Minimal Perfect Hashing","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Research Laboratory; Hertz Foundation","keywords":"Combinatorics; Upper and lower bounds; Bounded function; Mathematics; Hash function; Perfect hash function; Monotone polygon; Omega; Binary logarithm; Discrete mathematics; Chromatic scale; Hash table; Physics; Computer science","score_opus":0.02788054483978671,"score_gpt":0.29489105201843646,"score_spread":0.26701050717864977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401422447","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.00065187213,0.0005447164,0.9929111,0.0022863587,0.0022315802,0.00033199412,0.00011358706,0.000667288,0.00026151974],"genre_scores_gemma":[0.15972097,0.00014327213,0.8364787,0.00038081722,0.00046467705,0.00033517872,0.000033338096,0.00006141005,0.002381604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982151,0.000039503164,0.00027437686,0.0007306785,0.0003294903,0.0004108915],"domain_scores_gemma":[0.9983145,0.000417926,0.00003308113,0.0010227755,0.00006241529,0.00014929555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000295415,0.00024642964,0.00020710111,0.0002599991,0.00050819287,0.0007574212,0.0011364466,0.00012085653,0.000077565826],"category_scores_gemma":[0.000021659274,0.00021232353,0.00022531005,0.00048956857,0.00005005726,0.0011565094,0.00003836103,0.00032607012,0.00015098609],"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.000016881862,0.00013703456,0.0000010321381,0.00004567843,0.00006840654,0.000028832514,0.00049168937,0.00044402143,0.0008617094,0.0027322373,0.002194293,0.99297816],"study_design_scores_gemma":[0.00049544114,0.0004343038,0.00008670036,0.00013675516,0.000040898176,0.000067699744,0.00003903545,0.83947396,0.006944994,0.0054205507,0.14645089,0.00040875934],"about_ca_topic_score_codex":0.00004256565,"about_ca_topic_score_gemma":0.0000054540155,"teacher_disagreement_score":0.99256945,"about_ca_system_score_codex":0.0000870143,"about_ca_system_score_gemma":0.000113615766,"threshold_uncertainty_score":0.8658302},"labels":[],"label_agreement":null},{"id":"W4410156455","doi":"10.1145/3734525","title":"A \\(\\boldsymbol{O}(\\textbf{log}\\,\\boldsymbol{k})\\) -Approximation for <scp>Directed Steiner Tree</scp> in Planar Graphs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Planar; Binary logarithm; Approximation algorithm; Planar graph; Discrete mathematics; Tree (set theory); Computer science; Graph","score_opus":0.02066447745728899,"score_gpt":0.29402476052985693,"score_spread":0.27336028307256793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410156455","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.0060089575,0.000230144,0.98770946,0.001229955,0.0006692116,0.0013992357,0.00007496138,0.00070528005,0.0019727945],"genre_scores_gemma":[0.26406243,0.00030246348,0.71939653,0.0010409938,0.00009190176,0.0028270066,0.00007692207,0.00012636719,0.0120753655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965473,0.0002757859,0.0006324741,0.0010830789,0.00054892804,0.0009124472],"domain_scores_gemma":[0.9958778,0.0018796773,0.0001222609,0.0016521985,0.00027772915,0.00019031114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080889266,0.00043061026,0.0004949875,0.0017913735,0.00042803,0.00019126303,0.0019451571,0.00027606453,0.00001118004],"category_scores_gemma":[0.00036786863,0.00043417848,0.0002896633,0.0036991243,0.00016097206,0.000698727,0.000038642876,0.0006347444,0.000041023402],"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.0000840327,0.00096424046,0.00011863597,0.00012296264,0.00020016299,0.000025690177,0.0012572722,0.0022693179,0.003958604,0.06424094,0.00066457345,0.9260936],"study_design_scores_gemma":[0.007734815,0.00089413085,0.0064140013,0.00040423218,0.00009998642,0.000035941157,0.00090561155,0.2815502,0.05374759,0.6362617,0.011216495,0.00073531683],"about_ca_topic_score_codex":0.000071412534,"about_ca_topic_score_gemma":0.00026475542,"teacher_disagreement_score":0.92535824,"about_ca_system_score_codex":0.00019448785,"about_ca_system_score_gemma":0.00018185207,"threshold_uncertainty_score":0.999811},"labels":[],"label_agreement":null},{"id":"W4412202024","doi":"10.1145/3747591","title":"Minimum Plane Bichromatic Spanning Trees","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Spanning tree; Combinatorics; Plane (geometry); Mathematics; Minimum degree spanning tree; Computer science; Discrete mathematics; Physics; Geometry","score_opus":0.01779323630805467,"score_gpt":0.265220523802979,"score_spread":0.24742728749492432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412202024","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.00062963774,0.00008596882,0.9905046,0.0034758789,0.0012764175,0.00021396844,0.000019329642,0.00046611048,0.0033280668],"genre_scores_gemma":[0.12610066,0.00014828774,0.84966046,0.0023459606,0.00013647924,0.00014317648,0.000036073685,0.00003234845,0.021396529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848706,0.00004793372,0.00029211963,0.00051257655,0.0003007804,0.00035952093],"domain_scores_gemma":[0.99825597,0.0002003401,0.000056262557,0.0013722178,0.00003448027,0.000080741636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021175809,0.00021847212,0.00021638333,0.00046391384,0.00031099515,0.00029818134,0.0017933968,0.000069173235,0.00008489379],"category_scores_gemma":[0.000024710303,0.00020657732,0.00010459761,0.0009986024,0.00005415593,0.00070161367,0.000057828936,0.00021589365,0.00025517147],"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.0000052636287,0.00020664131,0.000009601701,0.000026683485,0.00011709867,0.00003222331,0.00017865376,0.0005480271,0.00013228135,0.0023192703,0.002537707,0.99388653],"study_design_scores_gemma":[0.0032663213,0.00052492274,0.004063834,0.0004786851,0.00021197117,0.00003651185,0.0005606068,0.8801373,0.006517561,0.019413501,0.08349192,0.0012968536],"about_ca_topic_score_codex":0.000046462555,"about_ca_topic_score_gemma":0.00001573561,"teacher_disagreement_score":0.9925897,"about_ca_system_score_codex":0.000049683313,"about_ca_system_score_gemma":0.00004910575,"threshold_uncertainty_score":0.84239787},"labels":[],"label_agreement":null},{"id":"W4413279381","doi":"10.1145/3750729","title":"Fast and Small Subsampled R-indexes","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Agencia Nacional de Investigación y Desarrollo","keywords":"Mathematics; Computer science; Combinatorics; Statistics","score_opus":0.01821862947291441,"score_gpt":0.25692759636670964,"score_spread":0.23870896689379523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413279381","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.0015055325,0.00017309113,0.9949198,0.0018244418,0.0006389882,0.00015920315,0.000027063348,0.00025594013,0.0004959382],"genre_scores_gemma":[0.12158421,0.0003451053,0.8739098,0.0013019845,0.000072197916,0.00008667275,0.000011344641,0.000021082918,0.0026676594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988001,0.000048406957,0.00020630285,0.0005071131,0.00017098375,0.0002670665],"domain_scores_gemma":[0.99854773,0.00021126546,0.00003813856,0.0010400212,0.00005827446,0.000104570674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014511256,0.00018269157,0.00017998871,0.00023657196,0.00037271212,0.00020953805,0.00092301256,0.00009243596,0.00003076927],"category_scores_gemma":[0.00001976364,0.00016215272,0.000064829415,0.0005001812,0.00006107454,0.00035848064,0.00006596818,0.00024154075,0.0000282875],"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.00000781968,0.00010219013,0.000037054564,0.000010131684,0.000029261397,0.0000065949575,0.00011609615,0.00016134577,0.00014265616,0.0028672405,0.00016153068,0.9963581],"study_design_scores_gemma":[0.006362795,0.0008634792,0.032439522,0.00056315144,0.00017555288,0.00015448776,0.00042716533,0.75071985,0.032547787,0.08735671,0.08623747,0.0021520539],"about_ca_topic_score_codex":0.0001303943,"about_ca_topic_score_gemma":0.000036193804,"teacher_disagreement_score":0.994206,"about_ca_system_score_codex":0.000030864896,"about_ca_system_score_gemma":0.000058810085,"threshold_uncertainty_score":0.66123956},"labels":[],"label_agreement":null}]}