{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":23,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":23,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"664228451d50","filters":{"venue":"Journal of Algorithms"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Dimitrios M. Thilikos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03359346603976615,"gpt":0.3027998815668668,"spread":0.2692064155271007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00378113,0.001362835,0.001826165,0.00298513,0.002416722,0.004615928,0.002895744,0.001940002,0.01902505],"category_scores_gemma":[0.02577149,0.001442906,0.002226385,0.003623326,0.005760364,0.01980979,0.007851724,0.006103778,0.004192377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001650097,"about_ca_system_score_gemma":0.0007938486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001597764,"about_ca_topic_score_gemma":0.002786919,"domain_scores_codex":[0.9961271,0.001492459,0.0002272565,0.0006752347,0.0009965573,0.0004814684],"domain_scores_gemma":[0.9782035,0.0147588,0.0009382038,0.003337046,0.001407835,0.001354519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002450627,0.0001164066,0.001059587,0.0001823459,0.00002985859,0.00019902,0.001055934,0.005331087,0.001311713,0.9434649,0.009740135,0.03726394],"study_design_scores_gemma":[0.0000225799,0.00001621757,0.0001244026,0.00003078928,0.00001864366,0.0001042346,0.0001123089,0.01079087,0.0005482291,0.9826973,0.005524204,0.00001021811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1124517,0.001914371,0.7488641,0.006389906,0.000836478,0.0003549371,0.0008050301,0.001380372,0.1270032],"genre_scores_gemma":[0.6431389,0.003183889,0.2658906,0.002149142,0.001708575,0.0005637613,0.002122162,0.002426018,0.07881697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01902505,"threshold_uncertainty_score":0.06364518,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Space (punctuation); Computer science; Suffix tree; Artificial intelligence; Mathematics; Combinatorics; Linguistics; Philosophy","authors":[{"name":"Venkatesh Raman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01461430931628228,"gpt":0.2550175803153401,"spread":0.2404032709990578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008241601,0.000697427,0.001268633,0.001747667,0.001442472,0.00284235,0.001459757,0.001347143,0.0174628],"category_scores_gemma":[0.005875406,0.000613864,0.0008431487,0.004259832,0.0009091084,0.006270672,0.002498488,0.001747277,0.006416777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007540916,"about_ca_system_score_gemma":0.001673265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006067025,"about_ca_topic_score_gemma":0.001380691,"domain_scores_codex":[0.9982029,0.0003337337,0.0002183151,0.0002947679,0.0007789651,0.0001712748],"domain_scores_gemma":[0.9951782,0.001677964,0.0002082096,0.001920362,0.0008759894,0.0001392544],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009675173,0.0004886262,0.001210693,0.0004105823,0.0001018713,0.0002257642,0.0003752421,0.02916099,0.03391625,0.1477174,0.06560559,0.7198195],"study_design_scores_gemma":[0.0002589003,0.0005413487,0.0008114811,0.0001549269,0.000168377,0.001173579,0.0003991628,0.3190011,0.0679945,0.5031661,0.1062588,0.00007174397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.10424,0.004424814,0.8206254,0.00335613,0.00119092,0.0003445023,0.003800709,0.01251446,0.04950308],"genre_scores_gemma":[0.355516,0.002074019,0.586751,0.0008809536,0.0007027655,0.0003725487,0.009819175,0.00154022,0.04234314],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0174628,"threshold_uncertainty_score":0.05841887,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Necklace; Alphabet; Permutation (music); Algorithm; Discrete mathematics","authors":[{"name":"Kevin Cattell","is_ca":true},{"name":"Frank Ruskey","is_ca":true},{"name":"Joe Sawada","is_ca":true},{"name":"M. Serra","is_ca":true},{"name":"C. Robert Miers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01128066133810982,"gpt":0.2575280766633357,"spread":0.2462474153252258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001152526,0.00109803,0.0007375249,0.001471089,0.001117126,0.001039796,0.001157211,0.0009726047,0.007803902],"category_scores_gemma":[0.005723136,0.0004869495,0.0007598053,0.001822785,0.0008536145,0.002204729,0.002535087,0.001475382,0.002003877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010048,"about_ca_system_score_gemma":0.001823123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001452986,"about_ca_topic_score_gemma":0.004914508,"domain_scores_codex":[0.9989529,0.0002014271,0.00007215347,0.0001539195,0.000422865,0.000196678],"domain_scores_gemma":[0.9971402,0.001295128,0.0002684896,0.0006914715,0.0004848102,0.00011981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001242211,0.0003825936,0.001541903,0.0004735614,0.00008044422,0.0002962636,0.0006327883,0.04463021,0.02591834,0.1178411,0.02171951,0.7852412],"study_design_scores_gemma":[0.0009496759,0.0007281257,0.0008835595,0.0001677561,0.0001378488,0.0007916269,0.0004927582,0.6070118,0.09397253,0.27161,0.02313145,0.0001228751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06912894,0.0005438778,0.9179324,0.0004990304,0.0001483361,0.0004345244,0.0004328353,0.003998746,0.00688123],"genre_scores_gemma":[0.2607482,0.0003618125,0.7293639,0.0002113517,0.00009238197,0.0004285816,0.001465799,0.0003796687,0.006948301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007803902,"threshold_uncertainty_score":0.0261066,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"David Bryant","is_ca":false},{"name":"Mike Steel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01216860082937625,"gpt":0.2448619570061711,"spread":0.2326933561767948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003189521,0.001139138,0.002706196,0.002652575,0.001659311,0.002224243,0.002620667,0.002579668,0.006461616],"category_scores_gemma":[0.01745213,0.002037564,0.002518744,0.003320955,0.001454126,0.006336086,0.004155851,0.004178127,0.002003463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007657175,"about_ca_system_score_gemma":0.001550243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008834919,"about_ca_topic_score_gemma":0.002328716,"domain_scores_codex":[0.9982312,0.0006208904,0.0001810575,0.0005207849,0.0002773567,0.0001685642],"domain_scores_gemma":[0.9870117,0.009838253,0.0004375504,0.001559834,0.0007290322,0.0004235435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001305159,0.0005683954,0.005951849,0.0009315059,0.0003386475,0.0003713662,0.001065568,0.2407735,0.01086725,0.04048995,0.01143418,0.6859026],"study_design_scores_gemma":[0.0002087415,0.0001673533,0.0005748271,0.00007840962,0.0001243525,0.000181963,0.0002962891,0.8343105,0.00264829,0.1585933,0.002789423,0.00002665736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09751114,0.0009162502,0.8945592,0.0008441227,0.0001425281,0.0002337019,0.0006735449,0.003270468,0.00184902],"genre_scores_gemma":[0.276497,0.0005707214,0.7159322,0.0003154914,0.0001303672,0.0003207129,0.003704005,0.001198272,0.001331185],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006461616,"threshold_uncertainty_score":0.02161628,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Prosenjit Bose","is_ca":true},{"name":"Erik D. Demaine","is_ca":true},{"name":"Anna Lubiw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02189423848872213,"gpt":0.2809147616313767,"spread":0.2590205231426546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002402597,0.001840167,0.00196634,0.003121999,0.002177669,0.004190126,0.004763394,0.00250589,0.02500105],"category_scores_gemma":[0.01301606,0.001518416,0.002312041,0.004050779,0.001907417,0.01064037,0.007793262,0.004485045,0.005898353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00219885,"about_ca_system_score_gemma":0.001980248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002095994,"about_ca_topic_score_gemma":0.002784924,"domain_scores_codex":[0.9973839,0.0004563719,0.0001709809,0.0006285242,0.001045505,0.0003148154],"domain_scores_gemma":[0.9962823,0.001991806,0.0001694982,0.001002063,0.0004330401,0.0001214075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003441833,0.0002809137,0.0006326685,0.000338125,0.0001255456,0.000112926,0.0002454687,0.04032287,0.003174034,0.5407573,0.01936178,0.3943043],"study_design_scores_gemma":[0.0001242989,0.00005452181,0.0001913473,0.00003148341,0.00006736353,0.0001018752,0.00009887238,0.2457337,0.00383392,0.7381524,0.01158015,0.00003002538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01094254,0.0003645445,0.9697534,0.0005820723,0.0002044393,0.0001790681,0.0002063931,0.001439559,0.0163279],"genre_scores_gemma":[0.15024,0.0006209345,0.8315092,0.0002861572,0.0002420528,0.0004131692,0.0009670717,0.001026402,0.01469503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02500105,"threshold_uncertainty_score":0.08363682,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Daya Ram Gaur","is_ca":true},{"name":"Toshihide Ibaraki","is_ca":false},{"name":"Ramesh Krishnamurti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04323806333478964,"gpt":0.2569635155234735,"spread":0.2137254521886838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002785352,0.002557668,0.002921213,0.002222289,0.001870355,0.003977288,0.00633344,0.003855984,0.01648058],"category_scores_gemma":[0.01485638,0.001415099,0.001890117,0.005403939,0.001765816,0.011369,0.003921849,0.004338162,0.003394782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003864369,"about_ca_system_score_gemma":0.0033539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007206263,"about_ca_topic_score_gemma":0.008866204,"domain_scores_codex":[0.9963935,0.001191511,0.0001738939,0.0007051892,0.0007831039,0.0007528064],"domain_scores_gemma":[0.9917163,0.005261922,0.0006657102,0.001394264,0.0005284073,0.0004333636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003027544,0.001168385,0.001813425,0.000903621,0.0002653659,0.000203352,0.0007283081,0.3943657,0.006286841,0.1709299,0.04311488,0.3771927],"study_design_scores_gemma":[0.0005502034,0.000202659,0.000460608,0.00004877859,0.0001260414,0.0002160331,0.0002145883,0.8635612,0.002033246,0.1257933,0.006748779,0.00004448089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09762152,0.005226175,0.8608574,0.003757455,0.0004054573,0.0004609931,0.0008239754,0.003195279,0.02765183],"genre_scores_gemma":[0.3110537,0.002073214,0.6693249,0.0007474505,0.0003539568,0.0005181904,0.002108674,0.000928034,0.01289191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01648058,"threshold_uncertainty_score":0.0551331,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"V. Kumar Murty","is_ca":true},{"name":"Guangwu Xu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01407102858777722,"gpt":0.2615776276533546,"spread":0.2475065990655774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375286,0.001578177,0.002223795,0.003630513,0.001879457,0.003362714,0.002846544,0.001624477,0.01273923],"category_scores_gemma":[0.01571329,0.0007577405,0.002168798,0.003379958,0.002644253,0.006381255,0.004349663,0.004540048,0.005561013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512472,"about_ca_system_score_gemma":0.001998162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00154086,"about_ca_topic_score_gemma":0.002356606,"domain_scores_codex":[0.995695,0.001031544,0.0003632959,0.000592078,0.001899675,0.0004182639],"domain_scores_gemma":[0.9942761,0.00137338,0.0002339111,0.002954194,0.0009463387,0.0002161734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001019463,0.0002788323,0.001762325,0.0002116494,0.0001158435,0.0002245884,0.0003678067,0.01439493,0.009986611,0.6749668,0.01610069,0.2805706],"study_design_scores_gemma":[0.0002153522,0.0003072233,0.0009094361,0.00009509721,0.000120309,0.0005547003,0.0001292656,0.1158389,0.01444912,0.8296537,0.0375972,0.0001297255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04692411,0.001005678,0.9171271,0.001350104,0.001145499,0.0003448282,0.0004153988,0.003380086,0.02830726],"genre_scores_gemma":[0.2841229,0.0008120961,0.6891396,0.0005969867,0.0009347067,0.0004278864,0.0009327449,0.001103691,0.02192947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01273923,"threshold_uncertainty_score":0.0426169,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeannette Janssen","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":true},{"name":"Lata Narayanan","is_ca":true},{"name":"Sunil Shende","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01410412832036778,"gpt":0.2485955839195235,"spread":0.2344914555991557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433117,0.0005816042,0.001510769,0.0008194478,0.001104068,0.001576397,0.001885955,0.001242619,0.003318275],"category_scores_gemma":[0.007267551,0.0004991204,0.0003521147,0.001846041,0.001024037,0.001965407,0.001549939,0.0007589224,0.0003660129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262494,"about_ca_system_score_gemma":0.001099263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005459971,"about_ca_topic_score_gemma":0.005251717,"domain_scores_codex":[0.9989287,0.0004442408,0.00004081443,0.0001784494,0.000192422,0.0002153112],"domain_scores_gemma":[0.995561,0.00317645,0.0003034339,0.0003991513,0.0003747652,0.00018512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003919071,0.0001574617,0.0007909665,0.0000659645,0.00003247021,0.00005251911,0.0000778911,0.9031736,0.001037838,0.02447171,0.002393741,0.06735388],"study_design_scores_gemma":[0.00004660001,0.0000312445,0.0001098624,0.000003087114,0.00000965621,0.00002221304,0.00002663845,0.9729084,0.0002375192,0.02612027,0.0004801395,0.000004332926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1281484,0.000555366,0.8632496,0.0007535886,0.0001662691,0.00008744036,0.0001297326,0.0003780615,0.006531557],"genre_scores_gemma":[0.9420831,0.0002555984,0.05236848,0.00007819859,0.0001024171,0.0001013572,0.00008405037,0.00003683259,0.004889954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005459971,"threshold_uncertainty_score":0.01110077,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"John Ellis","is_ca":true},{"name":"Heliang Fan","is_ca":true},{"name":"Michael R. Fellows","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02940947855945121,"gpt":0.3175157692308598,"spread":0.2881062906714086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005410391,0.002637484,0.006672461,0.002015173,0.003318779,0.0117217,0.006859245,0.00441841,0.008042263],"category_scores_gemma":[0.04245352,0.002354782,0.003499998,0.00478146,0.004835324,0.02252527,0.005479212,0.008321325,0.00118589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00721468,"about_ca_system_score_gemma":0.004382796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004508059,"about_ca_topic_score_gemma":0.005988204,"domain_scores_codex":[0.9939733,0.001726135,0.0002888072,0.001768463,0.001056172,0.001187119],"domain_scores_gemma":[0.9497848,0.03976067,0.00284657,0.004899869,0.001148695,0.001559417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002644379,0.0006937794,0.003860446,0.00162968,0.0005840788,0.000700853,0.001396879,0.5924103,0.007828128,0.3165759,0.02189775,0.04977776],"study_design_scores_gemma":[0.0002892918,0.00009639654,0.0004492068,0.00008017173,0.0001874904,0.0002701953,0.0002898464,0.4133643,0.002045574,0.5798382,0.003048343,0.00004094447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3534335,0.003045435,0.5834812,0.01787059,0.0004166491,0.0006356346,0.004437679,0.002705866,0.03397349],"genre_scores_gemma":[0.8875299,0.00206732,0.0936918,0.00112464,0.0005061564,0.0006409017,0.003279375,0.001098821,0.01006125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0117217,"threshold_uncertainty_score":0.05234641,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Philippe Flajolet","is_ca":false},{"name":"Xavier Gourdon","is_ca":false},{"name":"Daniel Panario","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01655281649807776,"gpt":0.2534935249891276,"spread":0.2369407084910499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004292123,0.00164445,0.002631367,0.002312928,0.003298927,0.007290965,0.003317953,0.003272804,0.009335808],"category_scores_gemma":[0.02157367,0.00127181,0.002823535,0.003236883,0.005315383,0.01986255,0.003341193,0.005873858,0.002149862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003731107,"about_ca_system_score_gemma":0.005638136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001709729,"about_ca_topic_score_gemma":0.001416464,"domain_scores_codex":[0.9950901,0.001079713,0.0002273287,0.0009974953,0.00166448,0.0009408124],"domain_scores_gemma":[0.9815166,0.01252352,0.001047319,0.002208649,0.001992743,0.0007112286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000624633,0.00023701,0.001349866,0.000264257,0.00008821216,0.0001134722,0.0003794313,0.03799253,0.001829856,0.910264,0.009173687,0.03768297],"study_design_scores_gemma":[0.00005106419,0.00006279181,0.0002090605,0.00004171014,0.00003262263,0.00009863393,0.00005262779,0.06675082,0.001170508,0.9292145,0.002286003,0.00002963457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2356657,0.002534546,0.703198,0.007465903,0.0003402991,0.0002558407,0.00122086,0.001143455,0.04817543],"genre_scores_gemma":[0.8732647,0.001845742,0.09531848,0.001166293,0.001358122,0.0002053011,0.001854262,0.0005822322,0.02440485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009335808,"threshold_uncertainty_score":0.0312314,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Md. Saidur Rahman","is_ca":false},{"name":"Takao Nishizeki","is_ca":false},{"name":"Shubhashis Ghosh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01117526013837925,"gpt":0.23730742971907,"spread":0.2261321695806907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002268434,0.0006003369,0.0004792351,0.001126554,0.000482677,0.001364409,0.001068386,0.0006021351,0.0168783],"category_scores_gemma":[0.002244896,0.0008961889,0.0004611872,0.001589076,0.0006124539,0.001180381,0.001411062,0.00122077,0.002513582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000469029,"about_ca_system_score_gemma":0.0003779276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002216391,"about_ca_topic_score_gemma":0.004284482,"domain_scores_codex":[0.9996669,0.00008596226,0.00001842689,0.00006867562,0.0001053327,0.00005467545],"domain_scores_gemma":[0.9992182,0.0002942651,0.000108957,0.0001632124,0.0001390836,0.00007620231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002440138,0.00009254715,0.00130286,0.0003392088,0.00004466802,0.0003836547,0.0005236062,0.0974303,0.01579231,0.5598952,0.02574007,0.2982115],"study_design_scores_gemma":[0.0001605965,0.0001532616,0.001551431,0.0001359577,0.00007758071,0.0007120079,0.000603322,0.3471911,0.01356,0.5280812,0.1077113,0.00006217299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180755,0.0008717684,0.810933,0.0005351243,0.0002060546,0.0002021032,0.0009675943,0.001679001,0.06652994],"genre_scores_gemma":[0.5099177,0.001912901,0.4490969,0.0001666228,0.00007681821,0.000192291,0.002787867,0.0004771838,0.03537157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0168783,"threshold_uncertainty_score":0.05646354,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Maurice Queyranne","is_ca":true},{"name":"Maxim Sviridenko","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02441659351704695,"gpt":0.2462396156049676,"spread":0.2218230220879206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002272208,0.00122197,0.001689867,0.0008055856,0.0009314141,0.001610253,0.00279863,0.002058333,0.006401901],"category_scores_gemma":[0.005329437,0.0006931013,0.0009818531,0.001184926,0.0008523729,0.002524449,0.002245891,0.002556333,0.001149459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001593043,"about_ca_system_score_gemma":0.003186413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003742232,"about_ca_topic_score_gemma":0.005128882,"domain_scores_codex":[0.9987884,0.0003458126,0.00006117861,0.0002407526,0.0003207166,0.0002430394],"domain_scores_gemma":[0.9979818,0.001137299,0.0001414042,0.0002814382,0.0002782421,0.0001797263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00122022,0.0006659327,0.0009175198,0.0002777817,0.0001137321,0.0001217445,0.0001963848,0.6248645,0.005130562,0.03379393,0.01136286,0.3213349],"study_design_scores_gemma":[0.0001053568,0.00009295932,0.0001136028,0.00001241509,0.00001589379,0.00004863769,0.00002829203,0.9838597,0.000820927,0.01379983,0.001092423,0.000009929343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03374311,0.0004928312,0.958575,0.0006051236,0.0002242163,0.0001216052,0.0001139883,0.001302236,0.004821808],"genre_scores_gemma":[0.1928793,0.0001740506,0.8016417,0.0002713636,0.00008916217,0.0002211833,0.0002753707,0.0002146737,0.00423314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006401901,"threshold_uncertainty_score":0.02141649,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Enumeration; Constructive; Mathematics; Computer science; Combinatorics; Programming language; Process (computing)","authors":[{"name":"Gunnar Brinkmann","is_ca":false},{"name":"Gilles Caporossi","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05096497404794445,"gpt":0.2903613363710243,"spread":0.2393963623230798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001069009,0.0008968184,0.001467708,0.002805366,0.003473824,0.003547009,0.001568038,0.001795475,0.01983849],"category_scores_gemma":[0.005483582,0.0009898051,0.001458882,0.002928477,0.002256294,0.007671311,0.004470003,0.002835892,0.002913052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001263601,"about_ca_system_score_gemma":0.0008880994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001469685,"about_ca_topic_score_gemma":0.004037869,"domain_scores_codex":[0.9982973,0.0005133349,0.0001175129,0.0003040712,0.0005316333,0.0002363067],"domain_scores_gemma":[0.9970993,0.001735563,0.0001198527,0.0004597325,0.0004085592,0.0001770703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008617099,0.00004963446,0.0003867297,0.0001189796,0.0000154796,0.00008347719,0.0004185758,0.001950131,0.001619681,0.9441605,0.004433948,0.04667671],"study_design_scores_gemma":[0.00001873013,0.00003109946,0.0001684431,0.00007578883,0.00002766202,0.0001401766,0.0003247395,0.007417379,0.002225509,0.9637718,0.02577491,0.0000238001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1701051,0.002004381,0.634979,0.002719261,0.0007990869,0.0003422321,0.001318163,0.001041879,0.1866909],"genre_scores_gemma":[0.4546856,0.001561314,0.4714213,0.0008829414,0.00026447,0.0003180446,0.001924252,0.0005811768,0.06836095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01983849,"threshold_uncertainty_score":0.06636631,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Tao Jiang","is_ca":false},{"name":"Paul Kearney","is_ca":true},{"name":"Ming Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01820542960905682,"gpt":0.3037905689558141,"spread":0.2855851393467573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01125833,0.001246798,0.002525492,0.002577584,0.005086712,0.00786347,0.004791739,0.005379871,0.0120924],"category_scores_gemma":[0.05801154,0.001349,0.001910961,0.005955466,0.009675985,0.02780619,0.005693333,0.01148415,0.00166475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002435289,"about_ca_system_score_gemma":0.002200423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001466675,"about_ca_topic_score_gemma":0.001006029,"domain_scores_codex":[0.9944476,0.002346277,0.0004648924,0.0009771729,0.001464312,0.0002997046],"domain_scores_gemma":[0.9264793,0.06487939,0.000833495,0.003819728,0.003032241,0.0009557156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002242003,0.0002748432,0.0008554067,0.0004819052,0.00007843259,0.0001120457,0.0004649468,0.01809307,0.0003153072,0.7873875,0.03233137,0.1593809],"study_design_scores_gemma":[0.00002352643,0.00001381047,0.00007086853,0.00003744598,0.000009665582,0.00003849559,0.00007555399,0.02077854,0.0001728797,0.9729772,0.00579257,0.000009359933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03565865,0.04220011,0.7822011,0.0998373,0.006002384,0.000175305,0.0004815341,0.0005896448,0.0328541],"genre_scores_gemma":[0.3788376,0.03878144,0.498309,0.009870793,0.02986356,0.0009042005,0.002271648,0.001112042,0.04004971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0120924,"threshold_uncertainty_score":0.05954045,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Alon Efrat","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03404273858224385,"gpt":0.2688807568102196,"spread":0.2348380182279758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001129491,0.001355033,0.001836151,0.0007552545,0.0009271906,0.001272621,0.002010508,0.001956501,0.008251138],"category_scores_gemma":[0.00716069,0.0005966133,0.0008071139,0.001078313,0.001295834,0.003089633,0.002060046,0.002019673,0.0005696662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009357638,"about_ca_system_score_gemma":0.001124171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006432261,"about_ca_topic_score_gemma":0.006767244,"domain_scores_codex":[0.9994797,0.0001824662,0.00001644283,0.00007936449,0.0001141534,0.0001278863],"domain_scores_gemma":[0.998006,0.001484517,0.0000909546,0.0001625809,0.0001289252,0.0001269278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001409306,0.0002688731,0.0009107197,0.0001772047,0.00007092809,0.0001348919,0.0001414882,0.8249805,0.001827749,0.07033807,0.01310843,0.0866318],"study_design_scores_gemma":[0.0001042938,0.00005360909,0.0001252366,0.00001188983,0.00001707756,0.00002184747,0.00004293622,0.921396,0.0004668109,0.07684691,0.0009061564,0.000007373349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3470944,0.00169404,0.6112934,0.004335645,0.0003847197,0.0001646995,0.0007126633,0.00124098,0.03307951],"genre_scores_gemma":[0.7912549,0.0006293638,0.1914405,0.0004179144,0.0001482683,0.0001492892,0.0007366114,0.0008015092,0.01442165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008251138,"threshold_uncertainty_score":0.02760279,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Time complexity; Unanimity; Algorithm; Combinatorics; Polynomial; Mathematics; Computer science; Discrete mathematics","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Cynthia Loten","is_ca":true},{"name":"László Zádori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01618163022204756,"gpt":0.2872839656478463,"spread":0.2711023354257988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001698256,0.001627175,0.002307337,0.002158034,0.003739516,0.004022362,0.005986524,0.003089075,0.01279185],"category_scores_gemma":[0.008184201,0.001359407,0.002291949,0.00354126,0.002195335,0.0128541,0.005936399,0.003586406,0.003465193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003914798,"about_ca_system_score_gemma":0.004485105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00456562,"about_ca_topic_score_gemma":0.008688976,"domain_scores_codex":[0.9973602,0.0003815615,0.0001771594,0.0009914944,0.0006601568,0.0004294526],"domain_scores_gemma":[0.9936191,0.002986938,0.0003849212,0.001844989,0.0006477084,0.0005162696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002320883,0.001611638,0.002781615,0.001392564,0.0002252948,0.0003381101,0.001564823,0.07244643,0.02341389,0.2174543,0.05016851,0.626282],"study_design_scores_gemma":[0.0006682047,0.0003175712,0.0009723368,0.0001142455,0.0001970051,0.000448655,0.0005818245,0.2927638,0.01235268,0.673286,0.01819623,0.0001013827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.130797,0.0008084229,0.8264155,0.00427987,0.0004104811,0.001041015,0.00185186,0.01002357,0.02437231],"genre_scores_gemma":[0.248455,0.0003589411,0.7297264,0.0006199955,0.0001989382,0.0005911124,0.004119448,0.001165218,0.01476512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01279185,"threshold_uncertainty_score":0.04279298,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Claudia Iturriaga","is_ca":true},{"name":"Anna Lubiw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01757324017823872,"gpt":0.255436192997203,"spread":0.2378629528189643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949036,0.0004186424,0.0004451991,0.001274856,0.00119839,0.001835094,0.0007189583,0.001050383,0.006236086],"category_scores_gemma":[0.004674586,0.0005244616,0.0002490102,0.0008160554,0.001302121,0.002306684,0.002562199,0.001029876,0.001439214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003658468,"about_ca_system_score_gemma":0.0002860321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005651421,"about_ca_topic_score_gemma":0.0007455141,"domain_scores_codex":[0.9996822,0.00005490839,0.00001220775,0.00008382292,0.0001230076,0.00004400306],"domain_scores_gemma":[0.9986066,0.0005082293,0.0002020018,0.0002878309,0.0002568482,0.0001383736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001452393,0.000186626,0.007326903,0.0002794724,0.00004927884,0.001176105,0.001376568,0.2196548,0.04865603,0.4310772,0.01187828,0.2768863],"study_design_scores_gemma":[0.00009083078,0.0002668311,0.003175601,0.00009598108,0.00004329033,0.0007486415,0.0009566904,0.630084,0.02972948,0.3022192,0.03251513,0.0000742955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3805231,0.0003682414,0.5788196,0.0008069724,0.0003204446,0.00008393318,0.0003161216,0.0009937079,0.03776784],"genre_scores_gemma":[0.8525153,0.0004025082,0.1251805,0.0001239908,0.0001465378,0.00008338871,0.0003696537,0.0005154735,0.02066278],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006236086,"threshold_uncertainty_score":0.02086174,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Kazuhisa Makino","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02007652376892932,"gpt":0.245157775995278,"spread":0.2250812522263487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009351019,0.002326542,0.002292761,0.002045343,0.001547599,0.00369771,0.004380523,0.002838145,0.01703779],"category_scores_gemma":[0.004543229,0.001104046,0.002273425,0.00307331,0.001410363,0.007726133,0.003415537,0.002918937,0.005988286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002362918,"about_ca_system_score_gemma":0.003169236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005037261,"about_ca_topic_score_gemma":0.008231892,"domain_scores_codex":[0.9978853,0.0002131556,0.0002025387,0.000874662,0.0005257059,0.0002985816],"domain_scores_gemma":[0.9967774,0.001751156,0.0001948526,0.0006723701,0.000417223,0.0001870198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001041906,0.0005830174,0.0009808224,0.0004721303,0.0001240964,0.0001371348,0.0002021412,0.01615382,0.023495,0.02076747,0.0251915,0.910851],"study_design_scores_gemma":[0.001127424,0.0005985187,0.001358208,0.0001102886,0.0003687905,0.0009045589,0.000500507,0.7071176,0.04738552,0.2168234,0.02354558,0.0001595571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02848896,0.0007033218,0.9465044,0.0008379187,0.0002101498,0.0004794374,0.0008928058,0.01448544,0.007397587],"genre_scores_gemma":[0.1236031,0.0002974398,0.8615716,0.0005146049,0.0001239402,0.0005799517,0.003945261,0.0006492507,0.008714896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01703779,"threshold_uncertainty_score":0.05699706,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":true},{"name":"A. Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01400393204816866,"gpt":0.2460030780370555,"spread":0.2319991459888868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165726,0.0004215992,0.001280238,0.001349846,0.001497325,0.002448871,0.001948965,0.0015642,0.003025167],"category_scores_gemma":[0.0125626,0.0005227727,0.0003532463,0.001815904,0.001770761,0.00377515,0.001578266,0.001298803,0.000496153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001482695,"about_ca_system_score_gemma":0.0008227516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002001911,"about_ca_topic_score_gemma":0.001592295,"domain_scores_codex":[0.9985436,0.0004932287,0.00009066229,0.0001859858,0.0004554141,0.0002310634],"domain_scores_gemma":[0.9915698,0.006188262,0.0005847915,0.0006827079,0.0007189742,0.0002555299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009909318,0.0001831251,0.001816639,0.0004270079,0.0001066079,0.0002715597,0.0008192498,0.4076041,0.007862069,0.3828457,0.009384664,0.1876885],"study_design_scores_gemma":[0.0001352366,0.0001085131,0.0002800776,0.00002732022,0.00005698972,0.0002212703,0.0001476206,0.7331821,0.003535633,0.2567529,0.005529062,0.00002339634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08834308,0.003519554,0.8934932,0.002257926,0.0003967419,0.00006942066,0.00007374387,0.0009322664,0.01091403],"genre_scores_gemma":[0.8899026,0.00233586,0.09561289,0.000315375,0.0004236969,0.0001331999,0.0001602902,0.0001557007,0.0109603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003025167,"threshold_uncertainty_score":0.01075774,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"John M. Boyer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03443542798261186,"gpt":0.2942649265590317,"spread":0.2598294985764199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530518,0.001840764,0.001681073,0.001350055,0.001801447,0.002927907,0.003477854,0.001451475,0.02901568],"category_scores_gemma":[0.01030489,0.0008291431,0.001867222,0.002779136,0.0017099,0.004068348,0.004590152,0.001782919,0.006050242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002167699,"about_ca_system_score_gemma":0.002978504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003278645,"about_ca_topic_score_gemma":0.006615111,"domain_scores_codex":[0.9974133,0.0005785919,0.0001941972,0.0004621877,0.0008545732,0.0004971813],"domain_scores_gemma":[0.9917019,0.00330868,0.0003975879,0.003148895,0.001065446,0.0003775067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.006823207,0.0005424714,0.00302985,0.001137357,0.000302118,0.0006603127,0.0007125235,0.1583481,0.04532585,0.05998935,0.06691894,0.65621],"study_design_scores_gemma":[0.001284937,0.0003980075,0.0009029582,0.00007532941,0.0001854057,0.0003031164,0.0003831684,0.8000427,0.02861618,0.1508768,0.01683037,0.0001010352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.138048,0.0008622834,0.7950985,0.0013117,0.0008206223,0.0007594739,0.001663239,0.02833512,0.0331011],"genre_scores_gemma":[0.4112494,0.0001846634,0.5720268,0.0004101993,0.0001508395,0.0005841132,0.001999245,0.002992335,0.01040243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02901568,"threshold_uncertainty_score":0.09706718,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ben Gum","is_ca":false},{"name":"Richard J. Lipton","is_ca":false},{"name":"Andrea S. LaPaugh","is_ca":false},{"name":"Faith E. Fich","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02866371422076207,"gpt":0.3065240418121284,"spread":0.2778603275913664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005128775,0.001200711,0.002532601,0.00335189,0.001352887,0.00390218,0.003373666,0.003648841,0.01084562],"category_scores_gemma":[0.06224425,0.001599858,0.001274971,0.003070504,0.002634458,0.01277942,0.003492359,0.004691819,0.002809094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001793554,"about_ca_system_score_gemma":0.001299428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001244143,"about_ca_topic_score_gemma":0.001437939,"domain_scores_codex":[0.9953226,0.001957952,0.0001772598,0.001639291,0.0005922478,0.0003106157],"domain_scores_gemma":[0.9643132,0.02812418,0.001185289,0.004093147,0.001548066,0.0007360094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001207116,0.0002864842,0.01223148,0.001009015,0.0004020426,0.0002106922,0.0004531835,0.1979321,0.008447553,0.4788456,0.03054282,0.2684319],"study_design_scores_gemma":[0.00004431266,0.00007720081,0.002065942,0.0001106809,0.0000702199,0.0001990671,0.0000820237,0.4803628,0.003598554,0.5071894,0.006161589,0.00003816727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07906893,0.003623365,0.8926946,0.004726505,0.0004336675,0.00007064017,0.00132131,0.001408928,0.01665212],"genre_scores_gemma":[0.7160998,0.001915745,0.2626578,0.0007679749,0.001194188,0.0002997143,0.002644726,0.0008983213,0.01352175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01084562,"threshold_uncertainty_score":0.03628224,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jonathan H. Badger","is_ca":true},{"name":"Paul Kearney","is_ca":true},{"name":"Ming Li","is_ca":true},{"name":"John S. Tsang","is_ca":true},{"name":"Tao Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01867079115041825,"gpt":0.2659172230674615,"spread":0.2472464319170432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005954068,0.0009875327,0.001307663,0.002824644,0.001413627,0.002269815,0.002326261,0.002616766,0.00785476],"category_scores_gemma":[0.03481089,0.0009017358,0.0012858,0.0028308,0.001058961,0.004130185,0.002010048,0.003112195,0.003016457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000638431,"about_ca_system_score_gemma":0.001502369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008247029,"about_ca_topic_score_gemma":0.003171532,"domain_scores_codex":[0.9979539,0.001127981,0.0001879768,0.000357262,0.0002409243,0.0001319302],"domain_scores_gemma":[0.9820185,0.01479013,0.0004770051,0.001351163,0.0009060742,0.0004571077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001554475,0.0005196206,0.02126191,0.001036466,0.0007470323,0.0003885474,0.001252974,0.1329481,0.006336599,0.04733624,0.02869983,0.7579181],"study_design_scores_gemma":[0.000367351,0.0003180356,0.001862839,0.0003585256,0.0003305448,0.0003980851,0.0006589125,0.7979772,0.002843589,0.1802066,0.01463161,0.00004657747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08212812,0.002015508,0.9039899,0.001852117,0.0002649077,0.0003406072,0.0009574938,0.003323896,0.005127405],"genre_scores_gemma":[0.1530893,0.0004710027,0.8409995,0.0003510439,0.0001304398,0.0003271075,0.002307895,0.0006525774,0.00167116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00785476,"threshold_uncertainty_score":0.03148854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter Sanders","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02137014463455823,"gpt":0.3530840445356046,"spread":0.3317138999010464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003601867,0.0002884507,0.0003705051,0.000784451,0.00226145,0.003666294,0.00105477,0.001381046,0.02540026],"category_scores_gemma":[0.02706312,0.0005950369,0.000483389,0.0006120215,0.001889135,0.007788525,0.003288691,0.001590077,0.00307658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001202494,"about_ca_system_score_gemma":0.001158739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003969624,"about_ca_topic_score_gemma":0.004440887,"domain_scores_codex":[0.9974204,0.001323471,0.00008985283,0.0004323895,0.0003989457,0.0003348625],"domain_scores_gemma":[0.985299,0.008154407,0.0007264923,0.002752123,0.001577123,0.001490894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009726154,0.0006727492,0.09368666,0.0001860363,0.00008056734,0.0006430312,0.02643302,0.007026529,0.01092552,0.615038,0.01395222,0.2303831],"study_design_scores_gemma":[0.0002622075,0.0008848925,0.05270005,0.0001726956,0.0001906104,0.001524525,0.03094028,0.1442389,0.009837739,0.6996377,0.05947122,0.0001391556],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7845351,0.0002542135,0.1065158,0.003207417,0.0001804422,0.0001414515,0.0001677033,0.0006790234,0.1043191],"genre_scores_gemma":[0.9713987,0.00006901976,0.01211261,0.0001395428,0.00002918687,0.00002706686,0.00009547326,0.00009768163,0.0160309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02540026,"threshold_uncertainty_score":0.08497232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}