{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055487692,0.002744415,0.91431063,0.0033960778,0.00059398654,0.00026853711,0.00083888124,0.0015217284,0.020837989],"genre_scores_gemma":[0.27145636,0.0015288168,0.7082384,0.0009131804,0.00093230646,0.0005944782,0.00239921,0.0008917552,0.013045548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541664,0.0015570725,0.0001913783,0.0009230977,0.0011191106,0.0007926996],"domain_scores_gemma":[0.9849417,0.0098930495,0.00090247876,0.0026576247,0.0008869239,0.0007182128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004594886,0.002571038,0.0030808055,0.002702789,0.0021264248,0.005014834,0.009212186,0.0035906925,0.014918524],"category_scores_gemma":[0.023615604,0.0014305933,0.003107868,0.004800005,0.0022264777,0.011165668,0.005181814,0.0074164886,0.002442936],"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.0021745642,0.0012902593,0.0030869083,0.0009347199,0.0003316243,0.00019713498,0.0006924469,0.33742812,0.0035290248,0.29484513,0.050241746,0.30524832],"study_design_scores_gemma":[0.0002986966,0.00010260296,0.0005735984,0.000060912167,0.00013230016,0.00013016685,0.00015899658,0.71861124,0.0012466694,0.27274674,0.00590211,0.000035944315],"about_ca_topic_score_codex":0.004229603,"about_ca_topic_score_gemma":0.008498042,"teacher_disagreement_score":0.014918524,"about_ca_system_score_codex":0.004487986,"about_ca_system_score_gemma":0.003563244,"threshold_uncertainty_score":0.049907446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31481078,0.0065338574,0.5192821,0.027709136,0.0008843159,0.00046464644,0.0033727593,0.0016650289,0.12527734],"genre_scores_gemma":[0.8519376,0.0049231555,0.10861218,0.0019484507,0.001673054,0.0007751768,0.004767883,0.0013271322,0.024035284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476457,0.0020085264,0.00024782232,0.0010102697,0.0010827532,0.0008859193],"domain_scores_gemma":[0.94529593,0.04646668,0.0020471392,0.003619308,0.0011823834,0.0013886165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003651241,0.0023318178,0.0027526477,0.0022759843,0.002348251,0.007620481,0.0049802326,0.0036572756,0.025120707],"category_scores_gemma":[0.04089291,0.0014711602,0.0028709783,0.004893979,0.0048533464,0.021961251,0.005045634,0.0096840905,0.0019063135],"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.0007482647,0.0005016816,0.0036517296,0.000771584,0.00021005716,0.00026835644,0.00065051793,0.19189253,0.0021445577,0.7103118,0.025041092,0.063807815],"study_design_scores_gemma":[0.000115048395,0.000043069358,0.0006189328,0.00004901499,0.000057883073,0.00009144011,0.00013230514,0.15007652,0.00036465042,0.84539425,0.003032897,0.000024054698],"about_ca_topic_score_codex":0.0039025743,"about_ca_topic_score_gemma":0.00413229,"teacher_disagreement_score":0.025120707,"about_ca_system_score_codex":0.0056204475,"about_ca_system_score_gemma":0.0032229635,"threshold_uncertainty_score":0.084037125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48076022,0.0010532805,0.48102304,0.0010251566,0.000079901394,0.00008147825,0.0009089984,0.00059273944,0.034475215],"genre_scores_gemma":[0.8571574,0.0009312281,0.12989062,0.00008067697,0.00003778492,0.000046324996,0.0007254795,0.00013726376,0.010993203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999694,0.000076406584,0.000025713465,0.00003565232,0.0001096669,0.000058599726],"domain_scores_gemma":[0.9994481,0.00018807252,0.00011858759,0.000078675024,0.00011646681,0.000050034792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003039626,0.0003446478,0.0005918615,0.0007661723,0.00043248982,0.0016116942,0.00068168156,0.00062050094,0.004189065],"category_scores_gemma":[0.0019211841,0.00024527172,0.0002600188,0.001360803,0.00033601563,0.0017338904,0.00063478213,0.00056459295,0.00088383246],"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.0011140081,0.00011775352,0.0041034943,0.00039787663,0.00006355949,0.00035340257,0.00040067188,0.21567568,0.01547697,0.51668143,0.012896672,0.23271842],"study_design_scores_gemma":[0.00013779676,0.00040158458,0.002970539,0.00007328318,0.00006480127,0.0007457443,0.00046300673,0.47698373,0.011026993,0.48555356,0.021541934,0.000037023743],"about_ca_topic_score_codex":0.0011792667,"about_ca_topic_score_gemma":0.002665211,"teacher_disagreement_score":0.004189065,"about_ca_system_score_codex":0.00080903934,"about_ca_system_score_gemma":0.00052774645,"threshold_uncertainty_score":0.014013827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11750832,0.00029556747,0.8722424,0.00014904734,0.00015771191,0.00008476375,0.00009866696,0.0015254682,0.007938074],"genre_scores_gemma":[0.5772354,0.00019742857,0.41760352,0.00007424496,0.000032292694,0.00009380611,0.0001537944,0.000445772,0.004163721],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951684,0.00011953206,0.000035118137,0.0001189614,0.00014455836,0.00006504425],"domain_scores_gemma":[0.9985858,0.0004930398,0.00011020663,0.00061795535,0.00011140867,0.000081594575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422584,0.0007015176,0.00077867456,0.0013011589,0.0006269905,0.00086590135,0.0013718904,0.0010841783,0.005564249],"category_scores_gemma":[0.0036387397,0.00069852883,0.00072229624,0.001248236,0.0013509619,0.0018261274,0.0029030943,0.0009784456,0.001113113],"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.0006544911,0.0001397203,0.002395109,0.00025846623,0.000095506315,0.00062006636,0.0010277744,0.32777655,0.06391143,0.082803324,0.0050748647,0.51524264],"study_design_scores_gemma":[0.00010007143,0.00022091673,0.000837522,0.000051315936,0.000063061314,0.0005635875,0.00037127384,0.84069544,0.026126098,0.11877707,0.0121275345,0.00006611278],"about_ca_topic_score_codex":0.00078274286,"about_ca_topic_score_gemma":0.0012714971,"teacher_disagreement_score":0.005564249,"about_ca_system_score_codex":0.00029195816,"about_ca_system_score_gemma":0.00023633741,"threshold_uncertainty_score":0.018614233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14347576,0.0010052024,0.7660064,0.006927442,0.00046187764,0.0007673396,0.003800815,0.0031567267,0.07439848],"genre_scores_gemma":[0.5397542,0.00082144234,0.41919154,0.0017115073,0.00031160185,0.0013370392,0.0045208344,0.0009783071,0.03137354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886334,0.00020393525,0.000071898015,0.00031922615,0.0003015417,0.00024015541],"domain_scores_gemma":[0.9935307,0.0052905837,0.00027958854,0.00042421304,0.000316167,0.00015883204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085377,0.0014398854,0.0018185802,0.00080890866,0.0013125445,0.0036655592,0.0019471045,0.0025277645,0.022117632],"category_scores_gemma":[0.005977176,0.0010857474,0.002197408,0.0014987141,0.0013793461,0.0029943762,0.0023588785,0.0026303702,0.0021913366],"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.0007912312,0.00048440858,0.002063081,0.0016460019,0.00028420886,0.00043919787,0.00040159433,0.6366287,0.014181268,0.1079252,0.04292943,0.19222572],"study_design_scores_gemma":[0.00031512752,0.00016296734,0.0003463264,0.00008637393,0.00010170892,0.00021130167,0.00023806341,0.70897114,0.0061116596,0.27419543,0.009225986,0.00003387171],"about_ca_topic_score_codex":0.0026310356,"about_ca_topic_score_gemma":0.0043000435,"teacher_disagreement_score":0.022117632,"about_ca_system_score_codex":0.0017200902,"about_ca_system_score_gemma":0.0022638827,"threshold_uncertainty_score":0.07399088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17307846,0.0035424961,0.66491854,0.0437276,0.0016794488,0.00016505599,0.00046927878,0.0004414996,0.11197774],"genre_scores_gemma":[0.9586418,0.0013531713,0.028562583,0.0022130494,0.0009306926,0.00013141948,0.00017530745,0.00009057335,0.007901338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962255,0.0014454388,0.00017008242,0.00072322716,0.00092940405,0.000506413],"domain_scores_gemma":[0.97832,0.015301563,0.0015295588,0.0031386514,0.0010921734,0.00061806804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005074723,0.0004307911,0.0014318349,0.0016311636,0.0035072446,0.006910115,0.0029733614,0.0051654493,0.013337893],"category_scores_gemma":[0.03736459,0.00086605403,0.001066828,0.0022886044,0.014479821,0.035321478,0.006206469,0.0060197716,0.0012715523],"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.000031609354,0.000024912062,0.00013011947,0.000030466246,0.00000825573,0.000021484124,0.00010676941,0.0011284536,0.000078695455,0.9942273,0.0005945065,0.003617468],"study_design_scores_gemma":[0.0000068583026,0.000004019081,0.000031316868,0.0000075787034,0.0000026287942,0.0000102034755,0.000031280633,0.0029414103,0.00005256877,0.9964496,0.00045655732,0.000005985696],"about_ca_topic_score_codex":0.0011148497,"about_ca_topic_score_gemma":0.0006078465,"teacher_disagreement_score":0.013337893,"about_ca_system_score_codex":0.0020776729,"about_ca_system_score_gemma":0.001939605,"threshold_uncertainty_score":0.04461968},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036024994,0.000118260374,0.9917685,0.00009056803,0.000040639254,0.000028123477,0.000040539693,0.00017547295,0.004135439],"genre_scores_gemma":[0.17998989,0.0005243583,0.807937,0.00016028379,0.00008141478,0.00022714342,0.00022577871,0.00054111186,0.010313026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995914,0.00011121084,0.000019733414,0.00008283741,0.00015481956,0.000040025898],"domain_scores_gemma":[0.99954623,0.0001407991,0.000031825715,0.00016857169,0.000087100925,0.000025493055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005694151,0.00079386716,0.0008280259,0.0012126103,0.00077635515,0.0015791745,0.003401885,0.0016707663,0.007316418],"category_scores_gemma":[0.0028956048,0.0008387487,0.0012184677,0.0010192444,0.0014491922,0.0025539305,0.0034869602,0.0024797618,0.0014805088],"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.00006385726,0.00004825668,0.00026924294,0.00013356435,0.000047410038,0.00010075641,0.00017338069,0.366147,0.0057846033,0.53902036,0.0038742304,0.084337346],"study_design_scores_gemma":[0.000012439613,0.0000193276,0.000058177186,0.000014678792,0.000013139514,0.00004398817,0.00002644812,0.80032337,0.0013005714,0.1923731,0.0057962644,0.000018471073],"about_ca_topic_score_codex":0.0016772154,"about_ca_topic_score_gemma":0.0019136163,"teacher_disagreement_score":0.007316418,"about_ca_system_score_codex":0.0008362417,"about_ca_system_score_gemma":0.0006146392,"threshold_uncertainty_score":0.024475813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06623892,0.018392831,0.85747826,0.0050112796,0.00029695904,0.00017036148,0.00045851473,0.0003867912,0.05156603],"genre_scores_gemma":[0.7752115,0.014613208,0.18548186,0.0006168673,0.0013894388,0.00040984395,0.0006955166,0.0004235981,0.021158218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800116,0.0008909208,0.000053347,0.00020352559,0.0006455988,0.00020544275],"domain_scores_gemma":[0.98199534,0.015729442,0.00055629114,0.00071777974,0.0007911029,0.00021006765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034141901,0.0011706538,0.0015280189,0.0028229388,0.0013280407,0.0039978833,0.0021462925,0.0019948294,0.0073416824],"category_scores_gemma":[0.02223738,0.0010047604,0.0013064619,0.004558725,0.0028522413,0.0073354864,0.0016167308,0.0035906958,0.0005366036],"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.0001597548,0.00018637824,0.0015259283,0.00036967776,0.00010737961,0.00007841202,0.00033997998,0.43314517,0.0007275761,0.468238,0.014661455,0.08046036],"study_design_scores_gemma":[0.000029446239,0.000024305487,0.0005347524,0.00004999191,0.00003599656,0.000060158844,0.00006990751,0.64140594,0.00028935983,0.35376698,0.003716671,0.0000163672],"about_ca_topic_score_codex":0.0067400015,"about_ca_topic_score_gemma":0.007844958,"teacher_disagreement_score":0.0073416824,"about_ca_system_score_codex":0.0042609246,"about_ca_system_score_gemma":0.0023633207,"threshold_uncertainty_score":0.03091532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055028666,0.0014503467,0.90362376,0.0040405164,0.00034716487,0.00006950764,0.00037380398,0.0006826398,0.034383558],"genre_scores_gemma":[0.7244157,0.0022650685,0.23335914,0.0016698933,0.0010385491,0.00050279277,0.0008881614,0.0007269052,0.03513374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740356,0.0009116574,0.00011755668,0.0003495285,0.0008479824,0.00036967278],"domain_scores_gemma":[0.99269134,0.0044336743,0.0004902777,0.0017424441,0.00044850665,0.00019375414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002233354,0.0010144897,0.0015161574,0.0022621835,0.0013922335,0.005157482,0.0027625049,0.0025138059,0.008971661],"category_scores_gemma":[0.018238697,0.0005579375,0.0009367968,0.003959221,0.0037675232,0.014149453,0.0029067793,0.0039657983,0.0018087788],"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.00005390125,0.000019396031,0.0000928618,0.000025024898,0.000003494475,0.000027044072,0.000045796296,0.0086673265,0.00029857326,0.9788745,0.0018111871,0.010080934],"study_design_scores_gemma":[0.000008085524,0.0000073122874,0.000022344166,0.000009803472,0.0000041388284,0.000037758262,0.000015008161,0.061532844,0.00036169152,0.936631,0.0013612052,0.000008845844],"about_ca_topic_score_codex":0.0009650247,"about_ca_topic_score_gemma":0.00066231226,"teacher_disagreement_score":0.008971661,"about_ca_system_score_codex":0.0019105033,"about_ca_system_score_gemma":0.0013515815,"threshold_uncertainty_score":0.030013204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032156143,0.0007634385,0.9427376,0.00090023957,0.00010409656,0.00007143734,0.00061533967,0.00094885286,0.02170296],"genre_scores_gemma":[0.38441303,0.0011033232,0.5765502,0.00045193319,0.00020456445,0.00034560854,0.002182765,0.00081917446,0.033929475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882966,0.0003278595,0.000074393734,0.00019640912,0.00038042563,0.00019120102],"domain_scores_gemma":[0.99571544,0.001974912,0.00019530105,0.0013472611,0.00041048645,0.00035668138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017911172,0.00076616026,0.0014079623,0.0014949085,0.0014688616,0.0042063184,0.0026184455,0.0018509896,0.017179817],"category_scores_gemma":[0.01138822,0.0009452277,0.00162983,0.0022308645,0.0015764897,0.007137097,0.0041370355,0.0039773346,0.004012227],"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.00013482527,0.0001097921,0.00093141105,0.00015113658,0.00006400826,0.00010249142,0.00023886624,0.044969603,0.0018979441,0.8133235,0.012221435,0.12585504],"study_design_scores_gemma":[0.00001793285,0.000030790623,0.00019657431,0.00003726092,0.000030336307,0.00012108132,0.00004713713,0.14408475,0.0011086438,0.84638757,0.007924133,0.000013822429],"about_ca_topic_score_codex":0.0007493118,"about_ca_topic_score_gemma":0.0014015103,"teacher_disagreement_score":0.017179817,"about_ca_system_score_codex":0.0010600716,"about_ca_system_score_gemma":0.001084794,"threshold_uncertainty_score":0.05747223},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0819635,0.010216479,0.85609484,0.0040536295,0.00031396138,0.00008352415,0.0001616706,0.0021123914,0.045000035],"genre_scores_gemma":[0.74282575,0.004849875,0.23969,0.0007314979,0.00043010846,0.00015895456,0.00014648384,0.0008472557,0.010320049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951834,0.0019928897,0.0002691809,0.0005426693,0.0015946364,0.00041711854],"domain_scores_gemma":[0.97597164,0.0171989,0.00064600765,0.0048698154,0.00095895235,0.00035469024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077732475,0.00061014236,0.0018068271,0.001763992,0.0018277793,0.0043855645,0.0030127128,0.0022781715,0.006920649],"category_scores_gemma":[0.03532615,0.0011149272,0.001017546,0.0032153316,0.005807698,0.01613967,0.0041001085,0.0031254396,0.0020586436],"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.0005053002,0.00013018149,0.0016807956,0.00031079067,0.000062335006,0.00011033345,0.0004089841,0.10229224,0.0018081659,0.6408342,0.0054297852,0.24642694],"study_design_scores_gemma":[0.00007333488,0.00010220873,0.0002157223,0.00010707011,0.00006119206,0.00017843633,0.00009081465,0.32295892,0.0020579372,0.6660079,0.008100422,0.000046073077],"about_ca_topic_score_codex":0.0021333355,"about_ca_topic_score_gemma":0.002333942,"teacher_disagreement_score":0.0077732475,"about_ca_system_score_codex":0.0012983438,"about_ca_system_score_gemma":0.0019617623,"threshold_uncertainty_score":0.041109383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024111569,0.00014848608,0.97146106,0.00017024209,0.00003205604,0.000022286245,0.00020794642,0.0004274428,0.00341882],"genre_scores_gemma":[0.4719207,0.00063643645,0.51158917,0.00014162008,0.00007101044,0.00009485968,0.0011767021,0.00044933002,0.013920174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996176,0.00007383408,0.00001581742,0.00010553111,0.000118494296,0.00006876969],"domain_scores_gemma":[0.9987431,0.000446312,0.00020988894,0.00028343318,0.00018547187,0.00013178642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044441188,0.0005568901,0.00054532057,0.001403592,0.00069290353,0.0017736617,0.001182638,0.0010850701,0.008167466],"category_scores_gemma":[0.0041933777,0.00073844125,0.0007579131,0.0017066177,0.001415357,0.0029006714,0.0021733006,0.0016335525,0.0012757642],"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.00018433171,0.00008025309,0.0020427327,0.0001855271,0.000048541857,0.00013179134,0.00023445598,0.4166535,0.0062488397,0.44799665,0.0059830793,0.12021019],"study_design_scores_gemma":[0.000028620025,0.000053429736,0.0005178504,0.00003253327,0.000027177693,0.000117384174,0.00008821508,0.63169193,0.0019947765,0.3592451,0.00617737,0.000025573458],"about_ca_topic_score_codex":0.0024083252,"about_ca_topic_score_gemma":0.0037903087,"teacher_disagreement_score":0.008167466,"about_ca_system_score_codex":0.0007439219,"about_ca_system_score_gemma":0.0005801268,"threshold_uncertainty_score":0.027322948},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026793102,0.0071222456,0.34536865,0.007081902,0.0017268469,0.00027226732,0.001115435,0.0015999697,0.60891956],"genre_scores_gemma":[0.5747416,0.0059418646,0.1339894,0.0010339423,0.0009427238,0.00041569408,0.0010956222,0.000939457,0.28089964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988512,0.00039253832,0.00004756232,0.00022126858,0.0003283525,0.00015910878],"domain_scores_gemma":[0.9988343,0.00032039903,0.00012878134,0.0003210695,0.00028177132,0.000113705064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014397119,0.0009552826,0.00050468196,0.0016934486,0.0013702608,0.0041898987,0.0011743249,0.0006869884,0.044329457],"category_scores_gemma":[0.0068051363,0.0003802188,0.00035092203,0.002719979,0.0007984347,0.003090297,0.0018575408,0.0011608552,0.0054498278],"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.00016454393,0.00006813229,0.0014849012,0.00023782595,0.00003724597,0.00013650932,0.00027323584,0.02015213,0.0018539991,0.51549023,0.052838884,0.40726233],"study_design_scores_gemma":[0.00002794013,0.00008108975,0.0017095152,0.00022675471,0.000054324286,0.00035545664,0.00040737953,0.061628964,0.004474622,0.38874704,0.5422492,0.00003770905],"about_ca_topic_score_codex":0.0024207882,"about_ca_topic_score_gemma":0.002985573,"teacher_disagreement_score":0.044329457,"about_ca_system_score_codex":0.0018044895,"about_ca_system_score_gemma":0.0018748385,"threshold_uncertainty_score":0.14829683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3160721,0.00059492385,0.6127608,0.0037113926,0.0016115688,0.0007713121,0.0036796844,0.009176058,0.051622227],"genre_scores_gemma":[0.4166563,0.0003643057,0.5362609,0.0017936588,0.0003676881,0.00048376812,0.0038347829,0.0012689602,0.03896959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992015,0.00023450583,0.000037145775,0.00016285005,0.0001284845,0.0002354706],"domain_scores_gemma":[0.99565023,0.0013726781,0.00019670845,0.0016364951,0.00048826647,0.0006556524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006901099,0.0011355755,0.00097134936,0.0012039354,0.0030595048,0.0017993058,0.0025527584,0.0012016447,0.020083033],"category_scores_gemma":[0.002674771,0.0007245892,0.0009200559,0.0015117222,0.0010628109,0.0025853394,0.001961558,0.0017559328,0.006072003],"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.0044672075,0.00243999,0.011369338,0.0023908801,0.00048550428,0.0012749877,0.00125884,0.058167376,0.17405637,0.15005109,0.117539145,0.4764993],"study_design_scores_gemma":[0.0011678778,0.0020645852,0.008050955,0.00028710262,0.00071182224,0.001591815,0.0024148824,0.28529075,0.17605795,0.42456827,0.09747021,0.0003237111],"about_ca_topic_score_codex":0.0023443187,"about_ca_topic_score_gemma":0.007095824,"teacher_disagreement_score":0.020083033,"about_ca_system_score_codex":0.0009189769,"about_ca_system_score_gemma":0.0020919095,"threshold_uncertainty_score":0.06718445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04417786,0.00019544108,0.9406567,0.0004387754,0.00010013943,0.00019046034,0.0006397324,0.0025061613,0.011094731],"genre_scores_gemma":[0.2129201,0.00017050684,0.7752615,0.00019539014,0.000058763966,0.00022046128,0.00200407,0.0008133984,0.008355737],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897814,0.00022481893,0.00005519648,0.00021699905,0.0003280884,0.00019680265],"domain_scores_gemma":[0.9981629,0.0007172485,0.00008945152,0.00060886174,0.00024139338,0.00018004767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052725,0.0008157868,0.00085758895,0.0008622146,0.00091371394,0.0018293642,0.0014425576,0.0010504833,0.014352604],"category_scores_gemma":[0.0034562638,0.00061990274,0.0010097914,0.001168325,0.0008873779,0.0033105107,0.0033452718,0.0018759167,0.004456331],"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.0013691495,0.0008352495,0.0018691029,0.00077368313,0.00012002447,0.00044540138,0.00092439505,0.08774496,0.0573494,0.18718061,0.046534903,0.6148531],"study_design_scores_gemma":[0.000284999,0.00021244952,0.0007115716,0.00008975814,0.00009508654,0.00030648126,0.0005427236,0.46172023,0.01859301,0.49996263,0.01743872,0.000042288782],"about_ca_topic_score_codex":0.0009730745,"about_ca_topic_score_gemma":0.003517958,"teacher_disagreement_score":0.014352604,"about_ca_system_score_codex":0.0007001704,"about_ca_system_score_gemma":0.0014892536,"threshold_uncertainty_score":0.048014224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109656565,0.00043712792,0.98197377,0.0007906586,0.00015275768,0.00012009428,0.00022265699,0.00053331756,0.00480398],"genre_scores_gemma":[0.14662652,0.0003738645,0.84566265,0.00033970844,0.00020357786,0.00038787635,0.00063009455,0.00027985766,0.0054959184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984675,0.0005770791,0.00005873136,0.0003095874,0.00034973436,0.00023746151],"domain_scores_gemma":[0.9973424,0.001602563,0.00016304605,0.0003429337,0.00029263602,0.00025650545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027980956,0.0016565084,0.00269721,0.0012421298,0.0009873605,0.002807825,0.0035247079,0.0029178842,0.008012298],"category_scores_gemma":[0.007507813,0.0011402072,0.001183047,0.002657377,0.0011291293,0.0033045763,0.0029734138,0.004779473,0.0016390083],"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.00072208187,0.0009058387,0.0010506023,0.00036758333,0.00012265074,0.00012340836,0.00014227859,0.650927,0.0020929421,0.10240282,0.026423503,0.21471927],"study_design_scores_gemma":[0.000109045446,0.00004611176,0.00008149178,0.000015826176,0.00001610319,0.00004840787,0.000020873167,0.9644903,0.00032427866,0.033421863,0.0014158475,0.0000099391455],"about_ca_topic_score_codex":0.0036959858,"about_ca_topic_score_gemma":0.004459228,"teacher_disagreement_score":0.008012298,"about_ca_system_score_codex":0.002373026,"about_ca_system_score_gemma":0.0039857593,"threshold_uncertainty_score":0.026803792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1642559,0.00034880816,0.80661184,0.00030600422,0.00008317751,0.00007232655,0.00022114876,0.0003006388,0.027800139],"genre_scores_gemma":[0.7871712,0.00050329795,0.17883664,0.000087149754,0.00007102652,0.00014211505,0.0006441455,0.00036621085,0.03217817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927026,0.00015053902,0.000041279174,0.00015764021,0.00029271108,0.00008756755],"domain_scores_gemma":[0.9986713,0.0006003246,0.00019863826,0.00020144142,0.00015798357,0.0001703157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005815812,0.00047396185,0.00070685375,0.0017785034,0.001333636,0.0023638448,0.0013771829,0.0010335757,0.012565328],"category_scores_gemma":[0.003826977,0.00090383034,0.0006391287,0.0016333325,0.0023105412,0.0041879835,0.0033208258,0.002143951,0.0013859267],"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.00008834835,0.00004153753,0.00062658224,0.00008115176,0.0000125670085,0.00016506243,0.00047032183,0.0696205,0.0020286962,0.88435197,0.0018011611,0.04071201],"study_design_scores_gemma":[0.000019781965,0.00006108704,0.0004473511,0.000041347084,0.000012396107,0.0002863727,0.00045857683,0.21056835,0.0017225309,0.77810156,0.0082586985,0.000021922338],"about_ca_topic_score_codex":0.0010849213,"about_ca_topic_score_gemma":0.0014685652,"teacher_disagreement_score":0.012565328,"about_ca_system_score_codex":0.00075121253,"about_ca_system_score_gemma":0.00033741072,"threshold_uncertainty_score":0.042035162},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25929233,0.0015144767,0.7036296,0.0048381104,0.0005988872,0.00032038166,0.00042544014,0.003846988,0.025533784],"genre_scores_gemma":[0.87736714,0.00037048847,0.11512432,0.0005687401,0.0002901792,0.0001451395,0.0002699343,0.00034488153,0.0055191806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99474066,0.0012238914,0.00019133172,0.000795663,0.0020224226,0.0010261193],"domain_scores_gemma":[0.9858196,0.009476497,0.0005063452,0.0026301858,0.0010786327,0.0004887517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026570559,0.00097043306,0.0023365472,0.0011744563,0.0016838394,0.003303391,0.0034933763,0.0020070882,0.010798942],"category_scores_gemma":[0.015693512,0.0006647757,0.0011983156,0.0023142244,0.002475717,0.0089392895,0.0046348125,0.0031142046,0.001410527],"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.0031353591,0.0009797787,0.0032333622,0.0005591591,0.00023326422,0.00034307147,0.00051060395,0.26497722,0.026654536,0.49072665,0.026702551,0.1819444],"study_design_scores_gemma":[0.00018805466,0.00014490663,0.00031224376,0.000015743342,0.000052780855,0.0000951792,0.0000787991,0.7779126,0.006255754,0.2130179,0.0018881445,0.0000379772],"about_ca_topic_score_codex":0.0042091254,"about_ca_topic_score_gemma":0.0055515594,"teacher_disagreement_score":0.010798942,"about_ca_system_score_codex":0.0026419482,"about_ca_system_score_gemma":0.004955015,"threshold_uncertainty_score":0.036126018},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4011061,0.0016470673,0.5675992,0.0027233546,0.0002486478,0.00030313275,0.0017781524,0.0016037824,0.022990596],"genre_scores_gemma":[0.6843985,0.0008322417,0.3025637,0.00031052873,0.0002671911,0.00025336316,0.0025605874,0.00048052077,0.008333433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984376,0.00036253632,0.00008909382,0.0003700578,0.0005029893,0.00023772834],"domain_scores_gemma":[0.98645025,0.009774302,0.0007865509,0.0013678396,0.0007968022,0.00082427077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015885896,0.0012971997,0.0019525412,0.0017745814,0.0012677702,0.003798104,0.0035747513,0.0025197566,0.012785449],"category_scores_gemma":[0.017686026,0.0007972737,0.0012274511,0.0037542419,0.001272207,0.0064406465,0.0031014625,0.0028488976,0.0016310713],"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.0022964505,0.0008047623,0.005877136,0.0010731729,0.00016538355,0.00038138902,0.00073591823,0.54064965,0.010359135,0.21513551,0.022747973,0.19977348],"study_design_scores_gemma":[0.00017136813,0.00015772379,0.00046399178,0.000050683528,0.00006887893,0.00020834676,0.0002538579,0.7710604,0.002989858,0.22173935,0.002819613,0.000015952297],"about_ca_topic_score_codex":0.0014007104,"about_ca_topic_score_gemma":0.003107156,"teacher_disagreement_score":0.012785449,"about_ca_system_score_codex":0.0018331986,"about_ca_system_score_gemma":0.0016665182,"threshold_uncertainty_score":0.04277152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08083421,0.0011723535,0.9114844,0.0005990297,0.00024177982,0.00010185637,0.0001348094,0.00040220408,0.0050293207],"genre_scores_gemma":[0.7726392,0.0011770237,0.21760859,0.00014950556,0.00032279038,0.0002637849,0.00026666227,0.00044132606,0.007131049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865305,0.00052095606,0.00005449252,0.00018403823,0.00036848214,0.00021888978],"domain_scores_gemma":[0.99757975,0.0017124339,0.00022801115,0.00014908455,0.00018992685,0.0001408492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002656759,0.0014449849,0.0016403885,0.00092033856,0.0010161665,0.0013314919,0.0017502035,0.0010253198,0.0018590885],"category_scores_gemma":[0.0071742903,0.001016258,0.00070105045,0.0018794797,0.0010422495,0.0025420515,0.0010971695,0.001340187,0.00022214824],"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.000435716,0.00010236662,0.000713015,0.00020888406,0.00007729912,0.000075163916,0.000106988104,0.9235751,0.0024926479,0.02408584,0.0026851383,0.045441933],"study_design_scores_gemma":[0.000023916855,0.00007591111,0.00033607046,0.00000815471,0.000026325206,0.000023031827,0.000019073472,0.9600277,0.0010357368,0.037850708,0.000565544,0.000007789601],"about_ca_topic_score_codex":0.0036321986,"about_ca_topic_score_gemma":0.0036562611,"teacher_disagreement_score":0.0036321986,"about_ca_system_score_codex":0.0012321913,"about_ca_system_score_gemma":0.0015205431,"threshold_uncertainty_score":0.014050424},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031924837,0.00075946137,0.9922462,0.00017574776,0.00016328199,0.00004920089,0.00013865651,0.0010528773,0.0022220912],"genre_scores_gemma":[0.07817269,0.0011078202,0.9101517,0.00012560128,0.00020360594,0.0003860127,0.0009518882,0.0007334783,0.008167242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996637,0.00064358907,0.00016904219,0.000628413,0.0016552751,0.00026665992],"domain_scores_gemma":[0.9926225,0.0039608884,0.00032418553,0.001732701,0.0011234329,0.00023621508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024743397,0.0031682656,0.0028541596,0.004406434,0.0019452892,0.0042038085,0.004654783,0.0028930756,0.014982145],"category_scores_gemma":[0.018804414,0.0016543106,0.0019032104,0.0060634445,0.002330374,0.00737029,0.006272315,0.006398104,0.00535996],"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.00036260908,0.00013186653,0.00080067443,0.00050960574,0.00011472364,0.00007446104,0.0002957874,0.18126528,0.003584133,0.2477859,0.019484809,0.5455902],"study_design_scores_gemma":[0.00011503533,0.00006120105,0.0002612399,0.000055843728,0.000043565902,0.00012191868,0.00008772249,0.6468684,0.0031292457,0.33455718,0.014657818,0.000040760875],"about_ca_topic_score_codex":0.0053474903,"about_ca_topic_score_gemma":0.007217478,"teacher_disagreement_score":0.014982145,"about_ca_system_score_codex":0.002899035,"about_ca_system_score_gemma":0.0018531695,"threshold_uncertainty_score":0.050120234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20302108,0.0010882925,0.76745236,0.0026798686,0.000265512,0.0002493729,0.00014036593,0.0007724891,0.02433068],"genre_scores_gemma":[0.7383621,0.00045854924,0.2450768,0.0005658238,0.00009183709,0.00022901248,0.00021460453,0.00034723076,0.014654081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922454,0.00039870522,0.00001849416,0.00013749441,0.00010111185,0.00011960746],"domain_scores_gemma":[0.9965186,0.0026338978,0.000156089,0.00028310466,0.00014064719,0.0002675932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017171109,0.0010839986,0.0017837028,0.0013766137,0.0019763017,0.0013949715,0.002508789,0.0033836174,0.0069784746],"category_scores_gemma":[0.010541036,0.0010240976,0.0010670953,0.0010887831,0.0029515913,0.0040489696,0.0033091768,0.0025710834,0.0005703067],"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.00066730933,0.00029862978,0.0010501132,0.00029838568,0.00009807609,0.00030063876,0.0004175174,0.5425288,0.0016265939,0.38489363,0.010292362,0.057527885],"study_design_scores_gemma":[0.00007684386,0.000071960065,0.00007394634,0.000026255248,0.000022619994,0.000045222587,0.00007857439,0.6312192,0.00039184632,0.36676142,0.0012202095,0.000011924662],"about_ca_topic_score_codex":0.0024185162,"about_ca_topic_score_gemma":0.0028779253,"teacher_disagreement_score":0.0069784746,"about_ca_system_score_codex":0.0011506551,"about_ca_system_score_gemma":0.0013421176,"threshold_uncertainty_score":0.023345351},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010193525,0.00014087965,0.98745537,0.00014421613,0.00005328765,0.000016228754,0.000080932325,0.00075402664,0.0011615587],"genre_scores_gemma":[0.29615247,0.00027547174,0.69869053,0.00011614899,0.0001550936,0.00016724897,0.0005831945,0.00043189296,0.0034278797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987066,0.00035730787,0.00009239008,0.00026655901,0.00045936814,0.00011788383],"domain_scores_gemma":[0.9949221,0.0028095345,0.0002847091,0.0011277637,0.0006800746,0.0001757305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021338195,0.0011256984,0.0013962574,0.0012123886,0.00095837895,0.0020542569,0.0017822371,0.0011048538,0.0042671566],"category_scores_gemma":[0.013191017,0.00083436846,0.0012076056,0.0017178286,0.0011144318,0.0026387975,0.0023456516,0.001651265,0.0011555909],"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.0004034755,0.000101937025,0.0014539796,0.00020915603,0.00022929972,0.00026358807,0.00018596636,0.6944188,0.0055186027,0.11621901,0.005884284,0.17511189],"study_design_scores_gemma":[0.000027814329,0.000013803393,0.00019591961,0.000005186951,0.000015921933,0.000035729943,0.000015607051,0.941691,0.0019386704,0.05507579,0.0009748229,0.000009782342],"about_ca_topic_score_codex":0.0049486645,"about_ca_topic_score_gemma":0.008993614,"teacher_disagreement_score":0.0049486645,"about_ca_system_score_codex":0.0010541913,"about_ca_system_score_gemma":0.0022958543,"threshold_uncertainty_score":0.014275074},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110429064,0.0037777543,0.00033669587,0.045182146,0.94559735,0.000030189223,0.0001602889,0.0001134604,0.004691617],"genre_scores_gemma":[0.0017890261,0.004234296,0.0005864421,0.021690851,0.9216381,0.000051857907,0.00021679209,0.00021521251,0.04957735],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765694,0.00028643856,0.0002614625,0.00033954292,0.0012302005,0.00022540895],"domain_scores_gemma":[0.98644674,0.004606561,0.00086871977,0.00057351316,0.005884295,0.0016202148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044758315,0.0022538677,0.0020509535,0.00454672,0.00309185,0.008046543,0.002412735,0.00649155,0.03420856],"category_scores_gemma":[0.021023873,0.000906618,0.0018430311,0.0023963682,0.0018819672,0.0035585435,0.0014854769,0.008196519,0.012663709],"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.00003148678,0.0000057856223,0.00002735533,0.00006592254,0.000008616508,0.00003200087,0.0000041743992,0.000026225554,0.000039593055,0.00030401046,0.996382,0.0030729012],"study_design_scores_gemma":[0.00007016123,0.000019738276,0.00046682666,0.00018667369,0.000045743473,0.00010547546,0.000028853541,0.0003858222,0.00014639474,0.0013642011,0.99716955,0.000010506529],"about_ca_topic_score_codex":0.0033844507,"about_ca_topic_score_gemma":0.011970947,"teacher_disagreement_score":0.03420856,"about_ca_system_score_codex":0.0036422925,"about_ca_system_score_gemma":0.0032576988,"threshold_uncertainty_score":0.11443907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21027182,0.0005660756,0.78498757,0.0009662949,0.00014004087,0.00013135413,0.00021534033,0.0005563351,0.0021651585],"genre_scores_gemma":[0.8101041,0.00043495366,0.18306936,0.00015212136,0.00023001249,0.00029023693,0.00028228472,0.0003575877,0.005079387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985228,0.000526839,0.0000765161,0.00026745562,0.0003444379,0.0002619401],"domain_scores_gemma":[0.9929594,0.0050391466,0.000563319,0.0003061903,0.00066044147,0.00047159128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036666393,0.0015378124,0.002438799,0.0011204872,0.001176478,0.0019640247,0.002460986,0.002075165,0.0021430412],"category_scores_gemma":[0.009253392,0.0012821051,0.000897147,0.0019296895,0.0012334131,0.0018377738,0.0012563237,0.001625449,0.00025705007],"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.00052129274,0.00009628152,0.0005505844,0.00013657766,0.000054062064,0.000053587406,0.000056439065,0.9741489,0.0039999634,0.0068474393,0.0010995448,0.012435236],"study_design_scores_gemma":[0.00003203202,0.0000762499,0.0001841065,0.0000028446632,0.000016846801,0.000011044357,0.000007723009,0.9936047,0.0008118854,0.0051309117,0.000114738534,0.000007043672],"about_ca_topic_score_codex":0.008442521,"about_ca_topic_score_gemma":0.0052749524,"teacher_disagreement_score":0.008442521,"about_ca_system_score_codex":0.0022620792,"about_ca_system_score_gemma":0.0033910046,"threshold_uncertainty_score":0.019391298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02747734,0.00058040826,0.9579009,0.0013634927,0.00033748185,0.00024598357,0.00033397495,0.0017461587,0.010014243],"genre_scores_gemma":[0.23789845,0.00031898508,0.7512204,0.0005053977,0.00025636918,0.0005874088,0.00091554463,0.00036214892,0.007935224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775827,0.00054427574,0.00010448938,0.00064144144,0.0005320344,0.00041949455],"domain_scores_gemma":[0.9962745,0.0020416162,0.00020671908,0.00077422755,0.00040377633,0.00029914363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022237224,0.0015020423,0.002330639,0.0011489694,0.0016070289,0.0025376505,0.005693488,0.0029191857,0.013680475],"category_scores_gemma":[0.00863507,0.00079977943,0.0013162488,0.0026802209,0.0014817654,0.0042831353,0.0042668907,0.0030010485,0.0024008215],"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.0018324851,0.00095544336,0.0016471467,0.00042578176,0.00014145399,0.00017142952,0.00024541875,0.60167336,0.004914811,0.06368072,0.034607615,0.28970426],"study_design_scores_gemma":[0.00034846025,0.00007520657,0.00020958182,0.000013517115,0.00002906531,0.00006457954,0.000040682095,0.964328,0.0006416834,0.032311227,0.0019238216,0.000014151056],"about_ca_topic_score_codex":0.0067314357,"about_ca_topic_score_gemma":0.009711984,"teacher_disagreement_score":0.013680475,"about_ca_system_score_codex":0.003002096,"about_ca_system_score_gemma":0.004747319,"threshold_uncertainty_score":0.045765817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029627737,0.00081158703,0.9623908,0.00058455527,0.00031804037,0.000104529994,0.0010838264,0.0016107721,0.003468188],"genre_scores_gemma":[0.29520375,0.0012871465,0.68631256,0.00043135864,0.000531397,0.00041004515,0.004614764,0.00038178987,0.010827289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874485,0.000250496,0.0000989518,0.00019987574,0.0005754146,0.00013040056],"domain_scores_gemma":[0.99750715,0.00091107766,0.0001396024,0.00091398775,0.00045848795,0.00006965807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070379034,0.0011808363,0.0010173441,0.0015433362,0.0004400545,0.0017433588,0.0013744268,0.0015563826,0.0057559167],"category_scores_gemma":[0.006186249,0.00048316785,0.00056786125,0.0023975142,0.0007018791,0.0036094668,0.0021308437,0.001674044,0.0023283507],"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.0009083133,0.0002542275,0.00059987593,0.00027550352,0.000063479645,0.00038795502,0.00017557522,0.109047115,0.03244301,0.09212741,0.017337,0.74638057],"study_design_scores_gemma":[0.00008401243,0.00017069958,0.0003383961,0.000057651207,0.00003170966,0.00058120524,0.00008781894,0.8715865,0.024885522,0.094349295,0.0077906293,0.000036601676],"about_ca_topic_score_codex":0.00090152747,"about_ca_topic_score_gemma":0.0014227931,"teacher_disagreement_score":0.0057559167,"about_ca_system_score_codex":0.00043979808,"about_ca_system_score_gemma":0.0012874532,"threshold_uncertainty_score":0.019255519},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041306343,0.0026653786,0.9385325,0.0024433269,0.000249088,0.00021466218,0.0015101169,0.0040790094,0.008999648],"genre_scores_gemma":[0.3646217,0.002020261,0.61180174,0.0011303537,0.00070653774,0.00086727954,0.004090042,0.0010224319,0.013739605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629384,0.00070804486,0.00040460366,0.00051400973,0.0016642546,0.00041510214],"domain_scores_gemma":[0.9877364,0.0059940093,0.0007250611,0.0041323393,0.0011887479,0.00022338341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020401059,0.00093298126,0.0015748319,0.002549241,0.0015222823,0.0045668464,0.002643875,0.0017503542,0.012418357],"category_scores_gemma":[0.018454403,0.00071733526,0.0010420614,0.008346558,0.0021543568,0.011697315,0.0042146775,0.0028969431,0.003551758],"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.00097516296,0.0004594765,0.0029369988,0.0007667658,0.00010439013,0.00014845973,0.00089373824,0.05660234,0.009409989,0.3918392,0.04169635,0.49416715],"study_design_scores_gemma":[0.00016808065,0.00018282952,0.00061044795,0.00012113717,0.00008300068,0.00036985977,0.00045107136,0.2534876,0.012661057,0.7136109,0.018189652,0.000064376705],"about_ca_topic_score_codex":0.0017110385,"about_ca_topic_score_gemma":0.0027882725,"teacher_disagreement_score":0.012418357,"about_ca_system_score_codex":0.002029676,"about_ca_system_score_gemma":0.0021414796,"threshold_uncertainty_score":0.041543543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006386587,0.00013057402,0.9848306,0.00021485641,0.000058409456,0.00010376063,0.0001664421,0.0018057069,0.006303002],"genre_scores_gemma":[0.08918969,0.00011277574,0.90271306,0.00016544978,0.000044838005,0.00033795348,0.00078329083,0.0007902779,0.005862614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990282,0.00021294819,0.00004611454,0.0002362284,0.00035143862,0.00012506993],"domain_scores_gemma":[0.998486,0.0008207584,0.00007719159,0.00037163013,0.00016715065,0.00007732539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010566058,0.001643048,0.0016234778,0.0011649783,0.00089761475,0.001719667,0.0029825978,0.002052949,0.017363766],"category_scores_gemma":[0.0053976434,0.00084599474,0.0012810383,0.0017303843,0.0010755868,0.0023812775,0.0034880836,0.003118926,0.0044278903],"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.0004522594,0.0003157659,0.00072789454,0.00037354018,0.00008856908,0.00019199005,0.00023041858,0.26220316,0.010025273,0.11371523,0.031473856,0.58020204],"study_design_scores_gemma":[0.00014320313,0.00009014688,0.00021339953,0.000030155765,0.000033593547,0.0001231013,0.000054151584,0.87159485,0.002625852,0.11893895,0.006130809,0.000021732441],"about_ca_topic_score_codex":0.0025061963,"about_ca_topic_score_gemma":0.0044460003,"teacher_disagreement_score":0.017363766,"about_ca_system_score_codex":0.0011877206,"about_ca_system_score_gemma":0.0019224315,"threshold_uncertainty_score":0.058087528},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12487743,0.00014701216,0.85703546,0.0003157474,0.00005715405,0.000092092494,0.000296213,0.0007147814,0.016464151],"genre_scores_gemma":[0.63126475,0.00033617715,0.3596097,0.000111120215,0.000040877672,0.00015447229,0.00074126973,0.00028265902,0.0074589783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956197,0.000119976925,0.00002089843,0.00010950037,0.00013705586,0.000050602404],"domain_scores_gemma":[0.99794143,0.00084923714,0.00023694063,0.0005000632,0.00035818276,0.00011413009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034130123,0.00057285966,0.00054526416,0.0014251011,0.00071375625,0.001148361,0.0013596197,0.0010198039,0.007502304],"category_scores_gemma":[0.0036863482,0.0004306928,0.000728813,0.0014296998,0.0014257962,0.0017905375,0.0023864065,0.0013546797,0.0010648338],"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.00033318138,0.000238146,0.0032644412,0.00036545173,0.000056844918,0.00045357153,0.000633351,0.38593203,0.019528517,0.3225137,0.005457706,0.26122308],"study_design_scores_gemma":[0.000037839254,0.00014182151,0.000701111,0.0000528891,0.000033757795,0.0001697378,0.00020129354,0.7492453,0.0068276734,0.22747387,0.015081796,0.000032940872],"about_ca_topic_score_codex":0.002110939,"about_ca_topic_score_gemma":0.00339385,"teacher_disagreement_score":0.007502304,"about_ca_system_score_codex":0.00049786654,"about_ca_system_score_gemma":0.00046558862,"threshold_uncertainty_score":0.025097728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45652416,0.0025453523,0.5160569,0.005524198,0.00049312337,0.00006730059,0.0007430605,0.0006729439,0.017372895],"genre_scores_gemma":[0.92063,0.001623422,0.064159155,0.00086859846,0.0011410507,0.00026661216,0.0009426367,0.00043294206,0.009935651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975504,0.0007863,0.000094743955,0.00052237976,0.00069038576,0.00035564153],"domain_scores_gemma":[0.9596056,0.029769044,0.0025705574,0.0029789312,0.002008091,0.0030678771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072801705,0.0010504149,0.0018782234,0.0032184846,0.0018180825,0.003966077,0.0041721184,0.0028795814,0.0066061993],"category_scores_gemma":[0.04630668,0.00084044156,0.0013618467,0.0024135811,0.005446051,0.008567233,0.004159292,0.00637178,0.00070869614],"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.00011072207,0.000053289026,0.002318203,0.00009173564,0.00006954078,0.00010313643,0.00022420952,0.031678632,0.0012844714,0.9528452,0.0029489049,0.008272006],"study_design_scores_gemma":[0.000031475167,0.00002649171,0.00085949746,0.0000257885,0.000019837136,0.000100484045,0.00005772344,0.1672105,0.00030600736,0.83047765,0.0008583077,0.000026149806],"about_ca_topic_score_codex":0.001318808,"about_ca_topic_score_gemma":0.0017321167,"teacher_disagreement_score":0.0072801705,"about_ca_system_score_codex":0.002229887,"about_ca_system_score_gemma":0.0011417983,"threshold_uncertainty_score":0.03850168},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2857043,0.0001690553,0.7107718,0.00039786604,0.000035704616,0.00017392123,0.000038699895,0.0002605334,0.0024480722],"genre_scores_gemma":[0.6757458,0.00019884732,0.31904462,0.0000937535,0.000061182,0.00033156443,0.00017886763,0.000045536595,0.004299813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994742,0.000112216454,0.000030440026,0.00016678638,0.000121809695,0.00009468409],"domain_scores_gemma":[0.9986658,0.00064185745,0.00027589768,0.0001419639,0.00012265627,0.00015196178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009338804,0.0009333996,0.0013559886,0.0013245852,0.0017857781,0.0012109287,0.002891959,0.0024705483,0.002199347],"category_scores_gemma":[0.0041519552,0.0008474458,0.001210382,0.0013828547,0.0014760941,0.0026234714,0.0030286543,0.0009346277,0.0004622448],"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.0011617792,0.00047409648,0.012284141,0.00029524113,0.00032366824,0.0011567025,0.0015361621,0.8227697,0.019401172,0.021315943,0.0018224483,0.117458954],"study_design_scores_gemma":[0.00008950149,0.00035168367,0.00092323165,0.000018962803,0.00008358144,0.00018406314,0.0005194035,0.9820963,0.0029942289,0.01127852,0.0014391658,0.000021262016],"about_ca_topic_score_codex":0.0022562891,"about_ca_topic_score_gemma":0.0017083831,"teacher_disagreement_score":0.002891959,"about_ca_system_score_codex":0.0003530293,"about_ca_system_score_gemma":0.0007849195,"threshold_uncertainty_score":0.0073575377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40742734,0.0011031593,0.52817017,0.00229666,0.0004067993,0.00041925765,0.0006436564,0.0007532293,0.058779698],"genre_scores_gemma":[0.8041915,0.0011440202,0.16699053,0.00033050455,0.00013422153,0.00016420796,0.0004832194,0.00019035072,0.026371365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937433,0.00014737573,0.00004184247,0.00012819693,0.000116438336,0.00019190005],"domain_scores_gemma":[0.99809474,0.0008049507,0.00024934488,0.00045490195,0.00019074026,0.00020532057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007896824,0.00063672225,0.00079798436,0.0006857396,0.0020838194,0.0023034513,0.001943975,0.0008605825,0.0056780432],"category_scores_gemma":[0.0036848984,0.0004523277,0.0007050652,0.0008376565,0.0013606878,0.004588398,0.002606105,0.0011244618,0.0008337207],"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.0010164458,0.0002213442,0.0019624417,0.00047314382,0.00010415772,0.0005266949,0.0006552724,0.10163217,0.0106901955,0.76603967,0.0109072905,0.105771035],"study_design_scores_gemma":[0.00015657116,0.0002155218,0.0005285234,0.0000563683,0.000103052895,0.00041492507,0.00047459127,0.17006272,0.007918093,0.8069692,0.013054791,0.000045699533],"about_ca_topic_score_codex":0.0012182768,"about_ca_topic_score_gemma":0.002765638,"teacher_disagreement_score":0.0056780432,"about_ca_system_score_codex":0.0009052097,"about_ca_system_score_gemma":0.0011858745,"threshold_uncertainty_score":0.018994987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17756292,0.0031800524,0.80304325,0.003306482,0.00023383273,0.00011488731,0.001567601,0.001931763,0.009059225],"genre_scores_gemma":[0.714924,0.002296753,0.2658816,0.00089391955,0.0005330919,0.00034916436,0.0038138218,0.00076605426,0.010541649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767643,0.00059063366,0.00017995872,0.0005810402,0.00070775434,0.00026420277],"domain_scores_gemma":[0.97189957,0.019410772,0.0018302212,0.0048114024,0.0010942171,0.0009538345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020583312,0.0012312011,0.0022866041,0.0024195702,0.0012924204,0.0039506797,0.0038642848,0.0028044975,0.007374138],"category_scores_gemma":[0.02899283,0.0010078301,0.00094907964,0.0054194536,0.0034074087,0.016156094,0.0053317025,0.0051254844,0.001457401],"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.0011503543,0.00032599867,0.0030191338,0.00044606865,0.00006351118,0.00020843865,0.0006760292,0.118939094,0.0037863187,0.70343405,0.01351101,0.15443993],"study_design_scores_gemma":[0.000082654646,0.00006640677,0.0003192884,0.000045514,0.000027696191,0.00017994236,0.00011281994,0.16792127,0.0014705893,0.8273195,0.002426151,0.00002813741],"about_ca_topic_score_codex":0.002204082,"about_ca_topic_score_gemma":0.0030071249,"teacher_disagreement_score":0.007374138,"about_ca_system_score_codex":0.0018810754,"about_ca_system_score_gemma":0.0016143281,"threshold_uncertainty_score":0.024668932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08151815,0.0024252844,0.88591653,0.0033150609,0.00021599034,0.00020974608,0.00090983906,0.0013881621,0.02410121],"genre_scores_gemma":[0.81353325,0.0022809214,0.15871984,0.00064960454,0.0007538736,0.00051726523,0.001825966,0.0014982033,0.020221185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99442494,0.0023613803,0.00022389714,0.00068632583,0.0012924164,0.0010109785],"domain_scores_gemma":[0.9602628,0.029759312,0.0022374594,0.0047546327,0.0019880421,0.0009977712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005574713,0.0018264124,0.002491791,0.0022133263,0.0016819759,0.0066159633,0.0057735336,0.0028835451,0.019086719],"category_scores_gemma":[0.052286357,0.0014247036,0.0021094359,0.004546235,0.0026203715,0.013013201,0.0032140054,0.004634555,0.0016852667],"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.00052306225,0.0003292169,0.00244101,0.0003042608,0.00013154643,0.00011167523,0.00031301938,0.44386855,0.0015998104,0.48427865,0.01457787,0.051521316],"study_design_scores_gemma":[0.000040680752,0.00003611223,0.00039188968,0.000026296095,0.0000519613,0.000040385425,0.000040618568,0.79813606,0.0005355113,0.19898728,0.0016953935,0.000017730172],"about_ca_topic_score_codex":0.0048154597,"about_ca_topic_score_gemma":0.0042350106,"teacher_disagreement_score":0.019086719,"about_ca_system_score_codex":0.0060185473,"about_ca_system_score_gemma":0.005012272,"threshold_uncertainty_score":0.063851416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17299935,0.00080060714,0.77855885,0.0011764662,0.00021518375,0.00026887198,0.0011715487,0.0005331729,0.044275917],"genre_scores_gemma":[0.50800526,0.0008558243,0.45843682,0.0002940261,0.00016516067,0.00039599926,0.0023666152,0.00075716263,0.02872309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993073,0.00019221373,0.000035783476,0.00013191205,0.00023149014,0.00010140493],"domain_scores_gemma":[0.9986463,0.0006573996,0.000120691184,0.00026783408,0.00018499479,0.00012271017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006656849,0.0012944444,0.0013746893,0.0013663151,0.0010619634,0.0023088183,0.0016704887,0.0016327385,0.013942278],"category_scores_gemma":[0.005082081,0.0010916002,0.0009678712,0.0016724373,0.0008542561,0.0030683898,0.0029025588,0.0023184349,0.0017608075],"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.001052933,0.00026698568,0.0013042499,0.00065360893,0.00015730703,0.00041682553,0.00045341597,0.23398826,0.017036187,0.47575316,0.026644142,0.24227297],"study_design_scores_gemma":[0.000111802154,0.00017615488,0.0008163283,0.00009259731,0.00008401879,0.00040028006,0.00023786671,0.48292437,0.0071043214,0.49764407,0.010383475,0.000024760113],"about_ca_topic_score_codex":0.00043403057,"about_ca_topic_score_gemma":0.0009686766,"teacher_disagreement_score":0.013942278,"about_ca_system_score_codex":0.00081399234,"about_ca_system_score_gemma":0.00060465955,"threshold_uncertainty_score":0.04664153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42270574,0.002419023,0.52226746,0.004065999,0.00022631048,0.00023901783,0.00080962514,0.0012328314,0.046034],"genre_scores_gemma":[0.9064116,0.00091071473,0.071777865,0.00025379515,0.00008441443,0.00018620005,0.0004800956,0.00041226656,0.019483035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.00056497625,0.000065183995,0.00045801827,0.00025505747,0.00032087014],"domain_scores_gemma":[0.9909333,0.006552436,0.00060419185,0.0010377073,0.00033773837,0.0005346468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014528213,0.000985904,0.001994446,0.0014264189,0.0027806023,0.0032829032,0.0030405226,0.0024342556,0.0090445215],"category_scores_gemma":[0.012732415,0.0012891914,0.0011195105,0.002264237,0.004251047,0.006404631,0.0036776895,0.0026540528,0.0010824389],"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.0005716782,0.00010766837,0.0011533909,0.0003161156,0.00010439996,0.00022456906,0.0006130697,0.30576932,0.0019246505,0.64876115,0.0077695013,0.032684457],"study_design_scores_gemma":[0.00009859689,0.000034498917,0.0002158011,0.000034262317,0.000037117974,0.000093682305,0.00021603791,0.2950231,0.001242269,0.6996757,0.0033059886,0.00002299522],"about_ca_topic_score_codex":0.006154896,"about_ca_topic_score_gemma":0.007691697,"teacher_disagreement_score":0.0090445215,"about_ca_system_score_codex":0.0023291626,"about_ca_system_score_gemma":0.0015226969,"threshold_uncertainty_score":0.030256987},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007964674,0.010044427,0.0006281818,0.098567426,0.8788324,0.000041380838,0.00012332224,0.00010590635,0.011577332],"genre_scores_gemma":[0.0016340323,0.0064987065,0.00048374466,0.063114814,0.8521706,0.00009023678,0.00013680932,0.00023957857,0.07563144],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975714,0.00051326305,0.00029228034,0.0003845602,0.0010503399,0.00018813249],"domain_scores_gemma":[0.98179525,0.006294362,0.0010737138,0.0007856256,0.007986286,0.0020647268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036496,0.001971632,0.002798649,0.0028939988,0.002112371,0.006843661,0.0020011247,0.0055605723,0.043752823],"category_scores_gemma":[0.02179995,0.0007263515,0.0011214676,0.0014267293,0.0014040426,0.004892906,0.0024454147,0.014188285,0.044751897],"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.000016591644,0.000005992225,0.00001709998,0.000058576905,0.0000033494425,0.00002275083,0.000008506441,0.000018049503,0.000032610387,0.00073552976,0.99252045,0.0065604243],"study_design_scores_gemma":[0.000018749943,0.00002269083,0.00015713052,0.00018580865,0.000011859084,0.000101381826,0.000024033196,0.00013899262,0.00008634916,0.0018421777,0.99739754,0.000013171265],"about_ca_topic_score_codex":0.0009159008,"about_ca_topic_score_gemma":0.0012533003,"teacher_disagreement_score":0.043752823,"about_ca_system_score_codex":0.0016112654,"about_ca_system_score_gemma":0.0016292273,"threshold_uncertainty_score":0.14636779},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003187373,0.00017500186,0.99321294,0.00020583734,0.00012047424,0.000026549538,0.00027867776,0.0002383232,0.0025547484],"genre_scores_gemma":[0.17240988,0.0013362974,0.8051516,0.00033081122,0.0005132182,0.00022651257,0.0021215524,0.0007217382,0.017188367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892396,0.00025591697,0.000084716456,0.0001963211,0.0004482225,0.000090874055],"domain_scores_gemma":[0.9976217,0.0007016286,0.00014813119,0.00090910087,0.00049623766,0.0001231292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010830449,0.00065461145,0.0012147584,0.0018627979,0.0007311755,0.0021270278,0.002523872,0.0015278553,0.013814872],"category_scores_gemma":[0.008416328,0.00074211176,0.0007862269,0.0027072204,0.0011726164,0.0042149834,0.0033737463,0.002413317,0.0037246656],"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.00015153912,0.000086546774,0.00056853466,0.00019503832,0.000031961474,0.00018305062,0.000120182944,0.09141524,0.0042415187,0.5753895,0.01886788,0.308749],"study_design_scores_gemma":[0.000025928013,0.00004465656,0.00012872079,0.00003576411,0.000012802706,0.0002006054,0.000033747623,0.717536,0.002008922,0.2603055,0.019643035,0.000024370125],"about_ca_topic_score_codex":0.001397307,"about_ca_topic_score_gemma":0.0018202887,"teacher_disagreement_score":0.013814872,"about_ca_system_score_codex":0.0006319607,"about_ca_system_score_gemma":0.000919548,"threshold_uncertainty_score":0.046215355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6768906,0.00091624336,0.21605293,0.018849464,0.00045924674,0.00023157524,0.0010987106,0.0005136602,0.08498756],"genre_scores_gemma":[0.9820472,0.00022729319,0.012508007,0.00052199233,0.00038534665,0.00014476306,0.00038804207,0.000073655385,0.003703546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927349,0.0028162135,0.00034643567,0.001033582,0.0020787371,0.0009902564],"domain_scores_gemma":[0.94008005,0.049344316,0.0015643811,0.005074212,0.0025954717,0.0013416203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056262785,0.00062744453,0.0019697703,0.0015714503,0.0029217477,0.0060031204,0.0029918316,0.0028981888,0.0132850725],"category_scores_gemma":[0.034740366,0.00070153666,0.0017331906,0.002119021,0.009432008,0.016825909,0.0048332363,0.0053376686,0.0007096674],"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.000114416136,0.000059173206,0.0007870166,0.000058172536,0.000020684416,0.000054078067,0.00029043498,0.0037998778,0.00033599665,0.9885514,0.0013677081,0.004560967],"study_design_scores_gemma":[0.000022742022,0.000008531488,0.00015580471,0.000005907268,0.0000065915538,0.000016324339,0.000043285174,0.008472083,0.00022871447,0.9907472,0.00028558463,0.000007225901],"about_ca_topic_score_codex":0.0026970957,"about_ca_topic_score_gemma":0.001755479,"teacher_disagreement_score":0.0132850725,"about_ca_system_score_codex":0.003476086,"about_ca_system_score_gemma":0.0031724535,"threshold_uncertainty_score":0.04444301},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027707307,0.0020344264,0.9552128,0.0037785464,0.00045599116,0.0002813248,0.0008134276,0.0024240674,0.0072920816],"genre_scores_gemma":[0.31112397,0.0013713948,0.6705637,0.0012896128,0.00093047495,0.0014336065,0.003045156,0.0013029281,0.008939194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895503,0.0043193605,0.0006739929,0.0026150022,0.0019374128,0.00090390025],"domain_scores_gemma":[0.94558674,0.040049676,0.002001926,0.009732062,0.001590838,0.0010386811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070406664,0.0024849134,0.0042229905,0.0035191018,0.0025855629,0.005835975,0.00886225,0.006337318,0.015692893],"category_scores_gemma":[0.05517998,0.0016354892,0.0025546777,0.0069592404,0.004740178,0.016656954,0.008058682,0.009960596,0.004025033],"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.0033219315,0.0013239987,0.0023075768,0.0009330912,0.00039183843,0.00020894114,0.00048856385,0.36766264,0.0036236763,0.2632047,0.038082857,0.31845018],"study_design_scores_gemma":[0.0006310727,0.00016879276,0.00025039577,0.00008409577,0.000081851555,0.00017239526,0.000107340944,0.5439091,0.0020360013,0.44952682,0.002966349,0.00006582303],"about_ca_topic_score_codex":0.0021788338,"about_ca_topic_score_gemma":0.0029639532,"teacher_disagreement_score":0.015692893,"about_ca_system_score_codex":0.004098329,"about_ca_system_score_gemma":0.0055443905,"threshold_uncertainty_score":0.052497923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010178719,0.00023001294,0.98480046,0.00050046924,0.000037826405,0.000058119673,0.00007650886,0.00016313673,0.003954764],"genre_scores_gemma":[0.17342299,0.0006015404,0.8203298,0.00026463953,0.00020779086,0.0003112768,0.00056482333,0.00019074508,0.0041064015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830484,0.00063172705,0.00012384354,0.00029110134,0.00053018826,0.000118264],"domain_scores_gemma":[0.99255544,0.005405361,0.00034011054,0.0010427296,0.00049408927,0.000162315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027759678,0.0012377464,0.0015007214,0.0026884826,0.002185127,0.0030850396,0.00396442,0.002414285,0.0043312204],"category_scores_gemma":[0.013992418,0.0011852646,0.0025338952,0.0019367676,0.0046466575,0.006108547,0.0049921297,0.0029645138,0.0007877969],"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.000042643926,0.00005188961,0.0005395005,0.00014722282,0.00003374294,0.00006291962,0.00017284088,0.07181136,0.0010555943,0.8899328,0.0016308697,0.034518644],"study_design_scores_gemma":[0.000011798832,0.000014211711,0.00012955646,0.00002485829,0.000009697146,0.000047585992,0.000037637623,0.22188546,0.00032438606,0.7757227,0.0017781096,0.000013898869],"about_ca_topic_score_codex":0.0013499382,"about_ca_topic_score_gemma":0.0018611761,"teacher_disagreement_score":0.0043312204,"about_ca_system_score_codex":0.0011673955,"about_ca_system_score_gemma":0.0018072332,"threshold_uncertainty_score":0.014680922},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.523142,0.00034737273,0.4469564,0.00040873152,0.00022997036,0.00012787218,0.00016612893,0.0013846371,0.027236916],"genre_scores_gemma":[0.92028695,0.00011044684,0.07690615,0.000053878026,0.000021899246,0.00008197362,0.00012259978,0.00014571934,0.0022703528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968326,0.00010871355,0.000015717498,0.000038088638,0.00010079177,0.00005340742],"domain_scores_gemma":[0.9989114,0.0005325317,0.00007721159,0.00027727612,0.00013957566,0.00006211153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005121754,0.0004146907,0.00067012856,0.0003457364,0.00049532275,0.0012506328,0.0012303605,0.00092838355,0.0035796016],"category_scores_gemma":[0.003888366,0.00032295953,0.0004032462,0.00061859074,0.0009918191,0.0014635635,0.0009984343,0.00088512193,0.00029107297],"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.00010551164,0.00006617235,0.0007124495,0.000032812877,0.0000205419,0.000043116863,0.00005420924,0.9608888,0.00169204,0.028629387,0.00048465023,0.0072703185],"study_design_scores_gemma":[0.000015634598,0.000008680223,0.0000483581,0.0000015404047,0.0000031424347,0.000004142171,0.000007862386,0.9938606,0.00067382323,0.005112709,0.0002613332,0.0000021479345],"about_ca_topic_score_codex":0.0026790765,"about_ca_topic_score_gemma":0.0028411234,"teacher_disagreement_score":0.0035796016,"about_ca_system_score_codex":0.00060229615,"about_ca_system_score_gemma":0.0006892591,"threshold_uncertainty_score":0.011974931},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043022107,0.0022704431,0.89790374,0.0026537322,0.0003367866,0.00007831774,0.00026038577,0.000121312565,0.053353153],"genre_scores_gemma":[0.51018447,0.0040303404,0.42263496,0.00088178855,0.0010479946,0.00033840633,0.0010159599,0.0005220757,0.059344027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929214,0.000286599,0.00003527079,0.00013977222,0.00018707673,0.00005919615],"domain_scores_gemma":[0.99705017,0.002306593,0.00021589518,0.00011792728,0.00017014533,0.00013920803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013598625,0.0012148989,0.0011376347,0.00078580406,0.00084976293,0.0021337648,0.001203138,0.0021672433,0.008116374],"category_scores_gemma":[0.0090443725,0.0008780299,0.001079955,0.0011756854,0.0015820091,0.0029032861,0.0022718443,0.0029807892,0.00075222016],"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.00013352094,0.000112488015,0.0008168048,0.00028872746,0.00005327882,0.00015327563,0.00020343729,0.23598637,0.0013151928,0.698654,0.00954953,0.052733455],"study_design_scores_gemma":[0.000053469408,0.000050287235,0.00033962683,0.000043804663,0.000025214777,0.00011635526,0.0000786253,0.40584373,0.0006305968,0.5848011,0.007998657,0.000018598135],"about_ca_topic_score_codex":0.0010200619,"about_ca_topic_score_gemma":0.0009595234,"teacher_disagreement_score":0.008116374,"about_ca_system_score_codex":0.0008651587,"about_ca_system_score_gemma":0.00054806774,"threshold_uncertainty_score":0.027151942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3632899,0.0027111375,0.532885,0.008906701,0.000654566,0.0021628581,0.0107875345,0.011474109,0.06712819],"genre_scores_gemma":[0.5700659,0.0011961338,0.38479257,0.0013444736,0.00047796482,0.0010990412,0.013412253,0.0021591221,0.025452439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959182,0.0007871222,0.00027250327,0.0012205921,0.0010077609,0.00079389807],"domain_scores_gemma":[0.98438764,0.010388967,0.0010396431,0.0023151007,0.00071723084,0.0011514402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022322906,0.002047895,0.0030045987,0.0020408265,0.0028774545,0.006519879,0.0056141824,0.0031487187,0.032708254],"category_scores_gemma":[0.016779982,0.0017888381,0.0028374768,0.0049527166,0.0023147683,0.018256497,0.005216811,0.004346763,0.005021857],"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.00690388,0.0034383917,0.006492111,0.004570376,0.00083623553,0.00053102477,0.002120264,0.1049162,0.03227206,0.29176292,0.092602395,0.4535541],"study_design_scores_gemma":[0.0016122535,0.0004253087,0.0015347626,0.00015179304,0.0005179144,0.00048182003,0.0007611502,0.21244958,0.011704041,0.75562257,0.014650072,0.00008868172],"about_ca_topic_score_codex":0.0027434248,"about_ca_topic_score_gemma":0.008983204,"teacher_disagreement_score":0.032708254,"about_ca_system_score_codex":0.004846838,"about_ca_system_score_gemma":0.0043177945,"threshold_uncertainty_score":0.10942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18240565,0.0024550515,0.7973991,0.0027554547,0.0002330878,0.000089799185,0.00075014506,0.0005850928,0.013326764],"genre_scores_gemma":[0.7183557,0.0014309402,0.27287456,0.00028818086,0.00020519605,0.00013775988,0.001136156,0.0002756689,0.0052958825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991314,0.00032826737,0.000032826036,0.00018348658,0.00020574739,0.00011833786],"domain_scores_gemma":[0.9959413,0.0029461,0.000274065,0.00031483435,0.00030991758,0.00021391398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013872234,0.0009217414,0.0014340312,0.00094920356,0.00064310216,0.0016052847,0.0020768563,0.0019889798,0.0033436536],"category_scores_gemma":[0.0128577305,0.0005401938,0.0006619586,0.0016648014,0.00081028073,0.003059224,0.0016793613,0.0014949818,0.0006331037],"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.0005126552,0.00015472471,0.002078874,0.0003820682,0.000068166606,0.00011404529,0.000164951,0.83497983,0.0034575346,0.062970564,0.010603343,0.08451325],"study_design_scores_gemma":[0.00003637481,0.000034883036,0.00024169586,0.000017479093,0.00001760629,0.00005831223,0.000036437377,0.9512646,0.0005843345,0.04658049,0.0011235379,0.0000042685474],"about_ca_topic_score_codex":0.0022708576,"about_ca_topic_score_gemma":0.0032159172,"teacher_disagreement_score":0.0033436536,"about_ca_system_score_codex":0.0013025637,"about_ca_system_score_gemma":0.0009975362,"threshold_uncertainty_score":0.011185586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034937657,0.00059174787,0.9527022,0.0011206775,0.00018370432,0.00030268147,0.00088376884,0.0032879352,0.0059895366],"genre_scores_gemma":[0.20576333,0.00025879403,0.783366,0.0003890891,0.00017234402,0.00055166084,0.0018145224,0.0005456379,0.0071385712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824643,0.00041764352,0.00009266661,0.00048566845,0.00037573188,0.0003818532],"domain_scores_gemma":[0.9964457,0.0022814367,0.00024054758,0.00041815915,0.00035455383,0.0002596293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024347652,0.0020057096,0.0030162553,0.0017779176,0.001661333,0.003583703,0.0044843107,0.0028644213,0.014129439],"category_scores_gemma":[0.008118475,0.0010792738,0.0017675295,0.0028169574,0.0014603997,0.0045691445,0.0030950368,0.0033739626,0.0024593135],"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.00082175294,0.00041473034,0.0014071257,0.00032634244,0.00013190597,0.00009984407,0.00019381878,0.77060884,0.0027191031,0.028552163,0.01760959,0.17711484],"study_design_scores_gemma":[0.00007571599,0.00005696917,0.000182652,0.000013227607,0.000019967052,0.000027533597,0.000045758945,0.9680319,0.0005580376,0.030126052,0.0008505216,0.00001160134],"about_ca_topic_score_codex":0.010215253,"about_ca_topic_score_gemma":0.019792506,"teacher_disagreement_score":0.014129439,"about_ca_system_score_codex":0.004226078,"about_ca_system_score_gemma":0.0046937005,"threshold_uncertainty_score":0.047267675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046486873,0.0007945388,0.9474739,0.00074305927,0.000083524836,0.00015335313,0.0004878968,0.0009827905,0.002794067],"genre_scores_gemma":[0.31988707,0.00048246948,0.6730838,0.0002568713,0.00020164174,0.00039472154,0.0017907324,0.00061658723,0.0032861216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965082,0.0013761931,0.00018691903,0.0008086975,0.00066800055,0.00045212908],"domain_scores_gemma":[0.96573234,0.026526079,0.0011992101,0.0035739539,0.0017537195,0.0012146842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006710859,0.0015531435,0.002634533,0.0024119983,0.0021510136,0.0035320176,0.006988322,0.0034366846,0.006449056],"category_scores_gemma":[0.036612652,0.0016359035,0.0026753931,0.0038498605,0.0024763413,0.008801959,0.004760976,0.0067722495,0.0014111908],"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.0009320033,0.0006442489,0.00411918,0.0006409925,0.00020384713,0.00015119521,0.000886753,0.49844062,0.0034645814,0.26988056,0.016189475,0.20444652],"study_design_scores_gemma":[0.000058669226,0.000038306993,0.00025342655,0.000037421752,0.00003178564,0.000053991385,0.00007412639,0.7462155,0.0006093724,0.2517069,0.00090288447,0.00001761837],"about_ca_topic_score_codex":0.003259525,"about_ca_topic_score_gemma":0.0071231383,"teacher_disagreement_score":0.006988322,"about_ca_system_score_codex":0.003415156,"about_ca_system_score_gemma":0.002614925,"threshold_uncertainty_score":0.03549081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05593266,0.0014052982,0.9168251,0.002393844,0.00039430702,0.00038053197,0.00024198006,0.0008405756,0.021585755],"genre_scores_gemma":[0.7629399,0.0011539492,0.21418956,0.000855012,0.0008819048,0.000639444,0.00045181715,0.00046264328,0.018425751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517727,0.0024461297,0.00012188606,0.00034126267,0.0010012224,0.00091217045],"domain_scores_gemma":[0.978152,0.017710065,0.0008738824,0.0009167918,0.0012838123,0.0010634788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006013452,0.0020061114,0.003477254,0.0018332467,0.0023693058,0.005152312,0.0062734177,0.0047633443,0.0135598015],"category_scores_gemma":[0.031224532,0.001192543,0.0010929883,0.0033414965,0.0031243495,0.005968346,0.0036890882,0.004492057,0.0014238248],"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.0008608418,0.00064579793,0.00065405696,0.00022010172,0.00007713847,0.00006165066,0.00023526141,0.79994684,0.0007547184,0.09200454,0.01502264,0.08951648],"study_design_scores_gemma":[0.00008281872,0.000054391126,0.000062763116,0.00000847698,0.000010679272,0.000012401164,0.000027226975,0.9600446,0.00016146371,0.038900573,0.00062615896,0.0000084653075],"about_ca_topic_score_codex":0.0075132293,"about_ca_topic_score_gemma":0.006214103,"teacher_disagreement_score":0.0135598015,"about_ca_system_score_codex":0.003949205,"about_ca_system_score_gemma":0.0038277458,"threshold_uncertainty_score":0.045361996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049630407,0.0008439538,0.935449,0.0007217082,0.0005114635,0.00015034483,0.00037151168,0.005590715,0.006730791],"genre_scores_gemma":[0.32605666,0.00043652262,0.65199035,0.0003944855,0.00052693667,0.00025884775,0.0017128709,0.00065344095,0.017969893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896955,0.00018253697,0.00006536685,0.0003051082,0.00034810076,0.00012932334],"domain_scores_gemma":[0.9983664,0.00051696185,0.0000554448,0.0006644647,0.00034179585,0.000054925462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008850435,0.0011621392,0.0014510964,0.0015076488,0.00090525066,0.001448683,0.001375549,0.00076316466,0.010958719],"category_scores_gemma":[0.0033038054,0.00052146154,0.0011575408,0.0025104233,0.00066458253,0.0016495207,0.0017576872,0.0010859579,0.003007517],"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.0006103752,0.00017275239,0.0015757909,0.00009521805,0.000122956,0.00016051972,0.00006545533,0.042415094,0.02009808,0.00941943,0.015631165,0.90963316],"study_design_scores_gemma":[0.00017114096,0.00017883904,0.0020161746,0.000016569895,0.00012450936,0.0003843572,0.000068572714,0.89322335,0.032786597,0.054057922,0.016942894,0.000029086508],"about_ca_topic_score_codex":0.0036027485,"about_ca_topic_score_gemma":0.0059057837,"teacher_disagreement_score":0.010958719,"about_ca_system_score_codex":0.00065910374,"about_ca_system_score_gemma":0.0014440453,"threshold_uncertainty_score":0.03666061},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016307678,0.000119737415,0.98037887,0.00011341237,0.000055592813,0.000055593766,0.00007797706,0.0006350043,0.002256109],"genre_scores_gemma":[0.20706727,0.00018527114,0.78729665,0.000067792935,0.000050136234,0.00017178712,0.00036577924,0.00024392249,0.0045514065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936146,0.00011553225,0.000037261154,0.00008291967,0.00030501085,0.00009785581],"domain_scores_gemma":[0.9990495,0.00040123466,0.00007606036,0.00023083988,0.0001650588,0.000077209384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007678113,0.0007515365,0.001123046,0.0010059357,0.00065571914,0.0013922063,0.0026037053,0.0013345426,0.0061652716],"category_scores_gemma":[0.0040080007,0.0006015366,0.00078950025,0.002002421,0.0007855424,0.0019546119,0.0027605037,0.0016367502,0.0011936454],"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.0008106515,0.00016899852,0.0007211955,0.0003021408,0.00005507879,0.00013707456,0.0002909345,0.5170786,0.016218355,0.061506074,0.007617738,0.3950931],"study_design_scores_gemma":[0.00004034442,0.000029877418,0.000047599722,0.000008118578,0.0000068671216,0.00001940245,0.000020542027,0.985135,0.0014863798,0.011909519,0.0012904878,0.0000058563483],"about_ca_topic_score_codex":0.0053153937,"about_ca_topic_score_gemma":0.007463755,"teacher_disagreement_score":0.0061652716,"about_ca_system_score_codex":0.0011305258,"about_ca_system_score_gemma":0.0009094281,"threshold_uncertainty_score":0.020624876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8003844,0.00072865497,0.17927022,0.00039818056,0.00009453938,0.000045510762,0.00041149696,0.00021060323,0.018456372],"genre_scores_gemma":[0.94328934,0.0006830922,0.049698688,0.00007681227,0.00007969651,0.00006530541,0.00047285066,0.000118837175,0.005515352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942374,0.00012699976,0.000029478455,0.00014721176,0.00019274573,0.00007989298],"domain_scores_gemma":[0.9957367,0.0022841748,0.0008274079,0.0003653704,0.00033909356,0.00044710457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085971167,0.0005905722,0.0005826067,0.0034124418,0.00091218384,0.0020032998,0.0014105211,0.0010054087,0.005135234],"category_scores_gemma":[0.008026461,0.0004975186,0.00045225813,0.0027262424,0.0015194968,0.0032279936,0.0012178342,0.0011327098,0.00034985444],"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.00046391785,0.0001615878,0.008901457,0.00027419123,0.00009761572,0.00031740803,0.00047666422,0.1993831,0.014208932,0.69915205,0.0034768467,0.07308628],"study_design_scores_gemma":[0.00002954887,0.00007581533,0.005049574,0.000041865733,0.00006844121,0.00041767725,0.00021943482,0.29555407,0.0053246287,0.68959796,0.003586843,0.00003417372],"about_ca_topic_score_codex":0.000602516,"about_ca_topic_score_gemma":0.0007451412,"teacher_disagreement_score":0.005135234,"about_ca_system_score_codex":0.0009226539,"about_ca_system_score_gemma":0.00031061168,"threshold_uncertainty_score":0.017179072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24246755,0.0008804886,0.7285828,0.0012449706,0.00021563488,0.000120921555,0.00016618852,0.0012795936,0.025041824],"genre_scores_gemma":[0.8887774,0.00059382775,0.10416544,0.00030035962,0.000096819,0.00010229694,0.0001054273,0.00013841422,0.005719978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988943,0.0004067,0.00005238492,0.0001877263,0.00023204216,0.00022683255],"domain_scores_gemma":[0.9917345,0.0043955497,0.00046307725,0.0024495583,0.00069030095,0.00026697348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011203127,0.00069029443,0.0006843099,0.0008431516,0.0005575922,0.0013893613,0.0015225331,0.0012134388,0.0036661183],"category_scores_gemma":[0.013222039,0.00048126213,0.00046584362,0.0012985071,0.0012791192,0.0020151301,0.0013823425,0.001269526,0.0011239182],"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.0025336896,0.0005493181,0.0048221936,0.00048371858,0.00016010403,0.00063003,0.00072386686,0.37696323,0.14478408,0.22397828,0.007275049,0.23709658],"study_design_scores_gemma":[0.00019944725,0.00051875756,0.0013855235,0.00004782732,0.00011208256,0.0011418381,0.00036212092,0.86179966,0.037298914,0.08946591,0.0075983475,0.00006945249],"about_ca_topic_score_codex":0.0004217922,"about_ca_topic_score_gemma":0.0005919348,"teacher_disagreement_score":0.0036661183,"about_ca_system_score_codex":0.00071485905,"about_ca_system_score_gemma":0.00043411582,"threshold_uncertainty_score":0.0122644305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064417005,0.00084471505,0.9191627,0.0011700772,0.00016060931,0.00016614053,0.0002572788,0.0026909197,0.0111305835],"genre_scores_gemma":[0.340504,0.00058214803,0.64767504,0.00021627473,0.00009168343,0.00023006347,0.00064170815,0.00039018097,0.009668946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944705,0.00016422493,0.000026458369,0.00011024931,0.00015031832,0.000101666716],"domain_scores_gemma":[0.99865216,0.000635706,0.00010437117,0.00034315523,0.00017960742,0.00008491371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070647796,0.0008701195,0.0010392917,0.0010512077,0.0012626011,0.0014240416,0.0015778218,0.0010137255,0.0064699445],"category_scores_gemma":[0.0040133763,0.0005830022,0.0006170845,0.0020311668,0.0009878281,0.0025530874,0.0015380556,0.0014082406,0.0010234207],"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.00020491438,0.000114006034,0.00080882944,0.00020587949,0.00004839848,0.00007586534,0.00011926406,0.74534625,0.003649169,0.07354121,0.011273195,0.16461304],"study_design_scores_gemma":[0.00002969889,0.000017309783,0.00017217529,0.0000062022573,0.0000103050415,0.000017027322,0.000032534095,0.9178963,0.00084356725,0.07853391,0.0024350742,0.000005978582],"about_ca_topic_score_codex":0.014404842,"about_ca_topic_score_gemma":0.03113026,"teacher_disagreement_score":0.014404842,"about_ca_system_score_codex":0.0014939095,"about_ca_system_score_gemma":0.0023548263,"threshold_uncertainty_score":0.028641999},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07206536,0.019393448,0.8928977,0.0022188681,0.00028579775,0.00004748995,0.00023406067,0.0006026785,0.012254515],"genre_scores_gemma":[0.7139638,0.009055212,0.25527632,0.00059191865,0.00088782643,0.0002362701,0.00046143116,0.00031549492,0.019211814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981511,0.00063327764,0.000088047535,0.00028593454,0.00069841475,0.00014317814],"domain_scores_gemma":[0.991438,0.006386822,0.000499193,0.0010519229,0.00047411709,0.0001499624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002547434,0.0007482437,0.0017305912,0.0029716345,0.0009409008,0.002982358,0.001403,0.0018053761,0.0043490254],"category_scores_gemma":[0.023404425,0.0005668814,0.0004886681,0.0051393844,0.003727787,0.006091632,0.0021779747,0.0025379488,0.0007755613],"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.0003575452,0.00007512173,0.0009613958,0.00040563042,0.00005637314,0.00011256713,0.00023168046,0.13233788,0.0024866734,0.6535373,0.0069353743,0.20250253],"study_design_scores_gemma":[0.000033521777,0.00006212184,0.00033478567,0.00005456009,0.000032747306,0.00016909897,0.000043565393,0.21370327,0.0017301756,0.78053546,0.0032728356,0.000027880465],"about_ca_topic_score_codex":0.0014242186,"about_ca_topic_score_gemma":0.0013808584,"teacher_disagreement_score":0.0043490254,"about_ca_system_score_codex":0.0017205087,"about_ca_system_score_gemma":0.0011281617,"threshold_uncertainty_score":0.014548957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8662361,0.00065004017,0.081522375,0.0012442551,0.00006201416,0.00020054416,0.0017994329,0.00049197016,0.04779318],"genre_scores_gemma":[0.9195622,0.00081395684,0.05020904,0.0003357407,0.00007923787,0.00021358386,0.0052720914,0.00022379661,0.02329025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961,0.00008639952,0.000023803801,0.00010171462,0.000102286016,0.00007579188],"domain_scores_gemma":[0.9990011,0.00038815956,0.00024895038,0.00012942503,0.00011171114,0.000120736026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017929566,0.0004909638,0.00051237806,0.0012322658,0.00087254995,0.0014260284,0.0011493821,0.0006670074,0.00919464],"category_scores_gemma":[0.00168486,0.0006257431,0.0006513731,0.0014716114,0.0008059369,0.0020098477,0.0012335142,0.0008079946,0.0010939471],"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.0011278363,0.00035985984,0.0137087535,0.00090614083,0.00021745719,0.0019688825,0.0019838102,0.031869855,0.05212624,0.757519,0.020067334,0.118144885],"study_design_scores_gemma":[0.00015911502,0.0001090348,0.011612834,0.000076655306,0.00023721637,0.0015217036,0.0010511106,0.048254486,0.012376727,0.8975446,0.02702013,0.00003632794],"about_ca_topic_score_codex":0.0015713051,"about_ca_topic_score_gemma":0.0023995815,"teacher_disagreement_score":0.00919464,"about_ca_system_score_codex":0.000581336,"about_ca_system_score_gemma":0.00039463863,"threshold_uncertainty_score":0.030759156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029754988,0.000072933304,0.9931028,0.000032216205,0.000031856824,0.000053076612,0.00007257764,0.002516582,0.0011424078],"genre_scores_gemma":[0.030137783,0.0000805903,0.96512866,0.000047308193,0.000017388233,0.00006328248,0.00046669407,0.00035600385,0.0037023153],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992943,0.00004924703,0.000052733376,0.00020250966,0.0003451606,0.000056067292],"domain_scores_gemma":[0.99918276,0.00013909183,0.000038472794,0.0003104643,0.00026632697,0.00006287322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061172585,0.0012243598,0.001621045,0.0018323471,0.0009954756,0.0011288926,0.0025464552,0.0017073334,0.014949979],"category_scores_gemma":[0.0017538305,0.0009125711,0.0014576446,0.001590068,0.000672681,0.0018967955,0.0036634754,0.0014315275,0.0059850574],"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.00012381077,0.000094060466,0.0006351268,0.00016907939,0.00008348409,0.00011998148,0.00007155225,0.035369627,0.025028128,0.008150987,0.007321644,0.9228325],"study_design_scores_gemma":[0.000096314165,0.00016379249,0.0011598432,0.0000389829,0.000117328134,0.0006509914,0.00007795193,0.9206171,0.03386972,0.023516143,0.019626169,0.000065620574],"about_ca_topic_score_codex":0.0019995482,"about_ca_topic_score_gemma":0.0038477657,"teacher_disagreement_score":0.014949979,"about_ca_system_score_codex":0.00036246947,"about_ca_system_score_gemma":0.0014544618,"threshold_uncertainty_score":0.050012648},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28842,0.044165738,0.6191957,0.0030117168,0.0019145972,0.0006253207,0.0029955653,0.005602303,0.034069087],"genre_scores_gemma":[0.80909985,0.004603745,0.17734447,0.0002749267,0.0007231954,0.0004424987,0.0031273444,0.001009448,0.003374453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9727066,0.012854495,0.0017873559,0.002409409,0.008682529,0.0015596391],"domain_scores_gemma":[0.79779804,0.16020952,0.006853814,0.018511795,0.0139546385,0.00267211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023244468,0.002070673,0.0030488523,0.0072355443,0.0011104415,0.005037354,0.0029366687,0.00356266,0.004360444],"category_scores_gemma":[0.11271043,0.0004899026,0.001478221,0.007209655,0.0017959757,0.007677331,0.0027095259,0.002238344,0.0011106965],"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.0062045036,0.0016589551,0.013976306,0.0022146818,0.0008881051,0.00009277003,0.00036389023,0.2765093,0.0044157975,0.08647524,0.021258406,0.5859421],"study_design_scores_gemma":[0.00045575792,0.004415944,0.014689194,0.0004374538,0.00047981663,0.00052878377,0.00049508305,0.8859353,0.010536443,0.07223571,0.009599834,0.00019074122],"about_ca_topic_score_codex":0.0017220279,"about_ca_topic_score_gemma":0.001197157,"teacher_disagreement_score":0.023244468,"about_ca_system_score_codex":0.0038039158,"about_ca_system_score_gemma":0.0025632884,"threshold_uncertainty_score":0.12292999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25938442,0.0011038892,0.7113301,0.0015902781,0.00020851534,0.00009090425,0.00013280309,0.0005812576,0.025577785],"genre_scores_gemma":[0.9544291,0.00030266412,0.04024196,0.00008131758,0.0000616235,0.000079032325,0.00003487673,0.00007588601,0.0046934797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924004,0.000336149,0.000027791108,0.00013832869,0.000111370086,0.00014637897],"domain_scores_gemma":[0.9969073,0.0019532703,0.00022253499,0.0005279889,0.00014918494,0.0002397482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014184552,0.00041616586,0.00091417105,0.00041639604,0.0010059088,0.0015670588,0.001727605,0.0010006317,0.0035704072],"category_scores_gemma":[0.0065944996,0.0003893117,0.00051166717,0.00061583065,0.0019853625,0.0040845824,0.0023615372,0.0012356366,0.00040858748],"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.0010784528,0.00013741294,0.00068589865,0.00021152318,0.000069418806,0.00016581346,0.0003786285,0.50034654,0.005024066,0.4539081,0.0036092931,0.034384787],"study_design_scores_gemma":[0.00006894711,0.00007631001,0.00011352746,0.000011034906,0.000020573121,0.00003983118,0.000072882074,0.7697736,0.0014070183,0.22695404,0.0014451158,0.000017170203],"about_ca_topic_score_codex":0.00075059215,"about_ca_topic_score_gemma":0.0007386045,"teacher_disagreement_score":0.0035704072,"about_ca_system_score_codex":0.00053792354,"about_ca_system_score_gemma":0.00073004473,"threshold_uncertainty_score":0.011944175},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1621358,0.0039858543,0.17140177,0.0034366325,0.0034107943,0.000061424864,0.001392174,0.00141774,0.6527579],"genre_scores_gemma":[0.5520125,0.0030254452,0.032022502,0.0006042027,0.0017097277,0.00005716323,0.0017909533,0.0005797873,0.4081977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998832,0.000013408723,0.000004903643,0.00004783803,0.000038228765,0.000012453235],"domain_scores_gemma":[0.99959856,0.00017851523,0.000029818924,0.000079232654,0.000059411715,0.000054505268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000860575,0.00034777357,0.00034564067,0.00066736183,0.00068630226,0.0012236125,0.00040608252,0.00031345803,0.028900936],"category_scores_gemma":[0.00079683925,0.00033280253,0.00037522553,0.0014035058,0.0004318906,0.0019153375,0.00050820765,0.0012474968,0.0029881997],"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.000118518896,0.00006840807,0.0004500341,0.0002647839,0.00004123126,0.00028569525,0.00031593995,0.007617839,0.0069773947,0.8299655,0.056625832,0.097268835],"study_design_scores_gemma":[0.00002749104,0.000055810673,0.0007275826,0.00004589355,0.000044838293,0.00034966736,0.00012740587,0.007989347,0.0040189703,0.8185579,0.16803874,0.000016330347],"about_ca_topic_score_codex":0.0005499875,"about_ca_topic_score_gemma":0.0010400712,"teacher_disagreement_score":0.028900936,"about_ca_system_score_codex":0.000624748,"about_ca_system_score_gemma":0.0002397655,"threshold_uncertainty_score":0.09668332},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17166968,0.00036145252,0.7937429,0.00043282667,0.00010470602,0.00008487046,0.00052816176,0.00048385846,0.032591537],"genre_scores_gemma":[0.74298865,0.0004498844,0.2248907,0.00012441244,0.00007182567,0.00009489564,0.0009868108,0.00028745615,0.030105323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959356,0.000100675425,0.000022410528,0.000098644414,0.0001379944,0.000046792306],"domain_scores_gemma":[0.9982014,0.000721441,0.00022119044,0.00041468145,0.00024912905,0.00019208269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005282988,0.0003414973,0.0005184248,0.0011646932,0.0007954255,0.0015136336,0.001041435,0.0008197918,0.0081384275],"category_scores_gemma":[0.0041236905,0.00040090756,0.00035841597,0.00076411327,0.0010921686,0.002114061,0.0017995866,0.0010893127,0.0009591025],"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.00020778102,0.000040817507,0.0018740409,0.00010114248,0.000029557683,0.00033124574,0.0002710288,0.11358332,0.0050284546,0.8152039,0.0032760245,0.06005272],"study_design_scores_gemma":[0.000023309769,0.000024343286,0.00057031267,0.00002393358,0.000016202119,0.00025296796,0.00012337054,0.5162654,0.0026667295,0.46900642,0.011014069,0.000012949278],"about_ca_topic_score_codex":0.0016169139,"about_ca_topic_score_gemma":0.0026697041,"teacher_disagreement_score":0.0081384275,"about_ca_system_score_codex":0.0005165605,"about_ca_system_score_gemma":0.00036059847,"threshold_uncertainty_score":0.027225733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33365285,0.00235757,0.60657424,0.006998555,0.0002491671,0.00011679696,0.0008134667,0.0006673627,0.048569996],"genre_scores_gemma":[0.8835868,0.0013375055,0.0960867,0.0005341055,0.00035123946,0.00016595618,0.0013634707,0.00028980285,0.01628429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842286,0.00059186295,0.000061015413,0.000322526,0.00029194786,0.00030972564],"domain_scores_gemma":[0.9886452,0.009509766,0.0004216475,0.0007510739,0.00035803072,0.00031426683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022934393,0.0011062914,0.001569126,0.0010432762,0.001406852,0.0038486212,0.0032227233,0.0022793403,0.012212583],"category_scores_gemma":[0.017987119,0.0009032828,0.0023186323,0.0010849048,0.002738834,0.006794783,0.0024992668,0.004977579,0.0006842489],"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.00032313252,0.00028025513,0.0035004606,0.0003843954,0.0001301073,0.00021445425,0.0006343323,0.21877131,0.00081731944,0.7426568,0.008951347,0.023336058],"study_design_scores_gemma":[0.0000625126,0.000025055057,0.00043812903,0.000034426368,0.000041266125,0.000068859794,0.00013772742,0.33152512,0.00024306634,0.6657422,0.0016694972,0.000012032732],"about_ca_topic_score_codex":0.0062822383,"about_ca_topic_score_gemma":0.006280416,"teacher_disagreement_score":0.012212583,"about_ca_system_score_codex":0.0024689683,"about_ca_system_score_gemma":0.002004037,"threshold_uncertainty_score":0.04085511},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03576677,0.016495597,0.8166552,0.00364931,0.004672651,0.00025353004,0.0020948849,0.0024009307,0.11801115],"genre_scores_gemma":[0.53542465,0.011828162,0.3303778,0.0034718085,0.0034384234,0.0012931239,0.0037196449,0.0033171822,0.1071293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987816,0.00029487442,0.00010289012,0.00034749368,0.00024918615,0.00022388985],"domain_scores_gemma":[0.9984376,0.0006838921,0.00013675488,0.00042887844,0.00020704822,0.00010575915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007860262,0.0014614522,0.0009047898,0.003077824,0.0018320732,0.003263144,0.0012165913,0.0015781553,0.020244723],"category_scores_gemma":[0.0043428377,0.0005486829,0.0008714022,0.0058580833,0.0025259855,0.0050878082,0.0024886476,0.003127593,0.005498127],"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.000036217454,0.0000151944,0.00011984535,0.00010492087,0.000008913963,0.00008216851,0.0001634811,0.00088968157,0.0008095442,0.9228787,0.0105513865,0.064340025],"study_design_scores_gemma":[0.000005961155,0.00001419107,0.000052633124,0.00004290116,0.000008514784,0.00012323169,0.000038598548,0.001899897,0.0007526255,0.93894774,0.058102902,0.000010769825],"about_ca_topic_score_codex":0.0007240346,"about_ca_topic_score_gemma":0.0008206188,"teacher_disagreement_score":0.020244723,"about_ca_system_score_codex":0.0009887816,"about_ca_system_score_gemma":0.00086106354,"threshold_uncertainty_score":0.0677253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026608419,0.00015100118,0.9607004,0.00029351283,0.000062529216,0.00017890072,0.00033372268,0.002346557,0.009324983],"genre_scores_gemma":[0.34622133,0.00017995133,0.6386584,0.00016459807,0.000043169213,0.00035903757,0.001293383,0.00072622614,0.012353971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.00012008141,0.000032716755,0.0001458526,0.00026474113,0.000103551],"domain_scores_gemma":[0.99848735,0.0007506315,0.00008821969,0.0004465888,0.00014612007,0.00008108435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006217263,0.0009375321,0.0010395794,0.0009222904,0.0007441091,0.001765241,0.002877237,0.0013747448,0.026189296],"category_scores_gemma":[0.0045864563,0.00058666524,0.00094307953,0.0015028965,0.00081602467,0.004443833,0.0035719564,0.001824863,0.002557408],"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.00044340317,0.00038853608,0.00072952575,0.00043687408,0.000052262178,0.0001257203,0.00039407203,0.2804327,0.004225343,0.17828394,0.021197353,0.5132902],"study_design_scores_gemma":[0.000098865006,0.00006492357,0.000109984656,0.000021643635,0.000016958144,0.000055612632,0.000118892276,0.8759683,0.0019428855,0.11774133,0.003847218,0.000013359816],"about_ca_topic_score_codex":0.0031308758,"about_ca_topic_score_gemma":0.006442011,"teacher_disagreement_score":0.026189296,"about_ca_system_score_codex":0.001084872,"about_ca_system_score_gemma":0.0010354132,"threshold_uncertainty_score":0.08761191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36080372,0.0008378677,0.61551,0.0024842476,0.00017875984,0.00018287897,0.0002522831,0.00021467246,0.019535616],"genre_scores_gemma":[0.96451604,0.00044837367,0.026093833,0.00011297139,0.00010398444,0.00007557111,0.00006907943,0.00006404682,0.008516224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989856,0.0005232218,0.000030099283,0.000112390524,0.000118576456,0.00023008819],"domain_scores_gemma":[0.99568945,0.003121544,0.00026924637,0.00029789645,0.0002864708,0.00033552828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023127934,0.0007995608,0.0014269209,0.0009799228,0.0013253607,0.0026944126,0.0023129135,0.0019745964,0.006838986],"category_scores_gemma":[0.009797824,0.00079138525,0.00086749025,0.0016496534,0.0013719107,0.004405179,0.0017256703,0.0015565257,0.0004153273],"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.00049662404,0.0001713222,0.001605361,0.00015020155,0.00006909261,0.00031516716,0.0003014739,0.5367117,0.0018795753,0.42137268,0.0066669243,0.030259915],"study_design_scores_gemma":[0.000018022705,0.000028118933,0.00017312053,0.000008538562,0.000014534031,0.000054427594,0.00005227969,0.900285,0.00018078298,0.098571666,0.0006037178,0.000009788211],"about_ca_topic_score_codex":0.002369236,"about_ca_topic_score_gemma":0.0027045128,"teacher_disagreement_score":0.006838986,"about_ca_system_score_codex":0.0020815865,"about_ca_system_score_gemma":0.00094480446,"threshold_uncertainty_score":0.022878647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46708825,0.000974828,0.43211424,0.00713708,0.0006138701,0.0013538452,0.0056651635,0.009675722,0.07537707],"genre_scores_gemma":[0.6082127,0.0008005821,0.34078634,0.0015020552,0.00028668853,0.00075810927,0.007455922,0.0028339229,0.037363548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745923,0.00046819545,0.0001424814,0.00059102254,0.000543818,0.0007953275],"domain_scores_gemma":[0.98892945,0.0070250123,0.0006341239,0.0020768659,0.0005269455,0.00080754206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014456111,0.0024156498,0.0024443655,0.0014484099,0.002760984,0.0054708803,0.0038258974,0.002785271,0.03406283],"category_scores_gemma":[0.007956152,0.0015150561,0.0040537934,0.003169037,0.0027564073,0.010196529,0.0055062203,0.0045516393,0.0064319563],"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.0036751498,0.0020177078,0.009107063,0.0030178616,0.0007631553,0.0011113104,0.0027513842,0.19204748,0.058578063,0.3027697,0.08138828,0.34277293],"study_design_scores_gemma":[0.00075594656,0.00022812861,0.002036908,0.00011652393,0.00050476665,0.000579333,0.00070219464,0.18112165,0.018059684,0.77895176,0.01686009,0.000082947445],"about_ca_topic_score_codex":0.0062192352,"about_ca_topic_score_gemma":0.013870385,"teacher_disagreement_score":0.03406283,"about_ca_system_score_codex":0.0034232587,"about_ca_system_score_gemma":0.0034220715,"threshold_uncertainty_score":0.113951504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09763142,0.00030742216,0.8983423,0.0001408929,0.000059734833,0.00008650625,0.00016714365,0.00039766697,0.0028669892],"genre_scores_gemma":[0.43733317,0.00059052743,0.5538583,0.00006372644,0.00004662112,0.00029952612,0.00074450596,0.0004661541,0.006597454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991732,0.00022592943,0.00004598249,0.00014498863,0.00033319747,0.00007671124],"domain_scores_gemma":[0.99737716,0.0018027091,0.00018383325,0.00022966276,0.00027625737,0.00013034276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000978689,0.0012977275,0.0015222433,0.00234676,0.0005548915,0.0014289239,0.002264473,0.001498418,0.0038109964],"category_scores_gemma":[0.00845504,0.0011675985,0.00087349,0.0023186388,0.0012207633,0.0025126871,0.0026849958,0.0017407316,0.000605507],"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.0001928167,0.000074838594,0.0008456463,0.00018160188,0.0000470913,0.00008336914,0.00015516457,0.8583431,0.0030261541,0.064023204,0.0019279383,0.07109897],"study_design_scores_gemma":[0.000012514964,0.000025077868,0.00007640659,0.000011620814,0.000006438797,0.000017489869,0.00002962861,0.95419407,0.00060748524,0.044328142,0.0006868483,0.0000042506417],"about_ca_topic_score_codex":0.0034093799,"about_ca_topic_score_gemma":0.0044176024,"teacher_disagreement_score":0.0038109964,"about_ca_system_score_codex":0.0012226432,"about_ca_system_score_gemma":0.00060371973,"threshold_uncertainty_score":0.012749076},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056647654,0.0019648438,0.9802018,0.00068465364,0.00017005877,0.00008492473,0.00014584835,0.00036533948,0.010717744],"genre_scores_gemma":[0.18433067,0.00363727,0.78646606,0.0005059,0.00069817266,0.0007694121,0.00083037926,0.00060897216,0.022153195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983772,0.00077682117,0.00006408323,0.00025900573,0.000369768,0.00015319115],"domain_scores_gemma":[0.99416006,0.0045294724,0.0003067767,0.00049519277,0.00033436943,0.00017420216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002948772,0.0025352922,0.002958011,0.0021859903,0.0015505139,0.0035377198,0.0032987923,0.0035903412,0.012237585],"category_scores_gemma":[0.012869344,0.0014731074,0.0019353633,0.0043373257,0.0020279228,0.006600272,0.00304707,0.005000092,0.0022826912],"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.00014349511,0.0002767484,0.00069850584,0.00034445513,0.00013274926,0.000041149968,0.00011862539,0.50065935,0.00050160126,0.32469627,0.017374419,0.15501273],"study_design_scores_gemma":[0.000040658935,0.000020714928,0.000097867895,0.000024468512,0.000019106667,0.000020880523,0.000017786018,0.7134418,0.00014837798,0.2830796,0.0030788293,0.000009867551],"about_ca_topic_score_codex":0.0027077186,"about_ca_topic_score_gemma":0.0031970902,"teacher_disagreement_score":0.012237585,"about_ca_system_score_codex":0.0024499996,"about_ca_system_score_gemma":0.0018735541,"threshold_uncertainty_score":0.040938795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21884198,0.008582391,0.6145981,0.015797295,0.0008255163,0.00029274475,0.0012700703,0.0003699113,0.139422],"genre_scores_gemma":[0.73890203,0.013807832,0.17793624,0.0026861255,0.0025190713,0.00066554465,0.003592809,0.00066731405,0.059223015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984761,0.00061162893,0.000058899124,0.00033251598,0.0003405962,0.00018025762],"domain_scores_gemma":[0.9849031,0.012487523,0.00077344634,0.0005523521,0.00054002955,0.0007434185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002012878,0.0014153119,0.0016522463,0.0023712239,0.0021563484,0.00372112,0.0036869384,0.0035115683,0.015734436],"category_scores_gemma":[0.020621369,0.001000779,0.0012454013,0.004922618,0.0040034405,0.013565251,0.004498151,0.006005719,0.0014695947],"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.00010320508,0.00009922561,0.0007409197,0.00028787283,0.000037036272,0.00015392258,0.0004146958,0.026105657,0.00053600816,0.93959457,0.010277748,0.021649228],"study_design_scores_gemma":[0.000028021419,0.000017339511,0.00016462256,0.000041119587,0.000019161194,0.00008611883,0.00010564418,0.02681203,0.00014531604,0.9691591,0.0034137487,0.000007838408],"about_ca_topic_score_codex":0.0012978727,"about_ca_topic_score_gemma":0.0015238465,"teacher_disagreement_score":0.015734436,"about_ca_system_score_codex":0.0018814695,"about_ca_system_score_gemma":0.00081265345,"threshold_uncertainty_score":0.05263692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29062536,0.0019719985,0.58623636,0.0060841725,0.00049919786,0.00073116744,0.0046343827,0.006311352,0.102906026],"genre_scores_gemma":[0.5370952,0.0007905515,0.42866895,0.0007581774,0.00016789482,0.0004050247,0.00599483,0.0011741482,0.02494517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986971,0.00026305686,0.00008319506,0.00035128996,0.00030441297,0.00030090896],"domain_scores_gemma":[0.99542123,0.002950317,0.00019673299,0.00071645575,0.00044183587,0.00027346355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010419318,0.0011850123,0.0014296195,0.0014330919,0.0026497117,0.0056224912,0.0032807542,0.0020287752,0.028715085],"category_scores_gemma":[0.007070203,0.0011283531,0.0017113341,0.0027349659,0.002011903,0.010610315,0.004230856,0.0032957946,0.0034522717],"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.0012403262,0.0007219981,0.002468083,0.0013981144,0.00017511658,0.0003401991,0.0010613778,0.0408654,0.006036394,0.62044305,0.054862145,0.27038777],"study_design_scores_gemma":[0.0002744627,0.00009321832,0.0006777193,0.00015557063,0.00016491124,0.00038097016,0.00071526185,0.14383446,0.0077220183,0.82648957,0.019432753,0.00005913084],"about_ca_topic_score_codex":0.004948277,"about_ca_topic_score_gemma":0.011968019,"teacher_disagreement_score":0.028715085,"about_ca_system_score_codex":0.002716919,"about_ca_system_score_gemma":0.0028875635,"threshold_uncertainty_score":0.09606147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24089034,0.00086926064,0.7328944,0.0018656537,0.00008873131,0.00020064255,0.00015925322,0.00015741738,0.022874232],"genre_scores_gemma":[0.933095,0.0008325582,0.055300757,0.00019691285,0.00009532895,0.0002825937,0.00009522619,0.00004978523,0.010051811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885345,0.0005144851,0.000057579255,0.00015366875,0.0001954075,0.0002253601],"domain_scores_gemma":[0.9956254,0.0030736018,0.00049883913,0.00020483097,0.00029343617,0.00030395927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002852979,0.001131344,0.0015051867,0.0012593223,0.0013350683,0.0036820667,0.0022643306,0.0024567624,0.0030625372],"category_scores_gemma":[0.009684191,0.00077632256,0.0011056424,0.001312202,0.0023951547,0.0058291852,0.0017152154,0.001742856,0.00027424202],"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.000119606004,0.00008677547,0.00047420312,0.00011793914,0.00008144093,0.00011977241,0.0003027023,0.18952002,0.001250143,0.7943216,0.0018425231,0.01176326],"study_design_scores_gemma":[0.00003247549,0.000031409905,0.00010216232,0.000013638149,0.000022415814,0.0000423261,0.000060619863,0.36291173,0.00029864506,0.635686,0.00078214967,0.000016455188],"about_ca_topic_score_codex":0.0020382903,"about_ca_topic_score_gemma":0.0019722804,"teacher_disagreement_score":0.0036820667,"about_ca_system_score_codex":0.0026300773,"about_ca_system_score_gemma":0.0018354382,"threshold_uncertainty_score":0.019082606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032994647,0.0048371176,0.93458587,0.0056852833,0.0005079914,0.00024325696,0.0010640867,0.0007755236,0.019306226],"genre_scores_gemma":[0.3515376,0.0069494145,0.59665895,0.0020270348,0.0022181496,0.0013396752,0.0035662155,0.0014286999,0.034274317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943299,0.002688576,0.00026746368,0.0010832275,0.0011703365,0.0004605673],"domain_scores_gemma":[0.97006637,0.022106769,0.0016562799,0.0029605615,0.0019130943,0.0012969924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052409796,0.003688079,0.005588751,0.004327767,0.004411845,0.006343308,0.011358806,0.0060930643,0.011670692],"category_scores_gemma":[0.042024508,0.0028329175,0.0031555942,0.008181605,0.006020813,0.013656726,0.009207278,0.0072266376,0.0026891772],"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.00064090197,0.00023689766,0.00182818,0.000810895,0.00023705146,0.000119228906,0.0008674849,0.38586256,0.0014271962,0.5011577,0.03203073,0.074781105],"study_design_scores_gemma":[0.00008114052,0.00007816107,0.00045101868,0.000082141225,0.000068678775,0.0001118226,0.00019916044,0.41648576,0.00046250448,0.57594407,0.0059943437,0.000041248368],"about_ca_topic_score_codex":0.0052949563,"about_ca_topic_score_gemma":0.006014082,"teacher_disagreement_score":0.011670692,"about_ca_system_score_codex":0.005754272,"about_ca_system_score_gemma":0.003108704,"threshold_uncertainty_score":0.04175037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008849078,0.00006981676,0.98561513,0.00011820162,0.000050219784,0.000046908433,0.000082724546,0.00097541785,0.0041925083],"genre_scores_gemma":[0.1738504,0.00018678851,0.82033676,0.00010253767,0.00004890136,0.00015348225,0.0003313202,0.0006470863,0.004342725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992011,0.00017315446,0.00003936184,0.00012110492,0.00039043292,0.0000749246],"domain_scores_gemma":[0.9990727,0.0003645763,0.000072202325,0.0002524041,0.00017030002,0.00006784909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062890566,0.0009224276,0.0010815952,0.0016131779,0.000509007,0.0014719225,0.0016074544,0.0010759337,0.008374369],"category_scores_gemma":[0.003462094,0.00076980115,0.0010471342,0.0017060449,0.00090574165,0.0016146678,0.0028244373,0.0016209239,0.0014545122],"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.00034338946,0.0001954122,0.0009984806,0.00027915943,0.000087442924,0.00017518892,0.00025057027,0.2784278,0.013684995,0.1614154,0.014845549,0.5292966],"study_design_scores_gemma":[0.00005129047,0.000046646863,0.00014977947,0.000018253086,0.000023456634,0.00011391643,0.00003932018,0.9102789,0.0059591173,0.07613042,0.007168495,0.000020431164],"about_ca_topic_score_codex":0.0018638932,"about_ca_topic_score_gemma":0.0034856114,"teacher_disagreement_score":0.008374369,"about_ca_system_score_codex":0.00057952356,"about_ca_system_score_gemma":0.00075439597,"threshold_uncertainty_score":0.028015018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84953785,0.0011939084,0.14068468,0.0005306229,0.0002997891,0.000117079224,0.000866435,0.0009781257,0.005791477],"genre_scores_gemma":[0.932066,0.00025159467,0.06413728,0.00005413147,0.000024073095,0.00002792741,0.0014627231,0.00028639345,0.0016898977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935051,0.0014197879,0.00047663093,0.0007915052,0.0035341738,0.00027271546],"domain_scores_gemma":[0.9316059,0.04437937,0.0050121094,0.0097931195,0.008308012,0.00090158405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043076184,0.0009472065,0.000761093,0.0021969613,0.00047567108,0.00200395,0.001962927,0.0023563951,0.0064206664],"category_scores_gemma":[0.056669246,0.00076249446,0.0009440126,0.0016105567,0.0017945401,0.0022104785,0.0017120318,0.00063995493,0.0008993496],"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.007096786,0.0008733601,0.059189696,0.0014322462,0.00056158076,0.0007667709,0.00058061926,0.55485386,0.078644745,0.03010948,0.004538496,0.26135236],"study_design_scores_gemma":[0.00024031085,0.002248348,0.017183099,0.00011393965,0.00016935237,0.00073559873,0.00039144332,0.8777981,0.085156456,0.01250896,0.0033891962,0.00006517656],"about_ca_topic_score_codex":0.0017349331,"about_ca_topic_score_gemma":0.0014108407,"teacher_disagreement_score":0.0064206664,"about_ca_system_score_codex":0.0008778789,"about_ca_system_score_gemma":0.00058308645,"threshold_uncertainty_score":0.022781134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019432671,0.0007506126,0.97381884,0.00075459527,0.00015772997,0.000052496915,0.00007009284,0.0003876726,0.0045751873],"genre_scores_gemma":[0.7767713,0.0011505685,0.21045789,0.00035798835,0.00044818842,0.00020224028,0.00019153146,0.0004147956,0.010005511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991327,0.00030662192,0.000035904235,0.00014781044,0.00022337383,0.0001537403],"domain_scores_gemma":[0.99680835,0.00216856,0.00027204,0.00040805025,0.00021466205,0.00012841474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015538698,0.0008178537,0.0013056694,0.00077699975,0.0009345654,0.0015372487,0.0023768614,0.001431753,0.0032291505],"category_scores_gemma":[0.008549838,0.00066674204,0.0006365336,0.0009441431,0.0016597188,0.002176774,0.0020880685,0.0014833742,0.0006928094],"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.00082726,0.00015137909,0.000759563,0.0004001979,0.000100073805,0.00021444164,0.000379944,0.66693103,0.010008377,0.17436686,0.014577867,0.13128287],"study_design_scores_gemma":[0.00004926685,0.00007237153,0.000111495145,0.000015226453,0.000023194088,0.00008048443,0.00005517073,0.9010367,0.0010112709,0.09585888,0.0016690708,0.000016840313],"about_ca_topic_score_codex":0.0009465799,"about_ca_topic_score_gemma":0.001684111,"teacher_disagreement_score":0.0032291505,"about_ca_system_score_codex":0.0006051594,"about_ca_system_score_gemma":0.0009791291,"threshold_uncertainty_score":0.010802567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.398469,0.0028705173,0.55350894,0.0025988792,0.00023241613,0.00018893964,0.00092126895,0.0011058619,0.040104147],"genre_scores_gemma":[0.83803385,0.001634519,0.14340858,0.00039365844,0.0002916126,0.00026722695,0.0019460542,0.0005875509,0.013437022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779093,0.00064565055,0.00012600777,0.0004996682,0.0005724955,0.0003653082],"domain_scores_gemma":[0.9883929,0.008762493,0.0005790044,0.0014258627,0.00040165428,0.00043805488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019558484,0.0015942545,0.0022748066,0.0017191316,0.0014435236,0.005054094,0.00395829,0.0023115308,0.01194237],"category_scores_gemma":[0.0218774,0.00135523,0.0025329804,0.0034835765,0.0026460008,0.009107812,0.0036384733,0.004384355,0.0008073232],"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.0010386104,0.00044222007,0.0037392222,0.0007373143,0.00023790845,0.0003038124,0.0009657362,0.37713253,0.0028339112,0.4941235,0.011921053,0.10652418],"study_design_scores_gemma":[0.00009205819,0.00005835102,0.00044906588,0.000058203623,0.000085127074,0.00016476477,0.00013516986,0.3776829,0.00123889,0.61683184,0.0031854475,0.000018105544],"about_ca_topic_score_codex":0.004137458,"about_ca_topic_score_gemma":0.0038995484,"teacher_disagreement_score":0.01194237,"about_ca_system_score_codex":0.0028262497,"about_ca_system_score_gemma":0.0014047506,"threshold_uncertainty_score":0.039951146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11494478,0.0029967984,0.85365236,0.004005353,0.00042994323,0.00014277591,0.00024292048,0.0004044634,0.023180576],"genre_scores_gemma":[0.9470937,0.0017722637,0.041039526,0.00035325607,0.0005461539,0.00018688518,0.000231948,0.00023728076,0.008539021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981896,0.0007249856,0.00007797102,0.00032074022,0.00045109147,0.00023554372],"domain_scores_gemma":[0.96489435,0.028904682,0.0017447341,0.0013916763,0.0022575029,0.0008071551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004187492,0.0011109816,0.0013947543,0.0023336967,0.0018903518,0.0029532195,0.0024149339,0.0018127976,0.0073463274],"category_scores_gemma":[0.045046497,0.00071183825,0.0007021098,0.0018286192,0.0037126953,0.0052853683,0.0035294676,0.0030146614,0.0008292138],"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.00091327407,0.000109629465,0.002844873,0.00027808602,0.00011421839,0.00017357543,0.00063533837,0.4451169,0.006056913,0.46879524,0.008722234,0.0662398],"study_design_scores_gemma":[0.000035487268,0.000050671846,0.0002634959,0.000024099867,0.00002069731,0.00004978141,0.00007216138,0.8211773,0.00069566566,0.17633483,0.0012557225,0.000020059468],"about_ca_topic_score_codex":0.0023187646,"about_ca_topic_score_gemma":0.0012959125,"teacher_disagreement_score":0.0073463274,"about_ca_system_score_codex":0.0017638644,"about_ca_system_score_gemma":0.0012567103,"threshold_uncertainty_score":0.024575949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042369585,0.0003599172,0.9161922,0.00092017965,0.00021564512,0.0002672147,0.00089035986,0.015998824,0.022786047],"genre_scores_gemma":[0.23785995,0.00026373094,0.7347919,0.00024208026,0.00014206703,0.00017577033,0.0037642994,0.001235927,0.0215244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832827,0.00025243338,0.000103676524,0.0004963744,0.00058042153,0.00023890681],"domain_scores_gemma":[0.99604565,0.0008904107,0.00014616072,0.0020661259,0.0006606752,0.00019093156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004944567,0.0010943047,0.001272641,0.0015192218,0.0014330735,0.002628538,0.0027570429,0.0017249484,0.032126065],"category_scores_gemma":[0.005092029,0.0007226989,0.0010304477,0.0021263387,0.00091589516,0.0042969063,0.0034952261,0.0016237523,0.0157214],"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.00045833588,0.0003067956,0.001651908,0.00030175902,0.000040672134,0.0002040453,0.00020711648,0.020511387,0.030590672,0.038985778,0.0493814,0.8573601],"study_design_scores_gemma":[0.00018851557,0.00030653802,0.0024582036,0.000055321714,0.000091795446,0.0011000878,0.00076044485,0.68317384,0.08831816,0.15376417,0.069673166,0.00010976401],"about_ca_topic_score_codex":0.0030355933,"about_ca_topic_score_gemma":0.007305419,"teacher_disagreement_score":0.032126065,"about_ca_system_score_codex":0.0007707513,"about_ca_system_score_gemma":0.0017178113,"threshold_uncertainty_score":0.10747242},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021812886,0.0026212502,0.94342345,0.0020371773,0.0004944394,0.00039255657,0.0008931168,0.0049096467,0.023415495],"genre_scores_gemma":[0.15293396,0.0012550562,0.82658696,0.00079128303,0.00053125067,0.0009856658,0.0029615415,0.002248863,0.011705419],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948795,0.0015208694,0.0002490019,0.001220965,0.0013810272,0.0007485742],"domain_scores_gemma":[0.98545164,0.008762059,0.0007048466,0.003967794,0.000733223,0.00038034082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043165605,0.0039944914,0.0038231628,0.0030241653,0.001907723,0.006894243,0.006671759,0.004437863,0.035063565],"category_scores_gemma":[0.028365534,0.0018620357,0.0038644667,0.0072228108,0.0019794626,0.015243179,0.0043040263,0.008355937,0.0076687955],"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.001818924,0.0013066592,0.00137331,0.0011366621,0.00029839398,0.00018502805,0.00046906818,0.26613954,0.0044174735,0.18105698,0.06779418,0.4740038],"study_design_scores_gemma":[0.00058142573,0.000121071,0.0004205346,0.00009680232,0.00013408829,0.0001522207,0.00013378238,0.6659329,0.002152475,0.31685805,0.013370163,0.000046512214],"about_ca_topic_score_codex":0.0068924897,"about_ca_topic_score_gemma":0.010072023,"teacher_disagreement_score":0.035063565,"about_ca_system_score_codex":0.0048319497,"about_ca_system_score_gemma":0.0047706515,"threshold_uncertainty_score":0.11729932},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007867626,0.00040145163,0.9831685,0.0010394707,0.00024380058,0.00011305993,0.0003667966,0.00059552863,0.0062037134],"genre_scores_gemma":[0.14065649,0.001155138,0.843537,0.0015919028,0.00037318835,0.0006716186,0.0014593598,0.0007811357,0.009774259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749786,0.00072146393,0.0003152967,0.00046330894,0.00079644367,0.00020554387],"domain_scores_gemma":[0.99305576,0.0018893479,0.00023640836,0.0035451704,0.0010654897,0.00020788527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026221403,0.0006580856,0.00066986197,0.0017410584,0.0015137079,0.003610938,0.002506654,0.0015547008,0.0060942164],"category_scores_gemma":[0.011038492,0.000630903,0.0011080581,0.002867509,0.0024345939,0.012186698,0.0050693406,0.0049646166,0.0019431489],"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.000099759054,0.00006374516,0.0001631123,0.000103715494,0.000012683014,0.00005782136,0.00019750994,0.0045195497,0.0048926417,0.8998586,0.006242144,0.08378867],"study_design_scores_gemma":[0.00003915937,0.00008888903,0.00009818001,0.00012901136,0.00004118574,0.0003060009,0.0001334442,0.052322812,0.011349904,0.8957929,0.039662648,0.000035860612],"about_ca_topic_score_codex":0.00047602103,"about_ca_topic_score_gemma":0.000978008,"teacher_disagreement_score":0.0060942164,"about_ca_system_score_codex":0.0012586986,"about_ca_system_score_gemma":0.0014271981,"threshold_uncertainty_score":0.020387173},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42266995,0.0050983615,0.47632763,0.009217457,0.00075659493,0.000168064,0.0031960644,0.0017780449,0.08078792],"genre_scores_gemma":[0.9271283,0.0014844204,0.05455784,0.0009209134,0.00066117436,0.00017692703,0.0011292902,0.00091835693,0.013022847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966748,0.0007272545,0.00017214146,0.0009512943,0.0008640232,0.0006105308],"domain_scores_gemma":[0.96424913,0.024492055,0.0017583136,0.0060758567,0.0018793006,0.0015452661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026712485,0.0014384408,0.002205799,0.0026138967,0.002222783,0.006866314,0.0036697062,0.002897325,0.013547161],"category_scores_gemma":[0.03668066,0.0015454266,0.0015261881,0.0026154397,0.0057585617,0.018650662,0.0047204434,0.0047043543,0.0017732396],"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.0004968505,0.000048814592,0.0015883548,0.00025892214,0.000043996257,0.000081652914,0.00044000812,0.011757834,0.00211009,0.9566828,0.007637573,0.018853128],"study_design_scores_gemma":[0.000021355512,0.000012392812,0.00038153317,0.000022158009,0.000025697858,0.0000829556,0.00006478246,0.010482541,0.0011997308,0.9860444,0.0016453037,0.00001710673],"about_ca_topic_score_codex":0.0010065885,"about_ca_topic_score_gemma":0.0012698427,"teacher_disagreement_score":0.013547161,"about_ca_system_score_codex":0.002366284,"about_ca_system_score_gemma":0.0019239482,"threshold_uncertainty_score":0.045319736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04925409,0.00018895666,0.9382392,0.00016609469,0.00006973517,0.00009029162,0.00018448675,0.00037159884,0.011435669],"genre_scores_gemma":[0.59636134,0.00037613377,0.38643205,0.00012543992,0.000049353403,0.00021837362,0.0008569941,0.0004939797,0.015086321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992417,0.00021242327,0.00004647046,0.00011076027,0.00031675768,0.000071900766],"domain_scores_gemma":[0.9980981,0.0011168603,0.000101579186,0.00032895216,0.00021196839,0.00014251734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062582694,0.00063766266,0.0009405535,0.00071411754,0.00050454173,0.001618448,0.0014781936,0.0008718358,0.006328694],"category_scores_gemma":[0.0047276984,0.00086843973,0.0005498097,0.0007635353,0.0011773087,0.0015018279,0.002574376,0.0018322025,0.0012075929],"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.00076335174,0.00014918268,0.0019655295,0.00047971754,0.00006948763,0.0006781432,0.00048049065,0.46800366,0.05710898,0.31832585,0.0066402825,0.14533535],"study_design_scores_gemma":[0.000038043654,0.000073470714,0.00047449043,0.00004094576,0.00001544986,0.00018769351,0.0000790004,0.9025453,0.009407826,0.08038237,0.0067416825,0.000013834247],"about_ca_topic_score_codex":0.00069331337,"about_ca_topic_score_gemma":0.0013167997,"teacher_disagreement_score":0.006328694,"about_ca_system_score_codex":0.00053238985,"about_ca_system_score_gemma":0.00038018016,"threshold_uncertainty_score":0.02117163},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012110289,0.00031881206,0.9846273,0.00024876773,0.000053375115,0.00006999326,0.00009977244,0.00034811665,0.002123575],"genre_scores_gemma":[0.54174954,0.00048563702,0.4487668,0.00033733383,0.00010147568,0.00024792372,0.00041809469,0.000086780936,0.00780645],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992673,0.00019143296,0.00005997178,0.00015028955,0.00025420435,0.00007689374],"domain_scores_gemma":[0.99924797,0.00028934743,0.000059099504,0.00014014977,0.00022885752,0.000034629113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904376,0.00064371474,0.00073326606,0.00059040025,0.0004290203,0.0011250768,0.00094400055,0.0008281593,0.0058315145],"category_scores_gemma":[0.0022375644,0.0003794504,0.00028101224,0.000639629,0.0005410797,0.001972976,0.0010657056,0.0006709203,0.00081326393],"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.0011194132,0.0002019845,0.0008568093,0.0005130921,0.00009353462,0.00016618881,0.00016401989,0.15920368,0.054639883,0.17430563,0.008067342,0.6006684],"study_design_scores_gemma":[0.0001601464,0.00028433622,0.00034238052,0.00003715883,0.000043584834,0.0002272424,0.000048749007,0.90264,0.030377114,0.060975466,0.004815982,0.000047860678],"about_ca_topic_score_codex":0.00072370726,"about_ca_topic_score_gemma":0.0013825143,"teacher_disagreement_score":0.0058315145,"about_ca_system_score_codex":0.0005575404,"about_ca_system_score_gemma":0.0012898067,"threshold_uncertainty_score":0.019508362},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05119004,0.0008800273,0.93406844,0.0009744249,0.00020271403,0.00006768255,0.00007199598,0.00016166858,0.012382936],"genre_scores_gemma":[0.92681855,0.0007725339,0.059665103,0.00014477037,0.00017138082,0.00013178651,0.000072172974,0.00007815803,0.012145537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993661,0.00024581456,0.000024326313,0.00010673081,0.0001584317,0.000098654906],"domain_scores_gemma":[0.996566,0.0027187387,0.00018842761,0.00018518408,0.00022130537,0.0001203439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014042411,0.00081712106,0.0012523774,0.0007519252,0.0008067345,0.0017303753,0.0013018406,0.0017004042,0.0029940212],"category_scores_gemma":[0.010030389,0.0006439952,0.0006604311,0.0009660711,0.001440377,0.0022062631,0.0017355268,0.00166051,0.0003414485],"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.0003219058,0.000054504108,0.00043683048,0.00011073978,0.000046235557,0.00009513084,0.00016980415,0.8351079,0.001615243,0.13559268,0.002297793,0.024151241],"study_design_scores_gemma":[0.000037280086,0.00003412736,0.00006357251,0.000009179572,0.000012148518,0.00002477201,0.000034484692,0.93977225,0.00045107788,0.05879648,0.00075809984,0.000006507888],"about_ca_topic_score_codex":0.002529797,"about_ca_topic_score_gemma":0.0023982648,"teacher_disagreement_score":0.0029940212,"about_ca_system_score_codex":0.0009894571,"about_ca_system_score_gemma":0.0008565391,"threshold_uncertainty_score":0.010016024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21507809,0.0020482405,0.7676528,0.001683449,0.0002271213,0.00016008306,0.00012618728,0.00024116557,0.012782918],"genre_scores_gemma":[0.952965,0.0010580979,0.039480355,0.00012370327,0.00013515328,0.00012649826,0.000117532116,0.000040334602,0.0059531974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.00023693703,0.000031474952,0.00010467794,0.000120013974,0.00009296276],"domain_scores_gemma":[0.9955642,0.0034136283,0.0003783789,0.00020365867,0.000251459,0.0001887138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011278866,0.00035655926,0.0006082156,0.00079280045,0.0011928901,0.0016783001,0.0012366557,0.0010458471,0.0025032228],"category_scores_gemma":[0.0072757816,0.00043595626,0.00028525645,0.00097352004,0.0013571752,0.0026964045,0.0014840305,0.0008745977,0.00026689284],"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.0005186582,0.00020036829,0.0055937464,0.00043204287,0.00008452452,0.0010617976,0.0010914003,0.611557,0.0058365297,0.27478647,0.00684199,0.09199547],"study_design_scores_gemma":[0.000047017627,0.00012788373,0.0006976128,0.000028492675,0.000039651455,0.00038559892,0.00038887814,0.8481152,0.00090233394,0.14592436,0.0033243306,0.00001857824],"about_ca_topic_score_codex":0.0007069262,"about_ca_topic_score_gemma":0.0009851796,"teacher_disagreement_score":0.0025032228,"about_ca_system_score_codex":0.0004931051,"about_ca_system_score_gemma":0.00046025083,"threshold_uncertainty_score":0.008374095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0961753,0.014939185,0.84567475,0.008548381,0.00091015577,0.0001073828,0.00072534813,0.00035090197,0.03256859],"genre_scores_gemma":[0.75218457,0.016870521,0.1849668,0.0016096421,0.0027657233,0.00051558943,0.0009060162,0.00025088314,0.03993024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868935,0.00051352323,0.00004893799,0.00020328889,0.00040155736,0.00014333228],"domain_scores_gemma":[0.9929972,0.0048795245,0.0006725477,0.00060980616,0.0006804294,0.00016041519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013671442,0.0011669568,0.0009087676,0.0023105864,0.0010189479,0.0021561545,0.0010803662,0.0021662298,0.0035083948],"category_scores_gemma":[0.011906738,0.00065757905,0.0007457181,0.00217822,0.0027262997,0.0031023384,0.0015105221,0.0036650698,0.0008275636],"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.00003555914,0.000016700695,0.00018365118,0.00007448411,0.000014414815,0.000053929944,0.000119719356,0.027374323,0.0006548781,0.95862037,0.0019486876,0.010903244],"study_design_scores_gemma":[0.000018731,0.000016759326,0.00015802859,0.00004270829,0.000010875516,0.00007819745,0.000024707479,0.0832642,0.00041752047,0.912318,0.003624303,0.000025984644],"about_ca_topic_score_codex":0.0019187607,"about_ca_topic_score_gemma":0.002073203,"teacher_disagreement_score":0.0035083948,"about_ca_system_score_codex":0.0014428708,"about_ca_system_score_gemma":0.0015771171,"threshold_uncertainty_score":0.011736751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51762545,0.00409572,0.3218014,0.018558597,0.00082788075,0.00022365159,0.0030983416,0.0020646895,0.13170417],"genre_scores_gemma":[0.92377746,0.0022286528,0.03615443,0.0013010692,0.0012666888,0.00024234618,0.003033223,0.00064155326,0.031354543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991204,0.0001562086,0.00004010594,0.000318527,0.00021719332,0.00014744594],"domain_scores_gemma":[0.9909004,0.006771348,0.00044757538,0.00070142053,0.00034416726,0.0008350247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011033766,0.0010818085,0.0015448468,0.0020985275,0.0031986085,0.006087955,0.002484242,0.0018899082,0.015211477],"category_scores_gemma":[0.0093322,0.0011121194,0.001136484,0.0030792214,0.004318592,0.01765278,0.0034954704,0.008151876,0.0013098508],"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.00023158765,0.00010985373,0.0025148636,0.00021594165,0.000021444426,0.00015329404,0.00057745626,0.00234765,0.00075189193,0.95426035,0.013715208,0.02510029],"study_design_scores_gemma":[0.0000348353,0.000012419581,0.00055861665,0.00001752454,0.000016314321,0.00019824803,0.00010808719,0.0055507612,0.00031325853,0.9898267,0.0033541124,0.00000917614],"about_ca_topic_score_codex":0.0009289764,"about_ca_topic_score_gemma":0.0014099516,"teacher_disagreement_score":0.015211477,"about_ca_system_score_codex":0.0016900025,"about_ca_system_score_gemma":0.0011433178,"threshold_uncertainty_score":0.050887406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3262554,0.0025454958,0.5613184,0.016768347,0.001603666,0.00026942056,0.0007424468,0.0011513093,0.08934556],"genre_scores_gemma":[0.9572437,0.00067562493,0.02347279,0.00081331364,0.0006133821,0.00013248288,0.00023265865,0.00027627157,0.01653982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791557,0.0005764049,0.000082358834,0.0006461406,0.0004437244,0.00033586886],"domain_scores_gemma":[0.9811998,0.009515369,0.0017988455,0.0036409777,0.0024394137,0.001405653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029722885,0.0006729198,0.0011868271,0.0015705363,0.0029278884,0.0045036846,0.002147932,0.0021132445,0.0089396825],"category_scores_gemma":[0.03222627,0.00063257565,0.0006477303,0.0011562384,0.0027945812,0.012168061,0.004543508,0.0033839683,0.0015775289],"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.0009344676,0.00016734247,0.004081849,0.0002553007,0.00015785133,0.00039456045,0.00051042484,0.058032386,0.0071111703,0.8441613,0.015570388,0.06862295],"study_design_scores_gemma":[0.00007921834,0.00016534314,0.0010290836,0.00004844516,0.00009410462,0.00054882263,0.00031974234,0.22327548,0.003612725,0.7638915,0.0068939617,0.00004148918],"about_ca_topic_score_codex":0.00048141126,"about_ca_topic_score_gemma":0.0006567373,"teacher_disagreement_score":0.0089396825,"about_ca_system_score_codex":0.001361035,"about_ca_system_score_gemma":0.0014208258,"threshold_uncertainty_score":0.029906213},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017897235,0.0013768164,0.96894395,0.0013632487,0.0002461319,0.00016057144,0.00038069507,0.0007755502,0.008855871],"genre_scores_gemma":[0.22613811,0.0008939219,0.75832874,0.00070663274,0.00042900475,0.0005590149,0.0012094129,0.0005649235,0.011170328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712425,0.0012640468,0.00010977532,0.0004584199,0.00052742026,0.0005159923],"domain_scores_gemma":[0.99239904,0.005226887,0.00045510638,0.0009245954,0.00058584457,0.00040860378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046146223,0.0023197334,0.0028910006,0.0015816883,0.0010548512,0.0031761245,0.006029054,0.0030216388,0.01291156],"category_scores_gemma":[0.014037574,0.0012909952,0.0018782279,0.0032418328,0.001589835,0.005165185,0.0033242584,0.006338432,0.0018965255],"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.000506805,0.00075365836,0.001158261,0.00039695983,0.00012020938,0.0001081499,0.0001729002,0.75061584,0.0009862185,0.09188984,0.023125438,0.13016573],"study_design_scores_gemma":[0.00006843842,0.000041785206,0.00011856819,0.000021917604,0.000018381399,0.000028750643,0.000027665548,0.9626446,0.00019089192,0.03545001,0.0013794814,0.000009581961],"about_ca_topic_score_codex":0.008996436,"about_ca_topic_score_gemma":0.014690108,"teacher_disagreement_score":0.01291156,"about_ca_system_score_codex":0.0038400677,"about_ca_system_score_gemma":0.004118886,"threshold_uncertainty_score":0.04319346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7379958,0.0014072744,0.20817284,0.012186713,0.00036556265,0.00059380376,0.0059828865,0.0029608682,0.03033427],"genre_scores_gemma":[0.8634877,0.0009091246,0.11536207,0.0007470151,0.0006013671,0.00036380056,0.007250994,0.00090021675,0.010377664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594504,0.0009907114,0.00024644934,0.0010442904,0.0010913468,0.0006821175],"domain_scores_gemma":[0.9514175,0.04214189,0.0015426107,0.0026944177,0.0010795107,0.0011240535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020687713,0.0014828227,0.0027456696,0.0017658544,0.0021839733,0.007308778,0.004469884,0.004021594,0.02558992],"category_scores_gemma":[0.029776799,0.0012031083,0.002644198,0.0031149285,0.00324774,0.012333277,0.004331609,0.0043525966,0.0023808945],"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.006056318,0.0015951473,0.020557256,0.0032442694,0.0007126484,0.0015039389,0.00233379,0.43613753,0.020115985,0.2190507,0.06203205,0.22666042],"study_design_scores_gemma":[0.0008592776,0.00023938567,0.0023306387,0.000081695354,0.00028322852,0.0006270587,0.00083768513,0.37531188,0.005118792,0.6114576,0.0027766114,0.000076115546],"about_ca_topic_score_codex":0.0043902663,"about_ca_topic_score_gemma":0.00547319,"teacher_disagreement_score":0.02558992,"about_ca_system_score_codex":0.0027108546,"about_ca_system_score_gemma":0.003919782,"threshold_uncertainty_score":0.08560681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038568728,0.0010246478,0.9211597,0.0010984751,0.00029084994,0.00010496301,0.00040847546,0.0007136344,0.036630504],"genre_scores_gemma":[0.4915247,0.0018536779,0.4585017,0.00040391803,0.00022171669,0.0002311962,0.0011886675,0.00047458924,0.045599874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957436,0.0001291361,0.000024962985,0.00009713443,0.00012519081,0.000049190883],"domain_scores_gemma":[0.998798,0.00039368242,0.00012865844,0.00030959776,0.00026257712,0.00010748041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080484827,0.00044858982,0.0004809384,0.0017194729,0.0010064581,0.0015386137,0.001113819,0.00088513206,0.014374516],"category_scores_gemma":[0.0048080226,0.00042299976,0.0004840391,0.0014587875,0.0021001305,0.0029552432,0.0018230017,0.001449034,0.0017860016],"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.00006852728,0.000032281092,0.001004376,0.0001069092,0.000012653915,0.00008382521,0.00014518367,0.06262108,0.0009672881,0.8385657,0.007269521,0.08912258],"study_design_scores_gemma":[0.000031196134,0.000054273114,0.00032786268,0.00006409418,0.000014104298,0.00019967496,0.00016584243,0.22575705,0.0014631224,0.7345563,0.03734774,0.000018719582],"about_ca_topic_score_codex":0.0013334875,"about_ca_topic_score_gemma":0.002690392,"teacher_disagreement_score":0.014374516,"about_ca_system_score_codex":0.00059691735,"about_ca_system_score_gemma":0.00051043084,"threshold_uncertainty_score":0.048087597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056275795,0.00021415003,0.9895076,0.00016331108,0.0001633843,0.00012370554,0.00014651487,0.0016631769,0.0023905912],"genre_scores_gemma":[0.052433565,0.00011846697,0.94015074,0.00014994592,0.000107277876,0.00028667218,0.000473399,0.00035116286,0.0059287855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980096,0.00048270548,0.00012182611,0.00047386732,0.0006624041,0.00024960696],"domain_scores_gemma":[0.99727005,0.0008524413,0.0001443742,0.0008202172,0.0007237156,0.0001891744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017467221,0.0014260522,0.0027665657,0.0022175193,0.0017710289,0.0021002258,0.0051246407,0.0028923564,0.012941349],"category_scores_gemma":[0.0071146544,0.0009013432,0.0014739844,0.0042799762,0.001016169,0.0033453226,0.003858876,0.0025103455,0.0049400846],"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.000722962,0.0003846549,0.0007723488,0.00025572837,0.00012875223,0.00010287309,0.00018885202,0.2449895,0.005685458,0.042136073,0.023739545,0.68089324],"study_design_scores_gemma":[0.00009112934,0.000056399076,0.00018210673,0.000011834501,0.000027842354,0.00007438356,0.000027852604,0.9760971,0.0019864454,0.017130805,0.0042928713,0.000021175672],"about_ca_topic_score_codex":0.007803629,"about_ca_topic_score_gemma":0.011125102,"teacher_disagreement_score":0.012941349,"about_ca_system_score_codex":0.0020400973,"about_ca_system_score_gemma":0.0033031711,"threshold_uncertainty_score":0.043293178},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033916175,0.00041996894,0.9538908,0.00025866058,0.00015455585,0.0002853974,0.00043372312,0.0064400365,0.004200709],"genre_scores_gemma":[0.13917768,0.00013529266,0.85574466,0.00009755319,0.000047560814,0.00029669688,0.0015308103,0.0004827108,0.002487032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986602,0.00038793997,0.000092882816,0.00036150968,0.00041480878,0.00008271416],"domain_scores_gemma":[0.9966336,0.0016589027,0.00016717805,0.0010204931,0.0003998394,0.00012003684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017842072,0.0010724931,0.0016959017,0.0026860328,0.0012401065,0.0014322305,0.0023852228,0.0015973472,0.012714391],"category_scores_gemma":[0.009880485,0.0009979982,0.0012297543,0.0024782384,0.00089500233,0.0028472466,0.002414602,0.0015107603,0.0049593924],"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.0018643986,0.000579434,0.0027947077,0.00071324705,0.00019391494,0.00052420486,0.00031931297,0.07227535,0.036986094,0.11508272,0.026705926,0.7419607],"study_design_scores_gemma":[0.0003802581,0.00025904435,0.00048060052,0.000046956884,0.00007937252,0.0003935542,0.00008565862,0.8244965,0.014392725,0.14721683,0.012129267,0.00003924495],"about_ca_topic_score_codex":0.00094070134,"about_ca_topic_score_gemma":0.003045936,"teacher_disagreement_score":0.012714391,"about_ca_system_score_codex":0.0006963136,"about_ca_system_score_gemma":0.0019111388,"threshold_uncertainty_score":0.042533875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030443903,0.00047440344,0.9546358,0.0012923224,0.00015920102,0.00015101337,0.0042890245,0.002243592,0.006310683],"genre_scores_gemma":[0.3519621,0.0010061642,0.61894244,0.0005949203,0.00021416497,0.000555538,0.01581758,0.00095051446,0.009956549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832946,0.0004912372,0.00013211444,0.0003072403,0.00058430154,0.0001556825],"domain_scores_gemma":[0.9935703,0.0025380403,0.0004241604,0.0023061896,0.0009895121,0.00017178735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009174896,0.00084574777,0.0008351806,0.0021633427,0.00067933253,0.003027321,0.002203135,0.0013291371,0.00719884],"category_scores_gemma":[0.008896463,0.0005628738,0.00069407857,0.0037753596,0.0009555471,0.005685325,0.0021497398,0.002406841,0.0020351335],"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.00074529875,0.00030604852,0.0010468891,0.0005134646,0.000058832076,0.00032661695,0.000558023,0.1653117,0.007968898,0.43761554,0.030566653,0.35498202],"study_design_scores_gemma":[0.00005455062,0.00004742813,0.00018123846,0.00009057124,0.000030926803,0.00014574507,0.00011039261,0.34831604,0.005570803,0.6343234,0.011106285,0.000022651167],"about_ca_topic_score_codex":0.0017460895,"about_ca_topic_score_gemma":0.003382682,"teacher_disagreement_score":0.00719884,"about_ca_system_score_codex":0.001280068,"about_ca_system_score_gemma":0.0015253912,"threshold_uncertainty_score":0.024082541},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16417234,0.001513353,0.797798,0.007236309,0.00025809312,0.00028886402,0.0045722323,0.0022634957,0.021897342],"genre_scores_gemma":[0.7030592,0.0017985769,0.27126864,0.0010529722,0.0004243654,0.000571495,0.008160308,0.00058395334,0.013080465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875045,0.0002731334,0.00009062946,0.000437009,0.00024223766,0.00020651685],"domain_scores_gemma":[0.98958606,0.008588923,0.0005553809,0.0008253587,0.00024429476,0.00019997907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080801005,0.0011107662,0.0025518602,0.000536959,0.0010763637,0.0033755105,0.0018201293,0.0026060839,0.0060399515],"category_scores_gemma":[0.008133937,0.0009704142,0.001671654,0.0019964525,0.0019354904,0.0065677273,0.0023836133,0.003158842,0.0011099185],"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.0013274204,0.00036850077,0.005110241,0.0018704691,0.00032421327,0.0017105056,0.00074749225,0.51815146,0.010303359,0.25135106,0.047622554,0.16111268],"study_design_scores_gemma":[0.0001175107,0.000100326826,0.0008926355,0.00006327389,0.000058859187,0.0011051544,0.00036552153,0.60259604,0.0050982395,0.38251096,0.0070514055,0.00004016712],"about_ca_topic_score_codex":0.0021161847,"about_ca_topic_score_gemma":0.0025095828,"teacher_disagreement_score":0.0060399515,"about_ca_system_score_codex":0.0012113404,"about_ca_system_score_gemma":0.0010755515,"threshold_uncertainty_score":0.020205617},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7577163,0.0042508948,0.20453222,0.010916119,0.00032766085,0.00022417675,0.0009207169,0.0032404074,0.017871454],"genre_scores_gemma":[0.92575926,0.0010097644,0.06756003,0.0005230172,0.0003397708,0.00014492423,0.00031540336,0.0009154887,0.003432359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935796,0.00280318,0.00047135647,0.0008504389,0.001112309,0.0011830715],"domain_scores_gemma":[0.72379863,0.255785,0.0052043144,0.007801864,0.0033178735,0.004092384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009573509,0.0011822128,0.0025081555,0.0016993952,0.0014474487,0.0033999684,0.0036238765,0.004191154,0.00823271],"category_scores_gemma":[0.098550424,0.0016999299,0.0009360237,0.0021609694,0.0026973458,0.011219681,0.0022347185,0.0030828023,0.0010280306],"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.0069222953,0.0014583571,0.012045057,0.0012412465,0.00028139522,0.00034094445,0.0014709315,0.61028725,0.044490118,0.0692685,0.014178177,0.23801579],"study_design_scores_gemma":[0.00077940774,0.0008280287,0.0026728993,0.00009139863,0.000318531,0.0004000608,0.0003927536,0.87848365,0.010801369,0.103685014,0.001471562,0.00007533139],"about_ca_topic_score_codex":0.0021061993,"about_ca_topic_score_gemma":0.0064436686,"teacher_disagreement_score":0.009573509,"about_ca_system_score_codex":0.0022751486,"about_ca_system_score_gemma":0.0032080102,"threshold_uncertainty_score":0.050630152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1982476,0.0017528376,0.77759236,0.0024104586,0.0002849547,0.00008231862,0.0002622804,0.00029048393,0.019076794],"genre_scores_gemma":[0.90445954,0.0018608075,0.07324146,0.0002589579,0.00038303592,0.00017150205,0.00032983316,0.00010359823,0.019191254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907315,0.0003788202,0.000025835841,0.00017907821,0.000181662,0.00016146555],"domain_scores_gemma":[0.99563193,0.0029544134,0.00045798798,0.000337533,0.00036983582,0.00024834968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010084257,0.0006314026,0.0009515565,0.0015752022,0.0015837883,0.0024632518,0.0016110705,0.0013798618,0.004376681],"category_scores_gemma":[0.010031061,0.000684671,0.00045508982,0.0026962312,0.0017918446,0.003265976,0.0013013515,0.0012260777,0.00054251944],"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.0001993477,0.00011907336,0.0017600151,0.00016683938,0.00005825974,0.000109318935,0.00026699837,0.41469818,0.0012572954,0.49471813,0.008009222,0.07863725],"study_design_scores_gemma":[0.000034741093,0.000028336957,0.00040433303,0.000019409066,0.000027682778,0.00006495419,0.00012153665,0.43145093,0.00030346905,0.5647573,0.0027715706,0.000015790916],"about_ca_topic_score_codex":0.0038667012,"about_ca_topic_score_gemma":0.004129993,"teacher_disagreement_score":0.004376681,"about_ca_system_score_codex":0.0016732344,"about_ca_system_score_gemma":0.0015506254,"threshold_uncertainty_score":0.014641464},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010013591,0.0000820321,0.9868622,0.00019638114,0.00001880433,0.00008143091,0.00009431146,0.00009944152,0.00255181],"genre_scores_gemma":[0.76796144,0.00040608027,0.22067147,0.000223994,0.00010448417,0.00054058956,0.00030943617,0.0001293999,0.00965313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971675,0.0013912187,0.000104398445,0.00060602825,0.00040201156,0.00032889063],"domain_scores_gemma":[0.9896924,0.0075206417,0.00081695995,0.0008096798,0.0007738351,0.00038645678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005138453,0.0020275377,0.0018742131,0.00089813315,0.00060736056,0.002082163,0.0040330985,0.003019462,0.0067234924],"category_scores_gemma":[0.0151800355,0.0016640519,0.0014231259,0.00091366866,0.0015009887,0.004653294,0.0034552028,0.0022752155,0.0008016851],"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.00023843719,0.00005338234,0.00020171258,0.00011366629,0.00005444674,0.000096790696,0.00004252952,0.9273937,0.0014173891,0.059038326,0.0009292523,0.0104203895],"study_design_scores_gemma":[0.00003141895,0.000056003664,0.000048010406,0.0000080607015,0.000017269642,0.00002766701,0.0000073677406,0.96826136,0.000535269,0.030677719,0.00031915723,0.000010688129],"about_ca_topic_score_codex":0.0013178926,"about_ca_topic_score_gemma":0.0012535261,"teacher_disagreement_score":0.0067234924,"about_ca_system_score_codex":0.0017960944,"about_ca_system_score_gemma":0.0012797895,"threshold_uncertainty_score":0.027175069},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035955107,0.0004210049,0.99139905,0.00056093495,0.00010068478,0.00006953417,0.0004807942,0.0011849575,0.0021875475],"genre_scores_gemma":[0.099382214,0.0010022359,0.89007396,0.00059612066,0.00036683396,0.00043372755,0.0018882914,0.00065593544,0.0056006736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952028,0.0012699037,0.00048925035,0.00078515976,0.0018422191,0.00041064032],"domain_scores_gemma":[0.98792434,0.0061324,0.00059166,0.0037080771,0.0012452804,0.00039820594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037239918,0.0010289478,0.0017300121,0.003548811,0.0020649668,0.005336299,0.0045939772,0.002338045,0.009141773],"category_scores_gemma":[0.01963612,0.001130983,0.001830744,0.007012367,0.0028860483,0.013849971,0.0068907146,0.005758717,0.002813636],"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.00016200551,0.00011153851,0.0003448703,0.00022646693,0.000030547533,0.0001612833,0.00040378753,0.04802998,0.002757809,0.8126411,0.009315077,0.12581551],"study_design_scores_gemma":[0.000031039806,0.000041678617,0.00006190187,0.00007826518,0.000022314423,0.0001444126,0.00009456712,0.15975358,0.0021528355,0.82440615,0.013180871,0.000032412536],"about_ca_topic_score_codex":0.0023411813,"about_ca_topic_score_gemma":0.0046356022,"teacher_disagreement_score":0.009141773,"about_ca_system_score_codex":0.002604447,"about_ca_system_score_gemma":0.003137479,"threshold_uncertainty_score":0.03058225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26017058,0.0153256785,0.48269483,0.02935768,0.0016613676,0.0005902411,0.004949678,0.0045194346,0.20073047],"genre_scores_gemma":[0.90305066,0.0052559813,0.049579676,0.0043312768,0.001983391,0.0008784049,0.0034688865,0.0015396496,0.029912042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904924,0.0021727954,0.00042729665,0.001746722,0.0028664013,0.0022943271],"domain_scores_gemma":[0.9212164,0.06217537,0.0028724454,0.007213401,0.0031375194,0.0033847566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005445,0.0041270857,0.0040321522,0.0052235685,0.004593238,0.0124893235,0.009291615,0.0050099613,0.026314614],"category_scores_gemma":[0.054430034,0.0021165623,0.0030570112,0.0071303993,0.006263405,0.02668386,0.011698847,0.011286786,0.0042681005],"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.0028467162,0.0004998814,0.0033052578,0.0012873885,0.00027478707,0.00024106246,0.000837559,0.069021046,0.007038763,0.82145846,0.031066256,0.062122736],"study_design_scores_gemma":[0.00016208737,0.00011205846,0.00050768297,0.00015181198,0.00019750981,0.00016029773,0.0001284743,0.10481036,0.00390982,0.8848735,0.0049387887,0.00004754225],"about_ca_topic_score_codex":0.0020630725,"about_ca_topic_score_gemma":0.0034096988,"teacher_disagreement_score":0.026314614,"about_ca_system_score_codex":0.007934908,"about_ca_system_score_gemma":0.0033912656,"threshold_uncertainty_score":0.08803117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07749564,0.0017405002,0.90417135,0.0016462837,0.00028303746,0.0002179492,0.0021299173,0.0034579353,0.008857314],"genre_scores_gemma":[0.38491523,0.0013658566,0.59293467,0.0006854663,0.0002545057,0.00049711205,0.0060226563,0.0013859997,0.011938463],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980122,0.00030228827,0.00027331227,0.00022378523,0.00095719687,0.00023122122],"domain_scores_gemma":[0.9932388,0.0025541973,0.00056945556,0.0026349921,0.0007966627,0.00020593221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011532722,0.00094630447,0.0009284649,0.0018493896,0.0010504118,0.0032034575,0.0020610502,0.0012756955,0.005980968],"category_scores_gemma":[0.010420894,0.00080565317,0.00097380765,0.0051070163,0.0017054887,0.00724615,0.002793347,0.00272424,0.0019473687],"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.0013393363,0.00057188544,0.00377946,0.00089932815,0.000082714505,0.00033124856,0.0011244346,0.086146764,0.025939897,0.30287927,0.042374432,0.53453124],"study_design_scores_gemma":[0.00026790166,0.00032226995,0.001042493,0.00028504946,0.0001297249,0.00048496822,0.0005020568,0.3631288,0.04252267,0.56644684,0.024770582,0.00009665485],"about_ca_topic_score_codex":0.0016829545,"about_ca_topic_score_gemma":0.003657682,"teacher_disagreement_score":0.005980968,"about_ca_system_score_codex":0.0015802446,"about_ca_system_score_gemma":0.0021097981,"threshold_uncertainty_score":0.020008326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11709367,0.0005228548,0.856846,0.0004332048,0.000082170394,0.0001044404,0.0004192305,0.0004892683,0.024009172],"genre_scores_gemma":[0.66927373,0.00092124305,0.3112387,0.0001339526,0.00009412652,0.00030184496,0.0013641629,0.0004242908,0.01624794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.000092470436,0.000017334249,0.000112662856,0.00013571045,0.000059015827],"domain_scores_gemma":[0.99868375,0.000661989,0.00017236527,0.00019947106,0.00017480685,0.000107671854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045411306,0.0003842886,0.00048998016,0.0013337535,0.0009696886,0.0013675101,0.0012200653,0.00069447357,0.009021955],"category_scores_gemma":[0.0038680495,0.0005753576,0.0004843158,0.0013941275,0.00094230846,0.002076546,0.001854013,0.0010269026,0.0007583076],"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.0003249637,0.00008517786,0.0020999594,0.00022466463,0.000029901266,0.0003835587,0.0004585208,0.21798587,0.008025736,0.6406354,0.009172704,0.12057362],"study_design_scores_gemma":[0.00007687382,0.00006880195,0.00084782584,0.000054516742,0.000027024575,0.0004230682,0.00023409922,0.6194489,0.0036154224,0.3581577,0.017020436,0.00002537649],"about_ca_topic_score_codex":0.0018037922,"about_ca_topic_score_gemma":0.002039238,"teacher_disagreement_score":0.009021955,"about_ca_system_score_codex":0.000594578,"about_ca_system_score_gemma":0.00035064114,"threshold_uncertainty_score":0.030181468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23621629,0.0007751662,0.74972695,0.0015164857,0.00021806343,0.00015514165,0.0008182473,0.0016497719,0.0089239],"genre_scores_gemma":[0.48738357,0.00030867272,0.50776714,0.00013226474,0.000073259165,0.0001329139,0.0011714414,0.00024843053,0.0027823313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990878,0.00019043579,0.00006788268,0.0002688096,0.0002707588,0.00011436716],"domain_scores_gemma":[0.99757856,0.0013633388,0.00020236838,0.00039659627,0.00031249318,0.00014657089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112822,0.0009615064,0.001490962,0.0011455297,0.0008873689,0.0015205649,0.0022601269,0.0021471924,0.005309641],"category_scores_gemma":[0.011194201,0.00060982053,0.00079123554,0.0017830839,0.00074174406,0.0036341855,0.0017587127,0.0010669931,0.001129791],"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.0010895082,0.0003246344,0.004173462,0.00061700033,0.00013583811,0.0002534097,0.00033619578,0.649925,0.017265314,0.039584134,0.01290547,0.27339],"study_design_scores_gemma":[0.00005431527,0.000098637145,0.00050682976,0.000018318517,0.000033066444,0.00015180277,0.00011470155,0.9701176,0.003592579,0.02391146,0.001391913,0.0000087032895],"about_ca_topic_score_codex":0.0014512995,"about_ca_topic_score_gemma":0.0026418779,"teacher_disagreement_score":0.005309641,"about_ca_system_score_codex":0.0011349455,"about_ca_system_score_gemma":0.0011240552,"threshold_uncertainty_score":0.017762542},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04647278,0.0016454388,0.124704145,0.024909338,0.0056537297,0.00024183514,0.0023662301,0.0012520239,0.7927546],"genre_scores_gemma":[0.39545044,0.0010447896,0.024448011,0.0016543756,0.0017564108,0.00018456446,0.0011585768,0.00031968547,0.5739832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855286,0.00061501766,0.000037622267,0.0003067252,0.00027289632,0.00021487927],"domain_scores_gemma":[0.99775714,0.0006060828,0.00021331896,0.00049775117,0.00037076543,0.00055501633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156798,0.00051784597,0.00046156716,0.0008538532,0.0032930374,0.0030721186,0.0011227995,0.002075016,0.09204441],"category_scores_gemma":[0.007466613,0.00022421981,0.00041023936,0.0011153186,0.0007924273,0.004601624,0.0027696153,0.0018074817,0.020364307],"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.00030736648,0.000099454584,0.0015249267,0.00015908341,0.00004396308,0.00045335243,0.00068098336,0.0057958206,0.0011816263,0.5819921,0.2773355,0.1304259],"study_design_scores_gemma":[0.000034576904,0.000045428642,0.0010822036,0.00004937529,0.00003175077,0.00035988342,0.00086697,0.01437907,0.00096244924,0.35109058,0.6310663,0.000031441734],"about_ca_topic_score_codex":0.0018765061,"about_ca_topic_score_gemma":0.0035347205,"teacher_disagreement_score":0.09204441,"about_ca_system_score_codex":0.0012166707,"about_ca_system_score_gemma":0.001209763,"threshold_uncertainty_score":0.30791926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5555491,0.008517614,0.33088267,0.009053909,0.00058523205,0.000111102425,0.0009102374,0.0017269623,0.09266321],"genre_scores_gemma":[0.9500619,0.003548023,0.028145012,0.00066850707,0.0014486897,0.00031421107,0.00089934084,0.0005750407,0.01433928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975594,0.0007862786,0.00009473731,0.0004436936,0.00083723344,0.0002786256],"domain_scores_gemma":[0.95073247,0.03984403,0.0019320302,0.002391145,0.0024411785,0.0026592307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037956815,0.0013322282,0.0020380954,0.006526991,0.0027124097,0.008014393,0.004549695,0.0026991025,0.010485652],"category_scores_gemma":[0.059023954,0.0015471051,0.0010356727,0.004918992,0.007213987,0.01433897,0.0045902105,0.005147912,0.0009919967],"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.000089187226,0.000051808907,0.0018457285,0.00016162818,0.000023655868,0.000053794294,0.00041601132,0.0073239123,0.00065459096,0.97513187,0.0031261016,0.011121649],"study_design_scores_gemma":[0.000016577611,0.00001187947,0.0007111902,0.00003775014,0.000020809628,0.00012198127,0.000110848916,0.024777362,0.0002989267,0.97256327,0.001316614,0.000012897232],"about_ca_topic_score_codex":0.0020237262,"about_ca_topic_score_gemma":0.002290358,"teacher_disagreement_score":0.010485652,"about_ca_system_score_codex":0.0034312229,"about_ca_system_score_gemma":0.0015881018,"threshold_uncertainty_score":0.03507799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19586238,0.0006838365,0.7681898,0.0036527915,0.00031846223,0.00044300375,0.0013939698,0.005333417,0.024122361],"genre_scores_gemma":[0.8216378,0.0002878151,0.1603602,0.00046232506,0.00016815506,0.00032342612,0.0008578791,0.00065146945,0.015250959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696004,0.0009908987,0.00011015835,0.0006503655,0.00067423173,0.0006143108],"domain_scores_gemma":[0.9864741,0.0065549314,0.00084871374,0.004620458,0.00078496296,0.00071683544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019370293,0.0009855593,0.0023810635,0.0008898303,0.00248977,0.0034661682,0.005478843,0.0019666343,0.01075148],"category_scores_gemma":[0.012096248,0.00089481723,0.0008205801,0.0031225514,0.0017401528,0.006610766,0.005368167,0.0023384597,0.0020818184],"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.0034587698,0.0011369854,0.0032766527,0.000789955,0.00016258373,0.00025037903,0.0007612806,0.5958901,0.0119563835,0.20084225,0.040642753,0.14083198],"study_design_scores_gemma":[0.0003015478,0.0000929655,0.0003787453,0.00001591991,0.00006427243,0.00009564471,0.0001627426,0.85087574,0.004021535,0.1414253,0.0025417767,0.000023892166],"about_ca_topic_score_codex":0.004120948,"about_ca_topic_score_gemma":0.0075408295,"teacher_disagreement_score":0.01075148,"about_ca_system_score_codex":0.0038605572,"about_ca_system_score_gemma":0.0045502763,"threshold_uncertainty_score":0.03596729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026725145,0.0012828411,0.9607648,0.000974836,0.00011489814,0.00015714721,0.0004140586,0.00047350983,0.009092712],"genre_scores_gemma":[0.20726208,0.0013382052,0.78198135,0.00031644938,0.00016075998,0.0004505825,0.0011604163,0.00030374518,0.007026373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987943,0.00046954968,0.00006147508,0.0002568779,0.00018829468,0.00022954316],"domain_scores_gemma":[0.9939288,0.004831136,0.00035495494,0.0003039351,0.00032271538,0.0002584223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002262375,0.0012999733,0.0018650851,0.0015631007,0.0010982046,0.0027479213,0.0032947657,0.0030152288,0.01037733],"category_scores_gemma":[0.011131347,0.0012720508,0.0015827495,0.0029739947,0.0017365623,0.0048149866,0.0025972705,0.003162333,0.0012808907],"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.00022285,0.00020638322,0.0006325609,0.00035396864,0.00006815331,0.00004942283,0.00018848787,0.80330515,0.0005677057,0.106641494,0.012123432,0.07564045],"study_design_scores_gemma":[0.000083657884,0.000040318773,0.00011137223,0.00003697439,0.000020826854,0.000024803718,0.000060578193,0.8869815,0.000235688,0.11052113,0.0018720241,0.000011168881],"about_ca_topic_score_codex":0.007689183,"about_ca_topic_score_gemma":0.010008386,"teacher_disagreement_score":0.01037733,"about_ca_system_score_codex":0.0027317358,"about_ca_system_score_gemma":0.0028441874,"threshold_uncertainty_score":0.034715593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23045975,0.00084211945,0.7283008,0.00095989427,0.00014273652,0.00019395603,0.001016861,0.0005347877,0.037549175],"genre_scores_gemma":[0.60616505,0.0014675383,0.36533886,0.00028163183,0.00014799008,0.00032938126,0.002468772,0.0005233705,0.02327734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897635,0.00038271668,0.000043131575,0.00020659882,0.00027482316,0.00011643049],"domain_scores_gemma":[0.99633586,0.0019289878,0.00040130105,0.000513655,0.00049783965,0.0003222849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077452883,0.0010900493,0.000725012,0.0017674471,0.0010002651,0.0027145788,0.0022127368,0.0017205905,0.010727489],"category_scores_gemma":[0.0070430594,0.0010700199,0.0008934486,0.0017302837,0.0012836251,0.0039353417,0.001850854,0.0022399484,0.0011029452],"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.00015125687,0.000074389885,0.001009595,0.00022792304,0.000033167616,0.00024257538,0.00039191818,0.033908315,0.0046641617,0.9039891,0.006144463,0.04916315],"study_design_scores_gemma":[0.000064633416,0.00006867277,0.00068347435,0.000072852,0.000038367798,0.00033061125,0.00023952516,0.12187109,0.0028199274,0.8617967,0.01198836,0.000025901254],"about_ca_topic_score_codex":0.0011526769,"about_ca_topic_score_gemma":0.0021965913,"teacher_disagreement_score":0.010727489,"about_ca_system_score_codex":0.0011561916,"about_ca_system_score_gemma":0.0004620285,"threshold_uncertainty_score":0.035887063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5847876,0.0044210874,0.36162156,0.006188586,0.00037645458,0.00029127116,0.0028443476,0.002176259,0.037292767],"genre_scores_gemma":[0.8057961,0.0015358703,0.17456414,0.0007803137,0.00031054873,0.00017297352,0.0034667295,0.0008360646,0.01253722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983525,0.00043751867,0.00007719688,0.00032225455,0.00039907443,0.00041137738],"domain_scores_gemma":[0.98866653,0.0070751165,0.00081749697,0.0017781956,0.0007256276,0.00093707273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002361901,0.001979289,0.00302887,0.0021540166,0.0016103404,0.0043388065,0.0045483373,0.0033095384,0.014646826],"category_scores_gemma":[0.021153536,0.0014824768,0.0017661317,0.004476363,0.0021315687,0.010631735,0.0039696707,0.0039524627,0.0021722629],"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.0036465917,0.0010755117,0.012664821,0.0013424674,0.00028378295,0.00058764307,0.0009980313,0.48454288,0.007178374,0.26539743,0.053990256,0.16829225],"study_design_scores_gemma":[0.00017374581,0.0001274215,0.00092442933,0.0000663368,0.00011427851,0.00022196354,0.0003019248,0.6763538,0.0012986388,0.31739086,0.0030005758,0.000026079388],"about_ca_topic_score_codex":0.0041834675,"about_ca_topic_score_gemma":0.00963479,"teacher_disagreement_score":0.014646826,"about_ca_system_score_codex":0.003486985,"about_ca_system_score_gemma":0.0022379425,"threshold_uncertainty_score":0.048998535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031959463,0.0005852042,0.9450116,0.0002507655,0.0002158022,0.000065519234,0.00013075778,0.001415779,0.020365091],"genre_scores_gemma":[0.32239062,0.00048057662,0.65392905,0.0002104639,0.00016433345,0.00018017508,0.00051487196,0.0007981307,0.02133177],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963653,0.00008091457,0.000018307031,0.000066128654,0.0001296444,0.000068361456],"domain_scores_gemma":[0.99960047,0.000104234015,0.000026534504,0.00013318734,0.00008282189,0.000052688396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034469034,0.0010658975,0.0008497119,0.0010055625,0.00059879717,0.0011312589,0.0012477047,0.0007585027,0.013294996],"category_scores_gemma":[0.0014924685,0.000442972,0.00067683455,0.0012104962,0.00045753721,0.0017302354,0.0027378441,0.0013709468,0.0038238862],"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.001127548,0.00045750482,0.0008471285,0.0003617677,0.00007071914,0.00026650514,0.00033012443,0.090130545,0.048716463,0.18300408,0.03148389,0.64320374],"study_design_scores_gemma":[0.00013070434,0.00017707316,0.00033460566,0.000030950614,0.000040579653,0.00022786894,0.00013657835,0.7632954,0.023597408,0.19713053,0.01486825,0.000030049643],"about_ca_topic_score_codex":0.00035358281,"about_ca_topic_score_gemma":0.0007555003,"teacher_disagreement_score":0.013294996,"about_ca_system_score_codex":0.00028986446,"about_ca_system_score_gemma":0.00039370672,"threshold_uncertainty_score":0.04447621},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.647139,0.0016832931,0.31122738,0.011016242,0.00017851911,0.00020209102,0.0016026543,0.0003823004,0.026568498],"genre_scores_gemma":[0.98052853,0.0009130108,0.011911915,0.00033712864,0.0003140163,0.00018697718,0.0004381626,0.00008771429,0.005282632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666613,0.0013807275,0.00014026587,0.00044962217,0.00080031634,0.0005629109],"domain_scores_gemma":[0.92178756,0.068571165,0.0033844656,0.0030526365,0.0017405794,0.0014635386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003284998,0.000706278,0.0020950353,0.0015317147,0.0019082405,0.004955295,0.0034463692,0.0025179954,0.008037453],"category_scores_gemma":[0.034506172,0.00090926175,0.0011080402,0.0019583427,0.0032291184,0.009660293,0.0032568967,0.0033864907,0.00062727893],"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.00061584654,0.0001805721,0.0034343465,0.00030765895,0.00011409226,0.00030230434,0.0007547057,0.19735922,0.0022316708,0.7735627,0.00616655,0.014970349],"study_design_scores_gemma":[0.00008678323,0.000032562057,0.00058987795,0.000018987428,0.000029267125,0.00010624995,0.00011609711,0.42999408,0.00041240035,0.567991,0.0005942752,0.00002847851],"about_ca_topic_score_codex":0.0023022166,"about_ca_topic_score_gemma":0.0018378551,"teacher_disagreement_score":0.008037453,"about_ca_system_score_codex":0.0033166632,"about_ca_system_score_gemma":0.0022078035,"threshold_uncertainty_score":0.026887953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15498982,0.008590531,0.762636,0.010685655,0.00046284424,0.0001565478,0.0003023633,0.00049170235,0.061684422],"genre_scores_gemma":[0.9387356,0.002830751,0.047040164,0.0006630771,0.00040544727,0.00015216094,0.000112529815,0.00016853125,0.009891732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979824,0.0009672955,0.00008369125,0.0002781712,0.00042898313,0.00025951662],"domain_scores_gemma":[0.99278414,0.004447991,0.00053423404,0.0016253574,0.00036130784,0.00024694926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029848318,0.00052380835,0.0005904163,0.00079109194,0.0009793713,0.0022573962,0.0013886688,0.001131122,0.0055080755],"category_scores_gemma":[0.00923081,0.00056473044,0.00033520054,0.0009459051,0.0025329576,0.008190613,0.0022150562,0.0016220147,0.0007373878],"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.0004968823,0.00009090104,0.00096938136,0.00026882614,0.000045788893,0.00004493967,0.00020148786,0.09180381,0.002826905,0.80351603,0.0043711113,0.09536388],"study_design_scores_gemma":[0.00006983571,0.00016444648,0.00033852848,0.000055143435,0.000056190675,0.00013633235,0.00012756909,0.13882732,0.0029394142,0.8473139,0.009948197,0.00002311014],"about_ca_topic_score_codex":0.00042709833,"about_ca_topic_score_gemma":0.001016412,"teacher_disagreement_score":0.0055080755,"about_ca_system_score_codex":0.0017606181,"about_ca_system_score_gemma":0.0010655608,"threshold_uncertainty_score":0.0184263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029704263,0.00014061246,0.9606916,0.00021434686,0.00006931687,0.00016107067,0.00011605735,0.0010712061,0.007831649],"genre_scores_gemma":[0.2443233,0.0001115005,0.75120807,0.00012656864,0.000038689526,0.00029252554,0.0004353616,0.00029242833,0.003171511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774927,0.0006879258,0.00016052047,0.00035210495,0.0007618682,0.00028834917],"domain_scores_gemma":[0.9915752,0.006490885,0.00025284654,0.0009189055,0.0005937091,0.00016849895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002548915,0.0010149287,0.00152882,0.0015375912,0.001186753,0.0022621374,0.00328137,0.0018600461,0.01210392],"category_scores_gemma":[0.014157051,0.0016926401,0.0016489915,0.0017819334,0.0018184234,0.004497961,0.004964539,0.0035253593,0.0011444085],"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.00065329956,0.00054769265,0.0015824052,0.0007705422,0.00020728233,0.00031513613,0.0005538652,0.48284373,0.008667166,0.20562534,0.0061649783,0.29206857],"study_design_scores_gemma":[0.00010205516,0.000060485923,0.000076670796,0.000021587477,0.00004675747,0.000046331916,0.00007765954,0.89002484,0.0028914483,0.10423132,0.002401778,0.000019015288],"about_ca_topic_score_codex":0.004048268,"about_ca_topic_score_gemma":0.008752128,"teacher_disagreement_score":0.01210392,"about_ca_system_score_codex":0.0010703324,"about_ca_system_score_gemma":0.0021961827,"threshold_uncertainty_score":0.04049164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038962252,0.000488289,0.9385949,0.0012049904,0.00035475136,0.00027179866,0.00080970273,0.006747813,0.012565524],"genre_scores_gemma":[0.15658706,0.00026349674,0.83197933,0.00042372808,0.00012364173,0.00050188426,0.0018259563,0.0008816962,0.0074132252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989592,0.00018258156,0.00005535136,0.0003184953,0.00030961377,0.00017477121],"domain_scores_gemma":[0.9971462,0.0013639869,0.00020521389,0.0006896698,0.00035339172,0.00024156689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011630956,0.0018557141,0.0011425469,0.0017626456,0.0010710092,0.0026308657,0.003370751,0.0015580687,0.018657466],"category_scores_gemma":[0.005906946,0.0008263888,0.0015435705,0.0023345794,0.0011307881,0.004686291,0.0035685364,0.003504942,0.0036706373],"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.0016854407,0.000708638,0.0034437529,0.0009838375,0.00036361188,0.00015031698,0.00037555833,0.16414595,0.024002057,0.07380313,0.059600115,0.6707377],"study_design_scores_gemma":[0.00060757913,0.00021559713,0.001227961,0.00007427142,0.0001397805,0.00014628182,0.00018796827,0.86522955,0.010192949,0.108798675,0.013109111,0.00007020901],"about_ca_topic_score_codex":0.005629838,"about_ca_topic_score_gemma":0.014388272,"teacher_disagreement_score":0.018657466,"about_ca_system_score_codex":0.0024726794,"about_ca_system_score_gemma":0.003573975,"threshold_uncertainty_score":0.06241548},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6290077,0.0029199573,0.25588048,0.01909755,0.00037643564,0.00015727522,0.0010840337,0.0005334283,0.09094325],"genre_scores_gemma":[0.9678133,0.00083433057,0.022690041,0.0003243133,0.00022367088,0.00012037358,0.00029023417,0.0001410372,0.007562605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971208,0.0008209638,0.00014120972,0.00034716012,0.0009820784,0.00058781693],"domain_scores_gemma":[0.96684974,0.027668526,0.0011073357,0.0027230238,0.0009744275,0.000676973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028831337,0.00046973888,0.0015360592,0.001352235,0.002592461,0.006149564,0.002443202,0.0026878472,0.013847419],"category_scores_gemma":[0.028354691,0.00085923827,0.001316186,0.0024768726,0.005632791,0.017338872,0.0031068868,0.0049467115,0.00066416746],"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.00011670306,0.000042684234,0.00036165077,0.00005997072,0.0000113632905,0.00004479438,0.00014741988,0.015714442,0.0002963995,0.9765387,0.0017378725,0.004927972],"study_design_scores_gemma":[0.00002441475,0.000008136352,0.00019742567,0.0000088975985,0.000009129697,0.000033045315,0.000068103094,0.03481251,0.0002937073,0.9639542,0.00057848083,0.000011820499],"about_ca_topic_score_codex":0.0035975797,"about_ca_topic_score_gemma":0.0040400783,"teacher_disagreement_score":0.013847419,"about_ca_system_score_codex":0.0043928223,"about_ca_system_score_gemma":0.0031651394,"threshold_uncertainty_score":0.046324193},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07390863,0.0015728669,0.8780265,0.0021913345,0.00028370135,0.0003813354,0.0003177301,0.0017876958,0.041530106],"genre_scores_gemma":[0.6513857,0.0013173978,0.32791337,0.0011946125,0.0005871893,0.0008910143,0.0004916708,0.0010922194,0.015126751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961831,0.00096514006,0.00016255719,0.00084521086,0.0011205423,0.0007233385],"domain_scores_gemma":[0.9876853,0.0076311883,0.00089229067,0.0021335504,0.0010907106,0.00056697463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031807204,0.002526215,0.0020852983,0.0014734435,0.0014450393,0.003214198,0.0038468903,0.002350077,0.010019301],"category_scores_gemma":[0.024872286,0.0007733853,0.001326388,0.0026697018,0.0027381147,0.0071474845,0.0028115632,0.003743156,0.001922352],"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.0007351835,0.00084017054,0.0023152633,0.00068066607,0.0001256547,0.00018174997,0.00029690602,0.41198924,0.0145224985,0.3932509,0.020993236,0.15406856],"study_design_scores_gemma":[0.00011436254,0.00024165105,0.00037679062,0.0000359369,0.000029356925,0.00019986006,0.000048804734,0.8086267,0.0074194935,0.17774566,0.0051279697,0.000033354576],"about_ca_topic_score_codex":0.0016061601,"about_ca_topic_score_gemma":0.0016126059,"teacher_disagreement_score":0.010019301,"about_ca_system_score_codex":0.003040206,"about_ca_system_score_gemma":0.0037542523,"threshold_uncertainty_score":0.033517897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2504251,0.011110153,0.5557524,0.005240074,0.00094289985,0.00011955466,0.00073564326,0.0006716979,0.17500247],"genre_scores_gemma":[0.8934291,0.003339035,0.06490933,0.00047081357,0.0010774719,0.00011511702,0.0009191861,0.00019361239,0.035546277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927145,0.00014970981,0.000026870563,0.00022243033,0.00020391004,0.0001255943],"domain_scores_gemma":[0.99856806,0.0008085874,0.00014889278,0.00022645117,0.00013813064,0.00010982382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007209329,0.0006831103,0.0011635958,0.0014398332,0.0016333207,0.003864448,0.0010698559,0.000782947,0.015366979],"category_scores_gemma":[0.004006322,0.0005718842,0.0009576451,0.0026496123,0.0029320368,0.0065961927,0.0019590491,0.0038487383,0.0019441729],"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.00007325837,0.000022238295,0.0001786685,0.00004551163,0.00000765189,0.000023765486,0.00017134027,0.0023075978,0.0003357948,0.9797831,0.00239545,0.014655833],"study_design_scores_gemma":[0.000012063638,0.000008095892,0.0001154518,0.000009473979,0.00000666434,0.000034696473,0.000046521418,0.0039526355,0.00014155018,0.9921146,0.0035526596,0.0000057526354],"about_ca_topic_score_codex":0.0014026753,"about_ca_topic_score_gemma":0.0012409342,"teacher_disagreement_score":0.015366979,"about_ca_system_score_codex":0.0013812581,"about_ca_system_score_gemma":0.0006180604,"threshold_uncertainty_score":0.051407635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096698314,0.0025901105,0.8884054,0.0018382333,0.00030434626,0.0002043483,0.00045370773,0.00037406146,0.009131512],"genre_scores_gemma":[0.7386566,0.004052103,0.23572074,0.00038179583,0.00041711068,0.0007076074,0.0009649836,0.00017978673,0.018919306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984669,0.0004652761,0.0001199182,0.0002794472,0.00041409262,0.00025436122],"domain_scores_gemma":[0.9877216,0.009853768,0.00094157807,0.0004960632,0.0005822976,0.00040472907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030542936,0.0008561947,0.0013256953,0.0018966403,0.0018646262,0.003208422,0.0026557231,0.0016190907,0.0043739765],"category_scores_gemma":[0.018798362,0.0009844027,0.00062565133,0.0026590517,0.0018979685,0.0055877254,0.0019742807,0.0017412258,0.00039427087],"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.00063712586,0.00016603834,0.0017379523,0.00038657972,0.00008351273,0.00014277095,0.00038224796,0.50999516,0.0015917076,0.4130466,0.0053593307,0.06647095],"study_design_scores_gemma":[0.00012461857,0.00007532707,0.00025105913,0.000044270768,0.000052910134,0.00007759757,0.00010137236,0.66928846,0.0006081539,0.3261453,0.00320619,0.000024727256],"about_ca_topic_score_codex":0.0039697974,"about_ca_topic_score_gemma":0.004145592,"teacher_disagreement_score":0.0043739765,"about_ca_system_score_codex":0.002359508,"about_ca_system_score_gemma":0.0022824893,"threshold_uncertainty_score":0.017119527},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04447879,0.008897284,0.9138749,0.0029590703,0.0005389432,0.00006400551,0.00012584007,0.00028389535,0.028777191],"genre_scores_gemma":[0.75052077,0.0051523456,0.20811643,0.000517999,0.00087515055,0.0002672497,0.00025775773,0.0002554581,0.03403676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776053,0.0012356921,0.00009092547,0.00036507976,0.00037543866,0.00017241215],"domain_scores_gemma":[0.9887399,0.009399112,0.0004860889,0.0008183814,0.0003464455,0.00021011519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029424378,0.001292301,0.00259838,0.0008870355,0.0010409123,0.0034632275,0.0024363142,0.0037888954,0.010652943],"category_scores_gemma":[0.020979024,0.0008506743,0.0010004758,0.0024136375,0.0031975384,0.009457158,0.0024387664,0.004051353,0.0009727311],"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.00031372203,0.00023927381,0.0007041538,0.0003138181,0.00009441823,0.000091720794,0.00012912041,0.13907824,0.00040453215,0.7740598,0.006140816,0.0784305],"study_design_scores_gemma":[0.000038684982,0.00003035643,0.00011979358,0.000019231202,0.000020500012,0.00004489116,0.000019682693,0.21875754,0.00015532364,0.7790459,0.0017382322,0.000009861984],"about_ca_topic_score_codex":0.0008752346,"about_ca_topic_score_gemma":0.00080345786,"teacher_disagreement_score":0.010652943,"about_ca_system_score_codex":0.0012289435,"about_ca_system_score_gemma":0.0010708006,"threshold_uncertainty_score":0.035637617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17535204,0.0044584777,0.77626395,0.0035756691,0.00047095108,0.00018590265,0.00040675333,0.0021114224,0.037174813],"genre_scores_gemma":[0.7268087,0.0014118202,0.2614684,0.00035496373,0.00022840807,0.0002518729,0.00047055446,0.0011906856,0.00781464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963838,0.0013620825,0.0001961787,0.00032463903,0.0010924938,0.00064079545],"domain_scores_gemma":[0.9782305,0.016176369,0.0006564344,0.0025239454,0.0015527764,0.00086001924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066195647,0.0017941472,0.0016398497,0.0019658483,0.0019520285,0.0040119276,0.0029655853,0.0032269675,0.019301983],"category_scores_gemma":[0.036028814,0.00082329515,0.0011598471,0.0027467273,0.0021879256,0.008909367,0.004250093,0.0026419845,0.0020502175],"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.0028909617,0.0005282525,0.0030355887,0.00056199945,0.00016784084,0.00011630165,0.000488966,0.53038996,0.008620987,0.19260034,0.012096058,0.24850282],"study_design_scores_gemma":[0.00008416305,0.00029878115,0.00038091745,0.000059622573,0.00008995788,0.00008327587,0.00016230078,0.885895,0.00312998,0.10727784,0.0025131465,0.000024940624],"about_ca_topic_score_codex":0.0020381245,"about_ca_topic_score_gemma":0.0035113515,"teacher_disagreement_score":0.019301983,"about_ca_system_score_codex":0.0021132757,"about_ca_system_score_gemma":0.002374746,"threshold_uncertainty_score":0.06457156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05011604,0.001136883,0.8604538,0.0027162766,0.0008280771,0.00023218736,0.0017100751,0.017645797,0.06516082],"genre_scores_gemma":[0.31406033,0.00055431656,0.63680947,0.0007307028,0.0004289092,0.00024058136,0.0026261988,0.002286387,0.04226298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839526,0.00031444593,0.0000818844,0.00029544422,0.00065968896,0.00025325568],"domain_scores_gemma":[0.9962923,0.0014947782,0.00012321117,0.0015005097,0.00042984972,0.00015937717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095629256,0.0011986415,0.0013026543,0.0009378855,0.0009963134,0.0018548232,0.0019078371,0.0017440071,0.032681603],"category_scores_gemma":[0.010617811,0.0007354887,0.0009548086,0.0019217792,0.00070021144,0.0034351465,0.0026002664,0.0030806302,0.010020385],"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.0013977247,0.0006771549,0.0021095092,0.0005044198,0.000079173886,0.0002783574,0.0002141958,0.08560727,0.0074373228,0.072084576,0.10832428,0.7212861],"study_design_scores_gemma":[0.00017100232,0.000092237395,0.0004993852,0.00006902381,0.000051602714,0.000215496,0.000054828797,0.7184554,0.0068028006,0.24487685,0.028686294,0.000025098596],"about_ca_topic_score_codex":0.00244242,"about_ca_topic_score_gemma":0.006074061,"teacher_disagreement_score":0.032681603,"about_ca_system_score_codex":0.0009921975,"about_ca_system_score_gemma":0.0017423035,"threshold_uncertainty_score":0.10933089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03296724,0.0029055001,0.9314469,0.005896895,0.00058566075,0.000084098494,0.00028034943,0.0006648575,0.025168505],"genre_scores_gemma":[0.6671596,0.0047185235,0.30494636,0.001500198,0.0028302919,0.00026194088,0.0007813819,0.0008524929,0.016949223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927549,0.0028195058,0.0003194463,0.0012517376,0.0020129671,0.0008415382],"domain_scores_gemma":[0.9462527,0.04135493,0.0021377446,0.006694828,0.0018312113,0.0017285307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007542692,0.001601353,0.0029940784,0.0023792428,0.0029831822,0.00857376,0.00565678,0.0034231304,0.009671121],"category_scores_gemma":[0.047747336,0.0014141822,0.0023873218,0.0044404743,0.0055567403,0.02727931,0.0051856255,0.0077331634,0.0018757479],"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.00043665746,0.000110607376,0.0007169064,0.000249737,0.00005904193,0.000040173385,0.0002543539,0.039991967,0.0008981093,0.90081024,0.006725672,0.049706545],"study_design_scores_gemma":[0.00004888374,0.000033352764,0.00009795699,0.000017835959,0.000022263397,0.00003956122,0.000037209436,0.09011622,0.0004666811,0.90612185,0.0029841224,0.000014000485],"about_ca_topic_score_codex":0.004157521,"about_ca_topic_score_gemma":0.0031991636,"teacher_disagreement_score":0.009671121,"about_ca_system_score_codex":0.0047780965,"about_ca_system_score_gemma":0.0038589232,"threshold_uncertainty_score":0.03988999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004147714,0.00018500169,0.9924344,0.000059012353,0.00008670442,0.000062310806,0.000076937264,0.0009198872,0.0020281195],"genre_scores_gemma":[0.05289839,0.00016267989,0.9405903,0.00008369708,0.00006892696,0.0002426493,0.0005057607,0.00063494133,0.0048126145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740845,0.00063343794,0.00017629135,0.00050666917,0.0010077117,0.0002674638],"domain_scores_gemma":[0.99483657,0.0019195981,0.00021064622,0.0018434478,0.0009936554,0.00019605797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023110898,0.0015985568,0.0019681503,0.0028540564,0.0013463912,0.0023771883,0.0041266284,0.0015975693,0.016756931],"category_scores_gemma":[0.012921263,0.0015227202,0.0019114318,0.0031703415,0.0016841784,0.004355195,0.0060023353,0.0034491331,0.004231951],"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.0007457053,0.00022292318,0.0010336036,0.00043586714,0.00011888203,0.000118743345,0.00048489528,0.22448093,0.009417241,0.18524979,0.017090708,0.56060076],"study_design_scores_gemma":[0.00014828041,0.00008653608,0.00031002445,0.000046020545,0.0000571943,0.00009962056,0.00007121517,0.886032,0.0052390425,0.09718057,0.010694737,0.000034737535],"about_ca_topic_score_codex":0.003552195,"about_ca_topic_score_gemma":0.006476367,"teacher_disagreement_score":0.016756931,"about_ca_system_score_codex":0.0015010328,"about_ca_system_score_gemma":0.0011730823,"threshold_uncertainty_score":0.056057513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13450156,0.0068095084,0.65583944,0.027680574,0.0010765841,0.00014916268,0.0007484746,0.0014289338,0.17176586],"genre_scores_gemma":[0.9108769,0.0024877144,0.05816558,0.004118659,0.0018662638,0.00017136418,0.00031229336,0.00047044703,0.021530742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948985,0.001353865,0.0001865783,0.00082453695,0.0018678554,0.00086866453],"domain_scores_gemma":[0.964181,0.025827222,0.0013156657,0.005205449,0.0015052393,0.0019653528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006278625,0.0011166742,0.0019066735,0.0024802536,0.0028457511,0.008598048,0.0034185736,0.0033759912,0.021896213],"category_scores_gemma":[0.031149888,0.0013363494,0.0015571727,0.0023035256,0.009678307,0.026423018,0.00826574,0.012391211,0.0020183616],"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.000066144836,0.000019046189,0.0000828694,0.000050604805,0.0000063248194,0.000013697734,0.00009047172,0.00096624735,0.00033716578,0.9935202,0.0013039812,0.0035431737],"study_design_scores_gemma":[0.000020482878,0.000017902921,0.00015111001,0.000012134038,0.000010724807,0.000054591375,0.000054592158,0.0061027245,0.00043776873,0.9915541,0.0015738743,0.000010013489],"about_ca_topic_score_codex":0.00069951446,"about_ca_topic_score_gemma":0.0006765272,"teacher_disagreement_score":0.021896213,"about_ca_system_score_codex":0.0029424294,"about_ca_system_score_gemma":0.0015767013,"threshold_uncertainty_score":0.073250115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023077228,0.00061749324,0.96453995,0.00020928831,0.00015653338,0.00020941906,0.0008755387,0.030365603,0.00071828306],"genre_scores_gemma":[0.008125316,0.00023326967,0.9852368,0.00012530496,0.00005696416,0.00047860088,0.002792842,0.0019842468,0.00096671545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608994,0.0014720957,0.00037690322,0.00085790583,0.0009664783,0.00023670569],"domain_scores_gemma":[0.9963045,0.002060778,0.00027679367,0.00060250843,0.00058775843,0.00016751105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037147736,0.004311463,0.0033986694,0.0039037738,0.003059195,0.003986051,0.005374161,0.0024049364,0.011091161],"category_scores_gemma":[0.013097237,0.0023026995,0.0027355044,0.004789577,0.0017216138,0.004063305,0.003344307,0.005865361,0.009327234],"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.0016059052,0.00040760564,0.0011124115,0.0017196618,0.0006383779,0.00026710556,0.0006622354,0.044079695,0.030849833,0.031765454,0.11312538,0.7737664],"study_design_scores_gemma":[0.0010281071,0.00038102252,0.00085067813,0.00021646528,0.00019380468,0.0005035225,0.00021955855,0.74703336,0.027855424,0.124621645,0.09687273,0.0002236073],"about_ca_topic_score_codex":0.0053948923,"about_ca_topic_score_gemma":0.008565414,"teacher_disagreement_score":0.011091161,"about_ca_system_score_codex":0.0018585569,"about_ca_system_score_gemma":0.0044632494,"threshold_uncertainty_score":0.037103653},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31772184,0.005154819,0.5873976,0.007586461,0.0004888217,0.00012027007,0.00055972114,0.0014678097,0.07950268],"genre_scores_gemma":[0.9498594,0.001943119,0.027405303,0.0011166548,0.00093384297,0.00025851585,0.00049628766,0.0005423494,0.017444504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627626,0.0012932799,0.00016213684,0.00063205307,0.0009176239,0.00071872736],"domain_scores_gemma":[0.9726555,0.018096358,0.001936125,0.003297608,0.0019860654,0.0020282618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055996845,0.0010456174,0.002960569,0.00528186,0.0036225663,0.006724011,0.0038027545,0.0033442972,0.009639695],"category_scores_gemma":[0.04649023,0.001408698,0.002304659,0.0032960735,0.009090963,0.013202915,0.007449512,0.006674307,0.001151013],"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.0000111683175,0.000009429722,0.0002515688,0.000027064432,0.000008995588,0.000027146196,0.00013910023,0.0015219637,0.00009110383,0.9957975,0.00067012495,0.0014448923],"study_design_scores_gemma":[0.000007022568,0.000004428516,0.00013007167,0.000014721835,0.000007490971,0.000044647462,0.000031792493,0.012585862,0.000058086614,0.9866066,0.0004997671,0.000009389405],"about_ca_topic_score_codex":0.0019535888,"about_ca_topic_score_gemma":0.002124123,"teacher_disagreement_score":0.009639695,"about_ca_system_score_codex":0.0030360478,"about_ca_system_score_gemma":0.0016651764,"threshold_uncertainty_score":0.03224802},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02598305,0.0057259155,0.9444538,0.006508125,0.00038301657,0.0001559685,0.0006503812,0.00027016978,0.015869623],"genre_scores_gemma":[0.7961712,0.011037118,0.12851828,0.0013325271,0.0014170797,0.0011371429,0.0010830296,0.0004554442,0.05884806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543446,0.0027881193,0.00019526269,0.0004806846,0.00059615914,0.00050537236],"domain_scores_gemma":[0.97843987,0.018240117,0.001354486,0.000584255,0.0008106442,0.0005706581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008679903,0.0023546473,0.0048352,0.0024171867,0.0013457374,0.0058700056,0.004310869,0.0056151166,0.011418797],"category_scores_gemma":[0.041111816,0.003253408,0.00245367,0.003449525,0.003943408,0.0074273287,0.00258332,0.006468094,0.0011941645],"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.00006865385,0.00006580331,0.0003749043,0.00013030299,0.00007150631,0.0000534407,0.00009915575,0.41684273,0.00015978185,0.5731094,0.003777923,0.005246485],"study_design_scores_gemma":[0.000038197242,0.000017204815,0.00013793686,0.000028334745,0.000031500844,0.000020615931,0.000024392693,0.74604154,0.00004488266,0.25230965,0.0012823791,0.000023469682],"about_ca_topic_score_codex":0.012698665,"about_ca_topic_score_gemma":0.01158927,"teacher_disagreement_score":0.012698665,"about_ca_system_score_codex":0.0063108113,"about_ca_system_score_gemma":0.0030053642,"threshold_uncertainty_score":0.04590422},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059198365,0.0047024386,0.9138435,0.00292172,0.00043107395,0.00024271834,0.0009970166,0.0017213565,0.015941853],"genre_scores_gemma":[0.3678501,0.002386152,0.61238027,0.0008549765,0.0010094155,0.0006043062,0.0028500033,0.0009654165,0.011099452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956683,0.0013618771,0.00020210088,0.00072796305,0.0013466361,0.00069302786],"domain_scores_gemma":[0.9849182,0.0105370525,0.0007925817,0.002273247,0.000882919,0.00059614086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004585013,0.0023614361,0.003174567,0.002699788,0.0014509188,0.0047442922,0.0066722115,0.002882036,0.01017104],"category_scores_gemma":[0.024024595,0.0012742577,0.0026249927,0.0054790433,0.0017954814,0.011724981,0.0044418145,0.00648113,0.0017207593],"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.0021710263,0.0009802533,0.003203803,0.0009125551,0.0002526304,0.00014112458,0.0005599051,0.40576866,0.003697057,0.19631135,0.036006503,0.34999523],"study_design_scores_gemma":[0.00014319572,0.000076760894,0.00046886562,0.000044302637,0.00009739319,0.000105053565,0.000068706315,0.86289716,0.0010351668,0.13156255,0.003479321,0.000021656504],"about_ca_topic_score_codex":0.005012253,"about_ca_topic_score_gemma":0.008408488,"teacher_disagreement_score":0.01017104,"about_ca_system_score_codex":0.005555797,"about_ca_system_score_gemma":0.003373533,"threshold_uncertainty_score":0.040310264},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015306092,0.0002713953,0.98100257,0.00012446447,0.000038051978,0.0000934126,0.00044001907,0.0016245607,0.0010993446],"genre_scores_gemma":[0.11356408,0.0005381869,0.8798726,0.00010856565,0.00006842508,0.00025517782,0.0028399855,0.00082906,0.0019239206],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972289,0.00031215168,0.00023339206,0.0006360611,0.0012847955,0.00030467362],"domain_scores_gemma":[0.9941924,0.0014452374,0.00023736748,0.0031523027,0.00085054757,0.00012203423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013826848,0.0014385292,0.0023472302,0.0019367482,0.0013073462,0.0025055504,0.0041777543,0.001505557,0.007720089],"category_scores_gemma":[0.010988057,0.0015967725,0.002219188,0.003987448,0.0016033525,0.004112036,0.006138057,0.0021165854,0.0044714184],"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.0010812187,0.0001308908,0.002353168,0.0010744919,0.0001486376,0.0011633296,0.0014119062,0.40335035,0.043599967,0.026388166,0.010915525,0.5083823],"study_design_scores_gemma":[0.000085645115,0.00018763322,0.0011864995,0.00014636558,0.00007581747,0.0006187449,0.00038065476,0.893725,0.02493931,0.054270197,0.024282472,0.00010181429],"about_ca_topic_score_codex":0.0064203446,"about_ca_topic_score_gemma":0.00791905,"teacher_disagreement_score":0.007720089,"about_ca_system_score_codex":0.0009826303,"about_ca_system_score_gemma":0.0015288556,"threshold_uncertainty_score":0.025826275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08477406,0.001015023,0.8820239,0.0018432632,0.0004754684,0.00036652145,0.00076054054,0.0021705502,0.02657079],"genre_scores_gemma":[0.8583038,0.00066535146,0.119687036,0.0008829555,0.000427366,0.00047916613,0.0009352553,0.00077380415,0.017845338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678695,0.0006664631,0.00023014277,0.00056200125,0.0011943044,0.0005601589],"domain_scores_gemma":[0.9838612,0.0044488763,0.0006067375,0.009431172,0.0013490818,0.000302887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358699,0.001047665,0.0018544472,0.0011422074,0.0029234958,0.0032784396,0.0018569989,0.0042541646,0.010998679],"category_scores_gemma":[0.023002056,0.0012254051,0.0012036642,0.0022087302,0.0045573832,0.014691838,0.006028074,0.0042987,0.0046700626],"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.0009198595,0.00019648415,0.0016218402,0.00040726093,0.000067083725,0.00034933828,0.00052105665,0.022179909,0.009322865,0.8771643,0.009520129,0.077729896],"study_design_scores_gemma":[0.00010984082,0.00013772225,0.0003258013,0.000085489555,0.000044156965,0.00048522916,0.00014911305,0.059992608,0.009737597,0.9167967,0.012059611,0.00007618754],"about_ca_topic_score_codex":0.00038099944,"about_ca_topic_score_gemma":0.0006201471,"teacher_disagreement_score":0.010998679,"about_ca_system_score_codex":0.0010828463,"about_ca_system_score_gemma":0.0019541327,"threshold_uncertainty_score":0.036794186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0734996,0.0070933118,0.55604124,0.024866821,0.003234553,0.0002274036,0.0013323597,0.0011562911,0.3325484],"genre_scores_gemma":[0.5458907,0.0066722413,0.33496845,0.0050641564,0.007724181,0.00047845294,0.0018230249,0.0009668684,0.096411884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980914,0.00064442074,0.00008163947,0.000398619,0.00062613265,0.00015779909],"domain_scores_gemma":[0.99375725,0.003843168,0.00030510518,0.0011139655,0.0006376087,0.0003429389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020523025,0.00064317236,0.0013186603,0.002771858,0.0029494942,0.0037803145,0.0024920343,0.0021262022,0.011832958],"category_scores_gemma":[0.010747358,0.00074424705,0.0009236742,0.004846934,0.005720537,0.011299937,0.004700328,0.0045668245,0.0023269884],"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.000035246576,0.000023364491,0.00015821175,0.0000466546,0.000007689854,0.000035315818,0.00011629568,0.0012189827,0.00028634872,0.97585297,0.0083550345,0.013863807],"study_design_scores_gemma":[0.000010598294,0.000010384465,0.00009149731,0.000014245752,0.000004561965,0.000034529494,0.000016231794,0.0027895435,0.00013886791,0.9874407,0.00943982,0.000009088347],"about_ca_topic_score_codex":0.001627794,"about_ca_topic_score_gemma":0.0018384001,"teacher_disagreement_score":0.011832958,"about_ca_system_score_codex":0.0015490472,"about_ca_system_score_gemma":0.0018087476,"threshold_uncertainty_score":0.039585173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15737803,0.0010806471,0.8204398,0.0023296236,0.0002941072,0.00042487058,0.00028341214,0.0013492382,0.016420223],"genre_scores_gemma":[0.7284853,0.00066058105,0.255944,0.00027662324,0.00017493858,0.00031565194,0.0003253361,0.00030572072,0.013511907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961294,0.0016463061,0.0001928472,0.00065629644,0.00097494654,0.00040019202],"domain_scores_gemma":[0.9882086,0.008482356,0.0005138346,0.0015635088,0.0005452617,0.00068643485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144167,0.0007846473,0.0026249927,0.0011911404,0.003099047,0.0030793357,0.0035508214,0.0029626978,0.0051544514],"category_scores_gemma":[0.025262905,0.0008613909,0.00073890435,0.002215715,0.0029060359,0.0061220555,0.0044639255,0.0019817369,0.001324618],"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.003087832,0.00039763717,0.0057433634,0.0006476112,0.00019380212,0.00061247003,0.001562782,0.2810855,0.0052648857,0.5292898,0.013262912,0.1588514],"study_design_scores_gemma":[0.0003460812,0.0002785269,0.00032369778,0.000060206403,0.00012831483,0.00038736823,0.00046241935,0.6272997,0.004281493,0.36098498,0.0053752577,0.000071940216],"about_ca_topic_score_codex":0.0015997955,"about_ca_topic_score_gemma":0.0031014683,"teacher_disagreement_score":0.0051544514,"about_ca_system_score_codex":0.0013170218,"about_ca_system_score_gemma":0.002238447,"threshold_uncertainty_score":0.021916687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08062349,0.0020440514,0.8972471,0.0030178314,0.00026270415,0.00026020056,0.0016965753,0.005407514,0.009440459],"genre_scores_gemma":[0.5140797,0.0008436466,0.46772826,0.0009982,0.00045076196,0.00069702615,0.003109513,0.0007810239,0.011311942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997917,0.00038174758,0.0002156008,0.000283744,0.00092780986,0.00027413142],"domain_scores_gemma":[0.99304515,0.002696515,0.00045577262,0.0027816459,0.0008187107,0.00020221827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015683225,0.0005507079,0.001077734,0.001524062,0.001384943,0.0029907764,0.0020034544,0.0010402278,0.009501752],"category_scores_gemma":[0.011150406,0.00036392783,0.0007159488,0.004328221,0.0014425342,0.007426495,0.0038358308,0.0021801672,0.002336496],"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.0021523908,0.00062287785,0.0058691627,0.00061516365,0.00011373578,0.00015751184,0.0013725979,0.04484847,0.017542068,0.27985662,0.05213956,0.5947098],"study_design_scores_gemma":[0.00034570857,0.000471028,0.0012843431,0.00013313706,0.000114656454,0.00046231938,0.00091884023,0.40508163,0.038641896,0.5241842,0.028268823,0.00009330371],"about_ca_topic_score_codex":0.0015587631,"about_ca_topic_score_gemma":0.0023862112,"teacher_disagreement_score":0.009501752,"about_ca_system_score_codex":0.0014274959,"about_ca_system_score_gemma":0.0018044552,"threshold_uncertainty_score":0.03178656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06055091,0.0004188852,0.92549294,0.0014961304,0.00018369094,0.0003743523,0.0009039464,0.001297015,0.009282144],"genre_scores_gemma":[0.60052884,0.0005383921,0.3842064,0.0006506916,0.0003540078,0.00092240504,0.0017823606,0.00075111317,0.010265775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957195,0.0012997848,0.0002287464,0.0013742388,0.00094532495,0.00043246383],"domain_scores_gemma":[0.9897994,0.0048594847,0.00093332573,0.0024874709,0.0010280359,0.00089233276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033610368,0.0020699361,0.004168251,0.0014989446,0.0021809444,0.0052644694,0.005918504,0.0038370064,0.008707983],"category_scores_gemma":[0.019235438,0.0012663961,0.0029457957,0.0026606014,0.00277149,0.0077910717,0.007265693,0.0052299257,0.0017414637],"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.002301493,0.0005175834,0.001999141,0.0009957452,0.0003818343,0.00029239824,0.0007019124,0.45217404,0.019958187,0.37277505,0.023924092,0.12397847],"study_design_scores_gemma":[0.0001002497,0.0002028068,0.00027708025,0.000040218434,0.00007408075,0.00010871183,0.0001028941,0.7820788,0.0023814482,0.21222529,0.0023716558,0.000036773108],"about_ca_topic_score_codex":0.002108656,"about_ca_topic_score_gemma":0.0018635197,"teacher_disagreement_score":0.008707983,"about_ca_system_score_codex":0.0030643793,"about_ca_system_score_gemma":0.003672347,"threshold_uncertainty_score":0.029131055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12606472,0.0015723908,0.8545319,0.0008741213,0.000101976315,0.00008753188,0.00012934806,0.00019466598,0.016443284],"genre_scores_gemma":[0.6058856,0.001825883,0.38336837,0.00024431164,0.0003574525,0.0002522398,0.00037218397,0.00026110356,0.007432748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872583,0.0005471284,0.00005761743,0.00023028672,0.00022744952,0.00021174196],"domain_scores_gemma":[0.9946338,0.0041591246,0.00035449857,0.00048144264,0.00015798991,0.0002131964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019614897,0.0011168327,0.0017803904,0.0014142347,0.0012697551,0.0028539614,0.0023319875,0.0023048085,0.003498724],"category_scores_gemma":[0.0094897915,0.0015149458,0.002464234,0.0025044302,0.002288783,0.006321055,0.002785797,0.0032055064,0.00041235212],"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.00026484212,0.00032577693,0.0013814174,0.0004778255,0.00012071555,0.0002852805,0.0007198002,0.51110876,0.0032075297,0.39980638,0.005787694,0.076514035],"study_design_scores_gemma":[0.000027801521,0.000052708026,0.0002593826,0.00004094318,0.000038608054,0.00012068119,0.00008695598,0.71375483,0.0007941158,0.28325808,0.0015468714,0.000018977913],"about_ca_topic_score_codex":0.0020709056,"about_ca_topic_score_gemma":0.002086551,"teacher_disagreement_score":0.003498724,"about_ca_system_score_codex":0.001479778,"about_ca_system_score_gemma":0.00090242986,"threshold_uncertainty_score":0.011704445},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34198475,0.0003964952,0.6403514,0.0015366921,0.00006442126,0.0002467483,0.0001385057,0.00025340106,0.015027638],"genre_scores_gemma":[0.94179696,0.00038389317,0.04686197,0.00021570118,0.00006005936,0.0005122851,0.00010681914,0.00012625201,0.009936106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963594,0.0019907563,0.00016999665,0.00045322278,0.00051662273,0.0005099561],"domain_scores_gemma":[0.9540555,0.038660854,0.002665373,0.0011615847,0.0019209699,0.0015357534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008524915,0.0014518601,0.002786507,0.0021722834,0.0015035312,0.005019359,0.0030529813,0.0033365854,0.0058836564],"category_scores_gemma":[0.05159588,0.0012084225,0.0016089297,0.0013501644,0.0051263743,0.006364303,0.004896922,0.0032836352,0.0006955303],"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.0005664413,0.00026386773,0.0015798301,0.00023301181,0.00015623734,0.00023305928,0.0009790225,0.28981042,0.0021873023,0.69013137,0.0015480653,0.012311406],"study_design_scores_gemma":[0.00013058307,0.00009086968,0.0002429615,0.000027749178,0.000022138282,0.000046973157,0.00018495861,0.5492264,0.00041240596,0.44919264,0.00039705727,0.000025352298],"about_ca_topic_score_codex":0.0022078739,"about_ca_topic_score_gemma":0.0013742554,"teacher_disagreement_score":0.008524915,"about_ca_system_score_codex":0.0025263052,"about_ca_system_score_gemma":0.0018678796,"threshold_uncertainty_score":0.045084596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40294525,0.0004209053,0.581644,0.000168851,0.000056894984,0.00006056035,0.0004224479,0.00034577784,0.013935295],"genre_scores_gemma":[0.7974419,0.0005047811,0.18070439,0.00012838228,0.00010136831,0.00023926298,0.0015986379,0.00027579017,0.019005477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992022,0.00013402793,0.00008813009,0.00021264552,0.00026507178,0.00009798588],"domain_scores_gemma":[0.9985719,0.0005328266,0.0002732385,0.00021453098,0.00019559084,0.00021192648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006742763,0.00083244505,0.0006577489,0.0019667982,0.0007211473,0.0012413777,0.0010981063,0.00079952343,0.0075130477],"category_scores_gemma":[0.003843504,0.00039292662,0.00085348554,0.0016496292,0.0011597616,0.0034862857,0.0024896846,0.0011269925,0.0012032929],"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.00013694083,0.000052477542,0.0015169993,0.00016368211,0.000050579856,0.00032980368,0.0006171695,0.052084137,0.013385852,0.88275975,0.0013475132,0.047555096],"study_design_scores_gemma":[0.000016640955,0.0001836607,0.0008752742,0.00004285842,0.000016847633,0.00040103248,0.00023959513,0.092721626,0.005647359,0.89237285,0.00745493,0.000027374563],"about_ca_topic_score_codex":0.0003594759,"about_ca_topic_score_gemma":0.0004230473,"teacher_disagreement_score":0.0075130477,"about_ca_system_score_codex":0.00056526973,"about_ca_system_score_gemma":0.00019050394,"threshold_uncertainty_score":0.02513367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16723044,0.0073287515,0.7647532,0.011285871,0.00057757756,0.00037558982,0.0024430554,0.0015670322,0.044438463],"genre_scores_gemma":[0.61755335,0.007798628,0.3406321,0.001994906,0.0016804032,0.0007474419,0.006720613,0.0010846007,0.021787936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951568,0.0014480265,0.00029865562,0.00095455843,0.0013570699,0.0007848914],"domain_scores_gemma":[0.9768372,0.018111898,0.0012209408,0.0025309462,0.0006650725,0.000633951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033241576,0.0030296133,0.0036771514,0.002816103,0.00318263,0.0088481875,0.0069729057,0.0043551456,0.01592575],"category_scores_gemma":[0.02500708,0.0025473854,0.0037469189,0.0069112345,0.004709749,0.018906677,0.004863723,0.009685957,0.0023633083],"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.002636412,0.0016510136,0.005567324,0.0024622998,0.0005791768,0.0005018717,0.0017176939,0.47610727,0.0054563577,0.29574788,0.046844933,0.16072778],"study_design_scores_gemma":[0.00035368814,0.0001807574,0.001313787,0.00014701077,0.0002468955,0.00040237128,0.00063815375,0.478265,0.0027130072,0.50828743,0.0073792804,0.000072584655],"about_ca_topic_score_codex":0.0031797725,"about_ca_topic_score_gemma":0.004277278,"teacher_disagreement_score":0.01592575,"about_ca_system_score_codex":0.003707545,"about_ca_system_score_gemma":0.0025859224,"threshold_uncertainty_score":0.053276896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24697725,0.004967952,0.5939151,0.017447574,0.00077769003,0.00016483139,0.0002251131,0.00046136102,0.13506316],"genre_scores_gemma":[0.9262913,0.0019408232,0.0437576,0.0011688179,0.00047299245,0.00024800518,0.00012319439,0.00012600128,0.02587136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973666,0.0011649708,0.0001349573,0.00041419244,0.000551662,0.0003676509],"domain_scores_gemma":[0.9902442,0.0072130193,0.00061000156,0.0011871528,0.00042778457,0.00031791386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038665964,0.00093889266,0.0014210255,0.0025894186,0.0037181813,0.0037566307,0.0021158585,0.0031901528,0.005742784],"category_scores_gemma":[0.01532095,0.0007409023,0.001071072,0.002583401,0.009070137,0.01173452,0.005753328,0.006342749,0.00079356116],"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.000023461236,0.000007195413,0.000040617484,0.000013739689,0.0000027668766,0.000015125584,0.00013013271,0.0009250155,0.00011772242,0.9960796,0.000557147,0.0020875337],"study_design_scores_gemma":[0.000011905784,0.000007227472,0.000029537327,0.000011094776,0.0000041799967,0.000022769626,0.000026648662,0.0061747697,0.00019402786,0.9924172,0.0010913694,0.000009340448],"about_ca_topic_score_codex":0.00096087955,"about_ca_topic_score_gemma":0.00084295514,"teacher_disagreement_score":0.005742784,"about_ca_system_score_codex":0.0025424915,"about_ca_system_score_gemma":0.0015718454,"threshold_uncertainty_score":0.020448744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17833814,0.00067887007,0.77853745,0.001200541,0.00014422789,0.00046000574,0.0039876737,0.009357906,0.02729521],"genre_scores_gemma":[0.48277277,0.00047440102,0.49652675,0.00031297645,0.00003703375,0.00025317798,0.006372793,0.0014222994,0.011827837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935955,0.000090860376,0.000044923374,0.00012475897,0.00023865851,0.0001413433],"domain_scores_gemma":[0.99808145,0.0008739637,0.00017057572,0.0005845637,0.00020265198,0.00008683248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003962319,0.0008845192,0.00067693705,0.0010758743,0.0007286873,0.0015562774,0.002186035,0.0009815772,0.011669041],"category_scores_gemma":[0.00350358,0.0006154094,0.0008711959,0.0021444326,0.0007499913,0.00401529,0.002722259,0.0013748661,0.002157227],"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.0013321056,0.00062389474,0.003851882,0.0014176418,0.00009920628,0.0005624893,0.00089380174,0.26403007,0.037364237,0.09657432,0.04603074,0.54721963],"study_design_scores_gemma":[0.0002296549,0.00020694059,0.0007787142,0.00010865845,0.00007974459,0.00024365266,0.0005056719,0.7901077,0.027801726,0.16838117,0.01151548,0.000040855673],"about_ca_topic_score_codex":0.0037048196,"about_ca_topic_score_gemma":0.010007498,"teacher_disagreement_score":0.011669041,"about_ca_system_score_codex":0.00089920516,"about_ca_system_score_gemma":0.0014113864,"threshold_uncertainty_score":0.03903681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1232072,0.00061245216,0.8652118,0.0009323394,0.000271817,0.00013889001,0.00029756885,0.00080745516,0.008520513],"genre_scores_gemma":[0.79741895,0.00061448535,0.1670326,0.00036134585,0.00018880528,0.00032299038,0.00054351735,0.0005375562,0.03297983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852544,0.00042907003,0.000092402406,0.00031904664,0.00030549482,0.00032869968],"domain_scores_gemma":[0.9933264,0.0030572554,0.00069430476,0.0012457124,0.00086085324,0.0008154823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019825385,0.0008272183,0.0019203081,0.0010807995,0.0016233905,0.002864097,0.003939999,0.001759518,0.009300851],"category_scores_gemma":[0.0134088,0.0010565539,0.0010042284,0.0019279867,0.0021458012,0.0037186441,0.0041324724,0.002323923,0.001242441],"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.0016635376,0.00018086543,0.0017715512,0.00023079792,0.000081306745,0.00014924139,0.00031896998,0.432169,0.0048571695,0.5120574,0.008051641,0.038468424],"study_design_scores_gemma":[0.0001282399,0.00013099813,0.0003724494,0.00002949788,0.000038868377,0.000058139274,0.00010631431,0.6670662,0.0024054032,0.32661596,0.003017676,0.000030325884],"about_ca_topic_score_codex":0.004973599,"about_ca_topic_score_gemma":0.0042229826,"teacher_disagreement_score":0.009300851,"about_ca_system_score_codex":0.0017678561,"about_ca_system_score_gemma":0.001438721,"threshold_uncertainty_score":0.031114459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06610137,0.0076575126,0.87186074,0.0031344327,0.0010853849,0.00031347448,0.0008960299,0.0018511803,0.047099862],"genre_scores_gemma":[0.43428132,0.0022918475,0.51102644,0.0016530614,0.0012220348,0.00040298735,0.0020852457,0.00061441207,0.04642267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970017,0.0011620029,0.00016120824,0.0005762121,0.00086706,0.00023184539],"domain_scores_gemma":[0.9927908,0.0036770655,0.00029604422,0.0021356803,0.0008325716,0.00026780766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024947016,0.00087563036,0.0017272523,0.0027813073,0.0013894466,0.002537629,0.0023974276,0.0023494756,0.019022664],"category_scores_gemma":[0.01748041,0.0006945623,0.0009766537,0.0039931354,0.0014761419,0.0043351785,0.0031867658,0.002349716,0.005372943],"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.0011258947,0.0003798027,0.0022813703,0.0004833015,0.00016957261,0.00035830543,0.00022652901,0.050155655,0.0062324894,0.2739357,0.041461725,0.6231896],"study_design_scores_gemma":[0.0002615191,0.00047188418,0.0006841909,0.00018612678,0.0001426659,0.0014439014,0.00009642189,0.507667,0.010428818,0.44459432,0.033958055,0.00006508553],"about_ca_topic_score_codex":0.0006359945,"about_ca_topic_score_gemma":0.0016475485,"teacher_disagreement_score":0.019022664,"about_ca_system_score_codex":0.0009245441,"about_ca_system_score_gemma":0.002213795,"threshold_uncertainty_score":0.0636372},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011578252,0.0023762998,0.9607171,0.001620342,0.00073201227,0.00018848835,0.0023305514,0.0026819687,0.017775053],"genre_scores_gemma":[0.13532904,0.0024239253,0.8368814,0.0008896269,0.0009236935,0.0006851779,0.0052001835,0.0015811443,0.016085776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779284,0.00054660323,0.00018975214,0.00042754703,0.00090132176,0.00014191357],"domain_scores_gemma":[0.99264824,0.0034942378,0.00048096522,0.0023910135,0.00074535346,0.00024013116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024344479,0.0014324663,0.0015645684,0.0033794732,0.0014213292,0.0035411776,0.0027935263,0.0016214201,0.015518109],"category_scores_gemma":[0.021912768,0.0008359194,0.0011554445,0.0063555194,0.0018966971,0.008948148,0.004381355,0.005354408,0.0046427827],"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.0005043001,0.0002878429,0.0009655351,0.00057718414,0.000057343874,0.00016106461,0.0003428896,0.037039697,0.0032870423,0.5527117,0.054176327,0.3498889],"study_design_scores_gemma":[0.000068297784,0.00009398731,0.00020134133,0.00012316096,0.000031232164,0.00021484795,0.0000656104,0.09429734,0.0022013339,0.8798495,0.02281783,0.00003567778],"about_ca_topic_score_codex":0.0014593996,"about_ca_topic_score_gemma":0.0029176108,"teacher_disagreement_score":0.015518109,"about_ca_system_score_codex":0.0017713761,"about_ca_system_score_gemma":0.002274591,"threshold_uncertainty_score":0.0519132},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6474969,0.0020547784,0.28604183,0.0036216856,0.00022809346,0.000058567683,0.00084414665,0.0005469356,0.05910713],"genre_scores_gemma":[0.95237374,0.0006210469,0.034126036,0.00038377085,0.00030533466,0.000070688315,0.00032978045,0.00016563658,0.011624103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881065,0.0003426204,0.000071067545,0.00028546606,0.00027892957,0.00021116546],"domain_scores_gemma":[0.9919911,0.0055697067,0.0006854934,0.0008872331,0.00051771593,0.0003487282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009821338,0.0003315709,0.0006310314,0.0018742533,0.0016990361,0.003111483,0.0009102903,0.00070089113,0.006755355],"category_scores_gemma":[0.010964209,0.00038059155,0.0005086418,0.002235546,0.0027251304,0.004183023,0.002923764,0.0019920736,0.00093147706],"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.00025406067,0.000043996675,0.0046049,0.00008354128,0.000017781147,0.00012737467,0.00097413885,0.006715987,0.0026863536,0.92454237,0.004632705,0.05531673],"study_design_scores_gemma":[0.000018181909,0.00002427622,0.00096649857,0.000034308825,0.000019373876,0.0002629554,0.00050991576,0.026127743,0.002987308,0.96351886,0.00551611,0.00001446546],"about_ca_topic_score_codex":0.00054318795,"about_ca_topic_score_gemma":0.0006548526,"teacher_disagreement_score":0.006755355,"about_ca_system_score_codex":0.0006782464,"about_ca_system_score_gemma":0.00037232222,"threshold_uncertainty_score":0.022598922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082977526,0.0015114371,0.86052895,0.0040065236,0.0002084263,0.00030641444,0.00025941172,0.000445702,0.04975558],"genre_scores_gemma":[0.932991,0.0010678105,0.053158216,0.00039837364,0.0003405701,0.0006881871,0.00012221749,0.00009383698,0.011139774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934524,0.0036427416,0.00030004978,0.0007306096,0.0010529993,0.0008212122],"domain_scores_gemma":[0.9674384,0.025706055,0.0021194136,0.0022947828,0.0012176224,0.00122381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060951468,0.0013564146,0.0021335618,0.0022557976,0.0020569214,0.007630932,0.0035591826,0.0043901517,0.010310583],"category_scores_gemma":[0.031042209,0.00091349724,0.0016987734,0.0021031378,0.005987679,0.009065051,0.0037217848,0.0034672732,0.0010338579],"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.00003847191,0.000045748173,0.00020618795,0.00008245822,0.000037599064,0.000040438976,0.00014653607,0.009629308,0.00033170287,0.9815701,0.0014101842,0.0064611537],"study_design_scores_gemma":[0.000048725822,0.000015178208,0.00006170851,0.000012607403,0.000015929882,0.000028530529,0.00003057465,0.026709307,0.00012758953,0.9716607,0.001279393,0.000009783968],"about_ca_topic_score_codex":0.0015663838,"about_ca_topic_score_gemma":0.0015840817,"teacher_disagreement_score":0.010310583,"about_ca_system_score_codex":0.0030989028,"about_ca_system_score_gemma":0.002325419,"threshold_uncertainty_score":0.034492373},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13518733,0.00076838245,0.8445308,0.001362303,0.000077123645,0.00009538133,0.000092442344,0.00020591858,0.01768032],"genre_scores_gemma":[0.7567222,0.0007671335,0.23234756,0.00035692324,0.000100785255,0.00037910216,0.00022684381,0.00023368039,0.008865685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992361,0.00041973704,0.000027127138,0.000108215885,0.00013960052,0.00006921702],"domain_scores_gemma":[0.9967182,0.0025529135,0.00019941252,0.00028303068,0.00013296324,0.00011349589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018021154,0.00088854635,0.0013419931,0.0006996798,0.0010980174,0.0016180112,0.0021571612,0.0026898575,0.003393363],"category_scores_gemma":[0.0076414864,0.0008352029,0.001243776,0.001012959,0.0020686619,0.003134733,0.0014454693,0.0017566035,0.00037857456],"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.00008054399,0.0000715124,0.00037033102,0.000088249275,0.00002042341,0.00003526904,0.00007766625,0.5181649,0.00082732836,0.46544376,0.0011255142,0.013694536],"study_design_scores_gemma":[0.000022689648,0.000021162858,0.000044320244,0.000008692163,0.000006506759,0.000014345927,0.000012629992,0.7588874,0.00030827802,0.24024968,0.00041649176,0.000007805163],"about_ca_topic_score_codex":0.0017899777,"about_ca_topic_score_gemma":0.0016404322,"teacher_disagreement_score":0.003393363,"about_ca_system_score_codex":0.0018711587,"about_ca_system_score_gemma":0.0014892926,"threshold_uncertainty_score":0.01357621},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06579012,0.0019757496,0.90530163,0.0013246567,0.00051273755,0.00016706873,0.001344242,0.0077358405,0.015847927],"genre_scores_gemma":[0.44788602,0.0007743083,0.5280111,0.00049848424,0.0004099301,0.00029944483,0.0023607672,0.001016516,0.018743498],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680495,0.0004970709,0.00038363566,0.00065267057,0.0012054818,0.0004562693],"domain_scores_gemma":[0.9862336,0.0044931923,0.0005922182,0.0070834337,0.0011537899,0.0004437382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017295139,0.00087355374,0.001513171,0.00199646,0.0014371043,0.0035423976,0.0035980958,0.0017036127,0.013530742],"category_scores_gemma":[0.01610487,0.00062094827,0.00085403473,0.0046951245,0.0018462894,0.009369676,0.0041596675,0.002195672,0.0048297513],"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.0023236866,0.00041670422,0.0013922567,0.000647738,0.000086299035,0.00034813487,0.00064460386,0.08039921,0.024181362,0.1325189,0.038439784,0.7186014],"study_design_scores_gemma":[0.0002836962,0.00049473107,0.0006369027,0.00014681839,0.00008994826,0.0010686278,0.0002934279,0.5517791,0.027310362,0.39225227,0.025536422,0.00010768786],"about_ca_topic_score_codex":0.0016560828,"about_ca_topic_score_gemma":0.002589064,"teacher_disagreement_score":0.013530742,"about_ca_system_score_codex":0.0013432296,"about_ca_system_score_gemma":0.0025060163,"threshold_uncertainty_score":0.04526478},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8437573,0.000247046,0.15218326,0.0014241533,0.00013548085,0.00004990112,0.00024107385,0.00052095496,0.0014408273],"genre_scores_gemma":[0.98735994,0.00004111667,0.011859402,0.00005264176,0.000020885916,0.000011983721,0.00012074379,0.000034252524,0.0004992187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999084,0.00019352548,0.00003409142,0.00029308663,0.00020723442,0.00018814571],"domain_scores_gemma":[0.99382436,0.0033365954,0.001177828,0.0006450144,0.00057387975,0.0004422467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009610906,0.0007150447,0.00093421363,0.000979767,0.0009073755,0.0010888666,0.0025750704,0.0028462356,0.0010162654],"category_scores_gemma":[0.011482044,0.00071805133,0.00045503472,0.0008588928,0.0015732776,0.00253856,0.0012348786,0.0012285443,0.00015968093],"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.0011931146,0.00024843964,0.04075584,0.00018408214,0.00018741412,0.0028516976,0.0007219434,0.8913712,0.0087862685,0.005927975,0.0035101532,0.044261813],"study_design_scores_gemma":[0.000021157946,0.00008565619,0.0038767697,0.000009710501,0.000040101746,0.00021399543,0.00034769587,0.9859768,0.0023935663,0.006669696,0.00035120104,0.000013572721],"about_ca_topic_score_codex":0.007383296,"about_ca_topic_score_gemma":0.008394386,"teacher_disagreement_score":0.007383296,"about_ca_system_score_codex":0.0007602601,"about_ca_system_score_gemma":0.00065126293,"threshold_uncertainty_score":0.014680624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2076944,0.0011805745,0.65869343,0.0078408,0.0011028444,0.00016762434,0.0009413784,0.00056083465,0.1218181],"genre_scores_gemma":[0.8249079,0.0009231127,0.12590903,0.0011221638,0.00047173616,0.0002731741,0.0013859465,0.0006893003,0.044317678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977436,0.0007443548,0.00010689218,0.0003416134,0.000828538,0.00023501024],"domain_scores_gemma":[0.99273735,0.0043047033,0.0008213877,0.0009025335,0.0006729837,0.0005609181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018996061,0.00089592417,0.0010342199,0.0012673144,0.001846604,0.002517459,0.002115323,0.003189148,0.016628057],"category_scores_gemma":[0.024522515,0.0007172005,0.0010280841,0.0019931023,0.002427877,0.005339709,0.0048915804,0.007490731,0.0013386677],"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.00009146491,0.00005366669,0.00058283756,0.00011371601,0.000022997448,0.00018233861,0.000113060385,0.020926049,0.00047974702,0.9479165,0.0074653486,0.022052193],"study_design_scores_gemma":[0.000022303058,0.00003079675,0.0001625611,0.000021212874,0.000008268415,0.0001524924,0.00006355441,0.05594154,0.00025723243,0.93879527,0.004535277,0.000009505803],"about_ca_topic_score_codex":0.0011110372,"about_ca_topic_score_gemma":0.000964323,"teacher_disagreement_score":0.016628057,"about_ca_system_score_codex":0.0009917865,"about_ca_system_score_gemma":0.0013706426,"threshold_uncertainty_score":0.055626392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026866747,0.0011835787,0.9498455,0.0011606896,0.00019423374,0.00030943562,0.00861269,0.006812351,0.005014815],"genre_scores_gemma":[0.3265729,0.0012280307,0.6377649,0.0004127851,0.00025374882,0.0009043608,0.02530423,0.0018339533,0.0057251444],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965064,0.00038158623,0.0005424867,0.00064858893,0.001626606,0.00029422765],"domain_scores_gemma":[0.98661405,0.005005841,0.00085690874,0.005342274,0.0017573129,0.00042366344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018165808,0.0010077218,0.002711882,0.0034044904,0.0017561903,0.007361556,0.004398275,0.0021661527,0.011795673],"category_scores_gemma":[0.023789367,0.0011071238,0.0015671074,0.007953875,0.001409916,0.014093219,0.006407615,0.0030427896,0.0037129002],"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.0013276351,0.00047447105,0.0048602005,0.0012603449,0.00015192581,0.00028454064,0.0014367958,0.069173925,0.008429994,0.3741561,0.05330155,0.48514256],"study_design_scores_gemma":[0.00025805752,0.00016518965,0.00084012485,0.00017948533,0.00008903668,0.00047817905,0.0007016373,0.3469484,0.013307379,0.58553857,0.051398043,0.00009593214],"about_ca_topic_score_codex":0.0025101951,"about_ca_topic_score_gemma":0.0045663,"teacher_disagreement_score":0.011795673,"about_ca_system_score_codex":0.0020039883,"about_ca_system_score_gemma":0.0023312755,"threshold_uncertainty_score":0.03946042},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67603034,0.005344245,0.19803423,0.0058489144,0.0007713372,0.0001097591,0.0012124681,0.00050131115,0.11214745],"genre_scores_gemma":[0.8970302,0.005334577,0.060391344,0.0008419383,0.0014134534,0.00021334889,0.0013665459,0.0008134072,0.032595217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901366,0.00027774708,0.00004126877,0.00018634184,0.00027428902,0.00020660456],"domain_scores_gemma":[0.99157715,0.005304288,0.0010166548,0.0006570646,0.0005752695,0.0008694822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015653126,0.0013622125,0.0012706878,0.003665502,0.0015451317,0.0033437063,0.002785765,0.0017979607,0.017017337],"category_scores_gemma":[0.015181774,0.0014302179,0.00092948717,0.0033086608,0.004413496,0.0104185445,0.004619847,0.0044976985,0.0019682287],"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.00042767805,0.00007200852,0.0043207696,0.00034385532,0.0000728124,0.0003335948,0.001053506,0.030530207,0.004835556,0.9011323,0.009743069,0.047134697],"study_design_scores_gemma":[0.000048092694,0.000054377688,0.0021528453,0.000101386584,0.00006504335,0.00027546982,0.0004910573,0.039640572,0.0013291901,0.94892937,0.0068781814,0.000034377117],"about_ca_topic_score_codex":0.0015007543,"about_ca_topic_score_gemma":0.0015782613,"teacher_disagreement_score":0.017017337,"about_ca_system_score_codex":0.0016421182,"about_ca_system_score_gemma":0.00071141846,"threshold_uncertainty_score":0.056928635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46459165,0.0016768336,0.4932323,0.0017443387,0.00021558418,0.00035394685,0.0023644732,0.0012786316,0.034542102],"genre_scores_gemma":[0.8729566,0.0008559384,0.103902474,0.00017207352,0.00007851473,0.00024690691,0.0012176597,0.00068081485,0.019889107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994388,0.00014173033,0.00002080548,0.00008784355,0.000069642636,0.00024102429],"domain_scores_gemma":[0.99729365,0.0015414642,0.00025068273,0.0001897227,0.00028002722,0.0004443989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006259776,0.0013510359,0.0012880781,0.00074548816,0.00080358575,0.0015946666,0.0022430846,0.001134845,0.01140038],"category_scores_gemma":[0.0044496804,0.00070179236,0.0006296004,0.0020072698,0.0006422982,0.0021504364,0.0013954047,0.0014042886,0.0012031163],"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.0007568704,0.000209041,0.0012423877,0.00050021405,0.00007852401,0.00014121561,0.00017643438,0.90350264,0.005374052,0.03359095,0.009570562,0.04485713],"study_design_scores_gemma":[0.000054860924,0.0001856362,0.0005747252,0.000034164423,0.000032138087,0.00006626118,0.00014388835,0.95543134,0.0017533479,0.039837416,0.0018701983,0.000016001826],"about_ca_topic_score_codex":0.006830978,"about_ca_topic_score_gemma":0.010349439,"teacher_disagreement_score":0.01140038,"about_ca_system_score_codex":0.0022400483,"about_ca_system_score_gemma":0.0022544265,"threshold_uncertainty_score":0.038138032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079743296,0.0006928079,0.8851888,0.0019683486,0.00017727976,0.00032812398,0.0010020992,0.0031155625,0.027783621],"genre_scores_gemma":[0.5972154,0.0006728926,0.3791791,0.0010264223,0.00041964423,0.00061458984,0.0031691259,0.0017076923,0.015995134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947299,0.0015999558,0.00031046153,0.0014032667,0.0013027672,0.00065374014],"domain_scores_gemma":[0.9799691,0.012507157,0.0010571847,0.0042223064,0.0014024079,0.0008417161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026567047,0.0014954695,0.0016916003,0.0031553484,0.0020905123,0.005807918,0.00519842,0.0030045772,0.013493325],"category_scores_gemma":[0.022579348,0.0014775074,0.0017661268,0.005830622,0.0020206142,0.016092068,0.006673775,0.005891655,0.002625477],"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.0013787997,0.0011963972,0.0027854247,0.00064598024,0.00014334194,0.00015051704,0.00064828165,0.06629988,0.0075433063,0.6334519,0.021113487,0.26464272],"study_design_scores_gemma":[0.00013143732,0.00012227983,0.00042145542,0.00007575689,0.000087034314,0.000132641,0.00016178789,0.26434144,0.005195877,0.7224709,0.0068252482,0.00003419473],"about_ca_topic_score_codex":0.0007579022,"about_ca_topic_score_gemma":0.0018139094,"teacher_disagreement_score":0.013493325,"about_ca_system_score_codex":0.0029483302,"about_ca_system_score_gemma":0.0020943277,"threshold_uncertainty_score":0.04513967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04698035,0.0010156026,0.9284277,0.0010513461,0.00043989203,0.0002109997,0.001222519,0.00982369,0.010827904],"genre_scores_gemma":[0.37962124,0.00042572658,0.6026663,0.00046548742,0.0003950356,0.0005351987,0.002983242,0.0017858701,0.011121928],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959266,0.0007074785,0.00029626247,0.00059982255,0.0019905542,0.00047935674],"domain_scores_gemma":[0.98997784,0.0034698795,0.0003931688,0.004870722,0.0010216244,0.0002666409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015841745,0.000953782,0.0017122631,0.0018655794,0.00170161,0.0035191635,0.0023505543,0.0017480414,0.008998745],"category_scores_gemma":[0.01170055,0.0008095136,0.001027455,0.0040093926,0.0018198738,0.007209129,0.0061037233,0.0021724487,0.0032347746],"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.0025118862,0.00059942383,0.0027113226,0.00068756466,0.00015728053,0.00042001434,0.0007048398,0.056468714,0.036808863,0.2742059,0.047614135,0.57711],"study_design_scores_gemma":[0.0004122015,0.0002829052,0.0007356364,0.00008057974,0.0001153546,0.0006297652,0.0001942958,0.51368564,0.06659883,0.39512718,0.022034818,0.000102814],"about_ca_topic_score_codex":0.0009932909,"about_ca_topic_score_gemma":0.0018200176,"teacher_disagreement_score":0.008998745,"about_ca_system_score_codex":0.0017079001,"about_ca_system_score_gemma":0.0027569158,"threshold_uncertainty_score":0.030103803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018635133,0.0005705646,0.9760485,0.0005633513,0.00011055173,0.00014929673,0.000115206385,0.00039464436,0.0034127266],"genre_scores_gemma":[0.35318276,0.0008220695,0.63910323,0.00021347673,0.00025952095,0.0006614588,0.00036596102,0.00025934837,0.005132297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914384,0.00028369864,0.000047804937,0.00015921293,0.00019756422,0.00016784242],"domain_scores_gemma":[0.9948631,0.0038939503,0.00032672976,0.00035044496,0.00037441432,0.00019136255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022564104,0.0012172473,0.0016488683,0.0015408885,0.001502066,0.001959741,0.0023852228,0.001686062,0.00421753],"category_scores_gemma":[0.008411657,0.0007037025,0.0009261139,0.0028231456,0.0011574692,0.002769157,0.0017714646,0.0018759541,0.0004309026],"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.00018427278,0.00011876119,0.0005472411,0.0001580365,0.00003201106,0.000032963482,0.00012384239,0.8786215,0.0007841712,0.040329587,0.004615804,0.07445181],"study_design_scores_gemma":[0.00002077271,0.000016144144,0.00005770919,0.0000067828896,0.000007074626,0.00000994572,0.000018594204,0.98300433,0.00024421245,0.016198887,0.0004120374,0.0000035705295],"about_ca_topic_score_codex":0.006644467,"about_ca_topic_score_gemma":0.005430401,"teacher_disagreement_score":0.006644467,"about_ca_system_score_codex":0.0025802942,"about_ca_system_score_gemma":0.0037001425,"threshold_uncertainty_score":0.018721461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18448184,0.00069147506,0.7945373,0.0010244265,0.00016224361,0.00013857066,0.00056882657,0.00031991003,0.018075401],"genre_scores_gemma":[0.72541374,0.00058043853,0.2590516,0.00017032571,0.000080694146,0.00020122474,0.0009317182,0.00033211618,0.013238214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917465,0.000284,0.000040656905,0.00011828319,0.00024991977,0.00013257869],"domain_scores_gemma":[0.9962991,0.0025270362,0.0004063878,0.00026455056,0.00031239528,0.00019054678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008739367,0.0006550964,0.0008780901,0.0008530307,0.0009531421,0.0014860259,0.0014588353,0.0016105988,0.004481323],"category_scores_gemma":[0.011195775,0.0006477149,0.0006605016,0.0014327528,0.0008715936,0.001883478,0.002496572,0.0019793448,0.00046863756],"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.00036212231,0.00009743379,0.0017805428,0.0002353873,0.00007720956,0.0005076352,0.00023740987,0.6743915,0.0018032657,0.26045573,0.0071259825,0.052925743],"study_design_scores_gemma":[0.000050442926,0.00004533086,0.0003417934,0.000030410141,0.000017343975,0.00015121835,0.000103247716,0.731882,0.0007822908,0.26353517,0.0030477836,0.000012926467],"about_ca_topic_score_codex":0.0032043532,"about_ca_topic_score_gemma":0.0031142014,"teacher_disagreement_score":0.004481323,"about_ca_system_score_codex":0.0006777062,"about_ca_system_score_gemma":0.0010959556,"threshold_uncertainty_score":0.014991522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14776178,0.0006377999,0.8423121,0.0014584044,0.000157394,0.00012884564,0.00022593583,0.00089143676,0.0064263893],"genre_scores_gemma":[0.86041373,0.00037584596,0.13309991,0.00023307904,0.00014853291,0.00021697175,0.00019129348,0.00015881185,0.0051618833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984182,0.0005474807,0.00008360444,0.0003851475,0.0002615173,0.0003041365],"domain_scores_gemma":[0.979471,0.015465412,0.00091687223,0.002625652,0.0010647149,0.00045630164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002388235,0.001005765,0.0015091577,0.0008667434,0.000990531,0.0013387755,0.0025997853,0.0018270531,0.0029385039],"category_scores_gemma":[0.0214901,0.00084371935,0.000591385,0.0011577014,0.001803782,0.0035377264,0.0026807294,0.0014480781,0.000493906],"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.0023370127,0.00018070577,0.0015054356,0.00048504863,0.00010039583,0.0002227489,0.0003469046,0.83012134,0.018354394,0.0615513,0.0052038697,0.07959083],"study_design_scores_gemma":[0.00017210969,0.00009152705,0.00023452922,0.00001898009,0.000044521807,0.00007830822,0.00005847957,0.9476047,0.0038031728,0.047177885,0.00070126314,0.000014431498],"about_ca_topic_score_codex":0.0019159775,"about_ca_topic_score_gemma":0.0027064262,"teacher_disagreement_score":0.0029385039,"about_ca_system_score_codex":0.0018788261,"about_ca_system_score_gemma":0.0015393081,"threshold_uncertainty_score":0.01363194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3912882,0.00025677553,0.5844516,0.00023702758,0.000107620894,0.0001327194,0.0003438506,0.0006366186,0.022545688],"genre_scores_gemma":[0.677891,0.00039700477,0.3011047,0.00016242507,0.000057305482,0.00016640933,0.0008980583,0.00047772581,0.018845327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960417,0.00007777829,0.000021363792,0.000077159995,0.00014710291,0.00007248752],"domain_scores_gemma":[0.9991437,0.0003553198,0.00010617626,0.00018731011,0.000098401724,0.00010912685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035777228,0.00075440673,0.0008484405,0.0011524996,0.00048880413,0.0010466699,0.0009885827,0.000914087,0.0070741735],"category_scores_gemma":[0.002430937,0.00063004467,0.0005524476,0.0009747443,0.00083597365,0.0016229346,0.003100615,0.0015168996,0.0015241904],"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.00058201735,0.00035700607,0.0036525934,0.00038694756,0.000113708134,0.00059958216,0.00076298614,0.14840414,0.053800408,0.55888975,0.010197291,0.22225358],"study_design_scores_gemma":[0.00011692331,0.00035847246,0.0010540966,0.000080820195,0.000057808746,0.00039117053,0.00045168618,0.35154969,0.028464705,0.6018904,0.015545935,0.00003834976],"about_ca_topic_score_codex":0.00041154787,"about_ca_topic_score_gemma":0.00087703444,"teacher_disagreement_score":0.0070741735,"about_ca_system_score_codex":0.00032512884,"about_ca_system_score_gemma":0.00025560329,"threshold_uncertainty_score":0.023665488},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087417595,0.00070942857,0.8974089,0.0011195642,0.00019962338,0.00025978283,0.00074858096,0.003015471,0.009121079],"genre_scores_gemma":[0.38714722,0.000448879,0.6013782,0.00025860767,0.00011867733,0.00031122562,0.0017314372,0.0009522668,0.0076534925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992372,0.00016307499,0.00003835985,0.00020895756,0.00020581021,0.00014666024],"domain_scores_gemma":[0.9961941,0.002040543,0.00027174092,0.0007193798,0.00045899954,0.0003152794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013018883,0.0017812736,0.0015834671,0.0019727845,0.0015580471,0.0025831515,0.0046217395,0.0020428852,0.010685266],"category_scores_gemma":[0.008580446,0.000917873,0.0013310785,0.0022960727,0.001477834,0.004169191,0.0045079775,0.0027145413,0.0026097526],"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.0011529252,0.00041889475,0.004034312,0.0008229175,0.00014743308,0.0002537525,0.00057582295,0.5099508,0.005340564,0.18217438,0.036638398,0.25848976],"study_design_scores_gemma":[0.00008746391,0.00003578837,0.00018003015,0.000027731354,0.000025560334,0.00006334949,0.00014370991,0.8703889,0.001961313,0.1250819,0.0019930361,0.000011205527],"about_ca_topic_score_codex":0.0060366257,"about_ca_topic_score_gemma":0.010990135,"teacher_disagreement_score":0.010685266,"about_ca_system_score_codex":0.0026178306,"about_ca_system_score_gemma":0.0019818395,"threshold_uncertainty_score":0.0357458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87298846,0.0019907244,0.07837225,0.012546569,0.00035344766,0.00007726934,0.0010030456,0.0006142163,0.032054037],"genre_scores_gemma":[0.99472517,0.00030657955,0.0024628956,0.00013088089,0.000101994694,0.000015783475,0.0001249503,0.000090484406,0.0020412165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943482,0.0021882355,0.00018605162,0.00089488,0.0009064186,0.0014761733],"domain_scores_gemma":[0.71307683,0.26119512,0.0077073937,0.0085994685,0.004145065,0.0052761617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075491555,0.0005763312,0.0017948236,0.0021772645,0.002478091,0.0052911504,0.0025734846,0.0030035388,0.011784805],"category_scores_gemma":[0.1186962,0.0006382959,0.0008126066,0.0021140974,0.0031288571,0.013066597,0.0024877058,0.0033191359,0.0007673315],"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.005365419,0.0012537483,0.022437552,0.0006541124,0.00033793756,0.00055619306,0.0012437982,0.56807655,0.0050925617,0.30065614,0.012337829,0.08198814],"study_design_scores_gemma":[0.00020700735,0.00034011147,0.0037171016,0.000051537885,0.00021857684,0.00030595134,0.00061195437,0.6887633,0.0034127515,0.30077535,0.0015293162,0.00006700085],"about_ca_topic_score_codex":0.0026439808,"about_ca_topic_score_gemma":0.0036505088,"teacher_disagreement_score":0.011784805,"about_ca_system_score_codex":0.0030367062,"about_ca_system_score_gemma":0.003405259,"threshold_uncertainty_score":0.039924204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012026405,0.001363696,0.9798052,0.0011177459,0.00019321096,0.00013203187,0.00058298325,0.00086218934,0.0039166193],"genre_scores_gemma":[0.18064003,0.0012451877,0.8039691,0.0005451791,0.0003671453,0.00058196095,0.002315996,0.00060839305,0.009726963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967181,0.0010511354,0.00019128362,0.0007539643,0.0008552966,0.0004302023],"domain_scores_gemma":[0.9926265,0.004008802,0.00051765644,0.0014413932,0.00097571086,0.0004298945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004506846,0.0025995036,0.0037071349,0.002684679,0.002601851,0.00490106,0.008025413,0.0040700315,0.010845026],"category_scores_gemma":[0.021380115,0.0016181768,0.0021908684,0.0071416185,0.0021512574,0.008668443,0.005207878,0.004837341,0.0029705088],"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.00094529684,0.00041390682,0.0012841001,0.0006050436,0.000219775,0.00006459673,0.00036620873,0.71852607,0.0012784878,0.10657747,0.022275435,0.14744362],"study_design_scores_gemma":[0.0000705381,0.000048968777,0.00018469419,0.000035656238,0.000037012996,0.00004999674,0.00010883289,0.8548905,0.0005094978,0.14135325,0.002691908,0.000019173924],"about_ca_topic_score_codex":0.009329375,"about_ca_topic_score_gemma":0.014841225,"teacher_disagreement_score":0.010845026,"about_ca_system_score_codex":0.005643246,"about_ca_system_score_gemma":0.004406438,"threshold_uncertainty_score":0.040944815},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7582271,0.0017060628,0.19249263,0.0039394153,0.00022888284,0.00013784386,0.004502709,0.0016634995,0.037101805],"genre_scores_gemma":[0.9049739,0.0005660516,0.08006571,0.0003234416,0.00015017769,0.00016421406,0.0025406855,0.0006037075,0.010612103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899477,0.00026423062,0.000037250287,0.00026608165,0.0002465314,0.00019117355],"domain_scores_gemma":[0.98831767,0.008988741,0.0005543348,0.00094976655,0.00062238576,0.0005671326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960376,0.00067160546,0.0010405445,0.0018647389,0.001486817,0.0026134553,0.001828876,0.0017824178,0.009811623],"category_scores_gemma":[0.013826501,0.0006673288,0.00084304035,0.0019375134,0.0013715907,0.0055653183,0.0012020544,0.0014665478,0.0012702879],"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.0034895488,0.00031234263,0.012278044,0.0020704549,0.000293728,0.0005530793,0.0010327719,0.41803905,0.042142652,0.30500057,0.059660234,0.15512753],"study_design_scores_gemma":[0.00019702205,0.00019596796,0.0035304374,0.000085673986,0.0001430003,0.00043383005,0.00023466525,0.69357896,0.00968038,0.2864246,0.005440325,0.000055121385],"about_ca_topic_score_codex":0.0023792586,"about_ca_topic_score_gemma":0.004079792,"teacher_disagreement_score":0.009811623,"about_ca_system_score_codex":0.0015582088,"about_ca_system_score_gemma":0.001976531,"threshold_uncertainty_score":0.032823086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17747019,0.004194499,0.77481484,0.005540106,0.00078707293,0.0002177191,0.001858619,0.0018939509,0.033223],"genre_scores_gemma":[0.7599674,0.001426367,0.20650348,0.0010959257,0.0010936533,0.00035656657,0.0022165,0.0004905817,0.026849575],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985953,0.00024605822,0.000071296374,0.0002238357,0.00071505184,0.00014838808],"domain_scores_gemma":[0.9964528,0.001257021,0.00019546805,0.0014365567,0.0005543215,0.000103733124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009283862,0.00042696728,0.00072744396,0.0013954598,0.0009792037,0.0020136368,0.0012374524,0.0007553855,0.006890499],"category_scores_gemma":[0.0081398515,0.00026353312,0.00036791735,0.0023187008,0.0013464045,0.004421935,0.002526263,0.0017378102,0.001350423],"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.0011997214,0.00018945463,0.0017239212,0.00022892859,0.000041294064,0.0002227583,0.00059911434,0.036112048,0.01656349,0.44357646,0.029521914,0.47002074],"study_design_scores_gemma":[0.0001151919,0.00018137236,0.0009550086,0.00010337116,0.000053758107,0.00077415997,0.00036788604,0.3316895,0.04326761,0.589389,0.033054136,0.00004901037],"about_ca_topic_score_codex":0.0007068565,"about_ca_topic_score_gemma":0.00080517505,"teacher_disagreement_score":0.006890499,"about_ca_system_score_codex":0.00083713385,"about_ca_system_score_gemma":0.0008432126,"threshold_uncertainty_score":0.023051023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005923948,0.00049633015,0.9885133,0.00057354313,0.00007289575,0.00007628409,0.00015976165,0.00022199503,0.0039619],"genre_scores_gemma":[0.32547107,0.0013472527,0.65796196,0.00064614863,0.00041792178,0.0009163091,0.0010783408,0.00054826756,0.011612744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975575,0.0014610066,0.00008321044,0.00027793052,0.00033759515,0.00028261414],"domain_scores_gemma":[0.98205644,0.015645774,0.00045988584,0.00060845626,0.000765184,0.00046435505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063310093,0.0027138484,0.0036606113,0.0019607476,0.001110924,0.0030166553,0.003952489,0.0036179654,0.012130445],"category_scores_gemma":[0.024056694,0.0019636191,0.0019183379,0.002738326,0.0023699845,0.004887882,0.003219372,0.0059176628,0.0014654009],"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.00017221509,0.00018027343,0.00051148905,0.00023524715,0.000060202106,0.0000481261,0.0000895554,0.91692626,0.00025863224,0.043287218,0.0059702606,0.032260504],"study_design_scores_gemma":[0.000023243394,0.000020995692,0.000029022782,0.00001409451,0.000012280609,0.000007909607,0.000015716576,0.9725409,0.000071114744,0.02686949,0.00039079072,0.0000044662397],"about_ca_topic_score_codex":0.00787468,"about_ca_topic_score_gemma":0.008352615,"teacher_disagreement_score":0.012130445,"about_ca_system_score_codex":0.0031305875,"about_ca_system_score_gemma":0.0032808196,"threshold_uncertainty_score":0.040580392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04562306,0.002420341,0.9070158,0.0033857648,0.0004117364,0.00014627054,0.00024306144,0.00047563526,0.040278316],"genre_scores_gemma":[0.72934467,0.0033713214,0.23905922,0.0021235745,0.0014299995,0.0005135432,0.0007340991,0.0009943307,0.0224292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911971,0.0040753833,0.0004907565,0.0013294491,0.001867633,0.0010397828],"domain_scores_gemma":[0.9478814,0.04249027,0.0017353661,0.0050340053,0.0016563851,0.0012025448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008168131,0.0017885758,0.00303192,0.0024372393,0.002152823,0.0057232147,0.005016626,0.004076202,0.0131184],"category_scores_gemma":[0.061214916,0.0013326203,0.0025173954,0.004441705,0.0069380533,0.022517594,0.0076485914,0.011670878,0.0015315303],"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.00026982985,0.0002273006,0.0005190869,0.00015231103,0.000033375527,0.000048925318,0.00031119844,0.020297606,0.00044648637,0.92776334,0.0031686255,0.04676192],"study_design_scores_gemma":[0.000049540224,0.000052842475,0.0001922439,0.000035901077,0.000020071286,0.00004322257,0.000037965303,0.057923008,0.00029864814,0.9395232,0.0018098507,0.000013476354],"about_ca_topic_score_codex":0.0018137842,"about_ca_topic_score_gemma":0.0010686462,"teacher_disagreement_score":0.0131184,"about_ca_system_score_codex":0.0028751162,"about_ca_system_score_gemma":0.0032458447,"threshold_uncertainty_score":0.04388535},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15465418,0.00040002182,0.82886976,0.0010327522,0.00013804768,0.00025599956,0.00017149911,0.0005736724,0.013904033],"genre_scores_gemma":[0.76683366,0.00016347216,0.21620432,0.00022077086,0.00006993494,0.00047816522,0.00021104974,0.00004625729,0.01577239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820435,0.0005807304,0.00008233162,0.0005410535,0.00024378773,0.00034772634],"domain_scores_gemma":[0.9975533,0.0013340011,0.0003800337,0.00027676453,0.00017188191,0.00028412006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014908853,0.0013360885,0.001665844,0.0007230431,0.0010173643,0.00228882,0.0032000213,0.003674303,0.005735808],"category_scores_gemma":[0.0068871067,0.0013606598,0.0011065713,0.0009647057,0.0022174614,0.0026338813,0.004161365,0.0017395597,0.0014602474],"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.0020470994,0.00020133458,0.0020030527,0.0002577986,0.0002050107,0.0007133147,0.00036718172,0.86657465,0.005601643,0.08601892,0.002635189,0.03337478],"study_design_scores_gemma":[0.00021211979,0.00025327608,0.0002011929,0.000022797412,0.0000240628,0.000118366486,0.000082836224,0.9720606,0.0011189932,0.024578523,0.0012979892,0.000029249855],"about_ca_topic_score_codex":0.002157385,"about_ca_topic_score_gemma":0.0014118442,"teacher_disagreement_score":0.005735808,"about_ca_system_score_codex":0.0014192403,"about_ca_system_score_gemma":0.0013143872,"threshold_uncertainty_score":0.019188225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3230057,0.0033645614,0.59695613,0.024712365,0.00030957165,0.00040930152,0.0035224506,0.00049306586,0.04722676],"genre_scores_gemma":[0.94467443,0.0020392502,0.037879832,0.0007787772,0.00072074897,0.00045566834,0.0010970768,0.00020425952,0.012149887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909793,0.003948297,0.00035704434,0.0012910366,0.0017719145,0.0016525212],"domain_scores_gemma":[0.90630436,0.08009946,0.0037622037,0.005390136,0.0024005945,0.0020432442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00871299,0.0014886836,0.003920562,0.002373849,0.002566846,0.008913839,0.005175587,0.0050195465,0.010613805],"category_scores_gemma":[0.04933189,0.001148657,0.002388685,0.003322502,0.0054945746,0.022150885,0.0049709803,0.0067931833,0.00084444805],"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.00049147423,0.0001698415,0.001380165,0.00027644925,0.00009475803,0.00017637678,0.00036504003,0.078942485,0.0005631245,0.89895487,0.006924426,0.0116610415],"study_design_scores_gemma":[0.00006142312,0.000030396965,0.00045258814,0.000036443605,0.000043226453,0.000111024085,0.00008025491,0.18325321,0.00031164824,0.8146654,0.0009158732,0.000038569724],"about_ca_topic_score_codex":0.0025655192,"about_ca_topic_score_gemma":0.0018552137,"teacher_disagreement_score":0.010613805,"about_ca_system_score_codex":0.0072094677,"about_ca_system_score_gemma":0.0051887454,"threshold_uncertainty_score":0.05230856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84394556,0.0011417868,0.109916046,0.0036600942,0.00016786612,0.00014890605,0.0020616148,0.00055705896,0.038400933],"genre_scores_gemma":[0.94348985,0.0012111476,0.036442835,0.0004074175,0.00018091028,0.00020133826,0.0016267044,0.00023230317,0.016207542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993426,0.00021518668,0.000030317618,0.00014867398,0.00009853195,0.00016471924],"domain_scores_gemma":[0.99016285,0.0068067163,0.0009201748,0.0008246065,0.00045652915,0.00082910206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006153745,0.0006205051,0.0013649955,0.0021760408,0.0018869665,0.0032399844,0.0019565085,0.0021095513,0.011470062],"category_scores_gemma":[0.009282851,0.0008034376,0.0009242134,0.0023740896,0.0018467797,0.006353933,0.0024353757,0.00193628,0.001064164],"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.00054053246,0.00016770468,0.004138659,0.0005305826,0.00013728,0.00034725433,0.00055659836,0.13521867,0.0043008826,0.8151775,0.018536884,0.020347495],"study_design_scores_gemma":[0.00010896615,0.000041047988,0.001501776,0.00004542264,0.00006306141,0.00020395842,0.00038924755,0.25587094,0.0012008596,0.73541725,0.005124801,0.000032705535],"about_ca_topic_score_codex":0.0039943685,"about_ca_topic_score_gemma":0.0046475288,"teacher_disagreement_score":0.011470062,"about_ca_system_score_codex":0.0019000535,"about_ca_system_score_gemma":0.00092379213,"threshold_uncertainty_score":0.038371146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13766961,0.0018008952,0.8155966,0.005432308,0.00026709802,0.00019975836,0.0015843132,0.0021059185,0.03534354],"genre_scores_gemma":[0.686157,0.0021942775,0.2879673,0.00067890034,0.00046591388,0.00043024,0.0037131498,0.0016563614,0.016736833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591064,0.0014683909,0.0002423565,0.0006630709,0.001281324,0.00043420788],"domain_scores_gemma":[0.9593671,0.031442583,0.0016800242,0.0052221618,0.0013300666,0.00095808454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030297716,0.0013628535,0.0022432168,0.0020130696,0.001865592,0.006866141,0.0050547533,0.0026580342,0.0220753],"category_scores_gemma":[0.039063558,0.0014773605,0.0022480558,0.0044782246,0.003400094,0.018750355,0.0060310317,0.005773583,0.0021013923],"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.00056752044,0.00022852639,0.003959327,0.0005154978,0.00013814836,0.00021630543,0.00066439906,0.27367836,0.0033507636,0.6001336,0.016794527,0.09975305],"study_design_scores_gemma":[0.000055767796,0.000030254914,0.00046997954,0.000029879458,0.000042488784,0.00007868406,0.00009336249,0.45493075,0.00082381937,0.5404222,0.003001549,0.000021244927],"about_ca_topic_score_codex":0.0057644974,"about_ca_topic_score_gemma":0.00685404,"teacher_disagreement_score":0.0220753,"about_ca_system_score_codex":0.0043086144,"about_ca_system_score_gemma":0.0024283933,"threshold_uncertainty_score":0.0738492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2193323,0.000583738,0.7693055,0.00079128565,0.00008369786,0.00007334466,0.00023055743,0.0006337153,0.008965953],"genre_scores_gemma":[0.87182564,0.0002542928,0.124898285,0.00009640505,0.00002976736,0.00016304023,0.00025010336,0.00010965363,0.0023728593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995664,0.00021267394,0.000023809824,0.00006999318,0.00007208316,0.00005507451],"domain_scores_gemma":[0.9950045,0.0042989454,0.00017039968,0.00025394757,0.00013456271,0.00013768903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092674064,0.0005458817,0.0010770813,0.0008056981,0.00082012196,0.0015983528,0.0013723321,0.0012732695,0.00395229],"category_scores_gemma":[0.0059318366,0.0007609874,0.001061842,0.00078438595,0.0022385386,0.0023412805,0.0023423666,0.0014856743,0.00034820684],"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.00010872259,0.0000378205,0.00064526155,0.00006653143,0.000026395463,0.00006663321,0.00008687767,0.9540993,0.0007003536,0.035105605,0.00050251844,0.008553983],"study_design_scores_gemma":[0.000012817186,0.000011137251,0.000034763925,0.000005949165,0.000002184678,0.000004826794,0.000013506672,0.97239155,0.00013845481,0.027190937,0.00019134313,0.0000024824108],"about_ca_topic_score_codex":0.003578726,"about_ca_topic_score_gemma":0.004364835,"teacher_disagreement_score":0.00395229,"about_ca_system_score_codex":0.0008949733,"about_ca_system_score_gemma":0.0008131895,"threshold_uncertainty_score":0.013221741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2838045,0.0009862488,0.6449873,0.005596589,0.0003081716,0.0004072904,0.0013149413,0.0023079636,0.06028698],"genre_scores_gemma":[0.67177206,0.0003203989,0.3135733,0.00076813536,0.00016917894,0.00025976973,0.0019784218,0.00044525595,0.010713474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866724,0.00028787254,0.000061206316,0.00048452045,0.00027491528,0.00022434036],"domain_scores_gemma":[0.9977737,0.0012550937,0.00018003653,0.0004521536,0.00018587359,0.00015304805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009050951,0.0010062357,0.0010680549,0.0008249831,0.0009050636,0.0020573433,0.0017969239,0.001881574,0.011965719],"category_scores_gemma":[0.0069175954,0.00061276625,0.0012605193,0.0010915622,0.0014269779,0.0035906737,0.0017601261,0.0023527516,0.0013772098],"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.000940795,0.0007496195,0.0038761434,0.00069725316,0.00022637573,0.00040787391,0.0005852718,0.5842525,0.0077895373,0.21521084,0.034108926,0.15115497],"study_design_scores_gemma":[0.00011070108,0.00012179326,0.00046192846,0.000055991542,0.000058718157,0.00013441397,0.00023497018,0.65893686,0.004069435,0.32892716,0.006860444,0.000027555257],"about_ca_topic_score_codex":0.0028413557,"about_ca_topic_score_gemma":0.0037810185,"teacher_disagreement_score":0.011965719,"about_ca_system_score_codex":0.0016136434,"about_ca_system_score_gemma":0.0013815068,"threshold_uncertainty_score":0.040029347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12687622,0.0017176417,0.7000688,0.004470019,0.0011601183,0.0005099005,0.0045244377,0.033600427,0.12707241],"genre_scores_gemma":[0.5940423,0.0004473539,0.3528437,0.0008537732,0.00035682492,0.00023094156,0.003553113,0.0020436908,0.0456283],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870884,0.00027532846,0.00004757977,0.0002399612,0.00041109353,0.00031713146],"domain_scores_gemma":[0.9972717,0.0011534027,0.00009301951,0.0010754182,0.00025559482,0.00015082683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740676,0.0011771467,0.0012809907,0.0010669947,0.0010137309,0.0016090139,0.001699918,0.0017121237,0.044095907],"category_scores_gemma":[0.0069903075,0.000573846,0.0009826289,0.0018196581,0.00069035194,0.002975495,0.0025608283,0.0019608599,0.007815674],"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.0017846376,0.0007255591,0.0029344312,0.00046270713,0.00011249757,0.00033451666,0.00017227179,0.117383115,0.0058615655,0.04368151,0.13508444,0.69146276],"study_design_scores_gemma":[0.0002131458,0.000120783836,0.00066316477,0.00006111403,0.00007445812,0.00026279566,0.00007463315,0.8028854,0.005805732,0.16455777,0.025256937,0.000023976801],"about_ca_topic_score_codex":0.0040182564,"about_ca_topic_score_gemma":0.008803337,"teacher_disagreement_score":0.044095907,"about_ca_system_score_codex":0.0009932994,"about_ca_system_score_gemma":0.0019820253,"threshold_uncertainty_score":0.14751548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3091219,0.0014523033,0.6416951,0.0005395732,0.00022400664,0.000108066124,0.00047932728,0.0013177264,0.04506194],"genre_scores_gemma":[0.76773113,0.00078747864,0.2176006,0.00020290483,0.00015906617,0.0001297978,0.0006813753,0.000728091,0.011979614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899775,0.00029302196,0.000046078934,0.00017383939,0.0003421604,0.0001471834],"domain_scores_gemma":[0.9976272,0.0013281185,0.00016194381,0.00046882613,0.00022261118,0.00019126043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114582,0.0008710236,0.0010531618,0.001643789,0.0005141532,0.0015246645,0.0017014336,0.0009540701,0.010283112],"category_scores_gemma":[0.0067270026,0.0003681977,0.0005528745,0.0013306217,0.00077933446,0.0026613418,0.0022031593,0.0016229941,0.0018759086],"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.00093883974,0.00043579505,0.0027846447,0.0006707864,0.00011610324,0.00038948655,0.00043124257,0.22404376,0.045319736,0.39047813,0.015194417,0.31919712],"study_design_scores_gemma":[0.000069807866,0.000284776,0.0011120897,0.000055085125,0.0000783131,0.00046815074,0.00013969983,0.7035237,0.015175111,0.27110288,0.007956635,0.000033715147],"about_ca_topic_score_codex":0.00046374532,"about_ca_topic_score_gemma":0.00082843355,"teacher_disagreement_score":0.010283112,"about_ca_system_score_codex":0.0005933122,"about_ca_system_score_gemma":0.00034801618,"threshold_uncertainty_score":0.034400463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42022225,0.0007807717,0.53624344,0.0014898597,0.00018533366,0.00009173013,0.00047073315,0.00059046707,0.03992546],"genre_scores_gemma":[0.9283499,0.00034735628,0.054517206,0.00026109364,0.00007374422,0.00013601591,0.00041318045,0.00021395083,0.01568764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919075,0.00020464903,0.000034426736,0.00013552274,0.00019815846,0.00023641628],"domain_scores_gemma":[0.9963437,0.0020853765,0.00030751035,0.00041860944,0.00041733234,0.00042746626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010703126,0.0005348575,0.0009122603,0.0013139672,0.0008485686,0.0016354611,0.001484622,0.0012657437,0.007915402],"category_scores_gemma":[0.01028703,0.00064792845,0.0005967771,0.00063612236,0.0016186291,0.0022219021,0.005127608,0.0015263567,0.0009123555],"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.0007279449,0.00011879136,0.0033176623,0.00034886433,0.000078609126,0.00086308114,0.0005701515,0.15781064,0.01834614,0.7791213,0.0071037277,0.031592987],"study_design_scores_gemma":[0.00009158153,0.0001640928,0.00096512237,0.00010270652,0.00005156175,0.000503179,0.00035073346,0.65273607,0.0059442315,0.33097455,0.00808476,0.000031434833],"about_ca_topic_score_codex":0.0012663708,"about_ca_topic_score_gemma":0.00059668894,"teacher_disagreement_score":0.007915402,"about_ca_system_score_codex":0.00053318235,"about_ca_system_score_gemma":0.00052820845,"threshold_uncertainty_score":0.026479661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3203077,0.0022728432,0.6553669,0.00213164,0.00019396313,0.00021193319,0.0003411374,0.0003793628,0.018794471],"genre_scores_gemma":[0.92331076,0.0011124529,0.06995154,0.00033525974,0.00028618064,0.0002742523,0.0002657513,0.00024058847,0.0042231525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952676,0.001908594,0.00027240373,0.00086815056,0.0011564782,0.0005267971],"domain_scores_gemma":[0.9104849,0.0770577,0.0042731552,0.0037201273,0.0025260618,0.0019380901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070223743,0.00095506787,0.0012306108,0.0025158192,0.0013618545,0.00348329,0.0020165788,0.002113895,0.0053569963],"category_scores_gemma":[0.053752538,0.0008818402,0.0012244047,0.001595827,0.005023466,0.009994142,0.002177872,0.0033662703,0.00053034216],"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.00021245539,0.000068842404,0.0014157062,0.00013782938,0.000042616964,0.00011339754,0.00030633164,0.08600566,0.002124787,0.9000701,0.0005745132,0.00892768],"study_design_scores_gemma":[0.000036411475,0.00007240444,0.00058474834,0.00003729326,0.00002317993,0.000083230014,0.00007077807,0.5206451,0.0012841609,0.47624385,0.00087579095,0.000043128013],"about_ca_topic_score_codex":0.0014337595,"about_ca_topic_score_gemma":0.0007554528,"teacher_disagreement_score":0.0070223743,"about_ca_system_score_codex":0.002895872,"about_ca_system_score_gemma":0.0011248318,"threshold_uncertainty_score":0.037138343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43922868,0.00078422186,0.44970864,0.0009965623,0.00021411675,0.00012699483,0.00068712194,0.00056488323,0.10768866],"genre_scores_gemma":[0.89100516,0.00053351966,0.074257046,0.00021652444,0.00015932959,0.00015013164,0.001375863,0.00044351892,0.031858835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920017,0.00013264608,0.00004556132,0.0002244999,0.00027183874,0.00012531593],"domain_scores_gemma":[0.9971512,0.0014151122,0.00041459754,0.00047155362,0.00026414075,0.00028340163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005568601,0.00053119514,0.0008185749,0.0016325348,0.0014543356,0.0033407265,0.0011915484,0.0011613856,0.01310598],"category_scores_gemma":[0.0053181797,0.0008342742,0.0009321256,0.0014671128,0.0024898176,0.0030153894,0.0030249374,0.0025141381,0.0012823701],"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.00029265642,0.00005455731,0.0013272127,0.00016771612,0.000019815036,0.0002277064,0.0005631895,0.018284185,0.0038946243,0.94037366,0.00442695,0.030367805],"study_design_scores_gemma":[0.000073612,0.00006354193,0.0009293416,0.00006593052,0.00003037955,0.00035162992,0.00035719216,0.09914183,0.0059733856,0.8739126,0.019077096,0.00002347695],"about_ca_topic_score_codex":0.0011081584,"about_ca_topic_score_gemma":0.0008061577,"teacher_disagreement_score":0.01310598,"about_ca_system_score_codex":0.0009772084,"about_ca_system_score_gemma":0.00052122376,"threshold_uncertainty_score":0.043843925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11538774,0.00059573987,0.86178225,0.00076551293,0.0002128824,0.00018897011,0.00096750795,0.0055681234,0.014531339],"genre_scores_gemma":[0.42877832,0.00041604167,0.5589036,0.00033600538,0.00015675118,0.00030604756,0.0022336605,0.00085051486,0.008019085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989814,0.00021187332,0.00004830573,0.00020986896,0.000332762,0.00021569786],"domain_scores_gemma":[0.9961434,0.001688706,0.0001717967,0.0014211871,0.00033556492,0.00023933318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120736,0.001279837,0.0015575064,0.0010102128,0.0006756277,0.0019211575,0.0025694317,0.0016060981,0.011115444],"category_scores_gemma":[0.008196891,0.00057095557,0.0012711363,0.0019086973,0.0014134437,0.0046838718,0.0039770138,0.002931156,0.0032855729],"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.0014545687,0.0007534849,0.0038907146,0.00086735166,0.00010628702,0.00042433414,0.00053607003,0.20864277,0.02230925,0.14522177,0.039242484,0.57655096],"study_design_scores_gemma":[0.00009313792,0.00020775016,0.00044732218,0.00006032552,0.00005579689,0.00026668576,0.00015565153,0.7968714,0.0073465677,0.18974005,0.0047353413,0.000019952067],"about_ca_topic_score_codex":0.0013724262,"about_ca_topic_score_gemma":0.002867449,"teacher_disagreement_score":0.011115444,"about_ca_system_score_codex":0.00088213844,"about_ca_system_score_gemma":0.0017519146,"threshold_uncertainty_score":0.037184834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04669274,0.00066891307,0.9424569,0.00054517726,0.00023404195,0.00012112353,0.0004464731,0.002039162,0.0067954864],"genre_scores_gemma":[0.28405827,0.0005829501,0.7044256,0.0002910635,0.00025252803,0.00034477434,0.0014183185,0.0008055343,0.007820969],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857914,0.0003899037,0.00006620226,0.0002788729,0.00043197192,0.00025393654],"domain_scores_gemma":[0.9962351,0.0015902907,0.00017817265,0.0013704246,0.00036894545,0.00025707218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001753969,0.0014240775,0.0020119348,0.0010905255,0.0007058921,0.0019792758,0.00259421,0.0015918337,0.009547127],"category_scores_gemma":[0.0097055705,0.0007072234,0.0014606426,0.0018761818,0.0015032013,0.0042090956,0.004140135,0.0038072134,0.0028252567],"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.00082604017,0.0004988254,0.0028768545,0.0006462542,0.000118686614,0.00027085602,0.00031919967,0.29367808,0.013301169,0.15674746,0.026839746,0.5038768],"study_design_scores_gemma":[0.000044103825,0.00012976627,0.00038427947,0.000057278794,0.000035663576,0.00016330257,0.00006803868,0.84535134,0.003169077,0.1463275,0.00425328,0.000016411026],"about_ca_topic_score_codex":0.0017403035,"about_ca_topic_score_gemma":0.0030823348,"teacher_disagreement_score":0.009547127,"about_ca_system_score_codex":0.0009382993,"about_ca_system_score_gemma":0.0016735761,"threshold_uncertainty_score":0.031938255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39211518,0.0007462943,0.57235026,0.0002591365,0.00014100083,0.00009318136,0.00012558214,0.00055735005,0.033612017],"genre_scores_gemma":[0.9218795,0.00029900722,0.06942156,0.00008819465,0.0000416724,0.000099892466,0.000111102345,0.00011615122,0.00794302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998079,0.00003883189,0.000008514711,0.000054130516,0.00004121997,0.00004947255],"domain_scores_gemma":[0.999696,0.00010580382,0.00004472767,0.00008271243,0.000021908108,0.000048869402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024231069,0.00041474507,0.0007358245,0.00043557514,0.0007468143,0.0010636046,0.0009807205,0.00069778,0.004164549],"category_scores_gemma":[0.0012784312,0.00036430117,0.0007848667,0.00047648884,0.0013736129,0.0013467118,0.002089853,0.0007205228,0.0005363244],"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.00038788057,0.000077771976,0.0014607739,0.00031619,0.00006556525,0.00032848015,0.00050919934,0.20064983,0.023920426,0.6555676,0.0032167218,0.113499716],"study_design_scores_gemma":[0.00006687793,0.0001607651,0.0009198967,0.000043946624,0.000034582274,0.00018689422,0.00015930756,0.50982684,0.007639667,0.47545314,0.005468456,0.00003975517],"about_ca_topic_score_codex":0.00076985435,"about_ca_topic_score_gemma":0.0011246412,"teacher_disagreement_score":0.004164549,"about_ca_system_score_codex":0.00046892825,"about_ca_system_score_gemma":0.00034102428,"threshold_uncertainty_score":0.013931811},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13800961,0.0003604377,0.8336099,0.0005210946,0.00009762741,0.00009741861,0.00032283066,0.003460042,0.023520973],"genre_scores_gemma":[0.7709808,0.0002651869,0.21482463,0.00013311673,0.000034182867,0.00018338987,0.0005903181,0.00033405118,0.012654293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993988,0.00014884252,0.000054842596,0.00017438234,0.00013438135,0.00008875443],"domain_scores_gemma":[0.9991271,0.00040871542,0.000069676236,0.00021004074,0.00009640874,0.000088092114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037245938,0.00048685202,0.00050029176,0.00047128444,0.0009008269,0.0014670758,0.0009885903,0.0009793587,0.006891916],"category_scores_gemma":[0.0015048368,0.0005390964,0.0015438116,0.00034265438,0.0017024842,0.0016656956,0.0022981425,0.0009749686,0.0011972494],"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.00031896617,0.00015461221,0.003254012,0.00034193567,0.000093971496,0.0009144916,0.0010305844,0.45852643,0.021311507,0.46511775,0.0032731702,0.045662485],"study_design_scores_gemma":[0.00006187707,0.00011784375,0.000306667,0.00005780265,0.000043772096,0.00014921316,0.0001100062,0.7259487,0.0056098,0.2548103,0.01275424,0.00002973343],"about_ca_topic_score_codex":0.003234567,"about_ca_topic_score_gemma":0.0028299638,"teacher_disagreement_score":0.006891916,"about_ca_system_score_codex":0.0007115781,"about_ca_system_score_gemma":0.00063520944,"threshold_uncertainty_score":0.023055732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005526538,0.0023882636,0.9579864,0.0017993404,0.00035428375,0.000101685175,0.0003004216,0.0005282121,0.031014886],"genre_scores_gemma":[0.50778705,0.006604339,0.41373393,0.0016405068,0.001715962,0.0011138335,0.0011926078,0.0017109109,0.06450081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962787,0.0016039468,0.000104316125,0.0004644107,0.0009897946,0.0005588349],"domain_scores_gemma":[0.9854813,0.011190814,0.00052922696,0.0013358856,0.0010133885,0.00044936693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005738887,0.00286791,0.003007311,0.002737106,0.0016775237,0.005015148,0.0046354127,0.003501099,0.017564133],"category_scores_gemma":[0.03637027,0.0016281636,0.0023827562,0.0043900935,0.00328396,0.006576914,0.0037021856,0.006700359,0.003786553],"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.00016189144,0.00010873325,0.00030037118,0.00024796347,0.000056401674,0.000080255646,0.0001854097,0.37239847,0.00053992175,0.5744055,0.01761232,0.033902843],"study_design_scores_gemma":[0.000013146583,0.000014188896,0.00007643856,0.00004888192,0.000020319614,0.00003495373,0.000025991192,0.72561264,0.0002196939,0.2705038,0.0034204682,0.00000953318],"about_ca_topic_score_codex":0.0064581824,"about_ca_topic_score_gemma":0.005042696,"teacher_disagreement_score":0.017564133,"about_ca_system_score_codex":0.006925167,"about_ca_system_score_gemma":0.00386436,"threshold_uncertainty_score":0.0587579},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061702784,0.0003998289,0.923773,0.00028226795,0.00006479328,0.000115125775,0.0003275935,0.0005589737,0.01277565],"genre_scores_gemma":[0.43561253,0.00045600493,0.55245745,0.0002419039,0.000053809785,0.00034171387,0.00076350255,0.00053753884,0.009535535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925536,0.00014701553,0.000050283285,0.000110860914,0.00027462895,0.00016186599],"domain_scores_gemma":[0.9978688,0.001441566,0.000119951445,0.00023028097,0.00018503242,0.00015450899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000826625,0.001100267,0.0013004533,0.0012461019,0.00069372344,0.0016432388,0.0015364988,0.001558732,0.010132659],"category_scores_gemma":[0.005138095,0.0010497851,0.0013523168,0.0011130642,0.0009926931,0.0018493396,0.0038710234,0.0024213274,0.001208414],"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.00044990252,0.00022866736,0.0012174408,0.0003996678,0.000060148166,0.00014809359,0.0003504113,0.5996445,0.014503444,0.16497241,0.008597312,0.209428],"study_design_scores_gemma":[0.000053559404,0.00007960026,0.00019757795,0.00005466543,0.000016677071,0.00005603944,0.000083077386,0.8631016,0.0022065693,0.13168478,0.0024481118,0.000017669377],"about_ca_topic_score_codex":0.0017834336,"about_ca_topic_score_gemma":0.0038907235,"teacher_disagreement_score":0.010132659,"about_ca_system_score_codex":0.0010325133,"about_ca_system_score_gemma":0.00084130134,"threshold_uncertainty_score":0.03389716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092300475,0.006229557,0.8263948,0.003641889,0.00039459008,0.00014800389,0.0015990277,0.0014770926,0.06781456],"genre_scores_gemma":[0.66939133,0.0034289812,0.27154613,0.0019574768,0.0008694998,0.00026665028,0.0031233008,0.0008137724,0.048602954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983315,0.00045369953,0.00007633826,0.00036756007,0.00058089296,0.00019008848],"domain_scores_gemma":[0.9936022,0.0033967416,0.00042067686,0.0014013872,0.00083848485,0.0003404069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013411887,0.00048066294,0.0010631992,0.0018379706,0.0013284404,0.0026076995,0.0013262812,0.0015170332,0.015907265],"category_scores_gemma":[0.012804049,0.00058011105,0.0006393946,0.0024423318,0.0013351586,0.004934343,0.0028395862,0.0024135262,0.0040334947],"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.0002177336,0.00006236876,0.0022518262,0.00020327856,0.00006242517,0.0001948575,0.00024071809,0.011566641,0.004648961,0.8172335,0.018812058,0.14450565],"study_design_scores_gemma":[0.000032693908,0.000042049407,0.00061252783,0.000053779906,0.000044003024,0.0005504809,0.00007198139,0.052689653,0.0020317,0.9203402,0.023510251,0.00002082488],"about_ca_topic_score_codex":0.00055355474,"about_ca_topic_score_gemma":0.0010646548,"teacher_disagreement_score":0.015907265,"about_ca_system_score_codex":0.0007819958,"about_ca_system_score_gemma":0.0006886136,"threshold_uncertainty_score":0.053215086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036271136,0.00049293885,0.9456272,0.0014584676,0.00023461836,0.0002918489,0.0009647083,0.0032312544,0.011427754],"genre_scores_gemma":[0.40166286,0.00043555192,0.5826999,0.0007237856,0.00029657353,0.00054823246,0.0020062244,0.0009305466,0.010696246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957455,0.0008276187,0.00019691835,0.0010422705,0.0011658191,0.0010219162],"domain_scores_gemma":[0.9907883,0.0046000276,0.00044047312,0.0027739163,0.00074708945,0.0006502784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031663117,0.0018463412,0.002727962,0.0014039918,0.0021004435,0.0045670457,0.0071985577,0.0028282136,0.01636009],"category_scores_gemma":[0.012534871,0.0007964164,0.0022345677,0.0029544272,0.0020892196,0.00789817,0.004802354,0.0055465284,0.002859952],"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.002919156,0.0013101753,0.0021779663,0.0010376618,0.00023864105,0.00015653163,0.0006069049,0.45716384,0.01869208,0.20068994,0.042257175,0.27274993],"study_design_scores_gemma":[0.00015669203,0.00009809315,0.00025517275,0.00002912243,0.000074946634,0.00008283203,0.00009766275,0.8914313,0.0025216588,0.10265825,0.0025709686,0.000023386832],"about_ca_topic_score_codex":0.0065607396,"about_ca_topic_score_gemma":0.01158144,"teacher_disagreement_score":0.01636009,"about_ca_system_score_codex":0.006005759,"about_ca_system_score_gemma":0.008106702,"threshold_uncertainty_score":0.05472988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33733374,0.0032110054,0.37458047,0.006863011,0.0010089187,0.0002001346,0.00074585306,0.00052371627,0.27553326],"genre_scores_gemma":[0.9317668,0.0013252322,0.038797915,0.00076546456,0.0004388175,0.0001435982,0.0005862637,0.00027239442,0.025903527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903095,0.0003265733,0.000036668334,0.00015001518,0.00026227592,0.0001935165],"domain_scores_gemma":[0.9984811,0.000655363,0.00019401133,0.0003898496,0.00014640596,0.00013334356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009723058,0.0005658185,0.0010297298,0.0009933729,0.0014728949,0.003330774,0.0011175643,0.0013429737,0.01178236],"category_scores_gemma":[0.0052276268,0.00038549557,0.0014013721,0.0009351983,0.0027533665,0.0044147884,0.0019243264,0.0035212343,0.0015480673],"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.000058617665,0.00002099867,0.00015813795,0.000034608704,0.000014132637,0.00004355584,0.00006055931,0.004861865,0.00040739318,0.9822204,0.0034424942,0.008677253],"study_design_scores_gemma":[0.00001572113,0.000009055841,0.00006516923,0.0000061365176,0.0000031610869,0.00002611264,0.000026956219,0.009350431,0.00014233931,0.9889796,0.001371812,0.0000034797101],"about_ca_topic_score_codex":0.0014060296,"about_ca_topic_score_gemma":0.00068071525,"teacher_disagreement_score":0.01178236,"about_ca_system_score_codex":0.001003337,"about_ca_system_score_gemma":0.00097610534,"threshold_uncertainty_score":0.039415896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09447374,0.00091709354,0.87767076,0.0014885443,0.00032816082,0.0001907824,0.0008979233,0.003785819,0.020247167],"genre_scores_gemma":[0.3956087,0.00040032587,0.58778256,0.0004455843,0.00016191996,0.00029430437,0.0020691254,0.0010426083,0.012194931],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875796,0.0003163158,0.00006696498,0.00032362159,0.00032609352,0.00020911187],"domain_scores_gemma":[0.9973443,0.0017268639,0.000115684445,0.00045574273,0.00018069078,0.00017673263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301613,0.0013817094,0.0018228169,0.0011286299,0.0008878325,0.002202589,0.0020171874,0.0016506261,0.020857478],"category_scores_gemma":[0.0072958465,0.00066727155,0.001142719,0.0016878374,0.0013622825,0.0046276813,0.0027368627,0.0019328595,0.0037256728],"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.0016819565,0.00044101442,0.002852468,0.0007811816,0.0002149643,0.00026716283,0.00030544665,0.3812455,0.010890338,0.14266072,0.04098812,0.41767117],"study_design_scores_gemma":[0.00016293243,0.00012115872,0.00034623503,0.000027521948,0.000047526733,0.00011205072,0.0001417493,0.72810596,0.002499416,0.2648794,0.003538264,0.000017738486],"about_ca_topic_score_codex":0.0024686065,"about_ca_topic_score_gemma":0.006054221,"teacher_disagreement_score":0.020857478,"about_ca_system_score_codex":0.0012119319,"about_ca_system_score_gemma":0.0018476476,"threshold_uncertainty_score":0.069775224},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4879509,0.0014122874,0.4220073,0.0019054555,0.00012738848,0.0000947256,0.00089838874,0.0011876727,0.084415875],"genre_scores_gemma":[0.96908474,0.0005646023,0.018667681,0.00016292087,0.00006814448,0.00005490591,0.0002726138,0.0001687794,0.010955591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981833,0.00043342187,0.000066588844,0.00039884925,0.00040383296,0.00051387167],"domain_scores_gemma":[0.993719,0.0039040882,0.0006683386,0.0009846573,0.00033926519,0.00038468867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012017087,0.0007657252,0.0015406968,0.0012473618,0.0021500231,0.0035611736,0.0015613649,0.0016048828,0.007535802],"category_scores_gemma":[0.008784006,0.0005831651,0.0008332784,0.0019698227,0.0030664604,0.007102996,0.004455106,0.0025123237,0.0010080107],"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.00037432899,0.000051300114,0.0005244062,0.000105670566,0.00005884258,0.00015880408,0.0003715888,0.05156649,0.0012421771,0.9263704,0.0033888833,0.01578703],"study_design_scores_gemma":[0.000052390245,0.000021427548,0.00016975832,0.00002136741,0.000025646053,0.0001316425,0.00016520395,0.078871906,0.0011856761,0.91667587,0.0026597704,0.000019264013],"about_ca_topic_score_codex":0.002450037,"about_ca_topic_score_gemma":0.001669115,"teacher_disagreement_score":0.007535802,"about_ca_system_score_codex":0.0014310776,"about_ca_system_score_gemma":0.00093936326,"threshold_uncertainty_score":0.025209785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14405377,0.0015435183,0.82271814,0.0012056184,0.00021336952,0.000093705625,0.0004463737,0.0007222226,0.0290033],"genre_scores_gemma":[0.85417783,0.0006895856,0.13064553,0.00035455736,0.000092292496,0.00017492923,0.00042652918,0.00019959758,0.013239197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999052,0.00037093126,0.00004127047,0.00015843449,0.00016570352,0.00021160598],"domain_scores_gemma":[0.99614704,0.0029457617,0.00020646173,0.00034906555,0.00016430233,0.00018727373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013443878,0.0009033383,0.0017667977,0.00076545053,0.0008637757,0.0026025453,0.0017554882,0.0023332536,0.005728704],"category_scores_gemma":[0.00897454,0.00080671406,0.00089896016,0.0013437861,0.0022011937,0.0040995106,0.0032559359,0.0028652125,0.00090154336],"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.0010592311,0.00011484171,0.0007794221,0.00019627537,0.00009656973,0.00012340967,0.00014224942,0.5343051,0.0015296113,0.42942536,0.005240326,0.026987545],"study_design_scores_gemma":[0.00011080888,0.000079670746,0.00012953773,0.000028784527,0.000018138719,0.00003705221,0.00003441658,0.6949027,0.00048659666,0.30310518,0.0010406732,0.000026430518],"about_ca_topic_score_codex":0.0016748968,"about_ca_topic_score_gemma":0.0017406879,"teacher_disagreement_score":0.005728704,"about_ca_system_score_codex":0.0009047148,"about_ca_system_score_gemma":0.0010500482,"threshold_uncertainty_score":0.019164383},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021847976,0.00040702242,0.9588748,0.0027075375,0.00047309112,0.00014558701,0.00024940053,0.00038762196,0.014906945],"genre_scores_gemma":[0.6234045,0.0012622272,0.33206433,0.0021208073,0.0021095735,0.00064877514,0.0005701364,0.00061482994,0.03720483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99103206,0.004208416,0.0002909648,0.0015970574,0.0017665587,0.0011048808],"domain_scores_gemma":[0.9635691,0.023717051,0.0015713818,0.00751514,0.0015286976,0.0020986602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007023316,0.0020612206,0.0024071157,0.0016667568,0.0024888357,0.004793638,0.0074670757,0.005973766,0.0071485196],"category_scores_gemma":[0.024255617,0.0013878623,0.0035311782,0.0028151067,0.006526103,0.01294186,0.0074741687,0.011615265,0.0010627639],"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.00050037605,0.00031561303,0.0010964546,0.00022051249,0.0001198653,0.0002240137,0.00025357897,0.11819286,0.0028738072,0.8416513,0.0108036045,0.023748009],"study_design_scores_gemma":[0.00007543166,0.00011125974,0.00017952637,0.000028069793,0.000053708343,0.00019187052,0.000048806956,0.4844315,0.0009915059,0.50813204,0.0057184095,0.000037740636],"about_ca_topic_score_codex":0.0011694623,"about_ca_topic_score_gemma":0.0019982478,"teacher_disagreement_score":0.0074670757,"about_ca_system_score_codex":0.0034012515,"about_ca_system_score_gemma":0.0027178624,"threshold_uncertainty_score":0.03714329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100495316,0.014945946,0.67793095,0.024368154,0.0012564257,0.00025859804,0.002485826,0.0010910875,0.17716768],"genre_scores_gemma":[0.8117147,0.01164261,0.12575409,0.0032760378,0.003481343,0.000563448,0.00315695,0.0009168536,0.03949394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997929,0.0005553508,0.00007409417,0.0006022839,0.0006028402,0.0002364686],"domain_scores_gemma":[0.98910284,0.008941591,0.00043708313,0.00085989735,0.00035579505,0.00030269974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014698649,0.001049482,0.0022150963,0.0013774807,0.0020252746,0.0057953815,0.003827817,0.0032016828,0.012864534],"category_scores_gemma":[0.015788496,0.0011956481,0.0019434006,0.0025238912,0.004826931,0.012765568,0.0041402923,0.008598593,0.0018162972],"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.0002743439,0.00017299947,0.0014833197,0.0011358,0.00009507311,0.00018659256,0.0006601466,0.045235615,0.0013828131,0.84243625,0.0421179,0.06481914],"study_design_scores_gemma":[0.00003734228,0.000022224067,0.00034117352,0.0000554142,0.000018676528,0.00016123077,0.00013390204,0.0254631,0.00044471244,0.96482664,0.0084823305,0.000013311715],"about_ca_topic_score_codex":0.0019176077,"about_ca_topic_score_gemma":0.0013704612,"teacher_disagreement_score":0.012864534,"about_ca_system_score_codex":0.002151814,"about_ca_system_score_gemma":0.0016240343,"threshold_uncertainty_score":0.043036163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12588017,0.00030111868,0.859625,0.0002644182,0.0000883918,0.00009350425,0.00022771719,0.00042760305,0.013092172],"genre_scores_gemma":[0.43185365,0.00070024736,0.5553571,0.0002478761,0.00008742109,0.00021162917,0.0009336876,0.00058685674,0.010021587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.00024996704,0.0000522064,0.000116594645,0.00028850517,0.00016554253],"domain_scores_gemma":[0.9966659,0.0021747828,0.00029324993,0.000447163,0.00022086958,0.0001980368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095930306,0.00092209666,0.0010558179,0.0010577474,0.00070604554,0.001454603,0.0014982962,0.0009141637,0.0047261007],"category_scores_gemma":[0.0063548777,0.000865748,0.0008976151,0.0014196403,0.0017947637,0.0026442849,0.004913974,0.002156845,0.00073958247],"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.0005516503,0.00019540287,0.0019455322,0.00025707696,0.00004777246,0.0003100028,0.00054140337,0.36844647,0.010592885,0.47435433,0.0056611793,0.13709624],"study_design_scores_gemma":[0.00005413188,0.000097946264,0.00027697923,0.000051314324,0.000021353713,0.000106124346,0.00012817078,0.65535146,0.0027369584,0.33713502,0.0040233172,0.000017175773],"about_ca_topic_score_codex":0.0022703002,"about_ca_topic_score_gemma":0.0033689735,"teacher_disagreement_score":0.0047261007,"about_ca_system_score_codex":0.00063859316,"about_ca_system_score_gemma":0.0006402258,"threshold_uncertainty_score":0.01581043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15946807,0.008349291,0.75335246,0.0060221474,0.0006042343,0.00013904905,0.00097357016,0.0002826195,0.070808575],"genre_scores_gemma":[0.81734407,0.005650925,0.15107907,0.00071219367,0.0012725906,0.00017113052,0.001306212,0.00030336314,0.02216054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982521,0.00061007746,0.00007231827,0.0004177648,0.00044277334,0.00020491511],"domain_scores_gemma":[0.9932854,0.004942992,0.0004985574,0.00049467146,0.00041288446,0.00036551603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853852,0.0005911613,0.0014371872,0.001457408,0.0012451457,0.005745805,0.002050847,0.0023156682,0.0062658065],"category_scores_gemma":[0.010962131,0.0007074572,0.0008957304,0.0027420083,0.0030980736,0.008536704,0.0024302956,0.0035164726,0.0009417349],"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.00008718199,0.0000562718,0.0010896414,0.0002624821,0.000033761808,0.00008392209,0.0003212502,0.03334029,0.0008666434,0.9291422,0.007911411,0.02680497],"study_design_scores_gemma":[0.000011851445,0.000008417288,0.00025214374,0.000023795561,0.000010396957,0.00013224037,0.00013181102,0.038156018,0.00036435324,0.9559444,0.0049553174,0.000009238448],"about_ca_topic_score_codex":0.0018775208,"about_ca_topic_score_gemma":0.0016786548,"teacher_disagreement_score":0.0062658065,"about_ca_system_score_codex":0.0015344387,"about_ca_system_score_gemma":0.0012191759,"threshold_uncertainty_score":0.020961225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17037615,0.0064647067,0.6494907,0.008844434,0.00082078134,0.00047289202,0.0051998906,0.003061485,0.15526904],"genre_scores_gemma":[0.86471266,0.003523007,0.10683031,0.0033670543,0.0020489423,0.00071685715,0.0036574325,0.0011180333,0.014025721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629176,0.0005734711,0.00014190696,0.00080894335,0.0015453014,0.0006387059],"domain_scores_gemma":[0.9729998,0.021540998,0.00090257067,0.0023881637,0.0012962136,0.0008723056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024792089,0.001970074,0.001827514,0.0035222901,0.0015862944,0.0040871226,0.003764625,0.0022410122,0.02214851],"category_scores_gemma":[0.025013888,0.0009795565,0.0022913967,0.0023217374,0.0028145164,0.01031284,0.00505244,0.006833149,0.002153079],"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.00058442814,0.00025788037,0.00249518,0.0010769648,0.00016426254,0.00046773878,0.0004163417,0.103312105,0.010982363,0.7871249,0.029399363,0.06371852],"study_design_scores_gemma":[0.000054402462,0.00009886458,0.0005709491,0.000110313806,0.00006096728,0.00025325676,0.000050800492,0.20993662,0.004143577,0.77736515,0.0073060817,0.00004902368],"about_ca_topic_score_codex":0.0011773749,"about_ca_topic_score_gemma":0.0014905313,"teacher_disagreement_score":0.02214851,"about_ca_system_score_codex":0.002976614,"about_ca_system_score_gemma":0.0012273297,"threshold_uncertainty_score":0.07409418},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12031287,0.0024504284,0.81432813,0.0050456226,0.00065536296,0.0005481765,0.0021002474,0.0027834428,0.051775746],"genre_scores_gemma":[0.70508516,0.0009812929,0.262534,0.00084264745,0.00031484762,0.00055335346,0.0024360036,0.0008269673,0.026425742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782604,0.00085601147,0.000057023604,0.0004340666,0.0003733903,0.0004535135],"domain_scores_gemma":[0.9925891,0.005174272,0.00032586546,0.0008972756,0.0005249894,0.00048840116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026661162,0.0017095471,0.0026105584,0.0017111095,0.0019340364,0.0028116785,0.0045682513,0.0035259689,0.01739021],"category_scores_gemma":[0.01887834,0.00091022387,0.0013212828,0.0031671755,0.0025695271,0.005215586,0.0026403556,0.0039633787,0.001632701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00078115653,0.00035400418,0.0012515411,0.00022365616,0.00007739057,0.00008419956,0.0000945161,0.7531452,0.0005260185,0.15382354,0.036548123,0.05309061],"study_design_scores_gemma":[0.00012055696,0.00004402968,0.00016009799,0.000018031753,0.00001664812,0.000020864441,0.000033236487,0.9289927,0.00020511147,0.0683222,0.002049305,0.000017201226],"about_ca_topic_score_codex":0.08314238,"about_ca_topic_score_gemma":0.09142665,"teacher_disagreement_score":0.9168576,"about_ca_system_score_codex":0.006810421,"about_ca_system_score_gemma":0.011405353,"threshold_uncertainty_score":0.16531688},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010153581,0.035279162,0.02441491,0.03328498,0.75200933,0.00029741746,0.004764101,0.0025410196,0.14639372],"genre_scores_gemma":[0.0060504773,0.027812833,0.012471683,0.00886894,0.42150787,0.00038330175,0.008670471,0.0037423,0.5104921],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960259,0.0005963885,0.00034778775,0.0008518387,0.0018530334,0.0003251175],"domain_scores_gemma":[0.9869669,0.0039743627,0.0006934186,0.0019678173,0.004085508,0.0023119783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003373897,0.0024401103,0.0029553655,0.0066543347,0.0021457656,0.012587692,0.0024932458,0.0036502262,0.2516833],"category_scores_gemma":[0.014495267,0.0010295798,0.001759297,0.006696491,0.0014009352,0.007124477,0.0040514874,0.0055614533,0.14295925],"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.000037046393,0.000030783824,0.00009406536,0.00027071184,0.000015599633,0.000028216298,0.000008830738,0.00018314135,0.000241992,0.0047981185,0.9357034,0.058588233],"study_design_scores_gemma":[0.000013838452,0.000032452037,0.00024753265,0.00018624062,0.000011160305,0.00009703044,0.000010712757,0.0004900254,0.0001827764,0.00826806,0.99044764,0.000012561876],"about_ca_topic_score_codex":0.0014711939,"about_ca_topic_score_gemma":0.0034218456,"teacher_disagreement_score":0.2516833,"about_ca_system_score_codex":0.0027473608,"about_ca_system_score_gemma":0.0034510184,"threshold_uncertainty_score":0.8419645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29326126,0.0025674505,0.6374441,0.011658483,0.00039316432,0.001004167,0.008716582,0.019353935,0.025600916],"genre_scores_gemma":[0.42896736,0.0010900745,0.5386304,0.001381839,0.00029183674,0.00062848045,0.014512306,0.0026797256,0.011817918],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99013513,0.0020130856,0.00076300785,0.0031163914,0.002682258,0.0012901565],"domain_scores_gemma":[0.9551994,0.02944701,0.0022905201,0.009827364,0.0020876534,0.0011480799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004565897,0.0016207674,0.00263967,0.0024979098,0.0025989867,0.007370998,0.007359908,0.0035318881,0.013314137],"category_scores_gemma":[0.031476855,0.0014126888,0.0030884307,0.0064451825,0.0029193328,0.017195249,0.0052544903,0.0040693334,0.0030462341],"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.001805902,0.0011763384,0.0087619275,0.0025921867,0.00036640387,0.00071279495,0.0025537028,0.19014803,0.017807232,0.2996193,0.06773815,0.40671808],"study_design_scores_gemma":[0.00031028263,0.00013717385,0.00088273827,0.00011435515,0.00016300162,0.00046599648,0.0005059963,0.431045,0.0069208173,0.549639,0.009751837,0.00006382371],"about_ca_topic_score_codex":0.006304863,"about_ca_topic_score_gemma":0.006926771,"teacher_disagreement_score":0.013314137,"about_ca_system_score_codex":0.005219081,"about_ca_system_score_gemma":0.0046596904,"threshold_uncertainty_score":0.044540167},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35835117,0.0045508253,0.58286524,0.006232933,0.0003613667,0.00014469039,0.00075726496,0.0003401434,0.046396345],"genre_scores_gemma":[0.9043589,0.0036586982,0.06521203,0.0005473375,0.0008232341,0.00013526922,0.0007867039,0.00021552583,0.024262328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862266,0.0005520376,0.000083024956,0.00032552553,0.00021057614,0.00020618875],"domain_scores_gemma":[0.9849745,0.011641401,0.0009897262,0.00075534574,0.0007141727,0.00092487206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019454983,0.00069350493,0.0018599381,0.0029425218,0.002178273,0.0047216215,0.0031195,0.0025097271,0.009638257],"category_scores_gemma":[0.016040567,0.0008697606,0.0012980155,0.0041209753,0.0037101652,0.016737035,0.0033561846,0.0042217034,0.00081239024],"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.00007914211,0.00011773306,0.00076641905,0.00014556658,0.000016047998,0.000094156545,0.0004562924,0.007459678,0.00030537986,0.97566754,0.002303256,0.012588682],"study_design_scores_gemma":[0.000022009683,0.000019413403,0.00025103136,0.000028399596,0.000015756095,0.000079011996,0.00020646166,0.030495442,0.00016376881,0.9671222,0.0015827708,0.000013781743],"about_ca_topic_score_codex":0.002708311,"about_ca_topic_score_gemma":0.0019238656,"teacher_disagreement_score":0.009638257,"about_ca_system_score_codex":0.0020741818,"about_ca_system_score_gemma":0.0009225691,"threshold_uncertainty_score":0.032243133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14586456,0.0014712947,0.7793333,0.0039790547,0.00031886782,0.00019141329,0.00017327005,0.0004646923,0.068203576],"genre_scores_gemma":[0.9104357,0.00086322724,0.08015188,0.00055706187,0.00038261665,0.00025659264,0.0001536941,0.00007210199,0.007127122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967853,0.0011389273,0.00016157431,0.0004737134,0.0011372787,0.00030316744],"domain_scores_gemma":[0.9867421,0.008383151,0.0009070769,0.0020154726,0.0014215066,0.00053074985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020085825,0.0004488407,0.00062020385,0.0012754101,0.0011709081,0.001760391,0.0009762243,0.0014936051,0.003169683],"category_scores_gemma":[0.013931323,0.00035950556,0.0006914716,0.0011338914,0.00488583,0.0033308752,0.00435746,0.003968523,0.0007658887],"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.000049181403,0.000027803397,0.0003487469,0.000055235,0.000007282268,0.0000882705,0.00019198254,0.012247551,0.0009655556,0.9737224,0.0005965215,0.011699491],"study_design_scores_gemma":[0.000023293598,0.000059937553,0.00012174724,0.000042703323,0.000007836764,0.0002558354,0.00006497113,0.06586044,0.0027312266,0.9238719,0.0069334437,0.000026668396],"about_ca_topic_score_codex":0.0006217391,"about_ca_topic_score_gemma":0.00025861128,"teacher_disagreement_score":0.003169683,"about_ca_system_score_codex":0.0016135912,"about_ca_system_score_gemma":0.0012723894,"threshold_uncertainty_score":0.011707425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63977027,0.0025514287,0.2712559,0.010877032,0.00035965355,0.00043495762,0.005375842,0.003392241,0.06598262],"genre_scores_gemma":[0.88851476,0.0012016231,0.07247469,0.00094077166,0.00032702106,0.00016424202,0.0051668677,0.0010477576,0.030162435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761355,0.0005564092,0.0001329397,0.00053455686,0.00060220185,0.0005603454],"domain_scores_gemma":[0.9881016,0.008771468,0.000688331,0.0012041598,0.00068949914,0.00054489804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112009,0.0009776461,0.0018180107,0.0017618656,0.0020732149,0.0046684165,0.0026817278,0.0025696077,0.0133235175],"category_scores_gemma":[0.016050294,0.0007624279,0.00084095827,0.004509902,0.0017786718,0.013625699,0.0049903346,0.0033537992,0.0018836681],"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.0038444614,0.000908915,0.0074865273,0.0015436127,0.00018779546,0.0011969896,0.0032156038,0.10100628,0.017774856,0.6287759,0.068041556,0.16601749],"study_design_scores_gemma":[0.00019049778,0.00008727873,0.0009844792,0.000051086558,0.0000837688,0.0003204346,0.0011512346,0.16256125,0.0071148025,0.8149033,0.012515092,0.000036845497],"about_ca_topic_score_codex":0.005365726,"about_ca_topic_score_gemma":0.005775039,"teacher_disagreement_score":0.0133235175,"about_ca_system_score_codex":0.0021072228,"about_ca_system_score_gemma":0.001317319,"threshold_uncertainty_score":0.04457158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18909113,0.0024747103,0.74399346,0.0045063724,0.0004635166,0.00023450618,0.002838972,0.0009006592,0.055496592],"genre_scores_gemma":[0.71393967,0.0027612373,0.25528988,0.00076204113,0.0004477357,0.0003104242,0.0045136595,0.00045596733,0.021519344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998782,0.00038245268,0.00008101335,0.00028411023,0.00028829163,0.00018223868],"domain_scores_gemma":[0.9936156,0.004069175,0.0005346999,0.00072699104,0.00059350586,0.00045999096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091165036,0.00086981157,0.0011968846,0.00087613653,0.0010838334,0.0026895069,0.0022170583,0.0013926082,0.012498637],"category_scores_gemma":[0.012202177,0.0006308041,0.0006818261,0.0021625452,0.0008516914,0.0067519415,0.0025286411,0.002339379,0.0022535953],"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.0010228336,0.00043883044,0.0040212106,0.000888841,0.00011855853,0.0002992796,0.00045475204,0.1528252,0.0104410155,0.6040832,0.037431777,0.18797448],"study_design_scores_gemma":[0.00012197063,0.00008545046,0.0010941628,0.000083967774,0.00006324218,0.00031783595,0.00022113933,0.2588761,0.0028934465,0.72562593,0.010595892,0.00002088802],"about_ca_topic_score_codex":0.000762291,"about_ca_topic_score_gemma":0.0014474199,"teacher_disagreement_score":0.012498637,"about_ca_system_score_codex":0.00091288117,"about_ca_system_score_gemma":0.0007930876,"threshold_uncertainty_score":0.041812122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09142114,0.001016143,0.84167475,0.017898668,0.00023518903,0.0012233447,0.0060933884,0.0030889495,0.037348453],"genre_scores_gemma":[0.45234063,0.0016889077,0.5122153,0.004286734,0.0010308294,0.0023524123,0.00909988,0.0017831097,0.015202119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909774,0.0028055417,0.0005992617,0.0024157066,0.0019907288,0.0012113123],"domain_scores_gemma":[0.95538,0.036824197,0.0015104113,0.004354939,0.0011400672,0.0007904512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048343516,0.0021838935,0.0034585933,0.0016858203,0.0025211857,0.008276094,0.0064060395,0.003971564,0.030003669],"category_scores_gemma":[0.028906362,0.0017553889,0.007891786,0.0035657468,0.003375799,0.017042082,0.007155932,0.010837203,0.0036397614],"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.001181691,0.0009872899,0.0035034858,0.002311938,0.00038869394,0.0008039078,0.0014617187,0.12058732,0.0074532577,0.7205806,0.041300803,0.09943932],"study_design_scores_gemma":[0.00024166833,0.000095653675,0.00040628138,0.00008160115,0.00009770142,0.00033355126,0.00019629142,0.18622743,0.0015774273,0.80321884,0.0074664545,0.000057116762],"about_ca_topic_score_codex":0.0044672117,"about_ca_topic_score_gemma":0.0043855584,"teacher_disagreement_score":0.030003669,"about_ca_system_score_codex":0.004760298,"about_ca_system_score_gemma":0.00503831,"threshold_uncertainty_score":0.100372255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39198625,0.0006019233,0.5641429,0.0038622045,0.00026921602,0.00025892648,0.0008520954,0.0028469313,0.035179593],"genre_scores_gemma":[0.9364371,0.00017814754,0.0554589,0.00055691897,0.00013525337,0.00017657063,0.0003671988,0.00022330094,0.0064665684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747235,0.0004161794,0.00016439169,0.0008328563,0.0005195306,0.00059461413],"domain_scores_gemma":[0.98903733,0.006807161,0.0007120069,0.002295274,0.00062518014,0.00052295515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001641111,0.00062000676,0.00070794753,0.00096533727,0.0017242415,0.003735839,0.0017814551,0.0012839027,0.0075934986],"category_scores_gemma":[0.008064093,0.00067610084,0.0027177949,0.0006759926,0.0042674826,0.0090281945,0.0033321276,0.0030915327,0.00053337397],"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.00041496367,0.00017464184,0.0016423999,0.0001613895,0.000059893722,0.00023423723,0.0007073359,0.021722091,0.008417974,0.9376978,0.0031795378,0.025587808],"study_design_scores_gemma":[0.00009495273,0.00016049601,0.0005852823,0.000043405333,0.00006249438,0.00014840708,0.00015201459,0.105763376,0.012068346,0.874277,0.006596242,0.000048034646],"about_ca_topic_score_codex":0.0047455216,"about_ca_topic_score_gemma":0.003960455,"teacher_disagreement_score":0.0075934986,"about_ca_system_score_codex":0.004653281,"about_ca_system_score_gemma":0.0016521685,"threshold_uncertainty_score":0.033762038},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061170693,0.0004895338,0.9274456,0.0005786981,0.0002308551,0.00020700372,0.00040560256,0.001912579,0.0075594108],"genre_scores_gemma":[0.24531679,0.00027598985,0.7459339,0.0002461463,0.00016441505,0.0003369841,0.0011987183,0.00047207047,0.006054947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993299,0.00012683593,0.000050499457,0.00014432817,0.00023237217,0.00011601961],"domain_scores_gemma":[0.998089,0.00089524646,0.00010552218,0.00043046623,0.00028657354,0.0001931433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010999475,0.0010569189,0.0015042516,0.00088174274,0.0008594561,0.0012708518,0.0026378315,0.0012313912,0.0070062433],"category_scores_gemma":[0.0055390904,0.00063471106,0.0008667252,0.0015907708,0.00085195067,0.002726402,0.0029696007,0.0017025985,0.0012032675],"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.0015698095,0.00045358037,0.0018733304,0.00047440027,0.00011506289,0.00017934867,0.00034130804,0.40109527,0.013889315,0.09615343,0.027464112,0.4563911],"study_design_scores_gemma":[0.000114800125,0.00008057671,0.00013228644,0.000014838745,0.000012183166,0.000044513497,0.00004426661,0.9432429,0.00113038,0.05355943,0.0016154958,0.000008299463],"about_ca_topic_score_codex":0.0035237952,"about_ca_topic_score_gemma":0.0054745763,"teacher_disagreement_score":0.0070062433,"about_ca_system_score_codex":0.0010635463,"about_ca_system_score_gemma":0.0019201356,"threshold_uncertainty_score":0.023438275},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004747828,0.0027524363,0.22555533,0.013652981,0.00849278,0.00017152581,0.004805911,0.005534957,0.73428625],"genre_scores_gemma":[0.07591275,0.0042642904,0.11555243,0.0072558573,0.006058291,0.00048279605,0.011988858,0.0042958464,0.7741889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988127,0.00020225519,0.00004595166,0.00047469928,0.00033029332,0.00013415467],"domain_scores_gemma":[0.99859697,0.00031401348,0.000062209096,0.00056139176,0.00031687677,0.00014848544],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008409639,0.0012990308,0.00080937054,0.0015412127,0.0019134851,0.0043389467,0.0020099422,0.0015224614,0.28826967],"category_scores_gemma":[0.0037360396,0.0005276315,0.0013445184,0.0018101619,0.0014913675,0.0070141167,0.0034621994,0.0039662146,0.19069344],"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.000069974194,0.000071157105,0.00042388367,0.00025216537,0.000024129726,0.00006896763,0.00014724086,0.0008454255,0.001006821,0.4417808,0.39235055,0.16295885],"study_design_scores_gemma":[0.00001856811,0.000018800822,0.00028626918,0.00008407883,0.000019119816,0.0001891649,0.00007494504,0.0019276787,0.00074029283,0.28666317,0.70995945,0.000018504117],"about_ca_topic_score_codex":0.00059316854,"about_ca_topic_score_gemma":0.001017123,"teacher_disagreement_score":0.71173036,"about_ca_system_score_codex":0.0009930232,"about_ca_system_score_gemma":0.0010150253,"threshold_uncertainty_score":0.9643581},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015538586,0.004325594,0.0008219112,0.07740314,0.9044557,0.00002853649,0.000090572605,0.00013321973,0.0125858355],"genre_scores_gemma":[0.003668601,0.0031499409,0.00075935543,0.034984726,0.8749637,0.00007765858,0.00012307419,0.00025141472,0.08202158],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965963,0.0006160616,0.00035163952,0.00058563764,0.0015355439,0.00031478915],"domain_scores_gemma":[0.97598517,0.007814044,0.0012744762,0.0019215043,0.0100000305,0.0030048867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005101689,0.0014397228,0.0017908929,0.002760967,0.0024283598,0.007870214,0.0024183332,0.005422958,0.058252785],"category_scores_gemma":[0.030928534,0.0005824138,0.0012913875,0.0015255916,0.0016229833,0.0044359,0.002437704,0.011043601,0.03449997],"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.000020366972,0.000009435019,0.00003979325,0.00007663432,0.000006233336,0.000043721215,0.000018126373,0.000039295188,0.000059267342,0.0021067297,0.9871559,0.0104245385],"study_design_scores_gemma":[0.000020003115,0.000019726887,0.00020701488,0.0001027545,0.000013310596,0.00012622251,0.000037293124,0.00024011306,0.00014421444,0.0031756875,0.99590343,0.000010213591],"about_ca_topic_score_codex":0.0006520607,"about_ca_topic_score_gemma":0.0010100439,"teacher_disagreement_score":0.058252785,"about_ca_system_score_codex":0.0014215228,"about_ca_system_score_gemma":0.0018112668,"threshold_uncertainty_score":0.19487494},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01118979,0.001206955,0.98203367,0.0010375442,0.00013964379,0.00019628432,0.00026999935,0.00043495244,0.0034912082],"genre_scores_gemma":[0.16902947,0.0011965729,0.8148722,0.0007154828,0.0004344859,0.00096519274,0.0014890874,0.00075171655,0.010545856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949581,0.002773396,0.00023598866,0.0008186069,0.00088869524,0.00032514764],"domain_scores_gemma":[0.99029386,0.006527825,0.0005919868,0.0010548213,0.0011419014,0.00038957884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049589192,0.0032758103,0.005179708,0.0031325684,0.0022484665,0.0032176143,0.00725987,0.005644721,0.005759174],"category_scores_gemma":[0.020664036,0.0017928939,0.002001756,0.0055491617,0.003163757,0.0051285247,0.0055672135,0.0029849284,0.0020406612],"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.00020600627,0.0002210327,0.00082957605,0.0003869612,0.0001864103,0.0000580172,0.00029350448,0.8089064,0.0011142984,0.07054711,0.019195868,0.09805487],"study_design_scores_gemma":[0.00003734239,0.00007425302,0.0001716358,0.0000308126,0.000021810078,0.00003937513,0.000059262307,0.93603605,0.0003133377,0.06112812,0.0020672283,0.000020740154],"about_ca_topic_score_codex":0.00762191,"about_ca_topic_score_gemma":0.0075299237,"teacher_disagreement_score":0.00762191,"about_ca_system_score_codex":0.0039468314,"about_ca_system_score_gemma":0.0031621063,"threshold_uncertainty_score":0.028636336},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074279314,0.010286019,0.013650726,0.07246689,0.57046384,0.00052286306,0.0030365484,0.001699733,0.32713056],"genre_scores_gemma":[0.0029979413,0.0051315837,0.0046115,0.016853381,0.17319256,0.00038259802,0.0027545614,0.0013924423,0.7926834],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978822,0.0004316274,0.00017505059,0.00037552044,0.0009648961,0.00017063877],"domain_scores_gemma":[0.9906489,0.00224891,0.00047049305,0.0011727967,0.004018789,0.001440122],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032721146,0.001501013,0.0017834888,0.0046828445,0.0024527668,0.0064821183,0.0017407931,0.0032713648,0.37018132],"category_scores_gemma":[0.015069563,0.0005303154,0.0013899105,0.0024239374,0.0010601347,0.0049776244,0.0036168138,0.004619573,0.26312497],"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.000011502182,0.000015415742,0.000059661754,0.0000700324,0.000002603171,0.000015244166,0.000016489035,0.000031541702,0.000053998687,0.0031916234,0.9657665,0.030765465],"study_design_scores_gemma":[0.00000415957,0.0000107638225,0.00024366025,0.0000911577,0.0000031538173,0.000042560863,0.00002606141,0.000081476675,0.00004608264,0.0053225113,0.99412256,0.0000058318037],"about_ca_topic_score_codex":0.0011877414,"about_ca_topic_score_gemma":0.002491162,"teacher_disagreement_score":0.37018132,"about_ca_system_score_codex":0.0016738336,"about_ca_system_score_gemma":0.003027923,"threshold_uncertainty_score":0.8983599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9066116,0.00046705425,0.06703887,0.002341816,0.000042319094,0.00015278606,0.003553234,0.00055551674,0.019236762],"genre_scores_gemma":[0.9526454,0.00029776565,0.032732073,0.00028995785,0.000087797365,0.00018953474,0.0059009898,0.00022512057,0.0076312823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761945,0.00052978884,0.00014700221,0.00059999264,0.0006715646,0.00043217908],"domain_scores_gemma":[0.9884166,0.006527628,0.002241667,0.0007401672,0.0009713984,0.0011025094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009628018,0.00072081503,0.0010642587,0.0029599483,0.0023691806,0.007776485,0.0023463035,0.0021490229,0.012607556],"category_scores_gemma":[0.0092227375,0.0011465215,0.0011783908,0.0037468013,0.002349004,0.010406791,0.0029736992,0.0021841314,0.0010910726],"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.0014623227,0.00059717236,0.022881372,0.0008261579,0.00022887993,0.0011419684,0.0033664163,0.12418919,0.007792381,0.77731514,0.015203348,0.044995576],"study_design_scores_gemma":[0.00013027061,0.000107839005,0.0051426785,0.00009133354,0.000087814005,0.000589147,0.0011509099,0.18600534,0.0041216007,0.7945374,0.007970193,0.000065322514],"about_ca_topic_score_codex":0.0037953279,"about_ca_topic_score_gemma":0.0037251844,"teacher_disagreement_score":0.012607556,"about_ca_system_score_codex":0.0033093418,"about_ca_system_score_gemma":0.0011468655,"threshold_uncertainty_score":0.042176425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78204453,0.00042636,0.16172217,0.0070238193,0.00014370342,0.00062885677,0.0017842961,0.00092295243,0.045303255],"genre_scores_gemma":[0.96322984,0.0001494143,0.027456693,0.0003211632,0.00006815719,0.00026900196,0.0009642751,0.000110682384,0.007430677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925431,0.0023984734,0.0004894374,0.0013624701,0.001578653,0.0016278215],"domain_scores_gemma":[0.9766075,0.01801845,0.0013745098,0.0014953738,0.0007140942,0.0017901328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025741092,0.0014204409,0.0019362965,0.0015235563,0.0024761918,0.0083256345,0.0034335146,0.0041227643,0.013442862],"category_scores_gemma":[0.01785026,0.0010936018,0.0021917608,0.0018175079,0.004744671,0.010020451,0.005349349,0.0042572925,0.000700085],"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.0011142555,0.00061148586,0.0047399304,0.00052485836,0.000255316,0.00082757504,0.0015743716,0.20178819,0.003836542,0.7548367,0.0064204466,0.023470338],"study_design_scores_gemma":[0.00032354938,0.00009148778,0.00061330356,0.000038184437,0.00006401902,0.0001682907,0.00030204185,0.34122843,0.0013801621,0.6530324,0.0027124595,0.000045734792],"about_ca_topic_score_codex":0.00706131,"about_ca_topic_score_gemma":0.0041674217,"teacher_disagreement_score":0.013442862,"about_ca_system_score_codex":0.0057347747,"about_ca_system_score_gemma":0.002735452,"threshold_uncertainty_score":0.04497087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015019109,0.026592156,0.0013897527,0.018084269,0.9288159,0.00006416023,0.00035354658,0.00012373862,0.024426378],"genre_scores_gemma":[0.0024259314,0.03476736,0.0017935698,0.0075084614,0.7712125,0.00013222841,0.00076644466,0.0004728833,0.18092063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965023,0.00047695308,0.00025458029,0.0005191145,0.0020079,0.00023910133],"domain_scores_gemma":[0.9918698,0.0022126709,0.00051461736,0.0003310176,0.003759277,0.0013126241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004555774,0.00357826,0.0031554608,0.006574285,0.00214073,0.00904498,0.0022899944,0.0037608,0.03858496],"category_scores_gemma":[0.008157568,0.0008462556,0.002176345,0.0036426191,0.0013002564,0.0035977436,0.0015657627,0.0074945395,0.027289497],"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.00005280832,0.00001661605,0.00001834648,0.00021991383,0.000014252339,0.00003392481,0.000006914931,0.0000916544,0.00012810565,0.000981185,0.9869113,0.011524887],"study_design_scores_gemma":[0.000027934395,0.00001926197,0.00013946448,0.00020449825,0.000028110428,0.000054368593,0.00001425638,0.00025499222,0.0001646314,0.0016599237,0.99742293,0.000009571273],"about_ca_topic_score_codex":0.0016606854,"about_ca_topic_score_gemma":0.004823272,"teacher_disagreement_score":0.03858496,"about_ca_system_score_codex":0.0037166697,"about_ca_system_score_gemma":0.0027334238,"threshold_uncertainty_score":0.12907952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66485095,0.0010792654,0.27703026,0.010492722,0.00017377337,0.00040339914,0.005708015,0.0015201927,0.038741417],"genre_scores_gemma":[0.92577547,0.0007795234,0.059031043,0.001005714,0.00031672095,0.0004862837,0.004641448,0.0006100236,0.0073538315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957865,0.0014343056,0.00019934167,0.0010918862,0.00074989937,0.0007381655],"domain_scores_gemma":[0.96322346,0.030104188,0.0022420133,0.0022677353,0.00077172555,0.0013909804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002667732,0.0013281438,0.0021118503,0.001477917,0.0020039377,0.004965453,0.0033759002,0.002787929,0.013448397],"category_scores_gemma":[0.020839412,0.0011516953,0.0029229634,0.0029178567,0.0030201594,0.010307857,0.0036247203,0.0043237433,0.0010751488],"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.0016580225,0.0007101077,0.010300647,0.00139592,0.00041359267,0.00094319315,0.0010908018,0.58725923,0.008698808,0.32644784,0.026262445,0.034819447],"study_design_scores_gemma":[0.00014844297,0.00013542594,0.001467097,0.00007396601,0.000097282034,0.0003513134,0.00017224925,0.6184491,0.0023216545,0.37303954,0.0037021134,0.00004175486],"about_ca_topic_score_codex":0.0051671057,"about_ca_topic_score_gemma":0.005554709,"teacher_disagreement_score":0.013448397,"about_ca_system_score_codex":0.0039202827,"about_ca_system_score_gemma":0.0019492102,"threshold_uncertainty_score":0.044989347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025180073,0.00037889363,0.9603579,0.0009902774,0.0001331378,0.00013802153,0.00024061998,0.0017963202,0.010784697],"genre_scores_gemma":[0.30578974,0.00023587616,0.68110937,0.00039729563,0.000118835946,0.0004235491,0.00070634246,0.00061205373,0.010606931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983956,0.0006117722,0.00010995974,0.00031723676,0.0003281602,0.0002372871],"domain_scores_gemma":[0.9938471,0.0035693117,0.000295832,0.0015027156,0.0005457652,0.0002391876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022556065,0.0010466658,0.0013151366,0.0011830459,0.0014942695,0.002298488,0.0033781566,0.0025144888,0.017129447],"category_scores_gemma":[0.012802904,0.00074912654,0.0012676349,0.0016271237,0.0018147808,0.004530418,0.003574975,0.0028125406,0.0025762254],"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.0010287225,0.0003598769,0.002060339,0.00039558302,0.0001249665,0.00023997239,0.00030198012,0.44496313,0.0022584605,0.21266516,0.028916191,0.3066855],"study_design_scores_gemma":[0.00012311156,0.0000660645,0.00009420568,0.000024716372,0.000021008043,0.00006367573,0.000046694295,0.8490986,0.00087485026,0.14673199,0.0028449672,0.000010140551],"about_ca_topic_score_codex":0.0026203154,"about_ca_topic_score_gemma":0.003125471,"teacher_disagreement_score":0.017129447,"about_ca_system_score_codex":0.001559207,"about_ca_system_score_gemma":0.0019325431,"threshold_uncertainty_score":0.057303727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.564531,0.000435195,0.299902,0.0040213163,0.0009542518,0.0005748399,0.0039205593,0.0018902675,0.12377042],"genre_scores_gemma":[0.86959976,0.00019251592,0.08587385,0.00069509214,0.00039854826,0.00037584675,0.004684928,0.0009606809,0.03721868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978003,0.00044092358,0.00009538652,0.0005890345,0.0004435405,0.0006308131],"domain_scores_gemma":[0.98946416,0.0057188533,0.0008193535,0.0016565355,0.0008179396,0.0015232431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001675956,0.0011426596,0.0015244975,0.0018389795,0.0038219846,0.004274525,0.0028309748,0.0026375982,0.013787718],"category_scores_gemma":[0.012903493,0.0008963357,0.0020401077,0.0016019609,0.002432729,0.004228619,0.0028193572,0.003503993,0.0020603696],"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.0040234425,0.0008997322,0.008962146,0.0007423715,0.00027532695,0.0027789236,0.0015883346,0.05371606,0.025301084,0.7717953,0.06285116,0.06706611],"study_design_scores_gemma":[0.00023635972,0.00019413757,0.0037812977,0.00009120321,0.00017563875,0.0019193869,0.0005910619,0.18444991,0.015643878,0.7797597,0.013067453,0.000089820154],"about_ca_topic_score_codex":0.002333136,"about_ca_topic_score_gemma":0.004017726,"teacher_disagreement_score":0.013787718,"about_ca_system_score_codex":0.0011574996,"about_ca_system_score_gemma":0.0020600841,"threshold_uncertainty_score":0.046124518},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48623624,0.004415205,0.3986145,0.014550295,0.0007381146,0.000643215,0.005885888,0.0015632802,0.08735324],"genre_scores_gemma":[0.7577903,0.0030575374,0.16632035,0.0012278989,0.0013795575,0.0007900373,0.0047975024,0.0011216634,0.063515216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832207,0.00041669447,0.000075977005,0.00033651778,0.00051929726,0.0003294671],"domain_scores_gemma":[0.9867287,0.010655144,0.00075674546,0.0007175947,0.00045931598,0.00068247697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012055781,0.0013415011,0.0017361003,0.0018522957,0.0017142148,0.0034084402,0.0032710556,0.0038823793,0.025280207],"category_scores_gemma":[0.013677522,0.0011798015,0.0016564502,0.0045861313,0.0018278656,0.010152278,0.003180498,0.0049346173,0.0015713255],"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.0015993108,0.00092769245,0.0040702573,0.0017842264,0.0003408932,0.0009284873,0.0007060578,0.2829299,0.006463125,0.5265246,0.053994965,0.11973055],"study_design_scores_gemma":[0.00024245783,0.00018154454,0.0007213538,0.00007750518,0.00013889138,0.00040528257,0.00018172366,0.24304402,0.0019716287,0.7440506,0.008949842,0.00003521463],"about_ca_topic_score_codex":0.0016214355,"about_ca_topic_score_gemma":0.0022243254,"teacher_disagreement_score":0.025280207,"about_ca_system_score_codex":0.0027483788,"about_ca_system_score_gemma":0.0014601259,"threshold_uncertainty_score":0.084570706},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032557358,0.010144954,0.004627579,0.024650797,0.9145392,0.00018291277,0.0017127048,0.00067945075,0.04313686],"genre_scores_gemma":[0.001967545,0.00942934,0.0026983735,0.00873963,0.5279624,0.00024579573,0.004214131,0.0017155226,0.44302732],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978555,0.0002769149,0.0001496282,0.000353622,0.001156894,0.0002073277],"domain_scores_gemma":[0.9850809,0.0023851574,0.0007131961,0.0008593678,0.0076501537,0.003311318],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027372455,0.0025703264,0.0033503168,0.004240115,0.0024078763,0.008073142,0.0021874905,0.0030926396,0.31503662],"category_scores_gemma":[0.009798291,0.00083118875,0.0016598942,0.003042334,0.00066996313,0.0043913005,0.0028522413,0.0055895355,0.2416478],"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.000022233236,0.000017164888,0.000021836002,0.00005419171,0.0000037173754,0.000009250337,0.000002794254,0.000040480794,0.00008338017,0.00023936629,0.9886177,0.010887858],"study_design_scores_gemma":[0.000025793981,0.00006412334,0.00047007963,0.00015273519,0.000016872651,0.00005554401,0.000020551874,0.0004530306,0.00017324272,0.0020490014,0.99650264,0.00001629957],"about_ca_topic_score_codex":0.0020622832,"about_ca_topic_score_gemma":0.003921583,"teacher_disagreement_score":0.31503662,"about_ca_system_score_codex":0.0021996326,"about_ca_system_score_gemma":0.0023200258,"threshold_uncertainty_score":0.9770171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017048307,0.00016559522,0.9708217,0.00032856627,0.00012927921,0.00019575407,0.00014729961,0.0013113372,0.009852243],"genre_scores_gemma":[0.14451538,0.00011697776,0.84512657,0.00031269426,0.00008094055,0.00041723734,0.0006953939,0.00041281097,0.008322026],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995036,0.00012319746,0.000024489165,0.00010894817,0.00016569006,0.00007393819],"domain_scores_gemma":[0.99883026,0.0006674218,0.000052135714,0.00015200258,0.0001942675,0.000103878236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069150596,0.0011774079,0.0011468617,0.0013857511,0.0011762702,0.0013700847,0.0024688905,0.0017001041,0.013673372],"category_scores_gemma":[0.0036861608,0.0006674722,0.00094117376,0.0016307683,0.00088325376,0.0015724299,0.0021994726,0.0026249115,0.001945304],"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.00040266398,0.0005927583,0.0008281002,0.0004231305,0.00007784747,0.00016677372,0.00021982874,0.3057171,0.008820652,0.09828188,0.030847864,0.5536214],"study_design_scores_gemma":[0.00009639644,0.000094902585,0.00011466952,0.000017046734,0.000017382505,0.000050680253,0.000041444175,0.93714607,0.0014280517,0.05796548,0.00301284,0.000015166235],"about_ca_topic_score_codex":0.004295609,"about_ca_topic_score_gemma":0.006567114,"teacher_disagreement_score":0.013673372,"about_ca_system_score_codex":0.0009595183,"about_ca_system_score_gemma":0.0019326361,"threshold_uncertainty_score":0.045741975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016915053,0.00033827493,0.9949839,0.00035555087,0.000051199208,0.000028180291,0.000056059074,0.00014478211,0.0023505043],"genre_scores_gemma":[0.21854264,0.0015421207,0.7564923,0.0011458899,0.0006964266,0.0007554144,0.00072885444,0.0011581203,0.01893822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996995,0.0015752679,0.00009748007,0.00044435778,0.0006932154,0.00019470383],"domain_scores_gemma":[0.99439925,0.0041499934,0.00023649668,0.0005424352,0.0004978282,0.00017395153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004075321,0.0018932971,0.0021700829,0.0013127751,0.0007761553,0.0018654596,0.0027205376,0.0021816895,0.0063578715],"category_scores_gemma":[0.016203046,0.0012668686,0.0017336971,0.0019066327,0.0020200296,0.0028290893,0.0039824024,0.0053026443,0.001652539],"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.000119244534,0.00022206795,0.00044605133,0.00039208762,0.00014229573,0.000113606,0.00014115754,0.39929128,0.0022324293,0.47990045,0.016168358,0.100831],"study_design_scores_gemma":[0.000013742758,0.000023294695,0.000067027235,0.000020882087,0.0000134530355,0.000027967235,0.000009902728,0.8116735,0.00035750415,0.18620233,0.0015795018,0.000010820587],"about_ca_topic_score_codex":0.0024502887,"about_ca_topic_score_gemma":0.0037773042,"teacher_disagreement_score":0.0063578715,"about_ca_system_score_codex":0.0016321423,"about_ca_system_score_gemma":0.0020623656,"threshold_uncertainty_score":0.021552622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016653944,0.0006393141,0.9786243,0.0005632573,0.00010474262,0.000081170096,0.000112665795,0.00051286456,0.002707726],"genre_scores_gemma":[0.510458,0.0006723701,0.4832324,0.00035581592,0.00021000188,0.00043348633,0.0005859278,0.0004181898,0.0036338072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982145,0.0009341817,0.000066364075,0.00020352562,0.0003406099,0.00024083717],"domain_scores_gemma":[0.989608,0.008411783,0.00054132537,0.00057625107,0.000545079,0.00031765236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041523282,0.0014510475,0.0018909825,0.0012451409,0.00080591463,0.001632098,0.0026012794,0.0018076615,0.0028963692],"category_scores_gemma":[0.016628915,0.00073720794,0.00125218,0.0020535258,0.0016167538,0.0022367768,0.0014857189,0.0027544326,0.0003885016],"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.0002357608,0.00011327894,0.0004885753,0.00011675516,0.00005363972,0.000029247276,0.00004972117,0.93169624,0.00048561045,0.025645416,0.0028904357,0.03819532],"study_design_scores_gemma":[0.000019759485,0.000016714048,0.000044321136,0.000008385001,0.000007365007,0.000006371154,0.000005881563,0.9840402,0.00013319305,0.015543241,0.00017182482,0.00000279401],"about_ca_topic_score_codex":0.006713049,"about_ca_topic_score_gemma":0.005970202,"teacher_disagreement_score":0.006713049,"about_ca_system_score_codex":0.0026329332,"about_ca_system_score_gemma":0.0035262157,"threshold_uncertainty_score":0.021959841},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6312804,0.002184086,0.23002984,0.013639157,0.0006095265,0.00011225158,0.0017038287,0.00094711105,0.11949378],"genre_scores_gemma":[0.94851494,0.0009769328,0.025215218,0.00162518,0.00068264804,0.0001829983,0.0014144877,0.00027452255,0.021113263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852884,0.00041596236,0.00007406719,0.00033490488,0.00032454674,0.00032165405],"domain_scores_gemma":[0.9920948,0.00526201,0.000729192,0.0005827914,0.0004734558,0.000857707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018056649,0.00074512133,0.0011078555,0.0026585853,0.0032902777,0.00636496,0.0018552426,0.001926574,0.013807054],"category_scores_gemma":[0.00929368,0.0008006377,0.0011232407,0.0028936905,0.004574561,0.014535373,0.003473928,0.0051352438,0.0010704895],"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.00012359161,0.000075116244,0.000605672,0.000061078106,0.0000095517535,0.000049785976,0.00039189612,0.00080565107,0.00051557244,0.98661184,0.002665713,0.008084627],"study_design_scores_gemma":[0.00001626371,0.000010834008,0.00017897379,0.000009101711,0.000006001881,0.000035298268,0.00012447477,0.002699061,0.00019819663,0.995805,0.00090904,0.000007747141],"about_ca_topic_score_codex":0.0010871895,"about_ca_topic_score_gemma":0.0014691715,"teacher_disagreement_score":0.013807054,"about_ca_system_score_codex":0.00232112,"about_ca_system_score_gemma":0.0014092958,"threshold_uncertainty_score":0.04618919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042440757,0.0124728875,0.9106131,0.005901194,0.0008552292,0.00045328838,0.0016406055,0.0021003603,0.023522636],"genre_scores_gemma":[0.38655153,0.009196966,0.5716941,0.0022477366,0.0022381197,0.0014316229,0.005051725,0.0030468982,0.018541418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98587865,0.004604042,0.0006446699,0.003124386,0.0036263117,0.002122026],"domain_scores_gemma":[0.9371958,0.040444717,0.003184835,0.011773208,0.004707404,0.0026939877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011845443,0.005794395,0.0064973803,0.0051644645,0.0051207086,0.01321442,0.019209754,0.0071326955,0.015526065],"category_scores_gemma":[0.072473064,0.0026763042,0.004976871,0.018165752,0.00686887,0.025884775,0.01071157,0.016529944,0.004857878],"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.0023643253,0.0013721273,0.004045721,0.0015468079,0.0005218607,0.00017843663,0.0011889979,0.43004856,0.0035726503,0.35739934,0.04773328,0.15002787],"study_design_scores_gemma":[0.00014862468,0.00013269184,0.00068014197,0.00014461909,0.00021707288,0.00021343702,0.00029253462,0.70781887,0.0016314394,0.28208235,0.0065658134,0.0000723881],"about_ca_topic_score_codex":0.010500015,"about_ca_topic_score_gemma":0.015354667,"teacher_disagreement_score":0.019209754,"about_ca_system_score_codex":0.015531459,"about_ca_system_score_gemma":0.009872753,"threshold_uncertainty_score":0.11268914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042246263,0.000280276,0.9910836,0.00016591448,0.00014264742,0.000028208726,0.00003634009,0.00020188448,0.0038364618],"genre_scores_gemma":[0.17213348,0.00069422595,0.8152145,0.0003339103,0.0002927268,0.00026180944,0.0002585385,0.0005283463,0.010282486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985044,0.0006755557,0.00005977896,0.00021416224,0.0004231408,0.00012302701],"domain_scores_gemma":[0.9976044,0.0012346979,0.00012695756,0.0005888383,0.0003183987,0.00012664388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027548661,0.0017127605,0.0015217048,0.0012282114,0.0006661044,0.0018666079,0.0027042339,0.0014870125,0.0068058167],"category_scores_gemma":[0.009368091,0.00073819037,0.0012591028,0.0017909997,0.0012899393,0.0033109495,0.0035744198,0.0046455264,0.0018752614],"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.00023365549,0.00025125194,0.00059497205,0.00021466591,0.00012497688,0.000084556894,0.000118161435,0.5775818,0.0023796523,0.2478482,0.008360705,0.16220737],"study_design_scores_gemma":[0.000020498981,0.00002162732,0.00004132304,0.000017496208,0.000013342797,0.000020975154,0.000008009996,0.9494693,0.0005512353,0.047460422,0.0023687996,0.000006855077],"about_ca_topic_score_codex":0.0021620595,"about_ca_topic_score_gemma":0.0032555258,"teacher_disagreement_score":0.0068058167,"about_ca_system_score_codex":0.001220132,"about_ca_system_score_gemma":0.0016950252,"threshold_uncertainty_score":0.022767723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10276844,0.0023426365,0.8724887,0.0024885207,0.0002836284,0.0004554837,0.0018226143,0.0030743082,0.014275594],"genre_scores_gemma":[0.34525052,0.0017184558,0.6331534,0.0006997452,0.00036541445,0.00070414867,0.004472443,0.0010371564,0.012598738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971635,0.00068360235,0.00013824503,0.00076604524,0.0006693006,0.000579395],"domain_scores_gemma":[0.98622364,0.009295085,0.00068629486,0.0024289594,0.0006077102,0.0007583928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476975,0.002875835,0.0029580223,0.0028884504,0.0021780045,0.0043175505,0.0070981216,0.0037545946,0.017437877],"category_scores_gemma":[0.016847355,0.0018160379,0.0029760285,0.0074539413,0.002409125,0.011496649,0.005377863,0.0052172365,0.0028777036],"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.0017791258,0.0011513353,0.0042585577,0.0013274834,0.00036482167,0.0002640414,0.00097464013,0.42937234,0.0047009415,0.14312845,0.040586267,0.372092],"study_design_scores_gemma":[0.0003307747,0.00015740436,0.0004912616,0.00009662045,0.00018270964,0.0002523043,0.0002623471,0.7286566,0.0021128103,0.26183984,0.005584017,0.000033346645],"about_ca_topic_score_codex":0.0052502975,"about_ca_topic_score_gemma":0.007968389,"teacher_disagreement_score":0.017437877,"about_ca_system_score_codex":0.00429088,"about_ca_system_score_gemma":0.0029884698,"threshold_uncertainty_score":0.058335483},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57509536,0.0009755035,0.35914806,0.006355643,0.00022936896,0.00017196096,0.00198817,0.0013630053,0.054672904],"genre_scores_gemma":[0.9651213,0.00037054287,0.02533876,0.00030622238,0.00015477714,0.0001342345,0.0010695221,0.0003212962,0.0071832025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974291,0.0007488619,0.00012808094,0.0005940609,0.0005930485,0.0005068034],"domain_scores_gemma":[0.9850677,0.010407563,0.0008828737,0.0025367253,0.0005211004,0.0005840249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015627086,0.0008909565,0.0016344221,0.00091593666,0.001580727,0.00549254,0.003161693,0.0025181214,0.018971428],"category_scores_gemma":[0.0168299,0.0008544099,0.0019233539,0.0017325983,0.0029486374,0.011170028,0.0032495786,0.0040553664,0.0009685677],"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.00033172444,0.00012877444,0.0017171203,0.00020395186,0.000084757405,0.00017153632,0.0003067669,0.12262932,0.0023580305,0.8497587,0.005714607,0.016594743],"study_design_scores_gemma":[0.000039719773,0.000021084754,0.0004131253,0.0000105330855,0.000020694435,0.000053655836,0.00005700609,0.15774134,0.0006475488,0.8400021,0.0009791062,0.000013960835],"about_ca_topic_score_codex":0.0022609418,"about_ca_topic_score_gemma":0.0024301047,"teacher_disagreement_score":0.018971428,"about_ca_system_score_codex":0.0039261845,"about_ca_system_score_gemma":0.002170433,"threshold_uncertainty_score":0.063465714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009104906,0.00028381543,0.98484147,0.0003664694,0.0000707826,0.00005811112,0.000193425,0.0012351511,0.0038457306],"genre_scores_gemma":[0.15967491,0.00050012796,0.8266256,0.00032659638,0.00024799604,0.0005029363,0.0014937002,0.0012922671,0.009335925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770325,0.00088318577,0.000110671834,0.000610822,0.00053514546,0.00015696266],"domain_scores_gemma":[0.9898443,0.0070507866,0.00034236704,0.001747267,0.000749868,0.00026540327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028904234,0.0016109808,0.0019307827,0.0025968095,0.0019206152,0.0023504135,0.0036161353,0.002407497,0.014438478],"category_scores_gemma":[0.020711005,0.0011387493,0.001799435,0.005234594,0.0027118307,0.0049571055,0.0054275896,0.0036701683,0.0030941146],"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.00054221135,0.00028871757,0.0011524139,0.000283044,0.00009059589,0.00013877341,0.00039404567,0.24825314,0.0025684275,0.40448585,0.016239902,0.3255629],"study_design_scores_gemma":[0.000058829482,0.0000394132,0.00013266712,0.000027761318,0.000018769726,0.000060121234,0.00004360352,0.48208812,0.0010278745,0.5117038,0.004780471,0.000018593792],"about_ca_topic_score_codex":0.0034981172,"about_ca_topic_score_gemma":0.004513877,"teacher_disagreement_score":0.014438478,"about_ca_system_score_codex":0.0014742202,"about_ca_system_score_gemma":0.0024046528,"threshold_uncertainty_score":0.048301518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09929812,0.0013818064,0.87768877,0.0005192667,0.00007774615,0.000057909296,0.00023189823,0.0005529548,0.020191541],"genre_scores_gemma":[0.7342095,0.0012484922,0.24687603,0.00018751838,0.00012543249,0.000113720576,0.00059695175,0.0004767985,0.016165607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911433,0.00024055,0.000052276522,0.0002461223,0.0002324918,0.00011417197],"domain_scores_gemma":[0.9977798,0.001081637,0.00033599595,0.00039577295,0.00023918875,0.00016756674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130845,0.0006469906,0.0012022159,0.0017838546,0.0010251527,0.0022709484,0.001637422,0.0015853213,0.0061929487],"category_scores_gemma":[0.008279037,0.00067472534,0.0008526434,0.002041248,0.0016903364,0.005867577,0.0038281023,0.0018958846,0.0011211871],"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.0003369287,0.00010561143,0.0016698573,0.00030285332,0.00006970085,0.00015916416,0.00036616414,0.11151223,0.0057096346,0.7209689,0.0052913087,0.15350762],"study_design_scores_gemma":[0.000051108596,0.00010823395,0.0010037166,0.00005759873,0.000039884424,0.00023212998,0.0002343054,0.25567305,0.0041264934,0.7318596,0.006583587,0.000030223195],"about_ca_topic_score_codex":0.0009198442,"about_ca_topic_score_gemma":0.0013681627,"teacher_disagreement_score":0.0061929487,"about_ca_system_score_codex":0.00085360144,"about_ca_system_score_gemma":0.0005356276,"threshold_uncertainty_score":0.020717502},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5087892,0.0014061636,0.38434374,0.0025346573,0.0002787029,0.00023356357,0.0013920269,0.0025860358,0.09843594],"genre_scores_gemma":[0.91349936,0.0005478947,0.05450242,0.00033241982,0.00006624346,0.00014123517,0.00085762254,0.0005163193,0.029536536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987859,0.00021393005,0.000102161255,0.00027202215,0.00031414957,0.00031192668],"domain_scores_gemma":[0.99415094,0.003538534,0.00032807083,0.0009702701,0.0006786379,0.00033362184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013454708,0.00049804145,0.0009914686,0.0022953968,0.0039462238,0.0054525705,0.0014914839,0.0016431357,0.012011469],"category_scores_gemma":[0.010587148,0.00072951167,0.0014870875,0.0030635144,0.0042641205,0.01371952,0.004866482,0.0024638553,0.0012647315],"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.00010307281,0.000018247714,0.00061398244,0.00007672076,0.000009721197,0.0001721586,0.0007024968,0.0039897272,0.0007856101,0.9810229,0.0015545173,0.010950802],"study_design_scores_gemma":[0.000020072031,0.000012434007,0.00016830166,0.00001927678,0.000017638493,0.00014317561,0.00035089356,0.010390195,0.0014079629,0.9817063,0.0057458035,0.000018031242],"about_ca_topic_score_codex":0.0048549334,"about_ca_topic_score_gemma":0.0063452353,"teacher_disagreement_score":0.012011469,"about_ca_system_score_codex":0.0024406873,"about_ca_system_score_gemma":0.0016693654,"threshold_uncertainty_score":0.040182352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050970517,0.003588293,0.9160111,0.0008180422,0.0005733018,0.00008373449,0.00011247845,0.00048408707,0.027358467],"genre_scores_gemma":[0.6738548,0.0042800126,0.3038469,0.00031933974,0.0007489996,0.00021750054,0.00029148956,0.00032933312,0.016111672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932504,0.00023594663,0.000043940967,0.00013911242,0.00017023439,0.0000857427],"domain_scores_gemma":[0.99859995,0.00086859404,0.00014848418,0.00020320325,0.000087201064,0.00009249712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055213907,0.0010649596,0.0012665825,0.0012829218,0.0010276478,0.0019397138,0.0011491368,0.0014798096,0.0057217386],"category_scores_gemma":[0.0041138288,0.0006574757,0.001399871,0.0037671525,0.0013171078,0.0020330418,0.0019436659,0.0021628148,0.00074343465],"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.00019061068,0.00016197666,0.0006008654,0.00029649964,0.000051109128,0.00040663918,0.0002584476,0.6369121,0.008139939,0.20431921,0.004349526,0.14431307],"study_design_scores_gemma":[0.000020436595,0.00009793002,0.00045896097,0.00005099055,0.000022394788,0.00026635986,0.000100260106,0.68027407,0.0020737788,0.3098433,0.006763042,0.000028500537],"about_ca_topic_score_codex":0.0009090079,"about_ca_topic_score_gemma":0.0010118902,"teacher_disagreement_score":0.0057217386,"about_ca_system_score_codex":0.00079439045,"about_ca_system_score_gemma":0.0003734245,"threshold_uncertainty_score":0.019141138},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5097666,0.00032890154,0.46824145,0.0017859878,0.00007368496,0.0005086112,0.0041439733,0.003962406,0.01118838],"genre_scores_gemma":[0.72054166,0.0001357148,0.26780623,0.00025283848,0.000059474136,0.0003264259,0.0048704925,0.00054526,0.0054619103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742836,0.0003875383,0.00018375173,0.0007406046,0.00090102176,0.00035877273],"domain_scores_gemma":[0.99034214,0.004379621,0.001188258,0.002188966,0.0011240274,0.00077698514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011467547,0.00077332964,0.0012684864,0.0013940565,0.0019661991,0.0026240554,0.0025447686,0.0013612943,0.00702421],"category_scores_gemma":[0.0076249363,0.00082623324,0.0010909417,0.0025353031,0.001564966,0.006001157,0.0040185847,0.0025253752,0.0013443186],"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.004502618,0.0018094516,0.02362699,0.001348562,0.00039279406,0.0010972753,0.0028817472,0.19033284,0.1024145,0.36891574,0.038156636,0.26452097],"study_design_scores_gemma":[0.0002867676,0.00032169692,0.0039687767,0.00008061513,0.00010732597,0.0008776645,0.00082425284,0.71113926,0.06126779,0.20028229,0.020713989,0.00012961066],"about_ca_topic_score_codex":0.0028245812,"about_ca_topic_score_gemma":0.0040085623,"teacher_disagreement_score":0.00702421,"about_ca_system_score_codex":0.0024757443,"about_ca_system_score_gemma":0.0020942818,"threshold_uncertainty_score":0.023498297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47583678,0.0018192803,0.48936284,0.002101898,0.00019656988,0.00031433982,0.0019648487,0.002905504,0.025497971],"genre_scores_gemma":[0.7713129,0.0011647742,0.21620159,0.0002738487,0.00017991064,0.00017938825,0.0033664827,0.0005864898,0.006734533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915123,0.00021856163,0.000041718988,0.00022842479,0.00022011415,0.00014001224],"domain_scores_gemma":[0.9919527,0.0062371804,0.00046433255,0.0006467529,0.00042955272,0.0002693212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008182259,0.0012752753,0.001366794,0.0031107808,0.001358581,0.0026239692,0.002712923,0.0015512028,0.009500842],"category_scores_gemma":[0.01462616,0.000754921,0.0009933349,0.0037863748,0.0020534983,0.005506602,0.0031113916,0.0017095486,0.0010909655],"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.00086128793,0.00031960022,0.011457317,0.00093301485,0.00016201897,0.00034190028,0.0011520375,0.5468916,0.007377754,0.14781405,0.015426505,0.26726285],"study_design_scores_gemma":[0.00007723301,0.0001224461,0.002179017,0.000091907605,0.00005841016,0.000109781846,0.0003199937,0.73945904,0.0028633776,0.25152808,0.0031620201,0.000028669103],"about_ca_topic_score_codex":0.0065431446,"about_ca_topic_score_gemma":0.01316529,"teacher_disagreement_score":0.009500842,"about_ca_system_score_codex":0.0012391815,"about_ca_system_score_gemma":0.00091837946,"threshold_uncertainty_score":0.03178346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03301472,0.0016256421,0.9381371,0.0017393538,0.00019496035,0.00004800005,0.00020858902,0.00020761616,0.024823977],"genre_scores_gemma":[0.6655213,0.0029868362,0.30132014,0.0014973584,0.00087962183,0.00039677735,0.000988297,0.0005966237,0.025813047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966054,0.0015947402,0.00015949477,0.00058122294,0.00077549065,0.0002837126],"domain_scores_gemma":[0.9885562,0.008475611,0.0005788406,0.0013211843,0.0007184354,0.0003498187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039997958,0.0016245726,0.0023628045,0.001795402,0.0018168353,0.0035067548,0.0029968454,0.0026839185,0.0050556236],"category_scores_gemma":[0.020823134,0.0010595159,0.0016172496,0.002328231,0.005356252,0.00996204,0.0069979876,0.0061419182,0.00070655777],"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.00009631124,0.000041141262,0.0002631104,0.000088120774,0.000032000353,0.000021170194,0.00012677404,0.027534937,0.00035130067,0.95547456,0.0017617317,0.0142087955],"study_design_scores_gemma":[0.00001438697,0.000023608347,0.00013620862,0.000014524636,0.000008495196,0.00001688381,0.000028772774,0.09757344,0.00019421095,0.9005761,0.0014035059,0.000009905659],"about_ca_topic_score_codex":0.002871459,"about_ca_topic_score_gemma":0.0022613937,"teacher_disagreement_score":0.0050556236,"about_ca_system_score_codex":0.0023728511,"about_ca_system_score_gemma":0.0017273658,"threshold_uncertainty_score":0.021153212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10861218,0.00040118775,0.71895134,0.0015637105,0.00046419242,0.00012193344,0.0006536808,0.0019907216,0.16724108],"genre_scores_gemma":[0.6511799,0.00067960186,0.28962618,0.00088265457,0.00039917114,0.00040199424,0.0012520549,0.0012406799,0.054337744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983883,0.0005425039,0.00006452376,0.00023359856,0.000531139,0.0002399105],"domain_scores_gemma":[0.99696153,0.0014910296,0.00015258462,0.0006704151,0.000436615,0.0002877242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147348,0.00071947125,0.0010452843,0.0022585252,0.0019767936,0.003233222,0.0018395913,0.0012642985,0.018931905],"category_scores_gemma":[0.0074191913,0.000664573,0.001018075,0.0023309074,0.0023294163,0.0057348725,0.0042555262,0.0038948597,0.003905884],"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.000049484966,0.000053806994,0.00020075061,0.00004483074,0.0000066270727,0.000025387286,0.00007572286,0.002613893,0.0006510572,0.97091764,0.0037306722,0.021630112],"study_design_scores_gemma":[0.000012623813,0.000010603869,0.000048013004,0.000013622469,0.0000052176924,0.000036405312,0.000028154576,0.023492258,0.00046016523,0.97319263,0.0026923316,0.000008040922],"about_ca_topic_score_codex":0.0012729112,"about_ca_topic_score_gemma":0.0020573675,"teacher_disagreement_score":0.018931905,"about_ca_system_score_codex":0.0014223543,"about_ca_system_score_gemma":0.0011616948,"threshold_uncertainty_score":0.06333351},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19277132,0.0015200293,0.74198574,0.015675597,0.0014773499,0.00017318179,0.00033520913,0.000892712,0.045168824],"genre_scores_gemma":[0.9581061,0.00023523471,0.031497914,0.00075038575,0.00059636676,0.000077602956,0.000058374066,0.00020127081,0.008476768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621296,0.0014267559,0.00014889009,0.0006889659,0.00058672554,0.00093567773],"domain_scores_gemma":[0.9740089,0.018496023,0.001383883,0.003030714,0.0014140309,0.0016664024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010471126,0.00070766226,0.0021270178,0.00086227333,0.0029745856,0.005290375,0.002570725,0.0033662333,0.008556717],"category_scores_gemma":[0.056853928,0.0008891379,0.0006001685,0.0010478706,0.0028679264,0.010908154,0.0037284987,0.004200865,0.00062716054],"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.0018620576,0.00033914484,0.005853156,0.0002506352,0.0001314472,0.00043604994,0.00080391497,0.12265402,0.0030290575,0.7558997,0.022136224,0.0866045],"study_design_scores_gemma":[0.00008801359,0.000055815453,0.0005098386,0.000029048004,0.000040605562,0.0001284813,0.00027794286,0.23468748,0.0008058666,0.7594009,0.003955331,0.000020659107],"about_ca_topic_score_codex":0.0016393876,"about_ca_topic_score_gemma":0.0018582519,"teacher_disagreement_score":0.010471126,"about_ca_system_score_codex":0.0019313378,"about_ca_system_score_gemma":0.0025687597,"threshold_uncertainty_score":0.055377245},"labels":[],"label_agreement":null}]}