{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013888273,0.0027853472,0.9673542,0.0010235761,0.00023157045,0.00013217848,0.00032565885,0.0011177302,0.013141443],"genre_scores_gemma":[0.18026471,0.0020301961,0.8076468,0.00051490695,0.0003823886,0.0003075745,0.0010512148,0.0003702095,0.0074320855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961727,0.0010903676,0.000213805,0.0006726407,0.0012820321,0.0005684487],"domain_scores_gemma":[0.9962908,0.0018173744,0.00032441685,0.000810179,0.00056914287,0.0001880299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028785684,0.0020152694,0.0022419645,0.0018459766,0.0010659395,0.0032160608,0.0035609894,0.0025733588,0.010295276],"category_scores_gemma":[0.01143874,0.00090189045,0.0021341152,0.0053552077,0.0008741632,0.0058042626,0.0033985432,0.005152491,0.0024060511],"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.00053012645,0.0006334723,0.00096206216,0.00046950032,0.00013277476,0.00013114832,0.0003369464,0.57403964,0.0022814996,0.15508226,0.018526023,0.24687451],"study_design_scores_gemma":[0.000051925614,0.000055923792,0.00015760203,0.000033000953,0.00002040404,0.000091502494,0.00006464422,0.91803366,0.00063583435,0.07403382,0.006807454,0.000014277364],"about_ca_topic_score_codex":0.006337186,"about_ca_topic_score_gemma":0.00801881,"teacher_disagreement_score":0.010295276,"about_ca_system_score_codex":0.0033643337,"about_ca_system_score_gemma":0.0025887117,"threshold_uncertainty_score":0.034441113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013345292,0.00011319804,0.98332983,0.00017621598,0.000028063725,0.000040267343,0.00014021671,0.00042138345,0.002405591],"genre_scores_gemma":[0.37326273,0.0005528182,0.61590075,0.0002955066,0.00013337155,0.0002245927,0.0012236095,0.00033139967,0.00807518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914944,0.00025634433,0.000040536015,0.00021977583,0.00026701062,0.00006692443],"domain_scores_gemma":[0.9975319,0.0013881284,0.00024590897,0.00044912327,0.00029904197,0.00008583186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007991502,0.00096193294,0.00083158724,0.00060145283,0.00041298862,0.0011770054,0.0010262517,0.00067583413,0.0048167924],"category_scores_gemma":[0.006096715,0.0005233166,0.0004938629,0.0009349648,0.001098708,0.002425955,0.0012090869,0.0020313002,0.0012791546],"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.0002919153,0.00014589913,0.0010810161,0.0003882426,0.00007527999,0.00021623942,0.00027124645,0.4906207,0.01704042,0.25651306,0.0116269635,0.22172907],"study_design_scores_gemma":[0.000016530948,0.000042300908,0.00017925062,0.000015817446,0.0000060274333,0.00009210854,0.000049129238,0.89369917,0.004903787,0.09779482,0.0031883847,0.000012643896],"about_ca_topic_score_codex":0.00091843156,"about_ca_topic_score_gemma":0.0018707971,"teacher_disagreement_score":0.0048167924,"about_ca_system_score_codex":0.00047959638,"about_ca_system_score_gemma":0.00055530627,"threshold_uncertainty_score":0.016113818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05798138,0.0015985324,0.92771095,0.0009923261,0.00014971143,0.00011994518,0.00042735745,0.0006799697,0.010339956],"genre_scores_gemma":[0.22923437,0.0021361674,0.7541631,0.000169495,0.00012812481,0.00025232462,0.0011181771,0.0002874034,0.012510872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994748,0.00014925798,0.000034937013,0.00013160857,0.00012857642,0.00008087341],"domain_scores_gemma":[0.99943846,0.0002756828,0.000070775415,0.000091105656,0.0000810973,0.000042766544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553426,0.00064748153,0.000853118,0.00082736026,0.00076434633,0.001336672,0.001711697,0.00094663276,0.005079574],"category_scores_gemma":[0.003313895,0.00063868845,0.0009209799,0.0015234787,0.0005793916,0.004679732,0.0011157183,0.001188605,0.0010698778],"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.00030039775,0.00014377761,0.00137236,0.0003133929,0.00005388396,0.00025421847,0.00030154787,0.56498414,0.00267089,0.21633601,0.02068902,0.19258039],"study_design_scores_gemma":[0.00003088386,0.00005484168,0.0002065141,0.0000274065,0.0000140986585,0.00011109037,0.00011822768,0.91914225,0.0009020183,0.06741144,0.011969275,0.0000119060605],"about_ca_topic_score_codex":0.013614399,"about_ca_topic_score_gemma":0.011338406,"teacher_disagreement_score":0.013614399,"about_ca_system_score_codex":0.001327205,"about_ca_system_score_gemma":0.00097210385,"threshold_uncertainty_score":0.027070284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026183907,0.0008221354,0.9676049,0.0003661939,0.00009070607,0.000093488154,0.000091765476,0.0012918608,0.0034550035],"genre_scores_gemma":[0.2813222,0.0006384884,0.71402043,0.00022951818,0.000105101026,0.00022656292,0.0004161808,0.00023547989,0.002806069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881953,0.00029019534,0.00006718026,0.00018233802,0.0003670787,0.00027363564],"domain_scores_gemma":[0.99817395,0.0011122172,0.00017029796,0.00029941087,0.00013661163,0.00010757472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017032138,0.0012625513,0.001364833,0.00086405315,0.0010227798,0.0012374411,0.0023236023,0.0014623188,0.0035222599],"category_scores_gemma":[0.0055209436,0.0006342754,0.0008081175,0.0019435596,0.0007155018,0.0030318797,0.0014333411,0.0016332266,0.00093775545],"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.0009299348,0.00026565135,0.00089844357,0.00031827996,0.000092841285,0.0001635412,0.00026611311,0.7870507,0.005123532,0.028085992,0.006320035,0.17048489],"study_design_scores_gemma":[0.000105095416,0.0000748439,0.000082324514,0.000012851073,0.000018018569,0.00007086686,0.000030224905,0.98049265,0.0006465107,0.017038023,0.0014200113,0.0000086391565],"about_ca_topic_score_codex":0.0050498326,"about_ca_topic_score_gemma":0.006159305,"teacher_disagreement_score":0.0050498326,"about_ca_system_score_codex":0.0018835776,"about_ca_system_score_gemma":0.002409705,"threshold_uncertainty_score":0.013666391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05079519,0.00035705068,0.9419153,0.00064013794,0.00014095323,0.000099500096,0.0003084538,0.00058341504,0.005160034],"genre_scores_gemma":[0.82603705,0.00028330577,0.1687361,0.00023982838,0.000100502846,0.000114419265,0.0003943531,0.000074601594,0.0040198094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982893,0.00048101295,0.000067310975,0.00043902398,0.00037718212,0.00034620348],"domain_scores_gemma":[0.99872273,0.0004905696,0.00020275975,0.00026404308,0.00018087495,0.00013904157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082994974,0.0007319556,0.0013006254,0.00046802993,0.00068012613,0.001231962,0.0023891623,0.0015495664,0.0040942305],"category_scores_gemma":[0.0033358638,0.00037007406,0.00082389,0.0013021141,0.0007266506,0.0022364173,0.0014221511,0.0011599411,0.00057011243],"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.0002435512,0.0000923394,0.0005221599,0.00009651252,0.000044188928,0.00023569462,0.000049613205,0.9257096,0.0013553164,0.029265275,0.0040239464,0.03836182],"study_design_scores_gemma":[0.00003079296,0.00007900766,0.00015090479,0.0000068045338,0.000011387595,0.00016123637,0.00003842965,0.97074866,0.0011686079,0.02511506,0.0024763744,0.000012747446],"about_ca_topic_score_codex":0.0027835655,"about_ca_topic_score_gemma":0.0023782765,"teacher_disagreement_score":0.0040942305,"about_ca_system_score_codex":0.0015839369,"about_ca_system_score_gemma":0.0008961743,"threshold_uncertainty_score":0.013696611},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15336055,0.0018642497,0.8220466,0.0029468206,0.0002263228,0.00033503366,0.0014477968,0.012405573,0.005367051],"genre_scores_gemma":[0.67798835,0.00029224402,0.31463677,0.00067984476,0.00024487372,0.00050463027,0.0018839771,0.000682841,0.0030864822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992273,0.0018841857,0.0006749134,0.0020488838,0.0024463253,0.0006727013],"domain_scores_gemma":[0.9459424,0.035304967,0.0037136448,0.012074487,0.0019069957,0.0010574892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045530093,0.0016855242,0.0019702353,0.001695549,0.0011316484,0.0035263612,0.0043142824,0.0020684632,0.006036583],"category_scores_gemma":[0.037322037,0.00090652815,0.0017176095,0.0025381674,0.0024455797,0.011258714,0.0039582714,0.0030437736,0.0025014624],"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.0073965434,0.0012369844,0.025942082,0.0011160083,0.0005133266,0.00093466375,0.0010473074,0.4024591,0.022721224,0.056652665,0.015929695,0.4640504],"study_design_scores_gemma":[0.00020098232,0.00026613113,0.0009972473,0.00003480957,0.000055496035,0.00023293443,0.000118508455,0.9378298,0.0062256935,0.052383553,0.0016270666,0.000027753642],"about_ca_topic_score_codex":0.0025595387,"about_ca_topic_score_gemma":0.0039723455,"teacher_disagreement_score":0.006036583,"about_ca_system_score_codex":0.002052244,"about_ca_system_score_gemma":0.0033661968,"threshold_uncertainty_score":0.024078906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14099723,0.0014697098,0.83882993,0.0020535218,0.0002689703,0.00020948467,0.0019494852,0.0032300563,0.010991626],"genre_scores_gemma":[0.38660398,0.0009689777,0.6023071,0.00048647693,0.00014784462,0.00025392772,0.0022694103,0.0003606101,0.0066015995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929464,0.000118653305,0.00011193659,0.0001353348,0.00025374023,0.00008565549],"domain_scores_gemma":[0.9976215,0.00082601147,0.00020530017,0.00096335047,0.0002830609,0.000100867466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063844625,0.00042887352,0.0008815259,0.00074310496,0.00064441847,0.0018192452,0.0013603282,0.0009118584,0.0045913956],"category_scores_gemma":[0.0041511077,0.0004217413,0.0005690484,0.0027198547,0.001234524,0.005531064,0.0022234472,0.0019609893,0.001260577],"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.0008690734,0.0003108799,0.0019954776,0.0005548705,0.000043691813,0.0005333515,0.0013471992,0.11766466,0.028893255,0.49464113,0.015884008,0.33726245],"study_design_scores_gemma":[0.000128855,0.000336973,0.000580102,0.00018453649,0.000049688308,0.0007025794,0.00055767194,0.4574439,0.047231317,0.44763157,0.045042817,0.000110017674],"about_ca_topic_score_codex":0.0012214925,"about_ca_topic_score_gemma":0.0022265573,"teacher_disagreement_score":0.0045913956,"about_ca_system_score_codex":0.001253064,"about_ca_system_score_gemma":0.00075938,"threshold_uncertainty_score":0.015359759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07369122,0.006154881,0.8527517,0.010268671,0.0006889009,0.00051511877,0.0014031654,0.003828711,0.05069763],"genre_scores_gemma":[0.67763245,0.0038816303,0.28080806,0.003990192,0.0028251798,0.0020075715,0.002093577,0.003462176,0.023299046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97882915,0.0047334386,0.00096137205,0.004519468,0.0062972824,0.0046592443],"domain_scores_gemma":[0.8934503,0.080473036,0.0053162556,0.01422699,0.0038612657,0.0026721477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010638444,0.0036657616,0.004645961,0.003003168,0.0039486857,0.008690389,0.008493712,0.004247738,0.026527558],"category_scores_gemma":[0.05833688,0.0019533928,0.004831475,0.006526199,0.006574535,0.033675183,0.009762943,0.0115923835,0.0053468077],"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.004937831,0.0015816633,0.007687297,0.0019903968,0.00044006124,0.0005660555,0.0011063063,0.2530101,0.027883211,0.4696181,0.034481134,0.1966978],"study_design_scores_gemma":[0.00035524918,0.0007681978,0.0015292787,0.00019045536,0.00028786273,0.00067486335,0.00026019788,0.46524003,0.01570187,0.5023503,0.012518583,0.0001230619],"about_ca_topic_score_codex":0.0019681521,"about_ca_topic_score_gemma":0.0023157045,"teacher_disagreement_score":0.026527558,"about_ca_system_score_codex":0.007550335,"about_ca_system_score_gemma":0.0060105743,"threshold_uncertainty_score":0.08874351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045016456,0.006702941,0.85695356,0.0055057467,0.0005147225,0.0001944699,0.00056402665,0.001070456,0.08347771],"genre_scores_gemma":[0.6832012,0.007188313,0.22784585,0.0033737195,0.0020827565,0.0010266084,0.0010522138,0.0018236869,0.07240562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977653,0.0005136454,0.00007324868,0.00035608624,0.00070675806,0.00058496016],"domain_scores_gemma":[0.98848337,0.008051382,0.00085556775,0.0006945694,0.0012089086,0.00070612016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046323426,0.0023722292,0.0019911474,0.0029227827,0.0023571365,0.003304322,0.0044508595,0.0020823912,0.024697045],"category_scores_gemma":[0.024715126,0.0010743974,0.0016812122,0.0025329406,0.0023435426,0.008018826,0.0023494374,0.004851244,0.0035020607],"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.0005041678,0.00016114708,0.0010472215,0.000480175,0.00013181448,0.0001490401,0.00034016013,0.19440739,0.004331013,0.73684305,0.018120596,0.043484163],"study_design_scores_gemma":[0.00006118338,0.00012859423,0.00025415092,0.00007838477,0.00007430747,0.00008648786,0.000047227928,0.6971189,0.0018699577,0.2895996,0.010645054,0.00003618895],"about_ca_topic_score_codex":0.004638243,"about_ca_topic_score_gemma":0.002854036,"teacher_disagreement_score":0.024697045,"about_ca_system_score_codex":0.0050152787,"about_ca_system_score_gemma":0.0028185023,"threshold_uncertainty_score":0.082619786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44917962,0.0012108523,0.5105912,0.008906052,0.00024293228,0.00035561665,0.00021722192,0.0016072892,0.02768909],"genre_scores_gemma":[0.79494214,0.0004172981,0.19765861,0.00030430287,0.00020433338,0.00014759356,0.00022733815,0.00012550017,0.0059729237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974583,0.00086556794,0.00013203768,0.00039153587,0.00070110406,0.0004515531],"domain_scores_gemma":[0.9961957,0.0024603005,0.00026604914,0.0006637912,0.00023547013,0.0001787393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024626416,0.0005745307,0.0010099723,0.0007209995,0.0018310691,0.0019862186,0.0012617517,0.0013952139,0.004470493],"category_scores_gemma":[0.0071464353,0.00034365186,0.00088828726,0.0013425491,0.00314762,0.005229886,0.0030469208,0.0027362145,0.00046140925],"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.0005545447,0.00018868475,0.00095339643,0.00017847455,0.00005924859,0.00012111045,0.0009210993,0.070681795,0.0033801626,0.8519968,0.0074649896,0.06349972],"study_design_scores_gemma":[0.00016958684,0.000057968777,0.00017889627,0.00001884794,0.00001549037,0.000041952033,0.00016312195,0.21203087,0.0032767965,0.7795258,0.0044954405,0.000025234349],"about_ca_topic_score_codex":0.0024381392,"about_ca_topic_score_gemma":0.0025108554,"teacher_disagreement_score":0.004470493,"about_ca_system_score_codex":0.003106726,"about_ca_system_score_gemma":0.0028728722,"threshold_uncertainty_score":0.022540987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29513833,0.0010198377,0.68290263,0.0010927164,0.00020559071,0.00025308115,0.0016241657,0.0019454573,0.015818167],"genre_scores_gemma":[0.5402731,0.0008406709,0.4477778,0.00027248962,0.00009376676,0.0001841606,0.0037370191,0.0002681167,0.006552846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843735,0.00035617335,0.0001515892,0.00044360175,0.00032542384,0.0002858499],"domain_scores_gemma":[0.99756694,0.0010195165,0.00031513604,0.00072888006,0.00014390932,0.00022570026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063624,0.0009501966,0.0020358039,0.0008327945,0.000871489,0.001499927,0.0017423931,0.0017859235,0.006784866],"category_scores_gemma":[0.0053030215,0.00088073796,0.0009217621,0.002453231,0.0007084119,0.0043121525,0.0028740088,0.0014136066,0.0015394703],"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.0021799644,0.0007516471,0.0044853436,0.0008832688,0.00027289032,0.0015824114,0.000825709,0.5638075,0.042697687,0.09296226,0.021434996,0.26811638],"study_design_scores_gemma":[0.00014726925,0.00042263314,0.0011120496,0.00006696256,0.000084909596,0.0009130156,0.0003322941,0.85163283,0.017311182,0.11637325,0.011565515,0.000038155424],"about_ca_topic_score_codex":0.00067213725,"about_ca_topic_score_gemma":0.0009874951,"teacher_disagreement_score":0.006784866,"about_ca_system_score_codex":0.00059677626,"about_ca_system_score_gemma":0.00061972823,"threshold_uncertainty_score":0.022697628},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03605752,0.00425225,0.9162286,0.0056390376,0.00041216973,0.00012097076,0.00021271137,0.0023640795,0.03471271],"genre_scores_gemma":[0.59258795,0.0031450682,0.3941301,0.0019724164,0.0006825105,0.00032448303,0.00042981483,0.0010658563,0.0056617754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98840255,0.0055494234,0.0003943743,0.0021058754,0.0022234146,0.0013244252],"domain_scores_gemma":[0.98013455,0.011909389,0.0011308935,0.004574924,0.0015861605,0.00066413515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017298473,0.0030416138,0.0032243705,0.002384929,0.0017499753,0.009009302,0.004750901,0.0054715704,0.007339685],"category_scores_gemma":[0.060543276,0.001330901,0.0022397703,0.003534818,0.0030348701,0.023326108,0.0043129246,0.004859852,0.006228587],"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.0011417788,0.0007406763,0.003786909,0.0004527938,0.0004289908,0.00009167365,0.0003212919,0.24239856,0.0021717083,0.3788383,0.01770159,0.35192567],"study_design_scores_gemma":[0.00009227427,0.0002262084,0.00043621648,0.000101221274,0.00006877393,0.00016916152,0.00018520768,0.59651065,0.0029417234,0.39296836,0.006254827,0.00004544058],"about_ca_topic_score_codex":0.0020200077,"about_ca_topic_score_gemma":0.0012013797,"teacher_disagreement_score":0.017298473,"about_ca_system_score_codex":0.0021743774,"about_ca_system_score_gemma":0.0029866134,"threshold_uncertainty_score":0.09148419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02680992,0.00086270407,0.9637966,0.00039820164,0.00007465348,0.00017394208,0.00030324556,0.0024208291,0.0051598665],"genre_scores_gemma":[0.24537545,0.00088968925,0.7471839,0.00022380856,0.00012262071,0.00038304488,0.000899138,0.00049131544,0.0044308836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983595,0.00036761645,0.0001287211,0.00045671946,0.00041794704,0.00026945732],"domain_scores_gemma":[0.9965043,0.0015798023,0.000459091,0.0010002875,0.00029132576,0.00016525495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093687314,0.0019283391,0.0012206481,0.0012365439,0.0008554681,0.0012981156,0.0030634692,0.0011837166,0.0050998908],"category_scores_gemma":[0.0070679807,0.0006329933,0.00093680574,0.002199797,0.00083821896,0.004220094,0.0027416432,0.0012544116,0.0022190467],"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.00073031546,0.0006780012,0.0017026218,0.00087793195,0.00014561649,0.00022316971,0.0003086334,0.35283947,0.03248771,0.06356475,0.017816389,0.5286253],"study_design_scores_gemma":[0.000250477,0.00032922553,0.00038658685,0.000053109357,0.00007704356,0.00037362624,0.00009237145,0.8547023,0.025265623,0.10685069,0.011555784,0.00006310195],"about_ca_topic_score_codex":0.00089305796,"about_ca_topic_score_gemma":0.001637365,"teacher_disagreement_score":0.0050998908,"about_ca_system_score_codex":0.0010136106,"about_ca_system_score_gemma":0.0014030802,"threshold_uncertainty_score":0.017060816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13409266,0.00022080237,0.83090025,0.00031064302,0.00008015569,0.00020847234,0.00034887064,0.00086117414,0.03297698],"genre_scores_gemma":[0.5329524,0.00024014496,0.44622844,0.00018033775,0.000022470882,0.00025764972,0.0005142016,0.0002787378,0.0193256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997193,0.00005235943,0.000018395007,0.000077473946,0.000058679223,0.00007386082],"domain_scores_gemma":[0.9996294,0.000112116846,0.00004907186,0.00009597492,0.00007079676,0.000042673342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027482046,0.00039018015,0.0002952424,0.00053891045,0.0009748803,0.00060598966,0.0006879102,0.0004749994,0.0067725442],"category_scores_gemma":[0.0013360967,0.00028878808,0.00050590216,0.00053652993,0.0010398885,0.0013398724,0.0011229712,0.0005736767,0.0011036872],"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.000093586495,0.00005682347,0.0011728613,0.00018007557,0.000018090253,0.00027767027,0.00060537324,0.017614003,0.017001115,0.85984385,0.0029528898,0.10018364],"study_design_scores_gemma":[0.00004920402,0.00015256766,0.0007212455,0.00011551049,0.000044469853,0.00060429616,0.00024207268,0.11089443,0.04436292,0.782814,0.059930753,0.000068413094],"about_ca_topic_score_codex":0.0015725797,"about_ca_topic_score_gemma":0.002797771,"teacher_disagreement_score":0.0067725442,"about_ca_system_score_codex":0.0007417183,"about_ca_system_score_gemma":0.000902986,"threshold_uncertainty_score":0.02265644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117459744,0.0022410168,0.85727614,0.0031441203,0.000107623244,0.0002177749,0.0005466998,0.0012895048,0.017717298],"genre_scores_gemma":[0.54552364,0.0016955573,0.4403849,0.0011699323,0.00017050302,0.00065499323,0.0010364645,0.00069586694,0.00866809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996609,0.0012282539,0.00014579874,0.00059358124,0.00080590585,0.0006175348],"domain_scores_gemma":[0.99266523,0.004540013,0.0005830078,0.0014232708,0.00042446202,0.00036396887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044968897,0.0020221455,0.0030775254,0.0014123961,0.0009696032,0.0026148802,0.003925586,0.002501956,0.005689718],"category_scores_gemma":[0.018671991,0.0010731795,0.0011606148,0.0029517708,0.0014318936,0.0057153893,0.002783808,0.0041314797,0.0020126875],"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.0021089714,0.0006369991,0.0024203884,0.00042392898,0.00016563019,0.00021768399,0.0005316122,0.723331,0.006425151,0.14276133,0.013754089,0.10722322],"study_design_scores_gemma":[0.00011078507,0.00015109606,0.0003233333,0.00005233845,0.00004087813,0.00025418666,0.00009142929,0.9226265,0.0013244331,0.07197549,0.0030296878,0.0000197682],"about_ca_topic_score_codex":0.002667028,"about_ca_topic_score_gemma":0.0029196218,"teacher_disagreement_score":0.005689718,"about_ca_system_score_codex":0.0030610613,"about_ca_system_score_gemma":0.0021171344,"threshold_uncertainty_score":0.023782074},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018238693,0.00058193604,0.97530025,0.00033439184,0.000097305274,0.00009308774,0.00009838394,0.0010462301,0.0042097396],"genre_scores_gemma":[0.27894902,0.0004057135,0.71527725,0.00022489246,0.00011364229,0.00027530547,0.00037480268,0.00035098923,0.0040283217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791497,0.00045003163,0.00012050519,0.00032068836,0.000827963,0.0003658358],"domain_scores_gemma":[0.995764,0.002067747,0.0002601767,0.0013038182,0.00045233424,0.00015179183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025362752,0.0013938699,0.0012715171,0.0010488235,0.0010706577,0.0020498312,0.002891871,0.0017697108,0.0057163644],"category_scores_gemma":[0.010898374,0.0005808616,0.001632078,0.001458638,0.0011892776,0.005388995,0.002669308,0.0030504237,0.0012287648],"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.0007155525,0.0002766789,0.0012364604,0.00039731085,0.000089269575,0.000121387406,0.00063347904,0.5459632,0.009195814,0.16565,0.0070360955,0.26868474],"study_design_scores_gemma":[0.00006167623,0.000043198273,0.000105065,0.000025967174,0.00001507954,0.00004140703,0.000032477237,0.9361392,0.0015473224,0.058505233,0.0034686187,0.0000148183135],"about_ca_topic_score_codex":0.00475008,"about_ca_topic_score_gemma":0.004492473,"teacher_disagreement_score":0.0057163644,"about_ca_system_score_codex":0.0026014252,"about_ca_system_score_gemma":0.0014066409,"threshold_uncertainty_score":0.019123137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14324515,0.0018227465,0.83527464,0.00051194243,0.00021475521,0.000100669866,0.00019088486,0.00096590776,0.017673308],"genre_scores_gemma":[0.83960134,0.0019706935,0.13829648,0.00037522387,0.00033099813,0.0002089838,0.00023155927,0.00028521728,0.018699449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873036,0.0001724149,0.00004517318,0.00021948911,0.0005980629,0.0002346131],"domain_scores_gemma":[0.9965508,0.0023005565,0.0003001884,0.00039743743,0.0003765046,0.00007446308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014056499,0.0007919665,0.0004994234,0.0015326098,0.0013147972,0.0020959347,0.0008477895,0.0006734982,0.0036814304],"category_scores_gemma":[0.00791214,0.00055472174,0.00059748365,0.002032155,0.002111794,0.0028423788,0.0010906144,0.0009482905,0.00089818495],"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.0011208433,0.00007691668,0.0026205047,0.00031516308,0.000079009325,0.001196093,0.0009481268,0.18733433,0.022539878,0.62383085,0.0059587345,0.15397957],"study_design_scores_gemma":[0.00007510044,0.00021728144,0.00085520535,0.0000734713,0.000090118556,0.0009493039,0.000088222085,0.5803054,0.024964418,0.37777275,0.014509051,0.0000996989],"about_ca_topic_score_codex":0.0030092574,"about_ca_topic_score_gemma":0.0029243715,"teacher_disagreement_score":0.0036814304,"about_ca_system_score_codex":0.0013902142,"about_ca_system_score_gemma":0.0010549126,"threshold_uncertainty_score":0.012315571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090229616,0.00075595995,0.89783615,0.0006106268,0.00012121197,0.0004758978,0.0004554238,0.0021922889,0.0073228837],"genre_scores_gemma":[0.5130068,0.00019421641,0.47853404,0.00056481705,0.00008819684,0.0007457092,0.00077658263,0.00043593883,0.005653804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602,0.0016084231,0.0002391671,0.0007406688,0.0009653511,0.00042648872],"domain_scores_gemma":[0.9847002,0.010086848,0.0007413724,0.002625048,0.001249171,0.0005973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062387483,0.0010162145,0.0017016901,0.0015434698,0.0011608419,0.0019694862,0.0040934333,0.0019859304,0.011006426],"category_scores_gemma":[0.03066107,0.0006965021,0.0010087605,0.0014843104,0.0015700811,0.0033581485,0.0029432229,0.0017030361,0.0018022174],"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.0027276643,0.0006311678,0.0091991285,0.0005145442,0.00026179908,0.00030458125,0.000749351,0.3405752,0.0097127,0.17434533,0.015211758,0.44576684],"study_design_scores_gemma":[0.000279071,0.0003731229,0.00068661384,0.00006304615,0.000047299876,0.00019497111,0.00016606868,0.87898827,0.004597408,0.10840987,0.006149554,0.00004462914],"about_ca_topic_score_codex":0.0023063088,"about_ca_topic_score_gemma":0.0036782555,"teacher_disagreement_score":0.011006426,"about_ca_system_score_codex":0.0014812922,"about_ca_system_score_gemma":0.0026957993,"threshold_uncertainty_score":0.036820114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012331262,0.000046923455,0.98052967,0.00007211888,0.000031103544,0.00015530639,0.00013599731,0.002473263,0.0042244564],"genre_scores_gemma":[0.08886632,0.000039688613,0.90701336,0.00003658187,0.00001027146,0.00022920738,0.00042676544,0.000496523,0.0028813703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948657,0.000056392997,0.00004169627,0.000111357724,0.00022312289,0.000080835496],"domain_scores_gemma":[0.9987984,0.0004529543,0.00006230144,0.00033602543,0.00030032275,0.000050111157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053338974,0.00065044913,0.0005319886,0.00091834634,0.0008474834,0.0008588048,0.0011875774,0.0009250486,0.010202984],"category_scores_gemma":[0.002932734,0.00052281626,0.00092146563,0.0005631362,0.0007071276,0.0012377842,0.0026828274,0.00096172077,0.0030263658],"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.0001995935,0.00016032252,0.002012947,0.0003816023,0.000057712314,0.0002951958,0.0005734976,0.06789205,0.037859943,0.14679089,0.015578166,0.72819805],"study_design_scores_gemma":[0.00031645256,0.00031728402,0.00088448107,0.00010067839,0.00007279946,0.0009795001,0.00030193222,0.6213807,0.077316634,0.23609725,0.062108066,0.00012419537],"about_ca_topic_score_codex":0.000845276,"about_ca_topic_score_gemma":0.001607351,"teacher_disagreement_score":0.010202984,"about_ca_system_score_codex":0.000415986,"about_ca_system_score_gemma":0.00086407905,"threshold_uncertainty_score":0.03413236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111483194,0.00065181986,0.8617183,0.0011415546,0.00012476378,0.0007689424,0.0015616302,0.011934189,0.010615571],"genre_scores_gemma":[0.16802897,0.00017970393,0.8214245,0.00018284503,0.000055473534,0.0003467589,0.0035941682,0.00043251808,0.0057549947],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989881,0.000122047124,0.000095068805,0.00036218468,0.00020708532,0.00022559155],"domain_scores_gemma":[0.99820435,0.0008065584,0.00023370347,0.00039173962,0.00016939282,0.00019421372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423175,0.0018011925,0.0013460078,0.0011959426,0.0013546036,0.0015635778,0.0025010672,0.0013421797,0.009559499],"category_scores_gemma":[0.0025823382,0.0009843563,0.0014657709,0.0021454543,0.00077725196,0.0039584558,0.002367627,0.0013134005,0.004066859],"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.0036368743,0.0012352084,0.0051788897,0.001686392,0.0003748035,0.00055280636,0.0010015254,0.10254598,0.06600056,0.024408702,0.032826632,0.7605517],"study_design_scores_gemma":[0.0012474773,0.001069931,0.0023075836,0.00009443112,0.00021749928,0.0010341713,0.0005439824,0.8648168,0.029217456,0.074122764,0.02521732,0.00011062406],"about_ca_topic_score_codex":0.0029241045,"about_ca_topic_score_gemma":0.0053954804,"teacher_disagreement_score":0.009559499,"about_ca_system_score_codex":0.0014897799,"about_ca_system_score_gemma":0.002660609,"threshold_uncertainty_score":0.03197974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0799201,0.0066339476,0.8468265,0.012656005,0.0018862834,0.0003286779,0.0013105256,0.0036539263,0.04678413],"genre_scores_gemma":[0.45956498,0.0032030724,0.50500953,0.004404626,0.0021636044,0.0005921061,0.0035359843,0.0024420335,0.019084085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930823,0.0020947708,0.00020931142,0.0016214821,0.0017749779,0.0012171656],"domain_scores_gemma":[0.98602194,0.008052012,0.00059776247,0.003705475,0.0009581965,0.00066470803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051013166,0.003560206,0.002747485,0.0020327643,0.001039317,0.004581069,0.0039832857,0.0041440823,0.024824625],"category_scores_gemma":[0.025420202,0.0008472944,0.0031300292,0.00296978,0.0015443763,0.010881003,0.0035805558,0.008313023,0.005788654],"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.0031411783,0.002080884,0.0031961747,0.0013313389,0.00044951212,0.0004887141,0.00058860396,0.26116347,0.025166823,0.2588535,0.075288445,0.36825138],"study_design_scores_gemma":[0.00035046772,0.0003977418,0.0007308785,0.00012304427,0.00015515024,0.0007621582,0.00015914717,0.7947406,0.0063526174,0.17776358,0.018401671,0.0000629965],"about_ca_topic_score_codex":0.0025627692,"about_ca_topic_score_gemma":0.0029636687,"teacher_disagreement_score":0.024824625,"about_ca_system_score_codex":0.0032544287,"about_ca_system_score_gemma":0.0025721523,"threshold_uncertainty_score":0.083046615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013654431,0.0012555879,0.9710916,0.00085603364,0.00020679881,0.00025819792,0.00035675842,0.004624142,0.007696423],"genre_scores_gemma":[0.11103306,0.0009783983,0.8779424,0.00053689315,0.00030361552,0.0005661649,0.0017832259,0.001143751,0.005712593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961194,0.0008734002,0.0002643878,0.0009184372,0.0012457019,0.0005788424],"domain_scores_gemma":[0.99320203,0.0033090408,0.00044764104,0.0019692602,0.00079637795,0.00027570763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027595481,0.0025681537,0.0025840104,0.0026365886,0.0013932256,0.0028284367,0.0045970217,0.0028252339,0.021287467],"category_scores_gemma":[0.011900497,0.00126612,0.0028914544,0.00457029,0.0011148767,0.011085796,0.004650252,0.0033610798,0.006209476],"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.001162111,0.0008988485,0.0013299763,0.0016350923,0.0002732373,0.00021754169,0.0005075381,0.16407338,0.014091061,0.128946,0.031258866,0.6556064],"study_design_scores_gemma":[0.00040035177,0.0002006124,0.00040858434,0.00008215508,0.00007934552,0.00032330686,0.00014917534,0.6477161,0.005648249,0.32488784,0.020057676,0.000046598718],"about_ca_topic_score_codex":0.001758084,"about_ca_topic_score_gemma":0.0028091124,"teacher_disagreement_score":0.021287467,"about_ca_system_score_codex":0.0018369105,"about_ca_system_score_gemma":0.0019969265,"threshold_uncertainty_score":0.07121366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42621228,0.0020615864,0.55339813,0.0013246931,0.00020175004,0.00019450948,0.00015891883,0.00039810513,0.016050022],"genre_scores_gemma":[0.97657335,0.00027682385,0.021597052,0.00010748371,0.00006705229,0.000055147713,0.000044139084,0.000022694434,0.0012562543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982565,0.00052358594,0.00005281372,0.00022530578,0.00045392686,0.00048789845],"domain_scores_gemma":[0.9953843,0.0028811516,0.00046141414,0.00023523907,0.0005267342,0.0005111643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022363756,0.0009498781,0.0011660546,0.0005744362,0.0012416489,0.0027182978,0.0025578435,0.0014215958,0.0026370524],"category_scores_gemma":[0.008652984,0.0003608994,0.00043261662,0.00093258754,0.0010500201,0.0030191578,0.001482131,0.0010643192,0.00020292135],"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.00068536977,0.00038302253,0.0015526525,0.00020809851,0.00009141079,0.0002495737,0.00018379944,0.7520374,0.008198553,0.20073693,0.0031840529,0.032489218],"study_design_scores_gemma":[0.00004006009,0.00007732138,0.00013002564,0.0000046270043,0.000012585084,0.000041952364,0.000028503877,0.97164404,0.0011074557,0.02632779,0.00057798275,0.000007633879],"about_ca_topic_score_codex":0.003943108,"about_ca_topic_score_gemma":0.0028472142,"teacher_disagreement_score":0.003943108,"about_ca_system_score_codex":0.0026094276,"about_ca_system_score_gemma":0.0020156337,"threshold_uncertainty_score":0.01893282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21178867,0.0009976897,0.757351,0.00080730906,0.000078014375,0.0002837073,0.001416344,0.003803969,0.02347323],"genre_scores_gemma":[0.25555125,0.00065478537,0.7319876,0.00018570032,0.000036860034,0.0002611397,0.0039686533,0.0006295289,0.0067245006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996754,0.000048306752,0.000018330174,0.000071470065,0.00008910106,0.000097322656],"domain_scores_gemma":[0.9994868,0.00020965058,0.00005681672,0.00011121278,0.00006282515,0.0000727031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030421888,0.0011361283,0.0011264929,0.0007801069,0.0005761846,0.0011932924,0.0009247511,0.0008166653,0.008687625],"category_scores_gemma":[0.0013618525,0.00056985545,0.0009843821,0.001268467,0.00046667166,0.0021575533,0.0016258925,0.0011911382,0.0028580774],"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.001258836,0.00032326285,0.0025896826,0.0011657267,0.0001199964,0.0003667648,0.0006210859,0.14579009,0.08544161,0.04970964,0.033417493,0.6791958],"study_design_scores_gemma":[0.0004637433,0.00043433046,0.0026222172,0.00017167121,0.00013938016,0.00058976567,0.00070213963,0.706715,0.045773428,0.22208206,0.020247517,0.000058777154],"about_ca_topic_score_codex":0.0015479589,"about_ca_topic_score_gemma":0.0033200257,"teacher_disagreement_score":0.008687625,"about_ca_system_score_codex":0.00063800154,"about_ca_system_score_gemma":0.0007178057,"threshold_uncertainty_score":0.029062986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13047297,0.00038772624,0.86176646,0.00059455464,0.00010593389,0.00025422225,0.00017561564,0.00035125794,0.0058912523],"genre_scores_gemma":[0.8414096,0.0003665758,0.15457949,0.0001524757,0.00010445378,0.00023454947,0.00016436617,0.00018580987,0.0028026688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866974,0.00039967755,0.00008189269,0.00025482007,0.00025638184,0.00033740088],"domain_scores_gemma":[0.99406755,0.003877786,0.00061066146,0.00057850516,0.00046543725,0.00040008855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025195826,0.0015663898,0.0015823984,0.0004909381,0.00072844804,0.0013778225,0.0023435736,0.0012748993,0.002335398],"category_scores_gemma":[0.009385969,0.0006326567,0.00027943676,0.00077965617,0.0010773162,0.002999759,0.0014496276,0.0011152289,0.00038653],"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.0008509838,0.00041915802,0.0010424891,0.00029831688,0.000077767334,0.00014408586,0.00023670775,0.86360514,0.03106079,0.046094254,0.0030978585,0.053072415],"study_design_scores_gemma":[0.000057439705,0.00014689594,0.00017588303,0.000007127918,0.000017765065,0.00003192306,0.00005430669,0.9815833,0.0046370327,0.012543726,0.00073025696,0.000014332345],"about_ca_topic_score_codex":0.0025209207,"about_ca_topic_score_gemma":0.0027810852,"teacher_disagreement_score":0.0025209207,"about_ca_system_score_codex":0.0018686897,"about_ca_system_score_gemma":0.0019523612,"threshold_uncertainty_score":0.013558388},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21228379,0.001679763,0.76319164,0.0022497633,0.00015867218,0.00023560987,0.0056712627,0.006352401,0.008177031],"genre_scores_gemma":[0.68947995,0.0007119971,0.2917631,0.0004530345,0.00025030997,0.00042344187,0.010960321,0.0005367652,0.005421144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532604,0.0007655684,0.00066504854,0.0011595943,0.001608161,0.00047553767],"domain_scores_gemma":[0.98795635,0.005127537,0.0011799127,0.004374572,0.0008597525,0.0005019464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021419118,0.0008922347,0.0020499288,0.0015615417,0.0007743369,0.002912102,0.0029229424,0.0019803783,0.007088672],"category_scores_gemma":[0.021519309,0.00061073434,0.00096062606,0.0035303547,0.0014540082,0.013908827,0.0046507,0.002152062,0.002084702],"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.0024253991,0.0005072534,0.00897964,0.00110283,0.00015601201,0.0003576921,0.0012199389,0.30345666,0.017648954,0.2808617,0.019417834,0.36386612],"study_design_scores_gemma":[0.00014732043,0.00032882183,0.0010435501,0.00007496458,0.000049053382,0.00047931026,0.0004544287,0.5819937,0.01111514,0.39379868,0.010454408,0.000060697977],"about_ca_topic_score_codex":0.0012513568,"about_ca_topic_score_gemma":0.0015184957,"teacher_disagreement_score":0.007088672,"about_ca_system_score_codex":0.001583391,"about_ca_system_score_gemma":0.0012958711,"threshold_uncertainty_score":0.023713946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10373398,0.00038465552,0.8891002,0.00035801373,0.00005455487,0.00017268873,0.00021195748,0.0010476684,0.004936191],"genre_scores_gemma":[0.7290297,0.00022735781,0.2661659,0.00012547811,0.00006230323,0.00026724255,0.0005093416,0.0001412401,0.003471421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998401,0.0003747191,0.000072375144,0.00045183592,0.00042240112,0.00027772103],"domain_scores_gemma":[0.9981945,0.00092966424,0.00017215108,0.00044293483,0.00014144187,0.00011919327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011857072,0.0006925328,0.0013580596,0.0009243283,0.0010650809,0.0012931414,0.002200465,0.0009552799,0.0033384995],"category_scores_gemma":[0.0054243905,0.0004634,0.00074632943,0.0018618061,0.0009795121,0.0043924884,0.0031149979,0.0007794916,0.000583633],"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.00124651,0.0002455767,0.0016347059,0.0003610749,0.00016227883,0.00026965345,0.0002919,0.63105905,0.019028224,0.10539531,0.0046225367,0.2356832],"study_design_scores_gemma":[0.000070803435,0.00008458221,0.00019890313,0.000013673455,0.000024661374,0.00010598722,0.00004462371,0.87767684,0.0059380517,0.11362888,0.0021996559,0.000013343533],"about_ca_topic_score_codex":0.0014177355,"about_ca_topic_score_gemma":0.0019137893,"teacher_disagreement_score":0.0033384995,"about_ca_system_score_codex":0.0013541223,"about_ca_system_score_gemma":0.0010426065,"threshold_uncertainty_score":0.011168361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2150124,0.0018275422,0.7003769,0.0031770177,0.00041728307,0.00061150757,0.0046535376,0.0029873226,0.07093643],"genre_scores_gemma":[0.62188816,0.0011193221,0.34352475,0.0009328423,0.00032956016,0.0003540957,0.0055742813,0.0005080441,0.025768874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986707,0.00024771984,0.00007102466,0.00047685928,0.0003216875,0.00021200285],"domain_scores_gemma":[0.9978502,0.0009854913,0.00024425107,0.00040405104,0.00033314174,0.00018291624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444755,0.00043747138,0.0006981249,0.0010316952,0.0010033012,0.0017685445,0.0009484112,0.0012597949,0.0089331325],"category_scores_gemma":[0.004084856,0.00046985506,0.00053823466,0.0012673923,0.0015721149,0.004104979,0.0021996798,0.0017960535,0.001998168],"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.00031621743,0.000120052195,0.0033683204,0.0006592502,0.000067646346,0.0004898788,0.0010956572,0.013530064,0.024406582,0.80087113,0.028162371,0.12691288],"study_design_scores_gemma":[0.00004110606,0.00006690862,0.0015894867,0.000063872176,0.000027793867,0.0007855562,0.0004499484,0.037222415,0.0071620992,0.8991502,0.053410877,0.0000297621],"about_ca_topic_score_codex":0.0014621803,"about_ca_topic_score_gemma":0.0017490733,"teacher_disagreement_score":0.0089331325,"about_ca_system_score_codex":0.0008094882,"about_ca_system_score_gemma":0.0005835646,"threshold_uncertainty_score":0.029884279},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08015478,0.0066114147,0.86532354,0.0062851994,0.00029832227,0.00037616264,0.0019054769,0.002001995,0.037043214],"genre_scores_gemma":[0.5172083,0.007711952,0.44884884,0.0021055895,0.0012559096,0.001259088,0.0059265136,0.0013499518,0.014333881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99392265,0.0014140268,0.00036479553,0.001490507,0.0017042063,0.0011037971],"domain_scores_gemma":[0.97927815,0.015602867,0.0012592557,0.0023885902,0.0008428048,0.0006283082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035309067,0.003368443,0.0026945933,0.003218844,0.002442701,0.007959092,0.006354414,0.004331031,0.010346232],"category_scores_gemma":[0.026895927,0.00194058,0.0039794436,0.007157277,0.003515933,0.012510637,0.004355549,0.008243607,0.0018675943],"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.0011427205,0.00088469323,0.0033366806,0.0014624737,0.000347228,0.0002965914,0.00096590206,0.5053006,0.004554944,0.3311287,0.026967254,0.1236123],"study_design_scores_gemma":[0.00014729224,0.00007223445,0.0005489192,0.00012145383,0.00008386674,0.00023916489,0.00016387911,0.6395373,0.0017194098,0.3505262,0.0068054427,0.000034827117],"about_ca_topic_score_codex":0.0039715245,"about_ca_topic_score_gemma":0.0026120353,"teacher_disagreement_score":0.010346232,"about_ca_system_score_codex":0.006079181,"about_ca_system_score_gemma":0.0024790636,"threshold_uncertainty_score":0.044107735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075040765,0.00036531652,0.89935607,0.0035594532,0.00015178259,0.00022363232,0.00023384226,0.0007947017,0.020274455],"genre_scores_gemma":[0.6074242,0.00033759992,0.36994377,0.0007660622,0.00010202167,0.0004020685,0.00035359865,0.0004369801,0.020233685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469876,0.0010352856,0.00029767043,0.001700272,0.0013855719,0.00088252744],"domain_scores_gemma":[0.9839844,0.0076136,0.0009579352,0.0062583853,0.0006910512,0.0004946087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031811781,0.000721118,0.0016945153,0.0005058612,0.0028827637,0.0045910194,0.0030500542,0.0033299667,0.009913797],"category_scores_gemma":[0.0179913,0.0008883063,0.0018739126,0.0011645943,0.005581243,0.015759373,0.004926957,0.0068587125,0.001367344],"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.0005908497,0.00016185432,0.0010192717,0.000298468,0.00010969338,0.0002881551,0.00066762685,0.0653949,0.009930502,0.86631745,0.0053361803,0.04988508],"study_design_scores_gemma":[0.000105208856,0.00016173933,0.00033788354,0.000066168235,0.00007044997,0.0004080001,0.00032957006,0.17391972,0.0118716415,0.794122,0.018534604,0.00007300014],"about_ca_topic_score_codex":0.0023066818,"about_ca_topic_score_gemma":0.0024173213,"teacher_disagreement_score":0.009913797,"about_ca_system_score_codex":0.0018259134,"about_ca_system_score_gemma":0.0024337487,"threshold_uncertainty_score":0.033164978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008627886,0.005036048,0.97443026,0.0005756885,0.0005494916,0.00011051674,0.00013772957,0.00075749535,0.009774933],"genre_scores_gemma":[0.4564494,0.0076106405,0.5238345,0.0008489979,0.0018298908,0.00037715753,0.00047415364,0.001178345,0.0073969043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98647505,0.0066724457,0.0006709545,0.001874556,0.003476754,0.0008301506],"domain_scores_gemma":[0.96921647,0.022977522,0.001733518,0.003575286,0.0019171187,0.0005800907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009631382,0.0031500254,0.0035640667,0.0030579779,0.001484109,0.0046609906,0.0038170207,0.002337729,0.0056734816],"category_scores_gemma":[0.053350564,0.0011197446,0.0022345027,0.006406904,0.004222762,0.008361399,0.00304738,0.006072049,0.0026360631],"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.0007577537,0.00022841158,0.001622605,0.0004994842,0.00019966492,0.0002155311,0.00031087917,0.5357772,0.0029452248,0.2933456,0.008039616,0.15605798],"study_design_scores_gemma":[0.00007987586,0.0003718193,0.0005386582,0.000080267375,0.00008627016,0.0003427909,0.000088238885,0.7226604,0.0033178127,0.26197484,0.010386058,0.00007311676],"about_ca_topic_score_codex":0.004845267,"about_ca_topic_score_gemma":0.0017744572,"teacher_disagreement_score":0.009631382,"about_ca_system_score_codex":0.0028032346,"about_ca_system_score_gemma":0.0027727187,"threshold_uncertainty_score":0.050936222},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09745545,0.00042233232,0.8776568,0.00028319244,0.000103327155,0.00022835282,0.002271464,0.0027036627,0.018875442],"genre_scores_gemma":[0.30143034,0.00042819657,0.6703414,0.00019171185,0.00008294361,0.00024240164,0.006147799,0.00079730735,0.020337945],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990864,0.00009625011,0.0000644005,0.00016523847,0.000430707,0.00015700812],"domain_scores_gemma":[0.998376,0.0005655132,0.00014450357,0.00035045436,0.00046983716,0.00009364322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037763538,0.00044208654,0.0006320221,0.0014412681,0.0007886483,0.0015294164,0.0014071467,0.0005747366,0.011832814],"category_scores_gemma":[0.0038811567,0.00040470154,0.00061227585,0.002057351,0.0005896453,0.0038757944,0.002569471,0.00095786504,0.0031427674],"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.0004292921,0.00016520328,0.002821044,0.0005252566,0.00005498036,0.0005592535,0.00091260334,0.029084265,0.026720542,0.4007864,0.020804696,0.5171365],"study_design_scores_gemma":[0.00013358369,0.00023866544,0.0018353846,0.00010112354,0.00009184181,0.00085862185,0.0006599348,0.15568651,0.046024244,0.68634915,0.10791764,0.00010333391],"about_ca_topic_score_codex":0.0018800236,"about_ca_topic_score_gemma":0.0030604778,"teacher_disagreement_score":0.011832814,"about_ca_system_score_codex":0.0009447212,"about_ca_system_score_gemma":0.00085615716,"threshold_uncertainty_score":0.039584696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035614166,0.00044652066,0.9537424,0.00056646974,0.0000650227,0.00017824996,0.0003325705,0.003255744,0.0057989014],"genre_scores_gemma":[0.17780451,0.00039121744,0.8147226,0.0002009345,0.00006372639,0.0003054567,0.0017879556,0.00031499035,0.0044086725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928194,0.00010107967,0.000042271677,0.00019117234,0.00020540273,0.00017813647],"domain_scores_gemma":[0.9992059,0.00026955127,0.0000948648,0.0002188504,0.00011613262,0.00009477284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056462275,0.001098539,0.0009090218,0.00078660273,0.0008000664,0.0010632768,0.0022377688,0.0012321743,0.005508783],"category_scores_gemma":[0.0023372811,0.00047691463,0.0009164027,0.0017444721,0.00036508657,0.002604421,0.0015995693,0.0019318766,0.0017777178],"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.0006041865,0.0006900721,0.0021283517,0.00056390086,0.0001313107,0.00034228875,0.00045361335,0.22686912,0.029625712,0.041694455,0.035266828,0.6616302],"study_design_scores_gemma":[0.00022708511,0.0002522837,0.0008354297,0.000036244914,0.00006372584,0.00051291415,0.00012727537,0.9330317,0.007923884,0.044090766,0.012865174,0.000033529508],"about_ca_topic_score_codex":0.0028197018,"about_ca_topic_score_gemma":0.004749451,"teacher_disagreement_score":0.005508783,"about_ca_system_score_codex":0.0012934481,"about_ca_system_score_gemma":0.0012843516,"threshold_uncertainty_score":0.018428683},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36577415,0.0004148793,0.62072843,0.0007274542,0.00006206526,0.0001906388,0.00021017199,0.0016383032,0.010253921],"genre_scores_gemma":[0.94766647,0.00007370698,0.048953515,0.00007641396,0.000020364962,0.00013514409,0.00009154576,0.000062307205,0.0029204865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982008,0.00054940867,0.000091840135,0.0004342551,0.00027799336,0.0004456715],"domain_scores_gemma":[0.99282396,0.003749008,0.00087834365,0.0018637428,0.0002924331,0.0003924747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016963894,0.00055810425,0.00089335546,0.00039631082,0.0008639651,0.0010783677,0.0020377317,0.0007650914,0.0040379856],"category_scores_gemma":[0.00816338,0.00043142543,0.0005178289,0.00039290474,0.0014497801,0.0031190803,0.0028492361,0.000808124,0.0006330096],"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.004103332,0.00025968143,0.0026165575,0.00028349747,0.00014802384,0.00057442277,0.00041673973,0.790143,0.02999976,0.11683898,0.0030036122,0.051612385],"study_design_scores_gemma":[0.00031192641,0.00035616252,0.00037707985,0.000014680367,0.000039023445,0.00014434649,0.00009230222,0.9420141,0.0106901815,0.044445753,0.0014822172,0.000032282995],"about_ca_topic_score_codex":0.0013121765,"about_ca_topic_score_gemma":0.0021633354,"teacher_disagreement_score":0.0040379856,"about_ca_system_score_codex":0.0009067541,"about_ca_system_score_gemma":0.0011344359,"threshold_uncertainty_score":0.013508379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18093172,0.00015132835,0.8140061,0.00035941447,0.000017391487,0.00011024449,0.00013148814,0.0005873057,0.0037050163],"genre_scores_gemma":[0.84664065,0.000114407216,0.14877856,0.000089273424,0.000023582303,0.00029602047,0.00029389895,0.00007711345,0.0036864402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969893,0.0013448178,0.00016476902,0.00056992477,0.0004727738,0.00045844773],"domain_scores_gemma":[0.9837531,0.01152424,0.001447097,0.002043815,0.00064457575,0.00058716716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032985527,0.0007518371,0.0011663001,0.00073815096,0.000992764,0.001452526,0.0022756334,0.0013344556,0.0013181781],"category_scores_gemma":[0.017507244,0.000701168,0.0012804259,0.0007734056,0.002083638,0.0034044806,0.00392938,0.0013895227,0.00031596996],"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.0016426521,0.000170291,0.0046570646,0.00021189298,0.0001278876,0.000559774,0.0012724581,0.8251135,0.00703233,0.11375149,0.0013277704,0.044132862],"study_design_scores_gemma":[0.00007176758,0.00007518058,0.00021010404,0.000017838483,0.000029590494,0.000071041264,0.00009689283,0.9460953,0.00286659,0.04948662,0.00095544476,0.000023687004],"about_ca_topic_score_codex":0.0015196067,"about_ca_topic_score_gemma":0.0015400118,"teacher_disagreement_score":0.0032985527,"about_ca_system_score_codex":0.0011746298,"about_ca_system_score_gemma":0.0014567676,"threshold_uncertainty_score":0.01744461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05361846,0.0014557799,0.9204605,0.0024739432,0.0004038813,0.00031835947,0.001295766,0.0010213706,0.018951923],"genre_scores_gemma":[0.44898644,0.0016586413,0.536904,0.0006360487,0.00029685744,0.00081917463,0.0012264457,0.00020923534,0.009263191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992293,0.00018096395,0.00003585959,0.00019822623,0.00015955458,0.00019613984],"domain_scores_gemma":[0.9983346,0.0013182025,0.0000890656,0.00007577983,0.00010983983,0.00007264048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010977157,0.001638548,0.0015545505,0.00066594407,0.0005834242,0.0013866653,0.0018908151,0.0024654332,0.0031286457],"category_scores_gemma":[0.0044514597,0.00067248865,0.0014471848,0.0008853488,0.00084474945,0.002066122,0.0011906315,0.0030245837,0.0002916074],"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.00029259926,0.0001817577,0.0004923753,0.0003201111,0.0001108108,0.0003954155,0.00017702991,0.85574746,0.0025041609,0.071111836,0.0113881845,0.057278216],"study_design_scores_gemma":[0.00013193216,0.00010474244,0.00014620225,0.00005365365,0.000053779364,0.0001519928,0.000058842325,0.94346505,0.0007671917,0.05119001,0.0038556817,0.00002086813],"about_ca_topic_score_codex":0.00741053,"about_ca_topic_score_gemma":0.0068981424,"teacher_disagreement_score":0.00741053,"about_ca_system_score_codex":0.002245299,"about_ca_system_score_gemma":0.0027407713,"threshold_uncertainty_score":0.016290784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01402654,0.00022508006,0.9776293,0.00032752546,0.00007475596,0.00017710075,0.00023482696,0.0033356184,0.003969203],"genre_scores_gemma":[0.13808459,0.0002500961,0.85514283,0.00020582038,0.000117773016,0.00033642122,0.001320413,0.000666366,0.0038757573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961124,0.00063643866,0.0002861823,0.0009800724,0.0013347244,0.0006502772],"domain_scores_gemma":[0.99373144,0.002217069,0.0003902121,0.0025485037,0.0008712628,0.00024141418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014915314,0.0016076165,0.0016818118,0.0017779819,0.0012977738,0.0022837406,0.0056012305,0.0016030181,0.009624567],"category_scores_gemma":[0.009295243,0.0010307236,0.0017401692,0.0023857902,0.001306918,0.007796089,0.00582508,0.00313906,0.002811411],"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.0007724832,0.00063105026,0.0017593579,0.0007029701,0.00012335625,0.00027177992,0.0004748056,0.1575901,0.024526503,0.1782455,0.02228723,0.61261487],"study_design_scores_gemma":[0.00021891319,0.0001265358,0.0005537231,0.000044952976,0.00006781543,0.00023358525,0.00012675658,0.6967981,0.013540792,0.27446115,0.013767885,0.0000597845],"about_ca_topic_score_codex":0.0040102587,"about_ca_topic_score_gemma":0.0057007265,"teacher_disagreement_score":0.009624567,"about_ca_system_score_codex":0.0023890599,"about_ca_system_score_gemma":0.0022092643,"threshold_uncertainty_score":0.032197416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056570273,0.0006710651,0.92739975,0.0006223858,0.00016092391,0.00031235386,0.0030250535,0.0067747263,0.0044634445],"genre_scores_gemma":[0.42691088,0.00075582427,0.5580357,0.0005446491,0.00024111952,0.0007650696,0.007886987,0.00075608236,0.004103694],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599,0.00052256975,0.0007320888,0.00054372405,0.0018478093,0.00036386843],"domain_scores_gemma":[0.9827276,0.0042144097,0.0018977545,0.008414159,0.0024123506,0.00033371776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019326204,0.0011096151,0.0021935783,0.002215284,0.0010564603,0.0035765707,0.0034077244,0.0012859502,0.006099591],"category_scores_gemma":[0.020087143,0.0009633706,0.0007903346,0.004894132,0.0014679821,0.012429755,0.0053298944,0.0016459596,0.0033375209],"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.0027345726,0.0005714316,0.010010347,0.0011545416,0.00013940176,0.00038806963,0.0011455984,0.123943605,0.062532865,0.17321911,0.028394062,0.5957664],"study_design_scores_gemma":[0.0005741,0.00129616,0.0021455395,0.00025002766,0.00016047663,0.0008623359,0.0007486383,0.61413205,0.1244321,0.18638024,0.068749905,0.00026839483],"about_ca_topic_score_codex":0.0011701103,"about_ca_topic_score_gemma":0.0016989398,"teacher_disagreement_score":0.006099591,"about_ca_system_score_codex":0.0011508403,"about_ca_system_score_gemma":0.0022519513,"threshold_uncertainty_score":0.020405114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09480968,0.00043314774,0.87978005,0.0010116331,0.00022466973,0.00021670517,0.0002783988,0.0061369413,0.017108705],"genre_scores_gemma":[0.58292264,0.00044623372,0.39930552,0.00032061076,0.00023196888,0.00042896447,0.000732744,0.0010816632,0.0145295905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989819,0.00012522512,0.00006181954,0.0002228278,0.00033662908,0.00027155213],"domain_scores_gemma":[0.997471,0.00081014994,0.00020998977,0.0008796854,0.00039731836,0.00023192198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013236016,0.0011269029,0.0010177521,0.0005508893,0.0011015771,0.0017070692,0.0024262918,0.0009786311,0.007739514],"category_scores_gemma":[0.004970075,0.00054325344,0.0007108051,0.0013410227,0.0015509999,0.0030011414,0.002352634,0.0017831103,0.0022569022],"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.00212099,0.00035941368,0.00237945,0.0005364518,0.000104869076,0.0003327027,0.00037526665,0.5211437,0.09921835,0.13944903,0.019044053,0.21493573],"study_design_scores_gemma":[0.0001339501,0.00010564632,0.00022003135,0.000011710204,0.000022787886,0.00002876681,0.00002866794,0.9260819,0.016374696,0.053563446,0.0034100402,0.000018436938],"about_ca_topic_score_codex":0.003617541,"about_ca_topic_score_gemma":0.0045636347,"teacher_disagreement_score":0.007739514,"about_ca_system_score_codex":0.0021432594,"about_ca_system_score_gemma":0.0022814253,"threshold_uncertainty_score":0.025891244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03625627,0.0007979438,0.95476204,0.0010762234,0.00008511043,0.00018150812,0.00040965207,0.0005508288,0.0058803926],"genre_scores_gemma":[0.46158618,0.0011793454,0.524702,0.00043860704,0.0001793458,0.0006052171,0.0013803865,0.00031953954,0.009609391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836737,0.00061277614,0.000065626926,0.00037693957,0.00027941188,0.00029792637],"domain_scores_gemma":[0.998494,0.0009432648,0.00019874016,0.00016092382,0.0001181714,0.000084749474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014600813,0.0014415515,0.0016333223,0.0007004534,0.00084748823,0.001442927,0.0022780944,0.0022109593,0.0050356262],"category_scores_gemma":[0.005201898,0.000673384,0.0012356956,0.0020271305,0.0011584283,0.0032996142,0.002168383,0.0021225885,0.00097544945],"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.00043626004,0.00016516217,0.00082165364,0.0005436017,0.00011243034,0.00020646157,0.00027079426,0.80463547,0.0022669553,0.10797411,0.0110316025,0.07153544],"study_design_scores_gemma":[0.000122020574,0.00019477421,0.00037917044,0.00006571947,0.000044673274,0.00026441563,0.00021415358,0.80719787,0.0019212787,0.17774838,0.011817231,0.000030274823],"about_ca_topic_score_codex":0.00219579,"about_ca_topic_score_gemma":0.0020406633,"teacher_disagreement_score":0.0050356262,"about_ca_system_score_codex":0.0018262366,"about_ca_system_score_gemma":0.0009958565,"threshold_uncertainty_score":0.016845882},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1589137,0.0022884444,0.7901194,0.005308213,0.0003268725,0.00044943645,0.0027196975,0.007903107,0.03197106],"genre_scores_gemma":[0.5942974,0.0011597191,0.3830407,0.0014389541,0.00026649877,0.0004209216,0.0043280274,0.0014501003,0.013597705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826175,0.00045378553,0.000052654177,0.0003880345,0.0002883056,0.0005554957],"domain_scores_gemma":[0.99651825,0.0022284682,0.00034328355,0.0004714818,0.00017409062,0.00026446543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015547755,0.0022739635,0.0017596545,0.0010770715,0.0011113172,0.0030149524,0.00332975,0.0018711925,0.011977869],"category_scores_gemma":[0.006802588,0.0008044358,0.0011964606,0.0023179816,0.0012949446,0.0072573614,0.0019305014,0.0034557232,0.00228511],"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.0014806442,0.0007421385,0.0012252714,0.00060622254,0.00010124892,0.00029266486,0.00033582989,0.7996597,0.005415522,0.06045847,0.027870413,0.101811826],"study_design_scores_gemma":[0.00013788197,0.000118731645,0.00017467041,0.00003347118,0.000018338367,0.00009562745,0.000083045335,0.915332,0.0010196692,0.07908563,0.0038852885,0.000015650283],"about_ca_topic_score_codex":0.0048531666,"about_ca_topic_score_gemma":0.005555325,"teacher_disagreement_score":0.011977869,"about_ca_system_score_codex":0.0036443486,"about_ca_system_score_gemma":0.0021338866,"threshold_uncertainty_score":0.040069997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2658714,0.0026109405,0.59252733,0.009429837,0.001264424,0.0007280057,0.0025148469,0.007990498,0.11706269],"genre_scores_gemma":[0.70641124,0.0010360894,0.2313049,0.0041695787,0.00047083045,0.0006273,0.002762461,0.0025259838,0.050691716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646986,0.00090581627,0.0001657679,0.0010082509,0.00072821527,0.00072221004],"domain_scores_gemma":[0.99367106,0.002446278,0.00047587612,0.0022191985,0.0006659676,0.00052161375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027515069,0.0024185933,0.0028501577,0.0015072031,0.0025307308,0.0042222627,0.0031505704,0.0031473942,0.049836442],"category_scores_gemma":[0.018915059,0.001209035,0.0018021873,0.0022625893,0.0019660897,0.012002984,0.0065371185,0.0033925166,0.014505835],"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.0029273168,0.000808524,0.01189074,0.0007257706,0.00033731258,0.0007917697,0.0016544467,0.121818244,0.019650733,0.3595925,0.118201725,0.36160094],"study_design_scores_gemma":[0.00039922522,0.00027425186,0.0010424246,0.00020287848,0.00017586116,0.0005134818,0.000790304,0.4154622,0.00799947,0.5176492,0.055409033,0.00008185529],"about_ca_topic_score_codex":0.003711396,"about_ca_topic_score_gemma":0.0049911425,"teacher_disagreement_score":0.049836442,"about_ca_system_score_codex":0.002085229,"about_ca_system_score_gemma":0.002383695,"threshold_uncertainty_score":0.1667195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1466503,0.00051456544,0.82250994,0.0034576666,0.00015293785,0.00030095686,0.00045689737,0.0023824703,0.02357423],"genre_scores_gemma":[0.72804177,0.00034537955,0.25427026,0.0006365247,0.00010296075,0.00032149302,0.0006896717,0.00045083655,0.015141106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659497,0.00087086635,0.00019786716,0.0011892518,0.00052620756,0.0006207973],"domain_scores_gemma":[0.98257357,0.0068355277,0.0017034264,0.0066044503,0.0014135988,0.00086942327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030382844,0.0013374316,0.0013256448,0.00064144545,0.0033112469,0.0021421085,0.0031191558,0.00217349,0.006486794],"category_scores_gemma":[0.020331351,0.0009184172,0.0010355257,0.0009222307,0.0024277212,0.0052226274,0.0051773423,0.0022858917,0.0017303481],"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.0020064847,0.0003331543,0.013062502,0.0015770494,0.00036783633,0.002061824,0.0062922277,0.28804287,0.04537805,0.3169556,0.026936661,0.29698572],"study_design_scores_gemma":[0.00017986551,0.0005942662,0.0026777196,0.00018706979,0.00018906833,0.001401202,0.0012928629,0.65804726,0.024167817,0.25053656,0.060641762,0.00008455909],"about_ca_topic_score_codex":0.002734772,"about_ca_topic_score_gemma":0.0038515327,"teacher_disagreement_score":0.006486794,"about_ca_system_score_codex":0.0014490375,"about_ca_system_score_gemma":0.0017909986,"threshold_uncertainty_score":0.021700501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13396697,0.0017454455,0.84862167,0.0016060915,0.00019900705,0.00014456631,0.0007402758,0.004548035,0.008427984],"genre_scores_gemma":[0.39553306,0.00083778077,0.59278077,0.0006290628,0.0002914772,0.00035992148,0.0011045715,0.0008276568,0.007635712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969553,0.0005427911,0.00036274837,0.0008699985,0.0007865514,0.0004826938],"domain_scores_gemma":[0.98508745,0.0041917465,0.0011625215,0.008225181,0.0009885879,0.00034449142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022609453,0.0007254041,0.0016686185,0.0016147846,0.0015397451,0.00335827,0.0037215955,0.0015145937,0.0045749582],"category_scores_gemma":[0.013019805,0.00096559856,0.0011828211,0.0043224692,0.003996412,0.016920632,0.0057355957,0.0023909006,0.0021187621],"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.0013755462,0.00025121827,0.004776175,0.000470502,0.00007276743,0.00025118794,0.0018132405,0.0390422,0.024791269,0.53579515,0.013628536,0.37773225],"study_design_scores_gemma":[0.00025199197,0.0009009496,0.0012078254,0.0001652911,0.00015752132,0.0009034228,0.0007649152,0.24893,0.046668,0.6435924,0.056253556,0.00020406597],"about_ca_topic_score_codex":0.0026068515,"about_ca_topic_score_gemma":0.0030557648,"teacher_disagreement_score":0.0045749582,"about_ca_system_score_codex":0.0014024362,"about_ca_system_score_gemma":0.0019775399,"threshold_uncertainty_score":0.015304744},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13519381,0.0015880752,0.83205074,0.0018743665,0.00011657591,0.00013558993,0.0011357998,0.0010378562,0.026867235],"genre_scores_gemma":[0.7053896,0.0015035742,0.2821474,0.0004279136,0.00015692509,0.00020942537,0.0021801596,0.00039038705,0.0075945444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819994,0.00056921423,0.000082705694,0.00041213457,0.00047917746,0.0002567365],"domain_scores_gemma":[0.99287087,0.0050399513,0.0005517781,0.00078244123,0.00044561308,0.0003093852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013732022,0.00097565394,0.0010949861,0.0009565181,0.0006406549,0.0020226133,0.0023790277,0.0013340972,0.006170398],"category_scores_gemma":[0.013624526,0.0007790649,0.00093279016,0.001860473,0.0010434461,0.005006231,0.0024776538,0.0023902059,0.0008086868],"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.00035951642,0.00013465963,0.001770526,0.00041361933,0.000071947965,0.00015728435,0.00029307386,0.7783766,0.0037517424,0.13705784,0.009215138,0.06839809],"study_design_scores_gemma":[0.000030528776,0.000040554136,0.00035540696,0.000034736688,0.000020259702,0.00009708486,0.000083646744,0.87132794,0.0010303213,0.12365412,0.0033160585,0.000009277849],"about_ca_topic_score_codex":0.0022156883,"about_ca_topic_score_gemma":0.0034474225,"teacher_disagreement_score":0.006170398,"about_ca_system_score_codex":0.0021389644,"about_ca_system_score_gemma":0.00091963075,"threshold_uncertainty_score":0.020642042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22532429,0.00062589487,0.7682904,0.000477709,0.00002739405,0.00008410878,0.0007102153,0.0012658825,0.003194014],"genre_scores_gemma":[0.81326616,0.00038977544,0.18275163,0.000064066706,0.000060118615,0.00012257519,0.0013067184,0.00015481899,0.0018841829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820745,0.00031143342,0.0001254016,0.00028212456,0.0009305029,0.00014298713],"domain_scores_gemma":[0.99283385,0.0041182945,0.0010758495,0.0013288034,0.00042600368,0.00021720502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000825004,0.00041835755,0.0008696421,0.0021560006,0.0006731639,0.0011755342,0.0010393388,0.0007155993,0.0020395245],"category_scores_gemma":[0.012278878,0.0005512252,0.0005999217,0.0036116692,0.0019875045,0.0032644675,0.0025015026,0.0009185611,0.0004413461],"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.0009837894,0.000102973,0.015360528,0.0002649057,0.0000694247,0.00036851794,0.00064880744,0.61993665,0.021327978,0.097577415,0.0033186562,0.2400403],"study_design_scores_gemma":[0.00004871948,0.00017403113,0.0040292307,0.000024970339,0.000025997851,0.0004626757,0.00012392347,0.8477979,0.010404915,0.13364008,0.0032311247,0.00003647668],"about_ca_topic_score_codex":0.0016553719,"about_ca_topic_score_gemma":0.0018140277,"teacher_disagreement_score":0.0021560006,"about_ca_system_score_codex":0.0011705323,"about_ca_system_score_gemma":0.0007092269,"threshold_uncertainty_score":0.008492827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10828248,0.0005496306,0.877617,0.0014679352,0.00006341361,0.00033171364,0.0011873407,0.0005199688,0.009980578],"genre_scores_gemma":[0.6251795,0.0010404742,0.36538544,0.00025905936,0.00009453431,0.000475418,0.0016224994,0.00016065285,0.0057823234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00021619255,0.000027869955,0.00016529475,0.00010651925,0.00009848236],"domain_scores_gemma":[0.9989287,0.0006586044,0.0001726318,0.00007686549,0.000089934656,0.00007317579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071044016,0.0012189368,0.00095905305,0.00074845616,0.00051694026,0.0010604853,0.0013389011,0.00150615,0.004586848],"category_scores_gemma":[0.003650981,0.0005932864,0.0007660898,0.001423957,0.0007116931,0.0022894265,0.0012765209,0.00071494485,0.00037081444],"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.0001590052,0.000101067926,0.00076086744,0.00042497047,0.00006368417,0.00025982954,0.0000898322,0.9008273,0.0027700565,0.0375215,0.003556251,0.053465627],"study_design_scores_gemma":[0.000112668335,0.00022628627,0.0004277678,0.000036187535,0.000059826907,0.00031184676,0.00013520753,0.9205226,0.0032603247,0.0679259,0.0069571375,0.000024236266],"about_ca_topic_score_codex":0.0013333167,"about_ca_topic_score_gemma":0.0015526703,"teacher_disagreement_score":0.004586848,"about_ca_system_score_codex":0.0010098654,"about_ca_system_score_gemma":0.0008305063,"threshold_uncertainty_score":0.015344501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4649715,0.0006730628,0.50706226,0.00033243658,0.00012713668,0.00033719995,0.00084449287,0.0015854567,0.02406643],"genre_scores_gemma":[0.69576085,0.00048038494,0.28779554,0.00014244246,0.00003666286,0.00016281113,0.001947408,0.00079300645,0.0128809465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.000045128865,0.000035967,0.00017020867,0.0001398233,0.00015453534],"domain_scores_gemma":[0.99918216,0.00016126278,0.00008415986,0.00021188054,0.00017656946,0.00018394532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003127273,0.000727193,0.0011325005,0.0015882137,0.0016007258,0.0015910418,0.0009881548,0.00084894744,0.009936512],"category_scores_gemma":[0.0025974938,0.0007416328,0.0007632854,0.0011390976,0.001047389,0.0028876392,0.003189756,0.0010352269,0.001439243],"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.0006792479,0.0002780805,0.011608956,0.001090786,0.00017138351,0.0013726597,0.0015926457,0.06756977,0.09867298,0.24712731,0.012074246,0.557762],"study_design_scores_gemma":[0.00012767386,0.00085052254,0.008000629,0.00046896015,0.0002802434,0.0016831195,0.0035223134,0.29193678,0.08062371,0.5355492,0.07670558,0.0002511796],"about_ca_topic_score_codex":0.0032187062,"about_ca_topic_score_gemma":0.0043464163,"teacher_disagreement_score":0.009936512,"about_ca_system_score_codex":0.000629433,"about_ca_system_score_gemma":0.001248154,"threshold_uncertainty_score":0.033240914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43992132,0.002029286,0.5130404,0.00586944,0.00023281106,0.00038980483,0.0020398286,0.00094006193,0.035537004],"genre_scores_gemma":[0.6540948,0.0013491862,0.326753,0.0012428189,0.00048718016,0.0004950296,0.0034086073,0.00050830905,0.011661033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706227,0.0009386602,0.00013189603,0.00077327923,0.000472169,0.00062161643],"domain_scores_gemma":[0.9879672,0.0085972175,0.0011417706,0.001354909,0.00041834114,0.00052051706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025893766,0.0013684683,0.002818762,0.0010883646,0.0023255334,0.003726689,0.004861808,0.0032973113,0.009964477],"category_scores_gemma":[0.013462436,0.001021166,0.0015327485,0.0031288883,0.0030387496,0.01046464,0.0038343335,0.0032756918,0.0018575833],"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.0024720575,0.0007240423,0.004998785,0.0013145123,0.0002472839,0.00058395305,0.0009508289,0.39406082,0.0072180033,0.41146877,0.033755433,0.14220561],"study_design_scores_gemma":[0.0002489159,0.00025814676,0.0013015968,0.00009557691,0.00009567896,0.00067297474,0.0005370303,0.51568687,0.0037534065,0.46849045,0.00877478,0.000084587744],"about_ca_topic_score_codex":0.0033829985,"about_ca_topic_score_gemma":0.0020042076,"teacher_disagreement_score":0.009964477,"about_ca_system_score_codex":0.0024688859,"about_ca_system_score_gemma":0.0012862687,"threshold_uncertainty_score":0.033334434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052179266,0.00023433178,0.9333778,0.001110467,0.00013727705,0.00018672405,0.00018930327,0.0009795272,0.01160531],"genre_scores_gemma":[0.74820936,0.0005464114,0.23854446,0.0006230081,0.00029357368,0.00047938435,0.00048737467,0.0003825309,0.010434054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964309,0.0010610505,0.00022742711,0.000741948,0.0010477182,0.000490984],"domain_scores_gemma":[0.98938763,0.0050167073,0.000654683,0.0033900647,0.0011730262,0.0003778624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031795746,0.00080782955,0.0011855887,0.0007659183,0.0015173402,0.0025352826,0.0021105935,0.0012022491,0.006023813],"category_scores_gemma":[0.018440641,0.0005402242,0.0010359313,0.0014021972,0.0030650862,0.0077213245,0.0036398754,0.0022271643,0.001173383],"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.0004708289,0.00010722416,0.0014321075,0.00015300176,0.00003802632,0.00012419315,0.00028527208,0.17198889,0.004966989,0.7784947,0.003977944,0.0379609],"study_design_scores_gemma":[0.000071567134,0.00007873781,0.00015083868,0.000022991586,0.000017594217,0.00007664783,0.0000560821,0.55206794,0.0030649179,0.43987772,0.0044958494,0.000019032104],"about_ca_topic_score_codex":0.0019360734,"about_ca_topic_score_gemma":0.0014388182,"teacher_disagreement_score":0.006023813,"about_ca_system_score_codex":0.0024259642,"about_ca_system_score_gemma":0.0025368964,"threshold_uncertainty_score":0.020151675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17720032,0.0020350348,0.7905157,0.0014887241,0.00014648547,0.00013967388,0.0007438735,0.0030792851,0.024650862],"genre_scores_gemma":[0.70611423,0.00090936286,0.27837467,0.00035662443,0.00006529933,0.00030857153,0.00080904324,0.00042841895,0.012633816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947006,0.000112140886,0.00003061478,0.000117918265,0.000103760656,0.00016551142],"domain_scores_gemma":[0.99790716,0.0012403404,0.00017331044,0.0004219531,0.00013257921,0.0001247592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047681187,0.000664183,0.00081012986,0.0005319755,0.0007569289,0.0014241936,0.0017594133,0.0011576324,0.00890852],"category_scores_gemma":[0.004698718,0.00034160735,0.0006814786,0.0012157619,0.0008332919,0.0053413706,0.0021351816,0.0009566001,0.001580247],"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.0021724878,0.00024522573,0.0022858176,0.00068373693,0.000106464795,0.00050831976,0.00051459717,0.690487,0.013928359,0.11853664,0.01355054,0.15698077],"study_design_scores_gemma":[0.00010583289,0.00013820679,0.00019161505,0.000025272944,0.000032882224,0.00013777893,0.00007026217,0.8732919,0.0035672325,0.11807931,0.0043428373,0.00001689732],"about_ca_topic_score_codex":0.0020949566,"about_ca_topic_score_gemma":0.0023959111,"teacher_disagreement_score":0.00890852,"about_ca_system_score_codex":0.0008616146,"about_ca_system_score_gemma":0.0008052894,"threshold_uncertainty_score":0.029801965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036208864,0.00055011566,0.95406806,0.000328994,0.00011951329,0.00009840548,0.0013636064,0.0014023053,0.0058602835],"genre_scores_gemma":[0.388459,0.0010303792,0.5974242,0.0003354409,0.00012217194,0.0003386604,0.0039171283,0.00046382233,0.007909136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989135,0.00027140047,0.00011606244,0.00014059315,0.00044663966,0.000111682384],"domain_scores_gemma":[0.99790335,0.0007623777,0.00023321602,0.0006459876,0.00036700285,0.000088152694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067208376,0.00044714278,0.0006805939,0.0016396185,0.00054268545,0.0018287706,0.0009289016,0.00069076696,0.0053788936],"category_scores_gemma":[0.005915537,0.00033310978,0.0006181994,0.002873681,0.0008284438,0.004483806,0.0018582374,0.0012921694,0.0015407857],"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.0005772926,0.00010325283,0.001361683,0.00039405155,0.000033359694,0.0003852985,0.0008800855,0.07463483,0.018764341,0.51330465,0.011795578,0.3777656],"study_design_scores_gemma":[0.00008659563,0.00024656559,0.0008187705,0.0002505005,0.000057389425,0.000786528,0.00037669385,0.4260217,0.024405776,0.48676205,0.060079046,0.00010833873],"about_ca_topic_score_codex":0.0009066323,"about_ca_topic_score_gemma":0.0012369308,"teacher_disagreement_score":0.0053788936,"about_ca_system_score_codex":0.00073901634,"about_ca_system_score_gemma":0.0006847558,"threshold_uncertainty_score":0.017994225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008154888,0.00084159663,0.9801189,0.0005997311,0.00010843876,0.000052374988,0.00019579887,0.00032202384,0.009606323],"genre_scores_gemma":[0.53537345,0.0020011184,0.44368252,0.0007391221,0.0002759874,0.000265611,0.0012618006,0.00036596003,0.016034445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973302,0.0008820586,0.0000767665,0.00050763006,0.0006975276,0.0005058131],"domain_scores_gemma":[0.9961223,0.0018916032,0.00037988217,0.00082552334,0.00055876054,0.00022199575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013914051,0.0011564207,0.0015165075,0.00090427103,0.00083457795,0.0023147066,0.0036656673,0.002013976,0.009849563],"category_scores_gemma":[0.009312317,0.0005606907,0.000984845,0.002392836,0.0014736293,0.004523394,0.0028402766,0.0029255203,0.0021580583],"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.00022692204,0.00012269587,0.00050989096,0.00034819057,0.000057079833,0.00019422297,0.000144633,0.6232917,0.001849079,0.29746017,0.014731988,0.06106356],"study_design_scores_gemma":[0.000030810686,0.00005966454,0.000105395804,0.000039975934,0.00001606678,0.00018357478,0.00004457716,0.8596343,0.0010772505,0.12590264,0.012889865,0.000015880993],"about_ca_topic_score_codex":0.0043621813,"about_ca_topic_score_gemma":0.0029513135,"teacher_disagreement_score":0.009849563,"about_ca_system_score_codex":0.0023012485,"about_ca_system_score_gemma":0.0012981329,"threshold_uncertainty_score":0.032950103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025587954,0.00020830572,0.96898806,0.00064467057,0.0000847557,0.00008824721,0.000050501556,0.00038835846,0.003959175],"genre_scores_gemma":[0.62877816,0.0005859769,0.3595151,0.00038527427,0.00031448272,0.00052651257,0.00014847584,0.0002853482,0.009460616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961171,0.001276654,0.00017702243,0.0006330102,0.001225492,0.0005706939],"domain_scores_gemma":[0.98932964,0.00558199,0.0010965735,0.0029659483,0.00067927595,0.00034656964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037855275,0.00081252924,0.0012075423,0.00090539944,0.0016730202,0.0024134468,0.0032985418,0.001845114,0.0023823562],"category_scores_gemma":[0.012674535,0.0005796095,0.001028107,0.001201315,0.0034079205,0.009725669,0.0039305054,0.0036482774,0.0007975868],"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.00035792674,0.00009957227,0.00039272345,0.00014325872,0.00003246581,0.00019662903,0.00054131035,0.13955526,0.0064759464,0.8124792,0.0025926498,0.037133086],"study_design_scores_gemma":[0.00010043193,0.00012043926,0.00009643323,0.000021312222,0.000020355279,0.000108451335,0.000050095638,0.47954538,0.007846803,0.5057704,0.006281017,0.000038830785],"about_ca_topic_score_codex":0.0009719432,"about_ca_topic_score_gemma":0.000808258,"teacher_disagreement_score":0.0037855275,"about_ca_system_score_codex":0.0014878283,"about_ca_system_score_gemma":0.0015298554,"threshold_uncertainty_score":0.020020008},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008297978,0.00023247376,0.9868187,0.0006923751,0.00006256039,0.00013096369,0.00024061918,0.0009437482,0.0025806534],"genre_scores_gemma":[0.22553784,0.00045333014,0.76398283,0.00050008233,0.00025575102,0.0005910476,0.0013738305,0.0005188774,0.0067863665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966748,0.0009138053,0.00026223643,0.00084919,0.00074932317,0.0005506551],"domain_scores_gemma":[0.9884998,0.007983839,0.00069267483,0.0016055577,0.00079044345,0.00042764112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004618323,0.0018732713,0.0022918973,0.0014242722,0.0014259246,0.0029530593,0.004540487,0.0032719653,0.0090475315],"category_scores_gemma":[0.015159697,0.0009261708,0.0018939512,0.0028217982,0.0018350694,0.0078190025,0.004104731,0.004458608,0.0015542663],"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.00046382245,0.00038365688,0.0011062857,0.00026692598,0.00009633982,0.00011685525,0.0002654564,0.6506966,0.0016307704,0.1823531,0.013918977,0.14870119],"study_design_scores_gemma":[0.000066882145,0.00004833502,0.00008720107,0.000011468843,0.00001569409,0.000039777125,0.00003554517,0.86454105,0.0006722808,0.13293464,0.0015341089,0.000013083485],"about_ca_topic_score_codex":0.0029976517,"about_ca_topic_score_gemma":0.00532668,"teacher_disagreement_score":0.0090475315,"about_ca_system_score_codex":0.0033474807,"about_ca_system_score_gemma":0.0034492367,"threshold_uncertainty_score":0.03026706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015998906,0.00016405327,0.9735126,0.00030785435,0.000058973128,0.00022683159,0.0002564834,0.004227048,0.0052472297],"genre_scores_gemma":[0.09662952,0.0001760137,0.89608335,0.0002785596,0.00006467541,0.000421315,0.0014327887,0.0006338188,0.004279969],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983542,0.00024577888,0.00012677991,0.00048330845,0.00040617882,0.00038385158],"domain_scores_gemma":[0.99778193,0.0007355817,0.00022906288,0.00085072365,0.00023081143,0.00017198837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009756339,0.0012340217,0.0010752523,0.0014687729,0.0011454795,0.0020431858,0.0028282122,0.0016726681,0.012294687],"category_scores_gemma":[0.00376859,0.00079459144,0.002136219,0.0018792874,0.0011603561,0.004981476,0.0044713505,0.0022759151,0.004445422],"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.0010601406,0.0007443678,0.002251294,0.0007030301,0.00017387189,0.00021853515,0.0005411991,0.050183512,0.044390433,0.09553753,0.032370288,0.7718258],"study_design_scores_gemma":[0.000649434,0.00069435494,0.0022960978,0.000115891,0.00021785939,0.001032549,0.00040062724,0.6351231,0.05167815,0.26291,0.044709172,0.00017278003],"about_ca_topic_score_codex":0.0016816917,"about_ca_topic_score_gemma":0.0028474499,"teacher_disagreement_score":0.012294687,"about_ca_system_score_codex":0.001404762,"about_ca_system_score_gemma":0.0017984563,"threshold_uncertainty_score":0.041129827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09932126,0.0024071953,0.8663508,0.0018589632,0.00015269053,0.00015176664,0.0004780824,0.0003299698,0.02894929],"genre_scores_gemma":[0.5960359,0.002377514,0.38813496,0.0006890778,0.0003373245,0.00044621163,0.00066154177,0.0002517398,0.0110656265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891484,0.00039045623,0.000045914567,0.00019334331,0.00022705863,0.00022836836],"domain_scores_gemma":[0.9974611,0.0019257023,0.00026321382,0.00009679993,0.00014263245,0.000110398956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020671603,0.001470247,0.0013325283,0.0012772098,0.0009091361,0.0023625933,0.0010953044,0.0019088346,0.0046318937],"category_scores_gemma":[0.0057079038,0.0010917843,0.0015445461,0.0030820859,0.0014089241,0.004302402,0.00151289,0.0029477277,0.00040193254],"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.00015655078,0.00020627804,0.00068369054,0.00027113652,0.000056847883,0.00021751369,0.0003133622,0.7075287,0.0014154627,0.2662064,0.0034200018,0.019524084],"study_design_scores_gemma":[0.00002206458,0.000036679536,0.00016561904,0.000021343832,0.000013762241,0.000062027575,0.000052007992,0.9121754,0.00049088994,0.08458865,0.00236119,0.000010395986],"about_ca_topic_score_codex":0.0029318084,"about_ca_topic_score_gemma":0.0022533038,"teacher_disagreement_score":0.0046318937,"about_ca_system_score_codex":0.0023447524,"about_ca_system_score_gemma":0.0010426487,"threshold_uncertainty_score":0.017012477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046204068,0.0026645567,0.6198014,0.004001425,0.0010925129,0.0005881172,0.004383977,0.001546589,0.31971732],"genre_scores_gemma":[0.4064302,0.0048976885,0.3376331,0.004891208,0.0011259239,0.0011476742,0.017835034,0.0015134938,0.22452565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861467,0.00026657543,0.00008166715,0.00041596283,0.0003756965,0.00024543094],"domain_scores_gemma":[0.99736243,0.00095247553,0.0002803485,0.0006333843,0.0005734313,0.00019792476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007460489,0.0008351257,0.00080490886,0.0015006178,0.003141765,0.0024160706,0.0026345002,0.0010260674,0.036719967],"category_scores_gemma":[0.0039877226,0.00051992276,0.001340962,0.0024719846,0.0014827542,0.0057578385,0.003096965,0.0024034462,0.007834388],"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.00005388999,0.00006836016,0.000891935,0.00019780065,0.000032061464,0.00025340912,0.00026369686,0.003267336,0.0009616358,0.9155798,0.024955075,0.053475037],"study_design_scores_gemma":[0.00003274769,0.000035763544,0.0004995024,0.000073275165,0.000044044016,0.0008667544,0.0002802743,0.0070152124,0.0015929979,0.70913,0.28040534,0.000024118874],"about_ca_topic_score_codex":0.0025819184,"about_ca_topic_score_gemma":0.0036091853,"teacher_disagreement_score":0.036719967,"about_ca_system_score_codex":0.0014381778,"about_ca_system_score_gemma":0.0012517353,"threshold_uncertainty_score":0.12284058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032829836,0.000997681,0.94604284,0.0005694762,0.00017371868,0.00015143605,0.0008977335,0.0030931174,0.01524421],"genre_scores_gemma":[0.3597301,0.0010101806,0.6234173,0.0007534077,0.00043110122,0.00063160615,0.0028370244,0.0006740406,0.010515241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942478,0.0006213906,0.00047564218,0.0012826495,0.0026387975,0.0007336882],"domain_scores_gemma":[0.9923409,0.0018385253,0.0006529286,0.004003104,0.00091518287,0.0002494497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013093331,0.0013022405,0.0017829913,0.002090402,0.0010638539,0.003201284,0.0048138145,0.0013340598,0.010085296],"category_scores_gemma":[0.0108287,0.00065913075,0.0015097571,0.005526169,0.0019029306,0.01040689,0.0072296727,0.0028052935,0.0028484736],"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.00087512715,0.00030724044,0.003934962,0.00055693026,0.00011828228,0.0002737943,0.0004405034,0.12125175,0.022713212,0.36557046,0.024194758,0.45976302],"study_design_scores_gemma":[0.00010898184,0.00023114403,0.0010691268,0.00007721576,0.000078008015,0.0006985056,0.00018123297,0.6388398,0.018021166,0.29903185,0.041548967,0.00011400099],"about_ca_topic_score_codex":0.0019464801,"about_ca_topic_score_gemma":0.0018084412,"teacher_disagreement_score":0.010085296,"about_ca_system_score_codex":0.0016150536,"about_ca_system_score_gemma":0.0015719,"threshold_uncertainty_score":0.033738613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12456146,0.0010152931,0.8508173,0.002896179,0.00018621288,0.00024858912,0.0010310751,0.0049879937,0.014255818],"genre_scores_gemma":[0.5591396,0.0006212975,0.4276135,0.0007201427,0.0001584214,0.00033269837,0.0013494798,0.0006235621,0.009441286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778265,0.00044850717,0.00013508264,0.0006966458,0.00048205935,0.00045506164],"domain_scores_gemma":[0.9891349,0.0072989403,0.0005775278,0.0019003579,0.0005871716,0.0005009854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012908352,0.00108742,0.001168601,0.0005797908,0.0008839584,0.0015267907,0.0020818848,0.0019881707,0.006028649],"category_scores_gemma":[0.017211188,0.0005754884,0.0013246672,0.0009732285,0.002015066,0.0047395728,0.0028881703,0.0027549434,0.0012093437],"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.0022469484,0.0003177543,0.0056045577,0.0011435472,0.00016449305,0.0005458184,0.0011542994,0.60459054,0.014113603,0.19662686,0.015227877,0.15826367],"study_design_scores_gemma":[0.00015403569,0.0001743999,0.00048550326,0.000048417784,0.000047291593,0.00016862311,0.00009594285,0.7372419,0.0038771816,0.24889733,0.00877826,0.00003100243],"about_ca_topic_score_codex":0.0038837497,"about_ca_topic_score_gemma":0.005048534,"teacher_disagreement_score":0.006028649,"about_ca_system_score_codex":0.0016995901,"about_ca_system_score_gemma":0.0020347899,"threshold_uncertainty_score":0.020167828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020875128,0.0023920878,0.9455814,0.0032400428,0.00041543957,0.0007925519,0.010146701,0.0110516185,0.005505103],"genre_scores_gemma":[0.2023782,0.0019392226,0.75570834,0.0025148639,0.0005874972,0.0026999086,0.02333941,0.0024393676,0.008393247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99145585,0.0017187578,0.0016466732,0.0015318324,0.0029998387,0.0006471413],"domain_scores_gemma":[0.9612814,0.015529556,0.002471507,0.016498344,0.0035737925,0.0006452829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056563565,0.0017321199,0.0023534982,0.00244209,0.0021967627,0.005052351,0.0049329037,0.0025864646,0.015133435],"category_scores_gemma":[0.038396668,0.0016839058,0.0021691548,0.007268584,0.0022837624,0.024254877,0.007946147,0.0054379934,0.0052636657],"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.0024965727,0.00047225508,0.004821545,0.0016886801,0.00021869125,0.0004353153,0.0012542696,0.055376396,0.013395638,0.4424328,0.09149181,0.38591594],"study_design_scores_gemma":[0.0004256952,0.00051649194,0.000570866,0.00036454468,0.00012306779,0.0006517974,0.00047781208,0.21606651,0.017159618,0.66160804,0.10188721,0.00014834097],"about_ca_topic_score_codex":0.0022582286,"about_ca_topic_score_gemma":0.0034202605,"teacher_disagreement_score":0.015133435,"about_ca_system_score_codex":0.003220059,"about_ca_system_score_gemma":0.0034868985,"threshold_uncertainty_score":0.050626397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14579394,0.012254845,0.81690836,0.0060410844,0.00048270516,0.00017005397,0.0006136981,0.001161007,0.016574347],"genre_scores_gemma":[0.8702073,0.009954402,0.10890579,0.0014244922,0.0015106885,0.00042253648,0.00079257484,0.001725268,0.0050569284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99568474,0.001141104,0.00021606266,0.0012907445,0.000743895,0.0009234798],"domain_scores_gemma":[0.9049739,0.078505926,0.005119987,0.005747787,0.0025685905,0.0030838463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060252887,0.0023689293,0.0026844544,0.0039055767,0.0026186348,0.0044459663,0.0036888726,0.0035662637,0.0064535607],"category_scores_gemma":[0.069785915,0.0013388806,0.0024297463,0.0043012374,0.0057691694,0.02156834,0.0040577683,0.006244033,0.001404732],"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.0009100633,0.00025781264,0.008539911,0.0009978946,0.0002500348,0.0006287187,0.002118349,0.20497507,0.0146335475,0.68286467,0.0108831795,0.07294088],"study_design_scores_gemma":[0.000052625233,0.00020613873,0.0019513594,0.00014162385,0.0001764771,0.0004574888,0.00044659863,0.31320986,0.003836329,0.67283046,0.006570362,0.00012063948],"about_ca_topic_score_codex":0.002773824,"about_ca_topic_score_gemma":0.0020350756,"teacher_disagreement_score":0.0064535607,"about_ca_system_score_codex":0.003947002,"about_ca_system_score_gemma":0.0014412248,"threshold_uncertainty_score":0.03186512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3089305,0.0016534418,0.61789215,0.002606654,0.00021386906,0.00022836436,0.00021403577,0.00039928991,0.06786173],"genre_scores_gemma":[0.9748409,0.00074425293,0.01939647,0.00019156534,0.00011344243,0.00014255002,0.000043556138,0.0000558589,0.0044715647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794656,0.000902282,0.00009164817,0.00022652293,0.0004708414,0.00036215803],"domain_scores_gemma":[0.98409826,0.011841611,0.0016719291,0.00063486694,0.00067770755,0.0010756281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037774623,0.001593171,0.0012029038,0.0019049947,0.0011152979,0.0030214605,0.0019220033,0.0015769881,0.0035144363],"category_scores_gemma":[0.020976242,0.0005893644,0.0010673861,0.0008507963,0.005021009,0.0057950765,0.002360562,0.0021378766,0.0002527396],"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.00023467944,0.000109828834,0.0008484466,0.00013841281,0.00009060995,0.0001239622,0.00023599101,0.27384377,0.0020801472,0.7024302,0.0011599229,0.018704046],"study_design_scores_gemma":[0.000059323796,0.00011296061,0.00020312017,0.000031901436,0.000034214154,0.00006193297,0.000089022615,0.45687014,0.00097222434,0.5402834,0.0012406225,0.00004109506],"about_ca_topic_score_codex":0.0029176387,"about_ca_topic_score_gemma":0.0018359605,"teacher_disagreement_score":0.0037774623,"about_ca_system_score_codex":0.0033733996,"about_ca_system_score_gemma":0.0018328191,"threshold_uncertainty_score":0.024475813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3163125,0.004623321,0.64509475,0.0051379,0.00034607112,0.0002885866,0.0006485864,0.0014979194,0.026050402],"genre_scores_gemma":[0.9115172,0.0015404605,0.08245182,0.00040706628,0.00026596634,0.00026351406,0.00027978045,0.00040514802,0.0028689462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928584,0.0024612024,0.000321187,0.0010443658,0.0016786839,0.0016360951],"domain_scores_gemma":[0.87009126,0.110900074,0.006283675,0.0077402196,0.0023921712,0.0025926786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008596812,0.0011354369,0.001338033,0.0012530407,0.0019165138,0.0035045578,0.0021686917,0.001819588,0.0039324793],"category_scores_gemma":[0.07282222,0.00071129337,0.0008842596,0.0014670353,0.0027750677,0.008129937,0.0029631655,0.0028029587,0.0006548286],"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.0044744257,0.0004941949,0.0034404409,0.00083239144,0.00015470687,0.0003420894,0.001250055,0.59188676,0.033780664,0.27846473,0.005832421,0.0790471],"study_design_scores_gemma":[0.00014394773,0.00050922134,0.0008608231,0.000080665,0.00010277733,0.0002427042,0.0002493782,0.85953003,0.010169306,0.12554349,0.002507373,0.000060316102],"about_ca_topic_score_codex":0.0007793252,"about_ca_topic_score_gemma":0.0010969416,"teacher_disagreement_score":0.008596812,"about_ca_system_score_codex":0.0029589746,"about_ca_system_score_gemma":0.0024412863,"threshold_uncertainty_score":0.045464814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034069985,0.00037309484,0.95439947,0.0005264607,0.00006315766,0.00017664692,0.0009832195,0.0009064579,0.008501558],"genre_scores_gemma":[0.46131328,0.00034923642,0.52950054,0.0002030376,0.00008568132,0.0002892181,0.0012558408,0.00017579344,0.0068272855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983493,0.00040702565,0.00006785656,0.0003709172,0.0003938425,0.00041115563],"domain_scores_gemma":[0.9982667,0.000653893,0.00023564101,0.0004965429,0.00021014024,0.00013709196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008332085,0.0010888609,0.0012265783,0.0008367929,0.00066292676,0.0015684076,0.002828777,0.0018446178,0.011860378],"category_scores_gemma":[0.0047972975,0.00062953203,0.0010116324,0.0034171639,0.00065144175,0.0038562869,0.002417918,0.0020591551,0.0014670066],"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.00019551082,0.0001567228,0.0010201148,0.00026915778,0.00004601349,0.0001336699,0.000067531175,0.8114824,0.0016353115,0.08713216,0.0096423775,0.088218965],"study_design_scores_gemma":[0.000037035956,0.00007814734,0.0003517293,0.000014902781,0.000015182964,0.00011783468,0.00003823562,0.94452864,0.00094134465,0.049107105,0.0047525093,0.000017345677],"about_ca_topic_score_codex":0.009157193,"about_ca_topic_score_gemma":0.008213611,"teacher_disagreement_score":0.011860378,"about_ca_system_score_codex":0.0023585854,"about_ca_system_score_gemma":0.0015106536,"threshold_uncertainty_score":0.039676905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17244053,0.0006238917,0.8168623,0.00066951016,0.00009388693,0.00008868248,0.00004059994,0.00025941484,0.008921185],"genre_scores_gemma":[0.9646684,0.00038766058,0.03059993,0.00007266956,0.000069936366,0.00007704454,0.000029754547,0.000034845296,0.004059732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992411,0.00028415897,0.000027550945,0.00015023803,0.00016739851,0.00012962821],"domain_scores_gemma":[0.9977715,0.0013160405,0.0003735829,0.00024188071,0.00018719117,0.00010975129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849604,0.0005911044,0.0006540558,0.00045659,0.00072274543,0.0012905292,0.0012561375,0.0009117645,0.0015239938],"category_scores_gemma":[0.0046912665,0.00028880103,0.00033780726,0.00070349197,0.0014789687,0.002632047,0.0012509873,0.0007165294,0.00027593525],"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.000114586386,0.000051332092,0.0005205557,0.00006442934,0.00003327468,0.00010808958,0.00013983494,0.916131,0.0034743533,0.06429674,0.0005385129,0.014527189],"study_design_scores_gemma":[0.000016577706,0.00003094936,0.000062601626,0.0000034144973,0.0000046746013,0.000017842687,0.000019340221,0.9728749,0.000518567,0.025659846,0.00078706373,0.0000041118883],"about_ca_topic_score_codex":0.0016718681,"about_ca_topic_score_gemma":0.0011130929,"teacher_disagreement_score":0.0016718681,"about_ca_system_score_codex":0.0009828578,"about_ca_system_score_gemma":0.00045222984,"threshold_uncertainty_score":0.0071310997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13058424,0.0017613088,0.83423513,0.0026785247,0.00031109276,0.0009333415,0.0024674195,0.0056121666,0.02141673],"genre_scores_gemma":[0.2175597,0.0010703483,0.7657136,0.00029102727,0.0001603732,0.0005340654,0.004014109,0.0010988902,0.009557887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978492,0.0005181818,0.00019046308,0.0007275499,0.00040053253,0.0003140918],"domain_scores_gemma":[0.99597603,0.002183121,0.000449729,0.0007837723,0.00029938133,0.00030791416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013268718,0.0020299745,0.0016884675,0.0013674606,0.0016303455,0.0028741593,0.0029722052,0.0016118154,0.011196261],"category_scores_gemma":[0.006542698,0.0009886614,0.0017261115,0.0025793496,0.0010825518,0.010852369,0.0038005258,0.0015993036,0.0025957539],"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.001484971,0.00068892556,0.0028232052,0.0031605824,0.00034604967,0.00054726365,0.0014828228,0.25516123,0.027297733,0.1033095,0.04187528,0.5618225],"study_design_scores_gemma":[0.0006170223,0.0004997706,0.0012634741,0.00017566702,0.00020044106,0.0009190458,0.0011757858,0.5218437,0.020817408,0.41625053,0.03611876,0.00011848848],"about_ca_topic_score_codex":0.0028338134,"about_ca_topic_score_gemma":0.0051556425,"teacher_disagreement_score":0.011196261,"about_ca_system_score_codex":0.0020437858,"about_ca_system_score_gemma":0.0025233282,"threshold_uncertainty_score":0.0374552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075742374,0.00030064658,0.9864741,0.0002568209,0.00009120521,0.00013394427,0.000720057,0.0018771203,0.0025717837],"genre_scores_gemma":[0.10051043,0.00080009043,0.8871221,0.00049937953,0.0001503727,0.00054061547,0.002648414,0.0011140322,0.006614547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602747,0.00062033295,0.0006562052,0.0005321706,0.0018687698,0.0002949651],"domain_scores_gemma":[0.99108773,0.0029210844,0.0011915335,0.0033380997,0.0011829417,0.0002787668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00207549,0.0009250278,0.0010432369,0.0019312606,0.000999146,0.004020662,0.0021585145,0.0011102981,0.006111727],"category_scores_gemma":[0.012086086,0.0008041866,0.0013045085,0.004053947,0.0028041094,0.014501384,0.0035628052,0.0028280725,0.0025850935],"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.00053087226,0.00014647024,0.0014314557,0.0006919084,0.000047367037,0.00029106482,0.0009556079,0.032732565,0.030327411,0.7006647,0.012878714,0.21930185],"study_design_scores_gemma":[0.000112588285,0.00039312543,0.00049540645,0.00033688018,0.0000957104,0.00062115013,0.0003257406,0.19561304,0.09882907,0.58335674,0.11962747,0.00019310316],"about_ca_topic_score_codex":0.0010042465,"about_ca_topic_score_gemma":0.0014940033,"teacher_disagreement_score":0.006111727,"about_ca_system_score_codex":0.0019452671,"about_ca_system_score_gemma":0.0019672897,"threshold_uncertainty_score":0.020445824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14082167,0.0020507614,0.7387528,0.0041646007,0.0008635765,0.0009548147,0.0010214391,0.0031281922,0.108242184],"genre_scores_gemma":[0.6391036,0.0009981303,0.312467,0.0008983237,0.00021841314,0.00043607247,0.0009399746,0.0011083364,0.04383013],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971175,0.0004505449,0.0001272628,0.0005612638,0.00085560104,0.0008877883],"domain_scores_gemma":[0.997036,0.0008489652,0.00015282437,0.0015352862,0.00028503852,0.00014189235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015827969,0.0022208567,0.002474262,0.0010781012,0.0013592803,0.0044180215,0.0031290492,0.0018818894,0.045244638],"category_scores_gemma":[0.007151072,0.00072237843,0.0013416486,0.0025316614,0.0008142192,0.008972271,0.0029466727,0.00272917,0.006156171],"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.0009928279,0.0009453234,0.0012273734,0.0005430633,0.00020643635,0.00035704908,0.00033028447,0.35538512,0.017232373,0.18432364,0.036979217,0.40147734],"study_design_scores_gemma":[0.00022787593,0.00033692239,0.0006627822,0.000092464674,0.00016261285,0.0005726457,0.00036419104,0.7681853,0.006997572,0.17966262,0.042663395,0.000071650546],"about_ca_topic_score_codex":0.0050035757,"about_ca_topic_score_gemma":0.007976279,"teacher_disagreement_score":0.045244638,"about_ca_system_score_codex":0.0029082708,"about_ca_system_score_gemma":0.0036712585,"threshold_uncertainty_score":0.15135837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018981751,0.00007549228,0.97464716,0.00009199689,0.00006261629,0.00007613039,0.00013435447,0.0012703722,0.004660046],"genre_scores_gemma":[0.15473539,0.00021400263,0.8375064,0.00009056431,0.000031405914,0.000114065966,0.00060511817,0.00066428556,0.0060387],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947304,0.00005653299,0.000032621574,0.00012357518,0.00025208323,0.00006212772],"domain_scores_gemma":[0.99937135,0.00014840174,0.00006784744,0.00024281905,0.00013062966,0.00003898533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035104365,0.0006230504,0.00054030196,0.0010978036,0.00050193607,0.00083612057,0.0008701215,0.0005934106,0.0067739813],"category_scores_gemma":[0.0023061924,0.000564481,0.00081897987,0.00084003486,0.00088490144,0.0014675221,0.0024100877,0.0012999325,0.0012036981],"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.00019918496,0.000081141465,0.0012565955,0.000260164,0.000047667043,0.0003144471,0.0003881763,0.10476485,0.050730176,0.16924454,0.010250998,0.66246206],"study_design_scores_gemma":[0.00007907671,0.00021625453,0.0009921548,0.000066074965,0.00007124234,0.0010028358,0.00032089843,0.6218297,0.05572915,0.22754999,0.09205962,0.00008302467],"about_ca_topic_score_codex":0.0010218468,"about_ca_topic_score_gemma":0.0014551952,"teacher_disagreement_score":0.0067739813,"about_ca_system_score_codex":0.00040233604,"about_ca_system_score_gemma":0.00036659164,"threshold_uncertainty_score":0.02266121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053757984,0.0030003863,0.9289062,0.0018326734,0.00009640505,0.00024249914,0.0006130461,0.00077156443,0.010779322],"genre_scores_gemma":[0.5844526,0.0018685126,0.4039394,0.000809184,0.0003332148,0.00051479595,0.0011838301,0.0003073802,0.006591066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977794,0.00092811295,0.00008453269,0.00046572636,0.0004937305,0.0002484421],"domain_scores_gemma":[0.9947731,0.0035596509,0.000516446,0.0006417144,0.0002524912,0.0002565965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037335095,0.0019975682,0.0028599738,0.0013758844,0.0011293559,0.0025991574,0.0031079832,0.001829528,0.004603413],"category_scores_gemma":[0.011802666,0.00077698834,0.0012897102,0.003946644,0.0016692191,0.007662277,0.002973244,0.002838991,0.0009986669],"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.0006828344,0.0005819286,0.0020805472,0.00051482324,0.00023195277,0.00025095278,0.0003209043,0.57802135,0.0029412026,0.171244,0.016025053,0.22710432],"study_design_scores_gemma":[0.00007080103,0.00013856418,0.00034174562,0.000033073073,0.000034585297,0.00017749761,0.00006739479,0.7910768,0.0011108295,0.2036454,0.0032822096,0.000021156977],"about_ca_topic_score_codex":0.0014046966,"about_ca_topic_score_gemma":0.0015030196,"teacher_disagreement_score":0.004603413,"about_ca_system_score_codex":0.0021860383,"about_ca_system_score_gemma":0.0012434231,"threshold_uncertainty_score":0.019744933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09886861,0.0004548433,0.8639436,0.0023735776,0.00019867068,0.00014947746,0.00032690098,0.002264241,0.03142019],"genre_scores_gemma":[0.6720391,0.00085341634,0.27011323,0.0012161396,0.00044157304,0.00050051505,0.00094153336,0.00047404284,0.05342046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847096,0.00034548918,0.00006062862,0.00032802977,0.00045885437,0.00033608897],"domain_scores_gemma":[0.9987041,0.0004277502,0.00014749783,0.0004479166,0.00015143432,0.00012127589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008621735,0.0006845875,0.0008032194,0.00067962817,0.0011222145,0.0023806873,0.002542517,0.0016640812,0.009889338],"category_scores_gemma":[0.0022084475,0.00039173188,0.0012453384,0.0011218346,0.0026293409,0.0058515,0.0018240719,0.0020267505,0.0022354545],"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.00052849844,0.00016455143,0.0006234668,0.00018087958,0.00003296708,0.00053146173,0.0003071865,0.11169034,0.010869653,0.8326046,0.0095476555,0.032918647],"study_design_scores_gemma":[0.00014082609,0.00025708452,0.00033647093,0.000018839142,0.00003551722,0.00028653987,0.00018409283,0.45325032,0.009403518,0.50908595,0.026955407,0.00004545265],"about_ca_topic_score_codex":0.0018656303,"about_ca_topic_score_gemma":0.001723412,"teacher_disagreement_score":0.009889338,"about_ca_system_score_codex":0.0014928104,"about_ca_system_score_gemma":0.0012579334,"threshold_uncertainty_score":0.03308314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054132424,0.0021708317,0.91413474,0.003750871,0.0002661066,0.0003961375,0.002923772,0.004611059,0.017614016],"genre_scores_gemma":[0.4991557,0.0011425704,0.4841374,0.001183534,0.00037509433,0.0005612663,0.004419784,0.000997353,0.008027201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965844,0.0007722102,0.00019568524,0.0009114927,0.00057387265,0.00096236734],"domain_scores_gemma":[0.9940952,0.0030447254,0.00069857825,0.0012644998,0.00040154366,0.00049550604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022760376,0.0027214484,0.00321469,0.0013557728,0.001590052,0.004181356,0.0065459874,0.0034665272,0.009514667],"category_scores_gemma":[0.010412706,0.0011137011,0.0021895482,0.003703345,0.0015200452,0.007883645,0.0034493005,0.00444346,0.0026828223],"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.0013521927,0.00072013435,0.0023893388,0.0011521737,0.00022743667,0.00025487674,0.00057063124,0.717512,0.0040524136,0.102958046,0.04244742,0.1263632],"study_design_scores_gemma":[0.00015528331,0.00013432128,0.00028797446,0.000057732366,0.000051104304,0.00022755096,0.00015056517,0.8945211,0.0012991796,0.09783752,0.0052484744,0.000029171888],"about_ca_topic_score_codex":0.006009651,"about_ca_topic_score_gemma":0.0062620994,"teacher_disagreement_score":0.009514667,"about_ca_system_score_codex":0.0055529284,"about_ca_system_score_gemma":0.0032653906,"threshold_uncertainty_score":0.04028952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033379296,0.0015735521,0.0002823404,0.01943073,0.97024363,0.00004397025,0.00019612993,0.0001536958,0.008042573],"genre_scores_gemma":[0.000857808,0.0036491253,0.00030589954,0.012708013,0.9048572,0.000062532294,0.00030310894,0.00023322896,0.07702307],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938829,0.0006691415,0.00067462923,0.0008730493,0.0033881946,0.00051214953],"domain_scores_gemma":[0.96003467,0.0077687562,0.0020757036,0.0020180785,0.021366978,0.006735868],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0058690626,0.0029025741,0.003430962,0.0038104882,0.0025753886,0.00876321,0.0038857684,0.008032443,0.19058268],"category_scores_gemma":[0.051624928,0.0008480597,0.001994913,0.0019151433,0.0017357887,0.004512765,0.0018362053,0.010420207,0.14179988],"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.000028304758,0.0000071038103,0.000012961618,0.00013244474,0.000006120411,0.000053193897,0.0000035119222,0.000021093772,0.00003158663,0.00038469932,0.9921178,0.007201116],"study_design_scores_gemma":[0.000026234213,0.00001096417,0.000056301276,0.00018533209,0.0000106227235,0.000120562465,0.000013221416,0.000072001225,0.000067583955,0.0008880182,0.99854255,0.000006697994],"about_ca_topic_score_codex":0.00057852856,"about_ca_topic_score_gemma":0.0012683088,"teacher_disagreement_score":0.8094173,"about_ca_system_score_codex":0.001990205,"about_ca_system_score_gemma":0.0032470669,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86938894,0.00037369734,0.11582668,0.00031706633,0.000052348336,0.0000656512,0.00021451477,0.0002818268,0.013479196],"genre_scores_gemma":[0.9797146,0.000113859205,0.016681142,0.000037366743,0.00003168245,0.000089894034,0.00012311808,0.0000825158,0.0031258743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938786,0.000181791,0.000037714715,0.00011612807,0.00011048317,0.0001660356],"domain_scores_gemma":[0.99334115,0.0039589433,0.001186659,0.0005834028,0.00037313023,0.0005567235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014325195,0.00033694654,0.0004405836,0.00140869,0.0006958211,0.0017696501,0.00088910863,0.0006225431,0.004661506],"category_scores_gemma":[0.01521882,0.00046065266,0.00062213506,0.0005107455,0.00168276,0.001703951,0.0009839906,0.0006507452,0.00037562763],"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.000858955,0.0000964323,0.016499862,0.00019442147,0.00007866763,0.000507224,0.0006703291,0.27513117,0.011314907,0.6683062,0.0025574202,0.023784485],"study_design_scores_gemma":[0.00006956283,0.00014038925,0.0043032407,0.00004695129,0.000026541318,0.0003370875,0.00017651227,0.7821967,0.005083093,0.204902,0.0026833205,0.00003459918],"about_ca_topic_score_codex":0.0009782959,"about_ca_topic_score_gemma":0.0010258816,"teacher_disagreement_score":0.004661506,"about_ca_system_score_codex":0.0014432521,"about_ca_system_score_gemma":0.00067942933,"threshold_uncertainty_score":0.015594244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005044668,0.0012549486,0.9872104,0.0006341564,0.00015981881,0.000053781394,0.0000444145,0.00025523096,0.005342598],"genre_scores_gemma":[0.2724125,0.005107436,0.7133961,0.0009418232,0.0006210188,0.0003791734,0.00022840471,0.00037214166,0.006541419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966434,0.0012205574,0.00018267446,0.0004750472,0.0012491167,0.00022908971],"domain_scores_gemma":[0.99538594,0.003235612,0.00037188377,0.00051095366,0.0002925473,0.00020315166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002700624,0.0015649467,0.0016849467,0.0013426917,0.0011809535,0.0024000427,0.0018040661,0.0016175552,0.0050845747],"category_scores_gemma":[0.009701415,0.0007561341,0.0021157567,0.0033035951,0.0024966425,0.002401867,0.0031439804,0.0069149956,0.001009839],"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.0000748609,0.00010088538,0.00029538345,0.00034617315,0.000047846643,0.00012531917,0.00021634273,0.29239124,0.0034892582,0.6126296,0.0046322243,0.0856509],"study_design_scores_gemma":[0.000028188539,0.00006035462,0.00010966532,0.000052316827,0.00001132939,0.00009723159,0.000034611214,0.73419267,0.0012736447,0.25832677,0.0057880683,0.000025108207],"about_ca_topic_score_codex":0.0017390174,"about_ca_topic_score_gemma":0.0014408763,"teacher_disagreement_score":0.0050845747,"about_ca_system_score_codex":0.0015988218,"about_ca_system_score_gemma":0.0015650466,"threshold_uncertainty_score":0.017009616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07482471,0.00018427592,0.9171687,0.00054908806,0.000038981627,0.00007653786,0.00012778732,0.00032978525,0.0067001283],"genre_scores_gemma":[0.79401755,0.000355551,0.19889674,0.00019002709,0.000055053242,0.00022119253,0.00019999745,0.00016564217,0.0058981664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993686,0.00015160808,0.000026447868,0.0002195607,0.00012634105,0.000107557404],"domain_scores_gemma":[0.99896264,0.00047882655,0.0002033133,0.00015802753,0.00011381689,0.000083400555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008120272,0.00087112404,0.00088102004,0.00055476325,0.0005576467,0.0011346218,0.0011974536,0.000794775,0.0038321537],"category_scores_gemma":[0.003155317,0.0003868979,0.00057064224,0.00072202645,0.0009683689,0.002641447,0.0009122294,0.00073638256,0.00042889928],"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.00021597296,0.000073318835,0.00060812326,0.0001499988,0.000036391288,0.00014845529,0.00011390498,0.8737831,0.015968122,0.06506,0.0026406667,0.04120189],"study_design_scores_gemma":[0.000029089362,0.000143722,0.00019775465,0.0000136617755,0.000023356733,0.00011100692,0.000047735695,0.95332986,0.005481254,0.037959363,0.0026512905,0.000011958818],"about_ca_topic_score_codex":0.0011555826,"about_ca_topic_score_gemma":0.001445099,"teacher_disagreement_score":0.0038321537,"about_ca_system_score_codex":0.0011451767,"about_ca_system_score_gemma":0.00062941026,"threshold_uncertainty_score":0.012819886},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81744117,0.0012646625,0.16584682,0.00181702,0.00007116166,0.00007331436,0.00048074542,0.0013599703,0.011645146],"genre_scores_gemma":[0.9795569,0.00040562215,0.017118022,0.00021112569,0.000045152497,0.00013125068,0.00020802858,0.00020191936,0.00212183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830246,0.00025568332,0.00011081563,0.00039436485,0.000319154,0.0006174466],"domain_scores_gemma":[0.97350514,0.02064152,0.0018326888,0.0025303673,0.0006056208,0.0008846691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011977182,0.0007744701,0.0011962474,0.00075380993,0.0012869445,0.002427951,0.0019111908,0.0012974592,0.005008502],"category_scores_gemma":[0.015160474,0.00061597745,0.0009340771,0.0007703676,0.0022584079,0.0073952186,0.0033810025,0.0023379037,0.0005910635],"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.005797451,0.00050805847,0.0077521275,0.0012816117,0.00024411123,0.0014305699,0.002283473,0.42295176,0.089437515,0.38185763,0.006072299,0.080383405],"study_design_scores_gemma":[0.00024620892,0.0004993551,0.0017480226,0.000099356985,0.00015457251,0.00070715934,0.0005153238,0.5800928,0.036721904,0.37483376,0.004305626,0.00007594765],"about_ca_topic_score_codex":0.0010785274,"about_ca_topic_score_gemma":0.0011296828,"teacher_disagreement_score":0.005008502,"about_ca_system_score_codex":0.0016184996,"about_ca_system_score_gemma":0.0011734404,"threshold_uncertainty_score":0.016755044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032156378,0.0019688401,0.99011606,0.0005492246,0.0001649294,0.0000753742,0.00019801287,0.00044515906,0.0032666752],"genre_scores_gemma":[0.25053883,0.0058067883,0.7213398,0.0007079735,0.0008748215,0.0006903069,0.0019929719,0.00071033754,0.017338142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958972,0.0014204835,0.00026107847,0.00077544304,0.0013015785,0.00034430885],"domain_scores_gemma":[0.9911231,0.004550137,0.0007605289,0.0017990881,0.0014546732,0.00031245878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005410288,0.002106879,0.002724314,0.0025467372,0.0014149083,0.0032704603,0.0053818463,0.0032826115,0.0070492383],"category_scores_gemma":[0.024007378,0.000985902,0.0021794797,0.00521793,0.0018827281,0.005102674,0.004826842,0.0049814563,0.002884753],"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.00028760938,0.00007701412,0.0008070117,0.000526162,0.00013994856,0.00009895279,0.00031466124,0.633333,0.0011512103,0.22517858,0.015664713,0.12242106],"study_design_scores_gemma":[0.000024551144,0.00004436329,0.00012286851,0.00005616737,0.000020809775,0.000059916863,0.00004399753,0.8762715,0.00033169723,0.116719745,0.0062865256,0.000018026318],"about_ca_topic_score_codex":0.0051089474,"about_ca_topic_score_gemma":0.0037965812,"teacher_disagreement_score":0.0070492383,"about_ca_system_score_codex":0.0038909083,"about_ca_system_score_gemma":0.0020866115,"threshold_uncertainty_score":0.028612673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049793243,0.00089427864,0.9412731,0.00053193764,0.00006929532,0.00014033113,0.0004573897,0.00068899913,0.006151457],"genre_scores_gemma":[0.51718664,0.0010312046,0.47214523,0.00039588055,0.00017096277,0.00042792427,0.00095797534,0.00026100676,0.0074232216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976526,0.00079395453,0.00014698438,0.0003892016,0.0007002763,0.00031707567],"domain_scores_gemma":[0.994968,0.0028438843,0.0004105822,0.0009299343,0.0005196282,0.00032791676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018173825,0.0006193981,0.0016347163,0.00095997966,0.00070297555,0.0021058654,0.0023647086,0.0012612189,0.0043313084],"category_scores_gemma":[0.012753038,0.0005474,0.00069339556,0.0029438536,0.0010999517,0.0058052535,0.0020604206,0.0013673214,0.0012590715],"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.00051541725,0.00030903495,0.0019313868,0.00039575965,0.00007961198,0.00018023151,0.00032551755,0.39083818,0.0050385566,0.4140162,0.01309879,0.17327128],"study_design_scores_gemma":[0.00006162872,0.00016423278,0.00015825595,0.000016283284,0.000015839765,0.00012206677,0.00004031501,0.84242594,0.001169907,0.15070368,0.0051074536,0.000014340774],"about_ca_topic_score_codex":0.0017765125,"about_ca_topic_score_gemma":0.0020024334,"teacher_disagreement_score":0.0043313084,"about_ca_system_score_codex":0.0013130377,"about_ca_system_score_gemma":0.001391521,"threshold_uncertainty_score":0.01448971},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033638746,0.0008139488,0.9476537,0.0013114542,0.00026420638,0.0003783236,0.0007356115,0.0044004847,0.010803435],"genre_scores_gemma":[0.12658885,0.00037023102,0.86509794,0.00045483332,0.000109752495,0.00045511557,0.0020800836,0.0005007941,0.004342412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858886,0.00022904336,0.00008878329,0.0003562016,0.0004232771,0.00031372235],"domain_scores_gemma":[0.99857366,0.00059160724,0.00012433932,0.00042598098,0.0001722094,0.00011207985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009181083,0.0019285209,0.0015200308,0.0013894651,0.0009309235,0.0016583367,0.002718502,0.002199435,0.009850191],"category_scores_gemma":[0.004515752,0.000739165,0.0017178949,0.002482859,0.0007926958,0.0037751014,0.0022588961,0.0031325703,0.0035834883],"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.0016021654,0.0009180702,0.0016649116,0.0006625517,0.0002209219,0.0004265341,0.00045202684,0.28577194,0.020035058,0.06566691,0.06088966,0.5616892],"study_design_scores_gemma":[0.00039167277,0.00027208746,0.0006653413,0.000062806364,0.00008376214,0.00060527114,0.00016577677,0.8789139,0.007832309,0.09474818,0.01620807,0.000050880673],"about_ca_topic_score_codex":0.004735387,"about_ca_topic_score_gemma":0.0064320564,"teacher_disagreement_score":0.009850191,"about_ca_system_score_codex":0.0023471352,"about_ca_system_score_gemma":0.0027385966,"threshold_uncertainty_score":0.03295219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13860692,0.0015329997,0.7816738,0.007835541,0.0010063505,0.00028558625,0.00086503336,0.0016762642,0.06651763],"genre_scores_gemma":[0.60852003,0.000944058,0.35586262,0.0019875106,0.00063670037,0.00033279377,0.001318712,0.00047655418,0.029921025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998792,0.00037157777,0.000084124906,0.00031130333,0.00020509322,0.00023585878],"domain_scores_gemma":[0.9964977,0.0022989505,0.00019962658,0.00047147836,0.00035916237,0.00017326053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012631972,0.00064357975,0.0011441316,0.000798999,0.0016583849,0.0019269758,0.001371699,0.0015729662,0.011649162],"category_scores_gemma":[0.00818381,0.00058178266,0.0011279124,0.001094582,0.001573907,0.005528253,0.0021495884,0.0027411154,0.0015186758],"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.0006802367,0.0003521667,0.0021010505,0.00073080254,0.0001613892,0.00069196144,0.00072267256,0.077272765,0.0042106416,0.6254253,0.04785826,0.2397928],"study_design_scores_gemma":[0.00013227436,0.00014830027,0.00018895675,0.00006036973,0.00003918321,0.00027480017,0.00030414198,0.14882156,0.0021812932,0.83652186,0.011298753,0.000028434359],"about_ca_topic_score_codex":0.0019922832,"about_ca_topic_score_gemma":0.0019425055,"teacher_disagreement_score":0.011649162,"about_ca_system_score_codex":0.0007462988,"about_ca_system_score_gemma":0.0015914692,"threshold_uncertainty_score":0.03897035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055627762,0.0011027723,0.9820734,0.00048298677,0.00020708093,0.000109373825,0.00014662575,0.0011140511,0.009200982],"genre_scores_gemma":[0.09410464,0.0011009917,0.8926429,0.0005365365,0.00026402567,0.00044138962,0.0009081784,0.00077109993,0.009230239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588543,0.0010374824,0.00033562168,0.0012694552,0.001105497,0.00036647732],"domain_scores_gemma":[0.9941577,0.003420286,0.00033439032,0.0012591531,0.00067878264,0.00014958154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026822852,0.0032249896,0.002636729,0.0029043064,0.0012707266,0.0032077865,0.0032618789,0.003572099,0.01432366],"category_scores_gemma":[0.019428395,0.001343477,0.0026469296,0.0037007001,0.0022692936,0.008583334,0.0057214918,0.0056133117,0.0044946703],"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.00034896613,0.00024493758,0.0008117978,0.00061957067,0.00012480502,0.000106434345,0.00034117894,0.30966744,0.002562977,0.3165459,0.016739447,0.3518865],"study_design_scores_gemma":[0.00010369479,0.000106463165,0.00015910827,0.00008850423,0.000045128592,0.0001301746,0.000073465155,0.6585187,0.0016472293,0.3243301,0.014762281,0.000035120385],"about_ca_topic_score_codex":0.0021732624,"about_ca_topic_score_gemma":0.0025052929,"teacher_disagreement_score":0.01432366,"about_ca_system_score_codex":0.0027423408,"about_ca_system_score_gemma":0.0018786909,"threshold_uncertainty_score":0.047917366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11883907,0.0004163489,0.86827224,0.0004607536,0.000104258645,0.00008734095,0.00013596154,0.00047904623,0.011204954],"genre_scores_gemma":[0.9434606,0.00028501533,0.05157304,0.0000888374,0.000060831135,0.00016737841,0.00011613973,0.000046268222,0.0042018164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998104,0.0008495735,0.0000685553,0.00031270343,0.00037623165,0.00028895692],"domain_scores_gemma":[0.99642086,0.0019146691,0.00066033436,0.00045139264,0.00034723716,0.00020554567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013916256,0.0002927001,0.0005714385,0.0005354431,0.00094769435,0.0012772091,0.0013215641,0.0007554319,0.00128324],"category_scores_gemma":[0.006626015,0.00038354177,0.00044511893,0.00076148944,0.0015820595,0.0015353229,0.0013865802,0.0005286003,0.00037215344],"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.00021366167,0.00003761446,0.0012673355,0.00011127464,0.000041746818,0.00047211463,0.00031547318,0.6575908,0.0027115813,0.31699184,0.0020416584,0.018204942],"study_design_scores_gemma":[0.000047268277,0.000071522256,0.00025878573,0.000011824014,0.000016362437,0.00012240527,0.000101643345,0.8227721,0.0010970433,0.17196351,0.0035146172,0.000022941831],"about_ca_topic_score_codex":0.0012293075,"about_ca_topic_score_gemma":0.0009476849,"teacher_disagreement_score":0.0013916256,"about_ca_system_score_codex":0.00068451994,"about_ca_system_score_gemma":0.000643959,"threshold_uncertainty_score":0.0073596835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06683932,0.0004902413,0.9049979,0.00068435696,0.00028742943,0.0003456961,0.0006696249,0.0013181209,0.024367258],"genre_scores_gemma":[0.31565878,0.000569797,0.6680262,0.00043766957,0.00016490075,0.0004908651,0.0014680487,0.00046133247,0.012722366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978719,0.0005000114,0.00018081808,0.00035212922,0.00076132047,0.0003338245],"domain_scores_gemma":[0.9961228,0.0013991026,0.00033000438,0.0012619507,0.00066223025,0.00022395153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127383,0.0008275554,0.00087143335,0.0014888239,0.0015824008,0.001655781,0.0013946526,0.0010234358,0.006552841],"category_scores_gemma":[0.006702317,0.0007944873,0.0010203345,0.001813413,0.0014248963,0.0037642224,0.0031891572,0.001973578,0.0025090147],"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.00048755764,0.00020494335,0.0009272124,0.00038732958,0.0000363117,0.00046490168,0.00076910114,0.024359645,0.03018755,0.70538443,0.009979755,0.22681135],"study_design_scores_gemma":[0.00017272169,0.00035846664,0.00058376964,0.00013667489,0.000047623653,0.0014329562,0.00047297316,0.17094639,0.05878093,0.71642625,0.05048514,0.00015616907],"about_ca_topic_score_codex":0.0005481907,"about_ca_topic_score_gemma":0.0011136825,"teacher_disagreement_score":0.006552841,"about_ca_system_score_codex":0.0006736645,"about_ca_system_score_gemma":0.001716394,"threshold_uncertainty_score":0.021921456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13370624,0.0005812151,0.7588435,0.0031194796,0.00018375019,0.00057812314,0.00089599803,0.0004764504,0.10161525],"genre_scores_gemma":[0.8232727,0.00064351177,0.1486404,0.0005969246,0.00007674564,0.00078038446,0.000631533,0.000106383435,0.025251348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847955,0.000745908,0.000045026798,0.0002621654,0.00024849197,0.00021892626],"domain_scores_gemma":[0.9980129,0.0010986562,0.0001792815,0.00017896156,0.00014909027,0.00038109673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011680673,0.0009757734,0.00077135017,0.0004713502,0.0010431051,0.0022588368,0.0018170911,0.001832498,0.008258317],"category_scores_gemma":[0.004990541,0.0004823867,0.0005613541,0.00055413356,0.0016012081,0.004360802,0.002189547,0.0017901532,0.0007228164],"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.00036056933,0.00019644576,0.0007669819,0.00019634707,0.000045130117,0.00055117067,0.00036166966,0.1633653,0.0055967662,0.80131084,0.0064671286,0.020781634],"study_design_scores_gemma":[0.00020088733,0.00022075353,0.00034525534,0.00005405301,0.000030922616,0.0004948874,0.00022975028,0.5883403,0.0018133693,0.3822562,0.02596523,0.000048505884],"about_ca_topic_score_codex":0.0018769704,"about_ca_topic_score_gemma":0.0019254192,"teacher_disagreement_score":0.008258317,"about_ca_system_score_codex":0.0019688283,"about_ca_system_score_gemma":0.0010731064,"threshold_uncertainty_score":0.027626812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065835446,0.00035975676,0.915037,0.001779551,0.0001807112,0.00013855966,0.0007208051,0.0021812294,0.013766874],"genre_scores_gemma":[0.53032404,0.00030245577,0.45486316,0.0007479355,0.0001482801,0.0003823348,0.0013064682,0.00039151608,0.011533819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743736,0.0005748976,0.00015377584,0.00073147414,0.00073242665,0.0003700719],"domain_scores_gemma":[0.99545765,0.0013713699,0.00044983652,0.0020412286,0.00045611258,0.00022372218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016030297,0.0011592524,0.0010783308,0.001038537,0.0014504008,0.002324079,0.0024186093,0.0012247075,0.013456744],"category_scores_gemma":[0.007267531,0.00059977133,0.0011662052,0.001984484,0.0019155581,0.005830616,0.004141356,0.0023605993,0.0017310368],"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.000776473,0.00036160866,0.00442479,0.0003980593,0.000074416144,0.0001996136,0.0003198249,0.15811901,0.010256523,0.628383,0.012557192,0.18412954],"study_design_scores_gemma":[0.00009516955,0.00024645147,0.0006057423,0.00003608338,0.000044340497,0.00019746742,0.000117541334,0.49085054,0.009715609,0.48582014,0.012200859,0.00007007932],"about_ca_topic_score_codex":0.0048549403,"about_ca_topic_score_gemma":0.008082647,"teacher_disagreement_score":0.013456744,"about_ca_system_score_codex":0.0021162028,"about_ca_system_score_gemma":0.0029031136,"threshold_uncertainty_score":0.045017242},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041066088,0.00019245718,0.9505687,0.00054263946,0.000068546455,0.00020396347,0.0003104939,0.0022214146,0.0048257327],"genre_scores_gemma":[0.26634374,0.00026650538,0.723846,0.00023887631,0.00007642041,0.0003775773,0.0012584628,0.0007544654,0.0068379454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715304,0.00064687675,0.00020538602,0.0010359098,0.00045719318,0.0005015169],"domain_scores_gemma":[0.99141324,0.003968234,0.0005134096,0.0030929495,0.0006100005,0.00040229212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027712185,0.0015561441,0.0011809422,0.001632565,0.0014810227,0.0029007543,0.0043297173,0.0020703136,0.009493538],"category_scores_gemma":[0.011830271,0.0011015875,0.0023125438,0.002590033,0.0028163802,0.00843234,0.0061231786,0.003146974,0.0016823083],"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.00075536064,0.00036176987,0.0027192244,0.00057846785,0.00018778222,0.0001696521,0.0009308354,0.19735105,0.014294471,0.5269229,0.01101057,0.2447179],"study_design_scores_gemma":[0.00016107141,0.000073887684,0.00029898586,0.00003452079,0.000066498054,0.00011145371,0.00013601616,0.49172223,0.0054594357,0.49653092,0.0053643514,0.000040641],"about_ca_topic_score_codex":0.0041838884,"about_ca_topic_score_gemma":0.008460779,"teacher_disagreement_score":0.009493538,"about_ca_system_score_codex":0.0032102999,"about_ca_system_score_gemma":0.0026850393,"threshold_uncertainty_score":0.031759024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033457768,0.00026913045,0.98979735,0.0001799752,0.00010912385,0.00019215315,0.0002254127,0.0031942332,0.0026869182],"genre_scores_gemma":[0.043835584,0.00012285843,0.9526762,0.00010775381,0.000052676325,0.00027486053,0.0005741285,0.00036254147,0.0019935523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981908,0.0002699766,0.00016535333,0.0004177971,0.00071924645,0.0002367938],"domain_scores_gemma":[0.99840564,0.00056116434,0.000107779306,0.0005091477,0.0003440111,0.00007226057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097597786,0.0013537246,0.0013104298,0.0016375382,0.0010608026,0.001553122,0.0022714487,0.0017138167,0.016256813],"category_scores_gemma":[0.0052479766,0.00076142995,0.0011990223,0.0027104341,0.0010341234,0.004499091,0.0033279227,0.0021210893,0.0056190803],"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.0003688556,0.0002968882,0.0007762483,0.0006168315,0.000105625695,0.00014992508,0.00021568181,0.027408011,0.02139824,0.08621456,0.031699993,0.8307492],"study_design_scores_gemma":[0.0009584457,0.0005238054,0.0011551221,0.00015476512,0.00016189358,0.0015654891,0.000270924,0.46347305,0.03610707,0.39812484,0.097284816,0.00021977907],"about_ca_topic_score_codex":0.0014618183,"about_ca_topic_score_gemma":0.0027992562,"teacher_disagreement_score":0.016256813,"about_ca_system_score_codex":0.00091265416,"about_ca_system_score_gemma":0.0022615562,"threshold_uncertainty_score":0.05438447},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53301847,0.00041835455,0.43430233,0.0019057401,0.0001600945,0.00055529043,0.00143072,0.004344055,0.023864888],"genre_scores_gemma":[0.7087206,0.00033933172,0.2762447,0.0004008353,0.00010433752,0.00016562392,0.004287886,0.00071693957,0.009019707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989524,0.00008135167,0.00009115467,0.0003816629,0.00022595964,0.00026762427],"domain_scores_gemma":[0.9961546,0.0015089571,0.00060866214,0.0010403426,0.0003138522,0.00037347866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060160796,0.0007824479,0.0010493137,0.0007183193,0.0009221846,0.0025436697,0.0016051037,0.0011209404,0.0070429803],"category_scores_gemma":[0.0049663903,0.00062108494,0.0014114489,0.0009491104,0.0011143251,0.0068552056,0.0017488468,0.0014910707,0.002597043],"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.0022706515,0.0009551662,0.05051114,0.0017907702,0.0002683856,0.0021515295,0.003013675,0.08876697,0.16673252,0.09155853,0.037223633,0.55475694],"study_design_scores_gemma":[0.00023607531,0.0006697606,0.011935566,0.00017391736,0.0002534047,0.0035885943,0.0019620603,0.4780485,0.10790518,0.36326253,0.031834785,0.00012962225],"about_ca_topic_score_codex":0.0012599366,"about_ca_topic_score_gemma":0.0023501406,"teacher_disagreement_score":0.0070429803,"about_ca_system_score_codex":0.0011328458,"about_ca_system_score_gemma":0.0009335624,"threshold_uncertainty_score":0.02356112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20017654,0.0006995055,0.7696335,0.0044909916,0.000083781626,0.00023483114,0.0029827983,0.0036897052,0.01800834],"genre_scores_gemma":[0.69860375,0.00069403125,0.28501227,0.0009799635,0.0003738926,0.0003539782,0.0061896215,0.0009215269,0.0068709096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930119,0.0013614288,0.0005376403,0.0015381188,0.002522463,0.0010284558],"domain_scores_gemma":[0.96098906,0.025753818,0.0018248551,0.008431007,0.0023922138,0.000609132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041400855,0.0010602772,0.0015710142,0.0021775207,0.002057209,0.0056358045,0.0028508666,0.0017815442,0.0072314423],"category_scores_gemma":[0.023983,0.0012836392,0.0043520206,0.0037272165,0.0042632883,0.016132372,0.0044819633,0.006198704,0.0013057273],"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.0005933434,0.00043363485,0.0054618055,0.00090174214,0.00016297784,0.00025089475,0.0016303173,0.07606535,0.008259245,0.8096154,0.00997973,0.086645484],"study_design_scores_gemma":[0.000059029786,0.00004846072,0.0006725613,0.000037293798,0.00003842427,0.0001390345,0.00015391182,0.08505834,0.004953278,0.90567225,0.003142145,0.000025264995],"about_ca_topic_score_codex":0.0032617627,"about_ca_topic_score_gemma":0.0047475356,"teacher_disagreement_score":0.0072314423,"about_ca_system_score_codex":0.0027742998,"about_ca_system_score_gemma":0.0039097527,"threshold_uncertainty_score":0.024191618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25620854,0.001848748,0.6312395,0.0040514315,0.00030188082,0.00083842996,0.009012377,0.0032064011,0.09329287],"genre_scores_gemma":[0.5943708,0.0018126261,0.36086646,0.001012617,0.00019796885,0.0005069013,0.017118888,0.0005731403,0.02354065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998125,0.00027971325,0.0001423211,0.0007040546,0.00043701197,0.0003118386],"domain_scores_gemma":[0.99659234,0.00145906,0.00049520214,0.00081791304,0.00041065796,0.00022481737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097874,0.0013042327,0.0010151714,0.0008045212,0.0012551334,0.0026575022,0.0018516154,0.001843111,0.013433246],"category_scores_gemma":[0.0057248534,0.0008360393,0.0016537524,0.0014212461,0.0014852675,0.005874424,0.0026703733,0.0026683523,0.0027712293],"study_design_candidate":"not_applicable","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.0012543882,0.00029271262,0.005960205,0.0014225038,0.00018583759,0.0010263817,0.0009339316,0.14415973,0.022308031,0.41736817,0.055866163,0.34922194],"study_design_scores_gemma":[0.00024205414,0.00056567317,0.0022838863,0.0002829932,0.00013387491,0.0016451393,0.0009771299,0.23964094,0.01874176,0.64611,0.089238025,0.0001386173],"about_ca_topic_score_codex":0.002362717,"about_ca_topic_score_gemma":0.0030577222,"teacher_disagreement_score":0.013433246,"about_ca_system_score_codex":0.0008466033,"about_ca_system_score_gemma":0.0009383444,"threshold_uncertainty_score":0.044938684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037994966,0.00085122156,0.93315923,0.0004135195,0.0002116467,0.00032575233,0.0013648234,0.013067845,0.012610949],"genre_scores_gemma":[0.32997462,0.0005046361,0.6514653,0.00046829082,0.00013562365,0.00037690054,0.0030260833,0.0007889427,0.013259604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991443,0.0000791118,0.00008470888,0.00019404004,0.0003232994,0.00017454606],"domain_scores_gemma":[0.9978504,0.00048498414,0.00018786502,0.0009438149,0.00037935123,0.00015364274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056307175,0.0008607854,0.0008320565,0.0012473185,0.0011572461,0.0023926105,0.0025897475,0.0006642324,0.014852175],"category_scores_gemma":[0.0037543434,0.00046396817,0.00044170744,0.0030530496,0.0006191635,0.003881227,0.0032303713,0.0007732994,0.0036709548],"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.0023924168,0.00041304014,0.005706862,0.0005022651,0.000093005445,0.0003027705,0.00068089325,0.04574272,0.058976498,0.10014649,0.053426832,0.7316162],"study_design_scores_gemma":[0.0002615404,0.0004373266,0.0027536044,0.00012846201,0.00010213763,0.00084993354,0.0006088454,0.65409005,0.11874171,0.11996105,0.10191223,0.00015309823],"about_ca_topic_score_codex":0.004242455,"about_ca_topic_score_gemma":0.004883753,"teacher_disagreement_score":0.014852175,"about_ca_system_score_codex":0.0011038991,"about_ca_system_score_gemma":0.0016403658,"threshold_uncertainty_score":0.04968542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07829246,0.0029347118,0.8995742,0.002142859,0.00021446262,0.00020085873,0.0007811205,0.0025986955,0.013260616],"genre_scores_gemma":[0.59623337,0.0018071241,0.39249307,0.0007073733,0.00019166271,0.0002448665,0.0014638368,0.00048707594,0.0063715805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972012,0.0007025927,0.00014964536,0.00053932576,0.00070049096,0.00070664176],"domain_scores_gemma":[0.9906646,0.004724085,0.00077714585,0.0028959357,0.0005457305,0.0003925211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027892257,0.0016477839,0.0014101859,0.0015090046,0.001151166,0.0029206143,0.005719645,0.0020663608,0.0061386335],"category_scores_gemma":[0.01261887,0.0006812282,0.00182998,0.003586311,0.0014043407,0.008124717,0.0028482745,0.003349134,0.0011782281],"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.0011616064,0.0002448987,0.001841712,0.00047522032,0.00018988627,0.00014639951,0.00058190594,0.7137237,0.0053020343,0.1465269,0.012425323,0.11738047],"study_design_scores_gemma":[0.000049243714,0.000089033994,0.0002608699,0.000047222282,0.000044684733,0.00013555065,0.000109683424,0.91228527,0.002121442,0.080051176,0.0047824536,0.000023440996],"about_ca_topic_score_codex":0.0046025785,"about_ca_topic_score_gemma":0.004579669,"teacher_disagreement_score":0.0063065486,"about_ca_system_score_codex":0.0063065486,"about_ca_system_score_gemma":0.0016693734,"threshold_uncertainty_score":0.045757413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32646286,0.00070454605,0.65921384,0.00059159484,0.000069707705,0.00020593485,0.0005626508,0.0012340888,0.01095475],"genre_scores_gemma":[0.876715,0.00036786354,0.117359884,0.00018438006,0.00003504574,0.0001307423,0.0006419678,0.00017811076,0.00438701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848855,0.00030904377,0.00007468283,0.00050831976,0.00017632714,0.0004431997],"domain_scores_gemma":[0.9938212,0.0039937724,0.00062716455,0.00082295795,0.0002734897,0.00046146172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009214446,0.0011727118,0.0018051474,0.0005489128,0.0007309563,0.0013133147,0.003021491,0.0018635642,0.0027393275],"category_scores_gemma":[0.006778449,0.0009761713,0.0012706618,0.0007288286,0.0014177158,0.0035619067,0.0020720353,0.0014495945,0.0005249232],"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.00040879476,0.00014587109,0.00080111745,0.00021472806,0.00005933631,0.00016704947,0.00013700212,0.94304067,0.004934687,0.03223132,0.0015447193,0.016314734],"study_design_scores_gemma":[0.00005783609,0.00014415575,0.00021165854,0.000013855716,0.000018605258,0.000076165394,0.000047985126,0.9491847,0.001030133,0.04865787,0.00053893146,0.000018038889],"about_ca_topic_score_codex":0.0039301603,"about_ca_topic_score_gemma":0.003734079,"teacher_disagreement_score":0.0039301603,"about_ca_system_score_codex":0.0014820725,"about_ca_system_score_gemma":0.0011461399,"threshold_uncertainty_score":0.010753214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013827241,0.00015356694,0.9713227,0.0003905421,0.00009241645,0.00017117063,0.00021938054,0.0033377132,0.010485152],"genre_scores_gemma":[0.23772442,0.00016929545,0.7466722,0.00026029412,0.00009524168,0.00043401454,0.00097721,0.00042613794,0.013241069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988526,0.00015313772,0.000050716695,0.00023093817,0.00050293014,0.00020963748],"domain_scores_gemma":[0.9988086,0.0003517623,0.00010965894,0.00036384354,0.00028322072,0.000082862105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007030211,0.0007878397,0.00080176303,0.0010123792,0.0011103394,0.0015913721,0.0012322512,0.00074440445,0.012208943],"category_scores_gemma":[0.0034878617,0.00039942208,0.00077095337,0.0013811239,0.0012127454,0.0021210397,0.0019081378,0.0015332206,0.0039103855],"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.00091624836,0.00038269733,0.0014900167,0.00028854032,0.00007051536,0.00021060533,0.00024103801,0.08050064,0.02010368,0.2683429,0.03699818,0.5904549],"study_design_scores_gemma":[0.00036820982,0.00023725553,0.00064920937,0.00003440956,0.000026307702,0.00026706778,0.00011924418,0.7503823,0.014502601,0.21409139,0.019220607,0.00010141076],"about_ca_topic_score_codex":0.0074300845,"about_ca_topic_score_gemma":0.015417957,"teacher_disagreement_score":0.012208943,"about_ca_system_score_codex":0.0018570872,"about_ca_system_score_gemma":0.0045518014,"threshold_uncertainty_score":0.04084295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23362331,0.00081190927,0.7176828,0.0013608324,0.0001895762,0.00057714956,0.001447868,0.018261498,0.02604506],"genre_scores_gemma":[0.51475817,0.00025604622,0.4645828,0.00032271544,0.000132354,0.0005008206,0.0046929033,0.0015765235,0.013177716],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963607,0.0005700358,0.0002642202,0.0011184806,0.000982512,0.00070394785],"domain_scores_gemma":[0.9932509,0.0039582853,0.000508101,0.0015797343,0.00047372485,0.00022926032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011445981,0.001541987,0.0012199716,0.0012083079,0.001522347,0.004349759,0.002385215,0.0013747489,0.01289387],"category_scores_gemma":[0.008416471,0.00095133216,0.0021172897,0.0020497085,0.0025384994,0.007338084,0.0038089699,0.002026116,0.003678224],"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.0027187408,0.0008824692,0.0090105375,0.0013056907,0.00034186657,0.0009047249,0.0019519101,0.13422085,0.038565103,0.1699416,0.022621004,0.6175355],"study_design_scores_gemma":[0.0006245507,0.0003948052,0.0019340586,0.00008500011,0.00021725647,0.0004317055,0.0006620299,0.40730837,0.028230663,0.5398446,0.020173838,0.00009315186],"about_ca_topic_score_codex":0.00518893,"about_ca_topic_score_gemma":0.008017787,"teacher_disagreement_score":0.01289387,"about_ca_system_score_codex":0.002559909,"about_ca_system_score_gemma":0.0023777978,"threshold_uncertainty_score":0.043134272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12960207,0.015156202,0.7353678,0.019419698,0.001341579,0.0007808574,0.0051733013,0.00873135,0.08442711],"genre_scores_gemma":[0.74594873,0.004641063,0.2123833,0.0054162713,0.0020810862,0.0014132747,0.005720172,0.0023555376,0.02004056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98072296,0.0042630304,0.0011109087,0.0034022543,0.006650661,0.0038502363],"domain_scores_gemma":[0.94556165,0.034975715,0.002136316,0.012768308,0.0027043347,0.0018536877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009705191,0.002659004,0.004084955,0.0022824577,0.0032799544,0.007495543,0.0074177096,0.0040052854,0.019877467],"category_scores_gemma":[0.060030147,0.002038074,0.0027979733,0.0049246973,0.0056379214,0.03345823,0.0126431445,0.009349816,0.0055795657],"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.0037565094,0.0007277122,0.003533212,0.0019766558,0.0002793249,0.00039261955,0.0011401417,0.07967494,0.013572866,0.69399434,0.047720324,0.15323138],"study_design_scores_gemma":[0.0002655968,0.00037028926,0.0007029215,0.00021126472,0.00017442703,0.0003813495,0.0002382796,0.18898638,0.0063652094,0.7884351,0.013768553,0.00010069427],"about_ca_topic_score_codex":0.002642794,"about_ca_topic_score_gemma":0.0031106432,"teacher_disagreement_score":0.019877467,"about_ca_system_score_codex":0.006432535,"about_ca_system_score_gemma":0.0049153566,"threshold_uncertainty_score":0.06649673},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097707786,0.0044365847,0.7645888,0.0078909295,0.0012841264,0.0009220461,0.006857684,0.03930213,0.07700987],"genre_scores_gemma":[0.21519123,0.0015412256,0.73964524,0.0016149704,0.00047670666,0.0007432985,0.009395416,0.0040478026,0.027344162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973218,0.00036334645,0.00015575929,0.00054483465,0.0008742427,0.0007401318],"domain_scores_gemma":[0.9942638,0.0023289826,0.0004602403,0.0020476682,0.0004664446,0.0004328723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016784407,0.0039371345,0.002714966,0.0023602713,0.0015520606,0.0044564344,0.006857381,0.0035313964,0.042448502],"category_scores_gemma":[0.008815062,0.0012130042,0.0032028775,0.005720306,0.0013861682,0.011441167,0.0051474017,0.004946887,0.017864518],"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.0031777357,0.0018245496,0.0021044312,0.0019922378,0.00039213666,0.00049855013,0.00052175357,0.14325456,0.028045325,0.041264974,0.17892814,0.5979956],"study_design_scores_gemma":[0.0007774174,0.000500588,0.0014013646,0.0002578318,0.00029254588,0.001085058,0.0004149978,0.86055684,0.017848091,0.0857252,0.031038936,0.000101081765],"about_ca_topic_score_codex":0.009516758,"about_ca_topic_score_gemma":0.017365776,"teacher_disagreement_score":0.042448502,"about_ca_system_score_codex":0.005414257,"about_ca_system_score_gemma":0.004808922,"threshold_uncertainty_score":0.14200437},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17729656,0.0020962693,0.80045253,0.00065153965,0.00008180244,0.00024233032,0.0026188078,0.001614512,0.014945663],"genre_scores_gemma":[0.4093286,0.001443079,0.57768166,0.00017618686,0.000047168465,0.00017505151,0.004719209,0.00021655746,0.006212442],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949837,0.000089877016,0.00003293268,0.00014515207,0.00012556952,0.00010809976],"domain_scores_gemma":[0.9994692,0.00014692434,0.000102727136,0.000112910115,0.00011392294,0.00005436828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002240151,0.0006161923,0.00091429957,0.0007770672,0.000576866,0.0010623068,0.0009400101,0.0008821775,0.0031395077],"category_scores_gemma":[0.001739342,0.00044194792,0.0004899344,0.0021935774,0.00026792486,0.0016733484,0.0011314992,0.0006796777,0.0009680091],"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.000837817,0.00025339847,0.0024347058,0.0010424118,0.00018080736,0.0006600684,0.00066093134,0.38842756,0.05318039,0.09402784,0.029446686,0.42884743],"study_design_scores_gemma":[0.00008009701,0.0002154108,0.0020532787,0.0000876773,0.00006584115,0.0009725177,0.0003198344,0.8887723,0.01281474,0.0708175,0.023760246,0.000040541592],"about_ca_topic_score_codex":0.0024810585,"about_ca_topic_score_gemma":0.0029827256,"teacher_disagreement_score":0.0031395077,"about_ca_system_score_codex":0.00061955454,"about_ca_system_score_gemma":0.00047516558,"threshold_uncertainty_score":0.010502636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1420917,0.004630333,0.8156568,0.0010763296,0.00050431443,0.00056973164,0.0045296503,0.021177137,0.009764068],"genre_scores_gemma":[0.23867895,0.0010790005,0.7427128,0.00046408718,0.0003567888,0.0005260878,0.008717945,0.0014233534,0.0060410392],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969778,0.00042596043,0.00027310714,0.00056937325,0.0015483275,0.00020543534],"domain_scores_gemma":[0.99314547,0.0020827367,0.0005119761,0.0028595629,0.0011946146,0.0002057417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012241891,0.0010945826,0.0015675223,0.0026158914,0.0009166656,0.0021570493,0.0023652168,0.001097655,0.003603016],"category_scores_gemma":[0.01469197,0.0005654128,0.0008587488,0.004641762,0.0011139606,0.0049674744,0.0027248247,0.0012697865,0.0047663497],"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.001585329,0.000379686,0.004572113,0.0005332912,0.00013611258,0.0005798129,0.00071488816,0.035183996,0.08071911,0.037141908,0.0402561,0.7981977],"study_design_scores_gemma":[0.0004602025,0.0009039322,0.0042127036,0.000120859186,0.00013603072,0.0022306473,0.00068710867,0.75537837,0.10320156,0.06721236,0.065245606,0.0002106228],"about_ca_topic_score_codex":0.003086442,"about_ca_topic_score_gemma":0.0041847015,"teacher_disagreement_score":0.003603016,"about_ca_system_score_codex":0.0008494739,"about_ca_system_score_gemma":0.0021724487,"threshold_uncertainty_score":0.012053251},"labels":[],"label_agreement":null}]}