{"meta":{"query_hash":"29abced35583","filters":{"venue":"Algorithmica"},"cohort_total":232,"direct_labels_cover":0,"predictions_cover":232,"exported":232,"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/29abced35583","api":"https://metacan.xera.ac/api/v1/cohort?venue=Algorithmica"},"results":[{"id":"W1164874588","doi":"10.1007/s00453-017-0302-8","title":"Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Combinatorics; Rounding; Vertex (graph theory); Complement (music); Physics; Mathematics; Graph; Computer science","score_opus":0.04806380619590854,"score_gpt":0.2791472537857054,"score_spread":0.23108344758979682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1164874588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064699777,0.00068788085,0.9893015,0.006872405,0.0010189961,0.000907505,0.00002051966,0.00016605222,0.00037816953],"genre_scores_gemma":[0.20384578,0.00030234555,0.7928737,0.00059309567,0.000986378,0.0007428692,0.000012873148,0.000049014314,0.0005939657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984504,0.00003391535,0.00027314055,0.00057163637,0.00023632705,0.00043459295],"domain_scores_gemma":[0.9977467,0.00041754177,0.00025194514,0.0013320168,0.00014558811,0.00010617966],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058003055,0.0002303076,0.00022469912,0.00006898515,0.0019735985,0.0013593143,0.0020297018,0.00009184014,0.000004959017],"category_scores_gemma":[0.00018417797,0.00016638554,0.00011109638,0.00010507948,0.0003605854,0.0010186926,0.0006526838,0.0001821275,0.0000068935165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006588366,0.000052380525,0.000045538007,0.000044535125,0.00005937238,0.000001343349,0.0004662616,0.0000073910887,0.00034895103,0.023784872,0.00039421787,0.97478855],"study_design_scores_gemma":[0.0006589872,0.00015303779,0.0017063188,0.00003605643,0.000031502506,0.000032763426,0.00006244333,0.88806474,0.0018853114,0.08727427,0.019793486,0.0003010874],"about_ca_topic_score_codex":0.00014787176,"about_ca_topic_score_gemma":0.000023136734,"teacher_disagreement_score":0.9744875,"about_ca_system_score_codex":0.000020095706,"about_ca_system_score_gemma":0.000050631483,"threshold_uncertainty_score":0.99967736},"labels":[],"label_agreement":null},{"id":"W1513274608","doi":"10.1007/s00453-016-0159-2","title":"On the Parameterized Complexity of Reconfiguration Problems","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); University of Waterloo","funders":"","keywords":"Control reconfiguration; Parameterized complexity; Vertex cover; Vertex (graph theory); Combinatorics; Kernelization; Mathematics; Theory of computation; Bounded function; Maximization; Sequence (biology); Discrete mathematics; Graph; Computer science; Algorithm; Mathematical optimization","score_opus":0.06819916082681735,"score_gpt":0.28743081139528687,"score_spread":0.21923165056846952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513274608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031245187,0.000011574357,0.95824814,0.0078083174,0.00010449378,0.00034712724,0.000009284251,0.00007471213,0.0021511891],"genre_scores_gemma":[0.9706555,0.000007897918,0.028847754,0.00014699787,0.00001975308,0.00004313042,7.6607347e-7,0.000006829226,0.00027139648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896055,0.0001935939,0.00017440542,0.00022836543,0.00024889654,0.00019421376],"domain_scores_gemma":[0.9983143,0.00080473087,0.00009091672,0.00065685,0.0000922219,0.000040958028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004624395,0.00007890535,0.000112124384,0.000058770624,0.00008034973,0.00002609658,0.00078237365,0.00002804183,0.00007664775],"category_scores_gemma":[0.00020183537,0.000038674898,0.00005046581,0.00025068354,0.0002997344,0.00020094846,0.00010006445,0.00007607529,0.00008882348],"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.000014031987,0.00003192487,0.0000047961785,0.0000030549004,0.000010702789,8.192916e-7,0.000077706856,0.0000031424595,0.038890682,0.84024364,0.00017311245,0.120546415],"study_design_scores_gemma":[0.000297244,0.00018606102,0.00025424312,0.000033932305,0.0000010846196,0.0000037464717,0.000004800368,0.005206156,0.099484235,0.8937508,0.0006960735,0.0000816204],"about_ca_topic_score_codex":0.0000052492246,"about_ca_topic_score_gemma":0.0000014158175,"teacher_disagreement_score":0.93941027,"about_ca_system_score_codex":0.00002074294,"about_ca_system_score_gemma":0.00002533866,"threshold_uncertainty_score":0.15771167},"labels":[],"label_agreement":null},{"id":"W1536432301","doi":"10.1007/s00453-001-0050-6","title":"Grade of Service Steiner Minimum Trees in the Euclidean Plane","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Euclidean geometry; Euclidean distance; Approximation algorithm; Generalization; Path (computing); Spanning tree; Terminal (telecommunication); Discrete mathematics; Point (geometry); Computer science; Geometry","score_opus":0.015221349186748603,"score_gpt":0.22216447856601942,"score_spread":0.2069431293792708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536432301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9643119,0.0010424637,0.010402874,0.0020686646,0.00025098145,0.00060023513,0.000044770382,0.0007677412,0.020510346],"genre_scores_gemma":[0.99762756,0.000087564265,0.001852685,0.00022275979,0.00008962265,0.000018566134,0.000012258101,0.000020094878,0.00006888965],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993891,0.00002822833,0.00019034932,0.00009149097,0.00012475622,0.00017603551],"domain_scores_gemma":[0.9996346,0.000078058656,0.000019768488,0.00022936564,0.000015018258,0.00002316957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013642125,0.00010582075,0.00014030548,0.00007929237,0.000014446864,0.000010464709,0.0002577003,0.000065160086,0.000031686515],"category_scores_gemma":[0.000005105235,0.00007884363,0.000031667627,0.00029995365,0.000016542734,0.0000583817,0.000014090371,0.00012740605,0.000016591172],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009243035,0.001097266,0.008294899,0.00055947196,0.00040667935,0.0010046758,0.019712618,0.0053856377,0.44386002,0.0049145496,0.09348953,0.42118225],"study_design_scores_gemma":[0.0047116857,0.0009804132,0.06002128,0.0006003001,0.00021422029,0.0007458843,0.0044007627,0.26947668,0.39910775,0.016446102,0.24055684,0.0027380795],"about_ca_topic_score_codex":0.00014421086,"about_ca_topic_score_gemma":0.00014928074,"teacher_disagreement_score":0.41844416,"about_ca_system_score_codex":0.0000123036125,"about_ca_system_score_gemma":0.000004626245,"threshold_uncertainty_score":0.321515},"labels":[],"label_agreement":null},{"id":"W1559894044","doi":"10.1007/s00453-006-0168-7","title":"Reconfiguring Triangulations with Edge Flips and Point Moves","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Triangulation; Point (geometry); Enhanced Data Rates for GSM Evolution; Point set triangulation; Combinatorics; Computer science; Control reconfiguration; Upper and lower bounds; Delaunay triangulation; Mathematics; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.008872586701530067,"score_gpt":0.22365302800655926,"score_spread":0.21478044130502918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559894044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055609964,0.000120089084,0.9401113,0.0006972503,0.0001519645,0.00009876629,0.0000011057004,0.000077258555,0.0031322946],"genre_scores_gemma":[0.6890094,0.000005029493,0.3098411,0.00022968535,0.00022201579,0.000004868602,0.0000073506903,0.000005894406,0.00067465147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993551,0.000015841062,0.00013603485,0.00021689855,0.00012883406,0.00014734131],"domain_scores_gemma":[0.99953794,0.00012047525,0.00004375481,0.00015644882,0.00006455517,0.00007679593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028710414,0.00007408153,0.00007412491,0.00012716731,0.00013095302,0.000086585474,0.00012023034,0.000027682461,0.000009642101],"category_scores_gemma":[0.000020144285,0.00006515453,0.000017214912,0.00031382122,0.00002236092,0.00031301644,0.000042984044,0.00006016521,0.000014116689],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015268732,0.00004811813,0.0001547225,0.000007282768,0.000028016493,0.000020225585,0.00071258895,0.0007301091,0.0015186837,0.06763661,0.00039869596,0.92872965],"study_design_scores_gemma":[0.0042844857,0.000820609,0.18390957,0.00010762426,0.00005262118,0.00079803076,0.00030267957,0.58196425,0.0961625,0.057871103,0.07226529,0.0014612124],"about_ca_topic_score_codex":0.000007144776,"about_ca_topic_score_gemma":0.000010896007,"teacher_disagreement_score":0.92726845,"about_ca_system_score_codex":0.000017050452,"about_ca_system_score_gemma":0.00003249936,"threshold_uncertainty_score":0.26569247},"labels":[],"label_agreement":null},{"id":"W1589309006","doi":"10.1007/s00453-016-0154-7","title":"Binary Pattern Tile Set Synthesis Is NP-Hard","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Academy of Finland; National Science Foundation","keywords":"Mathematical proof; Lemma (botany); Computer science; Correctness; Theory of computation; Conjecture; Set (abstract data type); Combinatorial proof; Massively parallel; Binary number; Automated theorem proving; Discrete mathematics; Algorithm; Mathematics; Programming language; Parallel computing; Arithmetic","score_opus":0.011820933820136204,"score_gpt":0.2594127875174267,"score_spread":0.24759185369729048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589309006","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9487981,0.0003675906,0.04081776,0.0070337313,0.00022141243,0.00026481514,0.00067680713,0.0002613941,0.001558396],"genre_scores_gemma":[0.99113,0.00027217652,0.005136051,0.0010169228,0.00029497172,0.000016747694,0.000035987527,0.000027605312,0.0020695138],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897826,0.000043230175,0.00017157437,0.0004255667,0.00012488995,0.00025649063],"domain_scores_gemma":[0.9992745,0.000025975,0.0000721826,0.00048014932,0.000071126604,0.000076085635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010466452,0.00017181484,0.00016156177,0.000048445905,0.00006885568,0.000014038263,0.0001876154,0.00015674566,0.00004249312],"category_scores_gemma":[0.00005669853,0.00011351841,0.00014296382,0.000079881094,0.00010105878,0.000004272482,0.00011467002,0.000046289457,0.000063771266],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014335819,0.000029447554,0.00047196256,0.0000037442296,0.00006617559,0.0000075432495,0.000005949318,4.7854275e-8,0.78422517,0.0000019554636,0.028644029,0.18652967],"study_design_scores_gemma":[0.00011873471,0.00010633172,0.00030338546,0.000024454028,0.000032531036,0.000020552648,0.000011583256,0.000024549981,0.90476125,0.000076472905,0.09430379,0.00021637928],"about_ca_topic_score_codex":0.000011360193,"about_ca_topic_score_gemma":0.0000030552878,"teacher_disagreement_score":0.18631329,"about_ca_system_score_codex":0.000015557971,"about_ca_system_score_gemma":0.00002073524,"threshold_uncertainty_score":0.46291462},"labels":[],"label_agreement":null},{"id":"W1589676939","doi":"10.1007/s00453-002-0972-7","title":"Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Quantum entanglement; Classical capacity; Quantum; Quantum information; Quantum channel; Quantum capacity; Quantum teleportation; No-teleportation theorem; Computer science; Alice and Bob; Key (lock); Amplitude damping channel; Theoretical computer science; Quantum mechanics; Mathematics; Quantum network; Physics; Computer security","score_opus":0.019985623753417624,"score_gpt":0.24025381197306622,"score_spread":0.2202681882196486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589676939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12331358,0.0010843152,0.79056984,0.05394295,0.0010757466,0.00082463416,0.00004142171,0.00057325757,0.028574234],"genre_scores_gemma":[0.9622564,0.00012371823,0.027312791,0.009505207,0.00023498184,0.00003924636,0.000008099332,0.000017499578,0.0005020846],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998222,0.000052458927,0.00036951975,0.00041274415,0.00048922986,0.00045405695],"domain_scores_gemma":[0.99900466,0.000062637526,0.00009099893,0.00047015818,0.000067128945,0.0003044266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000184499,0.00020873868,0.00020633174,0.00021904003,0.00026104733,0.00045615292,0.0006162574,0.000093760966,0.00034147594],"category_scores_gemma":[0.000012453746,0.00018564533,0.00010664414,0.0006267928,0.000091491966,0.0005272568,0.00030920602,0.00021534898,0.00055485585],"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.000011348256,0.00033198338,0.0014080099,0.000038580834,0.0001189694,0.000051938325,0.008958439,0.000003410928,0.00025681267,0.44266498,0.080854975,0.46530056],"study_design_scores_gemma":[0.00090306555,0.00044681528,0.0031710586,0.00006312405,0.000020138748,0.00004109156,0.00022112824,0.4605979,0.0005978768,0.013412162,0.51999515,0.00053050404],"about_ca_topic_score_codex":0.0000074464583,"about_ca_topic_score_gemma":0.0000069512926,"teacher_disagreement_score":0.83894277,"about_ca_system_score_codex":0.000039329003,"about_ca_system_score_gemma":0.000016585103,"threshold_uncertainty_score":0.7570397},"labels":[],"label_agreement":null},{"id":"W1592802262","doi":"10.1007/s00453-005-1181-y","title":"A Fixed-Parameter Approach to 2-Layer Planarization","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University; McGill University","funders":"","keywords":"Chemical-mechanical planarization; Bipartite graph; Mathematics; Time complexity; Combinatorics; Permutation (music); Theory of computation; Graph; Layer (electronics); Line graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science; Physics; Materials science","score_opus":0.012689429855639651,"score_gpt":0.22403745475337417,"score_spread":0.21134802489773452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592802262","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00563677,0.000024262294,0.9848653,0.0006411117,0.00024346627,0.00015840714,0.0000031169002,0.000122029785,0.00830554],"genre_scores_gemma":[0.44733015,3.9184886e-7,0.55026317,0.00085785263,0.0003047081,0.000031161904,0.0000670381,0.000006621092,0.0011389359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.000031945907,0.00016181539,0.0003217638,0.0002314089,0.00017680062],"domain_scores_gemma":[0.99953103,0.000054810585,0.000036341182,0.00024113328,0.000076281,0.0000604175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011048325,0.0000953279,0.00008633881,0.00015584349,0.00009639817,0.0001407646,0.00030084123,0.000043029744,0.0000067629107],"category_scores_gemma":[0.00002034011,0.000093154995,0.000035502784,0.0006355807,0.000008525273,0.00025434885,0.0000836073,0.000054845408,0.00013200972],"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.000014631704,0.0006164364,0.00026943776,0.000018991303,0.00003857594,0.000011464769,0.0005034092,0.14991058,0.0068402756,0.49237117,0.08374305,0.26566195],"study_design_scores_gemma":[0.00026865318,0.00006688707,0.004320568,0.0000043220252,0.00000574853,0.000029602897,0.0000048272364,0.9359963,0.009739318,0.0144552635,0.034837455,0.00027108012],"about_ca_topic_score_codex":0.000036195208,"about_ca_topic_score_gemma":0.0000018901594,"teacher_disagreement_score":0.78608567,"about_ca_system_score_codex":0.000028531213,"about_ca_system_score_gemma":0.000033713684,"threshold_uncertainty_score":0.37987503},"labels":[],"label_agreement":null},{"id":"W1601856531","doi":"10.1007/s00453-002-0986-1","title":"TSP Heuristics: Domination Analysis and Complexity","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Travelling salesman problem; Mathematics; Heuristics; Digraph; Heuristic; Theory of computation; Time complexity; Constant (computer programming); Discrete mathematics; Graph; Mathematical optimization; Algorithm; Computer science","score_opus":0.029251424219865128,"score_gpt":0.25060173871491265,"score_spread":0.22135031449504752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601856531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023526452,0.00019207793,0.9712534,0.00011596429,0.00010484142,0.00006913297,0.000014970201,0.00031572315,0.0044074184],"genre_scores_gemma":[0.6111605,0.0000617982,0.38849264,0.000028105189,0.00006057275,0.000004185521,0.000013407863,0.000016475342,0.00016228187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994417,0.000041590756,0.00015379435,0.00013041112,0.00009896262,0.00013355917],"domain_scores_gemma":[0.9996451,0.00008671176,0.000022848164,0.00015008927,0.000037292168,0.000057927704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014300324,0.000089151814,0.00015290067,0.00015489562,0.000058778027,0.00003614025,0.00006227556,0.000048980583,0.00028170974],"category_scores_gemma":[0.000054973596,0.00009863104,0.000038692466,0.0004965999,0.00004323509,0.00006277916,0.000019010735,0.00008434087,0.00002913216],"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.0000049247365,0.0001173006,0.0071298117,0.00011801026,0.0014243125,0.000022200034,0.0017854929,0.22491474,0.0014075342,0.003217864,0.0037627867,0.756095],"study_design_scores_gemma":[0.00014298002,0.0000066425832,0.006356933,0.00000219065,0.00012373122,0.0000031167824,0.000011877144,0.99164456,0.00054430193,0.00027477855,0.0007762235,0.000112640286],"about_ca_topic_score_codex":0.000010297083,"about_ca_topic_score_gemma":0.000003382565,"teacher_disagreement_score":0.76672983,"about_ca_system_score_codex":0.000028843517,"about_ca_system_score_gemma":9.901552e-7,"threshold_uncertainty_score":0.4022057},"labels":[],"label_agreement":null},{"id":"W1685382382","doi":"10.1007/s00453-008-9247-2","title":"Integer Representation and Counting in the Bit Probe Model","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Bitwise operation; Logarithm; Theory of computation; Bit (key); Extension (predicate logic); Subtraction; Data structure; Mathematics; Representation (politics); Discrete mathematics; Arithmetic; Constant (computer programming); Computation; Algorithm; Computer science","score_opus":0.03527612363550482,"score_gpt":0.26384907289120285,"score_spread":0.22857294925569804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1685382382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026016334,0.00012921375,0.97159314,0.0011698495,0.000089607354,0.00016992004,0.0000024856397,0.000054416392,0.0007750205],"genre_scores_gemma":[0.7584446,0.00007836158,0.24043413,0.0007289059,0.000099682875,0.000037010548,0.000009810206,0.000008470464,0.0001590166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907166,0.000050607934,0.00016350098,0.00030170762,0.00024085384,0.00017166961],"domain_scores_gemma":[0.9993843,0.00008510147,0.00005208266,0.0004107597,0.0000381502,0.000029615263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002478991,0.000086494634,0.000093078146,0.00006636374,0.000167897,0.00008845348,0.00050942536,0.000037631482,0.0000020254913],"category_scores_gemma":[0.000030251866,0.00005855646,0.000020275038,0.00028620163,0.000052947915,0.00063917076,0.00024927384,0.00014879186,0.0000104352885],"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.000038384354,0.0007295796,0.009039694,0.00006402421,0.00004823573,0.000743651,0.04285044,0.005440991,0.0036828108,0.12626235,0.031957977,0.77914184],"study_design_scores_gemma":[0.00019296883,0.000016505739,0.0028390114,0.00001338585,0.0000014709979,0.00012866643,0.00006039971,0.9892981,0.00024808783,0.006306023,0.00080392027,0.000091434944],"about_ca_topic_score_codex":0.00012858197,"about_ca_topic_score_gemma":0.000004644118,"teacher_disagreement_score":0.98385715,"about_ca_system_score_codex":0.000013023615,"about_ca_system_score_gemma":0.000033802487,"threshold_uncertainty_score":0.23878631},"labels":[],"label_agreement":null},{"id":"W1725687346","doi":"10.1007/s00453-011-9542-1","title":"Layered Working-Set Trees","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Binary search tree; Binary tree; Combinatorics; Element (criminal law); Mathematics; Upper and lower bounds; Amortized analysis; Multiplicative function; Theory of computation; Set (abstract data type); Ternary search tree; Tree (set theory); Search tree; Binary number; Data structure; Discrete mathematics; Logarithm; Computer science; Search algorithm; Algorithm; Tree structure; Interval tree; Arithmetic","score_opus":0.0813956022466798,"score_gpt":0.2568467713904636,"score_spread":0.17545116914378378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1725687346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003489546,0.000054473807,0.9482616,0.00066229515,0.0002930524,0.0001240018,0.0000014218941,0.00030821448,0.049945958],"genre_scores_gemma":[0.532722,0.000024274628,0.4645042,0.00061338674,0.00007710076,0.000019049747,0.000004082199,0.0000118325,0.002024086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991886,0.000045649573,0.000113124974,0.00023964258,0.00017005648,0.00024294476],"domain_scores_gemma":[0.99939716,0.000026700647,0.000037089587,0.00038699037,0.000047781992,0.000104261024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015006374,0.00008275829,0.00008756005,0.000076874385,0.000082735205,0.00007697998,0.0006977045,0.000042742,0.00019231455],"category_scores_gemma":[0.0000158184,0.00007394942,0.000039728704,0.00030812615,0.000033290915,0.00022648084,0.00017236367,0.0000918322,0.00031339124],"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.000013795937,0.00028163564,0.0013983132,0.000009027884,0.000075391246,0.000090444315,0.007946416,0.00023148165,0.00028682814,0.2571955,0.021781601,0.71068954],"study_design_scores_gemma":[0.0014640623,0.0003850411,0.0064825304,0.0000476788,0.000009370533,0.000051384613,0.00013483339,0.7982403,0.008502676,0.03261021,0.1512033,0.000868627],"about_ca_topic_score_codex":0.000028425338,"about_ca_topic_score_gemma":0.000007968317,"teacher_disagreement_score":0.7980088,"about_ca_system_score_codex":0.0000124634425,"about_ca_system_score_gemma":0.000033610042,"threshold_uncertainty_score":0.4028115},"labels":[],"label_agreement":null},{"id":"W1793615280","doi":"10.1007/s00453-016-0224-x","title":"The Power and Limitations of Static Binary Search Trees with Lazy Finger","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Computing and Communication Foundations; Center for Massive Data Algorithmics; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Optimal binary search tree; Binary search tree; Binary tree; Random binary tree; Theory of computation; Mathematics; Tree (set theory); Self-balancing binary search tree; Search tree; Computer science; Algorithm; Entropy (arrow of time); Dynamic programming; Ternary search tree; K-ary tree; Combinatorics; Tree structure; Interval tree; Search algorithm","score_opus":0.030737890943844638,"score_gpt":0.25304085483676614,"score_spread":0.2223029638929215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793615280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020516774,0.0003275621,0.92453766,0.0451043,0.00012126905,0.00049394544,0.000012811908,0.00012630149,0.008759357],"genre_scores_gemma":[0.89858377,0.0004286635,0.0974253,0.00016832238,0.000011723223,0.000020356081,9.104741e-7,0.000010034058,0.0033508963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993597,0.000038732956,0.00010331614,0.00014053269,0.00019918341,0.00015849799],"domain_scores_gemma":[0.9987124,0.00082913856,0.000030448742,0.00024488918,0.00012688768,0.0000562271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020632325,0.000053919364,0.00006163236,0.000049462036,0.00013054286,0.000060577167,0.00026020117,0.000015998388,0.0000095496025],"category_scores_gemma":[0.00006537744,0.000025404705,0.00001329376,0.00020200838,0.00016527079,0.00021637678,0.0000986576,0.00004319933,0.000012101637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018968349,0.00010054081,0.00029542437,0.0000090587555,0.00005851044,0.000008734921,0.002944121,0.0002000082,0.0013276406,0.07963323,0.0027288261,0.91267496],"study_design_scores_gemma":[0.00815605,0.0071972734,0.077492826,0.00060058123,0.000054400334,0.000121884295,0.002497069,0.6965871,0.01301444,0.03305311,0.15956299,0.0016623063],"about_ca_topic_score_codex":0.0000066737202,"about_ca_topic_score_gemma":0.000010921614,"teacher_disagreement_score":0.91101265,"about_ca_system_score_codex":0.000007940688,"about_ca_system_score_gemma":0.000064496104,"threshold_uncertainty_score":0.10359738},"labels":[],"label_agreement":null},{"id":"W1822246743","doi":"10.1007/s00453-018-0487-5","title":"Track Layouts, Layered Path Decompositions, and Leveled Planarity","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Treewidth; Planarity testing; Pathwidth; Parameterized complexity; Bounded function; Planar graph; Path (computing); Planar; 1-planar graph","score_opus":0.011471386148759342,"score_gpt":0.24469458734348468,"score_spread":0.23322320119472534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822246743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08533325,0.00012621275,0.91153646,0.0014930266,0.00035391815,0.00010985506,0.000014398448,0.00013007117,0.00090282864],"genre_scores_gemma":[0.8147315,0.000008001324,0.18421693,0.0005566168,0.000305807,0.0000065899526,0.000022674236,0.0000043625582,0.00014751655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918884,0.000049552902,0.00014825915,0.00029266896,0.0001583765,0.00016228015],"domain_scores_gemma":[0.99947584,0.00007331057,0.0000440408,0.0002065513,0.00011031156,0.00008995562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016032206,0.00009353381,0.000097640936,0.00008032159,0.00023514795,0.00012801788,0.00022368171,0.000046890298,0.000024161238],"category_scores_gemma":[0.000018388422,0.00009242832,0.00002552851,0.00026236894,0.000048429287,0.00029699007,0.00009605092,0.00007167264,0.00007363382],"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.00003356048,0.00034479468,0.0007700196,0.000024101284,0.00009798607,0.000044254237,0.0017880156,0.00018409504,0.0064913384,0.14387362,0.02292464,0.82342356],"study_design_scores_gemma":[0.0014258346,0.0005489037,0.05135174,0.000032130512,0.000021607124,0.00028367652,0.00003966255,0.83848363,0.023317238,0.039592586,0.044239726,0.0006632355],"about_ca_topic_score_codex":0.000019522524,"about_ca_topic_score_gemma":0.000010387178,"teacher_disagreement_score":0.8382996,"about_ca_system_score_codex":0.000017768944,"about_ca_system_score_gemma":0.000049796698,"threshold_uncertainty_score":0.37691176},"labels":[],"label_agreement":null},{"id":"W1827532909","doi":"10.1007/s00453-002-0964-7","title":"Budget Management with Applications","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Theory of computation; Directed graph; Vertex (graph theory); Directed acyclic graph; Graph; Set (abstract data type); Mathematical optimization; Path (computing); Transitive relation; Sensitivity (control systems); Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.005821349516441284,"score_gpt":0.17402018645245723,"score_spread":0.16819883693601595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827532909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017322782,0.000330787,0.8282007,0.00007743479,0.000025963458,0.0003312123,0.000005872693,0.0012989938,0.16955584],"genre_scores_gemma":[0.7413628,0.00048786058,0.25347826,0.00016747319,0.00018565118,0.0008957156,0.000014369843,0.00007756037,0.0033303075],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996253,0.0000028866423,0.000069471316,0.0000959075,0.00007398983,0.0001324156],"domain_scores_gemma":[0.99974185,0.000006040245,0.0000068146337,0.00019833379,0.000009678175,0.00003728897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000018932664,0.00007883005,0.00006210784,0.000048673857,0.000032162978,0.000015717016,0.000103303006,0.000027743434,0.000138235],"category_scores_gemma":[1.8924467e-7,0.00006999549,0.00001599627,0.00013936695,0.000016125136,0.000045073735,0.000010435546,0.000059136262,0.00024453964],"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":[9.509502e-7,0.000059840077,0.000029549816,0.00006684951,0.000104095416,0.000027103979,0.00009707339,0.00024436467,0.00041448727,0.007908257,0.054957807,0.93608963],"study_design_scores_gemma":[0.00042674295,0.00008578825,0.00026690797,0.00003209231,0.000059545473,0.000045319262,0.000057689074,0.06971344,0.013667573,0.002614813,0.9124728,0.0005572756],"about_ca_topic_score_codex":0.00000101949,"about_ca_topic_score_gemma":3.6631786e-7,"teacher_disagreement_score":0.93553233,"about_ca_system_score_codex":0.000019308987,"about_ca_system_score_gemma":4.628373e-7,"threshold_uncertainty_score":0.3143144},"labels":[],"label_agreement":null},{"id":"W1836455089","doi":"10.1007/s00453-016-0139-6","title":"List H-Coloring a Graph by Removing Few Vertices","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Defense Advanced Research Projects Agency; Office of Naval Research; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Combinatorics; Mathematics; Parameterized complexity; Bipartite graph; Conjecture; Discrete mathematics; Homomorphism; Vertex (graph theory); Graph homomorphism; Graph; Graph power; Line graph","score_opus":0.01321742497990888,"score_gpt":0.2631657678241809,"score_spread":0.249948342844272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836455089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0330477,0.0005648886,0.9592316,0.0033361,0.00040076007,0.00020221251,0.000009135475,0.00044633678,0.0027612497],"genre_scores_gemma":[0.8997115,0.00016020406,0.09643589,0.000407219,0.00017677847,0.000062551975,0.0000015279555,0.000040926825,0.0030034198],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982215,0.00010131426,0.00019646253,0.0005276874,0.00038437446,0.0005686512],"domain_scores_gemma":[0.99852324,0.00042439887,0.00006407089,0.000722735,0.00008326867,0.00018227726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966058,0.00015264867,0.00015528894,0.0001539036,0.00020751871,0.00012605665,0.0013654748,0.000055971595,0.000038565024],"category_scores_gemma":[0.00016356066,0.00010927466,0.00007562232,0.00060837466,0.00015078393,0.00096435525,0.00045889555,0.00013581853,0.00016148062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023352724,0.00008205584,0.00050798804,0.000016113943,0.00004920139,0.0000985539,0.00025942802,0.0000020074153,0.12783894,0.09430402,0.003915082,0.77290326],"study_design_scores_gemma":[0.0030935027,0.00066181057,0.0018745637,0.0004017832,0.000024873501,0.00019452437,0.000111052475,0.010037824,0.3537234,0.48513937,0.14287362,0.0018636626],"about_ca_topic_score_codex":0.000023678305,"about_ca_topic_score_gemma":0.000004215292,"teacher_disagreement_score":0.86666375,"about_ca_system_score_codex":0.000064036765,"about_ca_system_score_gemma":0.000038762362,"threshold_uncertainty_score":0.44560912},"labels":[],"label_agreement":null},{"id":"W1861909104","doi":"10.1007/s00453-013-9752-9","title":"Practical and Efficient Split Decomposition via Graph-Labelled Trees","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Lexicographical order; Graph; Modular decomposition; Decomposition; Mathematics; Algorithm; Combinatorics; Computer science; Inverse; Line graph; Pathwidth","score_opus":0.014971663974801794,"score_gpt":0.31105844003241884,"score_spread":0.296086776057617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861909104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060812596,0.000101232334,0.93445885,0.0033681225,0.000117100186,0.00037035893,0.0000012814133,0.00014979008,0.0006206923],"genre_scores_gemma":[0.59227,0.00001603993,0.407323,0.00016513343,0.000044662964,0.00006420911,0.0000026240293,0.000012298348,0.00010200748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846196,0.00014078245,0.0001901934,0.00046268848,0.00033656013,0.0004077939],"domain_scores_gemma":[0.9987576,0.00036289764,0.000055952325,0.00048032313,0.00012694592,0.00021629698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027125637,0.0001461664,0.00015673388,0.00017135477,0.00020157165,0.00018620359,0.00038769143,0.00006279756,0.000074812895],"category_scores_gemma":[0.000051957308,0.00012810052,0.000048705548,0.0004462637,0.0001681895,0.00047832838,0.00033105945,0.00021249258,0.00029157544],"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.00003915374,0.00063063484,0.00021712048,0.000026194488,0.00009397348,0.000092098926,0.0005736495,0.00024746003,0.032365892,0.3776856,0.0017935841,0.5862346],"study_design_scores_gemma":[0.0009290697,0.0003292209,0.005997948,0.00002082844,0.000011747339,0.00024606785,0.000042396627,0.80274326,0.011560233,0.17711718,0.0005896151,0.0004124167],"about_ca_topic_score_codex":0.000031586023,"about_ca_topic_score_gemma":0.000002294867,"teacher_disagreement_score":0.80249584,"about_ca_system_score_codex":0.000027485565,"about_ca_system_score_gemma":0.00003302489,"threshold_uncertainty_score":0.52237874},"labels":[],"label_agreement":null},{"id":"W1964276725","doi":"10.1007/s00453-011-9526-1","title":"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Theory of computation; Facility location problem; Mathematics; Linear programming relaxation; Relaxation (psychology); Dual (grammatical number); Exponential function; Integer (computer science); Algorithm; Mathematical optimization; Function (biology); Combinatorics; Linear programming; Computer science","score_opus":0.035183989583035154,"score_gpt":0.2237815915891898,"score_spread":0.18859760200615466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964276725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044019046,0.00018621325,0.9965393,0.0006001898,0.00021729288,0.0012492544,0.00003988004,0.00027599302,0.00045167378],"genre_scores_gemma":[0.056915473,0.000010657156,0.9419915,0.00016843858,0.00013421508,0.00055714644,0.00003617326,0.00001614118,0.0001702634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804425,0.00008293424,0.00034761545,0.00061662897,0.00044697738,0.00046160733],"domain_scores_gemma":[0.99823135,0.00017070168,0.00018352478,0.00087131007,0.00044821633,0.00009489096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069063803,0.00026701583,0.00023021376,0.00010677236,0.0005528424,0.00019021904,0.0009933156,0.00008496291,0.00002133302],"category_scores_gemma":[0.00002822983,0.00018077019,0.00010572229,0.00065108197,0.00026402745,0.00076323986,0.00020552288,0.00021118208,0.000025604779],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024757332,0.00021312006,0.000037050457,0.000050979503,0.00009751095,0.0000041642515,0.0034090348,0.000049613107,0.000025051473,0.043386098,0.00026020707,0.9524424],"study_design_scores_gemma":[0.0010023745,0.00054973125,0.00198796,0.00003675807,0.00005845368,0.0000929055,0.00039927298,0.9365055,0.004818774,0.04891004,0.005110931,0.0005273167],"about_ca_topic_score_codex":0.00014963055,"about_ca_topic_score_gemma":0.000020841713,"teacher_disagreement_score":0.9519151,"about_ca_system_score_codex":0.00005733658,"about_ca_system_score_gemma":0.00014416853,"threshold_uncertainty_score":0.7371595},"labels":[],"label_agreement":null},{"id":"W1964492068","doi":"10.1007/s00453-012-9679-6","title":"Relative Convex Hulls in Semi-Dynamic Arrangements","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Convex hull; Mathematics; Geodesic; Regular polygon; Simple (philosophy); Line (geometry); Geometry","score_opus":0.011384458024823796,"score_gpt":0.26014593654019524,"score_spread":0.24876147851537145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964492068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060841735,0.00038528428,0.93419117,0.0006478892,0.0007796914,0.00017020608,0.0000028582901,0.00006723394,0.0029139407],"genre_scores_gemma":[0.9451616,0.000009233854,0.05378431,0.0002599549,0.000103278326,0.000017239443,0.000015102609,0.0000051217203,0.0006441553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991263,0.000063424486,0.00016624489,0.00019163793,0.00019680508,0.0002555723],"domain_scores_gemma":[0.99955827,0.00008836334,0.000050667353,0.00018419877,0.00004241646,0.000076101096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737137,0.0000888032,0.00009922404,0.0001456379,0.00005549217,0.000034671197,0.00024041222,0.000043529064,0.000031461077],"category_scores_gemma":[0.00002651746,0.00009033227,0.000031188516,0.00049013615,0.000017035458,0.00082256587,0.000098370576,0.000106751104,0.00022145803],"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.000020942063,0.0009977287,0.012130851,0.000037629856,0.00015646184,0.00003503354,0.009669448,0.0036409101,0.0074729347,0.21789436,0.004356216,0.7435875],"study_design_scores_gemma":[0.0016752691,0.00013708312,0.1368967,0.000052031122,0.000016752241,0.00004207699,0.00010400211,0.7944049,0.007039959,0.029267432,0.029641856,0.0007219074],"about_ca_topic_score_codex":0.000008412517,"about_ca_topic_score_gemma":0.0000028509435,"teacher_disagreement_score":0.88431984,"about_ca_system_score_codex":0.00006566018,"about_ca_system_score_gemma":0.00002986714,"threshold_uncertainty_score":0.3683643},"labels":[],"label_agreement":null},{"id":"W1964699768","doi":"10.1007/s00453-015-9985-x","title":"Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Collision; Computer science; Matrix multiplication; Graph; Logical matrix; Quantum; Multiplication (music); Theoretical computer science; Mathematics; Combinatorics; Physics; Quantum mechanics; Programming language","score_opus":0.04442195042262893,"score_gpt":0.287607876807903,"score_spread":0.2431859263852741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964699768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29379904,0.00014528846,0.70489645,0.00033919193,0.00041216053,0.00018411204,0.000010105407,0.00018171148,0.000031937656],"genre_scores_gemma":[0.60809857,0.0000016686699,0.39170045,0.00004410719,0.000120253826,0.0000030225833,0.0000063386433,0.000015356542,0.000010239653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979959,0.00013543607,0.0004742847,0.0005319243,0.00047765567,0.00038477193],"domain_scores_gemma":[0.9982582,0.0001053634,0.00035474935,0.0007778503,0.0002876122,0.00021622452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060372095,0.00022381824,0.00032221238,0.00022837696,0.00018143207,0.0001015821,0.00091303827,0.00010171123,0.0000011975355],"category_scores_gemma":[0.000096397096,0.00020736536,0.0001267398,0.0007043065,0.00017766801,0.0003000301,0.0004936351,0.00023388313,0.000009420565],"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.00014128479,0.0013441828,0.0014437938,0.00036220887,0.0002110838,0.00010549815,0.0081801545,0.12323351,0.08485395,0.20733102,0.0016349427,0.57115835],"study_design_scores_gemma":[0.0004963179,0.0001283242,0.00044190115,0.00003787014,0.000010318073,0.000050535793,0.00007095827,0.97549635,0.008354334,0.014447706,0.00022224258,0.00024316968],"about_ca_topic_score_codex":0.00082883355,"about_ca_topic_score_gemma":0.000007493631,"teacher_disagreement_score":0.8522628,"about_ca_system_score_codex":0.00007368008,"about_ca_system_score_gemma":0.00018172241,"threshold_uncertainty_score":0.8456114},"labels":[],"label_agreement":null},{"id":"W1965608008","doi":"10.1007/s00453-013-9850-8","title":"Approximating Minimum-Cost Connected T-Joins","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Combinatorics; Mathematics; Rounding; Degree (music); Steiner tree problem; Discrete mathematics; Theory of computation; Path (computing); Undirected graph; Graph; Algorithm; Computer science","score_opus":0.017538724247570543,"score_gpt":0.22843547818148097,"score_spread":0.2108967539339104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965608008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01567257,0.000105930776,0.96769136,0.0026194097,0.00084215833,0.00077589916,0.0000092249575,0.0008729012,0.011410571],"genre_scores_gemma":[0.27660632,0.000007686321,0.72099656,0.0011755046,0.00032463737,0.00023357366,0.000017140019,0.000029136412,0.00060942554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805254,0.00007836832,0.00040271966,0.0005568707,0.00033787338,0.00057164533],"domain_scores_gemma":[0.99842346,0.00024619943,0.00013319428,0.0008253038,0.00016968096,0.00020218852],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021384664,0.00023376419,0.00026434677,0.00016346581,0.0002926987,0.00040226002,0.0013166167,0.00009121894,0.00025896617],"category_scores_gemma":[0.00010285354,0.00022223585,0.00012257427,0.0007444171,0.00010942618,0.0007833097,0.00045376364,0.00026434078,0.000931711],"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.0000017064082,0.00021341575,0.000106083935,0.000027248629,0.000064086664,0.00002613094,0.0009728422,0.000018996165,0.0021530148,0.11315201,0.01098242,0.872282],"study_design_scores_gemma":[0.00072193355,0.000108947555,0.0020138267,0.000042521162,0.000009389864,0.000093869596,0.00014329907,0.90317464,0.005000137,0.07453882,0.013502628,0.00065000635],"about_ca_topic_score_codex":0.0001512751,"about_ca_topic_score_gemma":0.000004664262,"teacher_disagreement_score":0.9031556,"about_ca_system_score_codex":0.00003580475,"about_ca_system_score_gemma":0.000054588236,"threshold_uncertainty_score":0.99984616},"labels":[],"label_agreement":null},{"id":"W1966508610","doi":"10.1007/s00453-004-1083-4","title":"Minimizing Makespan in Batch Machine Scheduling","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Job shop scheduling; Scheduling (production processes); Binary logarithm; Algorithm; Computer science; Running time; Combinatorics; Approximation algorithm; Batch processing; Time complexity; Mathematics; Discrete mathematics; Mathematical optimization; Schedule","score_opus":0.008698031878053774,"score_gpt":0.215052947813895,"score_spread":0.20635491593584124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966508610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24949507,0.0023218761,0.73590505,0.0011726064,0.0017580315,0.000389243,0.000024209012,0.0017798934,0.0071540214],"genre_scores_gemma":[0.5351177,0.00006339009,0.46440443,0.00010784476,0.00015892881,0.000017143217,0.000022691995,0.000056831926,0.000051049454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988888,0.000014492947,0.00030990798,0.0002357762,0.0001700804,0.00038093896],"domain_scores_gemma":[0.99957204,0.000037386733,0.000024743178,0.00022693323,0.000029887267,0.00010900681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001546328,0.00020039652,0.00021159611,0.00021159733,0.00005580914,0.00005037884,0.00018202173,0.000120434896,0.00006400955],"category_scores_gemma":[0.000037305508,0.00021983456,0.000057239566,0.00048350217,0.000027145836,0.00013946129,0.000028039549,0.0003105688,0.0001327643],"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.0000049418827,0.000037183305,0.00018088879,0.000020566024,0.000020380017,0.00003822844,0.0004017404,0.97702485,0.0003338001,0.00032306876,0.000014062611,0.021600269],"study_design_scores_gemma":[0.0016066781,0.000029483079,0.00039744022,0.00009657933,0.000011720455,0.000033173645,0.00023984515,0.9892341,0.0066529396,0.0007788868,0.00048970734,0.00042945927],"about_ca_topic_score_codex":0.0000606156,"about_ca_topic_score_gemma":0.000029739625,"teacher_disagreement_score":0.2856226,"about_ca_system_score_codex":0.00013577197,"about_ca_system_score_gemma":0.000030085728,"threshold_uncertainty_score":0.89645934},"labels":[],"label_agreement":null},{"id":"W1966685253","doi":"10.1007/s00453-001-0114-7","title":"Fast Algorithms for Approximating Distances","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Algorithm; Theory of computation; Computer science; Mathematics","score_opus":0.0375521915516917,"score_gpt":0.2576016958970011,"score_spread":0.2200495043453094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966685253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046922136,0.00031317398,0.9953978,0.0010532673,0.0004692781,0.00020589653,0.000009515064,0.00014924226,0.0019326289],"genre_scores_gemma":[0.080184296,0.00000992686,0.9173981,0.00029661378,0.00047578238,0.00008905263,0.000018164154,0.000009575394,0.0015185181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900603,0.000021559325,0.0002188173,0.00032292915,0.0002029064,0.00022778087],"domain_scores_gemma":[0.99938655,0.00014440074,0.00008154131,0.00022153389,0.00010004347,0.000065922555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017138278,0.00010770705,0.00011684535,0.000076988246,0.00021833823,0.00015368348,0.0003825247,0.000036100108,0.000025617614],"category_scores_gemma":[0.00004811245,0.000103787635,0.00006656511,0.000354817,0.00002194235,0.00039710064,0.00006593213,0.000057604255,0.000048245496],"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":[8.7582777e-7,0.00005312768,0.0000046648674,0.000011434867,0.000012104311,0.0000016593128,0.00030698083,0.00072996825,0.00017405512,0.034172356,0.003021001,0.9615118],"study_design_scores_gemma":[0.00025098576,0.00005733412,0.00003808323,0.000006730034,0.0000035842645,0.000011642858,0.000018209952,0.962313,0.0018836297,0.008803683,0.026464183,0.00014892274],"about_ca_topic_score_codex":0.0000020250523,"about_ca_topic_score_gemma":7.982189e-7,"teacher_disagreement_score":0.961583,"about_ca_system_score_codex":0.000024290086,"about_ca_system_score_gemma":0.000011914988,"threshold_uncertainty_score":0.42323372},"labels":[],"label_agreement":null},{"id":"W1967767406","doi":"10.1007/s00453-011-9496-3","title":"Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; École de Technologie Supérieure; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Asynchronous communication; Topology (electrical circuits); Node (physics); Network topology; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network; Physics","score_opus":0.03662411861360209,"score_gpt":0.24606018609382008,"score_spread":0.20943606748021798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967767406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05194985,0.00006768494,0.93600214,0.0004589652,0.000079231584,0.00034383917,0.0000023693062,0.00020780657,0.010888114],"genre_scores_gemma":[0.43968078,0.00003711093,0.55959594,0.00021321497,0.000026674836,0.000022316288,0.0000043589744,0.000019878153,0.00039974332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985373,0.0000945416,0.00018521058,0.0004004611,0.0003216195,0.00046083852],"domain_scores_gemma":[0.99927044,0.00004092491,0.000037457994,0.00041157857,0.00010477883,0.0001348047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003551142,0.00013467927,0.00014840515,0.00026464585,0.00009007357,0.00012354135,0.0007242934,0.000055981414,0.000048963106],"category_scores_gemma":[0.000010937639,0.00011556858,0.000033354427,0.00078254193,0.00013145563,0.0005504839,0.00022734032,0.00023240093,0.0000837958],"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.00025767335,0.0024261707,0.020357203,0.0002587347,0.00030708214,0.0019499164,0.121433064,0.110603884,0.0016102247,0.2488809,0.0025444508,0.4893707],"study_design_scores_gemma":[0.0012822725,0.0005099066,0.0058295466,0.00010167252,0.000005230951,0.00003275378,0.0006168342,0.985168,0.0041935323,0.0011660808,0.0005824822,0.00051169423],"about_ca_topic_score_codex":0.00025535855,"about_ca_topic_score_gemma":0.000036791494,"teacher_disagreement_score":0.8745641,"about_ca_system_score_codex":0.000031777483,"about_ca_system_score_gemma":0.000092962546,"threshold_uncertainty_score":0.471275},"labels":[],"label_agreement":null},{"id":"W1970537895","doi":"10.1007/s00453-006-1219-9","title":"Parallel Computation of High-Dimensional Robust Correlation and Covariance Matrices","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Parallelizable manifold; Computer science; Covariance matrix; Scalability; Curse of dimensionality; Robustness (evolution); Computation; Algorithm; Covariance; Theory of computation; Parallel computing; Mathematics; Artificial intelligence; Statistics","score_opus":0.04581695804650272,"score_gpt":0.3360387877454807,"score_spread":0.290221829698978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970537895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011667499,0.00012429968,0.98766017,0.000091158494,0.0000790981,0.00012773511,0.000030300564,0.000028968172,0.00019075237],"genre_scores_gemma":[0.21718079,0.000004281238,0.78264296,0.0000133659205,0.000042877575,0.000004508714,0.000015308995,0.000008864791,0.00008701519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927163,0.000049132195,0.00026249772,0.00015967997,0.0001503503,0.000106709835],"domain_scores_gemma":[0.99904656,0.0006124614,0.00015048613,0.00007411105,0.00008731562,0.000029038667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014872207,0.0000852494,0.00018494405,0.00003557463,0.00005252658,0.000007978924,0.000033436903,0.000051901035,0.000011528811],"category_scores_gemma":[0.00009919067,0.000077266726,0.000019420766,0.000079949416,0.000060816834,0.000079421676,0.00002244651,0.00006420949,0.0000023779867],"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.000038264912,0.00010892551,0.000036716265,0.00007553847,0.000016332737,0.0000052410433,0.000034016964,0.07231246,0.00024178984,0.8838052,0.0007343903,0.04259112],"study_design_scores_gemma":[0.0003328697,0.000030847186,0.000879285,0.00002273164,0.000021735406,0.000006304257,0.000004542735,0.3356915,0.000104395345,0.6628164,0.000020974876,0.000068382054],"about_ca_topic_score_codex":0.00008476394,"about_ca_topic_score_gemma":0.000004061931,"teacher_disagreement_score":0.26337907,"about_ca_system_score_codex":0.000012495099,"about_ca_system_score_gemma":0.000012079642,"threshold_uncertainty_score":0.31508458},"labels":[],"label_agreement":null},{"id":"W1970805842","doi":"10.1007/s00453-008-9205-z","title":"Editorial, COCOON 2007 Special Issue","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Academic Writing and Publishing","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Theory of computation; Computer science; Algorithm","score_opus":0.02201948500276925,"score_gpt":0.2265180304546347,"score_spread":0.20449854545186547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970805842","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025091849,0.00020720507,0.00003460893,0.0014857502,0.24435881,0.00012849097,0.000043277993,0.00026241114,0.75097024],"genre_scores_gemma":[0.005916794,0.00004613577,0.00021985751,0.00055521703,0.93924856,0.00000795516,0.000028086832,0.000024301404,0.05395312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988478,0.0000327743,0.00022648668,0.00021465032,0.00034777608,0.00033054865],"domain_scores_gemma":[0.99937356,0.0001040863,0.000071942326,0.00015518224,0.0001917717,0.00010344731],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022457012,0.0001369743,0.00016948677,0.000063982625,0.0006008341,0.00016005519,0.00025511286,0.00012193312,0.009836413],"category_scores_gemma":[0.00015602983,0.00012722878,0.000059459984,0.000045613724,0.00024608255,0.00043367964,0.000050082373,0.00041708152,0.001574604],"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.000005804853,0.000021296464,0.000020264917,0.0000050324356,0.000009431935,0.00000798792,0.0065865647,4.4425764e-7,0.0000036577053,0.008561294,0.98070455,0.0040736953],"study_design_scores_gemma":[0.00022463546,0.00003380254,0.000015514806,0.000015525367,0.000008621303,0.000012019808,0.0010701861,0.000033447857,0.000037711983,0.0006817016,0.9976868,0.00018000593],"about_ca_topic_score_codex":0.00040031027,"about_ca_topic_score_gemma":0.000019067096,"teacher_disagreement_score":0.69701713,"about_ca_system_score_codex":0.000031597592,"about_ca_system_score_gemma":0.00006679198,"threshold_uncertainty_score":0.9992028},"labels":[],"label_agreement":null},{"id":"W1972778917","doi":"10.1007/s00453-003-1053-2","title":"Minimizing Mean Completion Time in a Batch Processing System","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Batch processing; Uniprocessor system; Theory of computation; Scheduling (production processes); Time complexity; Computer science; Job scheduler; Job shop scheduling; Polynomial-time approximation scheme; Mathematical optimization; Algorithm; Parallel computing; Mathematics; Schedule; Operating system","score_opus":0.008291348902379302,"score_gpt":0.19922173936996293,"score_spread":0.19093039046758362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972778917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1236411,0.0019156622,0.81015277,0.00015076365,0.0014628086,0.00080426334,0.00001970772,0.0035079112,0.058344997],"genre_scores_gemma":[0.7538572,0.000007150745,0.24576433,0.000028776369,0.000093200455,0.000026821912,0.000019616455,0.00005791007,0.00014498051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990244,0.00004818223,0.0002842927,0.00019662241,0.00016408678,0.00028240576],"domain_scores_gemma":[0.99966425,0.000035453188,0.000032441058,0.0001473275,0.000047959453,0.00007254314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024776725,0.00015589272,0.00020912696,0.00015080521,0.000065855056,0.00005819963,0.00009762477,0.00009070992,0.000048459046],"category_scores_gemma":[0.000023284785,0.00017021995,0.000036411922,0.00041468695,0.000018078726,0.00012035165,0.00000862964,0.0001566373,0.00016114123],"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.000029880399,0.00024394898,0.0008085984,0.0011199014,0.00013774235,0.00016367243,0.0064658774,0.8474263,0.0051215156,0.002892835,0.0014155237,0.13417418],"study_design_scores_gemma":[0.0004318522,0.000011211668,0.00008129898,0.00013291356,0.000008871727,0.000035177825,0.0004047832,0.9962824,0.0016707153,0.000022080398,0.0006991603,0.00021951635],"about_ca_topic_score_codex":0.000007735492,"about_ca_topic_score_gemma":0.0000025151926,"teacher_disagreement_score":0.6302161,"about_ca_system_score_codex":0.00014606438,"about_ca_system_score_gemma":0.000023739749,"threshold_uncertainty_score":0.69413686},"labels":[],"label_agreement":null},{"id":"W1973201650","doi":"10.1007/s00453-012-9690-y","title":"A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Theory of computation; Randomized algorithm; Facility location problem; Metric (unit); Bounded function; Metric space; Constant (computer programming); Approximation algorithm; Deterministic algorithm; Set (abstract data type); Connection (principal bundle); Mathematics; Computer science; Binary logarithm; Distributed algorithm; Pairwise comparison; Algorithm; Point (geometry); Exponent; Discrete mathematics; Mathematical optimization; Distributed computing","score_opus":0.025684950048489502,"score_gpt":0.238173884461227,"score_spread":0.2124889344127375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973201650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008732989,0.00014781606,0.9911754,0.0037409,0.00069645926,0.0015252559,0.00007855495,0.00021665999,0.0015456446],"genre_scores_gemma":[0.956776,0.000027471615,0.030727472,0.0026639795,0.0028005342,0.0017853187,0.0036029133,0.000045411045,0.001570848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987032,0.000010565256,0.0003511724,0.00023513072,0.00027348212,0.00042645095],"domain_scores_gemma":[0.9991218,0.000044324595,0.000101038706,0.00036775708,0.00034274525,0.00002232483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090002717,0.00018287597,0.0001365365,0.00008874491,0.00042697342,0.00015104975,0.00027984098,0.00006214045,0.00021022801],"category_scores_gemma":[0.00010141098,0.0001377228,0.000088313296,0.00061364955,0.000058314345,0.0012362766,0.00011123965,0.000091274924,0.00067611976],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001913553,0.0003142395,0.00038263443,0.00029050716,0.000090610265,1.0517382e-7,0.00015232242,0.0010354093,0.000018047336,0.029875843,0.026666423,0.9411547],"study_design_scores_gemma":[0.00037966997,0.0000069508937,0.0038914215,0.000008324094,0.000084870335,4.781152e-7,0.0004297535,0.5078357,0.000057687004,0.0014760908,0.4856166,0.00021247921],"about_ca_topic_score_codex":0.0005986207,"about_ca_topic_score_gemma":0.00005347131,"teacher_disagreement_score":0.96044797,"about_ca_system_score_codex":0.00007807609,"about_ca_system_score_gemma":0.000016586162,"threshold_uncertainty_score":0.86903775},"labels":[],"label_agreement":null},{"id":"W1973228454","doi":"10.1007/s00453-012-9726-3","title":"Efficient Fully-Compressed Sequence Representations","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Disjoint sets; Substring; Mathematics; Amortized analysis; Redundancy (engineering); Data structure; Binary logarithm; Compressed suffix array; Subsequence; Algorithm; Sequence (biology); Discrete mathematics; Suffix tree; Computer science","score_opus":0.030796802325430674,"score_gpt":0.2926913199302248,"score_spread":0.2618945176047941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973228454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008075523,0.00036861503,0.9850438,0.0006820436,0.0011581866,0.00020440508,0.000024547238,0.00036679962,0.004076037],"genre_scores_gemma":[0.6952435,0.000008352711,0.3035261,0.0003579762,0.0004409746,0.000045388595,0.000026766866,0.000016060036,0.0003349261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822104,0.000086194865,0.00026817952,0.0004225496,0.00043043465,0.000571613],"domain_scores_gemma":[0.9982771,0.00014990235,0.000101143094,0.001093574,0.00009196372,0.000286275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002740744,0.00017652668,0.00016698557,0.00010285344,0.00027651747,0.00014481675,0.0010611762,0.0000679394,0.00008029395],"category_scores_gemma":[0.000051861076,0.00015412325,0.00007746761,0.00045703916,0.00006765857,0.00055194227,0.0006095032,0.00017658227,0.0004504621],"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.00002380693,0.0019189132,0.0019354759,0.00005530307,0.00013955822,0.00009803516,0.004524322,0.007493769,0.027470123,0.28078333,0.045233738,0.63032365],"study_design_scores_gemma":[0.00048027624,0.000044557535,0.0059343977,0.000029426788,0.000014169637,0.000094523566,0.000058398473,0.9443334,0.009760491,0.0016536816,0.0371241,0.00047259513],"about_ca_topic_score_codex":0.0000735282,"about_ca_topic_score_gemma":4.4081196e-7,"teacher_disagreement_score":0.93683964,"about_ca_system_score_codex":0.000045817993,"about_ca_system_score_gemma":0.000047386784,"threshold_uncertainty_score":0.62849635},"labels":[],"label_agreement":null},{"id":"W1977261082","doi":"10.1007/s00453-014-9947-8","title":"Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Combinatorics; Data structure; Path (computing); Multiset; Binary logarithm; Rank (graph theory); Tree (set theory); Linear space; Element (criminal law); Mathematics; Order (exchange); Space (punctuation); Range (aeronautics); Time complexity; Discrete mathematics; Computer science","score_opus":0.029155084635691452,"score_gpt":0.2760695025497986,"score_spread":0.24691441791410718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977261082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017695688,0.0002727616,0.99468935,0.001758614,0.0004929065,0.00023374196,0.00020785723,0.00015799196,0.00041719485],"genre_scores_gemma":[0.06822116,0.00006894538,0.9300114,0.0005536076,0.00076208723,0.000027730965,0.00018302308,0.00002473815,0.00014733995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985499,0.0000565526,0.00018277165,0.0006910337,0.00022849378,0.00029124808],"domain_scores_gemma":[0.99790865,0.0003008703,0.00008802805,0.0015239423,0.000058458285,0.00012006515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002636933,0.00019916939,0.00022302472,0.00006547219,0.0002483789,0.00017868684,0.0013663871,0.00008276122,0.000008427835],"category_scores_gemma":[0.00015420787,0.0001550738,0.000032852215,0.00011786225,0.00008415651,0.0006939604,0.000611172,0.00012805797,0.000009840715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032206128,0.000072531446,0.00022259007,0.00004343861,0.00004148911,0.0000065417757,0.00039804747,0.000036348836,0.0009103566,0.23352565,0.018549453,0.74616134],"study_design_scores_gemma":[0.0014335087,0.00061311026,0.004856109,0.000069693204,0.000025889962,0.00002935051,0.000040793544,0.728922,0.0029961546,0.08864537,0.17170995,0.00065806403],"about_ca_topic_score_codex":0.00009233281,"about_ca_topic_score_gemma":0.00002946962,"teacher_disagreement_score":0.7455033,"about_ca_system_score_codex":0.000011130807,"about_ca_system_score_gemma":0.000032011765,"threshold_uncertainty_score":0.63237256},"labels":[],"label_agreement":null},{"id":"W1978321932","doi":"10.1007/s00453-004-1093-2","title":"An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Theory of computation; Minification; Constant (computer programming); Algorithm; Mathematics; Running time; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematical optimization; Telecommunications","score_opus":0.01570207297804851,"score_gpt":0.272842290635547,"score_spread":0.2571402176574985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978321932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024305653,0.00006022948,0.97405386,0.0003802018,0.00060825684,0.0003544787,0.000014414457,0.00017567459,0.000047255806],"genre_scores_gemma":[0.2136779,0.0000010242471,0.78558457,0.00028890287,0.00022437307,0.000049328657,0.00009404208,0.000012136297,0.0000677445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860036,0.00003950743,0.00028534266,0.0004877845,0.00026957536,0.00031740597],"domain_scores_gemma":[0.99902874,0.00018473106,0.00010575857,0.00034381973,0.0002111543,0.00012578501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025016602,0.0001569729,0.00015424541,0.00015250548,0.00045477046,0.0005824783,0.0003691264,0.000080938466,0.000007696576],"category_scores_gemma":[0.00007853617,0.00015939304,0.00008198352,0.00047926424,0.000043149896,0.0005547781,0.000042430896,0.00007626771,0.000017533419],"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.0000063165016,0.0002819901,0.0000020751945,0.0000058815394,0.000015852918,0.0000043473774,0.0006153013,0.31127846,0.0021252658,0.005504111,0.00013367007,0.6800267],"study_design_scores_gemma":[0.00094992906,0.00017251853,0.00024014943,0.000013387,0.000009677368,0.000020230309,0.000016387743,0.95717937,0.031678483,0.008208467,0.0012948792,0.0002165441],"about_ca_topic_score_codex":0.000020650328,"about_ca_topic_score_gemma":0.0000021853793,"teacher_disagreement_score":0.67981017,"about_ca_system_score_codex":0.0000885485,"about_ca_system_score_gemma":0.00021358083,"threshold_uncertainty_score":0.6499859},"labels":[],"label_agreement":null},{"id":"W1981160608","doi":"10.1007/s00453-011-9551-0","title":"Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Planar graph; Mathematics; Planar; Theory of computation; Line (geometry); Computer science; Graph; Geometry; Algorithm; Artificial intelligence; Computer graphics (images)","score_opus":0.038526654281998925,"score_gpt":0.24257025766374965,"score_spread":0.20404360338175073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981160608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08252461,0.00004742488,0.91437566,0.00046386,0.00033868427,0.00014973954,0.0000054455836,0.00004151553,0.0020530652],"genre_scores_gemma":[0.88479745,0.0000012741442,0.11482048,0.00020713934,0.00008625342,0.00000978031,0.0000031924628,0.000003691434,0.00007076038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999279,0.000037126207,0.00016206247,0.00020297071,0.00017852121,0.00014030791],"domain_scores_gemma":[0.9993969,0.00011022953,0.0000697045,0.00027630245,0.000095462485,0.00005136085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030454624,0.00007661431,0.000093079434,0.000086412416,0.00011182783,0.000025272897,0.0004469079,0.00002553112,0.000028533243],"category_scores_gemma":[0.000033842727,0.000057233436,0.000047207985,0.00046836108,0.000026133632,0.00015445283,0.00010091298,0.000066860644,0.000019408026],"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.000016013057,0.00022156935,0.0005640938,0.000013228126,0.000077281155,0.000008273167,0.0022278249,0.00046235943,0.004724571,0.5082112,0.0014607124,0.4820129],"study_design_scores_gemma":[0.0011317212,0.0011151384,0.18079089,0.000066164226,0.000058028454,0.00006531275,0.00010969166,0.25746328,0.24102612,0.30946115,0.007906138,0.0008063829],"about_ca_topic_score_codex":0.000045258086,"about_ca_topic_score_gemma":0.000039936618,"teacher_disagreement_score":0.8022728,"about_ca_system_score_codex":0.0000085367055,"about_ca_system_score_gemma":0.000037009417,"threshold_uncertainty_score":0.23339118},"labels":[],"label_agreement":null},{"id":"W1982250524","doi":"10.1007/s00453-006-0112-x","title":"Large Deviations for the Weighted Height of an Extended Class of Trees","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Binary search tree; Class (philosophy); Weight-balanced tree; Intersection (aeronautics); Constant (computer programming); Theory of computation; Binary tree; Tree (set theory); Random binary tree; Limit (mathematics); Plane (geometry); Discrete mathematics; Large deviations theory; Statistics; Algorithm; Geometry; Mathematical analysis; Computer science","score_opus":0.010497652059589604,"score_gpt":0.24524001371447793,"score_spread":0.23474236165488832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982250524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023193026,0.00022867482,0.9947201,0.00092133397,0.00022083618,0.00034074468,0.00015636355,0.000064160966,0.001028467],"genre_scores_gemma":[0.80957794,0.00004214937,0.18816665,0.0001618467,0.00032586136,0.00008669631,0.00022773595,0.000020682817,0.0013904609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896556,0.000035419864,0.00030052254,0.0002453868,0.00022815303,0.00022498086],"domain_scores_gemma":[0.9988302,0.00016876379,0.00016738787,0.00068520504,0.00011973838,0.00002870095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904891,0.00010643427,0.00016456367,0.00009355418,0.00012555975,0.000053396023,0.0010741303,0.000035877943,0.0000140731345],"category_scores_gemma":[0.00001309493,0.00007493974,0.00008886661,0.00038218356,0.000056720324,0.0005159919,0.00017846476,0.000047464888,0.000004456762],"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.000008221441,0.000545151,0.00006362196,0.000023835462,0.00008245938,0.00000243107,0.00015610975,0.000021100657,0.00057223806,0.8861465,0.010161623,0.102216706],"study_design_scores_gemma":[0.0012226589,0.0002178093,0.011634796,0.000016245793,0.000068331115,0.0000024547028,0.000098587065,0.8080047,0.013674736,0.05582064,0.10900417,0.00023488438],"about_ca_topic_score_codex":0.000052657673,"about_ca_topic_score_gemma":0.000091636444,"teacher_disagreement_score":0.83032584,"about_ca_system_score_codex":0.000009743054,"about_ca_system_score_gemma":0.000027300392,"threshold_uncertainty_score":0.30559537},"labels":[],"label_agreement":null},{"id":"W1982770663","doi":"10.1007/s00453-001-0045-3","title":"Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Simple polygon; Polygon (computer graphics); Mathematics; Binary logarithm; Upper and lower bounds; Theory of computation; Discrete mathematics; Regular polygon; Computer science; Algorithm; Geometry","score_opus":0.020223396290688023,"score_gpt":0.28532774633730645,"score_spread":0.2651043500466184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982770663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05513712,0.00045274725,0.9424844,0.0003821474,0.00021503647,0.00090366305,0.000012664377,0.0001259407,0.0002863175],"genre_scores_gemma":[0.46267438,0.00007018954,0.53565055,0.00027772484,0.00014635146,0.0006856985,0.00004243018,0.000047663707,0.00040503588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783754,0.00013867195,0.0004033874,0.00055640104,0.00041886567,0.00064513745],"domain_scores_gemma":[0.99868685,0.00044267267,0.00012965573,0.00050387444,0.00007829924,0.00015866467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000718634,0.00019208278,0.00031684482,0.00028335996,0.00008809837,0.000065190936,0.0009823057,0.000112172886,0.0000048033776],"category_scores_gemma":[0.00007669485,0.00019720379,0.000102689344,0.00077026273,0.000121722784,0.00039332628,0.00021691632,0.0002900225,0.000009001803],"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.000099574514,0.00070363213,0.0018471127,0.000100660654,0.00008818536,0.00020223418,0.0061047045,0.009492262,0.006169867,0.0025369532,0.0065244725,0.9661303],"study_design_scores_gemma":[0.0019213827,0.0010313191,0.0007059121,0.00013454708,0.000008863787,0.00016295869,0.0005819759,0.9802374,0.0022277187,0.002912685,0.009609706,0.00046548893],"about_ca_topic_score_codex":0.0003691828,"about_ca_topic_score_gemma":0.0000046523255,"teacher_disagreement_score":0.9707452,"about_ca_system_score_codex":0.00012842778,"about_ca_system_score_gemma":0.00011244521,"threshold_uncertainty_score":0.8041737},"labels":[],"label_agreement":null},{"id":"W1987966922","doi":"10.1007/s00453-001-0043-5","title":"All-to-All Optical Routing in Chordal Rings of Degree 4","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optical Network Technologies","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Chordal graph; Degree (music); Theory of computation; Routing (electronic design automation); Computer science; Mathematics; Combinatorics; Computer network; Algorithm; Physics; Graph","score_opus":0.02399159042280458,"score_gpt":0.2442627159242618,"score_spread":0.22027112550145722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987966922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762641,0.00008547357,0.010686597,0.000658481,0.0001798965,0.00019024507,0.000002630741,0.0006881792,0.011244379],"genre_scores_gemma":[0.90833175,0.0000417376,0.09139745,0.00007787924,0.000075651085,0.000014116579,0.000002098755,0.000032899916,0.000026433903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883133,0.000007386285,0.00031146317,0.00019826618,0.00015886825,0.0004926773],"domain_scores_gemma":[0.9994963,0.00010536164,0.000017052764,0.00027254075,0.0000217431,0.000087049964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001351042,0.00015657033,0.00024716306,0.0001426541,0.000011181205,0.000015177499,0.00030913868,0.00015795018,0.000026279891],"category_scores_gemma":[0.00012352336,0.00016217868,0.00004636115,0.00040172497,0.000053196032,0.00007543419,0.00013791035,0.00030881166,0.000079847276],"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.00007012011,0.00028830703,0.018214261,0.000116808646,0.00027310202,0.00046704203,0.00065692025,0.040655777,0.016985249,0.036512658,0.003267225,0.88249254],"study_design_scores_gemma":[0.0016109799,0.00036281123,0.05620955,0.00028787865,0.00006740065,0.00010686905,0.00034571058,0.888338,0.027997727,0.0039493274,0.019396788,0.0013269292],"about_ca_topic_score_codex":0.000029146135,"about_ca_topic_score_gemma":0.000022260689,"teacher_disagreement_score":0.8811656,"about_ca_system_score_codex":0.00007658618,"about_ca_system_score_gemma":0.0000059495637,"threshold_uncertainty_score":0.6613455},"labels":[],"label_agreement":null},{"id":"W1988115395","doi":"10.1007/s00453-012-9712-9","title":"Compact Navigation and Distance Oracles for Graphs with Small Treewidth","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Oracle; Combinatorics; Mathematics; Discrete mathematics; Bounded function; Adjacency list; Constant (computer programming); Computer science; Graph; Pathwidth; Line graph","score_opus":0.021067207725728593,"score_gpt":0.24593302265123274,"score_spread":0.22486581492550414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988115395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021341557,0.00052198244,0.97704244,0.00032454522,0.00018648902,0.0002535693,0.00004158577,0.00011931267,0.00016855042],"genre_scores_gemma":[0.55293757,0.000017863762,0.44658998,0.00011681509,0.00015378013,0.000024841293,0.00006314452,0.000015872669,0.000080100486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990517,0.00002738812,0.00014116205,0.0002874569,0.00015381307,0.00033850104],"domain_scores_gemma":[0.99917996,0.00012717005,0.00008964795,0.0003745415,0.00006230963,0.00016639038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017632262,0.00015066574,0.00015800909,0.00004815562,0.00019727145,0.00012674811,0.0003275767,0.000044157154,0.0000020468478],"category_scores_gemma":[0.000009077291,0.000110263936,0.000031639946,0.00019054076,0.00006413211,0.00083308003,0.00008697539,0.00007981615,0.000004697477],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007023597,0.00028524638,0.00670481,0.00007752318,0.000062379324,0.000007278549,0.0010146368,0.000019864452,0.00062083063,0.14710158,0.0032408661,0.84079474],"study_design_scores_gemma":[0.0061200103,0.0016011441,0.11828188,0.0006240682,0.00014619494,0.0004166477,0.0003335436,0.4703594,0.016977377,0.063454114,0.31911334,0.0025722482],"about_ca_topic_score_codex":0.000043774275,"about_ca_topic_score_gemma":0.0000052392966,"teacher_disagreement_score":0.8382225,"about_ca_system_score_codex":0.000018900704,"about_ca_system_score_gemma":0.000020475156,"threshold_uncertainty_score":0.44964328},"labels":[],"label_agreement":null},{"id":"W1988381536","doi":"10.1007/s00453-013-9800-5","title":"Parameterized Analysis of Paging and List Update Algorithms","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Computer science; Paging; Locality; Algorithm; Cache; Theory of computation; Locality of reference; Online algorithm; Cache algorithms; Set (abstract data type); Memory hierarchy; CPU cache; Theoretical computer science; Parallel computing","score_opus":0.011120576140118882,"score_gpt":0.2412701161776356,"score_spread":0.23014954003751673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988381536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142107075,0.00009172089,0.98309374,0.0016137188,0.000075329364,0.00019628649,0.0000065677136,0.00009622291,0.00061572454],"genre_scores_gemma":[0.35279962,0.00010611234,0.64622533,0.00054551166,0.000018696972,0.00003254899,0.00001888743,0.000009230007,0.00024402881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891746,0.00007344643,0.00026107676,0.00030536499,0.00021557415,0.00022707622],"domain_scores_gemma":[0.9991471,0.00008854899,0.00009463485,0.000401317,0.00014338335,0.00012502108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021365692,0.00010388562,0.0002627562,0.00032581578,0.00006926588,0.0001987595,0.00040776966,0.000040565534,0.00016529919],"category_scores_gemma":[0.000028792174,0.00009162376,0.00007709633,0.0011819949,0.00007853851,0.00047101537,0.00022810507,0.00008103963,0.000025797395],"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.000004584152,0.00019482925,0.0021894332,0.000037101167,0.00141079,0.000011833866,0.001624529,0.0018674156,0.0036045082,0.019381441,0.0015793301,0.9680942],"study_design_scores_gemma":[0.00022427301,0.000028896196,0.0024780873,0.000004643423,0.00005147976,0.0000020942418,0.000018856943,0.99421746,0.0006875182,0.0013484152,0.00081896386,0.00011932029],"about_ca_topic_score_codex":0.00021780442,"about_ca_topic_score_gemma":0.0000029875323,"teacher_disagreement_score":0.99235004,"about_ca_system_score_codex":0.000010204452,"about_ca_system_score_gemma":0.000020457861,"threshold_uncertainty_score":0.37363085},"labels":[],"label_agreement":null},{"id":"W1988573007","doi":"10.1007/s00453-009-9329-9","title":"Minimum Weight Convex Steiner Partitions","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Partition (number theory); Regular polygon; Upper and lower bounds; Convex hull; Binary logarithm; Minimum spanning tree; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.009273704788841874,"score_gpt":0.23402277050136605,"score_spread":0.22474906571252418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988573007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010793287,0.00016050828,0.9748167,0.0077878884,0.00056500017,0.000112784764,0.000004010579,0.00019799452,0.0055618277],"genre_scores_gemma":[0.90495723,0.00000957426,0.090441264,0.0023864834,0.00044377116,0.000010052233,0.000020796733,0.000004038225,0.0017268002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992026,0.000030364256,0.00016010801,0.00023953902,0.00019254931,0.00017484448],"domain_scores_gemma":[0.9994835,0.00004713918,0.000040556817,0.00025452973,0.00008927332,0.00008497889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009667939,0.000086215325,0.00009226715,0.00008885545,0.00012307911,0.00008736716,0.00028293463,0.000037150603,0.00005456509],"category_scores_gemma":[0.000016151807,0.00008217174,0.00004771793,0.0003937114,0.000016185182,0.00032649102,0.000036718477,0.00006574427,0.00022798555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000538573,0.00029206628,0.000056530742,0.000004144735,0.000025398971,0.0000360954,0.0003166961,0.001259661,0.003707175,0.32026327,0.058757,0.6152766],"study_design_scores_gemma":[0.0009830365,0.0004203341,0.009062534,0.00001882339,0.00001872215,0.00008738013,0.000013306899,0.56223494,0.030249298,0.14460254,0.25172204,0.0005870431],"about_ca_topic_score_codex":0.0000018990887,"about_ca_topic_score_gemma":7.2454134e-7,"teacher_disagreement_score":0.8941639,"about_ca_system_score_codex":0.000016913891,"about_ca_system_score_gemma":0.000050639723,"threshold_uncertainty_score":0.33508664},"labels":[],"label_agreement":null},{"id":"W1988889787","doi":"10.1007/s00453-006-0074-2","title":"Deterministic Rendezvous in Graphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":false,"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":"Rendezvous; Computer science; Theory of computation; Time complexity; Binary logarithm; Graph; Identifier; Upper and lower bounds; Node (physics); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Computer network","score_opus":0.00716953051749322,"score_gpt":0.2238464719368621,"score_spread":0.21667694141936888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988889787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003561816,0.000102287595,0.96655774,0.0013563712,0.00029940502,0.0002207468,0.0000026740595,0.00027236392,0.027626568],"genre_scores_gemma":[0.8306001,0.000009849199,0.16778293,0.0002881532,0.000044487977,0.000022570286,0.0000062637137,0.000009199559,0.001236453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916464,0.0000422043,0.00017001525,0.0002267345,0.00016168086,0.00023473761],"domain_scores_gemma":[0.99958163,0.000045164987,0.000029318873,0.00026861997,0.000031080104,0.000044178152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013439196,0.00007182709,0.00008487681,0.00015103596,0.00004614204,0.00008710234,0.00040814033,0.000036350837,0.00001850493],"category_scores_gemma":[0.000014285566,0.00006976389,0.000028007078,0.00046340542,0.000029651776,0.00017612767,0.00008781982,0.0000888118,0.0000709498],"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.0000060672783,0.00043861597,0.0019616685,0.000023651923,0.000010232147,0.00040166077,0.00046582153,0.005350041,0.00052184536,0.60463566,0.007916503,0.3782682],"study_design_scores_gemma":[0.0007011457,0.000089069734,0.006951891,0.000016439184,0.0000017439573,0.00003853677,0.00000802106,0.875914,0.0005620472,0.105946176,0.009487852,0.00028307314],"about_ca_topic_score_codex":0.00011148148,"about_ca_topic_score_gemma":0.000037714137,"teacher_disagreement_score":0.870564,"about_ca_system_score_codex":0.000021394504,"about_ca_system_score_gemma":0.000036490586,"threshold_uncertainty_score":0.2844889},"labels":[],"label_agreement":null},{"id":"W1989370291","doi":"10.1007/s00453-008-9232-9","title":"Foreword from the Guest Editors","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Contemporary Sociological Theory and Practice","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Data science; Algorithm","score_opus":0.07002728346906383,"score_gpt":0.3157115223842164,"score_spread":0.24568423891515256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989370291","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40622824,0.0020837516,0.0017294064,0.11239585,0.035050206,0.00089937146,0.00020019984,0.0006718257,0.44074115],"genre_scores_gemma":[0.962237,0.00014850618,0.00045577798,0.0018008064,0.03125643,0.000012198113,0.000011994149,0.000006227173,0.0040710447],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998686,0.0006170829,0.00011579987,0.00015686126,0.00022311864,0.00020113884],"domain_scores_gemma":[0.996712,0.0029246672,0.00006220301,0.0001782488,0.000040976924,0.000081876955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007196878,0.00007102421,0.00009640017,0.0000068345694,0.001280578,0.000021278976,0.00037041903,0.00011212151,0.0006869439],"category_scores_gemma":[0.00092653243,0.000046542536,0.00007369323,0.00014028749,0.00062849163,0.0002457635,0.00004464133,0.00024390088,0.0003413334],"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.0000866116,0.0001346413,0.010329302,9.225102e-7,0.00010273242,0.00011051047,0.045352854,9.548611e-7,0.000026265949,0.06198393,0.8499759,0.03189537],"study_design_scores_gemma":[0.000079019606,0.000019649136,0.0032063893,0.000002345433,0.0000068260915,0.0000010661968,0.0020798936,0.000007616893,0.000020863046,0.018217256,0.97627985,0.00007923452],"about_ca_topic_score_codex":0.0027846051,"about_ca_topic_score_gemma":0.00008888902,"teacher_disagreement_score":0.55600876,"about_ca_system_score_codex":0.000021794438,"about_ca_system_score_gemma":0.0000884868,"threshold_uncertainty_score":0.98493},"labels":[],"label_agreement":null},{"id":"W1990097285","doi":"10.1007/s00453-005-1204-8","title":"A Dynamic Dictionary for Priced Information withApplication","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Theory of computation; Computer science; Set (abstract data type); Element (criminal law); Function (biology); Algorithm; Dynamic programming; Line (geometry); Mathematical optimization; Mathematics; Programming language","score_opus":0.00443896283111874,"score_gpt":0.23127863551334263,"score_spread":0.22683967268222388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990097285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018583878,0.000039782393,0.99371177,0.0031301323,0.00016224124,0.00033959973,0.000007820196,0.000157733,0.0005925596],"genre_scores_gemma":[0.31449246,0.0000061818505,0.6839761,0.00077072624,0.0001439379,0.00019392036,0.0001788996,0.000004098448,0.00023363806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999366,0.000010633974,0.00019022905,0.00015190686,0.00015963386,0.00012160548],"domain_scores_gemma":[0.99947554,0.000058309473,0.000084353596,0.00018381934,0.00015424092,0.000043748605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013781947,0.00007325332,0.00006024177,0.00012522213,0.00013978095,0.00008333025,0.00022113555,0.000038863756,0.000005806462],"category_scores_gemma":[0.00001981126,0.00007525904,0.000038001857,0.00030667044,0.000009473295,0.0013748263,0.000040951043,0.000042183292,0.00010483952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006722721,0.000040282688,0.000003825831,0.0000070686533,0.000010091289,6.4458035e-8,0.00016830635,0.0071152537,0.00048666698,0.047158863,0.002317912,0.94268495],"study_design_scores_gemma":[0.000282521,0.000041073643,0.0010474481,0.0000023027312,0.000003377597,0.000010063619,0.000005203301,0.8420659,0.0009384344,0.0035818208,0.15193315,0.000088730405],"about_ca_topic_score_codex":0.0000018718882,"about_ca_topic_score_gemma":0.0000013710803,"teacher_disagreement_score":0.9425962,"about_ca_system_score_codex":0.000067650464,"about_ca_system_score_gemma":0.000057299312,"threshold_uncertainty_score":0.30689746},"labels":[],"label_agreement":null},{"id":"W1991075883","doi":"10.1007/s00453-007-0057-8","title":"Quantum Complexity of Testing Group Commutativity","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Mathematics; Group testing; Commutative property; Randomized algorithm; Group (periodic table); Reduction (mathematics); Combinatorics; Discrete mathematics; Upper and lower bounds; Computational complexity theory; Quantization (signal processing); Quantum; Omega; Algorithm; Quantum mechanics","score_opus":0.04042840860709629,"score_gpt":0.2731064296135665,"score_spread":0.23267802100647023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991075883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16898641,0.000058638783,0.8287346,0.0004458098,0.00033119708,0.00011418387,0.000006234052,0.00023286145,0.0010901111],"genre_scores_gemma":[0.6205729,3.5253277e-7,0.37922916,0.00009665916,0.000081482875,0.000001001207,0.0000024432527,0.000008826706,0.0000071314344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981493,0.00010273483,0.00044813077,0.000404339,0.00038368927,0.000511839],"domain_scores_gemma":[0.9979823,0.00082874525,0.00023903846,0.00065717107,0.0001467166,0.00014602566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012159029,0.0002031609,0.00031632392,0.0001509045,0.000224606,0.000056059074,0.0010903066,0.00007095538,0.000005249989],"category_scores_gemma":[0.00015466264,0.00018598352,0.000100331774,0.00084874453,0.00030224983,0.00017253676,0.0005139828,0.00033496576,0.000012623745],"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.000011259427,0.00036439425,0.0013541754,0.000055660203,0.000045148226,0.00008875684,0.0009882002,0.00037117134,0.0064736563,0.20706353,0.00019486492,0.7829892],"study_design_scores_gemma":[0.00038197252,0.0003238248,0.030152801,0.00004533648,0.0000064902742,0.000102733786,0.00003326366,0.9038734,0.0054405746,0.05872289,0.00061054534,0.00030620804],"about_ca_topic_score_codex":0.00024817704,"about_ca_topic_score_gemma":0.000020435016,"teacher_disagreement_score":0.90350217,"about_ca_system_score_codex":0.000029159242,"about_ca_system_score_gemma":0.000043263182,"threshold_uncertainty_score":0.7584188},"labels":[],"label_agreement":null},{"id":"W1993117718","doi":"10.1007/s00453-014-9952-y","title":"Randomized Fixed-Parameter Algorithms for the Closest String Problem","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomized algorithm; Theory of computation; Algorithm; Hamming distance; Integer (computer science); Mathematics; String (physics); Context (archaeology); Set (abstract data type); Hamming code; Combinatorics; Discrete mathematics; Computer science","score_opus":0.022684086345454428,"score_gpt":0.2687700531542797,"score_spread":0.24608596680882527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993117718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015227291,0.00031520272,0.9941586,0.0021593606,0.00094427477,0.0013103494,0.000021595428,0.00027330447,0.0006649862],"genre_scores_gemma":[0.031582393,0.000065901426,0.9647849,0.0009986102,0.0009866573,0.0007340085,0.000035084122,0.00004529284,0.00076715025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740595,0.00023623325,0.00052418286,0.0007006355,0.00043477243,0.00069825846],"domain_scores_gemma":[0.99428016,0.0038901777,0.00022966211,0.0012574642,0.00016748862,0.0001750655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020967263,0.00031058324,0.00054796465,0.00009545073,0.00053325796,0.0004633566,0.0019377157,0.000117651485,0.000018899114],"category_scores_gemma":[0.00044217135,0.000189272,0.00031626195,0.0003030053,0.00016783336,0.00059827947,0.000602454,0.00025631586,0.000060728737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057355204,0.00007751929,0.0000043834616,0.000022074319,0.00010610316,0.0000024116846,0.00020868747,0.00018655299,0.000064488566,0.069618784,0.0059959097,0.9231395],"study_design_scores_gemma":[0.030315172,0.00008781445,0.000023816281,0.00003311776,0.000046105582,0.000019099465,0.00001135561,0.8506009,0.0011250731,0.026956378,0.090472326,0.00030883608],"about_ca_topic_score_codex":0.000095252384,"about_ca_topic_score_gemma":0.0000028786612,"teacher_disagreement_score":0.9228307,"about_ca_system_score_codex":0.000038146427,"about_ca_system_score_gemma":0.000064624895,"threshold_uncertainty_score":0.77182883},"labels":[],"label_agreement":null},{"id":"W1996194173","doi":"10.1007/s00453-007-0186-0","title":"An Algorithmic Approach to the Identification of Rigid Domains in Proteins","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Theory of computation; Domain (mathematical analysis); Complement (music); Computer science; Identification (biology); Algorithm; Function (biology); Simple (philosophy); Mathematics; Mathematical analysis","score_opus":0.005091956371257091,"score_gpt":0.2511147687347519,"score_spread":0.24602281236349482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996194173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47687215,0.00011761007,0.520726,0.000087763314,0.00010131166,0.0008173085,0.000034221808,0.000011766814,0.0012318316],"genre_scores_gemma":[0.96809936,0.000008191134,0.031191943,0.0001394354,0.00025940686,0.00005830775,0.000117397845,0.000017928962,0.00010802946],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988482,0.000049426537,0.000364315,0.0003252092,0.0001641028,0.00024875038],"domain_scores_gemma":[0.99915344,0.0000074942677,0.00010785351,0.00058829,0.000071806746,0.000071141316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006978943,0.00012421688,0.00012044277,0.000080198326,0.00005547153,0.000016626902,0.00039927018,0.00013288582,0.0000018579623],"category_scores_gemma":[0.00004453708,0.000096964555,0.000050374547,0.00025485278,0.000067621186,0.0000058999995,0.00006491657,0.00010413407,0.000004371464],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008576421,0.00019621561,0.0003459406,0.000016686143,0.000026497144,0.000002309071,0.00026700154,0.00047928197,0.9456542,0.0013890653,0.00013496938,0.051402062],"study_design_scores_gemma":[0.0007779735,0.00041684532,0.022967264,0.000011380992,0.00001998175,0.000039385923,0.00036289354,0.006231783,0.95689577,0.001530491,0.010358901,0.00038734984],"about_ca_topic_score_codex":0.00007657807,"about_ca_topic_score_gemma":0.00008861587,"teacher_disagreement_score":0.4912272,"about_ca_system_score_codex":0.000019919982,"about_ca_system_score_gemma":0.000043229884,"threshold_uncertainty_score":0.39540997},"labels":[],"label_agreement":null},{"id":"W1998017993","doi":"10.1007/s00453-002-1009-y","title":"Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Computer science; Theory of computation; Out-of-core algorithm; Parallel computing","score_opus":0.013877336547200188,"score_gpt":0.25720421338987653,"score_spread":0.24332687684267634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998017993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012096257,0.00092986104,0.9911146,0.0002884387,0.00063792476,0.00041328644,0.000010543236,0.0013625026,0.0040331865],"genre_scores_gemma":[0.089079335,0.000021334321,0.90833026,0.0005422472,0.00014588008,0.000049173424,0.000013945917,0.00005165313,0.001766171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960804,0.0004344389,0.00072875497,0.0010656815,0.0007715835,0.00091915345],"domain_scores_gemma":[0.99770164,0.000364528,0.00031872428,0.001024833,0.00024697054,0.00034329895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001137319,0.0004902558,0.0004745583,0.00023088935,0.0005926801,0.0003434651,0.001360808,0.00020864939,0.000052522093],"category_scores_gemma":[0.00023444547,0.00048635103,0.00021326053,0.000794517,0.00012843788,0.00022111007,0.0002973258,0.00050982024,0.00010241427],"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.00002019258,0.0010384702,0.00008490172,0.00004410114,0.00016022785,0.00019364723,0.0018950043,0.4983631,0.0018757207,0.028495722,0.019391472,0.44843742],"study_design_scores_gemma":[0.0009539353,0.00012432413,0.000017847447,0.00004098697,0.000012046531,0.0000776258,0.000040899566,0.98634106,0.0042737476,0.0022651602,0.005229751,0.0006226165],"about_ca_topic_score_codex":0.00005347248,"about_ca_topic_score_gemma":4.917991e-7,"teacher_disagreement_score":0.48797795,"about_ca_system_score_codex":0.00012847601,"about_ca_system_score_gemma":0.00013676357,"threshold_uncertainty_score":0.99975884},"labels":[],"label_agreement":null},{"id":"W1999380033","doi":"10.1007/s00453-001-0112-9","title":"Some Aperture-Angle Optimization Problems","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Regular polygon; Tangent; Upper and lower bounds; Aperture (computer memory); Plane (geometry); Binary logarithm; Computational geometry; Theory of computation; Cone (formal languages); Geometry; Algorithm; Physics; Mathematical analysis","score_opus":0.01788439358824686,"score_gpt":0.2086579147907819,"score_spread":0.19077352120253505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999380033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013934734,0.00074488646,0.99382335,0.002925217,0.00039127024,0.00012608456,0.0000019281679,0.00018005887,0.0016678284],"genre_scores_gemma":[0.1320378,0.00018372608,0.85788554,0.003575745,0.0010879426,0.000061030325,0.00006180403,0.000022140259,0.005084275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916744,0.000031393123,0.00014988061,0.0002665293,0.00021743265,0.00016734074],"domain_scores_gemma":[0.9995057,0.0000689576,0.0000490906,0.00023684949,0.00007348961,0.00006588895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008658044,0.00009231968,0.00008148285,0.00010185025,0.00012566736,0.0001198811,0.00030777673,0.00004709038,0.00010162231],"category_scores_gemma":[0.00003445103,0.00008864652,0.00004041394,0.00041653408,0.0000143875195,0.00065402366,0.00007438124,0.000068535344,0.00024141265],"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.000001462268,0.00029644358,0.000014361973,0.000016602962,0.000036891597,0.000013029505,0.00063201314,0.6013463,0.00087105064,0.0967896,0.021950731,0.2780315],"study_design_scores_gemma":[0.00016604218,0.000042755844,0.000029143777,0.000004270143,0.000002366862,0.000016506096,0.0000016345341,0.9695846,0.00041666106,0.0033451868,0.026271734,0.000119102086],"about_ca_topic_score_codex":0.0000030986687,"about_ca_topic_score_gemma":3.4193465e-7,"teacher_disagreement_score":0.3682383,"about_ca_system_score_codex":0.000026111096,"about_ca_system_score_gemma":0.000012410881,"threshold_uncertainty_score":0.36149004},"labels":[],"label_agreement":null},{"id":"W1999576733","doi":"10.1007/s00453-007-9045-2","title":"Maximum Induced Matchings for Chordal Graphs in Linear Time","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Indifference graph; Split graph; Maximal independent set; Treewidth; Discrete mathematics; Pathwidth; Bipartite graph; Time complexity; Cograph; Line graph; Graph; 1-planar graph","score_opus":0.017835605613190888,"score_gpt":0.3055982628954908,"score_spread":0.28776265728229994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999576733","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12252527,0.000041263087,0.8748266,0.0006450799,0.00030021387,0.0005473312,0.0000063288862,0.00019154669,0.0009163785],"genre_scores_gemma":[0.3129738,0.0000061124106,0.68538046,0.0005472939,0.00019557404,0.0000749817,0.000011578941,0.00005217653,0.0007580553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981343,0.00004884093,0.00029605956,0.0004886855,0.00031816348,0.0007139097],"domain_scores_gemma":[0.9987393,0.0004153989,0.000062463725,0.0005304934,0.00009811141,0.00015422142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013841629,0.0001637388,0.00020358298,0.00043490593,0.000107283275,0.000052264295,0.0010854113,0.0001047718,0.0000136826775],"category_scores_gemma":[0.00010944105,0.00016230407,0.00009482504,0.0009591724,0.000060780247,0.00043198734,0.00025561976,0.00030876513,0.00012473264],"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.00018481504,0.00032724426,0.00034852212,0.000036365203,0.000046279638,0.00015914997,0.0013169303,0.000041650448,0.050476246,0.14893812,0.0006395783,0.7974851],"study_design_scores_gemma":[0.0018975115,0.0004255852,0.0022113847,0.000036062684,0.000004172838,0.000044621545,0.00005162132,0.061213233,0.04902981,0.87797993,0.006509786,0.00059628824],"about_ca_topic_score_codex":0.00002436645,"about_ca_topic_score_gemma":0.000009117981,"teacher_disagreement_score":0.7968888,"about_ca_system_score_codex":0.000058187685,"about_ca_system_score_gemma":0.000051692958,"threshold_uncertainty_score":0.66185683},"labels":[],"label_agreement":null},{"id":"W1999760725","doi":"10.1007/s00453-004-1121-2","title":"Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Minimum spanning tree; Combinatorics; Spanning tree; Mathematics; Degree (music); k-minimum spanning tree; Bounded function; Gomory–Hu tree; Theory of computation; Steiner tree problem; Approximation algorithm; Shortest-path tree; Discrete mathematics; Graph; Node (physics); Kruskal's algorithm; Undirected graph; Connected dominating set; Algorithm; K-ary tree; Tree structure; Binary tree","score_opus":0.04624586313923365,"score_gpt":0.256247606757736,"score_spread":0.21000174361850235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999760725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008489597,0.00006788761,0.98054034,0.006563332,0.00015489092,0.00039561008,0.0000011017838,0.00025456297,0.011173303],"genre_scores_gemma":[0.07884693,0.0000070890205,0.9193835,0.0010201256,0.00011201462,0.0000724894,0.0000040641917,0.000019875746,0.0005338662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983756,0.00008767086,0.00031245608,0.00038897357,0.00038118748,0.0004540901],"domain_scores_gemma":[0.9989854,0.0001251206,0.0001134432,0.0005675566,0.00009853835,0.00010993724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005376485,0.00016186782,0.00015417652,0.000087031665,0.00036797512,0.00044839366,0.0010614485,0.000060636085,0.000016153264],"category_scores_gemma":[0.00006592167,0.0001124409,0.00008102244,0.000545387,0.000099413475,0.00048591016,0.0003195694,0.00024463868,0.00011034617],"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.0000075874323,0.00027165507,0.00012424677,0.000053897045,0.00010313233,0.000043336982,0.010482673,0.007435221,0.0013045009,0.17871095,0.001337834,0.80012494],"study_design_scores_gemma":[0.0021611883,0.00027740208,0.0004613686,0.00013341627,0.00001846505,0.00009988651,0.0003126824,0.8737757,0.0052059256,0.10806475,0.008770165,0.0007190278],"about_ca_topic_score_codex":0.000046614397,"about_ca_topic_score_gemma":0.000012205014,"teacher_disagreement_score":0.8663405,"about_ca_system_score_codex":0.00006341445,"about_ca_system_score_gemma":0.00011956209,"threshold_uncertainty_score":0.4585207},"labels":[],"label_agreement":null},{"id":"W2001915330","doi":"10.1007/s00453-013-9851-7","title":"A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Regret; Theory of computation; Minimax; Computer science; Algorithm; Tree (set theory); Time complexity; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.015799450485926084,"score_gpt":0.221848114930954,"score_spread":0.2060486644450279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001915330","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044427667,0.0003724856,0.7034242,0.06541374,0.01174347,0.01363956,0.00010382416,0.0034967933,0.15737827],"genre_scores_gemma":[0.22661866,0.000047707686,0.55883896,0.07437677,0.059961636,0.0019737307,0.0033454539,0.0006299562,0.07420713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981832,0.00001360177,0.00042467957,0.00047940802,0.00029732706,0.0006017923],"domain_scores_gemma":[0.99914813,0.00006744893,0.000110670524,0.00039672863,0.00023709518,0.000039902025],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038981403,0.00027865559,0.00028272622,0.00017802004,0.00030858052,0.0001952019,0.00036041674,0.00009425226,0.0013434761],"category_scores_gemma":[0.00008417384,0.0002637194,0.00016022482,0.00048086676,0.000052214913,0.00046161647,0.00015476966,0.00013804638,0.0090017505],"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.000009221429,0.000102426384,0.00003501457,0.000058509355,0.00005523412,0.0000019677648,0.000032599844,0.00084374065,0.00001248496,0.001308648,0.29024643,0.70729375],"study_design_scores_gemma":[0.0005231057,0.00003174961,0.00060561294,0.000036498637,0.000032279568,4.1015107e-7,0.00005789165,0.76404065,0.000010760609,0.0016531128,0.23273289,0.00027506263],"about_ca_topic_score_codex":0.0006637775,"about_ca_topic_score_gemma":0.000046930803,"teacher_disagreement_score":0.7631969,"about_ca_system_score_codex":0.000042689182,"about_ca_system_score_gemma":0.000015398193,"threshold_uncertainty_score":0.9999815},"labels":[],"label_agreement":null},{"id":"W2002094114","doi":"10.1007/s00453-015-9983-z","title":"Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Theory of computation; Algorithm; Mathematics; Approximation algorithm; Binary number; Binary tree; Tree (set theory); Combinatorics; Branching (polymer chemistry); Weight-balanced tree; Binary logarithm; Binary search tree; Computer science","score_opus":0.04039927411750235,"score_gpt":0.29000887086651705,"score_spread":0.2496095967490147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002094114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8470994,0.00035441978,0.15168074,0.000111059264,0.000114253584,0.00036141174,0.000024945759,0.000012281566,0.00024147001],"genre_scores_gemma":[0.8908262,0.000006365068,0.10867029,0.00006595791,0.00017818289,0.000029339171,0.00012198644,0.000008679213,0.00009300268],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992218,0.000035785702,0.00021337287,0.00026240828,0.00008674389,0.00017985808],"domain_scores_gemma":[0.9995078,0.00004965931,0.00010626134,0.00014597508,0.00011634735,0.0000739844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031479975,0.00011278854,0.00014187946,0.000024118524,0.00004146813,0.000014669083,0.00010254276,0.00010259873,0.0000014760918],"category_scores_gemma":[0.0002630095,0.000089436195,0.00005668313,0.00004253795,0.00006447069,0.000003799312,0.000109073015,0.000036955105,0.0000011117463],"study_design_candidate":"bench_or_experimental","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.00014024613,0.00016982782,0.005787305,0.00006586812,0.000101655016,0.0000011870375,0.00019140552,0.000115839255,0.18088917,0.00013951755,0.0011139854,0.811284],"study_design_scores_gemma":[0.0048872074,0.0040873326,0.015139792,0.00008141251,0.00009811038,0.000037132395,0.0006934006,0.21177796,0.7355491,0.008796257,0.017953467,0.000898824],"about_ca_topic_score_codex":0.000013625581,"about_ca_topic_score_gemma":0.000009174722,"teacher_disagreement_score":0.81038517,"about_ca_system_score_codex":0.0000075548915,"about_ca_system_score_gemma":0.000019520461,"threshold_uncertainty_score":0.3647102},"labels":[],"label_agreement":null},{"id":"W2008126942","doi":"10.1007/s00453-001-0039-1","title":"On-Line Competitive Algorithms for Call Admission in Optical Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Computer science; Logarithm; Network topology; Competitive analysis; Telecommunications network; Line (geometry); Algorithm; Computer network; Mathematics; Upper and lower bounds","score_opus":0.03568695878688269,"score_gpt":0.311284834257148,"score_spread":0.27559787547026526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008126942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013794527,0.000035724195,0.99144864,0.0034661992,0.00027371643,0.00044820944,0.000003851159,0.00011633476,0.004069372],"genre_scores_gemma":[0.17732555,0.00019821213,0.8151641,0.0035432023,0.00046532592,0.0001988801,0.00007560979,0.000046541692,0.0029825862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984811,0.000063639396,0.00027953056,0.00045028882,0.00025331386,0.00047213503],"domain_scores_gemma":[0.99887717,0.00038700484,0.00004673821,0.00032578444,0.00013187516,0.00023140262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539039,0.00015630934,0.00020180643,0.00014518433,0.00010262358,0.000100354184,0.00053762953,0.00011073882,0.00004174661],"category_scores_gemma":[0.00011436562,0.00013986656,0.00006720279,0.00047597536,0.0000476908,0.0002097879,0.00014598631,0.0002446227,0.00003897584],"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.00009655642,0.00070159265,0.00006439104,0.000011993406,0.000024767485,0.00013329006,0.00032033425,0.17547156,0.000030341736,0.35945448,0.0037331576,0.4599575],"study_design_scores_gemma":[0.0010793452,0.00039056447,0.00011370246,0.000040121045,0.0000018175558,0.000014782059,0.000011640645,0.98334265,0.00010489521,0.0034408674,0.011280809,0.00017881943],"about_ca_topic_score_codex":0.000012151853,"about_ca_topic_score_gemma":0.000007211533,"teacher_disagreement_score":0.8078711,"about_ca_system_score_codex":0.000067944005,"about_ca_system_score_gemma":0.00007151971,"threshold_uncertainty_score":0.5703593},"labels":[],"label_agreement":null},{"id":"W2008451765","doi":"10.1007/s00453-006-1220-3","title":"Parallelizing Feature Selection","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Feature selection; Classifier (UML); Theory of computation; Artificial intelligence; Machine learning; Statistical classification; Linear classifier; Data mining; Algorithm","score_opus":0.005461288633920117,"score_gpt":0.21133145313564952,"score_spread":0.2058701645017294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008451765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009986449,0.00026046854,0.99236774,0.001180019,0.00037043932,0.00008972895,0.0000026082043,0.00037664516,0.004353682],"genre_scores_gemma":[0.112511046,0.0000142687495,0.8823009,0.00038278304,0.0009726766,0.00002154126,0.000044620236,0.000019300074,0.003732875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898946,0.000031346237,0.00012756314,0.0003545639,0.00022654259,0.00027053742],"domain_scores_gemma":[0.99946994,0.000030577852,0.000057585512,0.00033137054,0.000057355246,0.000053151503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009651726,0.00012452474,0.00011058971,0.00006869331,0.00019833508,0.00017099502,0.00050621864,0.000078755394,0.000013995833],"category_scores_gemma":[0.000006279959,0.00010807777,0.000050508716,0.00033503363,0.000017459648,0.00055245473,0.00018747734,0.00015647587,0.00008111611],"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.000008025413,0.00021135938,0.0006287524,0.0000146410075,0.000025062725,0.00006132489,0.00009280373,0.0006061239,0.006572344,0.18195897,0.23963457,0.570186],"study_design_scores_gemma":[0.0005032567,0.00007914811,0.0074399784,0.000025573978,0.000007701435,0.00012794031,0.0000070206966,0.5341353,0.008882313,0.02075573,0.42760193,0.0004341514],"about_ca_topic_score_codex":0.00012869119,"about_ca_topic_score_gemma":0.00000825447,"teacher_disagreement_score":0.56975186,"about_ca_system_score_codex":0.000033332188,"about_ca_system_score_gemma":0.000030246834,"threshold_uncertainty_score":0.44072837},"labels":[],"label_agreement":null},{"id":"W2010369728","doi":"10.1007/s00453-004-1101-6","title":"A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Triangulation; Theory of computation; Polygon (computer graphics); Mathematics; Regular polygon; Minimum-weight triangulation; Convex polygon; Scheme (mathematics); Polygon covering; Delaunay triangulation; Combinatorics; Approximation algorithm; Convex combination; Algorithm; Mathematical optimization; Convex optimization; Computer science; Bowyer–Watson algorithm; Geometry; Mathematical analysis","score_opus":0.01231174919954155,"score_gpt":0.24676557071402974,"score_spread":0.23445382151448818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010369728","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012432724,0.00006701872,0.98525685,0.0013935794,0.00023203985,0.0003686491,0.000011481999,0.0000780708,0.00015958164],"genre_scores_gemma":[0.26828077,0.0000020720267,0.7310416,0.000111144764,0.00024339222,0.0000395153,0.00008969159,0.000008116159,0.00018368236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909055,0.000027651102,0.00028154542,0.00024279075,0.00020977738,0.0001476745],"domain_scores_gemma":[0.9992922,0.000083138475,0.00014279973,0.00021906865,0.00021159799,0.00005118014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028110418,0.000097433745,0.00014908219,0.00015427326,0.00008846142,0.000031590404,0.00022723457,0.000064661595,0.000010813286],"category_scores_gemma":[0.000075141164,0.000098593664,0.00008288579,0.00044191992,0.000023911549,0.00035857875,0.000044929468,0.000046378485,0.000032354506],"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.00012258656,0.0007234294,0.00003395515,0.00014439684,0.0001416422,0.000003836557,0.0013959901,0.026424082,0.13334009,0.3655921,0.0011215856,0.4709563],"study_design_scores_gemma":[0.0015852378,0.00014204484,0.00027515893,0.00002020406,0.000011236174,0.0000095554715,0.000005064685,0.82132447,0.1062016,0.0685033,0.0017656949,0.00015643678],"about_ca_topic_score_codex":0.0000068031663,"about_ca_topic_score_gemma":4.9086304e-7,"teacher_disagreement_score":0.79490036,"about_ca_system_score_codex":0.000042156713,"about_ca_system_score_gemma":0.00012749006,"threshold_uncertainty_score":0.4020533},"labels":[],"label_agreement":null},{"id":"W2010561968","doi":"10.1007/s00453-009-9357-5","title":"Crossing Number and Weighted Crossing Number of Near-Planar Graphs","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Crossing number (knot theory); Combinatorics; Planar graph; Mathematics; Planar; Book embedding; Theory of computation; Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science; Algorithm","score_opus":0.010159103720011614,"score_gpt":0.271349627299671,"score_spread":0.2611905235796594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010561968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64539385,0.00010125811,0.35223904,0.00039972196,0.000216823,0.000075667005,0.0000039849947,0.00007782198,0.0014918415],"genre_scores_gemma":[0.7292034,0.0000023237892,0.27016655,0.00045208263,0.00006741486,0.0000011990437,0.0000061801647,0.000004392556,0.000096447686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989771,0.000039473023,0.00024677202,0.0002968851,0.00023608793,0.0002036718],"domain_scores_gemma":[0.9994102,0.000071793635,0.00010114762,0.00021306175,0.00012132203,0.000082448176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017130074,0.000120210636,0.00015469026,0.000050316266,0.00049693446,0.0007129096,0.00020671065,0.00006155238,0.000025626825],"category_scores_gemma":[0.000015800304,0.00011807872,0.00004947224,0.0005238831,0.00015457792,0.00046188646,0.000041861156,0.00009390765,0.000027342941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002216195,0.00019636945,0.0049113026,0.00002436686,0.000045864974,0.000036924495,0.0023045854,0.00020806576,0.00844357,0.09196893,0.0016145995,0.89022326],"study_design_scores_gemma":[0.0019202093,0.00018250049,0.1317202,0.0001241489,0.000038545855,0.00070199074,0.00003695425,0.55230266,0.029506555,0.25471646,0.027838897,0.00091086555],"about_ca_topic_score_codex":0.000028473138,"about_ca_topic_score_gemma":0.0000010553174,"teacher_disagreement_score":0.8893124,"about_ca_system_score_codex":0.000014600814,"about_ca_system_score_gemma":0.00011064349,"threshold_uncertainty_score":0.68746036},"labels":[],"label_agreement":null},{"id":"W2010596631","doi":"10.1007/s00453-012-9739-y","title":"Switching to Directional Antennas with Constant Increase in Radius and Hop Distance","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; RADIUS; Graph; Constant (computer programming); Unit disk graph; Mathematics; Combinatorics; Theory of computation; Physics; Topology (electrical circuits); Computer science; Telecommunications; Algorithm; Computer network; Wireless","score_opus":0.011620697721961748,"score_gpt":0.23252055098040855,"score_spread":0.2208998532584468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010596631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14362116,0.00072569394,0.8459467,0.0048285886,0.000091415925,0.0003668521,0.0000016846378,0.0001142479,0.0043036314],"genre_scores_gemma":[0.93882984,0.00012207947,0.060153294,0.0007023393,0.000023779108,0.000045992616,0.0000010267657,0.0000054033103,0.00011622221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992498,0.00007077064,0.00013602164,0.00025184362,0.00011436704,0.00017716772],"domain_scores_gemma":[0.99932534,0.00012852396,0.000031910255,0.00031438086,0.00007900474,0.00012081625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014544372,0.00009652916,0.00011656385,0.00008627324,0.00012764393,0.00015437318,0.0003139235,0.000018550307,0.000017102067],"category_scores_gemma":[0.00003428716,0.00007962176,0.000010801693,0.00042588878,0.00003656089,0.00033967747,0.00021292067,0.00012812918,0.000020608099],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029756266,0.00014661533,0.008249238,0.00000994986,0.000030173936,0.000041843352,0.0029714208,0.00006742174,0.0069167074,0.06933225,0.0011867104,0.9110179],"study_design_scores_gemma":[0.0029600295,0.00041237983,0.16324434,0.0006203326,0.000010801098,0.00031499614,0.00032504168,0.7813873,0.0018105893,0.005001921,0.042495273,0.0014169668],"about_ca_topic_score_codex":0.00012030501,"about_ca_topic_score_gemma":0.00020991686,"teacher_disagreement_score":0.909601,"about_ca_system_score_codex":0.00004254682,"about_ca_system_score_gemma":0.000040543924,"threshold_uncertainty_score":0.3246881},"labels":[],"label_agreement":null},{"id":"W2012042319","doi":"10.1007/s00453-001-0109-4","title":"Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Algorithm; Binary logarithm; Parallel computing; Parallel algorithm; Theory of computation; Overhead (engineering); Spanning tree; Computation; Tree (set theory); Combinatorics; Mathematics","score_opus":0.0279442320030997,"score_gpt":0.2374121101943307,"score_spread":0.209467878191231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012042319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002723296,0.0003451262,0.9930269,0.0012279189,0.0015608139,0.0005016419,0.000007742383,0.00023178227,0.00037476336],"genre_scores_gemma":[0.5148204,0.000028598806,0.4826022,0.00085743295,0.00059059047,0.00015775002,0.000005460214,0.000032085667,0.00090551475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983458,0.000063296146,0.00034599076,0.0005753368,0.00021453897,0.0004550435],"domain_scores_gemma":[0.99895835,0.0002209504,0.00010776035,0.00042720264,0.000116326475,0.00016941554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000277893,0.00021839638,0.00027474097,0.0001456076,0.00026131177,0.0002133297,0.00047171803,0.000099808836,0.0000121419225],"category_scores_gemma":[0.000020604088,0.00019410887,0.0001423476,0.00026534757,0.00007072223,0.00010829022,0.00013355273,0.00011825635,0.000032382428],"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.000028418519,0.00057924434,0.000063121624,0.00009434238,0.00028291022,0.00006646606,0.005007192,0.023349172,0.00022466251,0.06858613,0.04745033,0.854268],"study_design_scores_gemma":[0.001049234,0.00016065653,0.00005843106,0.000024156949,0.0000081550015,0.00006884555,0.000041891286,0.98800844,0.000039731403,0.00068386295,0.009599156,0.000257467],"about_ca_topic_score_codex":0.000031886375,"about_ca_topic_score_gemma":0.0000033545637,"teacher_disagreement_score":0.9646592,"about_ca_system_score_codex":0.000032647393,"about_ca_system_score_gemma":0.000008054433,"threshold_uncertainty_score":0.79155296},"labels":[],"label_agreement":null},{"id":"W2016222250","doi":"10.1007/s00453-009-9352-x","title":"Precision, Local Search and Unimodal Functions","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Gray code; Combinatorics; Binary number; Theory of computation; Algorithm; Binary logarithm; Code (set theory); Constant (computer programming); Scaling; Base (topology); Distribution (mathematics); Binary code; Upper and lower bounds; Discrete mathematics; Computer science; Set (abstract data type); Geometry; Mathematical analysis","score_opus":0.010285115518313043,"score_gpt":0.2469077618712889,"score_spread":0.23662264635297586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016222250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039718235,0.00022923342,0.99246466,0.0017155436,0.00021420875,0.00010010602,0.00000861134,0.00015986037,0.0011359231],"genre_scores_gemma":[0.80529135,0.000047272653,0.19288275,0.0006447914,0.00023912908,0.00000579724,0.000019766992,0.000009204329,0.00085993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987989,0.000048101938,0.00015916012,0.00042282365,0.00029473187,0.00027627868],"domain_scores_gemma":[0.99911493,0.00006700794,0.000021108155,0.000541868,0.00007963548,0.0001754627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018770045,0.00012224152,0.00012515772,0.000095760566,0.00024224089,0.00016265918,0.00051383296,0.00006764744,0.000023752033],"category_scores_gemma":[0.000013661813,0.000101692895,0.000032635253,0.00030974566,0.0000645563,0.0005736659,0.00030712484,0.00017991045,0.000092487964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043426126,0.000051810883,0.000015650572,0.0000011735776,0.0000041890085,0.000013113313,0.000083648636,0.00011175159,0.00015218132,0.0077880565,0.0037273343,0.98804677],"study_design_scores_gemma":[0.0005717757,0.0004111518,0.013780042,0.000028261335,0.000007085171,0.00012850105,0.000060962928,0.9284581,0.0010469097,0.011138765,0.044051416,0.00031706333],"about_ca_topic_score_codex":0.000043471107,"about_ca_topic_score_gemma":0.0000015475837,"teacher_disagreement_score":0.98772967,"about_ca_system_score_codex":0.000023484838,"about_ca_system_score_gemma":0.000051528878,"threshold_uncertainty_score":0.41469157},"labels":[],"label_agreement":null},{"id":"W2016898545","doi":"10.1007/s00453-010-9435-8","title":"Subgraphs of 4-Regular Planar Graphs","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planar graph; Combinatorics; Outerplanar graph; Planar straight-line graph; Book embedding; Mathematics; Graph; Line graph; Discrete mathematics; Butterfly graph; Planar; Computer science; Voltage graph; 1-planar graph","score_opus":0.00926994731122339,"score_gpt":0.2584284739058766,"score_spread":0.2491585265946532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016898545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29073927,0.0002565321,0.6994094,0.0011334477,0.0013045641,0.0004881489,0.000029111772,0.00045654585,0.006182957],"genre_scores_gemma":[0.7699878,0.000012497569,0.22966133,0.00007708967,0.000046575507,0.000016161322,0.000003676672,0.000016508058,0.00017831994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985182,0.00006005603,0.00022638349,0.0003825365,0.0004246134,0.00038817796],"domain_scores_gemma":[0.9983479,0.0001680296,0.000083924104,0.0011011268,0.00014485,0.00015417073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004232553,0.0001380073,0.00019373772,0.0003194936,0.00009517619,0.000036082776,0.0015851889,0.000089295325,0.000036719535],"category_scores_gemma":[0.000066575296,0.00012660399,0.00012322032,0.0009217268,0.00030078404,0.00034265217,0.00017500465,0.00036591818,0.00004452488],"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.0000072287085,0.000064353066,0.00042776068,0.000008788694,0.000025081134,0.000020603302,0.00012167754,0.000002183109,0.06825943,0.86305135,0.0003837905,0.06762773],"study_design_scores_gemma":[0.00044993949,0.00014401034,0.0028827228,0.000010116349,0.0000057498696,0.000054631353,0.000021998636,0.0038715152,0.15532455,0.8296596,0.0072936406,0.00028156076],"about_ca_topic_score_codex":0.000020384583,"about_ca_topic_score_gemma":0.000010899502,"teacher_disagreement_score":0.47924858,"about_ca_system_score_codex":0.000005346861,"about_ca_system_score_gemma":0.000043028023,"threshold_uncertainty_score":0.51627606},"labels":[],"label_agreement":null},{"id":"W2017440808","doi":"10.1007/s00453-001-0014-x","title":"A One-Step Crust and Skeleton Extraction Algorithm","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Université Laval","funders":"","keywords":"Voronoi diagram; Skeleton (computer programming); Algorithm; Vertex (graph theory); Computer science; Crust; Topology (electrical circuits); Combinatorics; Mathematics; Geology; Geometry; Theoretical computer science; Graph; Geophysics","score_opus":0.015919686652957406,"score_gpt":0.25864024643772116,"score_spread":0.24272055978476376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017440808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008277969,0.00025895156,0.9877921,0.001342098,0.0004110251,0.00012376983,0.0000019990152,0.00014747166,0.0016446488],"genre_scores_gemma":[0.15241908,0.0001994368,0.84449714,0.0006781601,0.00071649876,0.000028050046,0.000024617322,0.000014031066,0.0014229828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893963,0.00004396546,0.0001816102,0.0003669022,0.00025861466,0.00020925423],"domain_scores_gemma":[0.9994122,0.00008332985,0.0000653859,0.00023475058,0.00009537812,0.00010897834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017754296,0.00011275744,0.00011498044,0.00014742652,0.00017425409,0.00015959489,0.00020864335,0.0000648767,0.000028829996],"category_scores_gemma":[0.00002134471,0.00012599929,0.00003694196,0.00046072507,0.000026762034,0.00060460053,0.000098645076,0.00011717696,0.00007038559],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021686237,0.000056204673,0.000019180778,0.0000026027774,0.000010953996,0.000012053157,0.00005674234,0.00007349928,0.00060783065,0.0051482716,0.00045818128,0.9935523],"study_design_scores_gemma":[0.0005306557,0.00014214577,0.007109091,0.000014574632,0.00001279158,0.000278943,0.000020127996,0.882218,0.002514835,0.006888985,0.09996653,0.00030332603],"about_ca_topic_score_codex":0.00003941803,"about_ca_topic_score_gemma":0.0000050040194,"teacher_disagreement_score":0.993249,"about_ca_system_score_codex":0.00003538219,"about_ca_system_score_gemma":0.000042686443,"threshold_uncertainty_score":0.51381016},"labels":[],"label_agreement":null},{"id":"W2017441966","doi":"10.1007/s00453-014-9884-6","title":"A Comparison of Performance Measures for Online Algorithms","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Irvine; University of Waterloo; Danmarks Frie Forskningsfond; National Science Foundation","keywords":"Bijection; Competitive analysis; Context (archaeology); Computer science; Theory of computation; Algorithm; Adaptability; Order (exchange); Greedy algorithm; Simple (philosophy); Online algorithm; Mathematics; Combinatorics; Upper and lower bounds","score_opus":0.05276604616838215,"score_gpt":0.3370390444198044,"score_spread":0.28427299825142227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017441966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009737045,0.000056392844,0.9972244,0.00061500125,0.0001838312,0.00022540624,0.000008249275,0.00009238639,0.00062063494],"genre_scores_gemma":[0.34341562,0.000012986615,0.6561015,0.00014130874,0.000084531006,0.000021623811,0.000014728203,0.000008941292,0.00019872616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988958,0.000049025926,0.00029512166,0.0002411345,0.00027988214,0.00023898705],"domain_scores_gemma":[0.99905795,0.00013039394,0.00010403635,0.00036338356,0.00026134597,0.00008290768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003797023,0.000100665704,0.0002255171,0.000092754046,0.00009062838,0.00004077666,0.000634015,0.000050230068,0.0000068281006],"category_scores_gemma":[0.00008118704,0.00008984338,0.000061921746,0.00024406421,0.000050544204,0.00021563447,0.00010128389,0.000088407745,0.000009934011],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004126695,0.00017805344,0.00021416099,0.00003320219,0.0000143253155,7.5419536e-8,0.00029086394,0.0024647103,0.00023762387,0.009867284,0.00066520955,0.98603034],"study_design_scores_gemma":[0.00042184396,0.00030027013,0.00023822821,0.0000158529,0.0000036689607,0.0000014110606,0.000011197877,0.9309875,0.0062700696,0.00058503647,0.061057188,0.00010777366],"about_ca_topic_score_codex":0.000006073912,"about_ca_topic_score_gemma":0.0000025992424,"teacher_disagreement_score":0.9859226,"about_ca_system_score_codex":0.000013891918,"about_ca_system_score_gemma":0.000044960525,"threshold_uncertainty_score":0.36637068},"labels":[],"label_agreement":null},{"id":"W2020796742","doi":"10.1007/s00453-011-9611-5","title":"Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; École de Technologie Supérieure; Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Asynchronous communication; Robot; Ring (chemistry); Theory of computation; Computer science; Prime (order theory); Combinatorics; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Topology (electrical circuits); Artificial intelligence; Computer network","score_opus":0.03405175304668747,"score_gpt":0.2886569309033074,"score_spread":0.25460517785661996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020796742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001573603,0.00042858353,0.9922288,0.00097262044,0.00024998037,0.00021575882,0.0000013145825,0.00037968953,0.0039496534],"genre_scores_gemma":[0.6475386,0.00003217605,0.35187942,0.00030860258,0.000092144866,0.0000119044,0.000017496443,0.000015251107,0.00010441697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846816,0.00018782297,0.00028479556,0.0002495317,0.00029499622,0.0005146741],"domain_scores_gemma":[0.9987724,0.00011946138,0.00013510323,0.00067041133,0.000097209224,0.00020545395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059992,0.00015172703,0.0001673873,0.00008273955,0.0003644186,0.00023984467,0.00089171546,0.000066173445,0.000014463409],"category_scores_gemma":[0.0000490021,0.00015310464,0.000041909992,0.00035283284,0.000051144354,0.0014138272,0.00050658174,0.00024140748,0.00014214295],"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.0000066061766,0.00097106193,0.005912788,0.000056344077,0.00010694204,0.0000044980247,0.019258428,0.020522285,0.0035295591,0.04641407,0.008331243,0.8948862],"study_design_scores_gemma":[0.0003845353,0.000055678178,0.00025389684,0.000030248477,0.0000044823505,0.000017744262,0.0000999264,0.992591,0.0018469072,0.00035144782,0.00408585,0.00027827173],"about_ca_topic_score_codex":0.000047995574,"about_ca_topic_score_gemma":0.000002203424,"teacher_disagreement_score":0.9720687,"about_ca_system_score_codex":0.000072621246,"about_ca_system_score_gemma":0.00003919824,"threshold_uncertainty_score":0.6243426},"labels":[],"label_agreement":null},{"id":"W2023293538","doi":"10.1007/s00453-005-1185-7","title":"Book Embeddability of Series–Parallel Digraphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Embedding; Series (stratigraphy); Transitive relation; Discrete mathematics; Monotonic function; Set (abstract data type); Point (geometry); Computer science; Geometry","score_opus":0.00755424390658528,"score_gpt":0.2535625659565984,"score_spread":0.2460083220500131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023293538","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058619007,0.002283656,0.97796607,0.0011882703,0.00020327352,0.00037278072,0.000015348354,0.00028245937,0.011826267],"genre_scores_gemma":[0.3730502,0.000105418134,0.61398476,0.00063857815,0.00022764044,0.0001059933,0.00001722677,0.000047776794,0.011822425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984357,0.00010384537,0.00029621247,0.00040841335,0.00037525172,0.00038058133],"domain_scores_gemma":[0.9986114,0.00013403736,0.0000870198,0.0009418038,0.00014676395,0.00007897409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030475,0.00013801843,0.00021043375,0.0001320697,0.00009067848,0.000036796537,0.0010241749,0.00005914696,0.000071812465],"category_scores_gemma":[0.00003580218,0.00012814357,0.00011734541,0.0006030662,0.00030221595,0.0007118609,0.00029421994,0.00015590808,0.00004146626],"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.00007336194,0.0004724071,0.0015139184,0.000062774554,0.000042437972,0.000036768328,0.00025019707,0.0005875562,0.004936353,0.9182676,0.019277316,0.054479297],"study_design_scores_gemma":[0.0007600249,0.00030925192,0.006754642,0.000019427895,0.0000072078383,0.000048745413,0.000024160036,0.012439121,0.03859063,0.8329144,0.10766017,0.0004721929],"about_ca_topic_score_codex":0.000050732204,"about_ca_topic_score_gemma":0.0000064999344,"teacher_disagreement_score":0.3671883,"about_ca_system_score_codex":0.000026834097,"about_ca_system_score_gemma":0.00005948621,"threshold_uncertainty_score":0.52255434},"labels":[],"label_agreement":null},{"id":"W2023419712","doi":"10.1007/s00453-001-0006-x","title":"Right-Triangulated Irregular Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Terrain; Triangulated irregular network; Computer science; Observer (physics); Field (mathematics); Data structure; Point (geometry); Surface (topology); Visualization; Theory of computation; Space (punctuation); Algorithm; Mathematics; Artificial intelligence; Geometry; Cartography; Geography","score_opus":0.009402726006114312,"score_gpt":0.25087274359621603,"score_spread":0.24147001759010173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023419712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011162974,0.00020436144,0.99588776,0.00041520759,0.0003722445,0.00012984677,4.9866514e-7,0.0008498195,0.001023959],"genre_scores_gemma":[0.8803967,0.00022210318,0.11639972,0.0015050089,0.0005469792,0.000031632644,0.00002356663,0.000034583823,0.00083969673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988892,0.000053230466,0.00022148923,0.00035701698,0.00019782432,0.00028122024],"domain_scores_gemma":[0.9990848,0.000038460617,0.000069533584,0.00059570157,0.00010632281,0.000105240484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018891014,0.00013900071,0.00014498054,0.00016510316,0.00013793295,0.00019278731,0.0008209142,0.00009196621,0.00004399099],"category_scores_gemma":[0.0000063045472,0.0001296522,0.0000826592,0.0009741895,0.00003221883,0.00027817275,0.00023476,0.00011278083,0.00002292514],"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.0000029074029,0.00009989141,0.00027696963,0.0000025217944,0.00003416363,0.00010774381,0.00008252682,0.0000766422,0.000045422574,0.80273825,0.008375235,0.18815772],"study_design_scores_gemma":[0.00018748784,0.0000528257,0.0007927804,0.000010984294,0.0000037423915,0.000047627145,0.0000010064635,0.89457583,0.000987216,0.020980418,0.08215854,0.00020151793],"about_ca_topic_score_codex":0.000021724245,"about_ca_topic_score_gemma":0.0000020509394,"teacher_disagreement_score":0.8944992,"about_ca_system_score_codex":0.000018692517,"about_ca_system_score_gemma":0.000021662187,"threshold_uncertainty_score":0.5287063},"labels":[],"label_agreement":null},{"id":"W2023624817","doi":"10.1007/s00453-010-9469-y","title":"Approximability of the Firefighter Problem","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Kempe Foundation","keywords":"Theory of computation; Computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.008076166490145996,"score_gpt":0.19126323639783926,"score_spread":0.18318706990769326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023624817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.825973,0.000015238443,0.001043469,0.011010263,0.0023119098,0.00091156154,0.0000067406204,0.00016861613,0.15855925],"genre_scores_gemma":[0.9964449,4.915368e-7,0.0011645278,0.0007676254,0.00028925948,0.000027601483,0.0000063277394,0.000008212311,0.0012910689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992327,0.000005713447,0.00022668843,0.00018399763,0.00020436171,0.00014651236],"domain_scores_gemma":[0.9993439,0.000007670633,0.00006107093,0.000465191,0.00011592156,0.000006271562],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028238984,0.000091707814,0.00009609436,0.000043835895,0.000101403886,0.00003704388,0.00035724288,0.000041365132,0.0011334241],"category_scores_gemma":[0.000059433733,0.000060963765,0.00008483621,0.0003079381,0.00009838123,0.00026194917,0.00020374489,0.00014053698,0.0002746689],"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.000053196458,0.0014860143,0.044383902,0.0015169032,0.00015066616,0.0000014890496,0.00036430816,0.00022625092,0.0104078725,0.55081075,0.087870486,0.30272818],"study_design_scores_gemma":[0.0004349246,0.0000056668073,0.08328273,0.000015498294,0.00005077669,5.5831293e-7,0.00007579062,0.022244392,0.0017163199,0.020148706,0.871751,0.00027362662],"about_ca_topic_score_codex":0.0006386493,"about_ca_topic_score_gemma":0.00027113408,"teacher_disagreement_score":0.78388053,"about_ca_system_score_codex":0.0000060591447,"about_ca_system_score_gemma":0.0000105986755,"threshold_uncertainty_score":0.9997797},"labels":[],"label_agreement":null},{"id":"W2023800056","doi":"10.1007/s00453-011-9544-z","title":"Shorthand Universal Cycles for Permutations","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Victoria","funders":"","keywords":"Combinatorics; Substring; Mathematics; Lexicographical order; Permutation (music); Parity of a permutation; Discrete mathematics; Symmetric group; Set (abstract data type); Cyclic permutation; Computer science; Physics","score_opus":0.04240240890345279,"score_gpt":0.25064698037265226,"score_spread":0.20824457146919947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023800056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018653405,0.000053577023,0.99450296,0.00013641795,0.00030581668,0.0001634299,0.000038398688,0.00014957294,0.0027845108],"genre_scores_gemma":[0.2688384,0.000011891594,0.73031634,0.00014659256,0.00014712328,0.000036366306,0.000039232153,0.000014300225,0.00044973232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992329,0.00001682802,0.00012346663,0.00029375023,0.00011848097,0.00021459615],"domain_scores_gemma":[0.9993453,0.00005759951,0.000043061784,0.00038509624,0.00007766714,0.00009126571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007858857,0.00009908142,0.00009848002,0.00007074731,0.0001887953,0.000055229673,0.00060928974,0.000045726458,0.00003692563],"category_scores_gemma":[0.0000131327915,0.00008871965,0.000059324586,0.00014208336,0.00003982614,0.00055776484,0.00018393237,0.000057326622,0.000035439793],"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.000023646438,0.00026664266,0.00025725728,0.000015645044,0.000066830034,0.000042288022,0.0034260196,0.00001799669,0.0005447181,0.39533302,0.009546082,0.5904599],"study_design_scores_gemma":[0.0019873453,0.000596815,0.011917924,0.000052295673,0.000060755126,0.00008659436,0.000487371,0.7543445,0.015951937,0.11942361,0.09404319,0.0010476147],"about_ca_topic_score_codex":0.00005498476,"about_ca_topic_score_gemma":0.0000046273553,"teacher_disagreement_score":0.7543265,"about_ca_system_score_codex":0.00001667017,"about_ca_system_score_gemma":0.000048417256,"threshold_uncertainty_score":0.36178824},"labels":[],"label_agreement":null},{"id":"W2024283988","doi":"10.1007/s00453-013-9764-5","title":"Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Rectilinear polygon; Planar graph; Mathematics; Combinatorics; Point in polygon; Planar; Rectangle; Star-shaped polygon; Polygon mesh; Representation (politics); Time complexity; Algorithm; Graph; Regular polygon; Simple polygon; Geometry; Computer science; Convex set","score_opus":0.020965985535776083,"score_gpt":0.2780481533725133,"score_spread":0.2570821678367372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024283988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042119557,0.00006575585,0.98827785,0.004794353,0.00050322677,0.0009779293,0.000051228035,0.0002546491,0.00086303824],"genre_scores_gemma":[0.03130924,0.000008730685,0.9616539,0.00070441,0.0010328451,0.00065294764,0.00035863376,0.000026337664,0.00425294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982566,0.000059183327,0.00040600047,0.0005589737,0.000399535,0.0003197048],"domain_scores_gemma":[0.99813724,0.0002989974,0.0001506021,0.0006234333,0.00063518697,0.00015453587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002845524,0.00018001787,0.00019139326,0.00021148656,0.0003019585,0.00019983413,0.00069066056,0.00008477021,0.000145111],"category_scores_gemma":[0.00024213638,0.00017413222,0.00015743918,0.0006385191,0.000041973908,0.0008329893,0.00017453774,0.00012747484,0.00031534958],"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.00004193315,0.0008792798,0.00020454574,0.000055317338,0.00033949452,0.000018308478,0.000518797,0.010440025,0.018468464,0.0961769,0.22356594,0.649291],"study_design_scores_gemma":[0.0010283772,0.00023216507,0.0030139475,0.0000109945895,0.00001682219,0.00003536417,0.000019826984,0.9258035,0.008845075,0.049530435,0.011137455,0.0003260811],"about_ca_topic_score_codex":0.00007069371,"about_ca_topic_score_gemma":0.000002482928,"teacher_disagreement_score":0.91536343,"about_ca_system_score_codex":0.000040194347,"about_ca_system_score_gemma":0.00015742422,"threshold_uncertainty_score":0.7100906},"labels":[],"label_agreement":null},{"id":"W2024435407","doi":"10.1007/s00453-008-9181-3","title":"Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Fleischer; Theory of computation; Computer science; Routing (electronic design automation); Mathematical economics; Operations research; Mathematical optimization; A priori and a posteriori; Telecommunications network; Function (biology); Mathematics; Computer network; Algorithm","score_opus":0.013119900043998258,"score_gpt":0.20825905682960347,"score_spread":0.1951391567856052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024435407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35993055,0.000018482075,0.6393929,0.000022490487,0.00011078584,0.00019769576,0.00002256596,0.00013655369,0.00016794121],"genre_scores_gemma":[0.9749652,0.000010056461,0.024813192,0.000025661555,0.00004929639,0.00004111331,0.00005113831,0.000019674157,0.000024678142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994819,0.0000037846075,0.00020116038,0.000093903895,0.00007238859,0.00014682871],"domain_scores_gemma":[0.99961644,0.00009138849,0.000028884755,0.00012794802,0.000097174496,0.00003814815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046922145,0.00008811406,0.00013508048,0.000052308784,0.0000650329,0.0000036375216,0.000064083135,0.00004911768,0.000009699006],"category_scores_gemma":[0.0000102059885,0.0000834817,0.000034648176,0.0002052466,0.000048569425,0.00006858774,0.0000026230884,0.00008316867,0.0000010302354],"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.000054495136,0.0002003498,0.014422643,0.00023371486,0.00029988235,0.0000073665638,0.0023486032,0.96811175,0.000975283,0.0013140854,0.0027417017,0.009290122],"study_design_scores_gemma":[0.0015010219,0.00011027534,0.10714929,0.000044416585,0.00007699405,0.000013063761,0.00012006926,0.88456887,0.0032185304,0.000043135005,0.002880742,0.00027362083],"about_ca_topic_score_codex":0.000007747953,"about_ca_topic_score_gemma":0.000032149954,"teacher_disagreement_score":0.61503464,"about_ca_system_score_codex":0.000020012123,"about_ca_system_score_gemma":0.000017887169,"threshold_uncertainty_score":0.34042847},"labels":[],"label_agreement":null},{"id":"W2024656522","doi":"10.1007/s00453-012-9624-8","title":"3-Colouring AT-Free Graphs in Polynomial Time","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Pathwidth; Interval graph; Combinatorics; Time complexity; Mathematics; Maximal independent set; Cograph; Theory of computation; Discrete mathematics; Split graph; Strong perfect graph theorem; Modular decomposition; Graph; Computer science; 1-planar graph; Line graph; Algorithm","score_opus":0.012299008694531984,"score_gpt":0.2583412557159052,"score_spread":0.24604224702137323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024656522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8985843,0.0014492972,0.06996425,0.0029076089,0.0015127711,0.00094625354,0.000022291542,0.0007829289,0.02383026],"genre_scores_gemma":[0.8914749,0.000013373657,0.105477065,0.00024272886,0.00026499224,0.000055671688,0.0000034447426,0.00003364381,0.0024341652],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982507,0.000117856354,0.00019628368,0.00031572423,0.00031464937,0.00080477033],"domain_scores_gemma":[0.99857956,0.00019262577,0.000046676607,0.00094278425,0.000028335575,0.0002100166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059545843,0.00014071514,0.0001672814,0.00029509753,0.00011930512,0.000040562107,0.0015816716,0.000071733106,0.00007774696],"category_scores_gemma":[0.00009915613,0.00014019675,0.00006995753,0.0006903363,0.000092221286,0.00073966506,0.0013215396,0.00023221326,0.0006715742],"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.00028212243,0.0014746753,0.04080679,0.00006450917,0.00017571397,0.0003609098,0.006698969,0.00019477667,0.06728963,0.33473626,0.038823273,0.5090924],"study_design_scores_gemma":[0.011100218,0.000817987,0.15161176,0.00016554282,0.000031017244,0.00067244144,0.00013414396,0.0985379,0.19586441,0.44109094,0.09592097,0.0040526567],"about_ca_topic_score_codex":0.000019861105,"about_ca_topic_score_gemma":0.0000059755807,"teacher_disagreement_score":0.50503975,"about_ca_system_score_codex":0.00013090772,"about_ca_system_score_gemma":0.000029683657,"threshold_uncertainty_score":0.8631952},"labels":[],"label_agreement":null},{"id":"W2025130628","doi":"10.1007/s00453-001-0027-5","title":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Shortest path problem; Combinatorics; Dijkstra's algorithm; Mathematics; Regular polygon; Bounded function; Theory of computation; Context (archaeology); Domain (mathematical analysis); Euclidean shortest path; Computational geometry; Face (sociological concept); Discrete mathematics; K shortest path routing; Graph; Algorithm; Geometry","score_opus":0.014708090250501082,"score_gpt":0.2418008765560288,"score_spread":0.22709278630552773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025130628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21372634,0.00009866416,0.7788544,0.0014118508,0.0005336082,0.00014599491,0.0000030410479,0.00025813875,0.004967917],"genre_scores_gemma":[0.8422137,0.000009084931,0.15648094,0.0004811617,0.00026867806,0.000011090276,0.000021477941,0.000008156997,0.00050571235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883956,0.00004978744,0.00021842174,0.0003431015,0.00030700743,0.00024212484],"domain_scores_gemma":[0.99936056,0.00013181343,0.000070513255,0.0002784132,0.00007424351,0.00008447018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020200876,0.00012859586,0.000119421835,0.000119000935,0.00018407677,0.00014717034,0.00038058346,0.000046863115,0.000030475238],"category_scores_gemma":[0.00003032604,0.00011879749,0.00004851003,0.00059011637,0.00001928392,0.00032721277,0.00008878561,0.00010948769,0.00013999367],"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.000010502103,0.00024488432,0.00056976813,0.0000056736567,0.000031269046,0.00006696973,0.00041472533,0.0049466924,0.0023649146,0.06359894,0.0014739041,0.92627174],"study_design_scores_gemma":[0.0002325364,0.00012895721,0.0030956678,0.00001344324,0.0000037198201,0.00005196036,0.000014689636,0.9795106,0.0044143233,0.006335245,0.0059858677,0.00021299157],"about_ca_topic_score_codex":0.000013759418,"about_ca_topic_score_gemma":0.0000021771184,"teacher_disagreement_score":0.9745639,"about_ca_system_score_codex":0.00003046344,"about_ca_system_score_gemma":0.000044863016,"threshold_uncertainty_score":0.4844421},"labels":[],"label_agreement":null},{"id":"W2028676775","doi":"10.1007/s00453-010-9393-1","title":"Algorithms for Marketing-Mix Optimization","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Homothetic transformation; Mathematical optimization; Product (mathematics); Theory of computation; Quality (philosophy); Set (abstract data type); Constant (computer programming); Mathematics; Order (exchange); Upper and lower bounds; Profit (economics); Computer science; Combinatorics; Algorithm; Economics; Microeconomics","score_opus":0.009867990062831065,"score_gpt":0.22807056870951145,"score_spread":0.21820257864668038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028676775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058585475,0.000045536864,0.9871949,0.00019187164,0.0019516587,0.00034110976,0.000036433437,0.0007199445,0.0089327125],"genre_scores_gemma":[0.038223155,0.000051012772,0.95943934,0.00012850789,0.0006342196,0.0001153519,0.00017328929,0.00010942977,0.001125702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992779,0.00001279812,0.0001927481,0.00016967939,0.000099057084,0.00024784295],"domain_scores_gemma":[0.99948394,0.00011382986,0.000028818542,0.00020258775,0.00008668365,0.000084118765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027438314,0.00014050749,0.0001228642,0.00008150469,0.00008874183,0.000066404755,0.00013854828,0.00013020278,0.00035473748],"category_scores_gemma":[0.00008285382,0.00014889329,0.000058979793,0.00016172367,0.000026557034,0.0001159523,0.0000148408935,0.00017688228,0.000033911238],"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.000011743034,0.00003158166,0.000045710356,0.000078421144,0.00004739029,0.0000012751271,0.00011890694,0.8733893,0.0014800943,0.00063221017,0.0122140525,0.111949295],"study_design_scores_gemma":[0.00035154034,0.00001392017,0.000044426397,0.000008626445,0.000011356451,0.0000068298973,0.000007995117,0.94299865,0.0015531941,0.00011751257,0.054690793,0.00019514009],"about_ca_topic_score_codex":0.0000021336205,"about_ca_topic_score_gemma":0.0000031229872,"teacher_disagreement_score":0.11175416,"about_ca_system_score_codex":0.0000140656075,"about_ca_system_score_gemma":0.000013503222,"threshold_uncertainty_score":0.6071692},"labels":[],"label_agreement":null},{"id":"W2037328176","doi":"10.1007/s00453-001-0017-7","title":"On Rooted Node-Connectivity Problems","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Node (physics); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Physics","score_opus":0.020230128070829564,"score_gpt":0.2773567718637909,"score_spread":0.2571266437929613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037328176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04360359,0.000054792406,0.94343966,0.0016651776,0.000230228,0.0002840093,0.0000026737855,0.00040899558,0.010310851],"genre_scores_gemma":[0.9611113,0.000016570952,0.03700405,0.00049453764,0.000093097085,0.000056179186,0.000002680479,0.000023602594,0.0011979562],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983023,0.00012739774,0.00014871969,0.00053287897,0.00039205828,0.0004966497],"domain_scores_gemma":[0.9985057,0.00034376126,0.000048733542,0.00086713035,0.00009174286,0.0001429013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038018962,0.0001544051,0.00015632254,0.00017284777,0.00017483611,0.00009030497,0.001005496,0.000064562,0.000050910578],"category_scores_gemma":[0.00014359159,0.00013987781,0.000068866626,0.0008661941,0.00007679983,0.00041693225,0.00025138023,0.0002924262,0.00046533215],"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.000045262575,0.00041726662,0.00044069267,0.000011665456,0.00004311909,0.00018955738,0.00030109193,0.001500645,0.002685381,0.47587928,0.0011656841,0.51732033],"study_design_scores_gemma":[0.0010784044,0.00046813264,0.0031408402,0.000044013592,0.000003952008,0.00012146693,0.000011264876,0.18185712,0.008096508,0.7877423,0.016879803,0.00055617973],"about_ca_topic_score_codex":0.000021403368,"about_ca_topic_score_gemma":0.0000070829296,"teacher_disagreement_score":0.9175077,"about_ca_system_score_codex":0.00006134771,"about_ca_system_score_gemma":0.000040377578,"threshold_uncertainty_score":0.59810585},"labels":[],"label_agreement":null},{"id":"W2039582686","doi":"10.1007/s004530010019","title":"Linear-Time Algorithms for Partial \\boldmath k -Tree Complements","year":2000,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Time complexity; Combinatorics; Complement (music); Discrete mathematics; Algorithm; Graph; Vertex (graph theory); Theory of computation","score_opus":0.03424946569837089,"score_gpt":0.32753183504768374,"score_spread":0.29328236934931284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039582686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003547445,0.00008649629,0.98993677,0.0012042117,0.00026155793,0.00090883265,0.00009579717,0.000469273,0.0034896352],"genre_scores_gemma":[0.018213725,0.000030229121,0.9688437,0.0007058817,0.0007709526,0.00035085191,0.000086520915,0.00007398185,0.010924135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740356,0.000109179025,0.00037458213,0.0007149137,0.00051914155,0.0008785975],"domain_scores_gemma":[0.99833053,0.00028466788,0.00006901863,0.00091673847,0.00014333514,0.00025573347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051707187,0.00025287655,0.0003012091,0.0001285796,0.00032266075,0.00012406494,0.0016052463,0.00008187683,0.00063980685],"category_scores_gemma":[0.00004272908,0.00024354794,0.00016695117,0.000518753,0.00013219267,0.000550454,0.0002448832,0.00019606546,0.0012720098],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046168367,0.0001731476,0.00001581501,0.000009974664,0.00005666868,0.000020936122,0.00015953227,0.000118246884,0.0007384688,0.015097801,0.0031845956,0.9803786],"study_design_scores_gemma":[0.0017433283,0.00043027062,0.00013541595,0.000017584029,0.000012379802,0.00003059072,0.000009642985,0.7399095,0.009585808,0.05010469,0.19752961,0.000491126],"about_ca_topic_score_codex":0.0000114949535,"about_ca_topic_score_gemma":0.000001528795,"teacher_disagreement_score":0.97988755,"about_ca_system_score_codex":0.00005214662,"about_ca_system_score_gemma":0.00007613057,"threshold_uncertainty_score":0.99950564},"labels":[],"label_agreement":null},{"id":"W2039786295","doi":"10.1007/s00453-007-9018-5","title":"Stackelberg Strategies for Selfish Routing in General Multicommodity Networks","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Price of anarchy; Stackelberg competition; Routing (electronic design automation); Computer science; Latency (audio); Nash equilibrium; Theory of computation; Mathematical optimization; Upper and lower bounds; Price of stability; Mathematical economics; Mathematics; Topology (electrical circuits); Computer network; Combinatorics; Economics; Telecommunications","score_opus":0.08005567828149378,"score_gpt":0.40284479965577813,"score_spread":0.32278912137428434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039786295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38578,0.000018591743,0.6106628,0.00027326905,0.00018427572,0.00028600002,0.000017464068,0.000044636978,0.0027329596],"genre_scores_gemma":[0.9745542,0.000001569192,0.024329226,0.00021587488,0.00035359527,0.00003387131,0.000011807682,0.00001160055,0.0004883026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981402,0.00009078534,0.00059893256,0.00039680378,0.00033147674,0.00044177764],"domain_scores_gemma":[0.9969862,0.0021672049,0.0001498351,0.0004394648,0.00015580536,0.000101493715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004271779,0.00012740606,0.00021999452,0.00012626857,0.00019166587,0.00020747993,0.0005714403,0.00010102004,0.00006645022],"category_scores_gemma":[0.00039647598,0.00010765079,0.000092164264,0.000564194,0.00009386661,0.00027676934,0.00008747644,0.0001783925,0.00004480532],"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.0001283478,0.00034661163,0.0050213817,0.0000045501856,0.000026982005,0.000012854455,0.0017749821,0.015696377,0.00091321906,0.46165195,0.0058260853,0.50859666],"study_design_scores_gemma":[0.0010961688,0.00006837284,0.032285146,0.000011958412,0.00001299175,0.000008369254,0.0040588486,0.5316511,0.0011723413,0.4099798,0.01925885,0.000396057],"about_ca_topic_score_codex":0.00006494393,"about_ca_topic_score_gemma":0.0003362823,"teacher_disagreement_score":0.58877414,"about_ca_system_score_codex":0.00003944079,"about_ca_system_score_gemma":0.00004982338,"threshold_uncertainty_score":0.43898717},"labels":[],"label_agreement":null},{"id":"W2040008390","doi":"10.1007/s00453-014-9907-3","title":"On Minimum Sum of Radii and Diameters Clustering","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Approximation algorithm; Mathematics; Polynomial-time approximation scheme; Singleton; Cluster (spacecraft); Theory of computation; Euclidean geometry; Constant (computer programming); Plane (geometry); Time complexity; Cluster analysis; Discrete mathematics; Polynomial; Euclidean distance; Algorithm; Mathematical analysis; Computer science; Geometry","score_opus":0.01338867621675582,"score_gpt":0.2085252258903227,"score_spread":0.1951365496735669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040008390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89803135,0.000058427544,0.038230497,0.0044171847,0.0014248479,0.00043538562,0.000003893197,0.00017636851,0.057222046],"genre_scores_gemma":[0.9975626,0.0000059098197,0.0005765436,0.0012730578,0.00017266681,0.000007246536,0.000008548303,0.000010138469,0.0003832783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935883,0.000007192924,0.00017997573,0.00018226702,0.00013315608,0.00013858252],"domain_scores_gemma":[0.9996962,0.000026467425,0.000044964963,0.00018687322,0.00003529188,0.000010194731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000216767,0.00009544295,0.00012429219,0.00013542858,0.000055643715,0.00003857516,0.000109391214,0.000025391875,0.00015013649],"category_scores_gemma":[0.00008001908,0.00009055309,0.000035071804,0.00013993953,0.00004225413,0.00018644963,0.000097108,0.00004196388,0.00013638119],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016266662,0.00048333447,0.0026684115,0.0017383734,0.0001997273,0.000005999825,0.00037235412,0.0034226626,0.0018582366,0.1539962,0.04654424,0.7885478],"study_design_scores_gemma":[0.0014170335,0.00008286063,0.018764414,0.00009410793,0.00008187769,6.269378e-7,0.0002649961,0.75609547,0.00032433114,0.0055300943,0.2168214,0.000522782],"about_ca_topic_score_codex":0.0003272434,"about_ca_topic_score_gemma":0.000055662596,"teacher_disagreement_score":0.788025,"about_ca_system_score_codex":0.0000073054343,"about_ca_system_score_gemma":0.0000019268102,"threshold_uncertainty_score":0.36926478},"labels":[],"label_agreement":null},{"id":"W2040074412","doi":"10.1007/s00453-005-1148-z","title":"Three-Dimensional Orthogonal Graph Drawing with Optimal Volume","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Embedding; Combinatorics; Mathematics; Bounded function; Grid; Graph drawing; Graph; Upper and lower bounds; Theory of computation; Discrete mathematics; Computer science; Geometry; Algorithm","score_opus":0.008670530162049123,"score_gpt":0.2169461656829679,"score_spread":0.20827563552091877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040074412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08479751,0.00011391946,0.912343,0.0020512296,0.00017629589,0.00009327371,0.0000031849513,0.00013481492,0.00028674517],"genre_scores_gemma":[0.39012262,7.3424064e-7,0.60863996,0.00051042926,0.00041022827,0.000011414946,0.000020721374,0.000008485126,0.00027539456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987192,0.000020677033,0.00018025351,0.00038770738,0.00043237882,0.00025974415],"domain_scores_gemma":[0.9993839,0.00005381453,0.000060654187,0.0002493735,0.00014078476,0.00011144643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016931289,0.00014156666,0.00011780336,0.0001432313,0.00021839415,0.00011725556,0.00033798572,0.000045110635,0.00007376382],"category_scores_gemma":[0.000008444101,0.00012386637,0.000057891888,0.00051061076,0.00004377511,0.0005862114,0.00011944398,0.00013044014,0.00015892606],"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.000033926568,0.00022810818,0.0006851255,0.000006269757,0.00008986255,0.00005564345,0.00019360476,0.28847787,0.0007370527,0.042473793,0.0071008387,0.6599179],"study_design_scores_gemma":[0.00044541742,0.0001376932,0.0064869723,0.000011320324,0.000008573669,0.0001571172,0.0000024008061,0.975039,0.0012572147,0.0016764288,0.014520527,0.00025732315],"about_ca_topic_score_codex":0.000008682889,"about_ca_topic_score_gemma":0.000021731974,"teacher_disagreement_score":0.68656117,"about_ca_system_score_codex":0.000030360841,"about_ca_system_score_gemma":0.00013408349,"threshold_uncertainty_score":0.50511235},"labels":[],"label_agreement":null},{"id":"W2041021940","doi":"10.1007/s00453-003-1048-z","title":"Testing the Quality of Manufactured Disks and Balls","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computation; Theory of computation; Object (grammar); Algorithm; Ball (mathematics); Computer science; Mathematics; Quality (philosophy); Boundary (topology); Combinatorics; Geometry; Mathematical analysis; Physics; Artificial intelligence","score_opus":0.04788007247890287,"score_gpt":0.29217789794346827,"score_spread":0.2442978254645654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041021940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16134626,0.00020117663,0.83537257,0.00054908876,0.00018472034,0.00010613023,0.0000023253383,0.000030861018,0.0022068596],"genre_scores_gemma":[0.88859946,0.0000016160589,0.11118587,0.00012518934,0.000025265112,0.0000027465212,0.0000010355158,0.0000016323876,0.000057195233],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993943,0.000098953504,0.00014564725,0.00013805927,0.00014177365,0.00008126628],"domain_scores_gemma":[0.99929535,0.0003759559,0.000067697154,0.0001724784,0.00006155878,0.0000269342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041440933,0.000050847564,0.000069713205,0.000024455514,0.000087267625,0.000037949125,0.00015759801,0.00001846953,0.0000041866247],"category_scores_gemma":[0.00020486531,0.000035620196,0.0000183034,0.00020701758,0.000030135776,0.00009925473,0.00004634906,0.000047321882,0.000002364955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031267896,0.000076799966,0.0011244852,0.000024621262,0.000033283657,0.0000020488378,0.0010184125,0.0010571461,0.01621348,0.33373407,0.00035704277,0.64635545],"study_design_scores_gemma":[0.0010799775,0.0001969007,0.45581958,0.000028297967,0.000021533973,0.00008572883,0.000103176324,0.15843037,0.15793861,0.20873266,0.017022114,0.00054104876],"about_ca_topic_score_codex":0.000016804772,"about_ca_topic_score_gemma":0.0000013763004,"teacher_disagreement_score":0.7272532,"about_ca_system_score_codex":0.0000053521844,"about_ca_system_score_gemma":0.000029147695,"threshold_uncertainty_score":0.14525495},"labels":[],"label_agreement":null},{"id":"W2042685720","doi":"10.1007/s00453-010-9422-0","title":"Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Computer science; Node (physics); Broadcasting (networking); Computer network; Schedule; Theory of computation; Set (abstract data type); Binary logarithm; Radio networks; Discrete mathematics; Mathematics; Algorithm; Telecommunications; Wireless network; Wireless","score_opus":0.011458445599158578,"score_gpt":0.209008588747466,"score_spread":0.19755014314830743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042685720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047195167,0.00022231757,0.9902206,0.0018386719,0.0015023957,0.0003271627,0.0000024099274,0.0001354572,0.0010314488],"genre_scores_gemma":[0.9024716,0.000044451546,0.09264495,0.002308807,0.0018153214,0.00026276577,0.000004967318,0.00004705883,0.00040006635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998509,0.000056412024,0.00021460348,0.00052401185,0.00020938418,0.0004865758],"domain_scores_gemma":[0.9981793,0.00069871667,0.00009170201,0.0008262109,0.00006758411,0.0001364886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049879774,0.00019646714,0.00017550385,0.000050735594,0.0003855688,0.000239698,0.0009051743,0.00012607333,0.000014897404],"category_scores_gemma":[0.000044978064,0.00014364514,0.000080534104,0.00026717514,0.00011348432,0.00009920576,0.00027390828,0.0003781534,0.000006988782],"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.000009232739,0.000057413752,0.000020272519,0.0000037264406,0.000032144228,0.000007758599,0.00015076615,0.08538629,0.0001537518,0.32661268,0.009653824,0.57791215],"study_design_scores_gemma":[0.00025128436,0.000075258875,0.00022446016,0.000015245776,0.00000758974,0.000030592248,0.0000060241327,0.9707367,0.00027087596,0.0008224339,0.027372928,0.000186635],"about_ca_topic_score_codex":0.000022623703,"about_ca_topic_score_gemma":0.000015110179,"teacher_disagreement_score":0.8977521,"about_ca_system_score_codex":0.000021877582,"about_ca_system_score_gemma":0.000029059293,"threshold_uncertainty_score":0.58576787},"labels":[],"label_agreement":null},{"id":"W2043985142","doi":"10.1007/s00453-009-9349-5","title":"Approximability of Packing Disjoint Cycles","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Theory of computation; Combinatorics; Packing problems; Set packing; Computer science; Mathematics; Algorithm; Set (abstract data type)","score_opus":0.007440738904930359,"score_gpt":0.20749748112562644,"score_spread":0.20005674222069608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043985142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20354167,0.00093683955,0.67192525,0.0009977447,0.0009933563,0.0007182821,0.000051959618,0.0020197004,0.118815206],"genre_scores_gemma":[0.97592354,0.00002124676,0.02392649,0.000033699813,0.000040518156,0.0000020815671,0.000008101168,0.000010625093,0.000033689714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994958,0.000010836332,0.00017909483,0.00009519693,0.000087826775,0.00013124598],"domain_scores_gemma":[0.9997155,0.000020428703,0.000022969234,0.00017469928,0.000027371538,0.000039028517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008621725,0.00008239915,0.0001262439,0.000040344126,0.000021075224,0.000012346723,0.00007968315,0.000044596793,0.000051406063],"category_scores_gemma":[0.000015176375,0.00007985308,0.000045042052,0.00013002846,0.000023443961,0.00006456019,0.000007890922,0.0000752228,0.000010970894],"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.000012585545,0.00023666992,0.0013736539,0.00021264252,0.00007626222,0.000004716247,0.0017007216,0.19738688,0.009022572,0.01035995,0.0019018088,0.7777115],"study_design_scores_gemma":[0.0008545967,0.00014979689,0.019961199,0.00012202049,0.000033731638,0.000012799072,0.00011424035,0.8807839,0.07436653,0.016447982,0.0065010274,0.00065215066],"about_ca_topic_score_codex":0.00000320876,"about_ca_topic_score_gemma":4.9661463e-7,"teacher_disagreement_score":0.7770594,"about_ca_system_score_codex":0.00001773414,"about_ca_system_score_gemma":0.0000054440497,"threshold_uncertainty_score":0.3256314},"labels":[],"label_agreement":null},{"id":"W2049238020","doi":"10.1007/s00453-007-9081-y","title":"On the Stability of Dynamic Diffusion Load Balancing","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Bounded function; Load balancing (electrical power); Multiplicative function; Theory of computation; Upper and lower bounds; Constant (computer programming); Node (physics); Simple (philosophy); Graph; Discrete mathematics; Mathematics; Topology (electrical circuits); Distributed computing; Theoretical computer science; Combinatorics; Algorithm","score_opus":0.0077173919710029175,"score_gpt":0.2280957933888661,"score_spread":0.2203784014178632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049238020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32521775,0.000057276393,0.670995,0.00045777464,0.00033812606,0.00020213629,0.0000014701003,0.000073931726,0.0026565643],"genre_scores_gemma":[0.98916686,0.0000049833443,0.010478685,0.00025797405,0.00004117093,0.0000052019072,7.3345694e-7,0.000006920574,0.000037495305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986608,0.00006509304,0.00025733688,0.0003017192,0.00042030384,0.0002947279],"domain_scores_gemma":[0.9980404,0.00078471506,0.000105105624,0.0009217813,0.000087422006,0.00006060496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012088382,0.000109819906,0.00013640028,0.000030145502,0.00009227158,0.00002611165,0.00081683183,0.000058388378,0.000043866687],"category_scores_gemma":[0.000097395096,0.00007431406,0.00006380565,0.000336909,0.000072909716,0.000094554525,0.00026010585,0.00019963484,0.000031186955],"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.00003542154,0.00035339603,0.00072391867,0.000023866882,0.000031013355,0.000028376744,0.0014419201,0.00009480352,0.013120794,0.097899266,0.0010238249,0.8852234],"study_design_scores_gemma":[0.00052710826,0.00029765346,0.03114075,0.000086382664,0.000009400574,0.000015129397,0.00009953216,0.9199953,0.024508303,0.021667482,0.0013066399,0.00034630112],"about_ca_topic_score_codex":0.000047083853,"about_ca_topic_score_gemma":0.000044306373,"teacher_disagreement_score":0.91990054,"about_ca_system_score_codex":0.0001328566,"about_ca_system_score_gemma":0.000053276563,"threshold_uncertainty_score":0.30304396},"labels":[],"label_agreement":null},{"id":"W2050872937","doi":"10.1007/s00453-013-9745-8","title":"Practical and Efficient Circle Graph Recognition","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Circle graph; Lexicographical order; Combinatorics; Mathematics; Algorithm; Theory of computation; Computer science; Graph; Pathwidth; Discrete mathematics; Inverse; Line graph","score_opus":0.02781378277119005,"score_gpt":0.2996522708988027,"score_spread":0.27183848812761263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050872937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052860864,0.000059205704,0.94094735,0.0039696842,0.00014019581,0.00032237667,0.000002076971,0.00016345042,0.0015348224],"genre_scores_gemma":[0.5495178,0.000024001376,0.44981787,0.00033112057,0.0000651441,0.00009180858,0.0000032056291,0.000013670034,0.0001353819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988842,0.000093483424,0.00012285067,0.0003504238,0.0002436865,0.0003053777],"domain_scores_gemma":[0.99909216,0.00025222247,0.00003594613,0.00033782312,0.00012347134,0.00015838514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023172992,0.00008295905,0.000090935566,0.000119484444,0.00012291876,0.00016360605,0.00024548123,0.000044826964,0.000053309195],"category_scores_gemma":[0.00012134592,0.00008142792,0.00003039565,0.00036778135,0.00012248954,0.00050531793,0.00021941909,0.00017389217,0.00055291393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040696436,0.000111753616,0.000028095503,0.000008719798,0.000014955469,0.000020854106,0.00018070506,0.000007779839,0.001769025,0.02921938,0.0010347633,0.96759987],"study_design_scores_gemma":[0.0008420591,0.00030729247,0.0064366097,0.00003078645,0.00000923815,0.00024549893,0.0001470575,0.17784262,0.013737019,0.7983711,0.0015018973,0.0005288343],"about_ca_topic_score_codex":0.00003712891,"about_ca_topic_score_gemma":0.0000010245506,"teacher_disagreement_score":0.96707106,"about_ca_system_score_codex":0.000015116835,"about_ca_system_score_gemma":0.00003120014,"threshold_uncertainty_score":0.71067744},"labels":[],"label_agreement":null},{"id":"W2051064851","doi":"10.1007/s00453-007-9146-y","title":"Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Victoria; University of Waterloo","funders":"","keywords":"Algorithm; Theory of computation; Packing problems; Time complexity; Matching (statistics); Mathematics; Exponent; Dynamic programming; Set (abstract data type); Approximation algorithm; Combinatorics; Computer science; Mathematical optimization","score_opus":0.019633130731243408,"score_gpt":0.24728522079454746,"score_spread":0.22765209006330406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051064851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017990049,0.0003670433,0.9768158,0.00010258369,0.0005994524,0.0005214321,0.00002498152,0.00044419357,0.0031344665],"genre_scores_gemma":[0.6277224,0.00008687621,0.3700938,0.00029569978,0.00042141485,0.00007221799,0.00006532247,0.00016129045,0.0010810138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988176,0.000009621864,0.00031603614,0.00024558685,0.00013091577,0.0004801936],"domain_scores_gemma":[0.99939305,0.00022081089,0.000043949858,0.00016765208,0.000050793173,0.00012377695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062642,0.00020940868,0.00021017535,0.00012515181,0.000118519776,0.0001328652,0.00010336239,0.00013202339,0.000040480798],"category_scores_gemma":[0.000019288442,0.00020840949,0.000059395712,0.00015222254,0.000031348987,0.00025661875,0.000025650917,0.00017848134,0.000015897273],"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.000038208535,0.00012647152,0.0007380048,0.00091265474,0.00033194583,0.000019251138,0.006285457,0.09888449,0.010923521,0.0017610003,0.0030854193,0.8768936],"study_design_scores_gemma":[0.0024975603,0.00019590455,0.0008603611,0.00027466752,0.000096470234,0.00012139651,0.00045878833,0.85734373,0.019623546,0.008130377,0.10897589,0.0014213134],"about_ca_topic_score_codex":0.000012837567,"about_ca_topic_score_gemma":0.000011139773,"teacher_disagreement_score":0.87547225,"about_ca_system_score_codex":0.000035578327,"about_ca_system_score_gemma":0.000007652138,"threshold_uncertainty_score":0.84986925},"labels":[],"label_agreement":null},{"id":"W2051671786","doi":"10.1007/s00453-012-9664-0","title":"A Uniform Paradigm to Succinctly Encode Various Families of Trees","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"ENCODE; Computer science; Theory of computation; Combinatorics; Weight-balanced tree; Theoretical computer science; Mathematics; Set (abstract data type); Encoding (memory); Tree (set theory); Node (physics); Discrete mathematics; Algorithm; Binary tree; Artificial intelligence; Binary search tree","score_opus":0.012633158404860765,"score_gpt":0.24547229230012121,"score_spread":0.23283913389526045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051671786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020581128,0.00031445688,0.9745464,0.00066441216,0.0006986069,0.00022671514,0.000038043887,0.0001727292,0.0027575577],"genre_scores_gemma":[0.66534936,0.00003329524,0.33373308,0.0004025417,0.00023899962,0.00002169835,0.0000114456125,0.000015297961,0.00019428994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847615,0.00004183144,0.00031490563,0.00030769606,0.00035584834,0.00050356786],"domain_scores_gemma":[0.9985918,0.00011314621,0.00010258253,0.0008594177,0.000054097443,0.0002789855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024933476,0.00018807295,0.00026944964,0.00017112521,0.000109918576,0.000056389108,0.0010654496,0.00007427423,0.000023712293],"category_scores_gemma":[0.000029278652,0.00015458507,0.00007561668,0.0004856727,0.000042790445,0.0008377074,0.00060862215,0.000115588504,0.00012981627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028823795,0.00067607296,0.0038547774,0.00003676081,0.000087227454,0.000022672391,0.0058194855,0.00015154271,0.0028865084,0.12709856,0.012272523,0.84706503],"study_design_scores_gemma":[0.0021229135,0.0012596174,0.096348606,0.00023291628,0.00008138841,0.0002038856,0.00048688118,0.19029118,0.059483714,0.018115483,0.629258,0.0021154638],"about_ca_topic_score_codex":0.00042764333,"about_ca_topic_score_gemma":0.00003330113,"teacher_disagreement_score":0.8449496,"about_ca_system_score_codex":0.00003818246,"about_ca_system_score_gemma":0.00005776579,"threshold_uncertainty_score":0.6303796},"labels":[],"label_agreement":null},{"id":"W2054084041","doi":"10.1007/s00453-001-0047-1","title":"Exact Largest and Smallest Size of Components","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Combinatorics; Permutation (music); Mathematics; Theory of computation; Component (thermodynamics); Golomb coding; Discrete mathematics; Physics; Algorithm; Computer science","score_opus":0.012833348501846852,"score_gpt":0.2197760636205042,"score_spread":0.20694271511865733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054084041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385163,0.00044001333,0.15251733,0.0008256139,0.00031097783,0.000117958676,0.0000051005754,0.00014029532,0.0071264333],"genre_scores_gemma":[0.97985995,0.00008948516,0.01977522,0.000155136,0.0000381306,0.0000024427973,0.0000010619224,0.0000043074233,0.00007424774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993442,0.000041948497,0.0001311666,0.00019847494,0.00012442173,0.00015978512],"domain_scores_gemma":[0.9993599,0.00018491919,0.000051860876,0.00030014108,0.00003466187,0.00006849121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018801227,0.00008311434,0.000120508914,0.000055706794,0.00006693562,0.00003378134,0.00036969717,0.000033715296,0.000038721573],"category_scores_gemma":[0.000025539879,0.00007796516,0.00004575229,0.00024883752,0.000066349785,0.00010936143,0.00016446866,0.00006647425,0.000009515456],"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.00007725896,0.00062707893,0.041567717,0.00012766004,0.00015499441,0.00016907274,0.001316981,0.0000061912183,0.016937505,0.53633726,0.00090692815,0.40177137],"study_design_scores_gemma":[0.004443003,0.0011398933,0.60554594,0.00048646086,0.00006518745,0.0006700072,0.00015482356,0.030384513,0.01860544,0.24658148,0.09028665,0.0016366018],"about_ca_topic_score_codex":0.00002219987,"about_ca_topic_score_gemma":0.0000014898096,"teacher_disagreement_score":0.5639782,"about_ca_system_score_codex":0.000004302227,"about_ca_system_score_gemma":0.000009418965,"threshold_uncertainty_score":0.3179327},"labels":[],"label_agreement":null},{"id":"W2054150222","doi":"10.1007/s00453-003-1062-1","title":"Small Strictly Convex Quadrilateral Meshes of Point Sets","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Quadrilateral; Combinatorics; Mathematics; Regular polygon; Polygon mesh; Convex set; Point (geometry); Theory of computation; Convex optimization; Geometry; Algorithm; Finite element method; Physics","score_opus":0.022503004539002266,"score_gpt":0.2326208544231259,"score_spread":0.21011784988412363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054150222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09117449,0.00017505982,0.9038474,0.00040076533,0.00056399615,0.00013085417,0.0000050817684,0.000071524075,0.003630815],"genre_scores_gemma":[0.8060963,0.0000066581465,0.19333772,0.0002672094,0.0000391343,0.000005407394,0.0000079267365,0.0000050771832,0.00023456532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908876,0.0000792474,0.00023646174,0.00023853898,0.00018826518,0.00016873087],"domain_scores_gemma":[0.9993694,0.0000959583,0.000087299624,0.00025062214,0.00012820667,0.00006854919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022418707,0.00009947445,0.00014115256,0.00011282577,0.00005780158,0.00004615011,0.0002735682,0.0000440717,0.00003903743],"category_scores_gemma":[0.00004843922,0.000095199364,0.000060015704,0.00039770117,0.000024155688,0.00019748905,0.000053919073,0.00006684143,0.000031827345],"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.000014989289,0.0004291857,0.0007657524,0.000056466502,0.0001460023,0.000045623492,0.0017581396,0.0051543377,0.01128228,0.7057048,0.004192429,0.27044997],"study_design_scores_gemma":[0.0023944352,0.00073988346,0.014253757,0.00005450829,0.00004308412,0.00024695788,0.000111361325,0.45314533,0.35678077,0.12698957,0.04414775,0.0010926021],"about_ca_topic_score_codex":0.000014833189,"about_ca_topic_score_gemma":0.0000020748714,"teacher_disagreement_score":0.71492183,"about_ca_system_score_codex":0.000018949684,"about_ca_system_score_gemma":0.00009211955,"threshold_uncertainty_score":0.38821176},"labels":[],"label_agreement":null},{"id":"W2056651359","doi":"10.1007/s00453-004-1126-x","title":"Optimal Two-Description Scalar Quantizer Design","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Directed acyclic graph; Theory of computation; Quantization (signal processing); Alphabet; Algorithm; Discrete mathematics; Cardinality (data modeling); Signal compression; Directed graph; Combinatorics; Mathematical optimization; Signal processing; Computer science","score_opus":0.029327999474310803,"score_gpt":0.2823486751181255,"score_spread":0.2530206756438147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056651359","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081913476,0.000103396036,0.9967042,0.0006194557,0.00026042457,0.00023784848,0.000004193655,0.0010029819,0.00024835693],"genre_scores_gemma":[0.09222561,0.000016385166,0.90725183,0.00029303724,0.00008106483,0.000037283957,0.0000062667323,0.000016450733,0.00007204859],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984987,0.00007319764,0.00024498053,0.0005116653,0.00032292237,0.00034855452],"domain_scores_gemma":[0.9987736,0.000054465683,0.000090530564,0.0008747367,0.00008456442,0.00012211654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025360516,0.00017980805,0.00017160508,0.00012613196,0.00014770193,0.00015547707,0.0011517223,0.00006848576,0.000017101665],"category_scores_gemma":[0.000041308078,0.00016650477,0.00006025315,0.00035188187,0.0000647987,0.001373714,0.00042298398,0.00019094122,0.00021192024],"study_design_candidate":"bench_or_experimental","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.000050455594,0.0005869237,0.000021396738,0.000019477877,0.00005567637,0.00028941905,0.000603723,0.033531055,0.1247459,0.32563505,0.01236999,0.50209093],"study_design_scores_gemma":[0.0016850093,0.00036623474,0.00020977914,0.00011450232,0.000013109216,0.0001814603,0.000020091327,0.16290578,0.6589972,0.1624317,0.01227507,0.0008000712],"about_ca_topic_score_codex":0.000030227133,"about_ca_topic_score_gemma":4.799289e-7,"teacher_disagreement_score":0.5342513,"about_ca_system_score_codex":0.00009176896,"about_ca_system_score_gemma":0.0000706409,"threshold_uncertainty_score":0.6789867},"labels":[],"label_agreement":null},{"id":"W2058122117","doi":"10.1007/s00453-014-9939-8","title":"Convergecast and Broadcast by Power-Aware Mobile Agents","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"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":"Computer science; Theory of computation; Atomic broadcast; Approximation algorithm; Distributed computing; Set (abstract data type); Computer network; Distributed algorithm; Mobile agent; Broadcasting (networking); Algorithm","score_opus":0.005753744172305512,"score_gpt":0.22708732742875873,"score_spread":0.22133358325645322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058122117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003089504,0.00013523684,0.99137187,0.0008510299,0.00028296604,0.00023382918,0.000012641149,0.00018186914,0.0038410798],"genre_scores_gemma":[0.94811964,0.00011760968,0.046073098,0.0020314064,0.00006612021,0.000052038333,0.000027077904,0.000024957366,0.003488036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990273,0.000067296176,0.00013744061,0.00031770737,0.00020214824,0.00024808166],"domain_scores_gemma":[0.99936223,0.000047871996,0.00004058604,0.00031375274,0.000064339285,0.0001711954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017410738,0.00010531274,0.00011443744,0.00004941713,0.00013037641,0.00015836982,0.00038427024,0.000049452326,0.00013435917],"category_scores_gemma":[0.000015219022,0.00009896473,0.000025007632,0.00017042783,0.000055946326,0.000278091,0.00022057397,0.00009443343,0.00014971105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006099138,0.00026574777,0.0005594557,0.000036920308,0.000051689658,0.0000143587085,0.0019138652,0.00033500296,0.00079258095,0.014187834,0.15474783,0.8270886],"study_design_scores_gemma":[0.0005479741,0.00020874376,0.00016991001,0.000009920014,0.000002212984,0.000016829617,0.000029723065,0.6781065,0.00074043294,0.0004739527,0.3194803,0.00021353466],"about_ca_topic_score_codex":0.000017433307,"about_ca_topic_score_gemma":4.5847074e-7,"teacher_disagreement_score":0.94529873,"about_ca_system_score_codex":0.00001333951,"about_ca_system_score_gemma":0.000018156446,"threshold_uncertainty_score":0.40356648},"labels":[],"label_agreement":null},{"id":"W2058404798","doi":"10.1007/s00453-012-9675-x","title":"Emergency Connectivity in Ad-hoc Networks with Selfish Nodes","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Nash equilibrium; Node (physics); Wireless ad hoc network; Computer network; Protocol (science); Theory of computation; Distributed computing; Wireless; Mathematical economics; Mathematics; Algorithm; Telecommunications","score_opus":0.009540126623217722,"score_gpt":0.22669043386852836,"score_spread":0.21715030724531065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058404798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061058454,0.003582664,0.93043834,0.0003415693,0.001251992,0.00036341464,0.000001705433,0.00031468595,0.0026471731],"genre_scores_gemma":[0.9472721,0.00027247448,0.051620625,0.00018707952,0.00039676044,0.00008487366,0.000003440977,0.000027717464,0.00013490595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799234,0.00014430935,0.00028107187,0.00046223347,0.00027726137,0.0008427651],"domain_scores_gemma":[0.99870306,0.00014155335,0.00010980713,0.00075974537,0.00006469765,0.0002211304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005232778,0.000234714,0.00026479684,0.000084680796,0.00009961961,0.000054456457,0.0007671125,0.00012651851,0.00008089421],"category_scores_gemma":[0.000019979343,0.00020728329,0.000056469264,0.0008616088,0.000047770292,0.00094747735,0.00028364477,0.00035995408,0.00006181878],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005471886,0.00097209326,0.096758194,0.000029222123,0.000120895675,0.00009355454,0.0020615878,0.007881222,0.000057027133,0.019492246,0.011266218,0.861213],"study_design_scores_gemma":[0.0013048766,0.00028460263,0.1329798,0.00007437114,0.000024316703,0.00011974193,0.00006792622,0.83611715,0.00029109576,0.0015857902,0.026027763,0.0011225695],"about_ca_topic_score_codex":0.000032451273,"about_ca_topic_score_gemma":0.000121254016,"teacher_disagreement_score":0.88621366,"about_ca_system_score_codex":0.00007991711,"about_ca_system_score_gemma":0.00004434858,"threshold_uncertainty_score":0.8452767},"labels":[],"label_agreement":null},{"id":"W2060429191","doi":"10.1007/s00453-008-9192-0","title":"Random Matrices and Codes for the Erasure Channel","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; List decoding; Mathematics; Erasure; Overhead (engineering); Discrete mathematics; Algorithm; Computer science; Block code; Concatenated error correction code","score_opus":0.0217023613800945,"score_gpt":0.2532438025626427,"score_spread":0.23154144118254816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060429191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037781617,0.0016128675,0.9910177,0.0021931801,0.00030761756,0.0003948963,0.0000037401223,0.00045770974,0.00023415509],"genre_scores_gemma":[0.70980424,0.0004499683,0.28846475,0.00049038266,0.0002339636,0.00016389404,0.0000011572048,0.00001737302,0.00037427855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992404,0.000034984787,0.0001258835,0.0002541821,0.0001437601,0.00020080125],"domain_scores_gemma":[0.99868655,0.00078651495,0.00006225721,0.00034427544,0.00008045018,0.000039952934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035361736,0.000107160464,0.00013738514,0.000051519768,0.00038228088,0.000064491134,0.00059266423,0.000047361616,0.0000011890103],"category_scores_gemma":[0.00009693545,0.00007248582,0.000052858446,0.00018614873,0.00007566795,0.00017943863,0.00014554312,0.00009936292,0.000004095322],"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.0001552331,0.00021569549,0.0010834215,0.000114124705,0.0002644483,0.00008321503,0.013833513,0.0001049273,0.0019521952,0.01251701,0.100587636,0.8690886],"study_design_scores_gemma":[0.002812081,0.00046326336,0.0032699113,0.00006883797,0.000060437098,0.0009259043,0.00017321545,0.9071824,0.0267435,0.019169321,0.03832727,0.0008038564],"about_ca_topic_score_codex":0.000057992445,"about_ca_topic_score_gemma":0.000007249826,"teacher_disagreement_score":0.9070775,"about_ca_system_score_codex":0.000011330876,"about_ca_system_score_gemma":0.000028607388,"threshold_uncertainty_score":0.29558858},"labels":[],"label_agreement":null},{"id":"W2060547410","doi":"10.1007/bf02679619","title":"Smallest components in decomposable structures: Exp-log class","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Class (philosophy); Theory of computation; Combinatorial analysis; Component (thermodynamics); Limit (mathematics); Discrete mathematics; Combinatorial method; Computer science; Algorithm","score_opus":0.06984406374816576,"score_gpt":0.31987964855271883,"score_spread":0.25003558480455307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060547410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95400774,0.000139722,0.026770664,0.0004349549,0.0014801593,0.00088566187,0.000014549254,0.0003498956,0.015916664],"genre_scores_gemma":[0.85264313,0.000026737838,0.14629997,0.00010141314,0.00022924677,0.000048368103,0.00001361884,0.000075136,0.0005623448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998053,0.000078859135,0.00057841727,0.000373009,0.00037012168,0.00054658647],"domain_scores_gemma":[0.9983451,0.00061251083,0.0001900489,0.0006379746,0.00007769111,0.00013668275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023653038,0.00029368608,0.00048246596,0.00015633515,0.00009924694,0.00004313235,0.00050405494,0.00016766574,0.00018774522],"category_scores_gemma":[0.00032932233,0.0002848647,0.00008633095,0.00037250458,0.000075878466,0.00013633253,0.00017462025,0.00033418217,0.00009822618],"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.00012122311,0.0011395587,0.0024158673,0.00020519581,0.00013711145,0.00046945206,0.0013558408,0.00016507793,0.0030753505,0.9770944,0.004339485,0.009481422],"study_design_scores_gemma":[0.0013612473,0.00005777308,0.00039919713,0.00007395207,0.000021502663,0.00008025033,0.00014636717,0.003164082,0.0012579621,0.98862976,0.0044615096,0.00034641576],"about_ca_topic_score_codex":0.000032085263,"about_ca_topic_score_gemma":0.000044190645,"teacher_disagreement_score":0.119529314,"about_ca_system_score_codex":0.0001806902,"about_ca_system_score_gemma":0.000039378243,"threshold_uncertainty_score":0.99996036},"labels":[],"label_agreement":null},{"id":"W2061257005","doi":"10.1007/s00453-014-9908-2","title":"Routing Regardless of Network Stability","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Network packet; Computer science; Computer network; Routing protocol; Routing table; Theory of computation; Routing (electronic design automation); Equal-cost multi-path routing; Source routing; Combinatorics; Mathematics; Algorithm","score_opus":0.011345311787612337,"score_gpt":0.21588224654259291,"score_spread":0.20453693475498058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061257005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009379618,0.00006373854,0.9820499,0.0002244547,0.0005418851,0.00014289387,8.13364e-7,0.00014907612,0.0074476507],"genre_scores_gemma":[0.87589186,0.0000027355393,0.123509996,0.0001429623,0.0003878106,0.000010123806,0.000001351591,0.000009671322,0.000043478845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844044,0.00017634103,0.00033698734,0.00039555505,0.0002591399,0.00039150778],"domain_scores_gemma":[0.9982456,0.00034499416,0.00016483302,0.0010494771,0.00010234199,0.00009274455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000989715,0.00012514646,0.0002496686,0.00002186373,0.00008415155,0.000044842287,0.00096433563,0.00007515492,0.000022749844],"category_scores_gemma":[0.00008206323,0.00011934171,0.000079468955,0.00038442374,0.00007118064,0.00019286702,0.0003998848,0.00016493078,0.000023649618],"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.000007456545,0.00009697519,0.0032987793,0.000030020728,0.000036009194,0.0000039225383,0.00043094464,0.003485907,0.00020598093,0.28380036,0.0029084636,0.70569515],"study_design_scores_gemma":[0.00029937536,0.00010300335,0.0032086791,0.00004396939,0.000007937497,0.0000073987244,0.000010344503,0.96727675,0.0033530765,0.017808385,0.0076410975,0.0002400067],"about_ca_topic_score_codex":0.00003368101,"about_ca_topic_score_gemma":0.00000881983,"teacher_disagreement_score":0.96379083,"about_ca_system_score_codex":0.000028679564,"about_ca_system_score_gemma":0.000036999274,"threshold_uncertainty_score":0.48666137},"labels":[],"label_agreement":null},{"id":"W2062310236","doi":"10.1007/s00453-014-9911-7","title":"Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Rounding; Mathematics; Facility location problem; Theory of computation; Linear programming; Randomized rounding; Function (biology); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Computer science","score_opus":0.02614157390848688,"score_gpt":0.2256202621160007,"score_spread":0.19947868820751383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062310236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038468998,0.00006794251,0.9876026,0.00521404,0.00041685003,0.0018133132,0.00001005011,0.00022836294,0.00079996896],"genre_scores_gemma":[0.983399,0.000010596276,0.010488606,0.0017255722,0.0012560743,0.0011374102,0.0004676053,0.000037748916,0.0014774079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986106,0.000017315213,0.0003472838,0.00040957754,0.000298811,0.0003163801],"domain_scores_gemma":[0.99878275,0.000047516376,0.00013006985,0.00049422105,0.0005292417,0.000016170468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009398893,0.00022171116,0.00018092855,0.00010557776,0.00044431107,0.00019411641,0.0003263177,0.000059283284,0.00008288821],"category_scores_gemma":[0.00016639658,0.00014967215,0.00007325769,0.00043898736,0.00009713492,0.000689121,0.00008241274,0.00010911541,0.00017484123],"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.00025587436,0.00058888976,0.0005926845,0.00281699,0.00037714856,3.9422252e-7,0.0006610183,0.06456147,0.0005405213,0.037161037,0.0088871,0.8835569],"study_design_scores_gemma":[0.00058869715,0.000034376266,0.0009916361,0.000015305579,0.0000742269,3.6306608e-7,0.00024309676,0.8646002,0.00011452817,0.0010303606,0.13209143,0.00021578248],"about_ca_topic_score_codex":0.0009037711,"about_ca_topic_score_gemma":0.00028514364,"teacher_disagreement_score":0.9795521,"about_ca_system_score_codex":0.00003681906,"about_ca_system_score_gemma":0.000022317377,"threshold_uncertainty_score":0.6103453},"labels":[],"label_agreement":null},{"id":"W2062659098","doi":"10.1007/s00453-010-9442-9","title":"Complexity of Finding Graph Roots with Girth Conditions","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics; Graph; Theory of computation; Graph power; Line graph; Algorithm","score_opus":0.03151075115654251,"score_gpt":0.30656467509930185,"score_spread":0.27505392394275935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062659098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2749002,0.000019357167,0.7206496,0.00054840825,0.00023276485,0.00025702085,0.00004436224,0.0001707915,0.0031775043],"genre_scores_gemma":[0.8179756,0.0000012585695,0.18183959,0.000036030884,0.000029195107,0.000014531469,0.000006520151,0.000008946386,0.00008833094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882334,0.000051381285,0.00016358006,0.00030956944,0.00033355987,0.0003185403],"domain_scores_gemma":[0.9987592,0.00017038516,0.000088728324,0.00069691765,0.00015860386,0.00012615457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002314643,0.00011600827,0.00016677113,0.00021096284,0.00018393039,0.000042000338,0.0009042229,0.000047806407,0.00006921997],"category_scores_gemma":[0.000040683994,0.00009795212,0.000055594417,0.0007561777,0.0006669929,0.00037390296,0.00019109264,0.00035258228,0.000026319869],"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.000010424505,0.00010332927,0.0013225944,0.000011843604,0.00003432478,0.000020757134,0.00015291995,0.00003290165,0.021752937,0.96612793,0.0001643275,0.010265679],"study_design_scores_gemma":[0.0010330521,0.0003273992,0.046950348,0.000037121827,0.000011513802,0.0001389188,0.000060598766,0.014760015,0.07020706,0.8647317,0.0012956419,0.0004465777],"about_ca_topic_score_codex":0.000020888794,"about_ca_topic_score_gemma":0.00005231341,"teacher_disagreement_score":0.5430754,"about_ca_system_score_codex":0.000008801457,"about_ca_system_score_gemma":0.000064938096,"threshold_uncertainty_score":0.39943716},"labels":[],"label_agreement":null},{"id":"W2065769146","doi":"10.1007/s00453-001-0015-9","title":"Structural Lines, TINs, and DEMs","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Triangulated irregular network; Triangulation; Digital elevation model; Initialization; Terrain; Curvature; Surface (topology); Elevation (ballistics); Geometry; Computer science; Algorithm; Mathematics; Geodesy; Geology; Remote sensing; Geography","score_opus":0.013262080314140383,"score_gpt":0.2392971103008179,"score_spread":0.22603502998667752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065769146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32733753,0.0005225231,0.6688105,0.0018078937,0.00048320205,0.00008015313,0.0000015397666,0.000119776276,0.00083690626],"genre_scores_gemma":[0.8884363,0.000037345333,0.110028304,0.00046324573,0.00035781876,0.0000037484779,0.000011411608,0.000004022044,0.000657815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994693,0.000017143751,0.00009464724,0.00018783502,0.0001160771,0.000115003444],"domain_scores_gemma":[0.99970275,0.000039377494,0.000025998585,0.00012823976,0.00004614549,0.000057500507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006890105,0.000063712396,0.000059278933,0.00005459064,0.00009750829,0.000083831976,0.00016053868,0.000026547978,0.000012006807],"category_scores_gemma":[0.000015398959,0.00005799692,0.00001606269,0.00023861183,0.00001571054,0.00023900598,0.00008229188,0.00004926712,0.00002138792],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002569804,0.000010706491,0.0006878598,0.0000028737845,0.000009852115,0.000017176286,0.0001296576,0.00043656197,0.0006799839,0.026967209,0.0011078165,0.96994776],"study_design_scores_gemma":[0.00034975674,0.000063216736,0.024357831,0.0000049837454,0.00000438348,0.00029422253,0.000007188145,0.9061903,0.0013112547,0.016398728,0.050814245,0.00020389378],"about_ca_topic_score_codex":0.000011738196,"about_ca_topic_score_gemma":0.000002928427,"teacher_disagreement_score":0.96974385,"about_ca_system_score_codex":0.000008536256,"about_ca_system_score_gemma":0.000021787953,"threshold_uncertainty_score":0.23650458},"labels":[],"label_agreement":null},{"id":"W2066449891","doi":"10.1007/s00453-008-9208-9","title":"An Improved Algorithm for Online Unit Clustering","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Cluster analysis; Theory of computation; Online algorithm; Partition (number theory); Mathematics; Combinatorics; Dimension (graph theory); Upper and lower bounds; Randomized algorithm; Algorithm; Sequence (biology); Unit (ring theory); Approximation algorithm; Computer science; Discrete mathematics; Statistics","score_opus":0.041953442326293944,"score_gpt":0.2997598735524124,"score_spread":0.25780643122611846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066449891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041531926,0.000027925711,0.9978885,0.0005391608,0.00025694643,0.00035698357,0.000031319898,0.00031360541,0.00017020541],"genre_scores_gemma":[0.003910469,0.000032000436,0.994266,0.000655176,0.00021066297,0.000043150492,0.00007011587,0.000020759744,0.00079168763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876976,0.00004937756,0.00022650039,0.00039548613,0.00017920026,0.00037965743],"domain_scores_gemma":[0.99894476,0.00006567279,0.00005897268,0.00052369904,0.00020586498,0.00020105654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018727167,0.00013999501,0.0001552485,0.00011384263,0.00027859723,0.00009098003,0.000810815,0.00006980863,0.000018094546],"category_scores_gemma":[0.000021241165,0.00013569483,0.000061995925,0.00031320564,0.00005347885,0.00060419575,0.0001474911,0.00012379551,0.000017032105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003580853,0.00022206454,0.0000096282,0.000007730828,0.000017617012,0.000011890006,0.00040147698,0.00096158864,0.00064327486,0.0005582544,0.00040030986,0.9967626],"study_design_scores_gemma":[0.0006704311,0.00026253765,0.00011282457,0.0000047925855,0.000002270713,0.000044189088,0.000016067925,0.98744637,0.00059911003,0.0003858162,0.010269552,0.00018604577],"about_ca_topic_score_codex":0.000035977446,"about_ca_topic_score_gemma":0.000010497711,"teacher_disagreement_score":0.99657655,"about_ca_system_score_codex":0.00002428577,"about_ca_system_score_gemma":0.00010467021,"threshold_uncertainty_score":0.55334747},"labels":[],"label_agreement":null},{"id":"W2068235693","doi":"10.1007/s00453-007-0062-y","title":"Rapid Homology Search with Neighbor Seeds","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Université de Montréal","funders":"","keywords":"Extension (predicate logic); Computer science; Theory of computation; Sensitivity (control systems); Flexibility (engineering); Speedup; Data mining; Theoretical computer science; Mathematics; Algorithm; Parallel computing; Statistics; Programming language; Engineering","score_opus":0.006735526569220527,"score_gpt":0.24887424455147955,"score_spread":0.24213871798225903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068235693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8016676,0.00041349858,0.15136765,0.0006005662,0.00023992438,0.0003234673,0.000016213711,0.000078101184,0.045292985],"genre_scores_gemma":[0.9490366,0.00005559478,0.047831763,0.0007549099,0.00044333423,0.000006134883,0.00015328587,0.000037454203,0.001680944],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897945,0.000037183116,0.00019318696,0.00021840775,0.00016605716,0.00040571994],"domain_scores_gemma":[0.9993365,0.00002830879,0.000057085294,0.00037526301,0.00009000155,0.00011287174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042818385,0.00014965175,0.00012515081,0.000067994624,0.0000868893,0.000018531695,0.00023243057,0.0001609665,0.00007573036],"category_scores_gemma":[0.00004012848,0.00012305868,0.000045442146,0.00013699828,0.00014218467,0.0000034484049,0.00011267216,0.00020947099,0.00006933332],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010773509,0.0003746683,0.025200576,0.00012538875,0.00061427295,0.0001804081,0.0010698143,0.00033952828,0.12533265,0.002811386,0.01155386,0.8313201],"study_design_scores_gemma":[0.0025060496,0.003279891,0.031480316,0.000024623145,0.00005651111,0.0009265078,0.0004418969,0.0043024835,0.35364875,0.000075101416,0.6023157,0.0009421537],"about_ca_topic_score_codex":0.000022247186,"about_ca_topic_score_gemma":0.000014296426,"teacher_disagreement_score":0.83037794,"about_ca_system_score_codex":0.000013149022,"about_ca_system_score_gemma":0.0000648314,"threshold_uncertainty_score":0.5018187},"labels":[],"label_agreement":null},{"id":"W2070346129","doi":"10.1007/s00453-010-9452-7","title":"Succinct Representation of Labeled Graphs","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Computer science; Planar graph; Adjacency list; Representation (politics); Graph; Pathwidth; Mathematics; Discrete mathematics; Theoretical computer science; Line graph","score_opus":0.009785539630708481,"score_gpt":0.25809857849414464,"score_spread":0.24831303886343614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070346129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2619006,0.00007788188,0.7310497,0.0008443266,0.0020820473,0.00029713023,0.000026334483,0.0003079614,0.0034139715],"genre_scores_gemma":[0.6989439,0.000011275933,0.30068412,0.00008064046,0.00010096506,0.000010120876,0.000020369145,0.000009239801,0.00013934472],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895304,0.000034774053,0.000234778,0.0003210466,0.00027275353,0.00018358498],"domain_scores_gemma":[0.99872917,0.00009749378,0.000121779034,0.0008502303,0.00012053536,0.00008080726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001587714,0.00010144075,0.00016135686,0.00010810099,0.00007973893,0.00005088803,0.0007897586,0.000069817186,0.000055177006],"category_scores_gemma":[0.000053819804,0.000086856155,0.00006636764,0.00047632007,0.000052275816,0.00050326134,0.00028875706,0.00018337871,0.000034827714],"study_design_candidate":"bench_or_experimental","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.000012198716,0.00023862666,0.0018057832,0.000016536162,0.000040620347,0.000025771691,0.00035876347,0.000010447622,0.15544376,0.16373765,0.0060273744,0.67228246],"study_design_scores_gemma":[0.0021400366,0.0002997062,0.03642646,0.000045984143,0.000031744927,0.00011611267,0.000052506894,0.30601278,0.5374071,0.093275525,0.023410628,0.00078144023],"about_ca_topic_score_codex":0.00014627815,"about_ca_topic_score_gemma":0.000010605997,"teacher_disagreement_score":0.67150104,"about_ca_system_score_codex":0.000004526794,"about_ca_system_score_gemma":0.000037142174,"threshold_uncertainty_score":0.3541891},"labels":[],"label_agreement":null},{"id":"W2071695456","doi":"10.1007/s00453-011-9498-1","title":"Tile-Packing Tomography Is $\\mathbb{NP}$ -hard","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Digital Image Processing Techniques","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 British Columbia","funders":"Comisión Interministerial de Ciencia y Tecnología; National Science Foundation","keywords":"Tile; Combinatorics; Disjoint sets; Mathematics; Grid; Projection (relational algebra); Tessellation (computer graphics); Set (abstract data type); Packing problems; Grid pattern; Geometry; Discrete mathematics; Algorithm; Computer science","score_opus":0.03993096740625833,"score_gpt":0.23957218440832576,"score_spread":0.19964121700206744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071695456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015847959,0.00022971266,0.9169419,0.00045533932,0.0003160382,0.00015290595,0.000007091322,0.00196423,0.07834801],"genre_scores_gemma":[0.19228308,0.000009484286,0.8054671,0.0016361793,0.000075246724,0.000028738597,0.0000017833115,0.000026726913,0.00047166078],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985207,0.000021900556,0.00023807914,0.0005173525,0.00029677677,0.0004052039],"domain_scores_gemma":[0.99879897,0.000028364182,0.00010537193,0.0008029629,0.0001372942,0.00012703317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018416603,0.00020125824,0.00018118562,0.00021922415,0.00010332976,0.0003790084,0.0015390067,0.00007811116,0.000047321682],"category_scores_gemma":[0.000026200902,0.0001934473,0.00012170002,0.00064333965,0.00010708652,0.0015040737,0.0004807513,0.00015597069,0.0002153155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048932206,0.00023291954,0.00068389793,0.000034023487,0.000054558113,0.00010049041,0.0028878483,5.0703687e-8,0.0011741013,0.02323813,0.030190114,0.941399],"study_design_scores_gemma":[0.0004945253,0.00040207533,0.0028300234,0.00019548344,0.000035194942,0.00028522802,0.000046962912,0.014045907,0.5486619,0.36096558,0.07048922,0.0015479305],"about_ca_topic_score_codex":0.000030883373,"about_ca_topic_score_gemma":5.0410233e-7,"teacher_disagreement_score":0.93985105,"about_ca_system_score_codex":0.000020892308,"about_ca_system_score_gemma":0.000042572923,"threshold_uncertainty_score":0.7888552},"labels":[],"label_agreement":null},{"id":"W2072269078","doi":"10.1007/s00453-009-9361-9","title":"Trade-offs Between the Size of Advice and Broadcasting Time in Trees","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"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":"Broadcasting (networking); Advice (programming); Competitive analysis; Computer science; Tree (set theory); Node (physics); Theory of computation; Dissemination; Oracle; Network topology; Computer network; Theoretical computer science; Distributed computing; Upper and lower bounds; Mathematics; Algorithm; Telecommunications; Combinatorics","score_opus":0.012749794725829575,"score_gpt":0.24902462796678823,"score_spread":0.23627483324095866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072269078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23248325,0.0020670786,0.56318176,0.14234054,0.000332799,0.0026115172,0.00004114676,0.0011165414,0.055825364],"genre_scores_gemma":[0.9113154,0.00002289105,0.08781569,0.00047445612,0.000054884775,0.0000027310305,0.0000014253401,0.00000483234,0.00030769283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992651,0.000072450224,0.0001832981,0.00016421425,0.00015158454,0.00016337397],"domain_scores_gemma":[0.9993646,0.00033009006,0.00005068615,0.00019060516,0.000018925244,0.000045060282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029586995,0.00006666239,0.00011997795,0.00004651493,0.00005308804,0.000046687157,0.00036710151,0.00003230266,0.000009332854],"category_scores_gemma":[0.00006444497,0.000049135026,0.000020439282,0.00034563543,0.000040725816,0.00018382096,0.000065031934,0.00010582177,0.0000055198025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033442693,0.00006409326,0.0011994147,0.0000077212235,0.0000118917005,0.0000067830574,0.002645723,0.0005081799,0.0009088893,0.0021072847,0.0006741097,0.9918626],"study_design_scores_gemma":[0.0008383925,0.00026981928,0.13707078,0.000056666253,0.0000070281917,0.000014406381,0.000055649045,0.8530559,0.0011202585,0.004888128,0.0024035736,0.00021939803],"about_ca_topic_score_codex":0.00002159796,"about_ca_topic_score_gemma":0.0000018819579,"teacher_disagreement_score":0.9916432,"about_ca_system_score_codex":0.000008081041,"about_ca_system_score_gemma":0.00002369567,"threshold_uncertainty_score":0.20036682},"labels":[],"label_agreement":null},{"id":"W2074982499","doi":"10.1007/s004530010067","title":"Static Frequency Assignment in Cellular Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Frequency assignment; Theory of computation; Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex connectivity; Discrete mathematics; Integer (computer science); Algorithm; Computer science","score_opus":0.004934258321494517,"score_gpt":0.17397404949442233,"score_spread":0.1690397911729278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074982499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47558135,0.0022988275,0.4903247,0.00012155871,0.0018282158,0.00050976494,0.000007846699,0.0005683048,0.028759424],"genre_scores_gemma":[0.9991104,0.00005852367,0.0004838658,0.00003721525,0.00011250879,0.000034299417,0.00000818056,0.000024555146,0.00013045478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923253,0.000043544012,0.0002124293,0.00012539943,0.000098037126,0.00028806145],"domain_scores_gemma":[0.9996888,0.000035999976,0.000015822234,0.00018896209,0.000007482756,0.000062927276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016562291,0.00012037787,0.00014182189,0.000071958144,0.0000250796,0.000017938664,0.00012006652,0.000068261295,0.00013620447],"category_scores_gemma":[0.000003520403,0.0001217804,0.000037775473,0.00023267834,0.00001768983,0.00007075986,0.000009642783,0.0001510087,0.00008017796],"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.00003361873,0.000406309,0.014805886,0.0002610974,0.00037191674,0.0021286455,0.002784652,0.7258879,0.02335358,0.033693507,0.008119614,0.18815325],"study_design_scores_gemma":[0.0012059973,0.000109400855,0.0024301575,0.0001710812,0.000030595766,0.000057390207,0.00048110163,0.94731563,0.0036486485,0.026738156,0.016930815,0.0008810206],"about_ca_topic_score_codex":0.000027828384,"about_ca_topic_score_gemma":0.000009614278,"teacher_disagreement_score":0.52352905,"about_ca_system_score_codex":0.00005640128,"about_ca_system_score_gemma":0.000004574591,"threshold_uncertainty_score":0.49660605},"labels":[],"label_agreement":null},{"id":"W2076901012","doi":"10.1007/s00453-011-9596-0","title":"Two-stage Robust Network Design with Exponential Scenarios","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Theory of computation; Facility location problem; Integer programming; Mathematical optimization; Computer science; Combinatorial optimization; Tree (set theory); Combinatorics; Integer (computer science); Network planning and design; Mathematics; Approximation algorithm; Stage (stratigraphy); Discrete mathematics; Algorithm","score_opus":0.06642916085159743,"score_gpt":0.22959198527262015,"score_spread":0.1631628244210227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076901012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006497975,0.00011141552,0.99377507,0.00011784266,0.0006790951,0.00031671353,0.0000037599366,0.00043257995,0.0039137364],"genre_scores_gemma":[0.04843974,0.000009593797,0.95029944,0.0003211259,0.00040039385,0.000042006166,0.0000038820895,0.000028498253,0.00045532672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997703,0.00015932298,0.0002943541,0.00068374374,0.00041813546,0.0007414226],"domain_scores_gemma":[0.99844843,0.00010776593,0.00013467594,0.0009827453,0.00010568306,0.00022071021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004318668,0.00030090622,0.0002792673,0.00012076291,0.00038003907,0.00017382413,0.0015383987,0.000079258774,0.00022122513],"category_scores_gemma":[0.00001097254,0.00025959397,0.00010548069,0.00077020325,0.00018820123,0.00060271006,0.00041534618,0.00030795427,0.00013031311],"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.00041719718,0.0014798392,0.00071341835,0.000059838254,0.0006740163,0.002863241,0.006978485,0.05553733,0.00030535698,0.5787063,0.012285977,0.339979],"study_design_scores_gemma":[0.00255754,0.001062632,0.0014909472,0.00011335803,0.000059266185,0.0002784645,0.00012816135,0.9500949,0.004072769,0.031073513,0.007598982,0.0014694898],"about_ca_topic_score_codex":0.00020209058,"about_ca_topic_score_gemma":0.000028806831,"teacher_disagreement_score":0.89455754,"about_ca_system_score_codex":0.0000331678,"about_ca_system_score_gemma":0.00011337591,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W2078778545","doi":"10.1007/s00453-014-9894-4","title":"A Framework for Succinct Labeled Ordinal Trees over Large Alphabets","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Theory of computation; Computer science; Combinatorics; Ordinal optimization; Mathematics; Discrete mathematics; Ordinal data; Theoretical computer science; Algorithm; Statistics","score_opus":0.01274002575439995,"score_gpt":0.2812125145245694,"score_spread":0.26847248877016944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078778545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038861807,0.00013409693,0.9934101,0.00077354925,0.0007670857,0.0002667226,0.000057772362,0.00026631195,0.00043819787],"genre_scores_gemma":[0.21290249,0.000010105056,0.7846211,0.0011588574,0.0008367043,0.000079852514,0.00004907391,0.00003185424,0.00030994046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802095,0.00007895869,0.00027983112,0.0006454837,0.00035403122,0.0006207469],"domain_scores_gemma":[0.99807054,0.000534984,0.00012454801,0.0009754798,0.00010551353,0.00018895065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048101612,0.00024380485,0.00030710056,0.000099929035,0.0003119111,0.00022181125,0.0011970795,0.00015851932,0.000096339056],"category_scores_gemma":[0.00018703434,0.00020430831,0.00013498764,0.0003119298,0.000031028423,0.00055259734,0.000505962,0.00021051789,0.00008242335],"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.000025964737,0.0002376495,0.0003232043,0.000018422668,0.000047362337,0.000008777636,0.00014486718,0.0000070081824,0.0003253693,0.43685663,0.017952157,0.5440526],"study_design_scores_gemma":[0.0018769017,0.000412898,0.004142373,0.00009937202,0.000024733137,0.0000170763,0.000020357857,0.6563802,0.0019471298,0.07687513,0.25762373,0.00058015314],"about_ca_topic_score_codex":0.00004869412,"about_ca_topic_score_gemma":0.000016193504,"teacher_disagreement_score":0.65637314,"about_ca_system_score_codex":0.000046042125,"about_ca_system_score_gemma":0.00004695937,"threshold_uncertainty_score":0.83314514},"labels":[],"label_agreement":null},{"id":"W2078952510","doi":"10.1007/s00453-013-9823-y","title":"Lower Bounds Against Weakly-Uniform Threshold Circuits","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematical proof; Theory of computation; Electronic circuit; Boolean circuit; Mathematics; Discrete mathematics; Computer science; Boolean function; Arithmetic; Algorithm; Electrical engineering","score_opus":0.01584595035044201,"score_gpt":0.22472843624327576,"score_spread":0.20888248589283376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078952510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070678085,0.00072263,0.7190493,0.008142669,0.006833717,0.0014060285,0.000029722427,0.0022250547,0.19091283],"genre_scores_gemma":[0.90628505,0.000069306865,0.08619215,0.003787299,0.0007081757,0.00014167391,0.000020300182,0.000051342173,0.002744695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975802,0.00003465245,0.00039213483,0.0006859769,0.00054309046,0.00076398236],"domain_scores_gemma":[0.9980458,0.000095856776,0.00011006876,0.0012669943,0.00019126103,0.0002899984],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023250398,0.00031718187,0.00029499328,0.00021629142,0.0003886054,0.00066376594,0.0020246347,0.00014180827,0.00027710464],"category_scores_gemma":[0.000025730107,0.0002989288,0.00020494088,0.0008053705,0.00018555413,0.0013228342,0.0006095459,0.00038364687,0.0015622514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015271432,0.00031945165,0.0001367679,0.000019951784,0.000082987564,0.0000742549,0.00044872714,0.000037430094,0.0012896038,0.12272469,0.024185225,0.8506794],"study_design_scores_gemma":[0.0013289319,0.0004561842,0.005972011,0.00011554436,0.00002393279,0.00015613933,0.00012400212,0.5476874,0.0052021607,0.27838942,0.15852347,0.002020793],"about_ca_topic_score_codex":0.00008231657,"about_ca_topic_score_gemma":0.000007783324,"teacher_disagreement_score":0.84865856,"about_ca_system_score_codex":0.00007104135,"about_ca_system_score_gemma":0.00009444921,"threshold_uncertainty_score":0.9999463},"labels":[],"label_agreement":null},{"id":"W2079850117","doi":"10.1007/s00453-011-9528-z","title":"Succinct and I/O Efficient Data Structures for Traversal in Trees","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Tree traversal; Combinatorics; Tree (set theory); Path (computing); Constant (computer programming); Mathematics; Binary tree; Binary logarithm; Data structure; Theory of computation; Discrete mathematics; Binary number; Node (physics); Physics; Algorithm; Computer science; Arithmetic","score_opus":0.05772345621798793,"score_gpt":0.2688078761154939,"score_spread":0.21108441989750595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079850117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032714073,0.00032664253,0.965462,0.00014817838,0.00042073513,0.00033566428,0.00015386217,0.00008805867,0.00035075826],"genre_scores_gemma":[0.5628452,0.000015918555,0.43684185,0.0000908529,0.00009492972,0.000012988409,0.000059602058,0.000011059262,0.000027615719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988506,0.000027691585,0.00017967378,0.00054371834,0.00014048982,0.0002578721],"domain_scores_gemma":[0.9988682,0.00008362602,0.00004954983,0.00089168566,0.000024660923,0.00008227985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021685049,0.0001279658,0.00015342166,0.00009560353,0.00008248197,0.000066097855,0.0012080069,0.000055714016,0.000013045989],"category_scores_gemma":[0.000028492079,0.00010356986,0.000020144973,0.00014089319,0.00004565093,0.0003423904,0.00078960095,0.00008517755,0.000003400948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060208193,0.00022629094,0.0008321816,0.000028406994,0.000032174306,0.000050605646,0.0023792824,0.000048900536,0.00033971635,0.043426633,0.003291598,0.949284],"study_design_scores_gemma":[0.0011535676,0.00015119697,0.049995113,0.000021444377,0.000010134396,0.000029596813,0.00007657802,0.9329101,0.0014663684,0.008599479,0.0052939225,0.00029254242],"about_ca_topic_score_codex":0.0002505233,"about_ca_topic_score_gemma":0.000044230594,"teacher_disagreement_score":0.9489915,"about_ca_system_score_codex":0.000012427441,"about_ca_system_score_gemma":0.000035047753,"threshold_uncertainty_score":0.42234564},"labels":[],"label_agreement":null},{"id":"W2082803170","doi":"10.1007/s00453-008-9234-7","title":"Dynamic Connectivity for Axis-Parallel Rectangles","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Intersection (aeronautics); Theory of computation; Amortized analysis; Matrix multiplication; Mathematics; Graph; Multiplication (music); Data structure; Range (aeronautics); Computer science; Discrete mathematics; Algorithm; Physics","score_opus":0.02008169411881673,"score_gpt":0.2563268051233751,"score_spread":0.23624511100455836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082803170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045927383,0.00012170502,0.9518527,0.00092373125,0.00041369977,0.00019999767,0.0000069410316,0.00013679966,0.00041704922],"genre_scores_gemma":[0.5636835,0.000014911688,0.43533245,0.00021386973,0.00008718611,0.00004436411,0.00001932175,0.0000058845976,0.00059854065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920964,0.000031407068,0.00013228318,0.00029759348,0.00014871066,0.00018034888],"domain_scores_gemma":[0.9993538,0.00021636942,0.000049841823,0.0002212626,0.00010121228,0.000057464462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013727442,0.00009331671,0.000112109214,0.000084087136,0.00024319482,0.000033517153,0.00028495624,0.000042948068,0.0000062159434],"category_scores_gemma":[0.000064175125,0.00009388308,0.00006975027,0.00027547503,0.000029503937,0.00027626762,0.000061837534,0.000054747183,0.000032049044],"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.00005227604,0.00041590212,0.00015170185,0.000032391912,0.00010547735,0.00004738918,0.0013275134,0.010646863,0.005064998,0.14332497,0.013220144,0.82561034],"study_design_scores_gemma":[0.000570543,0.00020252175,0.003177007,0.0000046907326,0.0000045017473,0.00012838775,0.000006912997,0.9570821,0.0022559084,0.023337482,0.01300385,0.00022609989],"about_ca_topic_score_codex":0.0000070073665,"about_ca_topic_score_gemma":0.0000062748877,"teacher_disagreement_score":0.9464352,"about_ca_system_score_codex":0.000039005838,"about_ca_system_score_gemma":0.000082254315,"threshold_uncertainty_score":0.3828441},"labels":[],"label_agreement":null},{"id":"W2086252334","doi":"10.1007/s00453-003-1056-z","title":"Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Tree (set theory); Theory of computation; Path (computing); k-minimum spanning tree; Range tree; Grid; Euclidean minimum spanning tree; Running time; Upper and lower bounds; Plane (geometry); Binary logarithm; Connected dominating set; K-ary tree; Algorithm; Tree structure; Binary tree; Geometry; Computer science","score_opus":0.01759218772458964,"score_gpt":0.24545137364636013,"score_spread":0.22785918592177049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086252334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019684017,0.00028483925,0.973581,0.00020507112,0.0006724318,0.00014893556,0.000001360377,0.0001930399,0.005229261],"genre_scores_gemma":[0.5054232,0.0000037853554,0.4937205,0.00033769908,0.00013259822,0.0000067404303,0.000006938863,0.000011084666,0.00035747982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825805,0.00015909213,0.00031509603,0.00050734176,0.00035727883,0.0004031386],"domain_scores_gemma":[0.99889505,0.00033787917,0.00012049014,0.00038864062,0.00012800378,0.0001299187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065879396,0.0001839317,0.00019697657,0.00050442584,0.00027259288,0.00022468864,0.0004548552,0.00006624521,0.00002909068],"category_scores_gemma":[0.00023529412,0.00018507133,0.00009595506,0.002010659,0.000027992826,0.00038910282,0.00012758387,0.0001854945,0.000117764626],"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.0000035502517,0.0002217271,0.00047177027,0.000027576783,0.000075129894,0.000051371295,0.0007819888,0.005495035,0.0019694641,0.055165786,0.0032742315,0.9324624],"study_design_scores_gemma":[0.0010656638,0.00017461317,0.0030049018,0.00003033007,0.000020187734,0.00019530673,0.000060223065,0.93860227,0.024027793,0.009643205,0.022496883,0.0006786247],"about_ca_topic_score_codex":0.0000053517174,"about_ca_topic_score_gemma":5.875072e-7,"teacher_disagreement_score":0.93310726,"about_ca_system_score_codex":0.000049113045,"about_ca_system_score_gemma":0.00008625108,"threshold_uncertainty_score":0.754699},"labels":[],"label_agreement":null},{"id":"W2089845008","doi":"10.1007/s00453-015-9982-0","title":"Anonymous Meeting in Networks","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"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":"Node (physics); Computer science; Theory of computation; Deterministic algorithm; Upper and lower bounds; Time complexity; Algorithm; Construct (python library); Existential quantification; Theoretical computer science; Mathematics; Discrete mathematics; Computer network","score_opus":0.028371181002250098,"score_gpt":0.2560131383583552,"score_spread":0.2276419573561051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089845008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000450756,0.00015139025,0.97892207,0.0011610495,0.00025236513,0.00010514041,2.0799085e-7,0.0001321176,0.018824894],"genre_scores_gemma":[0.50885165,0.000028018656,0.4887587,0.0011655291,0.00018364264,0.000023308115,0.0000050097033,0.000015283125,0.0009688363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991813,0.000068777415,0.0001399777,0.00019387288,0.00017276431,0.00024335532],"domain_scores_gemma":[0.99951345,0.000038538463,0.000028190767,0.00022730452,0.0000670942,0.00012542719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045222483,0.000061909755,0.000081387545,0.0000792361,0.000030392977,0.00009300731,0.00042464916,0.000040998464,0.0000060983693],"category_scores_gemma":[0.00005255019,0.000059119888,0.00001673051,0.00044255628,0.000017406535,0.00025539674,0.00017173465,0.00011686734,0.000051912793],"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.000009685884,0.00022567436,0.00246202,0.000008543024,0.000016516964,0.00016824098,0.0032863014,0.40233582,0.000043112916,0.046251528,0.01788076,0.5273118],"study_design_scores_gemma":[0.00029923007,0.00003036375,0.000100335914,0.000007867326,3.5070065e-7,0.000006630535,0.000022565579,0.99317247,0.000046142613,0.0014956547,0.0047366424,0.00008172021],"about_ca_topic_score_codex":0.000058622347,"about_ca_topic_score_gemma":0.000012838276,"teacher_disagreement_score":0.59083664,"about_ca_system_score_codex":0.00003659708,"about_ca_system_score_gemma":0.00006222107,"threshold_uncertainty_score":0.2410839},"labels":[],"label_agreement":null},{"id":"W2090286607","doi":"10.1007/s00453-006-0103-y","title":"Asymptotics of Largest Components in Combinatorial Structures","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Theory of computation; Term (time); Function (biology); Combinatorial analysis; Discrete mathematics; Generating function; Algorithm; Physics","score_opus":0.023833828769084613,"score_gpt":0.26715760124772714,"score_spread":0.24332377247864254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090286607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99351233,0.000070399175,0.00038646694,0.00003309321,0.0010657259,0.00017395419,0.000035183268,0.000040893774,0.0046819784],"genre_scores_gemma":[0.9901336,0.0000029418031,0.00951988,0.000018103927,0.00023157033,0.000003035232,0.0000146300135,0.000022558032,0.00005371614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882585,0.000075912474,0.00041393065,0.00017587024,0.00026804258,0.00024041622],"domain_scores_gemma":[0.99919456,0.00027207524,0.00014453319,0.00029846962,0.000057052584,0.00003332913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019240232,0.0001532482,0.00031402847,0.00012355547,0.00006881821,0.0000107031665,0.0002543192,0.00013153527,0.000050373215],"category_scores_gemma":[0.00008123362,0.00013217048,0.00008162531,0.00017044794,0.00012281277,0.000047507503,0.00010261224,0.00017912616,0.0000016111602],"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.000023774626,0.00013687531,0.0045266375,0.000039352137,0.000020409676,0.00000995213,0.00012392738,0.00001165324,0.00059294055,0.9933528,0.00064359163,0.00051809003],"study_design_scores_gemma":[0.0010194262,0.000037239275,0.02482859,0.000020344765,0.000018117431,0.0000068201766,0.000022040233,0.000227863,0.0052780663,0.96783465,0.0005605333,0.00014632773],"about_ca_topic_score_codex":0.00014209497,"about_ca_topic_score_gemma":0.000014287059,"teacher_disagreement_score":0.025518166,"about_ca_system_score_codex":0.000027261574,"about_ca_system_score_gemma":0.000015189276,"threshold_uncertainty_score":0.53897554},"labels":[],"label_agreement":null},{"id":"W2091923232","doi":"10.1007/s00453-009-9334-z","title":"Location-Oblivious Distributed Unit Disk Graph Coloring","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph coloring; Unit disk; Unit disk graph; Combinatorics; Edge coloring; Upper and lower bounds; Computer science; Graph; Chromatic scale; Fractional coloring; List coloring; Theory of computation; Mathematics; Discrete mathematics; Graph power; Algorithm; Line graph","score_opus":0.019290585026594205,"score_gpt":0.250780344982305,"score_spread":0.2314897599557108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091923232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060894256,0.00029830568,0.988337,0.0026303057,0.0005681598,0.00020759922,0.000017917566,0.0006219291,0.0012293508],"genre_scores_gemma":[0.9245485,0.00003173291,0.07437801,0.00063938,0.00020031673,0.000018396799,0.000039792947,0.000010940194,0.00013292796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982053,0.000064898435,0.00031708216,0.0005273819,0.00037844962,0.00050689664],"domain_scores_gemma":[0.9985273,0.00012954338,0.00010301527,0.0008301206,0.00021590377,0.00019415391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022418494,0.0002312533,0.00022947571,0.0002121578,0.00037683797,0.0002885193,0.0013845002,0.000085643835,0.000017858923],"category_scores_gemma":[0.00006254525,0.00023387527,0.00011334938,0.0019938159,0.00009806469,0.0005985094,0.00019455144,0.00026186105,0.0000882146],"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.000011239316,0.00050756877,0.00043445418,0.000019485102,0.00006823043,0.000100937694,0.0005613577,0.0006082501,0.00022005924,0.4516241,0.0029906388,0.5428537],"study_design_scores_gemma":[0.0017911738,0.0008497329,0.080161,0.0001710847,0.00005333629,0.00020098985,0.00013116952,0.30769804,0.0043373853,0.56273293,0.04016069,0.001712469],"about_ca_topic_score_codex":0.0000454704,"about_ca_topic_score_gemma":0.0000079145875,"teacher_disagreement_score":0.91845906,"about_ca_system_score_codex":0.0000438269,"about_ca_system_score_gemma":0.00007582558,"threshold_uncertainty_score":0.9537157},"labels":[],"label_agreement":null},{"id":"W2094293456","doi":"10.1007/s00453-007-9157-8","title":"Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Facility location problem; Tree (set theory); Path (computing); Pruning; Theory of computation; Center (category theory); Algorithm; Computer science; Mathematics; Mathematical optimization; Combinatorics","score_opus":0.035227737395752405,"score_gpt":0.2583280309337173,"score_spread":0.2231002935379649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094293456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03135112,0.0003705818,0.9559301,0.0060276077,0.0011746227,0.0025981325,0.00002333189,0.000272073,0.002252398],"genre_scores_gemma":[0.9940346,0.000020201067,0.0026407223,0.0011582894,0.00071521604,0.0003088824,0.0002026289,0.000022802922,0.0008966758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823123,0.000010509579,0.0005371854,0.00042428912,0.00031749863,0.00047929987],"domain_scores_gemma":[0.99915564,0.00009352189,0.00009384377,0.0003882737,0.00025007676,0.000018653387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016716893,0.00021800713,0.00018674962,0.00020948419,0.00024272989,0.0001373754,0.00039007975,0.000081000384,0.0001696519],"category_scores_gemma":[0.00017203654,0.00017296373,0.00009997537,0.0007963882,0.000080154794,0.0005627746,0.000121796395,0.0001393978,0.00031756266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014665934,0.00074513315,0.0044926126,0.0005632421,0.00012252944,0.000005451054,0.0006485623,0.028237393,0.00029570327,0.0071816375,0.009607976,0.9479531],"study_design_scores_gemma":[0.0010581318,0.00002489245,0.06304584,0.000028093962,0.000053971668,5.551197e-7,0.0012638867,0.71555585,0.000045787256,0.0008683521,0.21768253,0.000372103],"about_ca_topic_score_codex":0.002699218,"about_ca_topic_score_gemma":0.0050503225,"teacher_disagreement_score":0.96268344,"about_ca_system_score_codex":0.00007444907,"about_ca_system_score_gemma":0.00002156514,"threshold_uncertainty_score":0.70532566},"labels":[],"label_agreement":null},{"id":"W2096978969","doi":"10.1007/s00453-013-9790-3","title":"Monotone Drawings of Graphs with Fixed Embedding","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Book embedding; Planar graph; Combinatorics; Monotone polygon; Mathematics; Embedding; Outerplanar graph; Graph drawing; Discrete mathematics; Planar straight-line graph; Pathwidth; Graph embedding; Graph; Line graph; Computer science; Geometry","score_opus":0.00529886911728885,"score_gpt":0.21223427074331583,"score_spread":0.20693540162602697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096978969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23416236,0.000038264432,0.76459587,0.0003510491,0.00009662366,0.00013312175,7.3068594e-7,0.000057174275,0.00056483265],"genre_scores_gemma":[0.7852306,0.0000020955315,0.21441871,0.00011020089,0.000030669788,0.000018703655,0.00000387602,0.000004137228,0.00018102537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929404,0.000020114063,0.00014984782,0.00019724225,0.00020278853,0.00013596998],"domain_scores_gemma":[0.9994405,0.00006192307,0.00007492613,0.00021006612,0.00015826922,0.000054349835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006754625,0.00007943948,0.000104830535,0.00012328455,0.00006288503,0.000057413148,0.00026824567,0.000026608663,0.000030186993],"category_scores_gemma":[0.000011518467,0.000066444256,0.00003294772,0.0004892847,0.000029560542,0.00045806603,0.00006603972,0.00005361405,0.000037818765],"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.000019071838,0.0003694057,0.0019102668,0.00006495246,0.0001986255,0.000017559925,0.0023815695,0.017680926,0.072313614,0.16536562,0.0068355473,0.73284286],"study_design_scores_gemma":[0.00075535505,0.00033221714,0.016715722,0.000042732812,0.00001347356,0.00004385826,0.000059001344,0.839185,0.10805673,0.03279769,0.0016264735,0.0003717235],"about_ca_topic_score_codex":0.000052120355,"about_ca_topic_score_gemma":9.1432764e-7,"teacher_disagreement_score":0.8215041,"about_ca_system_score_codex":0.000009587711,"about_ca_system_score_gemma":0.000036421956,"threshold_uncertainty_score":0.2709518},"labels":[],"label_agreement":null},{"id":"W2098907131","doi":"10.1007/s00453-007-9013-x","title":"Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Vertex (graph theory); Approximation algorithm; Integer (computer science); Graph; Theory of computation; Tree (set theory); Binary logarithm; Discrete mathematics; Algorithm; Computer science","score_opus":0.011891468417320541,"score_gpt":0.23298884474574888,"score_spread":0.22109737632842835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098907131","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059921805,0.0013698902,0.9080853,0.004141912,0.00080903043,0.00035788113,0.000008462656,0.0007067712,0.024598934],"genre_scores_gemma":[0.3871096,0.00003263359,0.60869706,0.0009443752,0.0005582512,0.00002090835,0.000008167101,0.000039454466,0.002589552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800855,0.000036953894,0.00040719108,0.00060303824,0.00037527297,0.0005690106],"domain_scores_gemma":[0.9987536,0.00023439714,0.00012287596,0.0006058076,0.00006859466,0.00021474675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065550423,0.00024317566,0.0002625369,0.00018728312,0.00040438867,0.00016244141,0.00078514934,0.00009892573,0.00004093852],"category_scores_gemma":[0.000052669984,0.00022270392,0.000094768984,0.000482652,0.00012284364,0.00038228507,0.0007524787,0.00021479331,0.000059232956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014557928,0.00017556544,0.0010930814,0.000039238577,0.00007919575,0.00017599635,0.0019709342,0.000011119785,0.004358932,0.08990022,0.0016323368,0.9005488],"study_design_scores_gemma":[0.0035953107,0.0007011171,0.027831798,0.00022799644,0.00007922239,0.0012453009,0.0004015835,0.5395602,0.04940075,0.067202225,0.3067721,0.0029823803],"about_ca_topic_score_codex":0.0001903817,"about_ca_topic_score_gemma":0.0004222261,"teacher_disagreement_score":0.89756644,"about_ca_system_score_codex":0.000063332525,"about_ca_system_score_gemma":0.000035160945,"threshold_uncertainty_score":0.90816027},"labels":[],"label_agreement":null},{"id":"W2103317190","doi":"10.1007/s00453-005-1197-3","title":"I/O-Efficient Well-Separated Pair Decomposition and Applications","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"sort; Combinatorics; Theory of computation; Mathematics; Sorting; Sorting algorithm; Dimension (graph theory); Set (abstract data type); Decomposition; Point (geometry); Discrete mathematics; Algorithm; Computer science; Arithmetic; Chemistry","score_opus":0.004536547837923732,"score_gpt":0.2345241682267032,"score_spread":0.22998762038877946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103317190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02768549,0.00020125778,0.9689949,0.0006471555,0.000090840724,0.00019189571,0.0000029095004,0.00014366064,0.0020418894],"genre_scores_gemma":[0.9054084,0.0000026809757,0.093688995,0.00017445635,0.00024460992,0.00006428673,0.00005881857,0.00000516492,0.00035261447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928516,0.000029003522,0.00015012438,0.0002657328,0.00014033563,0.00012962426],"domain_scores_gemma":[0.999604,0.000053020445,0.000046501576,0.00017034984,0.00007937853,0.00004676195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010039739,0.00008082239,0.00006867346,0.00009672645,0.00018085795,0.000097754746,0.00014583857,0.00003426959,0.000008668184],"category_scores_gemma":[0.0000019979555,0.00008259247,0.000023980256,0.00041710827,0.000024053557,0.000080369435,0.00006095175,0.000047807134,0.00009011353],"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.0000073904803,0.00047777235,0.000211394,0.000018484023,0.000025531477,0.000009901992,0.00009389664,0.20714009,0.008635802,0.46787524,0.00884216,0.30666235],"study_design_scores_gemma":[0.00021307624,0.000029800774,0.004060902,0.0000032228238,0.0000051991055,0.000032176707,0.0000025588606,0.9512108,0.00454697,0.009775866,0.029983347,0.00013607707],"about_ca_topic_score_codex":0.00002106656,"about_ca_topic_score_gemma":0.0000016919353,"teacher_disagreement_score":0.87772286,"about_ca_system_score_codex":0.000023821443,"about_ca_system_score_gemma":0.000026560776,"threshold_uncertainty_score":0.33680233},"labels":[],"label_agreement":null},{"id":"W2104997690","doi":"10.1007/s00453-013-9861-5","title":"Communication Complexity of Quasirandom Rumor Spreading","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"","keywords":"Hypercube; Computer science; Combinatorics; Node (physics); Discrete mathematics; Communication complexity; Theoretical computer science; Mathematics","score_opus":0.03068134274019199,"score_gpt":0.24824574633812657,"score_spread":0.21756440359793458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104997690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028437276,0.00007795088,0.977758,0.00063448306,0.00017078983,0.00009518418,0.0000030643962,0.000094905314,0.018321877],"genre_scores_gemma":[0.8686626,0.000013140238,0.13097703,0.00018208749,0.00005757878,0.000004068169,0.000010256464,0.0000058924434,0.00008734879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989812,0.00014042319,0.00029022407,0.00020049996,0.00019367023,0.00019400043],"domain_scores_gemma":[0.9985526,0.0002833331,0.00015621539,0.0008390651,0.000083039085,0.000085748754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004926792,0.00010091966,0.00023523005,0.00005032324,0.00011840862,0.000045831683,0.0008515531,0.000052230935,0.000020159763],"category_scores_gemma":[0.000012881687,0.000094714436,0.00006487543,0.00017561967,0.00017627203,0.000178329,0.0001760304,0.00012257391,0.000029808147],"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.000015274516,0.00011690217,0.00019896217,0.000017715678,0.000025997424,0.000002544927,0.00044146925,0.000022126927,0.00016526162,0.41993874,0.0019897902,0.5770652],"study_design_scores_gemma":[0.00062236027,0.000059382106,0.00038953594,0.000035218847,0.000008938414,0.0000132336245,0.000015578187,0.95096064,0.00059331104,0.04380327,0.0033631576,0.00013538761],"about_ca_topic_score_codex":0.00007046986,"about_ca_topic_score_gemma":0.0000041851586,"teacher_disagreement_score":0.9509385,"about_ca_system_score_codex":0.000013641082,"about_ca_system_score_gemma":0.000027715514,"threshold_uncertainty_score":0.38623425},"labels":[],"label_agreement":null},{"id":"W2105667010","doi":"10.1007/s00453-010-9455-4","title":"Dynamic vs. Oblivious Routing in Network Design","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Static routing; Multipath routing; Theory of computation; Routing (electronic design automation); Polytope; Mathematical optimization; Routing protocol; Computer network; Mathematics; Algorithm; Combinatorics","score_opus":0.013234180198838406,"score_gpt":0.27650703787089886,"score_spread":0.26327285767206043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105667010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00995823,0.00004400468,0.98802614,0.000487395,0.0005327811,0.00024856717,6.8902995e-7,0.00019156882,0.0005106222],"genre_scores_gemma":[0.53194463,0.0000060836064,0.46769458,0.0001213159,0.00006233825,0.000022783544,8.854156e-7,0.000014414213,0.00013294611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981309,0.00016629421,0.00022766065,0.00047010972,0.0002832831,0.0007217099],"domain_scores_gemma":[0.9985434,0.00047540205,0.000059827078,0.00073994085,0.00005718705,0.00012424024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426157,0.00014827352,0.00017572219,0.00016376344,0.00014224752,0.00011570669,0.0013591773,0.00009554131,0.000018711647],"category_scores_gemma":[0.00014941898,0.0001469101,0.000048625938,0.0010553712,0.00009807041,0.00039819357,0.00039884407,0.0006870502,0.00011560601],"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.000043260476,0.00016400793,0.0015008621,0.000010060573,0.000026648844,0.00033248728,0.00075798825,0.008983775,0.006116716,0.2872892,0.0005836388,0.69419134],"study_design_scores_gemma":[0.00032302208,0.00007457942,0.0023713831,0.000015865933,0.0000013631263,0.000042999272,0.000008185025,0.8305729,0.0006107992,0.16522872,0.00051795953,0.00023220574],"about_ca_topic_score_codex":0.000020462157,"about_ca_topic_score_gemma":0.00005555945,"teacher_disagreement_score":0.8215891,"about_ca_system_score_codex":0.00004293385,"about_ca_system_score_gemma":0.00008417709,"threshold_uncertainty_score":0.599082},"labels":[],"label_agreement":null},{"id":"W2105930785","doi":"10.1007/s00453-004-1081-6","title":"Solving Systems of Difference Constraints Incrementally with Bidirectional Search","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"","keywords":"Theory of computation; Computer science; Heuristic; Bounded function; Heuristics; Local search (optimization); Algorithm; Search algorithm; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.013275735814220962,"score_gpt":0.2265882630989717,"score_spread":0.21331252728475075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105930785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03854633,0.000025335888,0.9592017,0.00018932892,0.00018777917,0.00014657946,0.0000061627484,0.00008941645,0.001607373],"genre_scores_gemma":[0.90550655,0.0000065534277,0.09436393,0.00003153446,0.000023826404,0.000006506966,0.000003685618,0.00000455746,0.00005288288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990952,0.0000317339,0.00017858428,0.00021603766,0.00032251677,0.00015590721],"domain_scores_gemma":[0.99950206,0.000043930202,0.00006918532,0.00018076388,0.00013891446,0.00006514316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012868314,0.000088095934,0.000116091716,0.00010723198,0.000087933746,0.00006827289,0.00021736106,0.000034809138,0.00003264827],"category_scores_gemma":[0.000010207922,0.00007680674,0.000024510517,0.0002751867,0.00015358327,0.0001904866,0.000059116977,0.000089738714,0.000010917962],"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.000049238624,0.0004976013,0.020646786,0.00014738606,0.00030972212,0.00007996831,0.0026005106,0.0619442,0.029863833,0.4017618,0.00008652323,0.48201242],"study_design_scores_gemma":[0.009804262,0.0015825514,0.2678335,0.0011859305,0.00007170845,0.0021135733,0.0017865608,0.6131732,0.09681962,0.0032322826,0.000395894,0.0020009186],"about_ca_topic_score_codex":0.00018829478,"about_ca_topic_score_gemma":0.00001746583,"teacher_disagreement_score":0.86696017,"about_ca_system_score_codex":0.00007379162,"about_ca_system_score_gemma":0.00022158126,"threshold_uncertainty_score":0.3132088},"labels":[],"label_agreement":null},{"id":"W2109595435","doi":"10.1007/s00453-014-9928-y","title":"An $$O(n^4)$$ O ( n 4 ) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Theory of computation; Grid; Partition (number theory); Combinatorics; Vertex connectivity; Bisection; Algorithm; Bisection method; Computer science; Graph theory; Mathematics; Graph; Discrete mathematics","score_opus":0.006196863000501695,"score_gpt":0.2343314605366172,"score_spread":0.22813459753611548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109595435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030692348,0.000020242052,0.9924487,0.0006884074,0.0025318086,0.00026055233,0.000009447809,0.0001932493,0.0007783744],"genre_scores_gemma":[0.8413169,0.000007213379,0.153472,0.001917564,0.0025349322,0.000060638245,0.00001703206,0.00004544325,0.0006282959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982166,0.00027791152,0.00040279113,0.00043821917,0.00033602724,0.0003284228],"domain_scores_gemma":[0.998494,0.00013350432,0.0001610815,0.0008938507,0.00016441836,0.00015311356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008220274,0.00018057716,0.00027936784,0.00016590486,0.00022782809,0.00012208588,0.0011070706,0.00008278868,0.000015350788],"category_scores_gemma":[0.000016770235,0.00013117978,0.0001262606,0.00065801106,0.000053342344,0.00031952444,0.00014741064,0.00015561405,0.00016112598],"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.0000108928125,0.00017562634,0.00003389735,0.000010758627,0.00008892121,0.000004016283,0.0013109663,0.0039329436,0.0026729053,0.018493492,0.025849279,0.9474163],"study_design_scores_gemma":[0.00019959352,0.00053282146,0.0004743028,0.000026273725,0.00000784159,0.000051232746,0.00001718554,0.96793413,0.002728745,0.0031320176,0.024697969,0.00019791389],"about_ca_topic_score_codex":0.00014198702,"about_ca_topic_score_gemma":0.000013160318,"teacher_disagreement_score":0.9640012,"about_ca_system_score_codex":0.000028384833,"about_ca_system_score_gemma":0.000026270538,"threshold_uncertainty_score":0.5349356},"labels":[],"label_agreement":null},{"id":"W2109924867","doi":"10.1007/s00453-002-0976-3","title":"Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Binary tree; Binary search tree; Element (criminal law); Binary number; Oracle; Discrete mathematics; Quantum; Sorting; Quantum algorithm; Algorithm; Computer science; Arithmetic; Physics; Quantum mechanics","score_opus":0.02030524396563501,"score_gpt":0.23947494096838004,"score_spread":0.21916969700274502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109924867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2491688,0.0008443368,0.7431738,0.0035110118,0.00044521896,0.00031427108,0.000019831008,0.00036332666,0.0021594423],"genre_scores_gemma":[0.92298,0.000015464942,0.07660506,0.00011101992,0.00011273223,0.0000065900813,0.0000033316878,0.000015606585,0.00015020222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825704,0.00009789943,0.00039876677,0.0004414142,0.00037340724,0.00043146394],"domain_scores_gemma":[0.9989496,0.00017866018,0.00018738912,0.0004730669,0.00008194607,0.00012937946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000281266,0.00020442788,0.00029969413,0.00012778466,0.00024279431,0.000116025425,0.00067498407,0.00004557541,0.000046163175],"category_scores_gemma":[0.000052789346,0.00017854225,0.00006992476,0.00028707608,0.00019663136,0.00012968322,0.00051603274,0.00021907504,0.000009172274],"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.000006121905,0.00030250195,0.0007510797,0.00015618383,0.00009105747,0.000046854937,0.0051548677,0.0006112653,0.0005419407,0.26806673,0.0015792778,0.72269213],"study_design_scores_gemma":[0.0003740164,0.00017257457,0.0015668138,0.000042500855,0.0000065016443,0.000053279677,0.00006639417,0.97326356,0.00069474464,0.021166021,0.002359231,0.00023434668],"about_ca_topic_score_codex":0.000106121886,"about_ca_topic_score_gemma":0.0000062766962,"teacher_disagreement_score":0.9726523,"about_ca_system_score_codex":0.000014249295,"about_ca_system_score_gemma":0.000019108611,"threshold_uncertainty_score":0.72807413},"labels":[],"label_agreement":null},{"id":"W2111339397","doi":"10.1007/s00453-010-9420-2","title":"Nonclairvoyant Speed Scaling for Flow and Energy","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; University of Pittsburgh; National Science Foundation","keywords":"Competitive analysis; Scaling; Function (biology); Theory of computation; Mathematics; Energy (signal processing); Constant (computer programming); Power function; Combinatorics; Power (physics); Flow (mathematics); Power flow; Algorithm; Mathematical analysis; Physics; Computer science; Geometry; Electric power system; Statistics; Upper and lower bounds; Thermodynamics","score_opus":0.009830635981841078,"score_gpt":0.2407282012606789,"score_spread":0.2308975652788378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111339397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007089385,0.000022972763,0.9958364,0.0017087294,0.00039896814,0.00007229512,0.0000039878228,0.00009515117,0.0011525962],"genre_scores_gemma":[0.044978414,0.000017417773,0.9531868,0.0006333993,0.00018971565,0.000013635643,0.000007396645,0.000010893848,0.0009623233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931276,0.000013680361,0.0001125658,0.00024029175,0.00011462416,0.00020610463],"domain_scores_gemma":[0.99946517,0.00007961338,0.00002676411,0.00023027221,0.00008440815,0.00011376978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018078616,0.00007355962,0.00008633076,0.000057953446,0.00012833341,0.00014788691,0.0002929831,0.00005198696,0.000017614992],"category_scores_gemma":[0.00003480898,0.00006584004,0.000029288085,0.0001239809,0.000039540333,0.0002002365,0.00011923407,0.00008773855,0.00000686227],"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.0000039382794,0.00004474324,0.000020126954,0.000010102418,0.0000138826035,0.000004008439,0.00030224415,0.00041783124,0.005181047,0.12602666,0.0016987013,0.86627674],"study_design_scores_gemma":[0.00029765716,0.00003212292,0.000028486877,0.0000032298144,0.0000015883603,0.000010545132,0.000004211718,0.9467324,0.0028959543,0.004088815,0.04580952,0.00009546115],"about_ca_topic_score_codex":0.000020447218,"about_ca_topic_score_gemma":0.000010594351,"teacher_disagreement_score":0.9463146,"about_ca_system_score_codex":0.0000050379176,"about_ca_system_score_gemma":0.000038200516,"threshold_uncertainty_score":0.26848787},"labels":[],"label_agreement":null},{"id":"W2115902466","doi":"10.1007/s00453-011-9537-y","title":"Interval Partitions and Polynomial Factorization","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Factorization; Combinatorics; Mathematics; Theory of computation; Interval (graph theory); Polynomial; Discrete mathematics; Computer science; Algorithm","score_opus":0.025045562598744006,"score_gpt":0.21955492468266774,"score_spread":0.19450936208392372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115902466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052720863,0.000031000305,0.9436882,0.00035870448,0.00055493315,0.000073673946,0.0000033579795,0.0001643366,0.002404928],"genre_scores_gemma":[0.9695982,0.000003349169,0.030037126,0.00013825312,0.000119129945,0.0000063080806,0.0000037062516,0.000004062428,0.00008991207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994527,0.00002357847,0.00012083682,0.00019438092,0.00007275885,0.0001357493],"domain_scores_gemma":[0.9996977,0.000022828048,0.000038426468,0.00014074238,0.000025189647,0.00007514513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052296313,0.00007234301,0.00007187736,0.000055592438,0.00008475412,0.000056078556,0.00019595594,0.000030749907,0.000026836558],"category_scores_gemma":[0.000011581315,0.00006841573,0.000025083255,0.00012596943,0.00003364233,0.0003866979,0.00012739882,0.000053541833,0.00004368731],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010993778,0.00014419723,0.00089928525,0.000008109879,0.000036294474,0.000014220253,0.00472144,0.000004108282,0.0013158758,0.0761096,0.0030591052,0.91367674],"study_design_scores_gemma":[0.0030673048,0.0012378348,0.2758385,0.00009094181,0.000071914634,0.000253645,0.00023960973,0.3246036,0.075980805,0.28013703,0.036507286,0.0019715577],"about_ca_topic_score_codex":0.00006411875,"about_ca_topic_score_gemma":0.000004598578,"teacher_disagreement_score":0.91687727,"about_ca_system_score_codex":0.000012980429,"about_ca_system_score_gemma":0.000022724389,"threshold_uncertainty_score":0.27899125},"labels":[],"label_agreement":null},{"id":"W2116643655","doi":"10.1007/s00453-010-9461-6","title":"Shortest Paths in Time-Dependent FIFO Networks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Combinatorics; Disjoint sets; Mathematics; Interval (graph theory); Function (biology); Node (physics); Binary logarithm; Time complexity; Path (computing); Discrete mathematics; Computer science; Graph; Physics","score_opus":0.004630311136895341,"score_gpt":0.2092553920371225,"score_spread":0.20462508090022716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116643655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032970287,0.00021512,0.95340544,0.0010365535,0.0031685357,0.0007065245,0.0000049345226,0.0006608821,0.007831722],"genre_scores_gemma":[0.96018416,0.000018654522,0.037549373,0.00056513306,0.0007369817,0.000079522564,0.000009219594,0.00003260083,0.0008243844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980375,0.00006517877,0.0003336731,0.0005993051,0.00037304408,0.0005912596],"domain_scores_gemma":[0.9984188,0.00019226682,0.00007844147,0.0010760404,0.000051016217,0.00018343335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054398004,0.00020983316,0.00023385523,0.00009786144,0.000076682256,0.00020359975,0.0017659097,0.00021223047,0.00017875462],"category_scores_gemma":[0.000032320524,0.00020749561,0.00006882711,0.00048596205,0.00005657851,0.00035463553,0.00056296866,0.0008051642,0.00045460858],"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.000009357139,0.00043616377,0.005340961,0.000004937543,0.000032313194,0.0005208196,0.00029074878,0.009265219,0.0015315887,0.010843457,0.010796559,0.9609279],"study_design_scores_gemma":[0.0003487187,0.000054043594,0.003900615,0.000014436401,0.000003947756,0.0000625843,0.000002509234,0.98587424,0.00038402664,0.0015888691,0.0074472604,0.000318778],"about_ca_topic_score_codex":0.0000603362,"about_ca_topic_score_gemma":0.00012850708,"teacher_disagreement_score":0.976609,"about_ca_system_score_codex":0.000037849382,"about_ca_system_score_gemma":0.000057891015,"threshold_uncertainty_score":0.84614253},"labels":[],"label_agreement":null},{"id":"W2118877434","doi":"10.1007/s00453-001-0003-0","title":"Optimal Search and One-Way Trading Online Algorithms","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":210,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Portfolio; Stochastic game; Computer science; Online algorithm; Adversary; Mathematical economics; Economics; Algorithm; Mathematics; Upper and lower bounds; Financial economics","score_opus":0.046450555433268786,"score_gpt":0.29112199498195773,"score_spread":0.24467143954868895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118877434","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012679268,0.00025096152,0.9798263,0.0042668427,0.00015122133,0.00022560266,0.000008274761,0.00025855724,0.0023330175],"genre_scores_gemma":[0.07194244,0.00041017082,0.9255467,0.0005331247,0.00021280143,0.000011498966,0.000018592411,0.000021553484,0.0013031077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983335,0.0000851215,0.00022979557,0.0004737741,0.000398934,0.00047884558],"domain_scores_gemma":[0.99913555,0.00008460279,0.000029616844,0.00037469264,0.00010888057,0.00026667936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035002033,0.00015139222,0.00018097165,0.00017439766,0.00020884711,0.00026596905,0.0005877695,0.000075981356,0.000089963265],"category_scores_gemma":[0.00002437209,0.00014914553,0.000044452274,0.00054786965,0.00008969039,0.00055555126,0.00028618233,0.00026390288,0.000043524993],"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.0000072279736,0.0003524673,0.00021381227,0.000017061659,0.000051095845,0.00010199757,0.0013886291,0.0023729838,0.0003997603,0.01928258,0.0005824047,0.97523],"study_design_scores_gemma":[0.00050188013,0.00013473361,0.0005494249,0.000017024535,0.0000037944528,0.0001024155,0.00006260281,0.991249,0.00040070404,0.0007511341,0.006017497,0.00020973785],"about_ca_topic_score_codex":0.00005342602,"about_ca_topic_score_gemma":0.000005581212,"teacher_disagreement_score":0.98887604,"about_ca_system_score_codex":0.000036768095,"about_ca_system_score_gemma":0.00007451346,"threshold_uncertainty_score":0.6081978},"labels":[],"label_agreement":null},{"id":"W2125293312","doi":"10.1007/s00453-014-9893-5","title":"Space–Time Trade-offs for Stack-Based Algorithms","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Monotone polygon; Simple polygon; Algorithm; Polygon covering; Binary logarithm; Polygon (computer graphics); Stack (abstract data type); Amortized analysis; Theory of computation; Computational geometry; Mathematics; Bounded function; Time complexity; Regular polygon; Workspace; Rectilinear polygon; Combinatorics; Computer science; Simple (philosophy); Data structure; Frame (networking); Geometry","score_opus":0.01165814548503848,"score_gpt":0.23956512267524782,"score_spread":0.22790697719020933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125293312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007269135,0.00004441128,0.99251556,0.0050467723,0.00052130246,0.00029305808,0.000015431951,0.00022033876,0.0006162366],"genre_scores_gemma":[0.102448985,0.0000015701315,0.893834,0.0016412173,0.0008409346,0.00008312511,0.00010529761,0.000023486355,0.00102139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986207,0.000072291754,0.00022884975,0.00045867602,0.00030002827,0.0003194394],"domain_scores_gemma":[0.99889404,0.0003879297,0.00008725482,0.00040072124,0.0000958274,0.00013423247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000424101,0.00016931827,0.00018667616,0.00014949568,0.000200439,0.0001434147,0.00050216215,0.00007650051,0.000023794268],"category_scores_gemma":[0.00008349966,0.00016820391,0.000121532255,0.00040682935,0.000032078657,0.00027312877,0.000057196947,0.000085254585,0.00011421789],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016811451,0.0001913336,0.00001060595,0.000027928523,0.000039500417,0.0000033149145,0.00014166183,0.010247126,0.0032899466,0.061450776,0.021055438,0.90352553],"study_design_scores_gemma":[0.00064139534,0.00020438404,0.00018303939,0.0000067911283,0.000008199713,0.0000052730775,0.000001662585,0.868778,0.012648791,0.0070990063,0.11021408,0.00020937271],"about_ca_topic_score_codex":0.000004022007,"about_ca_topic_score_gemma":7.8005945e-7,"teacher_disagreement_score":0.9033162,"about_ca_system_score_codex":0.000039512423,"about_ca_system_score_gemma":0.00010795483,"threshold_uncertainty_score":0.6859157},"labels":[],"label_agreement":null},{"id":"W2130428886","doi":"10.1007/s00453-014-9955-8","title":"Online Bin Packing with Advice","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Advice (programming); Bin; Computer science; Theory of computation; Combinatorics; Mathematics; Algorithm; Programming language","score_opus":0.005320935873254548,"score_gpt":0.1880935076917519,"score_spread":0.18277257181849735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130428886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030809727,0.00023367463,0.881315,0.0008095019,0.0009016106,0.00031416686,0.00003601439,0.0038287104,0.08175158],"genre_scores_gemma":[0.86724526,0.00003362047,0.13110368,0.00037241873,0.0003173375,0.0000087277285,0.00007700394,0.00007988106,0.0007620708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951196,0.000012578219,0.00010383589,0.00010864669,0.00009418192,0.00016879199],"domain_scores_gemma":[0.99970096,0.000031902127,0.00001655768,0.00016113611,0.00003122523,0.00005821874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006026307,0.00010285505,0.000099156976,0.000052045685,0.000036932637,0.000028897217,0.000085474,0.00004325614,0.000080485916],"category_scores_gemma":[0.000008876626,0.00008867042,0.000017817647,0.00017341715,0.000016456403,0.000069065056,0.000010532951,0.00010717054,0.00007541384],"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.000012566493,0.00013457432,0.0010358242,0.00016360485,0.00014158452,0.000010718966,0.0008034272,0.70503205,0.00081846095,0.002658922,0.009473987,0.27971426],"study_design_scores_gemma":[0.00041445103,0.000050600254,0.0004550545,0.000048662016,0.000012501636,0.000012495486,0.000024034818,0.89256006,0.0008245139,0.00011174891,0.10525631,0.00022957905],"about_ca_topic_score_codex":0.000009371729,"about_ca_topic_score_gemma":0.0000157267,"teacher_disagreement_score":0.83643556,"about_ca_system_score_codex":0.000014310451,"about_ca_system_score_gemma":0.000005637155,"threshold_uncertainty_score":0.3615875},"labels":[],"label_agreement":null},{"id":"W2132274124","doi":"10.1007/s00453-004-1113-2","title":"The Power of Priority Algorithms for Facility Location and Set Cover","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Set cover problem; Facility location problem; Greedy algorithm; Theory of computation; Cover (algebra); Focus (optics); Class (philosophy); Algorithm; Approximation algorithm; Set (abstract data type); Covering problems; Computer science; Time complexity; Mathematical optimization; Dominating set; Point (geometry); Vertex cover; Mathematics; Theoretical computer science; Graph","score_opus":0.02472507854586655,"score_gpt":0.27160109436645713,"score_spread":0.24687601582059057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132274124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008330978,0.00040396312,0.9882885,0.001736914,0.00047507408,0.0004635199,0.00008915509,0.00008201376,0.00012988728],"genre_scores_gemma":[0.7977502,0.000094613635,0.20161083,0.0002286839,0.000091334805,0.00007062107,0.000017102477,0.000011332314,0.00012527755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986292,0.000044946253,0.00032169643,0.0004035989,0.00028902432,0.00031151687],"domain_scores_gemma":[0.99852175,0.00032897905,0.00013036809,0.00065302226,0.0002766805,0.00008922637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060782844,0.00016014294,0.00019837226,0.000054611068,0.0003927792,0.0001221608,0.0006895355,0.00007791161,0.0000032323442],"category_scores_gemma":[0.00012798526,0.00012425064,0.00009117654,0.00038193763,0.00030645187,0.00032487325,0.00024756347,0.00013865334,0.000009574549],"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.000052257255,0.0002991695,0.0001702947,0.000110496956,0.00014258882,0.0000050822136,0.0034882117,0.00026596698,0.00035264392,0.39684367,0.0010503685,0.5972192],"study_design_scores_gemma":[0.004881042,0.0012314427,0.01864505,0.00010439282,0.000058694975,0.00010672835,0.00048825293,0.13165407,0.021652773,0.7393107,0.08070848,0.0011583826],"about_ca_topic_score_codex":0.00007896932,"about_ca_topic_score_gemma":0.000010033738,"teacher_disagreement_score":0.78941923,"about_ca_system_score_codex":0.00004686995,"about_ca_system_score_gemma":0.00013636322,"threshold_uncertainty_score":0.5066794},"labels":[],"label_agreement":null},{"id":"W2135499999","doi":"10.1007/s00453-001-0084-9","title":"Improved Algorithms for Uniform Partitions of Points","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Parameterized complexity; Integer (computer science); Algorithm; Mathematics; Theory of computation; Combinatorics; Time complexity; Constant (computer programming); Set (abstract data type); Running time; Space (punctuation); Discrete mathematics; Computer science","score_opus":0.03377768051008838,"score_gpt":0.26075356987466114,"score_spread":0.22697588936457275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135499999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012730454,0.00007919871,0.9957259,0.0014200499,0.00033621528,0.00022189508,0.000026990449,0.00006775825,0.00084893615],"genre_scores_gemma":[0.17374901,0.000019014027,0.82438576,0.0003011872,0.00022220274,0.00007468396,0.00003264788,0.000009235653,0.0012062315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992189,0.000016699243,0.00022975879,0.0002194622,0.00013791322,0.00017728368],"domain_scores_gemma":[0.99930495,0.000106167085,0.00008676988,0.00025061922,0.00018695727,0.000064551525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014266741,0.00008530902,0.0001156534,0.00010725708,0.00010471492,0.000036692316,0.0002936294,0.000041210784,0.00006254566],"category_scores_gemma":[0.000046377918,0.000084720305,0.00008095412,0.00036902417,0.000026920878,0.0002897378,0.000058800357,0.000045675064,0.00002257661],"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.0000057868438,0.0003821985,0.000010870528,0.000037078247,0.00006666752,0.000002208683,0.0005524357,0.0007573017,0.0034831925,0.114957966,0.011594798,0.8681495],"study_design_scores_gemma":[0.00042979454,0.00015435506,0.0000945829,0.000006247076,0.000007518583,0.000008994961,0.0000066787884,0.95288515,0.01794591,0.014368079,0.013975249,0.000117451134],"about_ca_topic_score_codex":0.000005361389,"about_ca_topic_score_gemma":0.0000012739678,"teacher_disagreement_score":0.9521278,"about_ca_system_score_codex":0.000019269275,"about_ca_system_score_gemma":0.00002234967,"threshold_uncertainty_score":0.34547937},"labels":[],"label_agreement":null},{"id":"W2139322641","doi":"10.1007/s00453-002-0978-1","title":"Sharp Quantum versus Classical Query Complexity Separations","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Simple (philosophy); Noncommutative geometry; Quantum complexity theory; Mathematics; Quantum algorithm; Quantum; Theory of computation; Bounded function; Polynomial; Fourier transform; Quantum Fourier transform; Discrete mathematics; Algorithm; Quantum error correction; Pure mathematics; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.05649716913227652,"score_gpt":0.2721984185858378,"score_spread":0.21570124945356128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139322641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025142314,0.0003804601,0.9344962,0.02595292,0.0033934382,0.00032416882,0.000034645873,0.0014016862,0.008874169],"genre_scores_gemma":[0.80964404,0.000014195045,0.18784331,0.0007408838,0.00086985365,0.000024263025,0.000013791224,0.000033844804,0.0008158162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788475,0.00011961202,0.00033368904,0.0006572817,0.0004246703,0.0005799702],"domain_scores_gemma":[0.99844146,0.00029409715,0.00010096493,0.0008364773,0.000084224914,0.00024276187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016551369,0.00026573602,0.00027618767,0.00013113268,0.00045349557,0.0002708313,0.0011682361,0.00011222285,0.00014843738],"category_scores_gemma":[0.00006166148,0.00024548423,0.00016845053,0.0005913538,0.00018350089,0.00030166176,0.00040762674,0.0004454217,0.0005749934],"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.000021886352,0.0006507663,0.000033517557,0.000019882853,0.00013089344,0.00016509485,0.0014935677,0.0015708569,0.00022707756,0.5991063,0.06604583,0.33053428],"study_design_scores_gemma":[0.0006287274,0.00017988637,0.00048027225,0.000010302266,0.00000840562,0.000048824517,0.000010109026,0.9448655,0.000103575025,0.00758643,0.045760714,0.00031722727],"about_ca_topic_score_codex":0.0000319437,"about_ca_topic_score_gemma":0.0000124687285,"teacher_disagreement_score":0.94329464,"about_ca_system_score_codex":0.00005565028,"about_ca_system_score_gemma":0.00003835446,"threshold_uncertainty_score":0.99999976},"labels":[],"label_agreement":null},{"id":"W2139596748","doi":"10.1007/s00453-006-1217-y","title":"FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parallel computing; Computer science; Algorithm; Linear space; Parallel algorithm; Sequence (biology); Smith–Waterman algorithm; Space (punctuation); Theory of computation; Dynamic programming; Mathematics; Sequence alignment; Combinatorics","score_opus":0.014177439840698108,"score_gpt":0.2535281535787954,"score_spread":0.23935071373809727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139596748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41243598,0.005249903,0.57697135,0.001084725,0.0006378041,0.0012936085,0.00081941404,0.000028333581,0.0014788803],"genre_scores_gemma":[0.6772271,0.0004987566,0.31643367,0.00034403428,0.0017997773,0.00025372606,0.00031433374,0.00006375911,0.0030648329],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883986,0.000023275035,0.00021368799,0.00046405048,0.00010564057,0.00035348395],"domain_scores_gemma":[0.9995193,0.000016126998,0.00007375227,0.00023146327,0.0000848407,0.00007450031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011003249,0.00021643807,0.00019047348,0.000027895809,0.0001529344,0.00002840353,0.00013145943,0.00012038876,0.0000041032367],"category_scores_gemma":[0.000008830112,0.00021009477,0.00009567433,0.00004653751,0.00012874299,0.0000012346949,0.00014808025,0.00005053091,0.0000040692144],"study_design_candidate":"bench_or_experimental","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.000070869086,0.00016797431,0.0006602378,0.000035774312,0.00030507467,0.000012192015,0.00008348962,0.00045902218,0.8420986,0.0011647794,0.008090957,0.14685102],"study_design_scores_gemma":[0.0052818456,0.0016739732,0.0038646325,0.000030817006,0.00023099496,0.00017441847,0.00027280135,0.035942238,0.3690242,0.0063740597,0.57547927,0.0016507747],"about_ca_topic_score_codex":0.00010559085,"about_ca_topic_score_gemma":0.000025500747,"teacher_disagreement_score":0.5673883,"about_ca_system_score_codex":0.000015093769,"about_ca_system_score_gemma":0.000046235713,"threshold_uncertainty_score":0.8567416},"labels":[],"label_agreement":null},{"id":"W2139886628","doi":"10.1007/s00453-004-1137-7","title":"Universal Asymptotics for Random Tries and PATRICIA Trees","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; String (physics); Theory of computation; Node (physics); Space (punctuation); Random tree; Tree (set theory); Stack (abstract data type); Discrete mathematics; Distribution (mathematics); Random graph; Computer science; Algorithm; Mathematical analysis; Graph; Physics; Artificial intelligence","score_opus":0.025621114161523413,"score_gpt":0.2967978945032454,"score_spread":0.271176780341722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139886628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029739356,0.00019631964,0.99528766,0.00058771414,0.00009769434,0.00029657493,0.00010284509,0.00007047006,0.00038681817],"genre_scores_gemma":[0.35946798,0.00006196317,0.6388452,0.00017263675,0.00046819358,0.00003371381,0.000010952347,0.000040902418,0.000898445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992518,0.000012778766,0.00020218715,0.00018195849,0.00012668675,0.00022458345],"domain_scores_gemma":[0.9981997,0.0014460995,0.00006272763,0.00011530858,0.000088502515,0.000087636225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013815395,0.00012846058,0.00024383262,0.000044400265,0.000108610235,0.000032918753,0.00009450297,0.00007392373,0.00002786453],"category_scores_gemma":[0.00091535994,0.000110586385,0.00004773887,0.000082358405,0.000046805675,0.00006673823,0.000036489924,0.00007056455,0.0000065387267],"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.00018306194,0.000100631725,0.0000034684851,0.000079746,0.000060960516,0.0000032067187,0.00035191377,0.0000053851613,0.000057994603,0.7990136,0.0035778326,0.19656219],"study_design_scores_gemma":[0.0051984866,0.000344092,0.000014403466,0.000032573153,0.00024861246,0.00002151315,0.0003248789,0.16588141,0.0011309506,0.8098687,0.016610673,0.00032368983],"about_ca_topic_score_codex":0.0000030023793,"about_ca_topic_score_gemma":0.000011168923,"teacher_disagreement_score":0.35649404,"about_ca_system_score_codex":0.000024684135,"about_ca_system_score_gemma":0.000034721135,"threshold_uncertainty_score":0.4509582},"labels":[],"label_agreement":null},{"id":"W2142094448","doi":"10.1007/s00453-009-9311-6","title":"Stochastic Models for Budget Optimization in Search-Based Advertising","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Theory of computation; Probabilistic logic; Stochastic optimization; Mathematical optimization; Simple (philosophy); Budget constraint; Online advertising; Prefix; The Internet; Operations research; Mathematics; Algorithm; Economics; World Wide Web; Artificial intelligence","score_opus":0.021913556786185527,"score_gpt":0.2746936839958445,"score_spread":0.252780127209659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142094448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050623843,0.00003518183,0.99592996,0.0029426764,0.000067131514,0.00046104824,0.0000034723375,0.00012755768,0.00038232387],"genre_scores_gemma":[0.24007292,0.000003412503,0.7588964,0.00087410933,0.00002794162,0.000024477968,0.000019625675,0.00000883725,0.000072238865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988331,0.000053741394,0.00021437957,0.00032094755,0.00023530526,0.00034248084],"domain_scores_gemma":[0.99936575,0.000092882205,0.00003504658,0.00027158548,0.00013761494,0.000097148826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003010346,0.00010518768,0.00012805907,0.00022590252,0.00009641713,0.00012879386,0.00041963437,0.000057262496,0.000007893232],"category_scores_gemma":[0.00004255808,0.000108394896,0.000043462744,0.00047503505,0.000022836466,0.0005668239,0.000037519476,0.00010227335,0.000005152373],"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.0000068414593,0.000057332458,6.3779834e-7,0.0000040259865,0.0000015209906,0.0000015368395,0.00014040826,0.9523855,0.000025115163,0.009538709,0.000074951895,0.03776344],"study_design_scores_gemma":[0.0007891485,0.0001289541,0.000016319565,0.000026343538,0.0000013961956,0.0000014516891,0.0000064774113,0.9904012,0.00018802943,0.008282904,0.000027761414,0.00012999584],"about_ca_topic_score_codex":0.000010957159,"about_ca_topic_score_gemma":0.0000017220013,"teacher_disagreement_score":0.2400223,"about_ca_system_score_codex":0.000068411275,"about_ca_system_score_gemma":0.00012816954,"threshold_uncertainty_score":0.44202155},"labels":[],"label_agreement":null},{"id":"W2145866065","doi":"10.1007/s00453-012-9740-5","title":"Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Cover (algebra); Bounded function; Tree (set theory); Approximation algorithm; Theory of computation; Upper and lower bounds; Discrete mathematics; Graph; Algorithm","score_opus":0.023544572033005622,"score_gpt":0.23902169803769704,"score_spread":0.21547712600469143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145866065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012263502,0.0005090857,0.98865074,0.005037098,0.0008219147,0.0023662075,0.00003631702,0.00026585528,0.00108643],"genre_scores_gemma":[0.064609796,0.00019756993,0.92035073,0.0024330819,0.0010981152,0.0025480415,0.0000726058,0.00011105768,0.008578989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974835,0.00007951632,0.0004995798,0.0008207642,0.00042438865,0.00069226115],"domain_scores_gemma":[0.9975781,0.00074966234,0.00023102366,0.0009879546,0.00026762654,0.00018566899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005021424,0.00039070135,0.00037101688,0.00014321979,0.0006601274,0.0009549259,0.0012833405,0.00016529528,0.00008031005],"category_scores_gemma":[0.000090752415,0.00026176698,0.00020285301,0.00051237707,0.00031500938,0.0011946124,0.00044590063,0.00028162915,0.00013133691],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011392177,0.00014088875,0.000020295749,0.000057724985,0.00013292671,0.0000017331663,0.0007339786,0.000027093964,0.00095003773,0.01432289,0.007635618,0.97596544],"study_design_scores_gemma":[0.0013662683,0.00025316197,0.0010077503,0.000023422379,0.000038715036,0.000034562745,0.000051051225,0.8953127,0.0013656714,0.06091336,0.039198857,0.00043446897],"about_ca_topic_score_codex":0.00026214513,"about_ca_topic_score_gemma":0.00002214433,"teacher_disagreement_score":0.9755309,"about_ca_system_score_codex":0.00006761979,"about_ca_system_score_gemma":0.00010112564,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W2147026670","doi":"10.1007/s00453-010-9430-0","title":"Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"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":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Delaunay triangulation; Bowyer–Watson algorithm; Constrained Delaunay triangulation; Leverage (statistics); Preprocessor; Theory of computation; Computer science; Point set triangulation; Pitteway triangulation; Computation; Set (abstract data type); Minimum-weight triangulation; Mathematics; Algorithm; Combinatorics; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.010255348993698373,"score_gpt":0.2685664990955038,"score_spread":0.2583111501018054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147026670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056294434,0.000058274352,0.94173694,0.000875247,0.00051482837,0.00023860001,0.0000052644396,0.00008679229,0.00018959932],"genre_scores_gemma":[0.5920597,0.0000013557658,0.40723172,0.00018199426,0.00027286788,0.000033054246,0.000014588375,0.000005905685,0.00019881857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991887,0.00001713397,0.00017440642,0.00033876384,0.00013174984,0.00014920853],"domain_scores_gemma":[0.9992749,0.0001947061,0.00007026996,0.00022895161,0.00014928317,0.00008187853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030076795,0.00008973628,0.0000968584,0.00008613522,0.0001903771,0.00017547507,0.00019976521,0.000060997303,0.000009995492],"category_scores_gemma":[0.00014021748,0.00008730297,0.000036124427,0.00021300658,0.0000234401,0.0004138571,0.000073613235,0.00008310725,0.0000057673606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014284498,0.000040121304,0.000016852666,0.000011509322,0.000010137539,0.0000010515388,0.0002152494,0.00008470999,0.013756359,0.023297345,0.00032675025,0.9622256],"study_design_scores_gemma":[0.0012086757,0.000096829535,0.004960474,0.000008072359,0.00001313393,0.00005728023,0.000010415506,0.83123696,0.030344974,0.12131574,0.010493654,0.00025377414],"about_ca_topic_score_codex":0.0000016902303,"about_ca_topic_score_gemma":0.000004054708,"teacher_disagreement_score":0.9619719,"about_ca_system_score_codex":0.000007641361,"about_ca_system_score_gemma":0.000062075975,"threshold_uncertainty_score":0.35601118},"labels":[],"label_agreement":null},{"id":"W2149356828","doi":"10.1007/s00453-013-9840-x","title":"Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Universal hashing; Dynamic perfect hashing; K-independent hashing; Double hashing; Hash function; Perfect hash function; Computer science; Hash table; Mathematical proof; Constant (computer programming); Theoretical computer science; Theory of computation; Mathematics; Discrete mathematics; Combinatorics; Algorithm; Programming language","score_opus":0.007133839550742515,"score_gpt":0.20254706877188305,"score_spread":0.19541322922114054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149356828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077636294,0.00019802692,0.9200742,0.000752813,0.00017477058,0.00063055067,0.000024655274,0.00019864268,0.00031002087],"genre_scores_gemma":[0.3833842,0.00003090556,0.61529833,0.00047890865,0.00018027521,0.0003029624,0.000026002712,0.000033495748,0.00026491596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841833,0.000029285951,0.00021858874,0.000601639,0.0002939425,0.00043820703],"domain_scores_gemma":[0.99874663,0.00022121616,0.00009361291,0.00060477963,0.00016115338,0.00017263203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001738327,0.00021971489,0.0002275252,0.000103446466,0.0003150369,0.0005225665,0.0006387259,0.00006428602,0.0000129434575],"category_scores_gemma":[0.000027324022,0.0001628778,0.00004002896,0.0002339062,0.00006541657,0.00066360075,0.0004400061,0.000126586,0.000037967235],"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.00003758291,0.00041021293,0.00031725137,0.00011883406,0.00009975019,0.000023526183,0.0029312992,0.0006512575,0.0029224276,0.030715534,0.017434066,0.94433826],"study_design_scores_gemma":[0.0012347755,0.00039052902,0.0021716475,0.00009705439,0.000016508786,0.00004702029,0.0003800493,0.97241056,0.0021782178,0.0013690318,0.019201934,0.00050264696],"about_ca_topic_score_codex":0.000272475,"about_ca_topic_score_gemma":0.000007438633,"teacher_disagreement_score":0.9717593,"about_ca_system_score_codex":0.000025815369,"about_ca_system_score_gemma":0.000049877355,"threshold_uncertainty_score":0.6641964},"labels":[],"label_agreement":null},{"id":"W2151957880","doi":"10.1007/s00453-008-9164-4","title":"Note on the Structure of Kruskal’s Algorithm","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Kruskal's algorithm; Graph; Discrete mathematics; Euclidean geometry; Binary tree; Algorithm; Spanning tree","score_opus":0.02474790281183501,"score_gpt":0.27140896362348016,"score_spread":0.24666106081164516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151957880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96724296,0.0001828249,0.015210721,0.0011992193,0.0016342078,0.0008517862,0.00038222957,0.00022713533,0.013068936],"genre_scores_gemma":[0.9527676,0.000022733637,0.045943163,0.00045368928,0.00032428151,0.0000033861056,0.000004549264,0.000038449703,0.00044214076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865425,0.00010588665,0.00032161438,0.00023896727,0.0004088168,0.0002704825],"domain_scores_gemma":[0.9981122,0.0008494737,0.00016860955,0.0007174874,0.00009164757,0.00006058717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014971397,0.00021619583,0.00029509887,0.00007724639,0.00038430694,0.000007785011,0.00047690477,0.00014094979,0.0003640308],"category_scores_gemma":[0.0002320321,0.00012525963,0.00016432845,0.00021054097,0.00034349516,0.0000455962,0.0001175665,0.00034299016,0.000009846543],"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.000052138636,0.00014343958,0.000075367716,0.000045656165,0.00020880446,0.000054650856,0.004888979,0.000008665574,0.002584357,0.8981498,0.018767692,0.07502047],"study_design_scores_gemma":[0.00044208133,0.0001544556,0.00062585034,0.000034535202,0.0000462985,0.00013687386,0.000115446965,0.0009835729,0.0628492,0.9288651,0.005461892,0.00028470778],"about_ca_topic_score_codex":0.000012034802,"about_ca_topic_score_gemma":0.0000017511435,"teacher_disagreement_score":0.07473576,"about_ca_system_score_codex":0.000021896605,"about_ca_system_score_gemma":0.000035361456,"threshold_uncertainty_score":0.5107939},"labels":[],"label_agreement":null},{"id":"W2155530897","doi":"10.1007/s00453-007-9029-2","title":"Choosing a Random Peer in Chord","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Peer-to-peer; Distributed hash table; Chord (peer-to-peer); Latency (audio); Hash table; Binary logarithm; Consistent hashing; Theoretical computer science; Fault tolerance; Distributed computing; Hash function; Algorithm; Discrete mathematics; Mathematics","score_opus":0.010186754765782775,"score_gpt":0.2626221448864828,"score_spread":0.2524353901207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155530897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04573036,0.00015285537,0.93926847,0.008524622,0.0005552342,0.00026984746,0.0000010327982,0.00076894753,0.00472866],"genre_scores_gemma":[0.65804267,0.000004668942,0.34042197,0.00074828265,0.00014488355,0.000016987176,0.0000013796198,0.000013630242,0.0006055042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818283,0.000025549556,0.00028808872,0.00044806977,0.00043204753,0.000623393],"domain_scores_gemma":[0.99890256,0.00017924719,0.000049126862,0.0006717859,0.00009057756,0.00010668833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011572978,0.00015701712,0.00021499142,0.00038166885,0.00006627202,0.00011604816,0.0013222136,0.00011631933,0.0000059121435],"category_scores_gemma":[0.00024849366,0.00015266694,0.000051977342,0.0012913538,0.000043571992,0.00028141338,0.00049334776,0.00028544824,0.00014941499],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022250895,0.00005833325,0.0008266002,0.0000031349075,0.000011169431,0.00018320583,0.0005439148,0.00010843107,0.00076345354,0.004919841,0.008191553,0.9843681],"study_design_scores_gemma":[0.011040113,0.00055777945,0.101188354,0.00031895778,0.000024976269,0.00035488175,0.0004288193,0.17365411,0.07814812,0.06434283,0.56702924,0.0029118364],"about_ca_topic_score_codex":0.00007011327,"about_ca_topic_score_gemma":0.00006811626,"teacher_disagreement_score":0.9814563,"about_ca_system_score_codex":0.00011248857,"about_ca_system_score_gemma":0.000034692468,"threshold_uncertainty_score":0.6225577},"labels":[],"label_agreement":null},{"id":"W2155992938","doi":"10.1007/s00453-014-9881-9","title":"Linear-Space Data Structures for Range Minority Query in Arrays","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Range query (database); Data structure; Query optimization; Range (aeronautics); Preprocessor; Linear space; Mathematics; Computer science; Combinatorics; Algorithm; Web search query; Sargable; Data mining; Search engine; Information retrieval","score_opus":0.033027681919376356,"score_gpt":0.28630230316188354,"score_spread":0.2532746212425072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155992938","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014111147,0.00018094928,0.9954779,0.0011920533,0.0006887779,0.00029653544,0.0001344353,0.00012929563,0.0004888954],"genre_scores_gemma":[0.055255186,0.000022609272,0.9427999,0.0004482352,0.00096957595,0.000034981433,0.00025442248,0.000019615767,0.00019547128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981591,0.00009004159,0.00027495882,0.00078964065,0.00027151717,0.00041471823],"domain_scores_gemma":[0.9973828,0.0003069689,0.00010083624,0.002019216,0.00006821774,0.00012195004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004731663,0.00020065131,0.00027168184,0.000104536855,0.0001334257,0.0001250293,0.00248622,0.000115292976,0.000010293186],"category_scores_gemma":[0.00018765623,0.00017390159,0.000049547016,0.00026018568,0.000048413967,0.00085294555,0.001082223,0.0002015539,0.000019868328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052397747,0.00024454846,0.00132235,0.00011757027,0.000039195216,0.000022135515,0.0004376281,0.00023030902,0.0009527895,0.08491435,0.054851007,0.8568157],"study_design_scores_gemma":[0.0008910904,0.000074570446,0.0036904693,0.000022152852,0.000007265144,0.000010580617,0.000010979699,0.85528153,0.0007121215,0.015937183,0.12306113,0.00030094924],"about_ca_topic_score_codex":0.00032304332,"about_ca_topic_score_gemma":0.00006828633,"teacher_disagreement_score":0.85651475,"about_ca_system_score_codex":0.000027804434,"about_ca_system_score_gemma":0.000064754786,"threshold_uncertainty_score":0.7091501},"labels":[],"label_agreement":null},{"id":"W2156300926","doi":"10.1007/s00453-011-9503-8","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Vertex (graph theory); Clique graph; Unit disk graph; Clique; Upper and lower bounds; Adjacency matrix; Discrete mathematics; Unit disk; Graph; Line graph; Computer science; Graph power","score_opus":0.08879720214434278,"score_gpt":0.26280306556968097,"score_spread":0.1740058634253382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156300926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023522178,0.00015278284,0.9698039,0.0007789956,0.0009939072,0.0007407198,0.00004939874,0.00032678223,0.0036313066],"genre_scores_gemma":[0.4380871,0.000052920193,0.560497,0.000550287,0.00016193044,0.00033915698,0.000033978202,0.00003303489,0.0002445711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998183,0.000092857634,0.00040036943,0.0005743761,0.00020896882,0.0005404197],"domain_scores_gemma":[0.9988402,0.00016282816,0.00011102427,0.0006398171,0.000104768726,0.0001413192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004244748,0.00022427751,0.00025824286,0.00031008504,0.00016568927,0.000085144435,0.0009977303,0.00012302626,0.000046798294],"category_scores_gemma":[0.000048706497,0.00022735645,0.00017063129,0.0008272419,0.00012677444,0.0005376314,0.00021652259,0.00022104669,0.000038071914],"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.000072104864,0.00089420885,0.0014852304,0.00006440827,0.00007367969,0.00007703573,0.00316411,0.000054637112,0.0003013097,0.81519246,0.00237837,0.17624244],"study_design_scores_gemma":[0.0016571509,0.00065161224,0.016287902,0.000111297195,0.000027603559,0.000047607464,0.00020039457,0.23648223,0.005009779,0.7262727,0.012360335,0.000891386],"about_ca_topic_score_codex":0.00020001392,"about_ca_topic_score_gemma":0.00017755922,"teacher_disagreement_score":0.41456494,"about_ca_system_score_codex":0.000029742709,"about_ca_system_score_gemma":0.000068622634,"threshold_uncertainty_score":0.9271327},"labels":[],"label_agreement":null},{"id":"W2164903952","doi":"10.1007/s00453-012-9701-z","title":"Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Iterated function; Linear programming relaxation; Vertex (graph theory); Discrete mathematics; Reachability; Approximation algorithm; Packing problems; Steiner tree problem; Tree (set theory); Theory of computation; Graph; Linear programming; Mathematical optimization; Algorithm","score_opus":0.017987103305355853,"score_gpt":0.23938084254718464,"score_spread":0.22139373924182879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164903952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17878553,0.0002966765,0.8194151,0.00027105017,0.000588804,0.00015931219,0.000004851257,0.00016151945,0.00031713254],"genre_scores_gemma":[0.8519924,0.00001623175,0.14772484,0.00010985027,0.0001173377,0.0000104344645,0.000006300592,0.000007911285,0.0000146869415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988468,0.00009172147,0.00023062836,0.00027352554,0.00017630284,0.00038100194],"domain_scores_gemma":[0.9993076,0.00014902583,0.0000730448,0.00032220848,0.000033695218,0.00011447639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038948754,0.00014469151,0.00016681674,0.00015979372,0.0001319774,0.00012319522,0.00029781423,0.0000715927,0.000010026215],"category_scores_gemma":[0.00004803251,0.00014730661,0.0000365305,0.0004555464,0.000050339826,0.0010651082,0.00024585542,0.00020835288,0.000017203936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075197986,0.00022465033,0.012607458,0.000020859447,0.00002097619,0.000015902708,0.0049569146,0.00033074146,0.0010382769,0.0064115208,0.0000858398,0.97427934],"study_design_scores_gemma":[0.00048304477,0.000029218541,0.05077709,0.000038366987,0.0000037110108,0.000033157805,0.000030338771,0.94226307,0.0011202147,0.0038951775,0.0010986634,0.00022795968],"about_ca_topic_score_codex":0.000101667574,"about_ca_topic_score_gemma":0.000037662736,"teacher_disagreement_score":0.97405136,"about_ca_system_score_codex":0.000053248197,"about_ca_system_score_gemma":0.000012847913,"threshold_uncertainty_score":0.6006989},"labels":[],"label_agreement":null},{"id":"W2169139983","doi":"10.1007/s00453-010-9482-1","title":"Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Theory of computation; Convergence (economics); Computer science; Extension (predicate logic); Mathematical optimization; Protocol (science); Matching (statistics); Set (abstract data type); Routing (electronic design automation); Mathematical economics; Algorithm; Mathematics; Statistics","score_opus":0.029436439220455333,"score_gpt":0.3356869945606882,"score_spread":0.3062505553402328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169139983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380536,0.0000081831,0.05608904,0.0032830967,0.00015002539,0.000407924,0.00009521984,0.000080371596,0.0018325376],"genre_scores_gemma":[0.99073607,0.0000028017307,0.008273756,0.00020107717,0.0000824529,0.00012501309,0.000040472136,0.000010896835,0.0005274803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982048,0.00006298236,0.0003992638,0.0005206119,0.0005467696,0.0002655297],"domain_scores_gemma":[0.997854,0.00070743513,0.00012541316,0.0006748289,0.0004627017,0.00017562558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008964225,0.00013403907,0.00018640303,0.00012096381,0.00010533952,0.00013667201,0.0007961925,0.000078101235,0.00040930175],"category_scores_gemma":[0.0009821915,0.000098001925,0.000022310896,0.0023148737,0.00012023843,0.00029696766,0.00009145825,0.00020378394,0.00068125967],"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.000939726,0.002158884,0.080453224,0.00010553893,0.00010455922,0.00009104559,0.008330899,0.00039088298,0.18731435,0.1601933,0.054567054,0.50535053],"study_design_scores_gemma":[0.0023371333,0.00057258,0.1543797,0.00013939249,0.00005855208,0.00014894833,0.002293071,0.022735748,0.10338622,0.39408907,0.31812,0.0017395908],"about_ca_topic_score_codex":0.0000582031,"about_ca_topic_score_gemma":0.0007229029,"teacher_disagreement_score":0.50361097,"about_ca_system_score_codex":0.000017684983,"about_ca_system_score_gemma":0.00021807176,"threshold_uncertainty_score":0.87564415},"labels":[],"label_agreement":null},{"id":"W2170243444","doi":"10.1007/s00453-010-9465-2","title":"Geometric Spanners for Weighted Point Sets","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Danmarks Grundforskningsfond; Center for Massive Data Algorithmics; Technische Universität Dortmund; National Research Foundation; Australian Government","keywords":"Combinatorics; Mathematics; Geodesic; Metric space; Bounded function; Boundary (topology); Euclidean space; Dimension (graph theory); Regular polygon; Convex body; Function (biology); Discrete mathematics; Convex hull; Geometry; Mathematical analysis","score_opus":0.01012109591005427,"score_gpt":0.25234805686041034,"score_spread":0.24222696095035606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170243444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024705486,0.00003630974,0.97023845,0.0024128577,0.0015881817,0.00022277041,0.000009079245,0.00013790136,0.00064896507],"genre_scores_gemma":[0.38168666,0.0000027174317,0.61676985,0.00061426155,0.00036814873,0.000043735465,0.000041277177,0.000009309713,0.00046405933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907225,0.000015421912,0.00016726549,0.0003174558,0.00019899526,0.00022861524],"domain_scores_gemma":[0.9991634,0.0001948621,0.00006062835,0.00030054024,0.0001771949,0.00010339705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002680749,0.000103777755,0.000103727194,0.00032388972,0.00014288216,0.00011284578,0.00042723387,0.00006564138,0.00003116596],"category_scores_gemma":[0.000094875075,0.00009875748,0.00007273501,0.00095247594,0.00002038802,0.00031825434,0.000086624066,0.00012582695,0.00007206076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061277647,0.00009750832,0.000026645015,0.000009642297,0.000028080356,0.000004815997,0.000107332555,0.00018268847,0.0051654777,0.07977828,0.015944768,0.8986486],"study_design_scores_gemma":[0.00085315225,0.00017463215,0.0019235235,0.000004341211,0.00001228415,0.000040718864,0.000008522653,0.793556,0.037904706,0.06818645,0.096954934,0.00038074373],"about_ca_topic_score_codex":0.0000067649316,"about_ca_topic_score_gemma":0.000003765873,"teacher_disagreement_score":0.89826787,"about_ca_system_score_codex":0.000015844656,"about_ca_system_score_gemma":0.00007359844,"threshold_uncertainty_score":0.40272135},"labels":[],"label_agreement":null},{"id":"W2180689556","doi":"10.1007/s00453-011-9540-3","title":"Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Disjoint sets; Planar graph; Mathematics; Approximation algorithm; Discrete mathematics; Graph","score_opus":0.030268888774087295,"score_gpt":0.22878516744079802,"score_spread":0.19851627866671073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180689556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06507426,0.000918019,0.92162,0.00013950058,0.0006761128,0.0023420425,0.00039589257,0.0016897295,0.007144416],"genre_scores_gemma":[0.8589651,0.000133033,0.14024033,0.00003285516,0.0000937256,0.00029526593,0.00011193013,0.00005841042,0.00006935612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898607,0.000019674928,0.00034735777,0.00024490818,0.00010698185,0.00029502818],"domain_scores_gemma":[0.9996353,0.00003719557,0.000045845307,0.00018799736,0.000032684613,0.0000610161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029074244,0.00018307389,0.00021196768,0.00020902943,0.0000450986,0.000028962382,0.0001127567,0.00010631595,0.000005534758],"category_scores_gemma":[0.00001982319,0.00017683009,0.00004578249,0.00015542736,0.00003120848,0.00020040364,0.000017147413,0.00011297039,0.000002597385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025271287,0.00029204864,0.0010388736,0.0004198598,0.00025185675,0.00005741125,0.009376421,0.0001257467,0.026090544,0.009364454,0.011971599,0.94075847],"study_design_scores_gemma":[0.0074158106,0.0009235389,0.01574159,0.0004934729,0.00013079772,0.000051851504,0.0014997157,0.5737147,0.32917702,0.059207845,0.009550546,0.002093141],"about_ca_topic_score_codex":0.00006332905,"about_ca_topic_score_gemma":0.000039102637,"teacher_disagreement_score":0.93866533,"about_ca_system_score_codex":0.000036913927,"about_ca_system_score_gemma":0.000006686973,"threshold_uncertainty_score":0.72109216},"labels":[],"label_agreement":null},{"id":"W2281178725","doi":"10.1007/s00453-015-0104-9","title":"Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Zero (linguistics); Merlin (protein); Zero-knowledge proof; Computer science; Ground zero; Physics; Philosophy; Algorithm; Biology; Linguistics","score_opus":0.01020371742461373,"score_gpt":0.24572306962393312,"score_spread":0.23551935219931938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281178725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43998718,0.0011128588,0.47619918,0.008520292,0.00018403429,0.033185262,0.00013495484,0.0067832456,0.033893015],"genre_scores_gemma":[0.9832817,0.00029252394,0.013410197,0.000050908,0.000007819921,0.0029130932,0.000015097755,0.000014681268,0.00001402966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993209,0.000057921912,0.00029945103,0.000074546224,0.000103194754,0.00014397808],"domain_scores_gemma":[0.9991744,0.00008703783,0.000046633693,0.00060220505,0.000048012644,0.00004172046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002738848,0.00010294416,0.00012624396,0.00012451713,0.00004125282,0.000039142546,0.0002822569,0.00009179578,0.000017001359],"category_scores_gemma":[0.000040391817,0.00008889879,0.00001769196,0.00014007065,0.0000645644,0.0006999518,0.00010039496,0.00013907059,0.000043619868],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009762881,0.000041097555,0.0013403666,0.00005680202,0.000013252735,5.59242e-7,0.0008798286,0.000027247355,0.0031429646,0.012379637,0.0018375022,0.980271],"study_design_scores_gemma":[0.006741196,0.000264604,0.09068636,0.002526549,0.000025729985,0.000055151508,0.00030576452,0.12029449,0.20340168,0.11984271,0.4534917,0.0023640862],"about_ca_topic_score_codex":0.000028394266,"about_ca_topic_score_gemma":0.000035373905,"teacher_disagreement_score":0.9779069,"about_ca_system_score_codex":0.000082559374,"about_ca_system_score_gemma":0.000010516118,"threshold_uncertainty_score":0.36251876},"labels":[],"label_agreement":null},{"id":"W2281191978","doi":"10.1007/s00453-015-0086-7","title":"I/O-Efficient Path Traversal in Succinct Planar Graphs","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Path (computing); Traverse; Tree traversal; Mathematics; Block (permutation group theory); Bounded function; Graph traversal; Graph; Terrain; Binary logarithm; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.018977108103582257,"score_gpt":0.23773516463062544,"score_spread":0.2187580565270432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281191978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24056712,0.00012297531,0.7565541,0.00064839417,0.0007040073,0.00014199245,0.0000042003976,0.00009561083,0.0011615502],"genre_scores_gemma":[0.9522056,0.0000016774975,0.047420915,0.00020424263,0.00007732161,0.0000081253875,0.000013760878,0.0000043439363,0.00006402484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990566,0.000055502016,0.00016710947,0.00022857571,0.0002948658,0.00019737196],"domain_scores_gemma":[0.9995235,0.00004774334,0.00003735521,0.00020134855,0.00006775512,0.00012228185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031934318,0.0000916605,0.00009970134,0.00020157894,0.000040165065,0.000054140895,0.00030778782,0.000040243074,0.0000054611046],"category_scores_gemma":[0.000017660577,0.000088891284,0.000035305904,0.0006547628,0.000015566118,0.00009728762,0.00005010917,0.000086251974,0.00007244985],"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.000071703595,0.0009021754,0.0026309225,0.000018070932,0.0000489606,0.00033346846,0.008625713,0.30537996,0.00055793836,0.3009609,0.01200904,0.36846116],"study_design_scores_gemma":[0.0006528361,0.0001285705,0.005292827,0.0000071013683,0.0000021575295,0.000029161522,0.00007859951,0.98267764,0.00035961333,0.00809049,0.0025228187,0.00015815998],"about_ca_topic_score_codex":0.0000842906,"about_ca_topic_score_gemma":0.000022892154,"teacher_disagreement_score":0.71163845,"about_ca_system_score_codex":0.000054934113,"about_ca_system_score_gemma":0.00012364703,"threshold_uncertainty_score":0.36248815},"labels":[],"label_agreement":null},{"id":"W2296336213","doi":"10.1007/s00453-018-0411-z","title":"Self-Stabilizing Balls and Bins in Batches","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ball (mathematics); Server; Combinatorics; Lambda; Load balancing (electrical power); Exponential distribution; Mathematics; Bin; Discrete mathematics; Computer science; Algorithm; Physics; Mathematical analysis","score_opus":0.006921480146948752,"score_gpt":0.2239426863389863,"score_spread":0.21702120619203757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296336213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40184623,0.0011635273,0.57142395,0.002885837,0.0015665239,0.00061975693,0.000028424693,0.0007315847,0.019734185],"genre_scores_gemma":[0.94446474,0.0000147093815,0.055160195,0.00014308446,0.0001327703,0.000009632678,0.0000011002227,0.000005803263,0.00006798389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990739,0.000036226433,0.00018300279,0.00032712804,0.00012868481,0.00025104772],"domain_scores_gemma":[0.9994764,0.000048861522,0.000040482813,0.00031070792,0.000050909595,0.00007264429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002316085,0.00009823392,0.00014112492,0.00005956106,0.00007029897,0.00011754147,0.0003575993,0.00005294233,0.000005463214],"category_scores_gemma":[0.000017354387,0.0000900961,0.000020367974,0.00033590628,0.000052649077,0.00030791687,0.00014906489,0.00007836488,0.000058139565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017730552,0.00069501897,0.028599923,0.00022525783,0.00010997491,0.00021157136,0.018929116,0.000011253399,0.0048231143,0.14679053,0.00694369,0.79264283],"study_design_scores_gemma":[0.0019800146,0.0004046865,0.058002733,0.00021548914,0.00001092947,0.0001351901,0.00043456722,0.6269609,0.0080698915,0.0069708987,0.2957463,0.001068411],"about_ca_topic_score_codex":0.00007740691,"about_ca_topic_score_gemma":0.000040249528,"teacher_disagreement_score":0.7915744,"about_ca_system_score_codex":0.000023023711,"about_ca_system_score_gemma":0.0000352214,"threshold_uncertainty_score":0.36740124},"labels":[],"label_agreement":null},{"id":"W2335338794","doi":"10.1007/s00453-016-0146-7","title":"Biased Predecessor Search","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Sublinear function; Entropy (arrow of time); Computer science; Logarithm; Mathematics; Data structure; Theory of computation; Theoretical computer science; Discrete mathematics; Algorithm; Physics","score_opus":0.017181617998753437,"score_gpt":0.24480148613027702,"score_spread":0.22761986813152357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335338794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035782207,0.000078989535,0.9907901,0.0030577495,0.00039828036,0.00012350961,0.000025531384,0.00029718236,0.0016504081],"genre_scores_gemma":[0.53786063,0.000085580374,0.45576423,0.0007512288,0.0006572008,0.000051994954,0.000013578356,0.000039594404,0.004775915],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851644,0.0000661908,0.00018237198,0.00047270226,0.0003797732,0.0003825362],"domain_scores_gemma":[0.99862957,0.00018152667,0.000042667023,0.0008941615,0.00008591428,0.0001661357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023338076,0.00013334391,0.00013525275,0.00009431661,0.00013509349,0.00011967171,0.0012593489,0.00006326395,0.00012182214],"category_scores_gemma":[0.000039136637,0.0000794296,0.000055979257,0.00027710348,0.000057840625,0.0007739418,0.00058991683,0.00007981919,0.0006326485],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004847415,0.000058724167,0.00007605095,0.0000035878847,0.00001175516,0.000026875092,0.000064961896,0.0000017661317,0.0060956907,0.010488495,0.008308404,0.9748588],"study_design_scores_gemma":[0.005127528,0.00069750106,0.010929727,0.00039756767,0.00002183185,0.00018816035,0.000042464406,0.23158842,0.30085278,0.029613897,0.4186902,0.0018499233],"about_ca_topic_score_codex":0.00002992569,"about_ca_topic_score_gemma":0.0000010020049,"teacher_disagreement_score":0.97300893,"about_ca_system_score_codex":0.000035475234,"about_ca_system_score_gemma":0.00007064519,"threshold_uncertainty_score":0.81316274},"labels":[],"label_agreement":null},{"id":"W2414522820","doi":"10.1007/s00453-016-0170-7","title":"Succinct Indices for Path Minimum, with Applications","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Ackermann function; Path (computing); Combinatorics; Mathematics; Range query (database); Constant (computer programming); Discrete mathematics; Tree traversal; Range (aeronautics); Tree (set theory); Data structure; Inverse; Sigma; Node (physics); Computer science; Algorithm","score_opus":0.009513887450547032,"score_gpt":0.2270798350867203,"score_spread":0.21756594763617326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414522820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037179,0.000041062987,0.9949815,0.0023092623,0.00009694388,0.0005471658,0.000059880793,0.00020557524,0.0013868063],"genre_scores_gemma":[0.095867865,0.000043269825,0.89662665,0.0006869822,0.00055525434,0.0011675105,0.000054663364,0.000036970257,0.004960806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988847,0.000010244258,0.0001513494,0.0004539205,0.00019650714,0.0003032991],"domain_scores_gemma":[0.9989547,0.00014491136,0.000089183864,0.000660213,0.000065287,0.00008571386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016438308,0.00013560193,0.00012563782,0.00009476365,0.00014201534,0.0001233849,0.00105766,0.000033001943,0.00001526594],"category_scores_gemma":[0.000008766026,0.00008050663,0.000042437096,0.00028221973,0.000052913118,0.0007133758,0.00020169551,0.000033963555,0.00012643075],"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.0000063618513,0.00007209059,0.00016524798,0.000014284329,0.000043071755,0.000004882523,0.000045006404,3.6516062e-7,0.00016352982,0.100974664,0.0066955653,0.89181495],"study_design_scores_gemma":[0.0026964487,0.0005457137,0.0015985313,0.00007379038,0.000051788757,0.000018486153,0.00004526269,0.010565442,0.0036435344,0.029202674,0.95080185,0.0007564903],"about_ca_topic_score_codex":0.0000067132296,"about_ca_topic_score_gemma":0.0000037115433,"teacher_disagreement_score":0.9441063,"about_ca_system_score_codex":0.000020902839,"about_ca_system_score_gemma":0.000036128444,"threshold_uncertainty_score":0.3282965},"labels":[],"label_agreement":null},{"id":"W2426990689","doi":"10.1007/s00453-021-00799-7","title":"Range Majorities and Minorities in Arrays","year":2021,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Parameterized complexity; String (physics); Linear space; Combinatorics; Mathematics; Range (aeronautics); Space (punctuation); Function (biology); Time complexity; Polynomial; Constant (computer programming); Omega; Sigma; Alphabet; Discrete mathematics; Physics; Mathematical analysis; Computer science; Quantum mechanics","score_opus":0.015675739032133228,"score_gpt":0.23813348238730814,"score_spread":0.2224577433551749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2426990689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070101514,0.024144279,0.8924686,0.0024354542,0.0052843085,0.0008457819,0.00021621877,0.0005634198,0.0039404673],"genre_scores_gemma":[0.1449197,0.003292716,0.8474748,0.00075391395,0.0012556992,0.00028596717,0.00031635675,0.000078589386,0.0016222796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975728,0.00013122914,0.00042310986,0.0010339322,0.00039558168,0.00044336845],"domain_scores_gemma":[0.998341,0.00013920691,0.00013065927,0.001156281,0.000098575,0.00013425491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026994883,0.0003834176,0.0005399732,0.00024985863,0.00011075334,0.0007843581,0.0011741432,0.00033153116,0.00002686829],"category_scores_gemma":[0.000036169768,0.0003886388,0.00010135001,0.00020427081,0.000114131566,0.0005865348,0.004302324,0.00076272414,0.000008066376],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035327837,0.00066584034,0.0041677905,0.0017401921,0.0002445135,0.002661111,0.013738246,0.00027822034,0.00031359517,0.04482328,0.009176251,0.9221556],"study_design_scores_gemma":[0.00488173,0.00032969375,0.052102488,0.004933999,0.00012858523,0.00066267163,0.0036173805,0.76385814,0.004211473,0.121310174,0.03775396,0.0062097213],"about_ca_topic_score_codex":0.0009706804,"about_ca_topic_score_gemma":0.00008298827,"teacher_disagreement_score":0.9159459,"about_ca_system_score_codex":0.00006963328,"about_ca_system_score_gemma":0.00020502425,"threshold_uncertainty_score":0.99985653},"labels":[],"label_agreement":null},{"id":"W2466482888","doi":"10.1007/s00453-016-0169-0","title":"Strategyproof Mechanisms for Competitive Influence in Networks","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; David and Lucile Packard Foundation; National Science Foundation","keywords":"Computer science; Competition (biology); Theory of computation; Class (philosophy); Mathematical economics; Mechanism design; Mechanism (biology); Mathematical optimization; Greedy algorithm; Microeconomics; Mathematics; Economics; Artificial intelligence","score_opus":0.051681884203119866,"score_gpt":0.36067185616539643,"score_spread":0.30898997196227657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466482888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056129865,0.00002082404,0.93838066,0.001826604,0.0001058854,0.00046206676,0.00005845988,0.00003973057,0.00297592],"genre_scores_gemma":[0.9909063,0.000003477884,0.007587753,0.00022836971,0.00005445811,0.00015169455,0.0000018606388,0.000007672971,0.0010584258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868286,0.000085487845,0.0003544135,0.0003675774,0.00026190563,0.00024775576],"domain_scores_gemma":[0.9973319,0.0019039013,0.000106531224,0.00037526462,0.00020865799,0.0000737151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012428818,0.000094829666,0.00016644057,0.00009378522,0.00008135029,0.000064422835,0.0005455189,0.00006442905,0.00018461102],"category_scores_gemma":[0.0005280601,0.000057152552,0.000057364578,0.0003876296,0.00011092723,0.00023151249,0.00006151612,0.000061866755,0.00023633595],"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.000022593904,0.000037357146,0.00009208388,5.495035e-7,0.0000038552676,0.0000013527874,0.000050770206,0.0002536674,0.0033079917,0.8514871,0.00022605654,0.14451663],"study_design_scores_gemma":[0.00046423337,0.00006712227,0.0036239603,0.000020190027,0.0000032196776,0.0000027007698,0.00021530602,0.003573099,0.004704666,0.98126566,0.0059355833,0.00012427148],"about_ca_topic_score_codex":0.0000054131556,"about_ca_topic_score_gemma":0.000026190643,"teacher_disagreement_score":0.9347764,"about_ca_system_score_codex":0.000023687628,"about_ca_system_score_gemma":0.00003646868,"threshold_uncertainty_score":0.30376995},"labels":[],"label_agreement":null},{"id":"W2498333024","doi":"10.1007/s00453-016-0196-x","title":"Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson–Crick and Nussinov–Jacobson Energy Models","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Sequence (biology); Base (topology); Combinatorics; Base pair; Alphabet; Energy (signal processing); Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Closure (psychology); Mathematics; Physics; Algorithm; Discrete mathematics; DNA; Quantum mechanics","score_opus":0.012807560651577218,"score_gpt":0.2146504315483082,"score_spread":0.20184287089673097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498333024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18014383,0.001075382,0.81775093,0.00022525666,0.00023976834,0.00035364795,0.00004656122,0.000026972266,0.00013763056],"genre_scores_gemma":[0.90876526,0.00019636434,0.09060273,0.000072834504,0.00022437255,0.00004695704,0.000010188851,0.00003493976,0.000046351848],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99825245,0.0002574691,0.00032532727,0.0006184499,0.00016669826,0.00037960763],"domain_scores_gemma":[0.99929225,0.00009089383,0.00010644659,0.0003137344,0.000060910876,0.00013574956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043058384,0.00026534186,0.00028416578,0.00006202749,0.00010798995,0.00004798135,0.00016634539,0.00028833273,0.000016552425],"category_scores_gemma":[0.00010027147,0.00019698204,0.000043159485,0.00008207207,0.00013552181,0.000022133681,0.000152365,0.000076308446,8.3310897e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058074005,0.000032405325,0.000024152028,0.000011088169,0.000021274554,0.0000046434943,0.000042549676,0.000007082504,0.58022416,0.0014314025,0.000031067506,0.41811213],"study_design_scores_gemma":[0.0012771523,0.00030687705,0.00008826675,0.000044889206,0.000017718266,0.000031274303,0.000034064902,0.0075448803,0.86479145,0.12498724,0.0004988757,0.0003773089],"about_ca_topic_score_codex":0.000086446016,"about_ca_topic_score_gemma":0.0000068526997,"teacher_disagreement_score":0.7286214,"about_ca_system_score_codex":0.000030671654,"about_ca_system_score_gemma":0.00006188943,"threshold_uncertainty_score":0.80326945},"labels":[],"label_agreement":null},{"id":"W2509063142","doi":"10.1007/s00453-016-0199-7","title":"Full-Fledged Real-Time Indexing for Constant Size Alphabets","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Labex Bézout","keywords":"Search engine indexing; Constant (computer programming); Alphabet; Theory of computation; Combinatorics; Symbol (formal); String (physics); String searching algorithm; Matching (statistics); Mathematics; Pattern matching; Computer science; Algorithm; Discrete mathematics; Statistics; Information retrieval; Artificial intelligence","score_opus":0.010992617136929688,"score_gpt":0.24548944568049474,"score_spread":0.23449682854356504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509063142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034738493,0.00007847439,0.99053437,0.0018719368,0.0006652223,0.00042531075,0.000105196385,0.00043028648,0.0024153495],"genre_scores_gemma":[0.08429391,0.00011179635,0.9101056,0.0005034318,0.0008080706,0.00016196063,0.000022223481,0.0000645329,0.0039284993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804795,0.00006197461,0.0003539856,0.0006651849,0.00031447507,0.0005564329],"domain_scores_gemma":[0.9975579,0.0010205662,0.00015315154,0.00089427124,0.00016713943,0.00020699755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003951757,0.00023432153,0.0002962212,0.00007730331,0.0002486075,0.00013594197,0.0010949778,0.000116776195,0.00009947719],"category_scores_gemma":[0.0001938128,0.00015659157,0.00011558221,0.00021299916,0.00009485445,0.0007135755,0.0005050353,0.000082154336,0.00024670703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006953766,0.000118904594,0.000023323071,0.000015841651,0.00005748323,0.00003200263,0.0001519499,0.0000016090487,0.12459461,0.025011703,0.022462925,0.8274601],"study_design_scores_gemma":[0.015364458,0.0025562865,0.0015825625,0.0010574621,0.0001112739,0.00034368318,0.00008905158,0.3680813,0.14299084,0.123992614,0.340052,0.0037784355],"about_ca_topic_score_codex":0.000019977795,"about_ca_topic_score_gemma":0.0000017533027,"teacher_disagreement_score":0.82368165,"about_ca_system_score_codex":0.00007193412,"about_ca_system_score_gemma":0.00014304863,"threshold_uncertainty_score":0.6385619},"labels":[],"label_agreement":null},{"id":"W2535803352","doi":"10.1007/s00453-016-0233-9","title":"When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Mitacs; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Patrolling; Theory of computation; Eulerian path; Enhanced Data Rates for GSM Evolution; Mobile robot; Domain (mathematical analysis); Robot; Computer science; Graph; Line segment; Combinatorics; Mathematics; Line (geometry); Point (geometry); Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.03223269614456528,"score_gpt":0.2869592527689605,"score_spread":0.25472655662439525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535803352","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010700418,0.0001051635,0.9870412,0.0005773811,0.0006387708,0.00028574903,0.0000072731077,0.0002904379,0.00035363736],"genre_scores_gemma":[0.36771837,0.00009638925,0.6304913,0.0001594733,0.0003096865,0.00008259266,0.0000028010202,0.00003481042,0.00110457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835706,0.000108496155,0.00025949482,0.00044025775,0.00036635876,0.00046834786],"domain_scores_gemma":[0.99889725,0.00011918367,0.0000895116,0.00054626935,0.00015020651,0.00019756997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030249485,0.00016447627,0.00017918767,0.00016360519,0.0002212289,0.00016317832,0.00076025195,0.00007788366,0.00006721525],"category_scores_gemma":[0.00003070249,0.00012105967,0.00008158886,0.0003266995,0.000053730437,0.0007409621,0.0003166889,0.00013664232,0.00010992039],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011755257,0.00021526431,0.0046339575,0.000022882425,0.00012160491,0.00005438119,0.0017987327,0.008165415,0.018949317,0.002794816,0.0010938883,0.962138],"study_design_scores_gemma":[0.0042582103,0.0007091189,0.0021940104,0.00040127675,0.000045339348,0.000118342665,0.0002540838,0.92807984,0.027754791,0.01704941,0.017348386,0.0017872102],"about_ca_topic_score_codex":0.00006503605,"about_ca_topic_score_gemma":0.0000013307141,"teacher_disagreement_score":0.96035075,"about_ca_system_score_codex":0.000089608424,"about_ca_system_score_gemma":0.000069329304,"threshold_uncertainty_score":0.493667},"labels":[],"label_agreement":null},{"id":"W2566564112","doi":"10.1007/s00453-016-0263-3","title":"Geometric Path Problems with Violations","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Path (computing); Simple polygon; Mathematics; Polygon (computer graphics); Shortest path problem; Longest path problem; Vertex (graph theory); Intersection (aeronautics); Discrete mathematics; Geometry; Monotone polygon; Computer science; Graph","score_opus":0.009575151748726621,"score_gpt":0.2029150373385475,"score_spread":0.19333988558982088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566564112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066264635,0.00006857611,0.9902621,0.0015149812,0.00014514218,0.0001230033,0.000003957136,0.00013527187,0.0011204939],"genre_scores_gemma":[0.8433029,0.0000116402825,0.15550739,0.00014011649,0.00012534922,0.000028300354,0.0000048484094,0.000006403457,0.00087306014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999152,0.00002604803,0.0001295333,0.00027302065,0.0002432917,0.00017610485],"domain_scores_gemma":[0.99933857,0.00013036924,0.0000555831,0.00026557536,0.00013564766,0.00007428649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012411988,0.00008751807,0.00007678601,0.0002359627,0.00011368669,0.000066828885,0.00028449408,0.00002872657,0.000037031943],"category_scores_gemma":[0.000029335004,0.000052619587,0.000026476442,0.0011868007,0.000021826823,0.0004620179,0.00006633334,0.00003914288,0.00013900897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023825926,0.00006412258,0.0004267962,0.0000037490593,0.000020109997,0.0000055678547,0.00006286065,0.00056987145,0.0013766644,0.031443115,0.0010341413,0.9649906],"study_design_scores_gemma":[0.007017518,0.0025776841,0.15211397,0.00037150033,0.00007607592,0.00057113933,0.000031948122,0.3868539,0.042959105,0.09931145,0.30535597,0.0027597202],"about_ca_topic_score_codex":0.0000056005083,"about_ca_topic_score_gemma":0.0000019669856,"teacher_disagreement_score":0.9622309,"about_ca_system_score_codex":0.000032570588,"about_ca_system_score_gemma":0.00007018574,"threshold_uncertainty_score":0.21457645},"labels":[],"label_agreement":null},{"id":"W2584609412","doi":"10.1007/s00453-017-0389-y","title":"Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"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; Natural Sciences and Engineering Research Council of Canada; United States - Israel Binational Science Foundation; National Science Foundation","keywords":"Voronoi diagram; Pointer (user interface); Data structure; Time complexity; Combinatorics; Computer science; Line segment; Computational geometry; Algorithm; Mathematics; Discrete mathematics; Geometry","score_opus":0.05323177217562933,"score_gpt":0.3107300142054936,"score_spread":0.25749824202986427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584609412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0730399,0.00016720615,0.9236843,0.0018342596,0.00055138225,0.00032151313,0.00017369077,0.0000560359,0.00017170276],"genre_scores_gemma":[0.7411894,0.000011569234,0.25801083,0.00012063775,0.0002998103,0.00001713089,0.00024213841,0.000004528902,0.00010388879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992779,0.000016389704,0.0001071023,0.00033957468,0.00012584832,0.00013317876],"domain_scores_gemma":[0.9990078,0.000063634354,0.00008729868,0.00074133347,0.000044766748,0.000055140095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019703459,0.000084815954,0.00009082301,0.00002805412,0.0005267761,0.00044865345,0.00088274706,0.00003238638,0.0000037798136],"category_scores_gemma":[0.00010993412,0.00007683586,0.000014379849,0.0000266746,0.000065837005,0.0010471855,0.0006483971,0.00004531937,0.0000020797718],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150165115,0.000039090446,0.0009443521,0.0000287165,0.00004118954,0.0000040565033,0.00014670838,0.0000334576,0.0007361672,0.09795718,0.0036660898,0.896388],"study_design_scores_gemma":[0.0015464562,0.00028561527,0.12631355,0.000018134158,0.000034711265,0.00007709166,0.00003501524,0.6928489,0.013214092,0.09357097,0.07146726,0.0005881978],"about_ca_topic_score_codex":0.00005948764,"about_ca_topic_score_gemma":0.00007030137,"teacher_disagreement_score":0.89579976,"about_ca_system_score_codex":0.000009812091,"about_ca_system_score_gemma":0.000039470517,"threshold_uncertainty_score":0.43263754},"labels":[],"label_agreement":null},{"id":"W2621197517","doi":"10.1007/s00453-017-0328-y","title":"On the Planar Split Thickness of Graphs","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Planar graph; 1-planar graph; Planar straight-line graph; Outerplanar graph; Bipartite graph; Planar; Book embedding; Treewidth","score_opus":0.029007367667131502,"score_gpt":0.2991719772455107,"score_spread":0.2701646095783792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621197517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15189709,0.00024276493,0.75722766,0.025631746,0.0014281891,0.0010890162,0.000048554863,0.00030030214,0.062134713],"genre_scores_gemma":[0.98109573,0.000014330824,0.018079972,0.0002745566,0.000037897327,0.000020934205,7.2045975e-7,0.000011115986,0.00046473497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886125,0.0000898886,0.0001311167,0.00027130079,0.00038449702,0.00026194108],"domain_scores_gemma":[0.9971628,0.00049139623,0.00012991662,0.0020696924,0.00008589739,0.00006029613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058002124,0.00009978577,0.0001300427,0.000076099386,0.00050054584,0.00012379624,0.0033107132,0.000043467746,0.00002134718],"category_scores_gemma":[0.00025631738,0.00006424745,0.000075031894,0.00014018062,0.00036593105,0.00026269318,0.00031916043,0.0002258305,0.00007766345],"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.000008317436,0.000024459798,0.00005277031,0.0000036331814,0.000013808149,0.000010198969,0.0001052102,0.0000035653363,0.00040181575,0.969228,0.00045138857,0.029696828],"study_design_scores_gemma":[0.0001909602,0.00009975314,0.0031675482,0.000025960015,0.000002432963,0.000009746104,0.000020628177,0.0042215544,0.00874965,0.98207784,0.0013198102,0.00011410634],"about_ca_topic_score_codex":0.000025440519,"about_ca_topic_score_gemma":0.0000028354648,"teacher_disagreement_score":0.82919866,"about_ca_system_score_codex":0.0000096877675,"about_ca_system_score_gemma":0.00003363877,"threshold_uncertainty_score":0.6152184},"labels":[],"label_agreement":null},{"id":"W2658712968","doi":"10.1007/s00453-017-0337-x","title":"Minimizing Latency of Capacitated k-Tours","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Rounding; Vehicle routing problem; Latency (audio); Computer science; Theory of computation; Mathematical optimization; Approximation algorithm; Constant (computer programming); Orienteering; Routing (electronic design automation); Mathematics; Algorithm; Computer network; Telecommunications","score_opus":0.025833774242835745,"score_gpt":0.28174052564240587,"score_spread":0.25590675139957014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2658712968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010848334,0.000077231714,0.9476857,0.005506667,0.00068286003,0.00024786807,0.00000781855,0.00018497476,0.034758545],"genre_scores_gemma":[0.6761351,0.000027889922,0.32266936,0.000104214865,0.000038471448,0.0000058842543,0.000002198871,0.000008224098,0.0010086474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992536,0.000029555627,0.00015978936,0.00018523971,0.0001817679,0.0001900525],"domain_scores_gemma":[0.99891794,0.000032902895,0.0001425389,0.0006978582,0.0001334178,0.000075315955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001906753,0.000069044814,0.00011557786,0.00006434579,0.0002203447,0.00014346615,0.001066619,0.00003944951,0.000027056041],"category_scores_gemma":[0.00009669593,0.00006274753,0.000041987118,0.000083952466,0.000090809604,0.0004681726,0.00020094975,0.0000799102,0.000039376187],"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.000017571841,0.00044692136,0.0034303044,0.000104269435,0.00018248138,0.00010996335,0.0075217728,0.0012863298,0.010934587,0.2005501,0.010261085,0.7651546],"study_design_scores_gemma":[0.0013293469,0.00019884025,0.009650059,0.00008900384,0.0000103122175,0.000020029378,0.0000838751,0.9442507,0.024109488,0.014141051,0.005674027,0.00044325608],"about_ca_topic_score_codex":0.00007438108,"about_ca_topic_score_gemma":0.0000028347235,"teacher_disagreement_score":0.9429644,"about_ca_system_score_codex":0.000009521552,"about_ca_system_score_gemma":0.00004801689,"threshold_uncertainty_score":0.25587702},"labels":[],"label_agreement":null},{"id":"W2726740999","doi":"10.1007/s00453-018-00538-5","title":"Maximum Induced Matching Algorithms via Vertex Ordering Characterizations","year":2019,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Line graph; Factor-critical graph; Discrete mathematics; Graph; Graph power","score_opus":0.015788022930710435,"score_gpt":0.26864112702820914,"score_spread":0.2528531040974987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726740999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10387988,0.000027034353,0.8923567,0.0005890745,0.00088980154,0.0003806948,0.000005279274,0.0003818927,0.0014896519],"genre_scores_gemma":[0.8424306,0.000012910568,0.15612324,0.00041998833,0.00012761515,0.000055002733,0.000020643061,0.000058733327,0.0007512841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978494,0.000099935176,0.00028958285,0.0006524171,0.0004696625,0.0006389997],"domain_scores_gemma":[0.9984081,0.00015897916,0.00009711926,0.0010264049,0.00012935585,0.0001800565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003155868,0.00022907725,0.00025319657,0.00027321847,0.00021940903,0.00020444559,0.0014051477,0.000100713034,0.00012365796],"category_scores_gemma":[0.000030762538,0.00023293716,0.00008786598,0.0009538723,0.00003949088,0.0011698864,0.0006487308,0.0003968798,0.0011422674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001180196,0.00013706429,0.00025872706,0.000035695255,0.00007531837,0.000053194643,0.0010730008,0.00015847581,0.20609958,0.05057015,0.000037603735,0.7414894],"study_design_scores_gemma":[0.0020824987,0.0004702783,0.0077136895,0.00014323313,0.000016834107,0.00024738605,0.00018882447,0.52885914,0.057131104,0.3938615,0.0075117177,0.0017737871],"about_ca_topic_score_codex":0.000029080931,"about_ca_topic_score_gemma":0.000001545396,"teacher_disagreement_score":0.7397156,"about_ca_system_score_codex":0.00007242376,"about_ca_system_score_gemma":0.00007696831,"threshold_uncertainty_score":0.99963546},"labels":[],"label_agreement":null},{"id":"W2732566993","doi":"10.1007/s00453-019-00637-x","title":"Fast Compressed Self-indexes with Deterministic Linear-Time Construction","year":2019,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed suffix array; Binary logarithm; Alphabet; Combinatorics; Suffix; Log-log plot; Time complexity; Sigma; Mathematics; Suffix array; Algorithm; Omega; Discrete mathematics; Suffix tree; Arithmetic; Physics","score_opus":0.007542539180165174,"score_gpt":0.22188954415257112,"score_spread":0.21434700497240594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732566993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026499005,0.00013525717,0.9910496,0.00023344849,0.0023996758,0.0007764285,0.00021748296,0.0009787316,0.0015594639],"genre_scores_gemma":[0.05357224,0.000052621945,0.9443424,0.00017014387,0.000833516,0.00009556422,0.00038937345,0.00008789602,0.00045627743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640435,0.00015140913,0.0005528585,0.0015317595,0.0007636579,0.00059595023],"domain_scores_gemma":[0.99620116,0.00026835073,0.00053552596,0.0024720985,0.00028545217,0.00023740684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020376573,0.000662426,0.0007875874,0.00022927026,0.00023329945,0.0005328154,0.0024250387,0.00046233123,0.000055507713],"category_scores_gemma":[0.000023135068,0.0005502727,0.00016227682,0.00027126385,0.00015865815,0.0004888816,0.0030148285,0.0009873186,0.00054495863],"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.00034536587,0.0016607543,0.0011339805,0.001613237,0.0017095163,0.0009839144,0.0023177466,0.04114086,0.0010697222,0.0085198665,0.01234473,0.9271603],"study_design_scores_gemma":[0.00076214457,0.00028744803,0.0003330837,0.00036718382,0.00007968324,0.00022583426,0.000011617374,0.98886436,0.0006952446,0.0011781533,0.0063386816,0.00085657375],"about_ca_topic_score_codex":0.00006838793,"about_ca_topic_score_gemma":0.0000015510607,"teacher_disagreement_score":0.9477235,"about_ca_system_score_codex":0.000112875015,"about_ca_system_score_gemma":0.0005015259,"threshold_uncertainty_score":0.9996949},"labels":[],"label_agreement":null},{"id":"W2754604279","doi":"10.1007/s00453-017-0373-6","title":"Algorithms for Communication Scheduling in Data Gathering Network with Data Compression","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Ningbo; China Scholarship Council","keywords":"Job shop scheduling; Polynomial-time approximation scheme; Approximation algorithm; Computer science; Data compression; Scheduling (production processes); Mathematical optimization; Time complexity; Dynamic programming; Theory of computation; Wireless sensor network; Base station; Optimization problem; Data transmission; Algorithm; Mathematics; Computer network","score_opus":0.18964819929404286,"score_gpt":0.38079587530731945,"score_spread":0.1911476760132766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754604279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018699575,0.00021109056,0.99583817,0.0026312845,0.00012775582,0.0004333449,0.000035986457,0.00008469363,0.00045068443],"genre_scores_gemma":[0.0331138,0.00012651867,0.9660069,0.00011716156,0.0000953451,0.000027570466,0.00041305507,0.00001742698,0.000082233986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985441,0.000077175515,0.0002290494,0.00059505703,0.00021939195,0.00033523727],"domain_scores_gemma":[0.9925817,0.00016189966,0.00019028007,0.0068984423,0.00008738841,0.00008024549],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011386267,0.00012252499,0.00017120014,0.000047011577,0.0006990238,0.0006412219,0.008617163,0.000056994395,0.0000046085256],"category_scores_gemma":[0.00011813376,0.000105936604,0.000012109167,0.00012687856,0.000086388274,0.0022492951,0.0046609724,0.00019893929,0.000006790468],"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.00005635807,0.00028169644,0.0019900165,0.00007467445,0.000083612846,0.000017129869,0.0007247021,0.09289831,0.00010078572,0.014484932,0.0049934555,0.88429433],"study_design_scores_gemma":[0.00073939416,0.00002660326,0.00058202166,0.00015884858,0.000003958141,0.0000042443007,0.000017948947,0.98664933,0.000030993524,0.0011502812,0.010483975,0.00015241149],"about_ca_topic_score_codex":0.00014433473,"about_ca_topic_score_gemma":0.00016355759,"teacher_disagreement_score":0.893751,"about_ca_system_score_codex":0.000020591144,"about_ca_system_score_gemma":0.000082930026,"threshold_uncertainty_score":0.9967467},"labels":[],"label_agreement":null},{"id":"W2757636421","doi":"10.1007/s00453-020-00673-y","title":"Shortest Paths in the Plane with Obstacle Violations","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Obstacle; Shortest path problem; Combinatorics; Euclidean shortest path; Mathematics; Plane (geometry); K shortest path routing; Regular polygon; Path (computing); Point (geometry); Yen's algorithm; Distance; Computer science; Dijkstra's algorithm; Graph; Geometry","score_opus":0.018582563258740834,"score_gpt":0.2171970148391594,"score_spread":0.19861445158041857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757636421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03917294,0.000066544264,0.9480826,0.011257847,0.00007151786,0.0001716608,0.000005240112,0.00006703101,0.0011045844],"genre_scores_gemma":[0.96292377,0.000001945473,0.034911167,0.0019882917,0.00012142091,0.000013681216,0.000020577563,0.0000028762267,0.000016270258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.000042019372,0.00010281847,0.00018213879,0.0001871482,0.00010729052],"domain_scores_gemma":[0.999631,0.000121442514,0.000025384847,0.00014927465,0.000031673862,0.000041252508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009036336,0.00006139229,0.000057796136,0.00003455886,0.00007683117,0.00008429721,0.00034074116,0.000017744835,0.0000086674045],"category_scores_gemma":[0.00002028813,0.00004206085,0.000014825112,0.0006314756,0.000012987019,0.00019840943,0.0000368918,0.00009181101,0.00003451827],"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.00003719415,0.00042007302,0.004957771,0.000019058347,0.00005292605,0.00030768043,0.017543402,0.061807033,0.0017782407,0.17167832,0.009202328,0.732196],"study_design_scores_gemma":[0.0004759553,0.00028999127,0.03354503,0.000009369372,0.0000067377814,0.00006616448,0.00016964265,0.941046,0.00077915384,0.0024479972,0.020946426,0.00021755577],"about_ca_topic_score_codex":0.000009296307,"about_ca_topic_score_gemma":0.000011210684,"teacher_disagreement_score":0.9237508,"about_ca_system_score_codex":0.000008562993,"about_ca_system_score_gemma":0.00004578992,"threshold_uncertainty_score":0.17151916},"labels":[],"label_agreement":null},{"id":"W2775875217","doi":"10.1007/s004530010030","title":"Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes","year":2000,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"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":"Broadcasting (networking); Computer science; Binary logarithm; Bounded function; Parallel computing; Logarithm; Fault tolerance; Constant (computer programming); Fraction (chemistry); Theory of computation; Fault (geology); Log-log plot; Algorithm; Distributed computing; Combinatorics; Computer network; Mathematics","score_opus":0.012021439677676332,"score_gpt":0.22136921163421647,"score_spread":0.20934777195654014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775875217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16013446,0.000037142872,0.8337482,0.0000720178,0.00013072407,0.00010263027,0.0000019908455,0.00008985641,0.005682948],"genre_scores_gemma":[0.8848789,0.000003127641,0.1145154,0.00005040222,0.00014635352,0.000010078584,0.0000012420336,0.0000074456702,0.0003870657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990699,0.000054487282,0.00021455516,0.0002603954,0.0002057689,0.00019485524],"domain_scores_gemma":[0.999416,0.000067111476,0.000105555395,0.0002481954,0.00011557683,0.000047572983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014581224,0.00010725826,0.00017808519,0.000050641374,0.000114886374,0.000074093776,0.00024913112,0.00005332673,0.000086633765],"category_scores_gemma":[0.0000055776304,0.00008656721,0.00004984016,0.0002582994,0.000042053125,0.0003931595,0.00002824201,0.0001219078,0.0000369791],"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.00020789415,0.00022076118,0.00023556675,0.000023647186,0.00018781028,0.0000510944,0.0024908953,0.02181422,0.00064818707,0.010998232,0.0010933307,0.9620284],"study_design_scores_gemma":[0.00041222843,0.00035896065,0.0005047897,0.00008149787,0.000007974683,0.00014376432,0.00023687712,0.99221027,0.0019211683,0.00029927288,0.0036450017,0.00017818686],"about_ca_topic_score_codex":0.00031356973,"about_ca_topic_score_gemma":0.00000754749,"teacher_disagreement_score":0.97039604,"about_ca_system_score_codex":0.000038123275,"about_ca_system_score_gemma":0.00003651295,"threshold_uncertainty_score":0.35301083},"labels":[],"label_agreement":null},{"id":"W2786889022","doi":"10.1007/s00453-005-1168-8","title":"Constructing Plane Spanners of Bounded Degree and Low Weight","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Degree (music); Combinatorics; Mathematics; Plane (geometry); Theory of computation; Spanner; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Binary logarithm; Spanning tree; Point (geometry); Tree (set theory); Discrete mathematics; Geometry; Algorithm; Computer science; Physics; Mathematical analysis","score_opus":0.01287707065722272,"score_gpt":0.22516149939138386,"score_spread":0.21228442873416115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786889022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25390887,0.00030006096,0.7404502,0.0017152125,0.00034535598,0.00010278488,0.00000715969,0.000071875926,0.0030984355],"genre_scores_gemma":[0.6990108,0.000007544495,0.30059686,0.00010385422,0.00016062545,0.0000016454273,0.000007669005,0.0000027707354,0.00010821618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993854,0.00002050265,0.00015671093,0.00017879515,0.00014286098,0.00011571014],"domain_scores_gemma":[0.99960816,0.0000858317,0.00006886258,0.0001296262,0.000056609286,0.000050907154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011191111,0.000067666995,0.000096528034,0.000083456114,0.00006107245,0.000041709976,0.00015680898,0.000031069078,0.000011758892],"category_scores_gemma":[0.000020231295,0.00006637978,0.000020398158,0.00019087417,0.00004944436,0.0002350592,0.000071063005,0.0000535377,0.000008949119],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029917487,0.000023127563,0.000204413,0.000009372109,0.00001635296,0.0000030466272,0.00017073115,0.00018878208,0.0010039295,0.059526563,0.00033875628,0.9385119],"study_design_scores_gemma":[0.0012186031,0.00013582052,0.0033769768,0.00004520955,0.000016606484,0.00030786026,0.00008976031,0.8647024,0.107858464,0.010363539,0.011490545,0.0003941852],"about_ca_topic_score_codex":0.00000826963,"about_ca_topic_score_gemma":0.0000081330545,"teacher_disagreement_score":0.93811774,"about_ca_system_score_codex":0.000018562054,"about_ca_system_score_gemma":0.000046262845,"threshold_uncertainty_score":0.27068886},"labels":[],"label_agreement":null},{"id":"W2790623224","doi":"10.1007/s00453-018-0425-6","title":"Fast Approximation Algorithms for p-Centers in Large $$\\delta $$ δ -Hyperbolic Graphs","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nokia (Canada); Bell (Canada)","funders":"European Research Council","keywords":"Theory of computation; Approximation algorithm; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Computer science","score_opus":0.018727273076901897,"score_gpt":0.27243292434191463,"score_spread":0.2537056512650127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790623224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018451275,0.00006125418,0.97910196,0.00070251,0.0007842008,0.00039740858,0.000025268806,0.00010677458,0.00036936955],"genre_scores_gemma":[0.6253047,0.000010056392,0.3729569,0.00074628927,0.0005220276,0.00012540547,0.00013573944,0.000016449243,0.00018244494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986321,0.000046651003,0.00028494108,0.00043944985,0.00023400028,0.00036285876],"domain_scores_gemma":[0.9992771,0.00007481078,0.00008362264,0.00029472864,0.00019274563,0.00007698268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003915961,0.00014404689,0.00015444067,0.0003166289,0.00017068417,0.00011222863,0.0004373244,0.00006986176,0.000011397521],"category_scores_gemma":[0.00004327997,0.00014834109,0.000075111086,0.0008360369,0.000039555376,0.0005066223,0.00011246777,0.00008121768,0.000045322224],"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.000032659347,0.0005151972,0.00037953616,0.000036639685,0.0000450778,0.000006274078,0.0018444293,0.0004990024,0.0020793632,0.18309781,0.003933102,0.8075309],"study_design_scores_gemma":[0.001189618,0.00018764904,0.0024889717,0.000016886263,0.0000051503903,0.000012859032,0.000036183887,0.9617264,0.005035156,0.01851182,0.010554418,0.000234887],"about_ca_topic_score_codex":0.0000187112,"about_ca_topic_score_gemma":0.000025968473,"teacher_disagreement_score":0.9612274,"about_ca_system_score_codex":0.000049248327,"about_ca_system_score_gemma":0.00006152302,"threshold_uncertainty_score":0.6049174},"labels":[],"label_agreement":null},{"id":"W2802356468","doi":"10.1007/s00453-018-0444-3","title":"Impact of Knowledge on Election Time in Anonymous Networks","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada; Conseil Régional de Picardie; Université du Québec en Outaouais","keywords":"Leader election; Node (physics); Task (project management); Computer science; Computer network; Time complexity; Simple (philosophy); Port (circuit theory); A priori and a posteriori; Algorithm; Engineering","score_opus":0.011490235596683492,"score_gpt":0.28018300704392,"score_spread":0.2686927714472365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802356468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2990163,0.0002792735,0.67436886,0.00022187774,0.0014645715,0.0004850719,0.000010368368,0.00038770292,0.023765977],"genre_scores_gemma":[0.98318636,0.00000846523,0.016064567,0.00004539436,0.0003942181,0.000007233938,0.0000033619906,0.000011592376,0.00027879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988464,0.00008479786,0.00024429124,0.0003415268,0.00014556262,0.00033742024],"domain_scores_gemma":[0.99913204,0.00012365832,0.00008144228,0.00047787034,0.00011417014,0.00007084201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024709973,0.0001509182,0.00021396855,0.00028277168,0.0000824557,0.000037599948,0.0006091321,0.00008683351,0.00007118021],"category_scores_gemma":[0.000024775272,0.00013571049,0.00012811087,0.0011645273,0.00012207394,0.0001906263,0.00014501862,0.00019043869,0.00015974416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000615322,0.0009473113,0.0012918606,0.000007821437,0.00007613297,0.00001663254,0.00082929677,0.00056187913,0.0010851097,0.010663201,0.006286031,0.9781732],"study_design_scores_gemma":[0.00047330387,0.001634421,0.035872787,0.000043001197,0.0000037341622,0.000022108981,0.0000020670548,0.95295817,0.0020160235,0.006086623,0.00065749383,0.00023026184],"about_ca_topic_score_codex":0.00013155653,"about_ca_topic_score_gemma":0.000029244888,"teacher_disagreement_score":0.97794294,"about_ca_system_score_codex":0.00009199166,"about_ca_system_score_gemma":0.00008674317,"threshold_uncertainty_score":0.5534113},"labels":[],"label_agreement":null},{"id":"W2803719094","doi":"10.1007/s00453-018-0454-1","title":"Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Theory of computation; Approximation algorithm; Partition (number theory); Metric space; Binary logarithm; Cluster analysis; Constant (computer programming); Metric (unit); Tree (set theory); Discrete mathematics; Algorithm; Computer science; Statistics","score_opus":0.03056767377500836,"score_gpt":0.25308909180190037,"score_spread":0.22252141802689201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803719094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052741177,0.00012487057,0.90338355,0.012143549,0.004050126,0.002223298,0.000027663666,0.0006254569,0.024680281],"genre_scores_gemma":[0.9307779,0.000022707944,0.054961313,0.0046660523,0.0059850607,0.0003349091,0.00027208758,0.00006553625,0.0029144278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897426,0.0000045275306,0.00024802424,0.00033110546,0.0001598192,0.00028226178],"domain_scores_gemma":[0.9995179,0.000014908073,0.00006035574,0.00020877422,0.0001779373,0.000020127183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028111515,0.00015291557,0.00014517394,0.00015295744,0.00024253357,0.00015594636,0.00015211519,0.00005323077,0.00021092882],"category_scores_gemma":[0.00007180384,0.00015262462,0.000044463242,0.00023067273,0.00008508577,0.0005747326,0.00012696208,0.000047023805,0.00032143542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091136826,0.00016152418,0.0005821151,0.00084769184,0.00010692266,0.0000021446194,0.00044233125,0.000075571836,0.0010089707,0.014452406,0.039033514,0.9431957],"study_design_scores_gemma":[0.0007283549,0.000027076458,0.002279153,0.00002387761,0.00003744027,8.1472416e-7,0.00026130513,0.77301687,0.00021492656,0.0026394438,0.22049636,0.00027438044],"about_ca_topic_score_codex":0.00027041478,"about_ca_topic_score_gemma":0.00024195602,"teacher_disagreement_score":0.9429213,"about_ca_system_score_codex":0.000021850843,"about_ca_system_score_gemma":0.000007306546,"threshold_uncertainty_score":0.6223851},"labels":[],"label_agreement":null},{"id":"W2804416848","doi":"10.1007/s00453-018-0456-z","title":"The Fast Search Number of a Complete k-Partite Graph","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Theory of computation; Mathematics; Fleischer; Discrete mathematics; Complete bipartite graph; Upper and lower bounds; Graph; Computer science; Algorithm","score_opus":0.02728497382287947,"score_gpt":0.32107480510330555,"score_spread":0.2937898312804261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804416848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03884322,0.000119751756,0.94612545,0.0018303576,0.00043189034,0.0003558302,0.00001884951,0.00015827239,0.012116359],"genre_scores_gemma":[0.9156116,0.00003420687,0.08287491,0.00015084329,0.00021310509,0.00002754009,0.0000018246773,0.00002117125,0.001064801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981752,0.00019687967,0.00023033336,0.0003305478,0.0005365158,0.0005305001],"domain_scores_gemma":[0.9980208,0.00041774093,0.000060796847,0.0010172223,0.00036450496,0.00011893539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007215883,0.00011582628,0.00014621248,0.000077528515,0.00041639668,0.00009469502,0.0017708233,0.000037819176,0.000049037546],"category_scores_gemma":[0.00005594918,0.000081739716,0.00008771933,0.0009624424,0.0009851881,0.00024681617,0.0006063263,0.00020370782,0.0005081758],"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.00004610487,0.000081473605,0.0010273543,0.000012227932,0.00007729384,0.000013287837,0.0009890439,0.00000871913,0.0047075697,0.71532834,0.001609947,0.27609867],"study_design_scores_gemma":[0.0014526554,0.0007612407,0.007351054,0.00007307724,0.00001393303,0.0001638193,0.0003294297,0.1132809,0.08411996,0.6969337,0.094751045,0.0007691902],"about_ca_topic_score_codex":0.000024346242,"about_ca_topic_score_gemma":0.000010065201,"teacher_disagreement_score":0.87676835,"about_ca_system_score_codex":0.000017454768,"about_ca_system_score_gemma":0.00005886531,"threshold_uncertainty_score":0.65317416},"labels":[],"label_agreement":null},{"id":"W2804942034","doi":"10.1007/s00453-020-00687-6","title":"Compressed Dynamic Range Majority and Minority Data Structures","year":2020,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto Millenium; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Alphabet; Mathematics; Order (exchange); Binary logarithm; Sigma; Range (aeronautics); Sequence (biology); Space (punctuation); Algorithm; Discrete mathematics; Physics; Computer science","score_opus":0.0485731490374837,"score_gpt":0.2966517954176518,"score_spread":0.2480786463801681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804942034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002520344,0.004321961,0.981756,0.0036524436,0.0024924318,0.00081810873,0.003177637,0.00072391646,0.0005371786],"genre_scores_gemma":[0.21249343,0.0008067345,0.7804275,0.00095079385,0.0011987832,0.000052791853,0.0038722183,0.00007404217,0.00012367133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553186,0.00021549164,0.0005501057,0.0024696847,0.00070090935,0.00053195463],"domain_scores_gemma":[0.99415725,0.0001851914,0.00034940508,0.0047788187,0.00012110387,0.00040825],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00031483173,0.00064225827,0.00080521806,0.00013109898,0.00028541393,0.00082105165,0.0069033,0.00046700504,0.000030056013],"category_scores_gemma":[0.00008541578,0.0005990731,0.00010372064,0.00023493849,0.00018548168,0.0007897612,0.028434515,0.0014204755,0.000030256715],"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.00008707339,0.00036648277,0.0006289151,0.0015636518,0.00062168366,0.0006746535,0.0011691602,0.00012196421,0.00066972675,0.017820712,0.07202482,0.90425116],"study_design_scores_gemma":[0.00065973325,0.00004901727,0.009017969,0.00008471901,0.0000804177,0.000047422775,0.000014060082,0.920105,0.00009579852,0.05313802,0.015878543,0.0008293206],"about_ca_topic_score_codex":0.00069840613,"about_ca_topic_score_gemma":0.000030377436,"teacher_disagreement_score":0.919983,"about_ca_system_score_codex":0.000060624803,"about_ca_system_score_gemma":0.0002220438,"threshold_uncertainty_score":0.99964607},"labels":[],"label_agreement":null},{"id":"W2805325553","doi":"10.1007/s00453-018-0458-x","title":"LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Facility location problem; Theory of computation; Routing (electronic design automation); Computer science; Network planning and design; Approximation algorithm; Linear programming; Upper and lower bounds; Mathematical optimization; 1-center problem; Integer programming; Mathematics; Algorithm; Computer network","score_opus":0.05242191817233216,"score_gpt":0.2605518416760623,"score_spread":0.20812992350373016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805325553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054447325,0.000048166385,0.9886544,0.0018336569,0.00089406606,0.0016024564,0.000011421147,0.00021481338,0.0012963363],"genre_scores_gemma":[0.9147101,0.0000060431344,0.07523054,0.003618195,0.002975597,0.0010224872,0.0009751365,0.000052793166,0.0014090914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981661,0.00003316191,0.0005097979,0.00052252825,0.00029328663,0.00047514559],"domain_scores_gemma":[0.9989646,0.0000553634,0.00012296722,0.00040433183,0.00043071932,0.000022027447],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012265095,0.00023319287,0.00022173813,0.00022496076,0.00032431958,0.00011603205,0.000274269,0.00010554018,0.00046285812],"category_scores_gemma":[0.00019297797,0.00024439537,0.00007622606,0.0009368993,0.00012415863,0.0005677544,0.00009795337,0.000082820494,0.0011255923],"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.00091367983,0.0011651283,0.0022922794,0.0014927287,0.00013553785,0.000004472478,0.00033218096,0.26258606,0.00035264078,0.01905245,0.14388122,0.56779164],"study_design_scores_gemma":[0.0009476012,0.000046665806,0.0021475963,0.00002881064,0.000030661,1.6301395e-7,0.000045090183,0.9111032,0.00030010278,0.003161081,0.08188461,0.0003044361],"about_ca_topic_score_codex":0.0005325848,"about_ca_topic_score_gemma":0.0004529024,"teacher_disagreement_score":0.91342384,"about_ca_system_score_codex":0.00017108562,"about_ca_system_score_gemma":0.000041199135,"threshold_uncertainty_score":0.99965215},"labels":[],"label_agreement":null},{"id":"W2811044723","doi":"10.1007/s00453-018-0461-2","title":"On the Separation and Equivalence of Paging Strategies and Other Online Algorithms","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bijection; Paging; Algorithm; Computer science; Theory of computation; Online algorithm; Equivalence (formal languages); Competitive analysis; Set (abstract data type); Context (archaeology); Locality; Theoretical computer science; Mathematics; Discrete mathematics; Upper and lower bounds","score_opus":0.0400453913384496,"score_gpt":0.3232309033706767,"score_spread":0.28318551203222714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811044723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027552465,0.00013470465,0.9650755,0.002832027,0.00010347283,0.00021346033,0.000008826484,0.000063646476,0.0040159323],"genre_scores_gemma":[0.86821455,0.00006727237,0.12997411,0.0012919883,0.00011518583,0.0000084983885,0.0000019361507,0.000010116782,0.00031637435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993553,0.000057480032,0.00011917765,0.00018781004,0.0001562887,0.00012393767],"domain_scores_gemma":[0.9994923,0.00012921586,0.000051730414,0.00020891606,0.00007992489,0.000037939215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023336327,0.00007087574,0.000074056974,0.000046517485,0.00011402851,0.00015428883,0.00021415587,0.000025660256,0.00002026091],"category_scores_gemma":[0.000024756491,0.000047597485,0.00001089482,0.00016026193,0.00020166073,0.00030838177,0.00010955904,0.00006719605,0.0000050862936],"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.00000865117,0.00011252915,0.00012728036,0.000026988206,0.00003425335,0.000002345278,0.004102142,0.00023837974,0.0019670934,0.6482248,0.00067985215,0.34447572],"study_design_scores_gemma":[0.00021689934,0.00029957565,0.0005281474,0.00003826284,0.000003094363,0.00000842092,0.00031302465,0.97624075,0.002217356,0.018315412,0.0017093034,0.00010973555],"about_ca_topic_score_codex":0.000022151658,"about_ca_topic_score_gemma":0.0000063248926,"teacher_disagreement_score":0.9760024,"about_ca_system_score_codex":0.0000048101897,"about_ca_system_score_gemma":0.000033032247,"threshold_uncertainty_score":0.19409691},"labels":[],"label_agreement":null},{"id":"W2892029381","doi":"10.1007/s00453-018-0447-0","title":"Linear Search by a Pair of Distinct-Speed Robots","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Robotic Path Planning Algorithms","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","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Bordeaux; Narodowym Centrum Nauki; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; University of Liverpool","keywords":"Computer science; Robot; Artificial intelligence","score_opus":0.02137274850842824,"score_gpt":0.2759445785898167,"score_spread":0.25457183008138845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892029381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010222341,0.000107403604,0.9855002,0.0010993103,0.00060036307,0.0001988161,0.00003343083,0.0003035466,0.001934582],"genre_scores_gemma":[0.2457964,0.0000031344773,0.7517553,0.00023714479,0.0005203886,0.0000067763185,0.00002540236,0.00003215449,0.0016233322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978574,0.00012036031,0.00037375602,0.0005483722,0.0005666915,0.00053345354],"domain_scores_gemma":[0.9983939,0.00018722606,0.00012115584,0.00088934315,0.00021195799,0.00019645042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941553,0.0002061199,0.00030481088,0.00012004504,0.00014361716,0.000053700634,0.0013830295,0.00011026754,0.000030281823],"category_scores_gemma":[0.00009556633,0.00019113695,0.00008418862,0.0006722373,0.0002835302,0.00025019338,0.00042909296,0.0002151511,0.00030080098],"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.00008273595,0.001522896,0.005353466,0.00017053547,0.0004427736,0.00031301365,0.0078066476,0.0016662229,0.03110625,0.0071637346,0.1882578,0.75611395],"study_design_scores_gemma":[0.00057761266,0.00053201325,0.002444273,0.00005461781,0.0000114093455,0.000049863218,0.0000259963,0.94868445,0.04177514,0.00048165125,0.0050023776,0.0003605929],"about_ca_topic_score_codex":0.00016266429,"about_ca_topic_score_gemma":7.41319e-7,"teacher_disagreement_score":0.9470182,"about_ca_system_score_codex":0.000041953757,"about_ca_system_score_gemma":0.00009962185,"threshold_uncertainty_score":0.77943385},"labels":[],"label_agreement":null},{"id":"W2903949188","doi":"10.1007/s00453-018-0484-8","title":"Information Complexity of the AND Function in the Two-Party and Multi-party Settings","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Israel Science Foundation","keywords":"Theory of computation; Generalization; Function (biology); Computational complexity theory; Characterization (materials science); Protocol (science); Information theory; Average-case complexity; Descriptive complexity theory","score_opus":0.027498376083014142,"score_gpt":0.2541167767715941,"score_spread":0.22661840068857997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903949188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49203223,0.00017940502,0.49536455,0.008672953,0.0010012047,0.00086457236,0.000035294095,0.00011592455,0.0017338457],"genre_scores_gemma":[0.9595381,0.0000069193347,0.03917866,0.0011810211,0.00006960561,0.000009738178,0.000002793164,0.000002696019,0.0000104665705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991214,0.000119769466,0.00023486314,0.0001458764,0.0002098027,0.00016824904],"domain_scores_gemma":[0.9992794,0.00010409351,0.00012086194,0.00038575105,0.000080031175,0.000029901548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056334265,0.00010025291,0.000114105234,0.00006701289,0.0002676166,0.00010997992,0.00047420978,0.000036994123,0.0000049390005],"category_scores_gemma":[0.000046290756,0.0000612852,0.000031984473,0.00042808428,0.000607483,0.0006299728,0.00032692953,0.0001604098,0.000004815282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003324376,0.00019408298,0.0068091108,0.00007686858,0.000039839277,0.0000012677674,0.022435997,0.000010095871,0.00044405775,0.25328812,0.0022981113,0.7143692],"study_design_scores_gemma":[0.0016375985,0.0002432395,0.31089035,0.000059715294,0.000019203082,0.0000718187,0.00085416285,0.5821041,0.0019472088,0.08279558,0.019096652,0.0002803559],"about_ca_topic_score_codex":0.0001660289,"about_ca_topic_score_gemma":0.00010459537,"teacher_disagreement_score":0.71408886,"about_ca_system_score_codex":0.0000097614975,"about_ca_system_score_gemma":0.000022044736,"threshold_uncertainty_score":0.2499138},"labels":[],"label_agreement":null},{"id":"W2915860730","doi":"10.1007/s00453-020-00785-5","title":"Travelling on Graphs with Small Highway Dimension","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Dimension (graph theory); Steiner tree problem; Theory of computation; Combinatorics; Mathematics; Graph; Polynomial; Approximation algorithm; Scheme (mathematics); Time complexity; Tree (set theory); Polynomial-time approximation scheme; Shortest path problem; Metric dimension; Discrete mathematics; Pathwidth; Line graph; Algorithm","score_opus":0.025253173343176734,"score_gpt":0.21924888036828835,"score_spread":0.19399570702511162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915860730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07679539,0.00045829534,0.91374236,0.0027418872,0.001105149,0.00021877384,0.000017813933,0.0006450865,0.0042752423],"genre_scores_gemma":[0.20421264,0.0000943082,0.7925908,0.002022875,0.00021577433,0.00001834502,0.000034004108,0.000038998725,0.0007722447],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998203,0.00008435948,0.00021587101,0.0007025713,0.00037570545,0.00041848692],"domain_scores_gemma":[0.99859196,0.00017898786,0.000070256305,0.00085218705,0.0001515753,0.00015502963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013335634,0.00023276292,0.00023443466,0.00014343006,0.0002619102,0.0001735875,0.000648452,0.00007587926,0.000032579144],"category_scores_gemma":[0.000015768232,0.00019731812,0.00011517465,0.0010011012,0.00008245984,0.0001762827,0.00019734545,0.00030749635,0.000056724926],"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.000022282398,0.0006170163,0.00007012867,0.000023186183,0.000106097956,0.00096324965,0.00069799245,0.0002599748,0.001613867,0.39468676,0.00064783194,0.6002916],"study_design_scores_gemma":[0.005236468,0.0026221273,0.011783706,0.0008653505,0.00012136654,0.0015515058,0.00052519696,0.30000883,0.30128133,0.2680196,0.10428565,0.0036988517],"about_ca_topic_score_codex":0.000021848811,"about_ca_topic_score_gemma":0.000025087282,"teacher_disagreement_score":0.5965927,"about_ca_system_score_codex":0.000026421383,"about_ca_system_score_gemma":0.000090176385,"threshold_uncertainty_score":0.80463994},"labels":[],"label_agreement":null},{"id":"W2922321031","doi":"10.1007/s00453-007-9151-1","title":"On the Parameterized Complexity of Layered Graph Drawing","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Combinatorics; Parameterized complexity; Pathwidth; Mathematics; Graph drawing; Theory of computation; Bounded function; Crossing number (knot theory); Graph; Time complexity; Span (engineering); Discrete mathematics; Line graph; Algorithm","score_opus":0.04315325250689598,"score_gpt":0.27116115571427796,"score_spread":0.22800790320738198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922321031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16618451,0.00001733053,0.83157915,0.0008639134,0.00021107685,0.000098314136,0.000002046857,0.000039667957,0.0010039924],"genre_scores_gemma":[0.91025835,0.0000010147243,0.0891921,0.0004537008,0.000050372146,0.0000028281117,0.0000037836285,0.000002974066,0.000034886834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917084,0.0000562878,0.00019829429,0.00017405652,0.00024940076,0.00015114473],"domain_scores_gemma":[0.9989838,0.0005233147,0.000083895895,0.00029260066,0.000076811804,0.000039581173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868179,0.00007482795,0.000099118486,0.000097635544,0.00012320513,0.000038968494,0.00039260203,0.000027447539,0.000018135404],"category_scores_gemma":[0.00007340616,0.0000544924,0.00006494367,0.0005055318,0.00007658071,0.000096636555,0.000074718824,0.00008143512,0.000016512884],"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.000023176928,0.00010616557,0.000019500341,0.0000051223547,0.00003228444,0.000005994876,0.00034519885,0.00090234773,0.011869091,0.8940792,0.000640408,0.09197149],"study_design_scores_gemma":[0.0008445407,0.00033097898,0.014038807,0.000031815194,0.000010206701,0.000023371613,0.000052069525,0.22724807,0.20974444,0.5452475,0.0020971706,0.0003310184],"about_ca_topic_score_codex":0.000013499494,"about_ca_topic_score_gemma":0.0000026695775,"teacher_disagreement_score":0.7440738,"about_ca_system_score_codex":0.000012272876,"about_ca_system_score_gemma":0.000023918414,"threshold_uncertainty_score":0.22221357},"labels":[],"label_agreement":null},{"id":"W2931307493","doi":"10.1007/s00453-024-01207-6","title":"Exploration of High-Dimensional Grids by Finite State Machines","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"State (computer science); Computer science; Distributed computing; Algorithm","score_opus":0.015531657022182508,"score_gpt":0.25657313443856766,"score_spread":0.24104147741638515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931307493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089125644,0.00029165775,0.9949771,0.0028491123,0.00043714562,0.000096604104,0.000037709273,0.00016871061,0.000250702],"genre_scores_gemma":[0.5638287,0.00023234129,0.42651802,0.00081801985,0.00017447809,0.000055012875,0.00024114507,0.00004018524,0.008092063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913114,0.00004915854,0.00018587206,0.00023169494,0.00026383405,0.00013829913],"domain_scores_gemma":[0.9995367,0.00010217518,0.000029121455,0.00019135047,0.00008343182,0.000057227957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017552024,0.000079845246,0.00009231182,0.00010311041,0.00004563276,0.00011223443,0.00024686207,0.00002661123,0.000056036064],"category_scores_gemma":[0.000017868984,0.00006761363,0.00003302882,0.00037829517,0.00003255388,0.0008007899,0.000108258326,0.00008975927,0.00009233177],"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.000011039529,0.00017427352,0.000010303535,0.00010287288,0.000089162735,0.000059925635,0.0018042447,0.05249048,0.003433871,0.085320905,0.07125911,0.7852438],"study_design_scores_gemma":[0.00012061545,0.00006659799,0.000010352922,0.00002265131,0.0000020702212,0.000003650598,0.0000020505186,0.97077966,0.0034258442,0.01804439,0.0074347304,0.00008737706],"about_ca_topic_score_codex":0.000058752856,"about_ca_topic_score_gemma":0.0000019666884,"teacher_disagreement_score":0.9182892,"about_ca_system_score_codex":0.000013392999,"about_ca_system_score_gemma":0.000058824255,"threshold_uncertainty_score":0.2757204},"labels":[],"label_agreement":null},{"id":"W2935502686","doi":"10.1007/s00453-023-01204-1","title":"Finding Optimal Solutions with Neighborly Help","year":2024,"lang":"en","type":"article","venue":"Algorithmica","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":"York University","funders":"Japan Society for the Promotion of Science; Eidgenössische Technische Hochschule Zürich; Alexander von Humboldt-Stiftung; Heinrich-Heine-Universität Düsseldorf; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Edge cover; Theory of computation; Vertex cover; Combinatorics; Vertex (graph theory); Edge coloring; Graph; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Algorithm; Line graph; Artificial intelligence; Graph power","score_opus":0.026548626414717717,"score_gpt":0.29098596922594716,"score_spread":0.26443734281122944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935502686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017254663,0.00060583366,0.991222,0.0013246756,0.0003117619,0.00013264237,0.0000075875864,0.0005100228,0.004159961],"genre_scores_gemma":[0.561355,0.000029757963,0.43346694,0.00010636782,0.0003121099,0.000076854514,0.0000066637813,0.000044485412,0.004601838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985089,0.000048334903,0.00012827398,0.00046063054,0.00033211763,0.0005217488],"domain_scores_gemma":[0.99911755,0.00020316982,0.000018191873,0.00047351452,0.0000624195,0.00012512962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027416646,0.00013037623,0.00010621744,0.00022551884,0.00023389643,0.0002603152,0.0007394806,0.000041386727,0.00005567016],"category_scores_gemma":[0.000021531472,0.000105255254,0.000057320518,0.0010940642,0.00011885672,0.0007821084,0.00029626998,0.00028769387,0.0003144756],"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.000008476521,0.000038232414,0.000022436341,0.000022065115,0.00006416608,0.00020912394,0.0004623448,0.0006240107,0.0010185761,0.86039597,0.0019076258,0.13522698],"study_design_scores_gemma":[0.00038062234,0.0004955886,0.0002815741,0.00016605988,0.000018220937,0.00030558932,0.00011306727,0.8672554,0.0050854394,0.070699245,0.05458998,0.0006092136],"about_ca_topic_score_codex":0.000007465528,"about_ca_topic_score_gemma":0.0000020282112,"teacher_disagreement_score":0.8666314,"about_ca_system_score_codex":0.00006153609,"about_ca_system_score_gemma":0.00013288487,"threshold_uncertainty_score":0.42921847},"labels":[],"label_agreement":null},{"id":"W2942755285","doi":"10.1007/s00453-020-00728-0","title":"Online Bin Covering with Advice","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natur og Univers, Det Frie Forskningsråd","keywords":"Advice (programming); Bin; Competitive analysis; Online algorithm; Bin packing problem; Binary logarithm; Mathematics; Theory of computation; Combinatorics; Computer science; Algorithm; Discrete mathematics; Upper and lower bounds","score_opus":0.02001191323843362,"score_gpt":0.2351358559611555,"score_spread":0.21512394272272187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942755285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007947291,0.000028551298,0.98446745,0.01195123,0.00004399083,0.00010246368,0.0000049120704,0.00036602496,0.0022406313],"genre_scores_gemma":[0.08080465,0.000022642893,0.9111117,0.0074871047,0.00014559862,0.00000768488,0.000014186775,0.000016173897,0.0003902407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992752,0.000022831784,0.000097214135,0.00023728414,0.00019499028,0.00017245322],"domain_scores_gemma":[0.99954545,0.000025802006,0.000029378913,0.00018712948,0.00006103142,0.00015119277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045713154,0.00007449124,0.000084110594,0.000028161989,0.000055506967,0.00008859575,0.00044120138,0.000021462994,0.000037047124],"category_scores_gemma":[0.00001778302,0.00006112297,0.000017748995,0.00042668925,0.000020007436,0.0002862252,0.00014902109,0.000108631524,0.000096632895],"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.00008720313,0.0008948233,0.0009072768,0.00018139255,0.00022589718,0.0004603204,0.009830072,0.07797402,0.003134917,0.060888667,0.028933486,0.81648195],"study_design_scores_gemma":[0.00028002146,0.0001597899,0.000108960856,0.000008949503,0.0000017957361,0.0000077709155,0.00002522929,0.96695405,0.0006260182,0.000088868546,0.03161834,0.00012020819],"about_ca_topic_score_codex":0.000014051591,"about_ca_topic_score_gemma":0.0000027246213,"teacher_disagreement_score":0.88898003,"about_ca_system_score_codex":0.0000106889565,"about_ca_system_score_gemma":0.000053845666,"threshold_uncertainty_score":0.24925223},"labels":[],"label_agreement":null},{"id":"W2951836815","doi":"10.1007/s00453-017-0305-5","title":"Improved Spanning Ratio for Low Degree Plane Spanners","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Degree (music); Combinatorics; Plane (geometry); Mathematics; Graph; Spanning tree; Theory of computation; Approx; Discrete mathematics; Computer science; Algorithm; Physics; Geometry; Distributed computing","score_opus":0.034622320597333035,"score_gpt":0.2812098634081065,"score_spread":0.24658754281077347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951836815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006089964,0.00004062142,0.99016654,0.0017586985,0.0009671841,0.00024343727,0.000009236904,0.00008219121,0.00064209494],"genre_scores_gemma":[0.6173879,0.0000041659255,0.37955773,0.0003416004,0.00076737185,0.00005911786,0.00004827281,0.000011977572,0.0018219085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991276,0.000014340211,0.00016091166,0.00032597082,0.00014234112,0.0002287839],"domain_scores_gemma":[0.99901485,0.00009377551,0.00014818214,0.00053716596,0.00012606238,0.00007998255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021176244,0.0001118317,0.00011950759,0.00006980593,0.0006255551,0.00044136672,0.0007492926,0.000051612406,0.000006016327],"category_scores_gemma":[0.00013697402,0.00011065492,0.00006201839,0.00006634326,0.00003285769,0.0005891701,0.00014688133,0.000068732945,0.000021571093],"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.000023018622,0.00006842681,0.000058488433,0.000026282882,0.00006583437,0.000010372882,0.00030250184,0.0017390006,0.01619946,0.035248052,0.005066348,0.9411922],"study_design_scores_gemma":[0.00066595734,0.000111362075,0.0028144098,0.000013164219,0.00000919916,0.000013147204,0.00000822737,0.95991397,0.02589946,0.0035790312,0.006757522,0.00021453464],"about_ca_topic_score_codex":0.000023423008,"about_ca_topic_score_gemma":0.000007711078,"teacher_disagreement_score":0.958175,"about_ca_system_score_codex":0.000024481891,"about_ca_system_score_gemma":0.000087386245,"threshold_uncertainty_score":0.48113272},"labels":[],"label_agreement":null},{"id":"W2952076588","doi":"10.1007/s00453-019-00611-7","title":"Weak Coverage of a Rectangular Barrier","year":2019,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; University of British Columbia; University of Ottawa; Carleton University","funders":"","keywords":"Rectangle; Minimax; Homogeneous; Combinatorics; Metric (unit); Mathematics; Theory of computation; Position (finance); Heuristic; Integer programming; Algorithm; Geometry; Mathematical optimization","score_opus":0.005442089762581016,"score_gpt":0.21502248222305528,"score_spread":0.20958039246047427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952076588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13740118,0.00014093872,0.8531607,0.00024768154,0.000679316,0.00016231241,0.0000054175302,0.00006111834,0.008141339],"genre_scores_gemma":[0.92479455,0.0000067466053,0.07312104,0.00019887954,0.00008495872,0.000004406088,0.000007803891,0.000005164835,0.0017764453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993591,0.000024889554,0.00013322935,0.00018580562,0.00019429208,0.0001027345],"domain_scores_gemma":[0.9995018,0.00006868647,0.00005315875,0.0002642764,0.000072287956,0.000039741895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001287897,0.00006010572,0.00009634909,0.000080587735,0.000021393733,0.000022941751,0.00025766593,0.000031876312,0.000073173],"category_scores_gemma":[0.000024425795,0.00005872965,0.000047713907,0.0003148479,0.000007654547,0.00020114843,0.000079901874,0.000048869362,0.0001130796],"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.000021201358,0.00019452337,0.0012731955,0.00005981458,0.00010361949,0.000013494147,0.00063721975,0.008501774,0.08391679,0.34181228,0.0046741017,0.558792],"study_design_scores_gemma":[0.0010893674,0.00036889268,0.008714337,0.00003829824,0.000011622041,0.0000462154,0.000015598078,0.7255351,0.11264251,0.018504575,0.13260074,0.0004327445],"about_ca_topic_score_codex":0.000007764666,"about_ca_topic_score_gemma":3.811819e-7,"teacher_disagreement_score":0.7873934,"about_ca_system_score_codex":0.000013629341,"about_ca_system_score_gemma":0.000055921442,"threshold_uncertainty_score":0.23949257},"labels":[],"label_agreement":null},{"id":"W2952499512","doi":"10.1007/s00453-011-9521-6","title":"On the Hitting Times of Quantum Versus Random Walks","year":2009,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Agence Nationale de la Recherche; Government of Canada; National University of Singapore; National Research Foundation; Natural Sciences and Engineering Research Council of Canada; European Commission; Centre for Quantum Technologies; Canadian Institute for Advanced Research","keywords":"Hitting time; Quantum walk; Mathematics; Markov chain; Quantum; Quantum algorithm; Ergodic theory; State (computer science); Random walk; Discrete mathematics; Statistical physics; Algorithm; Quantum mechanics; Physics; Pure mathematics; Statistics","score_opus":0.015351017635354937,"score_gpt":0.24683248862861465,"score_spread":0.23148147099325972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952499512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04850197,0.0010295651,0.9129913,0.021105276,0.0069112363,0.0012043149,0.00004707864,0.00080565707,0.0074035954],"genre_scores_gemma":[0.9152101,0.000041662344,0.082981676,0.00069278036,0.0008323559,0.000031199314,0.000018983028,0.000051451836,0.00013977032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968929,0.0003501539,0.0006137414,0.0008998874,0.0007012246,0.0005420872],"domain_scores_gemma":[0.9953457,0.0020395673,0.0005462857,0.0018142657,0.00014417438,0.00010997433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009780896,0.00049504946,0.00066392194,0.00019279856,0.00026228797,0.00022722062,0.00306347,0.0002836333,0.000028785427],"category_scores_gemma":[0.00031659938,0.0003348145,0.00043687824,0.00034194722,0.00013498453,0.000056693047,0.0016162728,0.0014281451,0.000034519813],"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.00019276219,0.00026515714,0.0000020394775,0.00009373676,0.00032565117,0.00006815255,0.0015193537,0.03879872,0.00007563593,0.366224,0.0072415415,0.5851933],"study_design_scores_gemma":[0.0010449359,0.00027374914,0.00005448808,0.00025459795,0.000028626046,0.0000092918435,0.000014082062,0.8685174,0.0009870474,0.12747811,0.0009652358,0.00037241855],"about_ca_topic_score_codex":0.000059541242,"about_ca_topic_score_gemma":9.744163e-7,"teacher_disagreement_score":0.86670816,"about_ca_system_score_codex":0.000050255647,"about_ca_system_score_gemma":0.0002135895,"threshold_uncertainty_score":0.9999104},"labels":[],"label_agreement":null},{"id":"W2952863744","doi":"10.1007/s004530010078","title":"Circular Separability of Polygons","year":2001,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Polygon (computer graphics); Separable space; Combinatorics; Regular polygon; Mathematics; Point (geometry); Line (geometry); Planar; Set (abstract data type); Line segment; Convex set; Computer science; Geometry; Mathematical analysis; Convex optimization; Computer graphics (images)","score_opus":0.019312491417049823,"score_gpt":0.26891320208100056,"score_spread":0.24960071066395073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952863744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030502006,0.00056969456,0.9653507,0.00066910574,0.0010130855,0.00022746068,0.000020058465,0.00010866005,0.0015392457],"genre_scores_gemma":[0.8653436,0.000037948794,0.13392192,0.00012457071,0.00028172872,0.000026595611,0.000060334038,0.0000096413405,0.00019370523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841946,0.00009824708,0.00037207076,0.000557849,0.00036334645,0.00018902899],"domain_scores_gemma":[0.9985062,0.000072506526,0.00020263788,0.000906027,0.00023018182,0.00008243544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003235529,0.00017873694,0.00028147208,0.00017285315,0.00005748392,0.000065121305,0.00088667736,0.00017474015,0.000025671825],"category_scores_gemma":[0.000055151217,0.00019152267,0.00018312527,0.0003997394,0.00004885902,0.00011802344,0.0008722158,0.00027998173,0.000023512472],"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.000019528195,0.0011989217,0.0009896116,0.0006781768,0.00042445227,0.00008648155,0.0014585052,0.12877005,0.0032634127,0.073773414,0.0047704666,0.784567],"study_design_scores_gemma":[0.00037622455,0.000096265176,0.007675031,0.00010283104,0.000048788326,0.00005747338,0.000009619334,0.7607206,0.012547119,0.20689407,0.010808928,0.0006630148],"about_ca_topic_score_codex":0.0000703029,"about_ca_topic_score_gemma":0.0000018669734,"teacher_disagreement_score":0.83484155,"about_ca_system_score_codex":0.000057862253,"about_ca_system_score_gemma":0.0003004876,"threshold_uncertainty_score":0.78100675},"labels":[],"label_agreement":null},{"id":"W2963428578","doi":"10.1007/s00453-016-0270-4","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Linear programming relaxation; Mathematics; Relaxation (psychology); Combinatorics; Approximation algorithm; Tree (set theory); Type (biology); Integer programming; Discrete mathematics; Algorithm","score_opus":0.03793119707476595,"score_gpt":0.2855363821876297,"score_spread":0.24760518511286378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963428578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013092515,0.00021570658,0.9745067,0.001434364,0.0015727873,0.00060286315,0.000016340375,0.0003808224,0.008177936],"genre_scores_gemma":[0.28152823,0.00007861943,0.7157683,0.000444743,0.0009443607,0.00024780587,0.000027473421,0.000043980053,0.00091653585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980791,0.00008520246,0.00037832928,0.00064179057,0.0003899976,0.00042553278],"domain_scores_gemma":[0.9981139,0.00011203418,0.0003507387,0.0012108876,0.00008951643,0.00012294287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043964098,0.0002441303,0.00028368266,0.00014484953,0.001274393,0.0008981061,0.0014895607,0.000092041264,0.000013934519],"category_scores_gemma":[0.00005608294,0.00023480893,0.00009489994,0.00019167215,0.00021297431,0.0011487685,0.00076454063,0.0002313544,0.000039297982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039523748,0.00008169811,0.000277073,0.000030684496,0.00004210726,0.000030307483,0.0006609777,0.0000012594218,0.00021420614,0.036734372,0.00059766433,0.9613257],"study_design_scores_gemma":[0.0018695837,0.00024677807,0.00911468,0.00015001166,0.000058092573,0.00018666951,0.00024637082,0.9021272,0.004755171,0.06335167,0.016839894,0.0010539049],"about_ca_topic_score_codex":0.00019819355,"about_ca_topic_score_gemma":0.000031618245,"teacher_disagreement_score":0.9602718,"about_ca_system_score_codex":0.000035203404,"about_ca_system_score_gemma":0.000052350533,"threshold_uncertainty_score":0.98017293},"labels":[],"label_agreement":null},{"id":"W2963550906","doi":"10.1007/s00453-017-0275-7","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear programming relaxation; Combinatorics; Relaxation (psychology); Theory of computation; Tree (set theory); Approximation algorithm; Integer programming; Integer (computer science); Discrete mathematics; Algorithm; Computer science","score_opus":0.08491445882408623,"score_gpt":0.39161509114688065,"score_spread":0.30670063232279443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963550906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015842168,0.00013759061,0.9587885,0.0020889489,0.00054525177,0.0015952024,0.00004942852,0.00047634976,0.02047657],"genre_scores_gemma":[0.015288727,0.00009143356,0.97696984,0.00009653403,0.0004876823,0.00019732336,0.000046949335,0.00009563359,0.006725874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980243,0.00008093198,0.00046374017,0.00047257106,0.00050288293,0.00045561363],"domain_scores_gemma":[0.9981675,0.00023988084,0.00042007913,0.00084173767,0.00019348363,0.00013731464],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004967726,0.00024535396,0.00032427793,0.00015139679,0.0015541348,0.00023013038,0.0004616872,0.00012445477,0.00014458956],"category_scores_gemma":[0.0009248133,0.00023298665,0.00006928364,0.00014161044,0.00021671463,0.0006459405,0.0004644614,0.00028624127,0.000040907526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053095035,0.0003602957,0.00018480851,0.00019378014,0.00018084435,0.000041143878,0.0021821237,0.000031371736,0.000728535,0.024931157,0.006211155,0.9649017],"study_design_scores_gemma":[0.003941186,0.0003624261,0.0004050306,0.00019412105,0.00012314194,0.00009934319,0.00078442495,0.7659456,0.009667406,0.20306318,0.014311028,0.0011031216],"about_ca_topic_score_codex":0.00004543575,"about_ca_topic_score_gemma":0.000017755257,"teacher_disagreement_score":0.9637986,"about_ca_system_score_codex":0.00008200858,"about_ca_system_score_gemma":0.000060879785,"threshold_uncertainty_score":0.9997457},"labels":[],"label_agreement":null},{"id":"W2969438384","doi":"10.1007/s00453-020-00784-6","title":"Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers","year":2021,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Japan Science and Technology Agency; Exploratory Research for Advanced Technology; Division of Emerging Frontiers in Research and Innovation; National Science Foundation; Ministerio de Economía y Competitividad; Generalitat de Catalunya; Austrian Science Fund","keywords":"Control reconfiguration; Reconfigurability; Modular design; Facet (psychology); Computer science; Topology (electrical circuits); Robot; Mathematics; Combinatorics; Artificial intelligence; Embedded system","score_opus":0.008207821377004347,"score_gpt":0.19143685038131214,"score_spread":0.1832290290043078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969438384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11903553,0.0045325668,0.86821216,0.00055200537,0.002872189,0.00089538516,0.00027498804,0.0004368668,0.0031883025],"genre_scores_gemma":[0.99170333,0.0010558309,0.0059842854,0.000051206112,0.00015613795,0.00004049174,0.0005575241,0.0000878825,0.00036332742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842936,0.00009220064,0.0004581732,0.0004267712,0.0002926295,0.00030088064],"domain_scores_gemma":[0.998737,0.000061347564,0.00012955295,0.00081084314,0.00018131312,0.00007996383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016810404,0.00034911575,0.00043582692,0.000085478365,0.00006741274,0.00008984601,0.00057949015,0.00036869658,0.000277152],"category_scores_gemma":[0.000047169713,0.00031013053,0.00018977658,0.00020081707,0.000083242645,0.00009703542,0.00017270459,0.0006886404,0.0000149503085],"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.0000059820677,0.000049023107,0.0000059061476,0.0002450413,0.00053957826,0.000023221697,0.0015326265,0.8980288,0.030060409,0.00026546305,0.0062146005,0.063029334],"study_design_scores_gemma":[0.00021068663,0.00003963356,0.00013147864,0.00023826143,0.00012262033,0.000011980705,0.00089691277,0.8577112,0.13602826,0.00033881742,0.0036082584,0.0006618676],"about_ca_topic_score_codex":0.0003779785,"about_ca_topic_score_gemma":0.000032234242,"teacher_disagreement_score":0.8726678,"about_ca_system_score_codex":0.00011793639,"about_ca_system_score_gemma":0.000074234595,"threshold_uncertainty_score":0.9999351},"labels":[],"label_agreement":null},{"id":"W2977712778","doi":"10.1007/s00453-020-00752-0","title":"Building a Nest by an Automaton","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Narodowym Centrum Nauki; Université du Québec en Outaouais","keywords":"Algorithm; Computer science; Tree (set theory); Robot; Geometry; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.019838259336137455,"score_gpt":0.26788215972330226,"score_spread":0.2480439003871648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977712778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009056698,0.000030451596,0.98748654,0.010155861,0.00007385047,0.000094867304,0.0000028478216,0.00048284998,0.00076704525],"genre_scores_gemma":[0.11961555,0.000009406477,0.87461644,0.00548767,0.000115272276,0.000012723779,0.0000095988935,0.000015759038,0.00011755272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991407,0.000048840047,0.000119535514,0.00029386338,0.00019028955,0.00020680089],"domain_scores_gemma":[0.9994363,0.000021256772,0.00003018739,0.00022249586,0.000041341485,0.00024838696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009191039,0.00007884146,0.00008654909,0.000027241234,0.00008846154,0.00019470029,0.0006492445,0.00003506183,0.000037633123],"category_scores_gemma":[0.000023647277,0.00007650882,0.000024569781,0.00033901643,0.000019942523,0.0005441385,0.00014984912,0.0000975272,0.000099323486],"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.000006080599,0.0002549766,0.0001696438,0.000038713566,0.000037619004,0.00006238953,0.003777247,0.0034132178,0.021406583,0.1506468,0.08471278,0.73547393],"study_design_scores_gemma":[0.00016650946,0.000088748464,0.00002508304,0.0000028459003,9.4802414e-7,0.0000047084804,0.000007820269,0.9482043,0.0031826638,0.0005944341,0.047614615,0.00010732007],"about_ca_topic_score_codex":0.000012328938,"about_ca_topic_score_gemma":2.8134278e-7,"teacher_disagreement_score":0.9447911,"about_ca_system_score_codex":0.000011834234,"about_ca_system_score_gemma":0.000038100687,"threshold_uncertainty_score":0.31199393},"labels":[],"label_agreement":null},{"id":"W3004144975","doi":"10.1007/s00453-023-01201-4","title":"Approximations for Throughput Maximization","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Las vegas; Combinatorics; Schedule; Approximation algorithm; Mathematics; Computer science; Discrete mathematics; Algorithm","score_opus":0.018538962459733195,"score_gpt":0.28992695283353953,"score_spread":0.27138799037380634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004144975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000055135465,0.0001554433,0.98976564,0.0051485784,0.0004265096,0.00032036065,0.000010183921,0.00048310237,0.0036846462],"genre_scores_gemma":[0.0094900755,0.000031373183,0.9866496,0.0003691272,0.0001398776,0.00014784292,0.000041147792,0.00001481884,0.0031161772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992943,0.000019536854,0.00013124156,0.00025580561,0.00013189204,0.00016726356],"domain_scores_gemma":[0.9995359,0.000091356436,0.000015315472,0.00022315174,0.00008626888,0.000047978057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016734049,0.000067917295,0.000062988176,0.000099550016,0.00011354741,0.00036515016,0.00029861496,0.00003804748,0.000035186316],"category_scores_gemma":[0.00003173378,0.00006151625,0.000049175218,0.00043999558,0.000019081497,0.0005649868,0.000064599146,0.00005898292,0.00010504498],"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":[6.3492104e-7,0.000024555451,0.0000010942646,0.00004776617,0.000015938156,0.0000016997496,0.00045938478,0.0020925517,0.000056823243,0.79265565,0.011086157,0.19355775],"study_design_scores_gemma":[0.000088477405,0.00002509535,0.0000041960875,0.00001111844,0.0000023549,0.0000048930165,0.000006783788,0.8626434,0.00032373256,0.035873942,0.10094359,0.000072423136],"about_ca_topic_score_codex":0.000002646345,"about_ca_topic_score_gemma":5.4727997e-7,"teacher_disagreement_score":0.8605508,"about_ca_system_score_codex":0.000026183605,"about_ca_system_score_gemma":0.00007232126,"threshold_uncertainty_score":0.35211515},"labels":[],"label_agreement":null},{"id":"W3005602433","doi":"10.1007/s00453-017-0376-3","title":"Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Theory of computation; Algorithm; Logarithm; Combinatorics","score_opus":0.021687456885733227,"score_gpt":0.29168267544435494,"score_spread":0.26999521855862174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005602433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022387015,0.00007243969,0.9740406,0.002134249,0.00058110896,0.0001980206,0.0000061843252,0.000062476334,0.00051788177],"genre_scores_gemma":[0.48398367,0.0000055311352,0.5143836,0.00021940187,0.00036409099,0.000056215657,0.000006205672,0.00000679792,0.0009744816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914724,0.00001308994,0.00016109706,0.0003287686,0.0001427026,0.00020709967],"domain_scores_gemma":[0.9990315,0.00013686034,0.00015638517,0.00050118426,0.00011404545,0.000060013615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023555447,0.00010229165,0.00012230025,0.000047844733,0.00060538156,0.00038876597,0.00086440187,0.000041920444,0.0000046583436],"category_scores_gemma":[0.00019135764,0.00010204502,0.0000686203,0.000049335235,0.000047267637,0.00043259596,0.00015420768,0.00005015423,0.000029190569],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029977582,0.00006627322,0.000054660126,0.000028489485,0.000024950723,0.000019983698,0.00029544166,0.0010974108,0.0014986086,0.03137227,0.0027968197,0.9627151],"study_design_scores_gemma":[0.0009031639,0.0001694405,0.0036905666,0.000023331559,0.000012835652,0.000035642654,0.00000542459,0.92259556,0.014125586,0.007222104,0.05094172,0.00027460195],"about_ca_topic_score_codex":0.0000057610787,"about_ca_topic_score_gemma":0.0000021953413,"teacher_disagreement_score":0.9624405,"about_ca_system_score_codex":0.000016570695,"about_ca_system_score_gemma":0.00005689339,"threshold_uncertainty_score":0.46561667},"labels":[],"label_agreement":null},{"id":"W3011231967","doi":"10.1007/s00453-010-9440-y","title":"Biased Range Trees","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Data structure; Range query (database); Range (aeronautics); Range tree; Theory of computation; Computer science; Mathematics; Tree (set theory); Preprocessor; Tree structure; Set (abstract data type); Query optimization; Combinatorics; Binary tree; Discrete mathematics; Algorithm; Interval tree; Data mining; Sargable; Web search query; Information retrieval; Search engine; Artificial intelligence","score_opus":0.010256384292339894,"score_gpt":0.22795302363897205,"score_spread":0.21769663934663216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011231967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014644396,0.0000627464,0.94292814,0.005640151,0.0038963638,0.00036706665,0.000029197143,0.0010952929,0.03133663],"genre_scores_gemma":[0.37358198,0.000019158542,0.61704564,0.0017440626,0.0011624924,0.000054835873,0.000052173047,0.00003580063,0.0063038836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988943,0.000020172538,0.00015181568,0.00037963837,0.00025005307,0.00030404676],"domain_scores_gemma":[0.9988817,0.000056173987,0.000048731705,0.0008698047,0.000036985526,0.00010657887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023113214,0.00013416036,0.0001239185,0.0001209458,0.00011096969,0.00027553606,0.0014388959,0.000052013995,0.00012422702],"category_scores_gemma":[0.000033492775,0.00011898604,0.00006417732,0.00036478534,0.00005182286,0.0007966937,0.00036737145,0.00020067503,0.00060862175],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018088729,0.00009614047,0.00020958483,0.00000445095,0.000023746781,0.000057115052,0.0000965748,9.1626765e-7,0.001883259,0.067077145,0.020306708,0.91024256],"study_design_scores_gemma":[0.001629485,0.00013313355,0.013050464,0.0000133535905,0.00002566268,0.000036029818,0.000027960641,0.21112183,0.008270632,0.013987596,0.75083584,0.0008680275],"about_ca_topic_score_codex":0.00003467675,"about_ca_topic_score_gemma":0.000027756132,"teacher_disagreement_score":0.90937454,"about_ca_system_score_codex":0.000006210685,"about_ca_system_score_gemma":0.000020635696,"threshold_uncertainty_score":0.78228045},"labels":[],"label_agreement":null},{"id":"W3013656193","doi":"10.1007/s00453-022-00972-6","title":"Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Linear programming relaxation; Theory of computation; Combinatorics; Randomized rounding; Approximation algorithm; Vertex (graph theory); Binary logarithm; Time complexity; Mathematics; Minification; Linear programming; Steiner tree problem; Polynomial-time approximation scheme; Tree (set theory); Discrete mathematics; Running time; Graph; Computer science; Mathematical optimization; Algorithm","score_opus":0.014571129644288744,"score_gpt":0.23388604405281202,"score_spread":0.21931491440852327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013656193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015425651,0.00008945093,0.99320567,0.0026646878,0.00047081753,0.001430445,0.00013665092,0.00022464174,0.00023508306],"genre_scores_gemma":[0.035814643,0.0000026742455,0.95779943,0.0011461021,0.000595263,0.0021717697,0.0005776376,0.00005170676,0.0018407612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982854,0.00009061118,0.00034768364,0.00053958053,0.00035223167,0.00038449198],"domain_scores_gemma":[0.99881864,0.00036666726,0.00017869055,0.00046790083,0.000084029074,0.00008408699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004926285,0.00018086797,0.00023110303,0.00011654622,0.000828469,0.00013075751,0.0008344679,0.000053403637,0.000050950213],"category_scores_gemma":[0.00007316404,0.00020751765,0.00017692355,0.00034838388,0.000046436224,0.00024531034,0.00036284744,0.00012613447,0.000010455671],"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.0003130083,0.0013730831,0.000025368223,0.00015387923,0.00021756577,0.000006444032,0.0026842218,0.0029582193,0.0012673384,0.09241436,0.12107853,0.77750796],"study_design_scores_gemma":[0.001175188,0.0005596405,0.000018608602,0.000006754557,0.000013994768,0.000011912922,0.0000869351,0.8614079,0.0006746474,0.0059569757,0.12984459,0.00024287848],"about_ca_topic_score_codex":0.000007813062,"about_ca_topic_score_gemma":5.3943427e-7,"teacher_disagreement_score":0.85844964,"about_ca_system_score_codex":0.00017975281,"about_ca_system_score_gemma":0.00009079654,"threshold_uncertainty_score":0.8462324},"labels":[],"label_agreement":null},{"id":"W3018254556","doi":"10.1007/s00453-024-01286-5","title":"Symmetry Breaking in the Plane","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Symmetry breaking; Theory of computation; Combinatorics; Mathematics; Computer science; Symmetry (geometry); Discrete mathematics; Physics; Theoretical physics; Geometry; Algorithm; Quantum mechanics","score_opus":0.014734001092750504,"score_gpt":0.26918003697773385,"score_spread":0.2544460358849833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018254556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007063572,0.0006810294,0.9580949,0.013429545,0.0005632022,0.00019642845,0.0000028747206,0.00028796756,0.026037706],"genre_scores_gemma":[0.9254565,0.000051675284,0.071712226,0.0018633442,0.00018602671,0.000027164824,0.000007269425,0.000011218673,0.00068454095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999327,0.00006081501,0.000094649666,0.00017456978,0.00018256581,0.00016038874],"domain_scores_gemma":[0.9995879,0.00014987595,0.000007785437,0.00021958377,0.000011378805,0.000023502662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037098455,0.000051129442,0.000047175065,0.000104305196,0.000043255313,0.00031962097,0.0005640248,0.000025331736,0.000021336733],"category_scores_gemma":[0.00001354482,0.000033760258,0.00002173772,0.00061476196,0.000016161943,0.00021906428,0.000080024096,0.00015886703,0.00015233456],"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":[6.424757e-7,0.00003576147,0.00003557701,0.000023098997,0.000009940826,0.00019800011,0.0023007484,0.0002186602,0.00004789745,0.436876,0.007418997,0.5528347],"study_design_scores_gemma":[0.000107369786,0.000043624645,0.00032331113,0.000046807298,0.000001602419,0.00009053559,0.00006610657,0.91178626,0.00012183795,0.010792433,0.07650883,0.00011129067],"about_ca_topic_score_codex":0.000032258773,"about_ca_topic_score_gemma":0.000004406032,"teacher_disagreement_score":0.92475015,"about_ca_system_score_codex":0.000015330184,"about_ca_system_score_gemma":0.00003480788,"threshold_uncertainty_score":0.30821124},"labels":[],"label_agreement":null},{"id":"W3021716813","doi":"10.1007/s00453-009-9293-4","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Society for the Study of School Psychology","keywords":"Spanner; Greedy algorithm; Combinatorics; Dimension (graph theory); Logarithm; Mathematics; Time complexity; Running time; Upper and lower bounds; Bounded function; Quadratic equation; Binary logarithm; Metric space; Metric (unit); Euclidean space; Discrete mathematics; Computer science; Algorithm","score_opus":0.006244191694777135,"score_gpt":0.22700146719690986,"score_spread":0.22075727550213273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021716813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09516205,0.0001807879,0.8886181,0.012600196,0.00036418563,0.0002525567,8.783066e-7,0.00014746905,0.0026737854],"genre_scores_gemma":[0.9286699,0.0000013398294,0.06908312,0.0016442243,0.00019740277,0.0000020981217,0.0000060463335,0.0000037025573,0.00039213046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990751,0.00007658165,0.00019542083,0.0002350879,0.00021243325,0.00020534683],"domain_scores_gemma":[0.99946445,0.00013007665,0.00005110231,0.00026558965,0.000047621044,0.00004118239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033300318,0.000093678456,0.00010100168,0.00006893509,0.00017554565,0.00019364816,0.0004718193,0.000033066375,0.000015031276],"category_scores_gemma":[0.000032552955,0.00007121839,0.00003826012,0.0006706485,0.000024923635,0.00023156476,0.00007447566,0.00012746712,0.00020694653],"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.0000037916793,0.00012486821,0.000063870466,0.0000027534618,0.000009938166,0.000029766787,0.0012452654,0.0343934,0.0010486987,0.02426555,0.0028329259,0.9359792],"study_design_scores_gemma":[0.00017621051,0.00005935538,0.011477307,0.000008634046,0.0000019405704,0.000024315153,0.000005683263,0.9762887,0.0004057683,0.00917013,0.0022760096,0.00010598505],"about_ca_topic_score_codex":0.000013000063,"about_ca_topic_score_gemma":0.0000024426542,"teacher_disagreement_score":0.94189525,"about_ca_system_score_codex":0.000027084798,"about_ca_system_score_gemma":0.00006201203,"threshold_uncertainty_score":0.29042017},"labels":[],"label_agreement":null},{"id":"W3022352819","doi":"10.1007/s00453-023-01122-2","title":"Almost Universal Anonymous Rendezvous in the Plane","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Rendezvous; Theory of computation; Set (abstract data type); Computer science; Algorithm; Plane (geometry); Mathematics; Combinatorics; Geometry; Physics","score_opus":0.02015590187175076,"score_gpt":0.25314379735999765,"score_spread":0.2329878954882469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022352819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019593585,0.00023403265,0.75424725,0.08975726,0.002095204,0.0018631025,0.000055307177,0.0028081029,0.12934618],"genre_scores_gemma":[0.91797274,0.0002552813,0.0666988,0.0043758317,0.0003038149,0.00006324564,0.00012602442,0.000039088314,0.010165204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990821,0.00010089246,0.00010549134,0.00020210525,0.0002491743,0.00026022742],"domain_scores_gemma":[0.99944127,0.00013109224,0.000022190525,0.0003381619,0.00002506847,0.000042219745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003592394,0.00006704233,0.0000685903,0.00013535649,0.00008966355,0.00009823595,0.00084622874,0.0000358562,0.000024847317],"category_scores_gemma":[0.000023497543,0.000050157887,0.000022181273,0.0011239045,0.000031857653,0.00018210325,0.00015038521,0.00013982499,0.00037022642],"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.000023380919,0.00038707198,0.0007614302,0.000034717472,0.000055642442,0.0028833996,0.026619768,0.015497678,0.0005036758,0.2455307,0.21582906,0.49187347],"study_design_scores_gemma":[0.00079962757,0.00015302825,0.0031903302,0.000013796127,0.0000025765366,0.00008083646,0.0006662471,0.9003433,0.00017296872,0.0047408463,0.08957673,0.00025969048],"about_ca_topic_score_codex":0.00006720139,"about_ca_topic_score_gemma":0.000019772324,"teacher_disagreement_score":0.89837915,"about_ca_system_score_codex":0.000020738089,"about_ca_system_score_gemma":0.00005144715,"threshold_uncertainty_score":0.4758635},"labels":[],"label_agreement":null},{"id":"W3023308714","doi":"10.1007/s00453-020-00724-4","title":"Deterministic Treasure Hunt in the Plane with Angular Hints","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Treasure; Combinatorics; Vertex (graph theory); Plane (geometry); Position (finance); Mathematics; Euclidean geometry; Algorithm; Computer science; Topology (electrical circuits); Geometry; Finance","score_opus":0.02181661713673369,"score_gpt":0.22067070731841365,"score_spread":0.19885409018167996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023308714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064302576,0.000096169766,0.9569335,0.02987957,0.00009250683,0.0006040405,0.000010089081,0.00020699535,0.0057468656],"genre_scores_gemma":[0.94059813,0.000007663994,0.05469589,0.004522305,0.00006987742,0.000023223798,0.000007903176,0.000008804637,0.000066180626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991248,0.000094395866,0.00010988724,0.00022362698,0.00026456933,0.00018272258],"domain_scores_gemma":[0.99954677,0.0000654444,0.000028176883,0.00025158256,0.000029078195,0.00007892851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000153017,0.00008148449,0.00009259746,0.000032055555,0.000057497728,0.00011567668,0.00066997495,0.000026749607,0.000020203286],"category_scores_gemma":[0.000032258453,0.00005010825,0.000017561466,0.00037868146,0.00003330786,0.00013140097,0.00006192296,0.0001387815,0.00005927637],"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.00016607184,0.0009554582,0.005345033,0.00018604337,0.00015277344,0.004010973,0.07244902,0.013679203,0.00084025186,0.058329053,0.017261826,0.8266243],"study_design_scores_gemma":[0.0011728983,0.000657088,0.004235429,0.000029201321,0.000007826296,0.000093501185,0.00022037362,0.9741439,0.0002846126,0.00078526244,0.018067932,0.0003019435],"about_ca_topic_score_codex":0.000017824708,"about_ca_topic_score_gemma":0.000009938498,"teacher_disagreement_score":0.9604647,"about_ca_system_score_codex":0.0000103050415,"about_ca_system_score_gemma":0.000050390685,"threshold_uncertainty_score":0.20433553},"labels":[],"label_agreement":null},{"id":"W3026866611","doi":"10.1007/s00453-021-00920-w","title":"Online Coloring and a New Type of Adversary for Online Graph Problems","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Parameterized complexity; Adversary; Bipartite graph; Competitive analysis; Bounded function; Discrete mathematics; Treewidth; Upper and lower bounds; Graph; Computer science; Line graph; Pathwidth","score_opus":0.0654509948533736,"score_gpt":0.2981127694963594,"score_spread":0.2326617746429858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026866611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029023448,0.001078805,0.9610444,0.0059742527,0.0007469223,0.0013935163,0.00021156811,0.00024800576,0.00027911764],"genre_scores_gemma":[0.0333003,0.0001456058,0.9639758,0.0006598842,0.000102291386,0.000042263666,0.00012944837,0.00002085339,0.0016235812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991963,0.000033196433,0.00018488835,0.0002284112,0.00018382109,0.00017342062],"domain_scores_gemma":[0.99948394,0.00007247081,0.00007256281,0.00019588634,0.000085954685,0.00008918936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016418875,0.000073609175,0.00013128831,0.0001145166,0.00012128785,0.000020744987,0.00036357276,0.000019947498,0.000026541022],"category_scores_gemma":[0.00002863124,0.00007490521,0.000034846747,0.00047718541,0.000027226071,0.00014411182,0.00036045822,0.0001071794,6.23359e-7],"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.00016644053,0.002712716,0.0013061126,0.00038901967,0.000271998,0.00002332713,0.0059194323,0.0849569,0.0036985537,0.055640467,0.023107907,0.82180715],"study_design_scores_gemma":[0.0014258532,0.0010216028,0.0005718255,0.00001848974,0.00001079365,0.000018978213,0.00013216131,0.92573947,0.00021273278,0.0078685,0.06277857,0.0002010339],"about_ca_topic_score_codex":0.000066446766,"about_ca_topic_score_gemma":0.000012536157,"teacher_disagreement_score":0.8407826,"about_ca_system_score_codex":0.000018969458,"about_ca_system_score_gemma":0.0001385608,"threshold_uncertainty_score":0.30545458},"labels":[],"label_agreement":null},{"id":"W3027090837","doi":"10.1007/s00453-020-00716-4","title":"The Inverse Voronoi Problem in Graphs I: Hardness","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Javna Agencija za Raziskovalno Dejavnost RS; Agence Nationale de la Recherche","keywords":"Voronoi diagram; Parameterized complexity; Combinatorics; Mathematics; Pathwidth; Treewidth; Discrete mathematics; Shortest path problem; Planar graph; Chordal graph; Graph; Geometry; Line graph","score_opus":0.015919088431514503,"score_gpt":0.22144724387770448,"score_spread":0.20552815544618996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027090837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012508115,0.00025269046,0.95192075,0.0322671,0.0006947701,0.00034460172,0.0000023956147,0.00016229911,0.0018472928],"genre_scores_gemma":[0.747198,0.0000773047,0.24553198,0.005933482,0.00042137425,0.00009661835,0.000018057664,0.000017791497,0.0007054025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923575,0.000056366804,0.0001551861,0.00022783002,0.00016686287,0.00015800195],"domain_scores_gemma":[0.9996143,0.00007000098,0.000038814836,0.00015769905,0.000046947018,0.00007226403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017502742,0.00007153048,0.00006859963,0.000041771615,0.00012666237,0.0001175807,0.00047017983,0.000025396263,0.0000048147836],"category_scores_gemma":[0.00003363422,0.000055600103,0.000034091998,0.0006871585,0.000025823103,0.0002495623,0.00013245564,0.00009979257,0.000069101974],"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.000015226059,0.00007138861,0.00034138793,0.000016608965,0.000025362036,0.000030396728,0.0024123294,0.00648563,0.0007890228,0.20776002,0.027579071,0.75447357],"study_design_scores_gemma":[0.00041575625,0.000073035866,0.0020555553,0.000006544837,0.0000026202022,0.000006065799,0.000043989312,0.86337113,0.0014771497,0.027398814,0.10497773,0.00017160806],"about_ca_topic_score_codex":0.000013459136,"about_ca_topic_score_gemma":0.000025260984,"teacher_disagreement_score":0.8568855,"about_ca_system_score_codex":0.00001657549,"about_ca_system_score_gemma":0.000066180786,"threshold_uncertainty_score":0.22673063},"labels":[],"label_agreement":null},{"id":"W3087949895","doi":"10.1007/s00453-020-00769-5","title":"On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Bounded function; Combinatorics; Mathematics; Theory of computation; Computer science; Discrete mathematics; Graph; Algorithm; Pathwidth","score_opus":0.013151739612575262,"score_gpt":0.2044343008246829,"score_spread":0.19128256121210763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087949895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04429655,0.00004027279,0.9437138,0.0078594005,0.00018479294,0.00014623158,0.000008962506,0.0002272444,0.003522737],"genre_scores_gemma":[0.8606428,0.0000023580903,0.13393769,0.0047787433,0.00037523566,0.0000142915005,0.0000320742,0.0000143599,0.00020243967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985393,0.00005310779,0.00019064956,0.0004871577,0.0004704154,0.00025935646],"domain_scores_gemma":[0.9992307,0.00015254365,0.00007570482,0.0002386851,0.00009909394,0.00020327691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011425458,0.00017049667,0.00016023421,0.00009662116,0.00020674865,0.00017994788,0.0004371072,0.000044227345,0.000043449723],"category_scores_gemma":[0.000049846585,0.00014588046,0.000068844514,0.0007512503,0.00003254588,0.00032252836,0.00010444578,0.00016878078,0.00013255789],"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.00013533271,0.0001852033,0.00025095046,0.000017184555,0.00014638218,0.00016455255,0.0007789863,0.013005626,0.0015574779,0.7039222,0.0056888675,0.27414724],"study_design_scores_gemma":[0.0029181293,0.002604339,0.009272167,0.00006667003,0.00005261563,0.00020549983,0.000054178145,0.903147,0.008685805,0.029628275,0.04207647,0.0012888954],"about_ca_topic_score_codex":0.000003095948,"about_ca_topic_score_gemma":0.0000043111863,"teacher_disagreement_score":0.8901413,"about_ca_system_score_codex":0.000030655312,"about_ca_system_score_gemma":0.00020815477,"threshold_uncertainty_score":0.5948832},"labels":[],"label_agreement":null},{"id":"W3092815978","doi":"10.1007/s00453-020-00774-8","title":"The Inverse Voronoi Problem in Graphs II: Trees","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Javna Agencija za Raziskovalno Dejavnost RS; Agence Nationale de la Recherche","keywords":"Voronoi diagram; Combinatorics; Mathematics; Shortest path problem; Inverse; Omega; Metric (unit); Binary logarithm; Tree (set theory); Upper and lower bounds; Path (computing); Discrete mathematics; Graph; Physics; Computer science; Geometry","score_opus":0.021066763030633373,"score_gpt":0.22541036658677052,"score_spread":0.20434360355613715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092815978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05576105,0.0030819143,0.6426828,0.2588414,0.0034390728,0.003044508,0.000049534272,0.0027291195,0.030370634],"genre_scores_gemma":[0.4927835,0.00043069792,0.4963008,0.008681867,0.0006253158,0.00021492409,0.0000126739715,0.00006442124,0.0008858269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983307,0.00010027567,0.00032211366,0.0004886517,0.00030237593,0.0004558758],"domain_scores_gemma":[0.99900943,0.00016981961,0.0000798027,0.0005262385,0.000045993358,0.00016868877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028463386,0.00018791083,0.00019024881,0.000083637824,0.0004694979,0.00018731007,0.001750529,0.00006190611,0.000015002568],"category_scores_gemma":[0.000049983275,0.00014385281,0.00012063404,0.0011324078,0.000178116,0.00038760167,0.0007537436,0.00032742304,0.00006558223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018423869,0.00016127795,0.00046311071,0.000016125936,0.000050848925,0.00007975096,0.005020981,0.00017272787,0.00024952096,0.32097572,0.018927407,0.6538641],"study_design_scores_gemma":[0.0011204345,0.00042742823,0.0026872207,0.000034447665,0.000009675967,0.000021168853,0.00025426046,0.5610643,0.0010461994,0.19638835,0.2363396,0.0006069208],"about_ca_topic_score_codex":0.000096916636,"about_ca_topic_score_gemma":0.0002978679,"teacher_disagreement_score":0.6532572,"about_ca_system_score_codex":0.00002685187,"about_ca_system_score_gemma":0.000070775546,"threshold_uncertainty_score":0.5866147},"labels":[],"label_agreement":null},{"id":"W3109005260","doi":"10.1007/s00453-022-01000-3","title":"Monotone Circuit Lower Bounds from Robust Sunflowers","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"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; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Toronto; Fundação de Amparo à Pesquisa do Estado de São Paulo; Alfred P. Sloan Foundation","keywords":"Mathematics; Monotone polygon; Conjecture; Upper and lower bounds; Combinatorics; Discrete mathematics; Boolean function; Theory of computation; Algorithm","score_opus":0.0248240701737722,"score_gpt":0.21198124739635596,"score_spread":0.18715717722258376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109005260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02918484,0.0006241584,0.95319796,0.00237476,0.005832892,0.0003778154,0.00019522829,0.00085463567,0.0073577403],"genre_scores_gemma":[0.86629534,0.000029218949,0.12745658,0.003109224,0.00076601945,0.00024905952,0.00011110698,0.00006967722,0.0019137629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734676,0.00014197732,0.0003445549,0.0008320967,0.00075816846,0.00057644607],"domain_scores_gemma":[0.998221,0.00018389692,0.00011687649,0.0012276673,0.000061959516,0.00018860004],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033621723,0.00025879723,0.00028743286,0.00020558378,0.0008899363,0.00024355957,0.0023886808,0.000060222592,0.0011466759],"category_scores_gemma":[0.000022635244,0.0002981686,0.00021610556,0.0009943405,0.00012727098,0.00044171224,0.0014703736,0.0005635535,0.00013250887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077241166,0.0022485054,0.00079441065,0.000020372563,0.0006051203,0.0015171444,0.005326694,0.007533645,0.0021058023,0.31603682,0.05145857,0.61227566],"study_design_scores_gemma":[0.0016305129,0.0005310957,0.002454902,0.000016862978,0.00004103846,0.00013337121,0.0003154689,0.41178736,0.0012357575,0.21165413,0.36878014,0.0014193718],"about_ca_topic_score_codex":0.00048965,"about_ca_topic_score_gemma":0.00001258645,"teacher_disagreement_score":0.8371105,"about_ca_system_score_codex":0.00016563188,"about_ca_system_score_gemma":0.00012802091,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W3118763906","doi":"10.1007/s00453-020-00792-6","title":"Approximating the Canadian Traveller Problem with Online Randomization","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Ministry of Science and Technology, Taiwan","keywords":"Competitive analysis; Theory of computation; Randomized algorithm; Combinatorics; Online algorithm; Deterministic algorithm; Bounded function; Time complexity; Vertex (graph theory); Upper and lower bounds; Approximation algorithm; Mathematics; Computer science; Discrete mathematics; Algorithm; Graph","score_opus":0.012957880170396573,"score_gpt":0.22003555062602606,"score_spread":0.2070776704556295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118763906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018635318,0.000056488407,0.9770033,0.014159573,0.00006394208,0.0003264662,0.0000049119926,0.00007526507,0.008123744],"genre_scores_gemma":[0.06823082,0.000018555427,0.9272133,0.0022088205,0.00008814708,0.00004295966,0.00006933363,0.000016885053,0.0021111863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895316,0.00011701546,0.00017295209,0.0002442086,0.00024688896,0.00026578878],"domain_scores_gemma":[0.99917275,0.00006600361,0.000051857016,0.00032663252,0.00024977498,0.0001329622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029438283,0.00008989537,0.00010686044,0.00005547088,0.00037889284,0.00031113176,0.00037132556,0.000040355797,0.000054063315],"category_scores_gemma":[0.0000414835,0.000057380104,0.000027639659,0.0006029952,0.000041305237,0.00020550136,0.000060785056,0.0001555947,0.000018307855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003904985,0.00039623622,0.00027256616,0.0000802173,0.00024762686,0.00021503282,0.011243468,0.066348545,0.00032246902,0.2540124,0.0061071874,0.6607152],"study_design_scores_gemma":[0.0013807156,0.000027110782,0.000112148555,0.00002170212,0.0000056063845,0.000055937322,0.000104962724,0.98625714,0.0005022966,0.0012677626,0.010124396,0.00014019688],"about_ca_topic_score_codex":0.0030611274,"about_ca_topic_score_gemma":0.034922,"teacher_disagreement_score":0.91990864,"about_ca_system_score_codex":0.000049959246,"about_ca_system_score_gemma":0.00064383744,"threshold_uncertainty_score":0.9826881},"labels":[],"label_agreement":null},{"id":"W3127240281","doi":"10.1007/s00453-021-00804-z","title":"Special Issue on Algorithms and Data Structures (WADS 2019)","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Mining and Machine Learning Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Alberta","funders":"Division of Mathematical Sciences; University of Alberta","keywords":"Computer science; Theory of computation; Algorithm","score_opus":0.02182395656702545,"score_gpt":0.30746161241249775,"score_spread":0.2856376558454723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127240281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032775712,0.0011631476,0.8501369,0.04735019,0.007295479,0.0005673103,0.0015194366,0.001319156,0.08737084],"genre_scores_gemma":[0.0043673236,0.0001720441,0.9674293,0.0025286116,0.01666079,0.000016760607,0.0011119881,0.00004156123,0.0076716403],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998506,0.000065841035,0.00016095175,0.0007928433,0.00023653271,0.00023783642],"domain_scores_gemma":[0.99775195,0.00013544784,0.000058611986,0.001881984,0.00005404235,0.000117981865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018609184,0.00014511435,0.00015594078,0.000059409613,0.00020869456,0.00029213986,0.0013065322,0.00006230084,0.00011149475],"category_scores_gemma":[0.00012614446,0.00013801639,0.00002095447,0.00027583458,0.00005760922,0.00032322772,0.0011960755,0.00025651674,0.0002353039],"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":[9.2325945e-7,0.000027032442,0.000016686814,0.0000024892393,0.000013944704,0.000021830612,0.000103821774,0.0000064989727,0.000030700397,0.01116157,0.21377827,0.77483624],"study_design_scores_gemma":[0.00023258288,0.000045269535,0.0028906197,0.000009260141,0.00001109931,0.00009889172,0.000024924917,0.03152507,0.000539138,0.0027967703,0.96162724,0.00019911896],"about_ca_topic_score_codex":0.00006324456,"about_ca_topic_score_gemma":0.0000063359407,"teacher_disagreement_score":0.7746371,"about_ca_system_score_codex":0.000012272473,"about_ca_system_score_gemma":0.000088348526,"threshold_uncertainty_score":0.56281453},"labels":[],"label_agreement":null},{"id":"W3131672637","doi":"10.1007/s00453-022-01007-w","title":"Algorithms and Complexity on Indexing Founder Graphs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"H2020 European Research Council; Academy of Finland; Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; European Commission; Helsingin Yliopisto","keywords":"Combinatorics; Cograph; Time complexity; Discrete mathematics; Mathematics; Chordal graph; Pathwidth; Parameterized complexity; Indifference graph; Computer science; Line graph; Graph","score_opus":0.04296810111341419,"score_gpt":0.2634721082878823,"score_spread":0.2205040071744681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131672637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011455585,0.00047685372,0.97634447,0.003070334,0.0017166235,0.0005308336,0.00013040165,0.000688223,0.005586679],"genre_scores_gemma":[0.57400554,0.000051193954,0.41946545,0.00493794,0.0003523146,0.00020981557,0.00011866829,0.00006873098,0.00079033413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997751,0.00015913711,0.0002572753,0.0007390228,0.00066198804,0.00043158192],"domain_scores_gemma":[0.9987618,0.00014621615,0.00011125653,0.0007609245,0.000043744796,0.00017609641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003953428,0.00023068034,0.0002363947,0.00021207982,0.0010937103,0.0002075799,0.0010726113,0.000046605215,0.00014723306],"category_scores_gemma":[0.000010798953,0.00022212535,0.00007284643,0.00052384916,0.000120949175,0.00044586163,0.0019292046,0.0004707908,0.000026170832],"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.000019658268,0.00027947355,0.00014495538,0.000010174277,0.000046842993,0.00011012214,0.0005442039,0.00015332398,0.00012919419,0.31475767,0.006797504,0.6770069],"study_design_scores_gemma":[0.001461983,0.0008735747,0.0046104644,0.000023075521,0.0000142121025,0.00031490123,0.00021878956,0.6787039,0.00044598294,0.21052161,0.10195358,0.0008578969],"about_ca_topic_score_codex":0.00012493054,"about_ca_topic_score_gemma":0.0000022269853,"teacher_disagreement_score":0.6785506,"about_ca_system_score_codex":0.00008207976,"about_ca_system_score_gemma":0.000054252574,"threshold_uncertainty_score":0.9058009},"labels":[],"label_agreement":null},{"id":"W3185570678","doi":"10.1007/s00453-022-01010-1","title":"On the Kernel and Related Problems in Interval Digraphs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Interval (graph theory); Discrete mathematics; Cardinality (data modeling); Dominating set; Kernel (algebra); Graph; Theory of computation; Algorithm; Computer science","score_opus":0.014542216118628522,"score_gpt":0.25060119586709395,"score_spread":0.23605897974846543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185570678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86645645,0.0014026125,0.08243046,0.026685875,0.0011544648,0.0023948562,0.000029699242,0.00059831445,0.018847257],"genre_scores_gemma":[0.9980257,0.000010584311,0.0010643621,0.00028389678,0.0000057854027,0.00011868996,0.0000012002733,0.000009282123,0.00048051128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986971,0.00027476499,0.0001476316,0.0003248986,0.0002944166,0.00026121325],"domain_scores_gemma":[0.9990958,0.0003739571,0.00003817271,0.00043106187,0.000016030148,0.000044995624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071660685,0.000087374,0.00009249162,0.00016662646,0.00021691588,0.000052816482,0.000888881,0.000019128129,0.0000629654],"category_scores_gemma":[0.000055456232,0.00006497298,0.000035601628,0.00083545165,0.00010322727,0.0001395986,0.0008079118,0.00050548406,0.00001600394],"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.000013247546,0.00014774896,0.0004883332,0.0000057484353,0.0000253482,0.000060122846,0.0027132235,0.0009118358,0.00030923664,0.9221855,0.00062386674,0.07251581],"study_design_scores_gemma":[0.00045135093,0.00032631546,0.0022780641,0.000015138685,0.0000013007526,0.00006415151,0.00018414737,0.08788432,0.000177811,0.9064227,0.0020326495,0.00016208079],"about_ca_topic_score_codex":0.000017685366,"about_ca_topic_score_gemma":0.000003407324,"teacher_disagreement_score":0.13156922,"about_ca_system_score_codex":0.00004081768,"about_ca_system_score_gemma":0.000020922545,"threshold_uncertainty_score":0.2649521},"labels":[],"label_agreement":null},{"id":"W3202895739","doi":"10.1007/s00453-023-01150-y","title":"Algebraic Restriction Codes and Their Applications","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Cryptography and Data Security","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 Waterloo","funders":"","keywords":"Oblivious transfer; Cryptography; Theoretical computer science; Computer science; Secret sharing; Linear code; Bounded function; Communication source; Function (biology); Context (archaeology); Discrete mathematics; Mathematics; Finite field; Block code; Algorithm; Decoding methods","score_opus":0.010293395459974677,"score_gpt":0.22777116782859544,"score_spread":0.21747777236862076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202895739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008962044,0.00015956562,0.9885723,0.0008800787,0.000104107196,0.00015763717,0.000051624964,0.00057159923,0.0005410205],"genre_scores_gemma":[0.93591404,0.0007450334,0.06214284,0.00041655448,0.00030390025,0.00023780185,0.00018888201,0.000015613336,0.000035305715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994102,0.000022756229,0.000088579,0.00025479074,0.000075171134,0.00014850593],"domain_scores_gemma":[0.99941397,0.00010807038,0.000025999097,0.00036723772,0.000023820823,0.000060923154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013085066,0.00007013538,0.00006814387,0.00013036985,0.00017387842,0.00009196462,0.0003020647,0.000036390586,0.00000269888],"category_scores_gemma":[0.000008722993,0.000060530205,0.000028118879,0.0010020392,0.000045022894,0.00023870562,0.00018161997,0.0000721408,0.00006955657],"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.0000011372125,0.000033340857,0.00018056012,0.000008977175,0.00001609075,0.0000027700712,0.00041904056,0.0000016505255,0.00063175976,0.68145365,0.0052692043,0.31198183],"study_design_scores_gemma":[0.00035043756,0.00007972419,0.018415386,0.000011833282,0.0000085342845,0.000030441435,0.0002637675,0.06310691,0.0026475554,0.73636943,0.1783407,0.0003752859],"about_ca_topic_score_codex":0.000019423698,"about_ca_topic_score_gemma":0.000004476317,"teacher_disagreement_score":0.926952,"about_ca_system_score_codex":0.000005100287,"about_ca_system_score_gemma":0.00001379607,"threshold_uncertainty_score":0.24683501},"labels":[],"label_agreement":null},{"id":"W3208757949","doi":"10.1007/s00453-022-01045-4","title":"Shortest Beer Path Queries in Outerplanar Graphs","year":2022,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ackermann function; Combinatorics; Mathematics; Path graph; Shortest path problem; Graph; Distance; Inverse; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.020354054189384185,"score_gpt":0.295687206561516,"score_spread":0.2753331523721318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208757949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04726456,0.0042829663,0.91539675,0.0063902284,0.0068428344,0.0035021238,0.0007289122,0.0019324562,0.013659166],"genre_scores_gemma":[0.588618,0.000851882,0.40279058,0.0013515406,0.00041086503,0.0022309348,0.00048339154,0.00023785839,0.003024936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961539,0.00037751743,0.0004950561,0.001330796,0.00086688006,0.00077586813],"domain_scores_gemma":[0.9972756,0.00027215344,0.00015959573,0.0020216934,0.00009225928,0.00017872582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008463791,0.00042033926,0.00052321295,0.0007481046,0.00018463499,0.00022796365,0.003786861,0.00021494925,0.00016538147],"category_scores_gemma":[0.0000846478,0.00044832364,0.00021608607,0.0009459509,0.00019309559,0.000340307,0.0061857365,0.0019841006,0.000042921365],"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.00008405344,0.0008090553,0.011028844,0.00024466272,0.00028598713,0.003584966,0.006034595,0.005315739,0.00020178358,0.6803206,0.0052880365,0.28680164],"study_design_scores_gemma":[0.00051726727,0.00022364597,0.0054712067,0.0001256003,0.000013260171,0.000060986866,0.0002315678,0.039936632,0.00031647403,0.9224233,0.029369963,0.0013101067],"about_ca_topic_score_codex":0.00021205533,"about_ca_topic_score_gemma":0.00005256056,"teacher_disagreement_score":0.54135346,"about_ca_system_score_codex":0.00020737489,"about_ca_system_score_gemma":0.00029163292,"threshold_uncertainty_score":0.99979687},"labels":[],"label_agreement":null},{"id":"W3213138807","doi":"10.1007/s00453-021-00889-6","title":"Bounded-Angle Minimum Spanning Trees","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University; University of Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Theory of computation; Spanning tree; Minimum spanning tree; Combinatorics; Mathematics; Tree (set theory); Computer science; Discrete mathematics; Algorithm","score_opus":0.021689003908254963,"score_gpt":0.25106207579004597,"score_spread":0.229373071881791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213138807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010798861,0.0010313363,0.9620187,0.004031202,0.0018302684,0.00012105335,0.000012528122,0.0005989095,0.019557115],"genre_scores_gemma":[0.17614207,0.000047530648,0.81716,0.0016173441,0.00064683234,0.000027114078,0.000023543793,0.00003219283,0.0043033645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982168,0.00008226949,0.0002616501,0.000605571,0.00036548523,0.0004681941],"domain_scores_gemma":[0.99858046,0.00015947016,0.00006857925,0.0008973127,0.00014172503,0.00015245641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017739298,0.00019213354,0.00023564065,0.00010590185,0.0002980229,0.00038441332,0.00096405967,0.00008081358,0.00012337633],"category_scores_gemma":[0.00006603633,0.00020237645,0.0001686976,0.0007929329,0.00009749021,0.00047007992,0.0006168376,0.00022165795,0.00017154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000418387,0.00037118277,0.00020288824,0.000021963757,0.00012849763,0.00085545157,0.0017305803,0.000040052048,0.0025520553,0.2919221,0.010916113,0.691255],"study_design_scores_gemma":[0.0015041445,0.00023404918,0.0046743695,0.00012380535,0.000043769902,0.0007810596,0.0004905984,0.33141267,0.05372064,0.30914035,0.2964352,0.0014393289],"about_ca_topic_score_codex":0.000027849932,"about_ca_topic_score_gemma":0.000023002805,"teacher_disagreement_score":0.68981564,"about_ca_system_score_codex":0.0000374408,"about_ca_system_score_gemma":0.00015523369,"threshold_uncertainty_score":0.8252672},"labels":[],"label_agreement":null},{"id":"W4213194262","doi":"10.1007/s00453-019-00636-y","title":"Stable Matchings with Covering Constraints: A Complete Computational Trichotomy","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"European Research Council; Hungarian Scientific Research Fund; Fonds National de la Recherche Luxembourg; Deutsche Forschungsgemeinschaft","keywords":"Trichotomy (philosophy); Parameterized complexity; Combinatorics; Mathematics; Matching (statistics); Time complexity; Bipartite graph; Stable marriage problem; Theory of computation; Discrete mathematics; Corollary; Computational complexity theory; Algorithm; Graph; Statistics","score_opus":0.03579816660532784,"score_gpt":0.20107689903845288,"score_spread":0.16527873243312505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213194262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22418022,0.00033238187,0.72161543,0.002851186,0.0003034552,0.00062169274,0.0008990824,0.0003158534,0.048880704],"genre_scores_gemma":[0.9874281,0.0000018524207,0.01117429,0.0010296035,0.00013057674,0.000013311207,0.00003189542,0.000024976041,0.0001653572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989519,0.000019708086,0.00039430615,0.00033925957,0.000049792365,0.00024503155],"domain_scores_gemma":[0.99939597,0.00010130375,0.00023025388,0.00011906392,0.00002968078,0.0001237218],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026840894,0.00014013187,0.0003481629,0.00006211426,0.00010926624,0.00008825371,0.0001815296,0.000043676555,0.00048364035],"category_scores_gemma":[0.000042550742,0.00014966438,0.00005562706,0.00022832496,0.00009910664,0.00016599966,0.000036539917,0.0001549024,0.0008229136],"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.00015181114,0.00012951998,0.0128942495,0.00020793102,0.000362451,0.000077043376,0.0041991537,0.009213496,0.00011833759,0.9675328,0.001923112,0.0031900678],"study_design_scores_gemma":[0.010360781,0.0011044829,0.013545012,0.0002609732,0.00005527057,0.000386525,0.0018800581,0.4645705,0.000292077,0.17880443,0.3261172,0.0026227022],"about_ca_topic_score_codex":0.00006463527,"about_ca_topic_score_gemma":5.825458e-7,"teacher_disagreement_score":0.7887284,"about_ca_system_score_codex":0.000035699122,"about_ca_system_score_gemma":0.000021229165,"threshold_uncertainty_score":0.99995506},"labels":[],"label_agreement":null},{"id":"W4214595959","doi":"10.1007/s00453-022-00939-7","title":"Tree Automata and Pigeonhole Classes of Matroids: I","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"semigroups and automata theory","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 Ottawa; Douglas College","funders":"Victoria University of Wellington; Royal Society Te Apārangi","keywords":"Matroid; Pigeonhole principle; Combinatorics; Bounded function; Mathematics; Graphic matroid; Discrete mathematics; Oriented matroid; Tree automaton; Tree (set theory); Class (philosophy); Matroid partitioning; Computer science; Automaton; Artificial intelligence","score_opus":0.005874396165787945,"score_gpt":0.20356124901729758,"score_spread":0.19768685285150964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214595959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6070664,0.003845903,0.35787943,0.0072391704,0.00191126,0.00069231313,0.00018200427,0.001716593,0.019466925],"genre_scores_gemma":[0.95165527,0.000020354253,0.04753561,0.00033169007,0.000041623192,0.000026714855,0.000005776701,0.000011881693,0.00037105902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990602,0.00007143698,0.00017446105,0.00026522166,0.00024451656,0.0001841493],"domain_scores_gemma":[0.9992727,0.0001039767,0.00008178595,0.00047202522,0.000018477209,0.00005100934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025916856,0.0000915401,0.0001515938,0.00008778737,0.00014814758,0.000042783813,0.00071799237,0.000019418512,0.00006739401],"category_scores_gemma":[0.000012386009,0.00008925444,0.000042059244,0.0002653443,0.00005764589,0.00020536176,0.0008521844,0.0001042977,0.000008736037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009751219,0.00022738226,0.00029245403,0.000032627013,0.000048391707,0.000051451923,0.0009835192,0.000027571865,0.0061153728,0.17591353,0.010102418,0.80619556],"study_design_scores_gemma":[0.0022923595,0.001134348,0.014636422,0.00003747288,0.000044118253,0.0005811417,0.0015647023,0.7373075,0.021236092,0.12442473,0.09578851,0.00095259096],"about_ca_topic_score_codex":0.00003283676,"about_ca_topic_score_gemma":0.0000010688627,"teacher_disagreement_score":0.80524296,"about_ca_system_score_codex":0.000015622936,"about_ca_system_score_gemma":0.000038497354,"threshold_uncertainty_score":0.36396906},"labels":[],"label_agreement":null},{"id":"W4242128187","doi":"10.1007/s00453-010-9392-2","title":"An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dimension (graph theory); Streaming algorithm; Combinatorics; Algorithm; Computational geometry; Space (punctuation); Theory of computation; Logarithm; Discrete mathematics; Computer science; Mathematical analysis; Upper and lower bounds","score_opus":0.010410805576977796,"score_gpt":0.27327333009197985,"score_spread":0.262862524515002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242128187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13309087,0.0000178922,0.8650266,0.0005752896,0.0008148156,0.00028301784,0.000026294354,0.000095258394,0.00006997873],"genre_scores_gemma":[0.29025504,0.0000021670926,0.70905465,0.00014596904,0.00026912248,0.000048416496,0.00008471113,0.000010940103,0.00012900817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871486,0.000039948496,0.00022851775,0.00046477496,0.00022372244,0.00032815096],"domain_scores_gemma":[0.99894303,0.00022874255,0.00006794227,0.0004155629,0.00019459044,0.00015010232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107652,0.00014938103,0.00015272395,0.00022230305,0.00018721535,0.0001349912,0.00046583178,0.00009583831,0.000016191787],"category_scores_gemma":[0.000079370526,0.0001528321,0.00005536716,0.00048152133,0.000035731005,0.0005469529,0.00010275875,0.00021156669,0.000018333772],"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.0000059457443,0.00025621723,0.00008388483,0.000004066693,0.000012769262,0.00002565086,0.00036661635,0.0033151843,0.024022415,0.011652678,0.0008555161,0.95939904],"study_design_scores_gemma":[0.0005511513,0.00015560212,0.0021081145,0.0000062905456,0.000004354564,0.000036612353,0.000029571542,0.97851956,0.0127375685,0.0011851699,0.0044568027,0.00020920133],"about_ca_topic_score_codex":0.000046449386,"about_ca_topic_score_gemma":0.0000606811,"teacher_disagreement_score":0.97520435,"about_ca_system_score_codex":0.000025250607,"about_ca_system_score_gemma":0.00011754874,"threshold_uncertainty_score":0.62323123},"labels":[],"label_agreement":null},{"id":"W4249772592","doi":"10.1007/s00453-002-0971-8","title":"Introduction","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.014829183544710347,"score_gpt":0.2139303346661889,"score_spread":0.19910115112147855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249772592","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34149748,0.003354827,0.014095058,0.09274082,0.011872603,0.0019654795,0.00023458317,0.009196888,0.5250423],"genre_scores_gemma":[0.94443524,0.000019805384,0.017553074,0.000308137,0.009441638,0.00003395862,0.00003163617,0.000141532,0.02803499],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992744,0.000028883143,0.00010770662,0.0002186886,0.00016360507,0.00020674581],"domain_scores_gemma":[0.9995651,0.0000125501465,0.000033117234,0.00028874658,0.000041942996,0.00005852677],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008559599,0.00008168562,0.000078806384,0.00007473057,0.000061963256,0.00002179584,0.00010204859,0.000036400153,0.008019994],"category_scores_gemma":[0.00005321472,0.00008135821,0.000035216475,0.00028450988,0.000045465884,0.00014598301,0.000022470731,0.00009870542,0.09211475],"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.0000028652116,0.00008349898,0.000029772244,0.0000016517224,0.000016987566,0.0000064045257,0.0001153956,0.000009356431,0.007273903,0.0011795878,0.88546157,0.10581901],"study_design_scores_gemma":[0.00026498607,0.000036542053,0.00041252072,0.0000015066038,0.0000139218555,0.000060838138,0.000021274134,0.01321728,0.00963814,0.00049627613,0.9756809,0.00015585338],"about_ca_topic_score_codex":0.000009274156,"about_ca_topic_score_gemma":0.0000010096431,"teacher_disagreement_score":0.60293776,"about_ca_system_score_codex":0.000056238005,"about_ca_system_score_gemma":0.0000022596312,"threshold_uncertainty_score":0.9928868},"labels":[],"label_agreement":null},{"id":"W4252663448","doi":"10.1007/s00453-004-1135-9","title":"Guest Editors’ Foreword","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Contemporary Sociological Theory and Practice","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Theory of computation; Computer science; Data science; Operations research; Mathematics; Algorithm","score_opus":0.03538213314179274,"score_gpt":0.34557881408072716,"score_spread":0.31019668093893443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252663448","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011245414,0.00044829887,0.0009019325,0.05161216,0.009352492,0.00029138205,0.000010408359,0.00037921427,0.9257587],"genre_scores_gemma":[0.91673946,0.000065546694,0.0027358104,0.0016018031,0.067535564,0.000014205928,0.00000643056,0.000008393848,0.011292787],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989102,0.0003437179,0.00013101453,0.00016363463,0.00019658686,0.00025483253],"domain_scores_gemma":[0.99894303,0.0006903686,0.00005827748,0.00013110471,0.000048033653,0.0001292001],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010552531,0.000073129915,0.00010195961,0.000020044012,0.000502222,0.00004923206,0.00023999297,0.0001334267,0.0012575552],"category_scores_gemma":[0.0005706845,0.00006566324,0.00006689936,0.0001376987,0.0002512377,0.00045766152,0.000034560802,0.00020061209,0.00083304156],"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.00005564937,0.00019125699,0.0005477414,0.000003070329,0.000046921108,0.0000210159,0.011449893,0.0000028526636,0.00004112822,0.29817662,0.32371905,0.3657448],"study_design_scores_gemma":[0.000091818525,0.000026662055,0.000095907664,0.0000026396592,0.00000570437,7.1917356e-7,0.00085538684,0.000020055395,0.000058109825,0.0124005135,0.98634267,0.00009981067],"about_ca_topic_score_codex":0.00018633711,"about_ca_topic_score_gemma":0.00006518368,"teacher_disagreement_score":0.9144659,"about_ca_system_score_codex":0.000044444,"about_ca_system_score_gemma":0.00006661578,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W4255110400","doi":"10.1007/s00453-009-9282-7","title":"On Metric Clustering to Minimize the Sum of Radii","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Metric space; Integer (computer science); Dimension (graph theory); Metric (unit); Theory of computation; Constant (computer programming); Cluster analysis; Randomized algorithm; Binary logarithm; Discrete mathematics; Algorithm; Statistics; Computer science","score_opus":0.020043253755009083,"score_gpt":0.2388340609274418,"score_spread":0.2187908071724327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255110400","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20285374,0.00040020357,0.2945767,0.14665796,0.0054651718,0.003314775,0.00001772974,0.000749456,0.34596425],"genre_scores_gemma":[0.988973,0.0000051102484,0.0011786066,0.008383395,0.00029013527,0.000011559255,0.0000071307627,0.000008131028,0.0011429399],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991417,0.0000075635803,0.00023514865,0.00018656855,0.00024446347,0.00018457032],"domain_scores_gemma":[0.9995295,0.000026611473,0.000046175024,0.0003164741,0.00006966009,0.000011572667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027623714,0.00010914574,0.0001282062,0.0002665104,0.00009730847,0.000054314907,0.00030681584,0.000023696382,0.0003392797],"category_scores_gemma":[0.00013416489,0.00008084247,0.00006616535,0.00087742263,0.000016448941,0.0001561915,0.000082661114,0.000060369373,0.00063122535],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016973047,0.00055266527,0.00024075163,0.00016224312,0.000104078834,0.0000063873044,0.00027437363,0.026132414,0.0003875339,0.08477915,0.13247259,0.75471807],"study_design_scores_gemma":[0.0018292563,0.00015489147,0.10532398,0.00011434313,0.00018245698,0.0000011960688,0.0008888068,0.26430696,0.000760381,0.008173244,0.61733663,0.0009278358],"about_ca_topic_score_codex":0.00029839852,"about_ca_topic_score_gemma":0.000023453033,"teacher_disagreement_score":0.7861192,"about_ca_system_score_codex":0.00001840983,"about_ca_system_score_gemma":0.000004586573,"threshold_uncertainty_score":0.81133354},"labels":[],"label_agreement":null},{"id":"W4256176298","doi":"10.1007/s00453-007-9038-1","title":"Introduction to Special Issue","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Qualitative Research Methods and Ethics","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Theory of computation; Computer science; Programming language","score_opus":0.07933103756193996,"score_gpt":0.5005551903739914,"score_spread":0.4212241528120515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256176298","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048657227,0.000045617777,0.21261512,0.32337272,0.004449852,0.00052491756,0.0000077901495,0.00014027246,0.45397797],"genre_scores_gemma":[0.009322639,0.00012509231,0.44234946,0.0026918931,0.4535898,0.00001968277,0.000009136778,0.00003877661,0.09185352],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826354,0.0004836649,0.00013598308,0.00019605392,0.000513281,0.00040748104],"domain_scores_gemma":[0.9989039,0.0005101289,0.000023294955,0.000118489836,0.00019611193,0.00024810625],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00958553,0.000054457803,0.0000883075,0.000097969925,0.0003947672,0.000050471925,0.0001607866,0.000081655155,0.0024737213],"category_scores_gemma":[0.0026532908,0.00005353175,0.00003470283,0.00049703947,0.00030473594,0.00010681762,0.000034440684,0.00020864922,0.0011246532],"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.000018933995,0.000024143228,0.000013710067,0.0000026198188,0.000006756205,0.000004882977,0.021802353,5.6237116e-7,0.00029480518,0.111826904,0.20629334,0.659711],"study_design_scores_gemma":[0.000049704176,0.00004543018,0.0002844861,0.0000023221162,0.0000017044378,3.2048786e-7,0.0075871274,0.0000029654193,0.0011812731,0.013878146,0.9768917,0.00007483664],"about_ca_topic_score_codex":0.00081395643,"about_ca_topic_score_gemma":0.00072345993,"teacher_disagreement_score":0.77059835,"about_ca_system_score_codex":0.00012135443,"about_ca_system_score_gemma":0.00010089715,"threshold_uncertainty_score":0.9996531},"labels":[],"label_agreement":null},{"id":"W4283651127","doi":"10.1007/s00453-022-00990-4","title":"Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Digital Image Processing Techniques","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 Manitoba","funders":"Università degli Studi di Firenze","keywords":"Algorithm; Intersection graph; Intersection (aeronautics); Graph; Computer science; Combinatorics; Mathematics; Line graph","score_opus":0.01854088776824441,"score_gpt":0.24027197416033086,"score_spread":0.22173108639208644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283651127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5119278,0.00039548575,0.48316985,0.00047928028,0.00039841622,0.00026494148,0.00013128378,0.00040359146,0.002829384],"genre_scores_gemma":[0.86087036,0.0000018038669,0.13905941,0.000041582767,0.0000035473324,0.000003999769,0.000002827904,0.0000041989365,0.000012245977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932986,0.000031591968,0.00016275154,0.00018788445,0.00019592175,0.00009199758],"domain_scores_gemma":[0.99951684,0.000020656347,0.00012583093,0.00024516947,0.00006620782,0.00002527859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008898073,0.00007013253,0.00013575799,0.00014549473,0.00006522304,0.000027427885,0.0004325334,0.000016931255,0.00001028944],"category_scores_gemma":[0.0000117208465,0.00007089562,0.00003963666,0.00040467232,0.00019681115,0.00028474448,0.0004774351,0.00009489726,8.8662695e-8],"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.000033091095,0.00030083692,0.0015086462,0.00016856854,0.00008876467,0.000012240152,0.0017494607,0.000022635788,0.09715386,0.45072123,0.0014555232,0.44678515],"study_design_scores_gemma":[0.00023995737,0.00041940843,0.002333393,0.000018748146,0.000009666272,0.00010636797,0.00008430236,0.023463575,0.25517407,0.7175749,0.00039232455,0.0001832882],"about_ca_topic_score_codex":0.00005740211,"about_ca_topic_score_gemma":0.0000018504145,"teacher_disagreement_score":0.44660187,"about_ca_system_score_codex":0.000012819513,"about_ca_system_score_gemma":0.00002183628,"threshold_uncertainty_score":0.28910396},"labels":[],"label_agreement":null},{"id":"W4285020995","doi":"10.1007/s00453-022-01069-w","title":"The Complexity of Two Colouring Games","year":2022,"lang":"en","type":"article","venue":"Algorithmica","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":"Dalhousie University; Vancouver Island University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Algorithm; Graph; Computer science; Artificial intelligence; Combinatorics; Mathematics","score_opus":0.044289254215219065,"score_gpt":0.3150605287076965,"score_spread":0.27077127449247745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285020995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088488534,0.0012959124,0.8889742,0.010271727,0.001209997,0.00083624193,0.000045490477,0.00038523067,0.0084926495],"genre_scores_gemma":[0.95464694,0.000008157328,0.044694733,0.00008946969,0.00003085059,0.00005573755,0.0000010457069,0.000007924398,0.00046511425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872214,0.00022997132,0.000150586,0.0002037961,0.00042194384,0.00027154214],"domain_scores_gemma":[0.99889815,0.00033162785,0.00007236861,0.0005950816,0.00005664418,0.000046117293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006770734,0.00006401908,0.00009846719,0.000057239504,0.00064826553,0.000035197158,0.0016642101,0.0000071269683,0.000033044205],"category_scores_gemma":[0.000039198043,0.000050997776,0.00005523859,0.00049150264,0.00041399486,0.00011021436,0.0013776862,0.000225062,0.0000080999425],"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.000009735555,0.000037589216,0.000076125594,0.0000024767594,0.000015998798,0.000009369313,0.00024478475,0.00032774385,0.0008257453,0.9256141,0.00033035473,0.07250596],"study_design_scores_gemma":[0.0004185283,0.00016548707,0.0007632535,0.0000027344465,0.0000022942424,0.000036360663,0.00018512967,0.082179524,0.009535691,0.8873824,0.019195518,0.00013307584],"about_ca_topic_score_codex":0.000026799697,"about_ca_topic_score_gemma":0.000004471435,"teacher_disagreement_score":0.8661584,"about_ca_system_score_codex":0.000043501183,"about_ca_system_score_gemma":0.000052302203,"threshold_uncertainty_score":0.49859998},"labels":[],"label_agreement":null},{"id":"W4307918117","doi":"10.1007/s00453-022-01054-3","title":"Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021","year":2022,"lang":"en","type":"editorial","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Theory of computation; Computer science; Algorithm; Library science","score_opus":0.007573675400381433,"score_gpt":0.23803725725127073,"score_spread":0.2304635818508893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307918117","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000552989,0.0001213085,0.0038703536,0.0014886158,0.98070174,0.0005795956,0.0008197073,0.00016198133,0.012251164],"genre_scores_gemma":[0.00027748547,0.00057350734,0.010208445,0.0003148577,0.9674729,0.00027825785,0.0033314615,0.00017755525,0.017365536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932454,0.00035745776,0.00080532284,0.0014018721,0.0035208084,0.0006690866],"domain_scores_gemma":[0.9952016,0.0011224893,0.00077630347,0.0022664259,0.0004957528,0.00013745954],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007690489,0.0006521462,0.00068493263,0.00039019377,0.0004240969,0.00046045263,0.008930612,0.0005138913,0.0008018672],"category_scores_gemma":[0.0009760285,0.00054697285,0.00039289176,0.0019090234,0.00017798918,0.00048253237,0.0041710213,0.0020262606,0.000071053124],"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.00002565306,0.00025587468,0.0000020046298,0.000018587038,0.00031387343,0.000032688902,0.0000889873,0.000027308439,0.0000116853535,0.004438585,0.90944636,0.085338384],"study_design_scores_gemma":[0.001225166,0.00016363611,0.000029489021,0.00011024495,0.00007476966,0.0000022964605,0.000041248735,0.0055252216,0.0001420771,0.0009820077,0.99111694,0.00058690703],"about_ca_topic_score_codex":0.000087750646,"about_ca_topic_score_gemma":0.0000065542436,"teacher_disagreement_score":0.08475148,"about_ca_system_score_codex":0.00039208558,"about_ca_system_score_gemma":0.0006518664,"threshold_uncertainty_score":0.99969816},"labels":[],"label_agreement":null},{"id":"W4309783453","doi":"10.1007/s00453-022-01062-3","title":"On the Tractability of Covering a Graph with 2-Clubs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","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":"Université de Sherbrooke","funders":"Università degli studi di Bergamo","keywords":"Algorithm; Parameterized complexity; Graph; Computer science; Club; Artificial intelligence; Combinatorics; Mathematics; Geology","score_opus":0.014201262110029454,"score_gpt":0.2454591080255627,"score_spread":0.23125784591553325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309783453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44336346,0.00007122974,0.5495349,0.0024527814,0.00015868926,0.0005724252,0.000026517047,0.00013049007,0.0036894965],"genre_scores_gemma":[0.99212134,0.0000013809426,0.0075371764,0.00017309551,0.000008297688,0.0000813713,6.6448894e-7,0.000007806537,0.0000688625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985979,0.00021364167,0.00012550307,0.0002809228,0.0005549916,0.00022704226],"domain_scores_gemma":[0.99838054,0.00067439233,0.00006555951,0.0007856586,0.000050551476,0.000043284905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722957,0.00008504599,0.000111524634,0.000084458254,0.00027849548,0.000022647351,0.0011720671,0.000011295395,0.00009656982],"category_scores_gemma":[0.00005868065,0.000055919943,0.00005611541,0.00080836035,0.00014630485,0.00013215982,0.00039771743,0.00031806575,0.000004984135],"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.00016797881,0.00036531876,0.00022843959,0.000013915883,0.00006140103,0.00003700354,0.0012839367,0.005000609,0.0019373306,0.9479812,0.00029697444,0.04262594],"study_design_scores_gemma":[0.0012469011,0.00284517,0.004558074,0.000026243875,0.0000122655965,0.00011678199,0.00069692446,0.06500359,0.03234965,0.8872211,0.0053683193,0.0005550041],"about_ca_topic_score_codex":0.000015945689,"about_ca_topic_score_gemma":0.000001788796,"teacher_disagreement_score":0.5487579,"about_ca_system_score_codex":0.000040511084,"about_ca_system_score_gemma":0.000056769783,"threshold_uncertainty_score":0.22803491},"labels":[],"label_agreement":null},{"id":"W4311633653","doi":"10.1007/s00453-022-01075-y","title":"Algorithms for p-Faulty Search on a Half-Line","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Theory of computation; Bernoulli trial; Conjecture; Mathematics; Combinatorics; Monotonic function; Sequence (biology); Upper and lower bounds; Line (geometry); Algorithm; Discrete mathematics; Path (computing); Search problem; Computer science","score_opus":0.061667502694890054,"score_gpt":0.324226032777739,"score_spread":0.2625585300828489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311633653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017053435,0.00004349685,0.9773665,0.019191094,0.000502498,0.0006591463,0.000054332253,0.0002529388,0.001759446],"genre_scores_gemma":[0.049459912,0.000031546395,0.9243003,0.01367507,0.00033448086,0.0011227713,0.00017213309,0.00006797783,0.010835822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804056,0.00013720279,0.00021763999,0.00051925593,0.00062555826,0.000459813],"domain_scores_gemma":[0.9989251,0.00019519216,0.000047196278,0.0005460684,0.00013800857,0.00014843693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007296202,0.00013607118,0.00015527486,0.0001814816,0.00060371496,0.00012993936,0.0010638818,0.000029809089,0.00017876535],"category_scores_gemma":[0.00004015917,0.00013453582,0.00009897884,0.00059696543,0.00003575791,0.00018240963,0.0005319947,0.0003049286,0.000070770024],"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.00006422981,0.0008164768,0.000011366964,0.00002339771,0.00007146579,0.000048405967,0.0013636936,0.066849284,0.0002973961,0.1493943,0.062532574,0.7185274],"study_design_scores_gemma":[0.00069062214,0.0006147431,0.00000983866,0.0000027675196,0.0000017605478,0.00001452786,0.000042093354,0.7840075,0.00082822115,0.0018411925,0.21179244,0.0001542739],"about_ca_topic_score_codex":0.00003307883,"about_ca_topic_score_gemma":0.0000011553643,"teacher_disagreement_score":0.7183731,"about_ca_system_score_codex":0.00010596606,"about_ca_system_score_gemma":0.00013979903,"threshold_uncertainty_score":0.5486212},"labels":[],"label_agreement":null},{"id":"W4321277043","doi":"10.1007/s00453-025-01356-2","title":"Maximum Independent Set when Excluding an Induced Minor: $$K_1 + tK_2$$ and $$tC_3 \\uplus C_4$$","year":2025,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Disjoint sets; Discrete mathematics; Time complexity; Graph; Planar graph","score_opus":0.06205807901296858,"score_gpt":0.3396687315471117,"score_spread":0.27761065253414313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321277043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14034374,0.0018046611,0.83888626,0.0027888662,0.00392337,0.0026291225,0.00035006646,0.0012645577,0.0080093425],"genre_scores_gemma":[0.5668966,0.00039678405,0.42401126,0.001163239,0.001057797,0.0006724766,0.00025158166,0.00017160158,0.0053786593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944999,0.0005198269,0.0006424024,0.0022379514,0.001030982,0.0010689154],"domain_scores_gemma":[0.99577224,0.00035126138,0.00029322432,0.0027688253,0.00030347068,0.0005109529],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012195626,0.0006997787,0.0007767644,0.0008710519,0.0003772602,0.00072896446,0.0039917864,0.00067936804,0.000045279856],"category_scores_gemma":[0.00014744725,0.00073498546,0.00018562871,0.00053430645,0.00020049178,0.00074692414,0.009564905,0.0021567878,0.000042719377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106379455,0.00036397803,0.00063665566,0.000606868,0.0005589738,0.0005758406,0.008049784,0.00037264626,0.0029322084,0.036875427,0.0024295212,0.9464917],"study_design_scores_gemma":[0.0017102191,0.00042451257,0.0015027954,0.00054403784,0.000087019675,0.0001369028,0.00043726587,0.10000622,0.008977589,0.8776642,0.0062926197,0.00221661],"about_ca_topic_score_codex":0.00026259382,"about_ca_topic_score_gemma":0.000044573484,"teacher_disagreement_score":0.9442751,"about_ca_system_score_codex":0.00028026494,"about_ca_system_score_gemma":0.0005628862,"threshold_uncertainty_score":0.9995101},"labels":[],"label_agreement":null},{"id":"W4323317406","doi":"10.1007/s00453-023-01106-2","title":"Path Cover Problems with Length Cost","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Corporation; Japan Society for the Promotion of Science London","keywords":"Combinatorics; Mathematics; Disjoint sets; Hamiltonian path; Cover (algebra); Path (computing); Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.022347467224206333,"score_gpt":0.2734891129624179,"score_spread":0.25114164573821157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323317406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005810422,0.00007242242,0.9838912,0.0016054335,0.00022956831,0.00073077116,0.000017244798,0.0011223245,0.0065206164],"genre_scores_gemma":[0.76410073,0.00019131612,0.21423383,0.0010215009,0.00037176776,0.00069253135,0.000057999892,0.00014904182,0.019181263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982704,0.00006913249,0.00013139413,0.0004978497,0.00047872993,0.0005524946],"domain_scores_gemma":[0.99876857,0.00017533072,0.000043823733,0.00076733564,0.00010133891,0.00014359517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038851786,0.00014038001,0.00014097586,0.00017169553,0.00015779155,0.00011175999,0.0009487335,0.00004334269,0.00002773495],"category_scores_gemma":[0.000035802208,0.0001095701,0.000038714083,0.0015532663,0.00011528769,0.00046774975,0.0003561079,0.00021620665,0.0014306982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060221453,0.00024144696,0.0012115362,0.00010599332,0.00016289778,0.00075767684,0.0019666469,0.0035779746,0.002068931,0.317931,0.022340063,0.6495756],"study_design_scores_gemma":[0.0029416701,0.0011369038,0.00452954,0.00017136523,0.000015295605,0.00019163109,0.0001615429,0.544457,0.008174477,0.16905814,0.26778376,0.001378643],"about_ca_topic_score_codex":0.000008190553,"about_ca_topic_score_gemma":0.0000020179195,"teacher_disagreement_score":0.7696574,"about_ca_system_score_codex":0.000036942958,"about_ca_system_score_gemma":0.00007982816,"threshold_uncertainty_score":0.9993468},"labels":[],"label_agreement":null},{"id":"W4360979800","doi":"10.1007/s00453-023-01113-3","title":"Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo; Dalhousie University","funders":"Division of Mathematical Sciences; Dalhousie University; Fields Institute for Research in Mathematical Sciences; Pacific Institute for the Mathematical Sciences","keywords":"Theory of computation; Computer science; Algorithm; Data science","score_opus":0.04072615141270493,"score_gpt":0.3320292424290909,"score_spread":0.29130309101638596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360979800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060076443,0.0004015922,0.52549356,0.43969986,0.00947975,0.00474186,0.00080018275,0.0014133923,0.011962175],"genre_scores_gemma":[0.063608535,0.0037876922,0.658513,0.024067182,0.15522365,0.0016223588,0.00064935506,0.0008985656,0.09162966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963492,0.0002443983,0.00029356848,0.0012105352,0.0010615893,0.00084068946],"domain_scores_gemma":[0.99522257,0.00086934346,0.000075925054,0.0034810808,0.00010968514,0.0002413743],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011072744,0.00032267658,0.00024763597,0.00017653902,0.0007561496,0.0006493942,0.0056659123,0.00009326141,0.000106720705],"category_scores_gemma":[0.0003132476,0.00019135047,0.000047425336,0.0015203526,0.00019604,0.00044724476,0.005715918,0.0005830028,0.0010838361],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001843824,0.00002980594,0.000007824448,0.000014509103,0.00006398911,0.000076455064,0.0018115432,0.002002683,0.0002290347,0.00419736,0.18519469,0.8063537],"study_design_scores_gemma":[0.00028262415,0.00021911236,0.0010235626,0.000028354485,0.000010288703,0.000047163274,0.0002601177,0.39202297,0.00170388,0.0036553568,0.6003704,0.0003761548],"about_ca_topic_score_codex":0.0000748991,"about_ca_topic_score_gemma":0.000020563646,"teacher_disagreement_score":0.8059775,"about_ca_system_score_codex":0.00007047262,"about_ca_system_score_gemma":0.00010566287,"threshold_uncertainty_score":0.9997139},"labels":[],"label_agreement":null},{"id":"W4385460878","doi":"10.1007/s00453-023-01154-8","title":"A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Mathematics; Theory of computation; Laplacian matrix; Matrix (chemical analysis); Current (fluid); Time complexity; Combinatorics; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.028964233586653013,"score_gpt":0.27415611258489736,"score_spread":0.24519187899824435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385460878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000835612,0.00020708864,0.9841183,0.00057836954,0.011017307,0.00079577666,0.00009130275,0.0017339014,0.0006223381],"genre_scores_gemma":[0.07565257,0.00016173281,0.90999955,0.0006419395,0.009473961,0.0010589614,0.00030091006,0.0002461227,0.0024642767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968492,0.000078795776,0.0005689416,0.0008843903,0.0006034436,0.0010152585],"domain_scores_gemma":[0.99774206,0.00065313274,0.0001818152,0.00088897103,0.00027909837,0.00025490776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009979367,0.0003614574,0.00048724542,0.00044952813,0.00074071845,0.0004500608,0.0016465246,0.00020341441,0.000006474767],"category_scores_gemma":[0.0001272413,0.0003794666,0.0002863246,0.0016440412,0.00010439576,0.0005816868,0.00060513197,0.0003393682,0.0002394109],"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.000016184873,0.00023845992,0.00003416066,0.00015271113,0.00024140129,0.00016978881,0.0012760048,0.00066015666,0.00030577104,0.3746348,0.014386689,0.6078839],"study_design_scores_gemma":[0.0010677995,0.00016911549,0.000026385274,0.00006837674,0.000017348859,0.00003398468,0.00012810717,0.92320824,0.0008092708,0.029368551,0.044626214,0.0004765855],"about_ca_topic_score_codex":0.00008515215,"about_ca_topic_score_gemma":0.0000037113496,"teacher_disagreement_score":0.9225481,"about_ca_system_score_codex":0.00008488005,"about_ca_system_score_gemma":0.00014517695,"threshold_uncertainty_score":0.9998657},"labels":[],"label_agreement":null},{"id":"W4389943643","doi":"10.1007/s00453-023-01195-z","title":"Stochastic Variance Reduction for DR-Submodular Maximization","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Monotone polygon; Mathematics; Combinatorics; Approximation algorithm; Submodular set function; Reduction (mathematics); Discrete mathematics; Algorithm; Applied mathematics; Geometry","score_opus":0.02096022274690139,"score_gpt":0.26192232649568314,"score_spread":0.24096210374878174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389943643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007881205,0.000016994969,0.9950866,0.0015215048,0.0009492931,0.00061818754,0.000008807954,0.0016165613,0.00010323359],"genre_scores_gemma":[0.055693023,0.000009778308,0.94197893,0.00011956907,0.00030612678,0.0005827385,0.00009751761,0.000042573673,0.0011697225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873024,0.000027132071,0.00023634979,0.00046085264,0.00023411514,0.00031129847],"domain_scores_gemma":[0.99904764,0.000091709146,0.000107027685,0.00049396453,0.00018754628,0.00007212753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028357128,0.00013677905,0.00013830475,0.00026225985,0.00018071542,0.00010191056,0.000518703,0.000079031524,0.0000067471137],"category_scores_gemma":[0.00018682919,0.00014902168,0.00006048606,0.0011483202,0.000036542213,0.00039391784,0.000113729206,0.000068205205,0.000067135894],"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.00002055018,0.00012707901,0.0000038358235,0.0000535315,0.00006682641,0.000007168196,0.001044231,0.14207113,0.0022641085,0.6683641,0.025095176,0.16088226],"study_design_scores_gemma":[0.0002456323,0.00007646608,0.000040202634,0.00001669979,0.000008466205,0.000017549433,0.000012489184,0.9385297,0.0022051907,0.057961106,0.00071672513,0.00016982545],"about_ca_topic_score_codex":0.0000045342786,"about_ca_topic_score_gemma":8.972862e-8,"teacher_disagreement_score":0.79645854,"about_ca_system_score_codex":0.00006250987,"about_ca_system_score_gemma":0.000048102895,"threshold_uncertainty_score":0.6076928},"labels":[],"label_agreement":null},{"id":"W4390142484","doi":"10.1007/s00453-023-01198-w","title":"Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Preemption; Competitive analysis; Scheduling (production processes); Theory of computation; Multiprocessor scheduling; Algorithm; Multiprocessing; Online algorithm; Job shop scheduling; Computer science; Combinatorics; Approximation algorithm; Mathematics; Discrete mathematics; Parallel computing; Flow shop scheduling; Mathematical optimization; Upper and lower bounds; Schedule; Operating system","score_opus":0.029698739279698103,"score_gpt":0.24751595211269234,"score_spread":0.21781721283299424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390142484","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03936511,0.000040397957,0.9564825,0.00065891474,0.0003591951,0.00092087477,0.000061719715,0.0017663803,0.00034490685],"genre_scores_gemma":[0.026569687,0.0000031847865,0.9714753,0.00011553753,0.00055776216,0.0005142456,0.00017517587,0.000121967445,0.000467119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984678,0.000025752086,0.00033752085,0.00035415747,0.0003212236,0.0004935604],"domain_scores_gemma":[0.9987522,0.0004958948,0.00006169151,0.00027925553,0.00027666028,0.00013430047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042001315,0.00026867233,0.00025817778,0.00019250563,0.00034328143,0.00014871474,0.00024261844,0.00009998721,0.000017302295],"category_scores_gemma":[0.00031295675,0.00020996355,0.00006355103,0.0013065195,0.000044325912,0.00016530005,0.00004454208,0.00018083314,0.00032533385],"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.00002159583,0.000015587635,0.000034437322,0.00005922358,0.000057015688,0.0000023567827,0.00047561096,0.95711315,0.0019204875,0.000033040338,0.00036569865,0.039901793],"study_design_scores_gemma":[0.0007402888,0.00006423189,0.0009944361,0.000070904636,0.000035134846,0.000021284137,0.0003000611,0.9949645,0.002254286,0.00006237089,0.0001636146,0.0003289168],"about_ca_topic_score_codex":0.000008935883,"about_ca_topic_score_gemma":6.254764e-7,"teacher_disagreement_score":0.039572876,"about_ca_system_score_codex":0.00006617173,"about_ca_system_score_gemma":0.000034466644,"threshold_uncertainty_score":0.8562065},"labels":[],"label_agreement":null},{"id":"W4394758905","doi":"10.1007/s00453-024-01228-1","title":"Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Univerzita Karlova v Praze","keywords":"Homomorphism; Mathematics; Combinatorics; Conjecture; Discrete mathematics; Pathwidth; Chordal graph; Extension (predicate logic); Class (philosophy); Indifference graph; Graph; Computer science; Line graph","score_opus":0.012695415782799858,"score_gpt":0.2723994767271793,"score_spread":0.2597040609443794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394758905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102116525,0.010745157,0.87798434,0.0054557086,0.0006977809,0.0013036884,0.00008451762,0.0009620141,0.00065028167],"genre_scores_gemma":[0.8388745,0.00051658443,0.15858555,0.0002554773,0.00006503214,0.0002962538,0.000009941524,0.000057418238,0.0013392247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854547,0.000042815245,0.00017490907,0.00063046435,0.00020472218,0.00040160303],"domain_scores_gemma":[0.9988452,0.00054819987,0.000026851094,0.00034625205,0.00007074583,0.00016272505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034622345,0.00018876315,0.00019863108,0.00033651202,0.00022388402,0.00042324248,0.00042986916,0.000069155954,0.0000070971355],"category_scores_gemma":[0.00006014979,0.00017110788,0.000069222544,0.0006390944,0.00035777222,0.0005315874,0.00029664664,0.00016536102,0.0000055115834],"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.000023155997,0.000033463057,0.00005541306,0.00015658187,0.00007199238,0.00007258313,0.0009185332,9.620286e-7,0.005753302,0.7650805,0.0015437693,0.2262897],"study_design_scores_gemma":[0.00044163698,0.00028219534,0.00011931346,0.00006074395,0.000014594686,0.000078511635,0.00004592097,0.03607167,0.0035704826,0.94187516,0.017134536,0.00030521167],"about_ca_topic_score_codex":0.00002215329,"about_ca_topic_score_gemma":0.000008331604,"teacher_disagreement_score":0.736758,"about_ca_system_score_codex":0.000013797438,"about_ca_system_score_gemma":0.000035008663,"threshold_uncertainty_score":0.6977577},"labels":[],"label_agreement":null},{"id":"W4396872920","doi":"10.1007/s00453-024-01236-1","title":"Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Theory of computation; Center (category theory); Computer science; Algorithm; Approximation algorithm; Cluster analysis; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.023096027130502784,"score_gpt":0.2990533772984482,"score_spread":0.2759573501679454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396872920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055603012,0.00047123304,0.9920738,0.0006191862,0.00051681965,0.00040583962,0.000020655774,0.00018883399,0.00014333036],"genre_scores_gemma":[0.21797226,0.00010020099,0.7809546,0.00017347133,0.00016787637,0.00017620201,0.0000123593145,0.000038356386,0.00040465954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986851,0.000051236973,0.00018171035,0.0005568289,0.00018218906,0.0003429244],"domain_scores_gemma":[0.9992206,0.0002835215,0.00003461152,0.0002980551,0.000050881823,0.00011233804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044911125,0.00015141375,0.00016264491,0.00016476182,0.00014639003,0.0006013886,0.00027255135,0.000065056134,0.000004616953],"category_scores_gemma":[0.000060649883,0.00013656063,0.000044442488,0.00025375784,0.000109364635,0.0007618955,0.0003245651,0.0001342721,0.0000075817215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040597926,0.000045789682,0.000011371145,0.00016040099,0.000063600775,0.00003522188,0.00054229813,0.0000063143343,0.0027011659,0.035057433,0.00013439872,0.9612014],"study_design_scores_gemma":[0.00063782855,0.00016838766,0.000089586356,0.000060645078,0.0000074581994,0.000114584116,0.000015277876,0.91925544,0.000514346,0.07354146,0.0053999643,0.00019504002],"about_ca_topic_score_codex":0.0000031149618,"about_ca_topic_score_gemma":7.7705323e-7,"teacher_disagreement_score":0.96100634,"about_ca_system_score_codex":0.000027317144,"about_ca_system_score_gemma":0.00002585949,"threshold_uncertainty_score":0.5799204},"labels":[],"label_agreement":null},{"id":"W4398137369","doi":"10.1007/s00453-024-01235-2","title":"Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Horizon 2020; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Theory of computation; Approximation algorithm; Algorithm; Dual (grammatical number); Computer science; Mathematics; Combinatorics; Mathematical optimization; Discrete mathematics","score_opus":0.036672352847535714,"score_gpt":0.3668054544250911,"score_spread":0.3301331015775554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398137369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001453168,0.0010959414,0.9904277,0.0025621678,0.00075127,0.0010195508,0.0002611801,0.0007399909,0.0029969146],"genre_scores_gemma":[0.0007747645,0.00009292482,0.9680981,0.0002867352,0.00078692375,0.00049588305,0.0003115057,0.0001916338,0.028961541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966982,0.00029684257,0.00066066935,0.0008039829,0.0007645261,0.0007757798],"domain_scores_gemma":[0.9973426,0.0012342868,0.00013941359,0.0007533956,0.00034050422,0.00018983822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014567652,0.0004032615,0.0003672813,0.00021109621,0.00071619806,0.0006098852,0.0004357838,0.00021969958,0.00053133856],"category_scores_gemma":[0.0004451276,0.00030071728,0.00020108625,0.0012599519,0.00020487234,0.00067936344,0.00024825297,0.0007694893,0.0001724306],"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.00005637169,0.00050748186,0.0000054061875,0.0004746308,0.0008659101,0.000050934403,0.0025770855,0.0035298688,0.030890556,0.06382081,0.22907564,0.6681453],"study_design_scores_gemma":[0.00045102512,0.00007952083,0.0000014252225,0.000033516564,0.00009719393,0.000090514484,0.00045826583,0.8809641,0.012690548,0.03827226,0.06646093,0.00040068224],"about_ca_topic_score_codex":0.00007480111,"about_ca_topic_score_gemma":0.000007565371,"teacher_disagreement_score":0.87743425,"about_ca_system_score_codex":0.00030417944,"about_ca_system_score_gemma":0.00023488236,"threshold_uncertainty_score":0.9999445},"labels":[],"label_agreement":null},{"id":"W4399075280","doi":"10.1007/s00453-024-01242-3","title":"Approximation Algorithms for Covering Vertices by Long Paths","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology of the People's Republic of China","keywords":"Theory of computation; Combinatorics; Approximation algorithm; Computer science; Algorithm; Mathematics; Discrete mathematics","score_opus":0.02174289278522585,"score_gpt":0.30872613055365705,"score_spread":0.2869832377684312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399075280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008950653,0.0016871964,0.9950091,0.0005209776,0.0005663073,0.00039963645,0.000032451753,0.00046211976,0.0004271441],"genre_scores_gemma":[0.2495987,0.00015765411,0.7453951,0.00034241623,0.0005816766,0.00066424056,0.000096334465,0.000109848064,0.0030540382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.000047685466,0.00020651257,0.00055111555,0.0003363539,0.00043942398],"domain_scores_gemma":[0.998956,0.00040886723,0.000032269694,0.00041411445,0.0000808921,0.00010783343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045838955,0.00015433533,0.00014274633,0.0001450232,0.00015608402,0.0004304623,0.0007386078,0.000065204666,0.000010680233],"category_scores_gemma":[0.00007147083,0.00014493457,0.0000927975,0.0005406469,0.000060185295,0.0011417726,0.0001982359,0.0001668399,0.0000794151],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000871902,0.00004352375,0.000008603729,0.00013495385,0.00005102159,0.000024831268,0.00032904217,0.000076521545,0.0043286453,0.08233606,0.0022431242,0.91041493],"study_design_scores_gemma":[0.00023500666,0.00011748194,0.000019210023,0.000054688957,0.000008226085,0.000019194249,0.000021301645,0.8778918,0.029280255,0.065594666,0.026513992,0.00024419255],"about_ca_topic_score_codex":0.000006501674,"about_ca_topic_score_gemma":7.2358597e-7,"teacher_disagreement_score":0.91017073,"about_ca_system_score_codex":0.00007451811,"about_ca_system_score_gemma":0.000057044348,"threshold_uncertainty_score":0.59102607},"labels":[],"label_agreement":null},{"id":"W4401894189","doi":"10.1007/s00453-024-01262-z","title":"Parameterized Complexity of Reconfiguration of Atoms","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Control reconfiguration; Computer science; Theory of computation; Combinatorics; Discrete mathematics; Mathematics; Algorithm","score_opus":0.024990078766560394,"score_gpt":0.2611977659682862,"score_spread":0.2362076872017258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401894189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19292912,0.00029129052,0.8040633,0.0011738748,0.0006312565,0.00012809307,0.000019040092,0.00021009505,0.0005539102],"genre_scores_gemma":[0.8085813,0.000004922739,0.19127962,0.000028002054,0.00005759021,0.0000028251097,0.000004919207,0.0000073975184,0.00003341007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989114,0.000066509674,0.00034988645,0.00029295933,0.00021315984,0.00016609237],"domain_scores_gemma":[0.9992312,0.00016715734,0.00009684804,0.00038824868,0.00006953191,0.000046997753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024360724,0.00011366355,0.00023853999,0.000132629,0.00003607887,0.000055093136,0.00048512462,0.000050654213,0.000018823506],"category_scores_gemma":[0.000025004521,0.00009621421,0.00011956143,0.0004659208,0.00014722564,0.00013648777,0.000117822725,0.00013348194,0.000010589592],"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.000007830446,0.000076487784,0.000012136545,0.00017624437,0.00008263752,0.000018865298,0.001069409,0.0001873951,0.015957214,0.22350088,0.00034996175,0.75856096],"study_design_scores_gemma":[0.00013148722,0.00013009686,0.00039934058,0.00008351295,0.000007432344,0.000029532532,0.0000068187915,0.89932823,0.044904612,0.053291984,0.0015732322,0.00011374686],"about_ca_topic_score_codex":0.000044809178,"about_ca_topic_score_gemma":0.0000012110671,"teacher_disagreement_score":0.89914083,"about_ca_system_score_codex":0.000011325952,"about_ca_system_score_gemma":0.000067792054,"threshold_uncertainty_score":0.39235014},"labels":[],"label_agreement":null},{"id":"W4402992802","doi":"10.1007/s00453-024-01276-7","title":"Permutation-constrained Common String Partitions with Applications","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Theory of computation; String (physics); Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Physics","score_opus":0.006847243086547082,"score_gpt":0.24767939474062836,"score_spread":0.24083215165408128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402992802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25156978,0.0047935788,0.7184628,0.0027989561,0.00037636768,0.002061107,0.00046258105,0.0004968687,0.018977938],"genre_scores_gemma":[0.9879607,0.00005427733,0.009729578,0.00007893435,0.00035657064,0.00032648075,0.0005616833,0.000034050467,0.00089775573],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992035,0.000019823756,0.00013896856,0.00031926122,0.00011750019,0.00020095846],"domain_scores_gemma":[0.9995813,0.000014992001,0.000023147759,0.0002562772,0.00005064812,0.00007364374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000733038,0.00012684599,0.000087723456,0.00006160695,0.000108697524,0.00007499799,0.00012096408,0.00006332312,0.00006269035],"category_scores_gemma":[0.0000041816193,0.00011531146,0.000053566542,0.00019831558,0.00008639695,0.0000064374976,0.000037911508,0.00008821825,0.00009846465],"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.00006695251,0.0004939358,0.00197086,0.0003591989,0.0015293419,0.0001223986,0.0006145311,0.00174997,0.41528678,0.028859721,0.009604628,0.5393417],"study_design_scores_gemma":[0.0015459748,0.00088942447,0.002443352,0.00015146406,0.00035697827,0.00041521896,0.0008677725,0.008317544,0.15090121,0.005583374,0.82713765,0.001390054],"about_ca_topic_score_codex":0.000008946865,"about_ca_topic_score_gemma":0.000016663915,"teacher_disagreement_score":0.817533,"about_ca_system_score_codex":0.000017836897,"about_ca_system_score_gemma":0.00008011136,"threshold_uncertainty_score":0.47022647},"labels":[],"label_agreement":null},{"id":"W4403561831","doi":"10.1007/s00453-024-01279-4","title":"Euclidean Maximum Matchings in the Plane—Local to Global","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Euclidean geometry; Theory of computation; Plane (geometry); Mathematics; Computer science; Geometry; Algorithm","score_opus":0.008881235263888216,"score_gpt":0.26339442644881206,"score_spread":0.2545131911849238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403561831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013813778,0.0001654217,0.9713942,0.011589591,0.0006770134,0.00012449174,0.000008114481,0.000112021706,0.002115371],"genre_scores_gemma":[0.94968444,0.0000025915542,0.04683242,0.0030482847,0.0002643011,0.000018124374,0.000013089269,0.000004305676,0.00013245833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990879,0.000052513642,0.00014085846,0.00027732528,0.0002641346,0.00017726286],"domain_scores_gemma":[0.9996129,0.00011063539,0.0000103798875,0.00019711464,0.00001876196,0.00005015124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000331139,0.00008396977,0.000066630826,0.000081295264,0.000059428017,0.0002923884,0.00053931255,0.00003015132,0.000011065929],"category_scores_gemma":[0.000013162484,0.000062698724,0.000034420365,0.0009161231,0.000013035196,0.00020131127,0.000112430236,0.00010386763,0.00034285328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028240388,0.000028577124,0.000020430034,0.000008783215,0.000007747251,0.000126635,0.0010471627,0.0029769775,0.000042196647,0.16723052,0.011836504,0.81667167],"study_design_scores_gemma":[0.00020253043,0.00014827866,0.0058887526,0.000052829,0.0000069023645,0.0003653749,0.00013956793,0.5949027,0.00036105153,0.18439084,0.21322797,0.0003132043],"about_ca_topic_score_codex":0.00006978605,"about_ca_topic_score_gemma":0.000026746424,"teacher_disagreement_score":0.93587065,"about_ca_system_score_codex":0.000056386005,"about_ca_system_score_gemma":0.00006251724,"threshold_uncertainty_score":0.44067997},"labels":[],"label_agreement":null},{"id":"W4405191201","doi":"10.1007/s00453-024-01285-6","title":"Galloping in Fast-Growth Natural Merge Sorts","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Merge (version control); Computer science; Parallel computing; Algorithm","score_opus":0.0051749355612094846,"score_gpt":0.230550752158833,"score_spread":0.2253758165976235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405191201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020112813,0.003116981,0.95980346,0.007360798,0.0015768128,0.00031140953,0.0000059229374,0.0011454839,0.006566328],"genre_scores_gemma":[0.97133577,0.000025260653,0.027713561,0.00016148952,0.000104357714,0.000032853357,0.000009034334,0.000010336592,0.0006073392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991221,0.00001709743,0.00015352706,0.0003412626,0.00014520848,0.00022081459],"domain_scores_gemma":[0.99958926,0.00004766436,0.000014486295,0.0002853475,0.000019041392,0.000044217883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010408309,0.00009240201,0.00008895296,0.00012491363,0.00005110535,0.00017718978,0.00046474836,0.000034589946,0.000015834852],"category_scores_gemma":[0.000007570406,0.00008645824,0.000052288662,0.00060945615,0.000019411105,0.00031724115,0.0001674882,0.00016454264,0.00022405905],"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":[8.5880987e-7,0.000079380916,0.00012744851,0.000067525405,0.000032549553,0.0002616453,0.0013249055,0.000017952636,0.01041192,0.48968348,0.005752211,0.49224013],"study_design_scores_gemma":[0.00013651676,0.000013680164,0.0020481122,0.00007755368,0.0000055583055,0.00006591117,0.000020428459,0.9378384,0.008515142,0.015702067,0.035279844,0.0002968035],"about_ca_topic_score_codex":0.000045584868,"about_ca_topic_score_gemma":0.00001136512,"teacher_disagreement_score":0.95122296,"about_ca_system_score_codex":0.00003774124,"about_ca_system_score_gemma":0.00005199457,"threshold_uncertainty_score":0.35256648},"labels":[],"label_agreement":null},{"id":"W4413370306","doi":"10.1007/s00453-025-01324-w","title":"Reconfiguration of Multisets with Applications to Bin Packing","year":2025,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; York University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bin packing problem; Control reconfiguration; Computer science; Bin; Theory of computation; Combinatorics; Parallel computing; Theoretical computer science; Mathematics; Algorithm","score_opus":0.0065835363296105,"score_gpt":0.23120015557865323,"score_spread":0.22461661924904272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413370306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017812041,0.00005327957,0.9775762,0.00022873061,0.0000909459,0.00034960426,0.000013491163,0.00018504015,0.01972151],"genre_scores_gemma":[0.89958215,0.000020474452,0.09949507,0.00010762266,0.000029212299,0.00013245162,0.000035493333,0.000019235282,0.000578302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963737,0.00000615666,0.000131201,0.000089912384,0.000051478644,0.00008386102],"domain_scores_gemma":[0.9997311,0.000024764535,0.000017238495,0.00014254294,0.000055955228,0.000028376939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039227176,0.000063177795,0.000082335064,0.00011218013,0.000029586789,0.000014795545,0.00006497953,0.000033120847,0.000029722924],"category_scores_gemma":[0.0000056019067,0.00006105935,0.000013664975,0.0003738654,0.00001066372,0.000042463707,0.0000068690942,0.000046097077,0.00002095832],"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.00001331101,0.00005657906,0.00057911343,0.00021000803,0.00012204875,8.6050693e-7,0.0007217018,0.4918168,0.011714882,0.009239093,0.00402957,0.48149604],"study_design_scores_gemma":[0.001463238,0.0001264206,0.0046504014,0.0005040069,0.00008160157,0.0000064105657,0.00021876898,0.59495074,0.18747869,0.0011303675,0.20870109,0.0006882747],"about_ca_topic_score_codex":0.000008153775,"about_ca_topic_score_gemma":0.000011554693,"teacher_disagreement_score":0.8978009,"about_ca_system_score_codex":0.000019275532,"about_ca_system_score_gemma":0.000013492567,"threshold_uncertainty_score":0.24899282},"labels":[],"label_agreement":null},{"id":"W4413834654","doi":"10.1007/s00453-025-01337-5","title":"A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $$\\mathbb {R}^2$$","year":2025,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","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 Ottawa","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Theory of computation; Combinatorics; Geodesic; Clique; Intersection (aeronautics); Mathematics; Clique problem; Chordal graph; Computer science; Discrete mathematics; Graph; Geometry; Algorithm; 1-planar graph; Geography; Cartography","score_opus":0.008585746217043383,"score_gpt":0.28848036322172566,"score_spread":0.27989461700468227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413834654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064641215,0.000058758258,0.9338616,0.00047546643,0.00042944797,0.00025879257,0.0000063345815,0.00004115265,0.00022723222],"genre_scores_gemma":[0.92792666,0.0000016386904,0.07159841,0.00025794996,0.000023398112,0.000078258236,0.00001790953,0.0000033064337,0.00009247432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925464,0.000042792766,0.00024334376,0.0002343951,0.00009764588,0.0001271515],"domain_scores_gemma":[0.9994436,0.00017647425,0.00006690617,0.00018028276,0.00010857246,0.000024146668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023768535,0.000079939295,0.00012716513,0.00037287618,0.000043495795,0.000030007934,0.00022616044,0.000047772915,0.0000023201305],"category_scores_gemma":[0.00004505895,0.00008250311,0.00007673812,0.0008075711,0.000021189164,0.00014844455,0.00003932569,0.000058335885,0.0000019131387],"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.00016755062,0.00061211357,0.000993982,0.00023125521,0.00008082695,0.000004874171,0.00057878246,0.029170342,0.011550562,0.49941146,0.0042413673,0.4529569],"study_design_scores_gemma":[0.0008471964,0.0001324108,0.0029161838,0.00005096499,0.000007727406,0.0000010435253,0.000014153537,0.9075636,0.045178354,0.041264366,0.0019112347,0.00011273594],"about_ca_topic_score_codex":0.000024969011,"about_ca_topic_score_gemma":0.000022999158,"teacher_disagreement_score":0.8783933,"about_ca_system_score_codex":0.00004605807,"about_ca_system_score_gemma":0.00014982701,"threshold_uncertainty_score":0.3364379},"labels":[],"label_agreement":null},{"id":"W4416063433","doi":"10.1007/s00453-025-01355-3","title":"On computing vertex connectivity of 1-planar graphs","year":2025,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Vertex (graph theory); Planar graph; Wheel graph; Feedback vertex set; 1-planar graph; Independent set; Graph","score_opus":0.007721240663744617,"score_gpt":0.2508667515147121,"score_spread":0.2431455108509675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416063433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08639447,0.00005223515,0.9086258,0.00054046686,0.0005807063,0.00008153711,0.0000026418638,0.0000629291,0.003659262],"genre_scores_gemma":[0.9639188,0.000001915738,0.03550831,0.00044190994,0.000017213599,0.0000017372088,0.000005248652,0.000002039064,0.00010283587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999292,0.00005275206,0.00015629291,0.00022852143,0.00015479284,0.00011561283],"domain_scores_gemma":[0.99918354,0.000413253,0.00005674896,0.00023022492,0.00008847548,0.00002774041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018878396,0.00007551061,0.00012124392,0.00020044562,0.00009245992,0.000028236123,0.00028788083,0.000034225428,0.0000042879865],"category_scores_gemma":[0.00006959052,0.00007544591,0.000050546623,0.0006632011,0.000023404971,0.00009649282,0.00006151604,0.00007506055,0.000011446991],"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.0000047849953,0.00007244506,0.000078538185,0.000009580109,0.00002283512,0.0000021416126,0.00005730605,0.0013166136,0.00067099626,0.81331885,0.0019634916,0.18248242],"study_design_scores_gemma":[0.0006390987,0.00018058813,0.016396489,0.00006920943,0.00001042278,0.000006153147,0.000011577434,0.59811866,0.02660412,0.35611188,0.0016611641,0.00019059314],"about_ca_topic_score_codex":0.000016499424,"about_ca_topic_score_gemma":0.0000018180798,"teacher_disagreement_score":0.8775243,"about_ca_system_score_codex":0.000019166433,"about_ca_system_score_gemma":0.00006347043,"threshold_uncertainty_score":0.3076595},"labels":[],"label_agreement":null},{"id":"W46025305","doi":"10.1007/s004530010073","title":"Equivalence of ε -Approximate Separation and Optimization in Fixed Dimensions1","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Theory of computation; Equivalence (formal languages); Combinatorial optimization; Regular polygon; Approximation algorithm; Dimension (graph theory); Polynomial; Set (abstract data type); Discrete mathematics; Time complexity; Optimization problem; Mathematical optimization; Algorithm; Mathematical analysis; Computer science; Geometry","score_opus":0.007580004997966041,"score_gpt":0.2550033375985005,"score_spread":0.24742333260053448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46025305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8838454,0.00005875197,0.11469488,0.00016670038,0.000015812911,0.000060614617,0.0000031489235,0.0000098091095,0.0011449184],"genre_scores_gemma":[0.98746616,0.000015089293,0.0122830495,0.000009338907,0.000026058458,0.0000064656615,0.000017743443,0.000004145031,0.00017192579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995904,0.000018741704,0.00012758207,0.00011239284,0.000054430908,0.00009647525],"domain_scores_gemma":[0.99980783,0.000021390631,0.000045599645,0.00008333195,0.000021292499,0.000020549594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058918093,0.000053143907,0.0000958918,0.00005292736,0.000024697867,0.000009248852,0.00003543637,0.000013791458,0.00012139931],"category_scores_gemma":[0.0000023844766,0.000051536434,0.000019430883,0.00017099071,0.00002117374,0.000052183557,0.000017036966,0.000035727837,0.0000018259161],"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.00008997073,0.0008626559,0.24090077,0.00007011154,0.00023376467,0.000012479596,0.0016857106,0.1433486,0.13510193,0.008709041,0.00047591707,0.46850905],"study_design_scores_gemma":[0.00061032875,0.00010259169,0.0062355767,0.000049596998,0.000043095104,0.00000296792,0.00013613806,0.9777102,0.012601768,0.0022597685,0.00006765491,0.00018034726],"about_ca_topic_score_codex":0.00013115973,"about_ca_topic_score_gemma":0.0000012818409,"teacher_disagreement_score":0.83436155,"about_ca_system_score_codex":0.0000042487545,"about_ca_system_score_gemma":0.000007679873,"threshold_uncertainty_score":0.21015947},"labels":[],"label_agreement":null},{"id":"W762437628","doi":"10.1007/s00453-015-0063-1","title":"Asymptotic Lattice Path Enumeration Using Diagonals","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Orthant; Mathematics; Diagonal; Generating function; Exponential growth; Exponential function; Integer lattice; Lattice (music); Asymptotic expansion; Enumerative combinatorics; Combinatorics; Ordinary differential equation; Rational function; Mathematical analysis; Discrete mathematics; Differential equation; Geometry","score_opus":0.15659666159826569,"score_gpt":0.37389528649875015,"score_spread":0.21729862490048446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W762437628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32924482,0.00022949398,0.6606849,0.00035034434,0.0024988474,0.0008902161,0.000019123203,0.0005579346,0.0055243196],"genre_scores_gemma":[0.3932502,0.0000040563195,0.6053529,0.000118095064,0.0007176197,0.000029026332,0.000008106806,0.00009204294,0.00042795093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850833,0.00009562065,0.0003914701,0.00024369913,0.0004534786,0.00030738505],"domain_scores_gemma":[0.9984163,0.0005071998,0.00020270555,0.00043936147,0.00025100677,0.00018343888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046172706,0.00020095399,0.0003035865,0.000065515735,0.00008812564,0.00005361005,0.00020908394,0.00010610267,0.000028209966],"category_scores_gemma":[0.0015604069,0.00019378803,0.000065516266,0.00022603148,0.000042519467,0.0002719607,0.00009458348,0.0001624643,0.00012129469],"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.000032445485,0.0006769882,0.000101879334,0.00018040773,0.00014933581,0.0000678107,0.0029556474,0.00022444525,0.0016654048,0.98073584,0.004085744,0.009124047],"study_design_scores_gemma":[0.0006513132,0.00007191132,0.000006254012,0.00005718447,0.00007816524,0.000039565206,0.00018473987,0.026646547,0.0029141158,0.9678934,0.0011903653,0.0002664129],"about_ca_topic_score_codex":0.000008603473,"about_ca_topic_score_gemma":9.1536214e-7,"teacher_disagreement_score":0.06400539,"about_ca_system_score_codex":0.00017676382,"about_ca_system_score_gemma":0.000115680436,"threshold_uncertainty_score":0.7902447},"labels":[],"label_agreement":null},{"id":"W98190632","doi":"10.1007/s00453-003-1018-5","title":"Multicast Pull Scheduling: When Fairness Is Fine","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Multicast; Unicast; Scheduling (production processes); Computer network; Distributed computing; Competitive analysis; Approximation algorithm; Parallel computing; Algorithm; Mathematical optimization; Upper and lower bounds; Mathematics","score_opus":0.02439670081495226,"score_gpt":0.2598636974486351,"score_spread":0.2354669966336828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98190632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038685504,0.000093604925,0.9861565,0.0032741176,0.00025612715,0.00016745878,0.0000038501908,0.00017315529,0.009488311],"genre_scores_gemma":[0.10704106,0.000016634782,0.88816494,0.0011830974,0.000054531156,0.00002154303,0.000005654853,0.000016866064,0.0034956571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986951,0.0000813308,0.00020079369,0.00038344658,0.00028519396,0.00035415223],"domain_scores_gemma":[0.999054,0.00005942712,0.000047159065,0.00051406317,0.0001554942,0.00016986349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026277194,0.00012983089,0.0001355554,0.00008921467,0.00013489163,0.00019149057,0.0005906733,0.00006603821,0.00039301126],"category_scores_gemma":[0.00010510149,0.000120710116,0.00005475723,0.0003240176,0.00004660517,0.0003619666,0.00012597114,0.00015716428,0.0006197652],"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.00000929311,0.00080881885,0.00062540045,0.000058715366,0.00012824892,0.00012949646,0.006939395,0.004198412,0.0011019675,0.5542776,0.019130217,0.41259244],"study_design_scores_gemma":[0.00083187857,0.00007603442,0.00006870527,0.00001737321,0.0000050060403,0.000046581426,0.000041207993,0.87486184,0.006249796,0.011270428,0.106187314,0.00034384578],"about_ca_topic_score_codex":0.000013178526,"about_ca_topic_score_gemma":0.0000015891679,"teacher_disagreement_score":0.8706634,"about_ca_system_score_codex":0.000025612104,"about_ca_system_score_gemma":0.00008376113,"threshold_uncertainty_score":0.79660344},"labels":[],"label_agreement":null}]}