{"meta":{"query_hash":"664228451d50","filters":{"venue":"Journal of Algorithms"},"cohort_total":23,"direct_labels_cover":0,"predictions_cover":23,"exported":23,"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/664228451d50","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Algorithms"},"results":[{"id":"W1546783087","doi":"10.1006/jagm.2001.1169","title":"How Helpers Hasten h-Relations","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Attachment and Relationship Dynamics","field":"Psychology","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":"Western University","funders":"","keywords":"Computer science; Network packet; Scheduling (production processes); Set (abstract data type); Computer network; Distributed computing; Parallel computing; Theoretical computer science; Mathematics; Mathematical optimization; Programming language","score_opus":0.02137014463455823,"score_gpt":0.3530840445356046,"score_spread":0.3317138999010464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546783087","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.78453505,0.00025421355,0.10651576,0.003207417,0.00018044225,0.00014145148,0.00016770329,0.00067902345,0.10431906],"genre_scores_gemma":[0.97139865,0.00006901976,0.012112607,0.0001395428,0.000029186871,0.000027066857,0.00009547326,0.00009768163,0.016030896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99742043,0.0013234713,0.00008985283,0.0004323895,0.00039894567,0.00033486253],"domain_scores_gemma":[0.985299,0.008154407,0.00072649226,0.0027521232,0.0015771232,0.0014908937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036018675,0.00028845074,0.0003705051,0.000784451,0.0022614498,0.0036662943,0.0010547698,0.0013810463,0.025400262],"category_scores_gemma":[0.027063124,0.0005950369,0.00048338898,0.0006120215,0.0018891349,0.007788525,0.003288691,0.0015900771,0.0030765804],"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.0009726154,0.00067274924,0.093686655,0.00018603628,0.00008056734,0.0006430312,0.026433019,0.0070265294,0.0109255165,0.615038,0.013952217,0.2303831],"study_design_scores_gemma":[0.00026220747,0.0008848925,0.052700046,0.00017269557,0.00019061044,0.0015245251,0.03094028,0.1442389,0.009837739,0.69963765,0.05947122,0.00013915559],"about_ca_topic_score_codex":0.0039696237,"about_ca_topic_score_gemma":0.004440887,"teacher_disagreement_score":0.025400262,"about_ca_system_score_codex":0.0012024937,"about_ca_system_score_gemma":0.0011587385,"threshold_uncertainty_score":0.08497232},"labels":[],"label_agreement":null},{"id":"W1572683371","doi":"10.1016/s0196-6774(03)00086-5","title":"Selecting the branches for an evolutionary tree.","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Genomics and Phylogenetic Studies","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":"University of Waterloo","funders":"","keywords":"Sequence (biology); Tree (set theory); Polynomial; Polynomial-time approximation scheme; Computer science; Integer (computer science); Time complexity; Mathematics; Approximation algorithm; Scheme (mathematics); Algorithm; Mathematical optimization; Combinatorics; Biology","score_opus":0.018670791150418253,"score_gpt":0.26591722306746146,"score_spread":0.2472464319170432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572683371","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.08212812,0.0020155085,0.9039899,0.0018521169,0.00026490772,0.00034060722,0.00095749384,0.0033238963,0.0051274053],"genre_scores_gemma":[0.15308933,0.00047100268,0.84099954,0.0003510439,0.00013043976,0.0003271075,0.0023078946,0.0006525774,0.0016711599],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979539,0.0011279813,0.00018797681,0.00035726203,0.0002409243,0.00013193017],"domain_scores_gemma":[0.9820185,0.014790127,0.00047700515,0.0013511635,0.00090607424,0.0004571077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005954068,0.0009875327,0.0013076632,0.0028246443,0.0014136274,0.0022698152,0.0023262613,0.0026167661,0.00785476],"category_scores_gemma":[0.034810886,0.0009017358,0.0012858001,0.0028307997,0.0010589614,0.004130185,0.0020100484,0.0031121948,0.0030164574],"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.001554475,0.0005196206,0.021261912,0.001036466,0.0007470323,0.00038854743,0.0012529744,0.13294813,0.0063365987,0.047336243,0.02869983,0.7579181],"study_design_scores_gemma":[0.000367351,0.00031803557,0.0018628394,0.0003585256,0.00033054478,0.0003980851,0.00065891247,0.7979772,0.002843589,0.18020663,0.014631608,0.00004657747],"about_ca_topic_score_codex":0.0008247029,"about_ca_topic_score_gemma":0.0031715324,"teacher_disagreement_score":0.00785476,"about_ca_system_score_codex":0.000638431,"about_ca_system_score_gemma":0.0015023693,"threshold_uncertainty_score":0.031488538},"labels":[],"label_agreement":null},{"id":"W1972805029","doi":"10.1006/jagm.2000.1133","title":"Constructing Optimal Trees from Quartets","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":77,"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":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Phylogenetic tree; Tree rearrangement; Weight-balanced tree; Mathematics; Constraint (computer-aided design); Bounded function; Sequence (biology); Phylogenetic network; Time complexity; Combinatorics; Tree (set theory); Algorithm; Discrete mathematics; Biology; Binary search tree; Binary tree","score_opus":0.012168600829376252,"score_gpt":0.24486195700617105,"score_spread":0.2326933561767948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972805029","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.097511135,0.0009162502,0.8945592,0.0008441227,0.00014252812,0.00023370185,0.0006735449,0.0032704684,0.0018490205],"genre_scores_gemma":[0.27649704,0.0005707214,0.7159322,0.00031549143,0.00013036717,0.00032071286,0.0037040054,0.0011982719,0.0013311852],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823123,0.0006208904,0.00018105752,0.00052078493,0.00027735674,0.00016856423],"domain_scores_gemma":[0.98701173,0.009838253,0.00043755036,0.0015598335,0.0007290322,0.0004235435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031895207,0.0011391384,0.0027061957,0.002652575,0.0016593111,0.0022242428,0.0026206668,0.0025796683,0.006461616],"category_scores_gemma":[0.01745213,0.002037564,0.0025187442,0.003320955,0.0014541259,0.0063360864,0.004155851,0.0041781273,0.002003463],"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.0013051586,0.00056839536,0.0059518493,0.00093150587,0.00033864751,0.0003713662,0.0010655681,0.24077351,0.010867251,0.040489946,0.011434178,0.6859026],"study_design_scores_gemma":[0.00020874146,0.00016735331,0.0005748271,0.00007840962,0.00012435253,0.00018196303,0.0002962891,0.8343105,0.0026482902,0.15859333,0.0027894226,0.00002665736],"about_ca_topic_score_codex":0.0008834919,"about_ca_topic_score_gemma":0.002328716,"teacher_disagreement_score":0.006461616,"about_ca_system_score_codex":0.00076571753,"about_ca_system_score_gemma":0.0015502431,"threshold_uncertainty_score":0.02161628},"labels":[],"label_agreement":null},{"id":"W1992517803","doi":"10.1016/j.jalgor.2004.04.011","title":"A polynomial-time algorithm for near-unanimity graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","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":"Simon Fraser University; Concordia University","funders":"","keywords":"Time complexity; Unanimity; Algorithm; Combinatorics; Polynomial; Mathematics; Computer science; Discrete mathematics","score_opus":0.016181630222047556,"score_gpt":0.2872839656478463,"score_spread":0.27110233542579876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992517803","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.13079703,0.00080842286,0.82641554,0.00427987,0.00041048112,0.0010410151,0.0018518595,0.010023568,0.024372306],"genre_scores_gemma":[0.24845497,0.0003589411,0.7297264,0.0006199955,0.00019893816,0.00059111236,0.004119448,0.0011652182,0.014765122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736017,0.0003815615,0.00017715935,0.0009914944,0.0006601568,0.00042945263],"domain_scores_gemma":[0.99361914,0.0029869382,0.00038492118,0.0018449894,0.0006477084,0.00051626965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016982557,0.0016271748,0.0023073372,0.002158034,0.003739516,0.0040223617,0.0059865243,0.003089075,0.012791849],"category_scores_gemma":[0.008184201,0.0013594066,0.0022919495,0.0035412598,0.0021953355,0.012854099,0.005936399,0.0035864061,0.003465193],"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.0023208826,0.001611638,0.0027816151,0.001392564,0.00022529479,0.00033811014,0.0015648227,0.07244643,0.02341389,0.21745425,0.050168514,0.62628204],"study_design_scores_gemma":[0.0006682047,0.00031757116,0.0009723368,0.00011424549,0.0001970051,0.00044865505,0.00058182445,0.2927638,0.012352684,0.673286,0.018196229,0.00010138274],"about_ca_topic_score_codex":0.00456562,"about_ca_topic_score_gemma":0.008688976,"teacher_disagreement_score":0.012791849,"about_ca_system_score_codex":0.0039147977,"about_ca_system_score_gemma":0.0044851047,"threshold_uncertainty_score":0.042792976},"labels":[],"label_agreement":null},{"id":"W1994612875","doi":"10.1006/jagm.2002.1221","title":"Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Háskóli Íslands; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rectangle; Approximation algorithm; Combinatorics; Mathematics; Constant (computer programming); Space (punctuation); Algorithm; Discrete mathematics; Computer science; Geometry","score_opus":0.04323806333478964,"score_gpt":0.25696351552347346,"score_spread":0.21372545218868383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994612875","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.09762152,0.0052261753,0.86085737,0.0037574547,0.00040545734,0.00046099312,0.0008239754,0.003195279,0.027651826],"genre_scores_gemma":[0.31105366,0.0020732144,0.6693249,0.0007474505,0.0003539568,0.0005181904,0.0021086743,0.00092803396,0.012891912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963935,0.0011915109,0.00017389395,0.00070518925,0.0007831039,0.0007528064],"domain_scores_gemma":[0.9917163,0.005261922,0.0006657102,0.0013942638,0.0005284073,0.0004333636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027853516,0.0025576684,0.002921213,0.002222289,0.0018703555,0.0039772876,0.0063334396,0.0038559842,0.016480584],"category_scores_gemma":[0.014856381,0.0014150989,0.0018901168,0.005403939,0.0017658158,0.0113689955,0.003921849,0.004338162,0.0033947823],"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.003027544,0.0011683848,0.0018134253,0.000903621,0.00026536593,0.00020335196,0.0007283081,0.3943657,0.0062868414,0.17092991,0.04311488,0.37719268],"study_design_scores_gemma":[0.0005502034,0.00020265904,0.00046060805,0.00004877859,0.0001260414,0.00021603309,0.00021458835,0.8635612,0.002033246,0.12579334,0.0067487787,0.000044480894],"about_ca_topic_score_codex":0.0072062635,"about_ca_topic_score_gemma":0.008866204,"teacher_disagreement_score":0.016480584,"about_ca_system_score_codex":0.0038643691,"about_ca_system_score_gemma":0.0033538998,"threshold_uncertainty_score":0.055133104},"labels":[],"label_agreement":null},{"id":"W2029731475","doi":"10.1016/s0196-6774(03)00004-x","title":"Elastic labels around the perimeter of a map","year":2003,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","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 Waterloo; University of New Brunswick","funders":"","keywords":"Panning (audio); Rectangle; Perimeter; Clipping (morphology); Zoom; Mathematics; Boundary (topology); Time complexity; Achromatic lens; Artificial intelligence; Computer science; Computer vision; Combinatorics; Geometry; Mathematical analysis","score_opus":0.01757324017823872,"score_gpt":0.255436192997203,"score_spread":0.23786295281896427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029731475","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.38052315,0.00036824142,0.57881963,0.00080697244,0.00032044458,0.00008393318,0.00031612164,0.0009937079,0.037767842],"genre_scores_gemma":[0.8525153,0.00040250822,0.1251805,0.00012399079,0.00014653779,0.00008338871,0.00036965375,0.0005154735,0.020662775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996822,0.000054908392,0.000012207747,0.000083822924,0.00012300756,0.00004400306],"domain_scores_gemma":[0.9986066,0.0005082293,0.00020200184,0.00028783092,0.00025684823,0.00013837357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949036,0.0004186424,0.0004451991,0.0012748562,0.0011983898,0.0018350938,0.0007189583,0.0010503833,0.006236086],"category_scores_gemma":[0.0046745865,0.0005244616,0.00024901022,0.0008160554,0.0013021214,0.002306684,0.0025621988,0.0010298761,0.0014392143],"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.0014523929,0.00018662596,0.007326903,0.00027947238,0.00004927884,0.001176105,0.0013765681,0.21965477,0.048656028,0.4310772,0.011878282,0.27688634],"study_design_scores_gemma":[0.00009083078,0.00026683108,0.0031756011,0.00009598108,0.00004329033,0.0007486415,0.0009566904,0.63008404,0.029729478,0.30221915,0.03251513,0.0000742955],"about_ca_topic_score_codex":0.00056514214,"about_ca_topic_score_gemma":0.00074551406,"teacher_disagreement_score":0.006236086,"about_ca_system_score_codex":0.00036584676,"about_ca_system_score_gemma":0.00028603207,"threshold_uncertainty_score":0.020861745},"labels":[],"label_agreement":null},{"id":"W2046592997","doi":"10.1016/s0196-6774(02)00215-8","title":"A constructive enumeration of fusenes and benzenoids","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Graph theory and applications","field":"Mathematics","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":"HEC Montréal","funders":"","keywords":"Enumeration; Constructive; Mathematics; Computer science; Combinatorics; Programming language; Process (computing)","score_opus":0.05096497404794445,"score_gpt":0.2903613363710243,"score_spread":0.23939636232307984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046592997","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.1701051,0.0020043813,0.634979,0.0027192608,0.0007990869,0.00034223212,0.0013181628,0.0010418788,0.18669085],"genre_scores_gemma":[0.45468563,0.0015613143,0.47142133,0.00088294136,0.00026446997,0.0003180446,0.0019242516,0.0005811768,0.068360955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982973,0.0005133349,0.00011751288,0.00030407123,0.0005316333,0.0002363067],"domain_scores_gemma":[0.9970993,0.0017355628,0.00011985266,0.00045973255,0.0004085592,0.00017707028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010690087,0.00089681835,0.0014677081,0.0028053657,0.003473824,0.003547009,0.001568038,0.0017954748,0.019838486],"category_scores_gemma":[0.005483582,0.0009898051,0.001458882,0.0029284772,0.0022562945,0.0076713106,0.004470003,0.002835892,0.0029130522],"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.000086170985,0.000049634462,0.00038672966,0.000118979595,0.000015479603,0.000083477185,0.0004185758,0.0019501314,0.001619681,0.94416046,0.0044339476,0.046676707],"study_design_scores_gemma":[0.000018730128,0.000031099462,0.00016844309,0.000075788834,0.000027662018,0.0001401766,0.0003247395,0.007417379,0.0022255087,0.9637718,0.025774905,0.000023800096],"about_ca_topic_score_codex":0.001469685,"about_ca_topic_score_gemma":0.0040378687,"teacher_disagreement_score":0.019838486,"about_ca_system_score_codex":0.0012636008,"about_ca_system_score_gemma":0.00088809937,"threshold_uncertainty_score":0.066366315},"labels":[],"label_agreement":null},{"id":"W2049328058","doi":"10.1006/jagm.1999.1050","title":"Some Open Problems in Computational Molecular Biology","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Property (philosophy); Mathematics; Consistency (knowledge bases); Tree (set theory); Set (abstract data type); Function (biology); Combinatorics; Domain (mathematical analysis); Discrete mathematics; Upper and lower bounds; Algorithm; Computer science; Biology; Mathematical analysis","score_opus":0.018205429609056824,"score_gpt":0.3037905689558141,"score_spread":0.2855851393467573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049328058","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.03565865,0.042200107,0.78220105,0.099837296,0.006002384,0.00017530505,0.0004815341,0.00058964477,0.032854103],"genre_scores_gemma":[0.37883765,0.038781438,0.49830905,0.009870793,0.029863559,0.00090420054,0.0022716483,0.0011120425,0.040049706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944476,0.0023462772,0.0004648924,0.0009771729,0.0014643124,0.00029970458],"domain_scores_gemma":[0.92647934,0.06487939,0.000833495,0.003819728,0.0030322408,0.0009557156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011258327,0.0012467982,0.0025254919,0.0025775845,0.005086712,0.00786347,0.004791739,0.005379871,0.012092397],"category_scores_gemma":[0.058011536,0.001349,0.0019109607,0.0059554656,0.009675985,0.027806185,0.005693333,0.0114841545,0.0016647498],"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.00022420034,0.00027484316,0.00085540675,0.00048190515,0.00007843259,0.000112045724,0.00046494685,0.01809307,0.00031530717,0.78738755,0.03233137,0.15938094],"study_design_scores_gemma":[0.000023526425,0.000013810465,0.000070868526,0.00003744598,0.000009665582,0.00003849559,0.000075553995,0.02077854,0.00017287969,0.9729772,0.00579257,0.000009359933],"about_ca_topic_score_codex":0.001466675,"about_ca_topic_score_gemma":0.0010060291,"teacher_disagreement_score":0.012092397,"about_ca_system_score_codex":0.0024352889,"about_ca_system_score_gemma":0.002200423,"threshold_uncertainty_score":0.05954045},"labels":[],"label_agreement":null},{"id":"W2054626845","doi":"10.1016/s0196-6774(02)00003-2","title":"A linear time algorithm for recognizing regular Boolean functions","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"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":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Monotonic function; Boolean function; Monotone polygon; Corollary; Time complexity; Combinatorics; Function (biology); Algorithm; Discrete mathematics","score_opus":0.02007652376892932,"score_gpt":0.24515777599527802,"score_spread":0.2250812522263487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054626845","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.028488964,0.0007033218,0.94650435,0.0008379187,0.0002101498,0.0004794374,0.00089280575,0.0144854365,0.007397587],"genre_scores_gemma":[0.12360309,0.00029743975,0.86157155,0.0005146049,0.0001239402,0.00057995174,0.0039452612,0.0006492507,0.008714896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978853,0.00021315558,0.00020253872,0.000874662,0.00052570587,0.0002985816],"domain_scores_gemma":[0.99677736,0.001751156,0.00019485263,0.00067237014,0.00041722303,0.00018701982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093510194,0.0023265423,0.0022927609,0.0020453434,0.0015475994,0.0036977103,0.0043805228,0.0028381448,0.017037794],"category_scores_gemma":[0.0045432295,0.0011040458,0.0022734248,0.0030733105,0.0014103631,0.0077261333,0.003415537,0.0029189375,0.005988286],"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.0010419057,0.00058301736,0.0009808224,0.00047213034,0.00012409645,0.00013713476,0.00020214122,0.01615382,0.023494996,0.020767467,0.025191497,0.910851],"study_design_scores_gemma":[0.0011274242,0.0005985187,0.001358208,0.00011028856,0.00036879047,0.0009045589,0.00050050695,0.70711756,0.04738552,0.21682344,0.023545578,0.00015955712],"about_ca_topic_score_codex":0.0050372607,"about_ca_topic_score_gemma":0.008231892,"teacher_disagreement_score":0.017037794,"about_ca_system_score_codex":0.002362918,"about_ca_system_score_gemma":0.0031692358,"threshold_uncertainty_score":0.05699706},"labels":[],"label_agreement":null},{"id":"W2055960596","doi":"10.1006/jagm.1999.1068","title":"Distributed Online Frequency Assignment in Cellular Networks","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":63,"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; Carleton University; Dalhousie University","funders":"","keywords":"Frequency assignment; Vertex (graph theory); Competitive analysis; Computer science; Online algorithm; Graph; Lattice (music); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Upper and lower bounds; Telecommunications","score_opus":0.014104128320367778,"score_gpt":0.24859558391952347,"score_spread":0.23449145559915568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055960596","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.12814842,0.000555366,0.8632496,0.00075358857,0.00016626909,0.000087440356,0.00012973264,0.0003780615,0.0065315566],"genre_scores_gemma":[0.94208306,0.0002555984,0.052368484,0.000078198595,0.000102417114,0.000101357226,0.00008405037,0.000036832593,0.004889954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989287,0.00044424078,0.00004081443,0.0001784494,0.00019242203,0.0002153112],"domain_scores_gemma":[0.995561,0.0031764505,0.00030343392,0.0003991513,0.00037476522,0.00018511998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014331165,0.0005816042,0.0015107688,0.0008194478,0.001104068,0.0015763965,0.0018859548,0.0012426191,0.0033182749],"category_scores_gemma":[0.007267551,0.00049912045,0.00035211467,0.0018460414,0.0010240371,0.0019654068,0.001549939,0.00075892237,0.00036601286],"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.0003919071,0.00015746172,0.0007909665,0.0000659645,0.00003247021,0.00005251911,0.0000778911,0.9031736,0.0010378379,0.02447171,0.002393741,0.06735388],"study_design_scores_gemma":[0.000046600006,0.000031244497,0.00010986238,0.0000030871138,0.00000965621,0.000022213042,0.000026638447,0.97290844,0.0002375192,0.026120268,0.0004801395,0.000004332926],"about_ca_topic_score_codex":0.0054599713,"about_ca_topic_score_gemma":0.0052517173,"teacher_disagreement_score":0.0054599713,"about_ca_system_score_codex":0.0012624941,"about_ca_system_score_gemma":0.0010992634,"threshold_uncertainty_score":0.011100769},"labels":[],"label_agreement":null},{"id":"W2065654144","doi":"10.1016/j.jalgor.2005.01.009","title":"Refinements of Miller's algorithm for computing the Weil/Tate pairing","year":2005,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Cryptography and Residue Arithmetic","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 Toronto","funders":"","keywords":"Computation; Cryptography; Algorithm; Hamming weight; Integer (computer science); Hamming distance; Computer science; Field (mathematics); Binary number; Finite field; Pairing; Elliptic curve; Mathematics; Theoretical computer science; Discrete mathematics; Hamming code; Arithmetic; Programming language; Pure mathematics","score_opus":0.014071028587777224,"score_gpt":0.2615776276533546,"score_spread":0.2475065990655774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065654144","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.046924107,0.0010056779,0.9171271,0.0013501041,0.0011454988,0.0003448282,0.00041539877,0.0033800858,0.028307265],"genre_scores_gemma":[0.2841229,0.00081209606,0.6891396,0.0005969867,0.00093470665,0.00042788644,0.00093274494,0.001103691,0.021929469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995695,0.0010315437,0.00036329593,0.00059207797,0.0018996755,0.0004182639],"domain_scores_gemma":[0.9942761,0.0013733798,0.00023391114,0.0029541939,0.0009463387,0.00021617343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037528595,0.0015781771,0.0022237953,0.0036305129,0.0018794573,0.0033627143,0.0028465444,0.0016244766,0.012739226],"category_scores_gemma":[0.015713293,0.0007577405,0.002168798,0.0033799584,0.0026442534,0.0063812546,0.0043496634,0.004540048,0.005561013],"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.0010194633,0.00027883227,0.0017623247,0.00021164936,0.00011584351,0.00022458841,0.00036780667,0.0143949315,0.009986611,0.67496675,0.01610069,0.28057063],"study_design_scores_gemma":[0.00021535221,0.00030722326,0.0009094361,0.00009509721,0.00012030899,0.0005547003,0.00012926561,0.11583889,0.014449124,0.82965374,0.0375972,0.00012972551],"about_ca_topic_score_codex":0.0015408604,"about_ca_topic_score_gemma":0.0023566058,"teacher_disagreement_score":0.012739226,"about_ca_system_score_codex":0.0015124716,"about_ca_system_score_gemma":0.0019981624,"threshold_uncertainty_score":0.042616904},"labels":[],"label_agreement":null},{"id":"W2077583313","doi":"10.1006/jagm.2000.1108","title":"Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","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":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Necklace; Alphabet; Permutation (music); Algorithm; Discrete mathematics","score_opus":0.011280661338109824,"score_gpt":0.25752807666333566,"score_spread":0.24624741532522584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077583313","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.06912894,0.00054387783,0.9179324,0.0004990304,0.00014833611,0.00043452444,0.0004328353,0.0039987457,0.0068812296],"genre_scores_gemma":[0.2607482,0.00036181248,0.72936386,0.00021135171,0.00009238197,0.00042858155,0.001465799,0.0003796687,0.0069483006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895287,0.00020142712,0.00007215347,0.00015391948,0.000422865,0.00019667797],"domain_scores_gemma":[0.99714017,0.001295128,0.00026848962,0.0006914715,0.00048481018,0.00011981003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011525265,0.0010980295,0.0007375249,0.0014710888,0.0011171263,0.0010397963,0.0011572107,0.00097260467,0.007803902],"category_scores_gemma":[0.005723136,0.00048694955,0.00075980526,0.0018227849,0.0008536145,0.002204729,0.0025350873,0.0014753824,0.0020038767],"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.0012422113,0.00038259357,0.0015419035,0.0004735614,0.000080444224,0.00029626364,0.00063278835,0.044630207,0.025918344,0.11784107,0.021719508,0.7852412],"study_design_scores_gemma":[0.0009496759,0.00072812574,0.00088355946,0.0001677561,0.00013784877,0.00079162687,0.0004927582,0.6070118,0.093972534,0.27161002,0.02313145,0.00012287515],"about_ca_topic_score_codex":0.001452986,"about_ca_topic_score_gemma":0.0049145077,"teacher_disagreement_score":0.007803902,"about_ca_system_score_codex":0.0010048002,"about_ca_system_score_gemma":0.0018231232,"threshold_uncertainty_score":0.026106596},"labels":[],"label_agreement":null},{"id":"W2079313211","doi":"10.1016/j.jalgor.2004.02.001","title":"The dominating set problem is fixed parameter tractable for graphs of bounded genus","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"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; University of Victoria","funders":"","keywords":"Bounded function; Mathematics; Combinatorics; Genus; Planar graph; Maximal independent set; Dominating set; Discrete mathematics; Set (abstract data type); Planar; Pathwidth; Chordal graph; 1-planar graph; Graph; Computer science; Line graph","score_opus":0.029409478559451214,"score_gpt":0.31751576923085983,"score_spread":0.28810629067140864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079313211","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.35343346,0.0030454353,0.5834812,0.017870594,0.0004166491,0.00063563464,0.0044376794,0.0027058665,0.033973493],"genre_scores_gemma":[0.88752985,0.0020673198,0.093691796,0.0011246395,0.00050615636,0.0006409017,0.0032793754,0.0010988209,0.010061255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939733,0.001726135,0.00028880718,0.0017684626,0.001056172,0.0011871192],"domain_scores_gemma":[0.9497848,0.039760668,0.0028465702,0.004899869,0.0011486955,0.0015594168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005410391,0.0026374839,0.0066724606,0.0020151725,0.0033187792,0.011721704,0.0068592452,0.00441841,0.008042263],"category_scores_gemma":[0.04245352,0.0023547816,0.0034999975,0.0047814604,0.004835324,0.02252527,0.0054792124,0.008321325,0.0011858897],"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.002644379,0.0006937794,0.003860446,0.0016296798,0.0005840788,0.000700853,0.0013968786,0.5924103,0.007828128,0.31657594,0.021897748,0.049777757],"study_design_scores_gemma":[0.0002892918,0.00009639654,0.00044920677,0.000080171725,0.00018749041,0.00027019533,0.00028984636,0.41336426,0.0020455744,0.5798382,0.0030483431,0.000040944466],"about_ca_topic_score_codex":0.004508059,"about_ca_topic_score_gemma":0.005988204,"teacher_disagreement_score":0.011721704,"about_ca_system_score_codex":0.0072146803,"about_ca_system_score_gemma":0.004382796,"threshold_uncertainty_score":0.05234641},"labels":[],"label_agreement":null},{"id":"W2085072732","doi":"10.1016/s0196-6774(03)00126-3","title":"Rectangular drawings of planar graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","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":"University of Alberta","funders":"","keywords":"Planar graph; Book embedding; Planar straight-line graph; Outerplanar graph; Combinatorics; Rectangle; Mathematics; Planar; Graph; Polyhedral graph; Embedding; Vertex (graph theory); Plane (geometry); 1-planar graph; Geometry; Line graph; Computer science; Pathwidth; Computer graphics (images); Artificial intelligence","score_opus":0.011175260138379248,"score_gpt":0.23730742971906998,"score_spread":0.22613216958069074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085072732","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.11807548,0.0008717684,0.810933,0.00053512433,0.00020605457,0.00020210323,0.00096759433,0.0016790015,0.06652994],"genre_scores_gemma":[0.50991774,0.0019129007,0.44909695,0.00016662282,0.00007681821,0.00019229103,0.0027878673,0.00047718376,0.035371568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996669,0.00008596226,0.000018426892,0.000068675625,0.0001053327,0.000054675445],"domain_scores_gemma":[0.9992182,0.00029426513,0.000108956956,0.0001632124,0.00013908364,0.00007620231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022684342,0.00060033693,0.0004792351,0.0011265535,0.00048267696,0.0013644095,0.0010683861,0.0006021351,0.016878303],"category_scores_gemma":[0.0022448963,0.0008961889,0.00046118716,0.0015890759,0.0006124539,0.001180381,0.0014110619,0.0012207696,0.0025135824],"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.00024401383,0.00009254715,0.00130286,0.00033920884,0.00004466802,0.0003836547,0.0005236062,0.0974303,0.015792314,0.55989516,0.025740072,0.2982115],"study_design_scores_gemma":[0.00016059652,0.00015326156,0.0015514308,0.00013595766,0.00007758071,0.00071200787,0.000603322,0.3471911,0.013559995,0.52808124,0.1077113,0.000062172985],"about_ca_topic_score_codex":0.0022163908,"about_ca_topic_score_gemma":0.004284482,"teacher_disagreement_score":0.016878303,"about_ca_system_score_codex":0.00046902904,"about_ca_system_score_gemma":0.00037792764,"threshold_uncertainty_score":0.05646354},"labels":[],"label_agreement":null},{"id":"W2085524666","doi":"10.1006/jagm.2001.1189","title":"Fly Cheaply: On the Minimum Fuel Consumption Problem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","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":"University of Waterloo","funders":"","keywords":"Subdivision; Function (biology); Fuel efficiency; Path (computing); Class (philosophy); Sequence (biology); Set (abstract data type); Mathematical optimization; Computer science; Combinatorics; Mathematics; Engineering; Artificial intelligence; Aerospace engineering","score_opus":0.03404273858224385,"score_gpt":0.2688807568102196,"score_spread":0.23483801822797576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085524666","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.3470944,0.00169404,0.6112934,0.0043356447,0.0003847197,0.0001646995,0.00071266334,0.00124098,0.03307951],"genre_scores_gemma":[0.7912549,0.0006293638,0.19144052,0.0004179144,0.00014826833,0.00014928919,0.00073661143,0.0008015092,0.01442165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994797,0.00018246619,0.00001644283,0.000079364494,0.000114153394,0.00012788635],"domain_scores_gemma":[0.99800605,0.001484517,0.0000909546,0.00016258091,0.00012892524,0.00012692776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011294908,0.0013550331,0.0018361511,0.00075525447,0.00092719065,0.0012726214,0.0020105077,0.001956501,0.008251138],"category_scores_gemma":[0.0071606897,0.00059661333,0.00080711395,0.0010783133,0.0012958341,0.003089633,0.002060046,0.0020196731,0.0005696662],"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.0014093057,0.00026887312,0.00091071974,0.0001772047,0.000070928094,0.00013489189,0.00014148823,0.8249805,0.0018277487,0.07033807,0.01310843,0.086631805],"study_design_scores_gemma":[0.00010429377,0.00005360909,0.00012523658,0.000011889834,0.00001707756,0.000021847469,0.000042936215,0.92139596,0.00046681086,0.076846905,0.0009061564,0.000007373349],"about_ca_topic_score_codex":0.0064322613,"about_ca_topic_score_gemma":0.006767244,"teacher_disagreement_score":0.008251138,"about_ca_system_score_codex":0.0009357638,"about_ca_system_score_gemma":0.001124171,"threshold_uncertainty_score":0.027602792},"labels":[],"label_agreement":null},{"id":"W2089329507","doi":"10.1016/j.jalgor.2004.01.002","title":"Simple constant amortized time generation of fixed length numeric partitions","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Numerical Methods and Algorithms","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 Victoria","funders":"","keywords":"Amortized analysis; Simple (philosophy); Constant (computer programming); Mathematics; Combinatorics; Algorithm; Discrete mathematics; Data structure; Computer science","score_opus":0.03443542798261186,"score_gpt":0.29426492655903175,"score_spread":0.2598294985764199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089329507","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.13804796,0.0008622834,0.7950985,0.0013116997,0.0008206223,0.00075947394,0.0016632385,0.028335124,0.033101097],"genre_scores_gemma":[0.41124943,0.0001846634,0.5720268,0.00041019934,0.00015083952,0.00058411324,0.0019992453,0.0029923345,0.010402425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741334,0.00057859195,0.00019419717,0.00046218766,0.00085457315,0.00049718126],"domain_scores_gemma":[0.9917019,0.00330868,0.00039758792,0.003148895,0.001065446,0.00037750666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015305184,0.0018407642,0.001681073,0.0013500551,0.0018014471,0.0029279066,0.003477854,0.0014514751,0.029015685],"category_scores_gemma":[0.010304891,0.0008291431,0.0018672219,0.0027791364,0.0017099003,0.004068348,0.004590152,0.0017829194,0.006050242],"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.0068232073,0.0005424714,0.0030298496,0.0011373569,0.00030211805,0.00066031265,0.00071252347,0.15834807,0.045325845,0.05998935,0.06691894,0.65621],"study_design_scores_gemma":[0.0012849373,0.00039800754,0.0009029582,0.00007532941,0.00018540569,0.0003031164,0.00038316843,0.80004275,0.02861618,0.15087676,0.016830368,0.00010103518],"about_ca_topic_score_codex":0.0032786452,"about_ca_topic_score_gemma":0.0066151107,"teacher_disagreement_score":0.029015685,"about_ca_system_score_codex":0.0021676992,"about_ca_system_score_gemma":0.002978504,"threshold_uncertainty_score":0.09706718},"labels":[],"label_agreement":null},{"id":"W2090986925","doi":"10.1016/s0196-6774(02)00251-1","title":"A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 British Columbia","funders":"","keywords":"Approximation algorithm; Open shop; Mathematics; Algorithm; Mathematical optimization; Computer science; Job shop scheduling; Flow shop scheduling","score_opus":0.024416593517046954,"score_gpt":0.24623961560496757,"score_spread":0.22182302208792062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090986925","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.033743106,0.0004928312,0.958575,0.00060512364,0.00022421627,0.000121605175,0.00011398827,0.0013022358,0.0048218076],"genre_scores_gemma":[0.1928793,0.00017405057,0.8016417,0.00027136362,0.000089162175,0.00022118333,0.00027537066,0.00021467365,0.0042331396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987884,0.00034581264,0.00006117861,0.00024075262,0.0003207166,0.00024303942],"domain_scores_gemma":[0.9979818,0.0011372992,0.00014140418,0.0002814382,0.00027824214,0.0001797263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022722082,0.0012219697,0.0016898675,0.0008055856,0.0009314141,0.0016102531,0.0027986304,0.0020583333,0.0064019007],"category_scores_gemma":[0.005329437,0.00069310126,0.0009818531,0.0011849265,0.0008523729,0.0025244495,0.002245891,0.002556333,0.0011494593],"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.00122022,0.00066593266,0.0009175198,0.0002777817,0.00011373207,0.00012174448,0.00019638476,0.62486446,0.005130562,0.03379393,0.01136286,0.32133487],"study_design_scores_gemma":[0.000105356805,0.000092959315,0.00011360281,0.000012415088,0.000015893791,0.00004863769,0.000028292028,0.98385966,0.00082092703,0.013799827,0.0010924226,0.000009929343],"about_ca_topic_score_codex":0.0037422315,"about_ca_topic_score_gemma":0.0051288824,"teacher_disagreement_score":0.0064019007,"about_ca_system_score_codex":0.0015930434,"about_ca_system_score_gemma":0.0031864129,"threshold_uncertainty_score":0.021416485},"labels":[],"label_agreement":null},{"id":"W2114790712","doi":"10.1006/jagm.2000.1151","title":"Space Efficient Suffix Trees","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":103,"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":"Suffix; Space (punctuation); Computer science; Suffix tree; Artificial intelligence; Mathematics; Combinatorics; Linguistics; Philosophy","score_opus":0.014614309316282275,"score_gpt":0.2550175803153401,"score_spread":0.24040327099905784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114790712","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.10423997,0.004424814,0.82062536,0.0033561303,0.0011909201,0.00034450233,0.0038007093,0.012514461,0.049503084],"genre_scores_gemma":[0.35551605,0.0020740193,0.58675104,0.00088095356,0.0007027655,0.0003725487,0.009819175,0.0015402195,0.042343136],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982029,0.0003337337,0.00021831506,0.00029476793,0.00077896507,0.00017127478],"domain_scores_gemma":[0.9951782,0.0016779638,0.0002082096,0.0019203618,0.0008759894,0.00013925442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008241601,0.000697427,0.0012686332,0.001747667,0.0014424723,0.0028423502,0.0014597574,0.0013471434,0.017462796],"category_scores_gemma":[0.0058754063,0.00061386405,0.00084314874,0.004259832,0.0009091084,0.0062706717,0.0024984884,0.0017472769,0.006416777],"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.00096751726,0.0004886262,0.0012106932,0.00041058235,0.00010187127,0.00022576422,0.00037524215,0.029160986,0.03391625,0.14771736,0.06560559,0.7198195],"study_design_scores_gemma":[0.00025890034,0.00054134865,0.00081148115,0.0001549269,0.000168377,0.0011735787,0.00039916282,0.3190011,0.0679945,0.5031661,0.10625884,0.00007174397],"about_ca_topic_score_codex":0.0006067025,"about_ca_topic_score_gemma":0.0013806912,"teacher_disagreement_score":0.017462796,"about_ca_system_score_codex":0.0007540916,"about_ca_system_score_gemma":0.0016732655,"threshold_uncertainty_score":0.05841887},"labels":[],"label_agreement":null},{"id":"W2120749565","doi":"10.1006/jagm.2001.1158","title":"The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Coding theory and cryptography","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":"Carleton University","funders":"","keywords":"Factorization of polynomials; Factorization; Finite field; Mathematics; Polynomial; Factoring; Degree (music); Square-free polynomial; Algorithm; Singularity; Algebra over a field; Discrete mathematics; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.016552816498077758,"score_gpt":0.25349352498912764,"score_spread":0.23694070849104987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120749565","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.23566574,0.0025345462,0.70319796,0.007465903,0.00034029907,0.00025584074,0.0012208599,0.0011434553,0.048175428],"genre_scores_gemma":[0.87326473,0.0018457415,0.09531848,0.001166293,0.0013581217,0.00020530105,0.0018542622,0.0005822322,0.02440485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950901,0.0010797129,0.0002273287,0.0009974953,0.0016644798,0.0009408124],"domain_scores_gemma":[0.9815166,0.012523522,0.0010473188,0.002208649,0.0019927428,0.0007112286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004292123,0.0016444502,0.0026313674,0.0023129277,0.0032989273,0.0072909654,0.0033179529,0.0032728035,0.0093358075],"category_scores_gemma":[0.021573674,0.0012718097,0.002823535,0.003236883,0.0053153834,0.019862553,0.003341193,0.0058738585,0.0021498615],"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.000624633,0.00023701003,0.0013498663,0.00026425705,0.00008821216,0.00011347219,0.00037943127,0.037992526,0.0018298557,0.910264,0.009173687,0.037682973],"study_design_scores_gemma":[0.000051064188,0.00006279181,0.00020906047,0.000041710136,0.00003262263,0.00009863393,0.000052627787,0.06675082,0.0011705084,0.92921454,0.0022860032,0.00002963457],"about_ca_topic_score_codex":0.0017097294,"about_ca_topic_score_gemma":0.0014164641,"teacher_disagreement_score":0.0093358075,"about_ca_system_score_codex":0.003731107,"about_ca_system_score_gemma":0.0056381356,"threshold_uncertainty_score":0.031231403},"labels":[],"label_agreement":null},{"id":"W2122491543","doi":"10.1016/j.jalgor.2004.04.005","title":"Estimating the maximum","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","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":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph; Sample (material); Property (philosophy); Sampling (signal processing); Maximum likelihood; Discrete mathematics; Sample complexity; Algorithm; Statistics; Computer science; Artificial intelligence","score_opus":0.02866371422076207,"score_gpt":0.30652404181212844,"score_spread":0.27786032759136636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122491543","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.07906893,0.0036233654,0.8926946,0.0047265054,0.00043366748,0.00007064017,0.0013213101,0.0014089283,0.016652124],"genre_scores_gemma":[0.7160998,0.0019157453,0.26265776,0.00076797494,0.0011941877,0.00029971427,0.0026447258,0.0008983213,0.013521754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532264,0.001957952,0.00017725983,0.0016392912,0.00059224776,0.00031061572],"domain_scores_gemma":[0.9643132,0.028124183,0.0011852887,0.0040931473,0.001548066,0.0007360094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005128775,0.001200711,0.0025326011,0.0033518905,0.0013528875,0.0039021797,0.003373666,0.0036488408,0.010845619],"category_scores_gemma":[0.06224425,0.0015998579,0.001274971,0.003070504,0.0026344578,0.01277942,0.0034923588,0.0046918187,0.0028090938],"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.0012071164,0.00028648417,0.012231482,0.0010090146,0.00040204264,0.00021069225,0.00045318354,0.1979321,0.008447553,0.47884563,0.030542819,0.2684319],"study_design_scores_gemma":[0.00004431266,0.000077200806,0.0020659417,0.000110680856,0.0000702199,0.00019906713,0.0000820237,0.48036283,0.0035985538,0.5071894,0.006161589,0.00003816727],"about_ca_topic_score_codex":0.0012441428,"about_ca_topic_score_gemma":0.0014379388,"teacher_disagreement_score":0.010845619,"about_ca_system_score_codex":0.0017935537,"about_ca_system_score_gemma":0.001299428,"threshold_uncertainty_score":0.03628224},"labels":[],"label_agreement":null},{"id":"W2137498124","doi":"10.1006/jagm.2000.1132","title":"Efficient Algorithms for Petersen's Matching Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"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; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Algorithm; Planar graph; Discrete mathematics; Graph algorithms; Graph","score_opus":0.021894238488722132,"score_gpt":0.2809147616313767,"score_spread":0.25902052314265456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137498124","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.010942543,0.00036454448,0.96975344,0.0005820723,0.00020443926,0.00017906813,0.00020639315,0.0014395592,0.016327899],"genre_scores_gemma":[0.15023997,0.00062093453,0.83150923,0.0002861572,0.00024205276,0.00041316915,0.00096707174,0.0010264022,0.014695034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973839,0.00045637193,0.0001709809,0.0006285242,0.0010455049,0.00031481538],"domain_scores_gemma":[0.9962823,0.001991806,0.00016949818,0.0010020628,0.00043304014,0.00012140748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002402597,0.0018401667,0.0019663405,0.0031219993,0.002177669,0.0041901255,0.004763394,0.0025058899,0.02500105],"category_scores_gemma":[0.01301606,0.0015184155,0.0023120411,0.004050779,0.001907417,0.010640372,0.0077932617,0.004485045,0.005898353],"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.0003441833,0.0002809137,0.0006326685,0.00033812496,0.00012554564,0.000112925976,0.00024546875,0.04032287,0.0031740342,0.5407573,0.01936178,0.39430428],"study_design_scores_gemma":[0.00012429887,0.00005452181,0.00019134731,0.00003148341,0.00006736353,0.0001018752,0.00009887238,0.24573371,0.0038339198,0.7381524,0.011580152,0.000030025383],"about_ca_topic_score_codex":0.0020959936,"about_ca_topic_score_gemma":0.0027849239,"teacher_disagreement_score":0.02500105,"about_ca_system_score_codex":0.00219885,"about_ca_system_score_gemma":0.0019802481,"threshold_uncertainty_score":0.08363682},"labels":[],"label_agreement":null},{"id":"W2156623776","doi":"10.1006/jagm.2001.1195","title":"On Graph Powers for Leaf-Labeled Trees","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"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":"Combinatorics; Gomory–Hu tree; Mathematics; Tree (set theory); Graph; K-ary tree; Spanning tree; Path (computing); Basis (linear algebra); Trémaux tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Computer science; Binary tree; Line graph; Artificial intelligence; Pathwidth","score_opus":0.03359346603976615,"score_gpt":0.3027998815668668,"score_spread":0.2692064155271007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156623776","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.112451695,0.0019143713,0.74886405,0.0063899057,0.000836478,0.00035493707,0.0008050301,0.0013803716,0.1270032],"genre_scores_gemma":[0.6431389,0.003183889,0.26589063,0.0021491416,0.0017085752,0.0005637613,0.0021221617,0.0024260175,0.07881697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612707,0.0014924592,0.00022725653,0.00067523465,0.0009965573,0.0004814684],"domain_scores_gemma":[0.97820354,0.0147588,0.00093820377,0.0033370461,0.0014078346,0.0013545193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00378113,0.0013628354,0.0018261645,0.0029851298,0.0024167222,0.004615928,0.002895744,0.0019400019,0.019025052],"category_scores_gemma":[0.02577149,0.0014429059,0.0022263846,0.0036233258,0.005760364,0.019809786,0.007851724,0.0061037783,0.0041923765],"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.00024506272,0.00011640661,0.0010595871,0.00018234593,0.00002985859,0.00019901998,0.0010559339,0.005331087,0.0013117131,0.94346493,0.009740135,0.037263937],"study_design_scores_gemma":[0.000022579905,0.000016217571,0.00012440262,0.000030789284,0.000018643663,0.00010423463,0.0001123089,0.010790871,0.0005482291,0.9826973,0.005524204,0.000010218107],"about_ca_topic_score_codex":0.0015977641,"about_ca_topic_score_gemma":0.002786919,"teacher_disagreement_score":0.019025052,"about_ca_system_score_codex":0.0016500972,"about_ca_system_score_gemma":0.0007938486,"threshold_uncertainty_score":0.063645184},"labels":[],"label_agreement":null},{"id":"W298519903","doi":"10.1006/jagm.2000.1147","title":"Fault-Tolerant Broadcasting in Radio Networks","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Computer science; Broadcasting (networking); Node (physics); Computer network; Upper and lower bounds; RADIUS; Situated; Range (aeronautics); Fault tolerance; Topology (electrical circuits); Algorithm; Distributed computing; Mathematics; Combinatorics; Physics","score_opus":0.014003932048168658,"score_gpt":0.24600307803705548,"score_spread":0.23199914598888682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W298519903","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.088343084,0.0035195544,0.8934932,0.002257926,0.00039674193,0.00006942066,0.00007374387,0.00093226635,0.010914031],"genre_scores_gemma":[0.8899026,0.0023358597,0.09561289,0.00031537504,0.00042369685,0.00013319986,0.00016029018,0.00015570075,0.010960298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985436,0.00049322867,0.00009066229,0.00018598579,0.00045541412,0.00023106343],"domain_scores_gemma":[0.99156976,0.0061882623,0.0005847915,0.00068270793,0.0007189742,0.00025552986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016572602,0.00042159922,0.0012802382,0.0013498463,0.0014973248,0.0024488706,0.0019489652,0.0015642003,0.0030251674],"category_scores_gemma":[0.0125626,0.00052277267,0.00035324626,0.0018159039,0.0017707606,0.00377515,0.0015782665,0.0012988026,0.00049615296],"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.0009909318,0.0001831251,0.001816639,0.0004270079,0.00010660791,0.00027155972,0.0008192498,0.40760407,0.007862069,0.3828457,0.009384664,0.18768847],"study_design_scores_gemma":[0.00013523658,0.00010851311,0.00028007763,0.00002732022,0.00005698972,0.00022127027,0.00014762061,0.7331821,0.0035356327,0.25675294,0.005529062,0.000023396342],"about_ca_topic_score_codex":0.0020019114,"about_ca_topic_score_gemma":0.0015922951,"teacher_disagreement_score":0.0030251674,"about_ca_system_score_codex":0.001482695,"about_ca_system_score_gemma":0.00082275155,"threshold_uncertainty_score":0.010757744},"labels":[],"label_agreement":null}]}