{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":232,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":232,"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":"29abced35583","filters":{"venue":"Algorithmica"}},"results":[{"id":"W2118877434","doi":"10.1007/s00453-001-0003-0","title":"Optimal Search and One-Way Trading Online Algorithms","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":210,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Portfolio; Stochastic game; Computer science; Online algorithm; Adversary; Mathematical economics; Economics; Algorithm; Mathematics; Upper and lower bounds; Financial economics","authors":[{"name":"Ran El‐Yaniv","is_ca":false},{"name":"Amos Fiat","is_ca":false},{"name":"Richard M. Karp","is_ca":false},{"name":"G. Turpin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04645055543326879,"gpt":0.2911219949819577,"spread":0.2446714395486889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002942438,0.001292301,0.00259838,0.0008870355,0.001040912,0.003463228,0.002436314,0.003788895,0.01065294],"category_scores_gemma":[0.02097902,0.0008506743,0.001000476,0.002413637,0.003197538,0.009457158,0.002438766,0.004051353,0.0009727311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001228943,"about_ca_system_score_gemma":0.001070801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008752346,"about_ca_topic_score_gemma":0.0008034579,"domain_scores_codex":[0.9977605,0.001235692,0.00009092547,0.0003650798,0.0003754387,0.0001724122],"domain_scores_gemma":[0.9887399,0.009399112,0.0004860889,0.0008183814,0.0003464455,0.0002101152],"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.000313722,0.0002392738,0.0007041538,0.0003138181,0.00009441823,0.00009172079,0.0001291204,0.1390782,0.0004045322,0.7740598,0.006140816,0.0784305],"study_design_scores_gemma":[0.00003868498,0.00003035643,0.0001197936,0.0000192312,0.00002050001,0.00004489116,0.00001968269,0.2187575,0.0001553236,0.7790459,0.001738232,0.000009861984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04447879,0.008897284,0.9138749,0.00295907,0.0005389432,0.00006400551,0.0001258401,0.0002838954,0.02877719],"genre_scores_gemma":[0.7505208,0.005152346,0.2081164,0.000517999,0.0008751506,0.0002672497,0.0002577577,0.0002554581,0.03403676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01065294,"threshold_uncertainty_score":0.03563762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988889787","doi":"10.1007/s00453-006-0074-2","title":"Deterministic Rendezvous in Graphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Theory of computation; Time complexity; Binary logarithm; Graph; Identifier; Upper and lower bounds; Node (physics); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Computer network","authors":[{"name":"Anders Dessmark","is_ca":false},{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00716953051749322,"gpt":0.2238464719368621,"spread":0.2166769414193689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452821,0.000985904,0.001994446,0.001426419,0.002780602,0.003282903,0.003040523,0.002434256,0.009044521],"category_scores_gemma":[0.01273242,0.001289191,0.001119511,0.002264237,0.004251047,0.006404631,0.003677689,0.002654053,0.001082439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002329163,"about_ca_system_score_gemma":0.001522697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006154896,"about_ca_topic_score_gemma":0.007691697,"domain_scores_codex":[0.9983359,0.0005649762,0.00006518399,0.0004580183,0.0002550575,0.0003208701],"domain_scores_gemma":[0.9909333,0.006552436,0.0006041919,0.001037707,0.0003377384,0.0005346468],"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.0005716782,0.0001076684,0.001153391,0.0003161156,0.0001044,0.0002245691,0.0006130697,0.3057693,0.001924651,0.6487612,0.007769501,0.03268446],"study_design_scores_gemma":[0.00009859689,0.00003449892,0.0002158011,0.00003426232,0.00003711797,0.00009368231,0.0002160379,0.2950231,0.001242269,0.6996757,0.003305989,0.00002299522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4227057,0.002419023,0.5222675,0.004065999,0.0002263105,0.0002390178,0.0008096251,0.001232831,0.046034],"genre_scores_gemma":[0.9064116,0.0009107147,0.07177787,0.0002537952,0.00008441443,0.0001862,0.0004800956,0.0004122666,0.01948304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009044521,"threshold_uncertainty_score":0.03025699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023419712","doi":"10.1007/s00453-001-0006-x","title":"Right-Triangulated Irregular Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Terrain; Triangulated irregular network; Computer science; Observer (physics); Field (mathematics); Data structure; Point (geometry); Surface (topology); Visualization; Theory of computation; Space (punctuation); Algorithm; Mathematics; Artificial intelligence; Geometry; Cartography; Geography","authors":[{"name":"William Evans","is_ca":false},{"name":"David Kirkpatrick","is_ca":true},{"name":"George Townsend","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009402726006114312,"gpt":0.250872743596216,"spread":0.2414700175901017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005282988,0.0003414973,0.0005184248,0.001164693,0.0007954255,0.001513634,0.001041435,0.0008197918,0.008138428],"category_scores_gemma":[0.004123691,0.0004009076,0.000358416,0.0007641133,0.001092169,0.002114061,0.001799587,0.001089313,0.0009591025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005165605,"about_ca_system_score_gemma":0.0003605985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001616914,"about_ca_topic_score_gemma":0.002669704,"domain_scores_codex":[0.9995936,0.0001006754,0.00002241053,0.00009864441,0.0001379944,0.00004679231],"domain_scores_gemma":[0.9982014,0.000721441,0.0002211904,0.0004146814,0.0002491291,0.0001920827],"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.000207781,0.00004081751,0.001874041,0.0001011425,0.00002955768,0.0003312457,0.0002710288,0.1135833,0.005028455,0.8152039,0.003276024,0.06005272],"study_design_scores_gemma":[0.00002330977,0.00002434329,0.0005703127,0.00002393358,0.00001620212,0.000252968,0.0001233705,0.5162654,0.00266673,0.4690064,0.01101407,0.00001294928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1716697,0.0003614525,0.7937429,0.0004328267,0.000104706,0.00008487046,0.0005281618,0.0004838585,0.03259154],"genre_scores_gemma":[0.7429886,0.0004498844,0.2248907,0.0001244124,0.00007182567,0.00009489564,0.0009868108,0.0002874561,0.03010532],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008138428,"threshold_uncertainty_score":0.02722573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109924867","doi":"10.1007/s00453-002-0976-3","title":"Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Binary tree; Binary search tree; Element (criminal law); Binary number; Oracle; Discrete mathematics; Quantum; Sorting; Quantum algorithm; Algorithm; Computer science; Arithmetic; Physics; Quantum mechanics","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02030524396563501,"gpt":0.23947494096838,"spread":0.219169697002745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002883134,0.0004697389,0.001536059,0.001352235,0.002592461,0.006149564,0.002443202,0.002687847,0.01384742],"category_scores_gemma":[0.02835469,0.0008592383,0.001316186,0.002476873,0.005632791,0.01733887,0.003106887,0.004946711,0.0006641675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004392822,"about_ca_system_score_gemma":0.003165139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00359758,"about_ca_topic_score_gemma":0.004040078,"domain_scores_codex":[0.9971208,0.0008209638,0.0001412097,0.0003471601,0.0009820784,0.0005878169],"domain_scores_gemma":[0.9668497,0.02766853,0.001107336,0.002723024,0.0009744275,0.000676973],"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.0001167031,0.00004268423,0.0003616508,0.00005997072,0.00001136329,0.00004479438,0.0001474199,0.01571444,0.0002963995,0.9765387,0.001737872,0.004927972],"study_design_scores_gemma":[0.00002441475,0.000008136352,0.0001974257,0.000008897598,0.000009129697,0.00003304531,0.00006810309,0.03481251,0.0002937073,0.9639542,0.0005784808,0.0000118205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6290077,0.002919957,0.2558805,0.01909755,0.0003764356,0.0001572752,0.001084034,0.0005334283,0.09094325],"genre_scores_gemma":[0.9678133,0.0008343306,0.02269004,0.0003243133,0.0002236709,0.0001203736,0.0002902342,0.0001410372,0.007562605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01384742,"threshold_uncertainty_score":0.04632419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074982499","doi":"10.1007/s004530010067","title":"Static Frequency Assignment in Cellular Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Frequency assignment; Theory of computation; Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex connectivity; Discrete mathematics; Integer (computer science); Algorithm; Computer science","authors":[{"name":"Lata Narayanan","is_ca":true},{"name":"S. Shende","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004934258321494517,"gpt":0.1739740494944223,"spread":0.1690397911729278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008426,0.0006314026,0.0009515565,0.001575202,0.001583788,0.002463252,0.00161107,0.001379862,0.004376681],"category_scores_gemma":[0.01003106,0.000684671,0.0004550898,0.002696231,0.001791845,0.003265976,0.001301351,0.001226078,0.0005425194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001673234,"about_ca_system_score_gemma":0.001550625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003866701,"about_ca_topic_score_gemma":0.004129993,"domain_scores_codex":[0.9990731,0.0003788202,0.00002583584,0.0001790782,0.000181662,0.0001614655],"domain_scores_gemma":[0.9956319,0.002954413,0.000457988,0.000337533,0.0003698358,0.0002483497],"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.0001993477,0.0001190734,0.001760015,0.0001668394,0.00005825974,0.0001093189,0.0002669984,0.4146982,0.001257295,0.4947181,0.008009222,0.07863725],"study_design_scores_gemma":[0.00003474109,0.00002833696,0.000404333,0.00001940907,0.00002768278,0.00006495419,0.0001215367,0.4314509,0.000303469,0.5647573,0.002771571,0.00001579092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1982476,0.001752838,0.7775924,0.002410459,0.0002849547,0.00008231862,0.0002622804,0.0002904839,0.01907679],"genre_scores_gemma":[0.9044595,0.001860808,0.07324146,0.0002589579,0.0003830359,0.000171502,0.0003298332,0.0001035982,0.01919125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004376681,"threshold_uncertainty_score":0.01464146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786889022","doi":"10.1007/s00453-005-1168-8","title":"Constructing Plane Spanners of Bounded Degree and Low Weight","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Degree (music); Combinatorics; Mathematics; Plane (geometry); Theory of computation; Spanner; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Binary logarithm; Spanning tree; Point (geometry); Tree (set theory); Discrete mathematics; Geometry; Algorithm; Computer science; Physics; Mathematical analysis","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Joachim Gudmundsson","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01287707065722272,"gpt":0.2251614993913839,"spread":0.2122844287341611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003577723,0.0007544067,0.0008484405,0.0011525,0.0004888041,0.00104667,0.0009885827,0.000914087,0.007074174],"category_scores_gemma":[0.002430937,0.0006300447,0.0005524476,0.0009747443,0.0008359737,0.001622935,0.003100615,0.0015169,0.00152419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003251288,"about_ca_system_score_gemma":0.0002556033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004115479,"about_ca_topic_score_gemma":0.0008770344,"domain_scores_codex":[0.9996042,0.00007777829,0.00002136379,0.00007716,0.0001471029,0.00007248752],"domain_scores_gemma":[0.9991437,0.0003553198,0.0001061763,0.0001873101,0.00009840172,0.0001091268],"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.0005820174,0.0003570061,0.003652593,0.0003869476,0.0001137081,0.0005995822,0.0007629861,0.1484041,0.05380041,0.5588897,0.01019729,0.2222536],"study_design_scores_gemma":[0.0001169233,0.0003584725,0.001054097,0.00008082019,0.00005780875,0.0003911705,0.0004516862,0.3515497,0.0284647,0.6018904,0.01554594,0.00003834976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3912882,0.0002567755,0.5844516,0.0002370276,0.0001076209,0.0001327194,0.0003438506,0.0006366186,0.02254569],"genre_scores_gemma":[0.677891,0.0003970048,0.3011047,0.0001624251,0.00005730548,0.0001664093,0.0008980583,0.0004777258,0.01884533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007074174,"threshold_uncertainty_score":0.02366549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020796742","doi":"10.1007/s00453-011-9611-5","title":"Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; École de Technologie Supérieure; Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Asynchronous communication; Robot; Ring (chemistry); Theory of computation; Computer science; Prime (order theory); Combinatorics; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Topology (electrical circuits); Artificial intelligence; Computer network","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"David Ilcinkas","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03405175304668747,"gpt":0.2886569309033074,"spread":0.25460517785662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418455,0.0004161659,0.000914171,0.000416396,0.001005909,0.001567059,0.001727605,0.001000632,0.003570407],"category_scores_gemma":[0.0065945,0.0003893117,0.0005116672,0.0006158306,0.001985362,0.004084582,0.002361537,0.001235637,0.0004085875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005379235,"about_ca_system_score_gemma":0.0007300447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007505922,"about_ca_topic_score_gemma":0.0007386045,"domain_scores_codex":[0.99924,0.000336149,0.00002779111,0.0001383287,0.0001113701,0.000146379],"domain_scores_gemma":[0.9969073,0.00195327,0.000222535,0.0005279889,0.0001491849,0.0002397482],"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.001078453,0.0001374129,0.0006858986,0.0002115232,0.00006941881,0.0001658135,0.0003786285,0.5003465,0.005024066,0.4539081,0.003609293,0.03438479],"study_design_scores_gemma":[0.00006894711,0.00007631001,0.0001135275,0.00001103491,0.00002057312,0.00003983118,0.00007288207,0.7697736,0.001407018,0.226954,0.001445116,0.0000171702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2593844,0.001103889,0.7113301,0.001590278,0.0002085153,0.00009090425,0.0001328031,0.0005812576,0.02557779],"genre_scores_gemma":[0.9544291,0.0003026641,0.04024196,0.00008131758,0.0000616235,0.00007903232,0.00003487673,0.00007588601,0.00469348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003570407,"threshold_uncertainty_score":0.01194417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017440808","doi":"10.1007/s00453-001-0014-x","title":"A One-Step Crust and Skeleton Extraction Algorithm","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Université Laval","funders":"","keywords":"Voronoi diagram; Skeleton (computer programming); Algorithm; Vertex (graph theory); Computer science; Crust; Topology (electrical circuits); Combinatorics; Mathematics; Geology; Geometry; Theoretical computer science; Graph; Geophysics","authors":[{"name":"C. M. Gold","is_ca":true},{"name":"Jack Snoeyink","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01591968665295741,"gpt":0.2586402464377212,"spread":0.2427205597847638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006117258,0.00122436,0.001621045,0.001832347,0.0009954756,0.001128893,0.002546455,0.001707333,0.01494998],"category_scores_gemma":[0.00175383,0.0009125711,0.001457645,0.001590068,0.000672681,0.001896795,0.003663475,0.001431528,0.005985057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003624695,"about_ca_system_score_gemma":0.001454462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001999548,"about_ca_topic_score_gemma":0.003847766,"domain_scores_codex":[0.9992943,0.00004924703,0.00005273338,0.0002025097,0.0003451606,0.00005606729],"domain_scores_gemma":[0.9991828,0.0001390918,0.00003847279,0.0003104643,0.000266327,0.00006287322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001238108,0.00009406047,0.0006351268,0.0001690794,0.00008348409,0.0001199815,0.00007155225,0.03536963,0.02502813,0.008150987,0.007321644,0.9228325],"study_design_scores_gemma":[0.00009631416,0.0001637925,0.001159843,0.0000389829,0.0001173281,0.0006509914,0.00007795193,0.9206171,0.03386972,0.02351614,0.01962617,0.00006562057],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002975499,0.0000729333,0.9931028,0.0000322162,0.00003185682,0.00005307661,0.00007257764,0.002516582,0.001142408],"genre_scores_gemma":[0.03013778,0.0000805903,0.9651287,0.00004730819,0.00001738823,0.00006328248,0.0004666941,0.0003560038,0.003702315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01494998,"threshold_uncertainty_score":0.05001265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062310236","doi":"10.1007/s00453-014-9911-7","title":"Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Rounding; Mathematics; Facility location problem; Theory of computation; Linear programming; Randomized rounding; Function (biology); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Computer science","authors":[{"name":"Yu Li","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Naihua Xiu","is_ca":false},{"name":"Dachuan Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02614157390848688,"gpt":0.2256202621160007,"spread":0.1994786882075138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004614622,0.002319733,0.002891001,0.001581688,0.001054851,0.003176125,0.006029054,0.003021639,0.01291156],"category_scores_gemma":[0.01403757,0.001290995,0.001878228,0.003241833,0.001589835,0.005165185,0.003324258,0.006338432,0.001896526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003840068,"about_ca_system_score_gemma":0.004118886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008996436,"about_ca_topic_score_gemma":0.01469011,"domain_scores_codex":[0.9971243,0.001264047,0.0001097753,0.0004584199,0.0005274203,0.0005159923],"domain_scores_gemma":[0.992399,0.005226887,0.0004551064,0.0009245954,0.0005858446,0.0004086038],"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.000506805,0.0007536584,0.001158261,0.0003969598,0.0001202094,0.0001081499,0.0001729002,0.7506158,0.0009862185,0.09188984,0.02312544,0.1301657],"study_design_scores_gemma":[0.00006843842,0.00004178521,0.0001185682,0.0000219176,0.0000183814,0.00002875064,0.00002766555,0.9626446,0.0001908919,0.03545001,0.001379481,0.000009581961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01789724,0.001376816,0.968944,0.001363249,0.0002461319,0.0001605714,0.0003806951,0.0007755502,0.008855871],"genre_scores_gemma":[0.2261381,0.0008939219,0.7583287,0.0007066327,0.0004290048,0.0005590149,0.001209413,0.0005649235,0.01117033],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01291156,"threshold_uncertainty_score":0.04319346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051064851","doi":"10.1007/s00453-007-9146-y","title":"Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Victoria; University of Waterloo","funders":"","keywords":"Algorithm; Theory of computation; Packing problems; Time complexity; Matching (statistics); Mathematics; Exponent; Dynamic programming; Set (abstract data type); Approximation algorithm; Combinatorics; Computer science; Mathematical optimization","authors":[{"name":"Michael R. Fellows","is_ca":false},{"name":"Christian Knauer","is_ca":false},{"name":"Nobuya Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Frances Rosamond","is_ca":false},{"name":"Ulrike Stege","is_ca":true},{"name":"Dimitrios M. Thilikos","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01963313073124341,"gpt":0.2472852207945475,"spread":0.2276520900633041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00431656,0.003994491,0.003823163,0.003024165,0.001907723,0.006894243,0.006671759,0.004437863,0.03506356],"category_scores_gemma":[0.02836553,0.001862036,0.003864467,0.007222811,0.001979463,0.01524318,0.004304026,0.008355937,0.007668796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00483195,"about_ca_system_score_gemma":0.004770651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00689249,"about_ca_topic_score_gemma":0.01007202,"domain_scores_codex":[0.9948795,0.001520869,0.0002490019,0.001220965,0.001381027,0.0007485742],"domain_scores_gemma":[0.9854516,0.008762059,0.0007048466,0.003967794,0.000733223,0.0003803408],"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.001818924,0.001306659,0.00137331,0.001136662,0.000298394,0.0001850281,0.0004690682,0.2661395,0.004417473,0.181057,0.06779418,0.4740038],"study_design_scores_gemma":[0.0005814257,0.000121071,0.0004205346,0.00009680232,0.0001340883,0.0001522207,0.0001337824,0.6659329,0.002152475,0.3168581,0.01337016,0.00004651221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02181289,0.00262125,0.9434234,0.002037177,0.0004944394,0.0003925566,0.0008931168,0.004909647,0.02341549],"genre_scores_gemma":[0.152934,0.001255056,0.826587,0.000791283,0.0005312507,0.0009856658,0.002961542,0.002248863,0.01170542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03506356,"threshold_uncertainty_score":0.1172993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025130628","doi":"10.1007/s00453-001-0027-5","title":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Shortest path problem; Combinatorics; Dijkstra's algorithm; Mathematics; Regular polygon; Bounded function; Theory of computation; Context (archaeology); Domain (mathematical analysis); Euclidean shortest path; Computational geometry; Face (sociological concept); Discrete mathematics; K shortest path routing; Graph; Algorithm; Geometry","authors":[{"name":"Mark Lanthier","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01470809025050108,"gpt":0.2418008765560288,"spread":0.2270927863055277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009786889,0.001297727,0.001522243,0.00234676,0.0005548915,0.001428924,0.002264473,0.001498418,0.003810996],"category_scores_gemma":[0.00845504,0.001167599,0.00087349,0.002318639,0.001220763,0.002512687,0.002684996,0.001740732,0.000605507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222643,"about_ca_system_score_gemma":0.0006037197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00340938,"about_ca_topic_score_gemma":0.004417602,"domain_scores_codex":[0.9991732,0.0002259294,0.00004598249,0.0001449886,0.0003331975,0.00007671124],"domain_scores_gemma":[0.9973772,0.001802709,0.0001838333,0.0002296628,0.0002762574,0.0001303428],"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.0001928167,0.00007483859,0.0008456463,0.0001816019,0.0000470913,0.00008336914,0.0001551646,0.8583431,0.003026154,0.0640232,0.001927938,0.07109897],"study_design_scores_gemma":[0.00001251496,0.00002507787,0.00007640659,0.00001162081,0.000006438797,0.00001748987,0.00002962861,0.9541941,0.0006074852,0.04432814,0.0006868483,0.000004250642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09763142,0.0003074222,0.8983423,0.0001408929,0.00005973483,0.00008650625,0.0001671436,0.000397667,0.002866989],"genre_scores_gemma":[0.4373332,0.0005905274,0.5538583,0.00006372644,0.00004662112,0.0002995261,0.000744506,0.0004661541,0.006597454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003810996,"threshold_uncertainty_score":0.01274908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991075883","doi":"10.1007/s00453-007-0057-8","title":"Quantum Complexity of Testing Group Commutativity","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Mathematics; Group testing; Commutative property; Randomized algorithm; Group (periodic table); Reduction (mathematics); Combinatorics; Discrete mathematics; Upper and lower bounds; Computational complexity theory; Quantization (signal processing); Quantum; Omega; Algorithm; Quantum mechanics","authors":[{"name":"Frédéric Magniez","is_ca":false},{"name":"Ashwin Nayak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04042840860709629,"gpt":0.2731064296135665,"spread":0.2326780210064702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005626278,0.0006274445,0.00196977,0.00157145,0.002921748,0.00600312,0.002991832,0.002898189,0.01328507],"category_scores_gemma":[0.03474037,0.0007015367,0.001733191,0.002119021,0.009432008,0.01682591,0.004833236,0.005337669,0.0007096674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003476086,"about_ca_system_score_gemma":0.003172453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002697096,"about_ca_topic_score_gemma":0.001755479,"domain_scores_codex":[0.9927349,0.002816214,0.0003464357,0.001033582,0.002078737,0.0009902564],"domain_scores_gemma":[0.94008,0.04934432,0.001564381,0.005074212,0.002595472,0.00134162],"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.0001144161,0.00005917321,0.0007870166,0.00005817254,0.00002068442,0.00005407807,0.000290435,0.003799878,0.0003359967,0.9885514,0.001367708,0.004560967],"study_design_scores_gemma":[0.00002274202,0.000008531488,0.0001558047,0.000005907268,0.000006591554,0.00001632434,0.00004328517,0.008472083,0.0002287145,0.9907472,0.0002855846,0.000007225901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6768906,0.0009162434,0.2160529,0.01884946,0.0004592467,0.0002315752,0.001098711,0.0005136602,0.08498756],"genre_scores_gemma":[0.9820472,0.0002272932,0.01250801,0.0005219923,0.0003853466,0.0001447631,0.0003880421,0.00007365538,0.003703546],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01328507,"threshold_uncertainty_score":0.04444301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964276725","doi":"10.1007/s00453-011-9526-1","title":"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Theory of computation; Facility location problem; Mathematics; Linear programming relaxation; Relaxation (psychology); Dual (grammatical number); Exponential function; Integer (computer science); Algorithm; Mathematical optimization; Function (biology); Combinatorics; Linear programming; Computer science","authors":[{"name":"Donglei Du","is_ca":true},{"name":"Ruixing Lu","is_ca":false},{"name":"Dachuan Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03518398958303515,"gpt":0.2237815915891898,"spread":0.1885976020061547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002798096,0.001656508,0.00269721,0.00124213,0.0009873605,0.002807825,0.003524708,0.002917884,0.008012298],"category_scores_gemma":[0.007507813,0.001140207,0.001183047,0.002657377,0.001129129,0.003304576,0.002973414,0.004779473,0.001639008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002373026,"about_ca_system_score_gemma":0.003985759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003695986,"about_ca_topic_score_gemma":0.004459228,"domain_scores_codex":[0.9984675,0.0005770791,0.00005873136,0.0003095874,0.0003497344,0.0002374615],"domain_scores_gemma":[0.9973424,0.001602563,0.000163046,0.0003429337,0.000292636,0.0002565054],"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.0007220819,0.0009058387,0.001050602,0.0003675833,0.0001226507,0.0001234084,0.0001422786,0.650927,0.002092942,0.1024028,0.0264235,0.2147193],"study_design_scores_gemma":[0.0001090454,0.00004611176,0.00008149178,0.00001582618,0.00001610319,0.00004840787,0.00002087317,0.9644903,0.0003242787,0.03342186,0.001415847,0.000009939145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01096566,0.0004371279,0.9819738,0.0007906586,0.0001527577,0.0001200943,0.000222657,0.0005333176,0.00480398],"genre_scores_gemma":[0.1466265,0.0003738645,0.8456627,0.0003397084,0.0002035779,0.0003878764,0.0006300946,0.0002798577,0.005495918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008012298,"threshold_uncertainty_score":0.02680379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2922321031","doi":"10.1007/s00453-007-9151-1","title":"On the Parameterized Complexity of Layered Graph Drawing","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Combinatorics; Parameterized complexity; Pathwidth; Mathematics; Graph drawing; Theory of computation; Bounded function; Crossing number (knot theory); Graph; Time complexity; Span (engineering); Discrete mathematics; Line graph; Algorithm","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Michael R. Fellows","is_ca":false},{"name":"Matthew Kitching","is_ca":true},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Catherine McCartin","is_ca":false},{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Frances Rosamond","is_ca":false},{"name":"Sue Whitesides","is_ca":true},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04315325250689598,"gpt":0.271161155714278,"spread":0.228007903207382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003029772,0.001362853,0.002243217,0.00201307,0.001865592,0.006866141,0.005054753,0.002658034,0.0220753],"category_scores_gemma":[0.03906356,0.00147736,0.002248056,0.004478225,0.003400094,0.01875035,0.006031032,0.005773583,0.002101392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004308614,"about_ca_system_score_gemma":0.002428393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005764497,"about_ca_topic_score_gemma":0.00685404,"domain_scores_codex":[0.9959106,0.001468391,0.0002423565,0.0006630709,0.001281324,0.0004342079],"domain_scores_gemma":[0.9593671,0.03144258,0.001680024,0.005222162,0.001330067,0.0009580845],"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.0005675204,0.0002285264,0.003959327,0.0005154978,0.0001381484,0.0002163054,0.0006643991,0.2736784,0.003350764,0.6001336,0.01679453,0.09975305],"study_design_scores_gemma":[0.0000557678,0.00003025491,0.0004699795,0.00002987946,0.00004248878,0.00007868406,0.00009336249,0.4549308,0.0008238194,0.5404222,0.003001549,0.00002124493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1376696,0.001800895,0.8155966,0.005432308,0.000267098,0.0001997584,0.001584313,0.002105918,0.03534354],"genre_scores_gemma":[0.686157,0.002194277,0.2879673,0.0006789003,0.0004659139,0.00043024,0.00371315,0.001656361,0.01673683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0220753,"threshold_uncertainty_score":0.0738492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601856531","doi":"10.1007/s00453-002-0986-1","title":"TSP Heuristics: Domination Analysis and Complexity","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Travelling salesman problem; Mathematics; Heuristics; Digraph; Heuristic; Theory of computation; Time complexity; Constant (computer programming); Discrete mathematics; Graph; Mathematical optimization; Algorithm; Computer science","authors":[{"name":"Punnen","is_ca":true},{"name":"Margot","is_ca":false},{"name":"Kabadi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02925142421986513,"gpt":0.2506017387149126,"spread":0.2213503144950475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00341419,0.001170654,0.001528019,0.002822939,0.001328041,0.003997883,0.002146292,0.001994829,0.007341682],"category_scores_gemma":[0.02223738,0.00100476,0.001306462,0.004558725,0.002852241,0.007335486,0.001616731,0.003590696,0.0005366036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004260925,"about_ca_system_score_gemma":0.002363321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006740001,"about_ca_topic_score_gemma":0.007844958,"domain_scores_codex":[0.9980012,0.0008909208,0.000053347,0.0002035256,0.0006455988,0.0002054427],"domain_scores_gemma":[0.9819953,0.01572944,0.0005562911,0.0007177797,0.0007911029,0.0002100677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001597548,0.0001863782,0.001525928,0.0003696778,0.0001073796,0.00007841202,0.00033998,0.4331452,0.0007275761,0.468238,0.01466145,0.08046036],"study_design_scores_gemma":[0.00002944624,0.00002430549,0.0005347524,0.00004999191,0.00003599656,0.00006015884,0.00006990751,0.6414059,0.0002893598,0.353767,0.003716671,0.0000163672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06623892,0.01839283,0.8574783,0.00501128,0.000296959,0.0001703615,0.0004585147,0.0003867912,0.05156603],"genre_scores_gemma":[0.7752115,0.01461321,0.1854819,0.0006168673,0.001389439,0.000409844,0.0006955166,0.0004235981,0.02115822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007341682,"threshold_uncertainty_score":0.03091532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012042319","doi":"10.1007/s00453-001-0109-4","title":"Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Algorithm; Binary logarithm; Parallel computing; Parallel algorithm; Theory of computation; Overhead (engineering); Spanning tree; Computation; Tree (set theory); Combinatorics; Mathematics","authors":[{"name":"F. Dehne","is_ca":true},{"name":"Alexandre Ferreira","is_ca":false},{"name":"Edwin Mescco Cáceres","is_ca":false},{"name":"S. W. Song","is_ca":false},{"name":"Alessandro Roncato","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0279442320030997,"gpt":0.2374121101943307,"spread":0.209467878191231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000706478,0.0008701195,0.001039292,0.001051208,0.001262601,0.001424042,0.001577822,0.001013726,0.006469944],"category_scores_gemma":[0.004013376,0.0005830022,0.0006170845,0.002031167,0.0009878281,0.002553087,0.001538056,0.001408241,0.001023421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00149391,"about_ca_system_score_gemma":0.002354826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01440484,"about_ca_topic_score_gemma":0.03113026,"domain_scores_codex":[0.999447,0.0001642249,0.00002645837,0.0001102493,0.0001503183,0.0001016667],"domain_scores_gemma":[0.9986522,0.000635706,0.0001043712,0.0003431552,0.0001796074,0.00008491371],"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.0002049144,0.000114006,0.0008088294,0.0002058795,0.00004839848,0.00007586534,0.0001192641,0.7453462,0.003649169,0.07354121,0.0112732,0.164613],"study_design_scores_gemma":[0.00002969889,0.00001730978,0.0001721753,0.000006202257,0.00001030504,0.00001702732,0.0000325341,0.9178963,0.0008435672,0.07853391,0.002435074,0.000005978582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.064417,0.000844715,0.9191627,0.001170077,0.0001606093,0.0001661405,0.0002572788,0.00269092,0.01113058],"genre_scores_gemma":[0.340504,0.000582148,0.647675,0.0002162747,0.00009168343,0.0002300635,0.0006417081,0.000390181,0.009668946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01440484,"threshold_uncertainty_score":0.028642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145866065","doi":"10.1007/s00453-012-9740-5","title":"Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Cover (algebra); Bounded function; Tree (set theory); Approximation algorithm; Theory of computation; Upper and lower bounds; Discrete mathematics; Graph; Algorithm","authors":[{"name":"Mohammad Reza Khani","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02354457203300562,"gpt":0.239021698037697,"spread":0.2154771260046914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004585013,0.002361436,0.003174567,0.002699788,0.001450919,0.004744292,0.006672211,0.002882036,0.01017104],"category_scores_gemma":[0.02402459,0.001274258,0.002624993,0.005479043,0.001795481,0.01172498,0.004441814,0.00648113,0.001720759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005555797,"about_ca_system_score_gemma":0.003373533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005012253,"about_ca_topic_score_gemma":0.008408488,"domain_scores_codex":[0.9956683,0.001361877,0.0002021009,0.0007279631,0.001346636,0.0006930279],"domain_scores_gemma":[0.9849182,0.01053705,0.0007925817,0.002273247,0.000882919,0.0005961409],"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.002171026,0.0009802533,0.003203803,0.0009125551,0.0002526304,0.0001411246,0.0005599051,0.4057687,0.003697057,0.1963114,0.0360065,0.3499952],"study_design_scores_gemma":[0.0001431957,0.00007676089,0.0004688656,0.00004430264,0.00009739319,0.0001050536,0.00006870631,0.8628972,0.001035167,0.1315625,0.003479321,0.0000216565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05919836,0.004702439,0.9138435,0.00292172,0.0004310739,0.0002427183,0.0009970166,0.001721357,0.01594185],"genre_scores_gemma":[0.3678501,0.002386152,0.6123803,0.0008549765,0.001009415,0.0006043062,0.002850003,0.0009654165,0.01109945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01017104,"threshold_uncertainty_score":0.04031026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973228454","doi":"10.1007/s00453-012-9726-3","title":"Efficient Fully-Compressed Sequence Representations","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Disjoint sets; Substring; Mathematics; Amortized analysis; Redundancy (engineering); Data structure; Binary logarithm; Compressed suffix array; Subsequence; Algorithm; Sequence (biology); Discrete mathematics; Suffix tree; Computer science","authors":[{"name":"Jérémy Barbay","is_ca":false},{"name":"Francisco Claude","is_ca":true},{"name":"Travis Gagie","is_ca":false},{"name":"Gonzalo Navarro","is_ca":false},{"name":"Yakov Nekrich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03079680232543067,"gpt":0.2926913199302248,"spread":0.2618945176047941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007037903,0.001180836,0.001017344,0.001543336,0.0004400545,0.001743359,0.001374427,0.001556383,0.005755917],"category_scores_gemma":[0.006186249,0.0004831679,0.0005678613,0.002397514,0.0007018791,0.003609467,0.002130844,0.001674044,0.002328351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004397981,"about_ca_system_score_gemma":0.001287453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009015275,"about_ca_topic_score_gemma":0.001422793,"domain_scores_codex":[0.9987448,0.000250496,0.0000989518,0.0001998757,0.0005754146,0.0001304006],"domain_scores_gemma":[0.9975072,0.0009110777,0.0001396024,0.0009139878,0.0004584879,0.00006965807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009083133,0.0002542275,0.0005998759,0.0002755035,0.00006347965,0.000387955,0.0001755752,0.1090471,0.03244301,0.09212741,0.017337,0.7463806],"study_design_scores_gemma":[0.00008401243,0.0001706996,0.0003383961,0.00005765121,0.00003170966,0.0005812052,0.00008781894,0.8715865,0.02488552,0.09434929,0.007790629,0.00003660168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02962774,0.000811587,0.9623908,0.0005845553,0.0003180404,0.00010453,0.001083826,0.001610772,0.003468188],"genre_scores_gemma":[0.2952037,0.001287146,0.6863126,0.0004313586,0.000531397,0.0004100451,0.004614764,0.0003817899,0.01082729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005755917,"threshold_uncertainty_score":0.01925552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1513274608","doi":"10.1007/s00453-016-0159-2","title":"On the Parameterized Complexity of Reconfiguration Problems","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada); University of Waterloo","funders":"","keywords":"Control reconfiguration; Parameterized complexity; Vertex cover; Vertex (graph theory); Combinatorics; Kernelization; Mathematics; Theory of computation; Bounded function; Maximization; Sequence (biology); Discrete mathematics; Graph; Computer science; Algorithm; Mathematical optimization","authors":[{"name":"Amer E. Mouawad","is_ca":false},{"name":"Naomi Nishimura","is_ca":true},{"name":"Venkatesh Raman","is_ca":false},{"name":"Narges Simjour","is_ca":true},{"name":"Akira Suzuki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06819916082681735,"gpt":0.2874308113952869,"spread":0.2192316505684695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003651241,0.002331818,0.002752648,0.002275984,0.002348251,0.007620481,0.004980233,0.003657276,0.02512071],"category_scores_gemma":[0.04089291,0.00147116,0.002870978,0.004893979,0.004853346,0.02196125,0.005045634,0.009684091,0.001906313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005620447,"about_ca_system_score_gemma":0.003222964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003902574,"about_ca_topic_score_gemma":0.00413229,"domain_scores_codex":[0.9947646,0.002008526,0.0002478223,0.00101027,0.001082753,0.0008859193],"domain_scores_gemma":[0.9452959,0.04646668,0.002047139,0.003619308,0.001182383,0.001388617],"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.0007482647,0.0005016816,0.00365173,0.000771584,0.0002100572,0.0002683564,0.0006505179,0.1918925,0.002144558,0.7103118,0.02504109,0.06380782],"study_design_scores_gemma":[0.0001150484,0.00004306936,0.0006189328,0.00004901499,0.00005788307,0.00009144011,0.0001323051,0.1500765,0.0003646504,0.8453943,0.003032897,0.0000240547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3148108,0.006533857,0.5192821,0.02770914,0.0008843159,0.0004646464,0.003372759,0.001665029,0.1252773],"genre_scores_gemma":[0.8519376,0.004923156,0.1086122,0.001948451,0.001673054,0.0007751768,0.004767883,0.001327132,0.02403528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02512071,"threshold_uncertainty_score":0.08403713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039786295","doi":"10.1007/s00453-007-9018-5","title":"Stackelberg Strategies for Selfish Routing in General Multicommodity Networks","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Price of anarchy; Stackelberg competition; Routing (electronic design automation); Computer science; Latency (audio); Nash equilibrium; Theory of computation; Mathematical optimization; Upper and lower bounds; Price of stability; Mathematical economics; Mathematics; Topology (electrical circuits); Computer network; Combinatorics; Economics; Telecommunications","authors":[{"name":"George Karakostas","is_ca":true},{"name":"Stavros G. Kolliopoulos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08005567828149378,"gpt":0.4028447996557781,"spread":0.3227891213742843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002852979,0.001131344,0.001505187,0.001259322,0.001335068,0.003682067,0.002264331,0.002456762,0.003062537],"category_scores_gemma":[0.009684191,0.0007763226,0.001105642,0.001312202,0.002395155,0.005829185,0.001715215,0.001742856,0.000274242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002630077,"about_ca_system_score_gemma":0.001835438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00203829,"about_ca_topic_score_gemma":0.00197228,"domain_scores_codex":[0.9988534,0.0005144851,0.00005757925,0.0001536687,0.0001954075,0.0002253601],"domain_scores_gemma":[0.9956254,0.003073602,0.0004988391,0.000204831,0.0002934362,0.0003039593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000119606,0.00008677547,0.0004742031,0.0001179391,0.00008144093,0.0001197724,0.0003027023,0.18952,0.001250143,0.7943216,0.001842523,0.01176326],"study_design_scores_gemma":[0.00003247549,0.00003140991,0.0001021623,0.00001363815,0.00002241581,0.0000423261,0.00006061986,0.3629117,0.0002986451,0.635686,0.0007821497,0.00001645519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2408903,0.0008692606,0.7328944,0.001865654,0.00008873131,0.0002006425,0.0001592532,0.0001574174,0.02287423],"genre_scores_gemma":[0.933095,0.0008325582,0.05530076,0.0001969128,0.00009532895,0.0002825937,0.00009522619,0.00004978523,0.01005181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003682067,"threshold_uncertainty_score":0.01908261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130428886","doi":"10.1007/s00453-014-9955-8","title":"Online Bin Packing with Advice","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Advice (programming); Bin; Computer science; Theory of computation; Combinatorics; Mathematics; Algorithm; Programming language","authors":[{"name":"Joan Boyar","is_ca":false},{"name":"Shahin Kamali","is_ca":true},{"name":"Kim S. Larsen","is_ca":false},{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005320935873254548,"gpt":0.1880935076917519,"spread":0.1827725718184973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009562926,0.001198641,0.001302654,0.0009378855,0.0009963134,0.001854823,0.001907837,0.001744007,0.0326816],"category_scores_gemma":[0.01061781,0.0007354887,0.0009548086,0.001921779,0.0007002114,0.003435147,0.002600266,0.00308063,0.01002038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009921975,"about_ca_system_score_gemma":0.001742303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00244242,"about_ca_topic_score_gemma":0.006074061,"domain_scores_codex":[0.9983953,0.0003144459,0.0000818844,0.0002954442,0.000659689,0.0002532557],"domain_scores_gemma":[0.9962923,0.001494778,0.0001232112,0.00150051,0.0004298497,0.0001593772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001397725,0.0006771549,0.002109509,0.0005044198,0.00007917389,0.0002783574,0.0002141958,0.08560727,0.007437323,0.07208458,0.1083243,0.7212861],"study_design_scores_gemma":[0.0001710023,0.00009223739,0.0004993852,0.00006902381,0.00005160271,0.000215496,0.0000548288,0.7184554,0.006802801,0.2448768,0.02868629,0.0000250986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05011604,0.001136883,0.8604538,0.002716277,0.0008280771,0.0002321874,0.001710075,0.0176458,0.06516082],"genre_scores_gemma":[0.3140603,0.0005543166,0.6368095,0.0007307028,0.0004289092,0.0002405814,0.002626199,0.002286387,0.04226298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0326816,"threshold_uncertainty_score":0.1093309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982770663","doi":"10.1007/s00453-001-0045-3","title":"Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Simple polygon; Polygon (computer graphics); Mathematics; Binary logarithm; Upper and lower bounds; Theory of computation; Discrete mathematics; Regular polygon; Computer science; Algorithm; Geometry","authors":[{"name":"Masafumi Yamashita","is_ca":false},{"name":"Hideki Umemoto","is_ca":false},{"name":"Ippei Suzuki","is_ca":false},{"name":"Tsunehiko Kameda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02022339629068802,"gpt":0.2853277463373065,"spread":0.2651043500466184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009338804,0.0009333996,0.001355989,0.001324585,0.001785778,0.001210929,0.002891959,0.002470548,0.002199347],"category_scores_gemma":[0.004151955,0.0008474458,0.001210382,0.001382855,0.001476094,0.002623471,0.003028654,0.0009346277,0.0004622448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003530293,"about_ca_system_score_gemma":0.0007849195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002256289,"about_ca_topic_score_gemma":0.001708383,"domain_scores_codex":[0.9994742,0.0001122165,0.00003044003,0.0001667864,0.0001218097,0.00009468409],"domain_scores_gemma":[0.9986658,0.0006418574,0.0002758977,0.0001419639,0.0001226563,0.0001519618],"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.001161779,0.0004740965,0.01228414,0.0002952411,0.0003236682,0.001156703,0.001536162,0.8227697,0.01940117,0.02131594,0.001822448,0.117459],"study_design_scores_gemma":[0.00008950149,0.0003516837,0.0009232317,0.0000189628,0.00008358144,0.0001840631,0.0005194035,0.9820963,0.002994229,0.01127852,0.001439166,0.00002126202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2857043,0.0001690553,0.7107718,0.000397866,0.00003570462,0.0001739212,0.00003869989,0.0002605334,0.002448072],"genre_scores_gemma":[0.6757458,0.0001988473,0.3190446,0.0000937535,0.000061182,0.0003315644,0.0001788676,0.0000455366,0.004299813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002891959,"threshold_uncertainty_score":0.007357538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982250524","doi":"10.1007/s00453-006-0112-x","title":"Large Deviations for the Weighted Height of an Extended Class of Trees","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Binary search tree; Class (philosophy); Weight-balanced tree; Intersection (aeronautics); Constant (computer programming); Theory of computation; Binary tree; Tree (set theory); Random binary tree; Limit (mathematics); Plane (geometry); Discrete mathematics; Large deviations theory; Statistics; Algorithm; Geometry; Mathematical analysis; Computer science","authors":[{"name":"Nicolas Broutin","is_ca":true},{"name":"Luc Devroye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0104976520595896,"gpt":0.2452400137144779,"spread":0.2347423616548883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00728017,0.001050415,0.001878223,0.003218485,0.001818083,0.003966077,0.004172118,0.002879581,0.006606199],"category_scores_gemma":[0.04630668,0.0008404416,0.001361847,0.002413581,0.005446051,0.008567233,0.004159292,0.00637178,0.0007086961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002229887,"about_ca_system_score_gemma":0.001141798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001318808,"about_ca_topic_score_gemma":0.001732117,"domain_scores_codex":[0.9975504,0.0007863,0.00009474395,0.0005223798,0.0006903858,0.0003556415],"domain_scores_gemma":[0.9596056,0.02976904,0.002570557,0.002978931,0.002008091,0.003067877],"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.0001107221,0.00005328903,0.002318203,0.00009173564,0.00006954078,0.0001031364,0.0002242095,0.03167863,0.001284471,0.9528452,0.002948905,0.008272006],"study_design_scores_gemma":[0.00003147517,0.00002649171,0.0008594975,0.0000257885,0.00001983714,0.000100484,0.00005772344,0.1672105,0.0003060074,0.8304777,0.0008583077,0.00002614981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4565242,0.002545352,0.5160569,0.005524198,0.0004931234,0.00006730059,0.0007430605,0.0006729439,0.0173729],"genre_scores_gemma":[0.92063,0.001623422,0.06415915,0.0008685985,0.001141051,0.0002666122,0.0009426367,0.0004329421,0.009935651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00728017,"threshold_uncertainty_score":0.03850168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051671786","doi":"10.1007/s00453-012-9664-0","title":"A Uniform Paradigm to Succinctly Encode Various Families of Trees","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"ENCODE; Computer science; Theory of computation; Combinatorics; Weight-balanced tree; Theoretical computer science; Mathematics; Set (abstract data type); Encoding (memory); Tree (set theory); Node (physics); Discrete mathematics; Algorithm; Binary tree; Artificial intelligence; Binary search tree","authors":[{"name":"Arash Farzan","is_ca":false},{"name":"J. Ian Munro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01263315840486076,"gpt":0.2454722923001212,"spread":0.2328391338952605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00262214,0.0006580856,0.000669862,0.001741058,0.001513708,0.003610938,0.002506654,0.001554701,0.006094216],"category_scores_gemma":[0.01103849,0.000630903,0.001108058,0.002867509,0.002434594,0.0121867,0.005069341,0.004964617,0.001943149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001258699,"about_ca_system_score_gemma":0.001427198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000476021,"about_ca_topic_score_gemma":0.000978008,"domain_scores_codex":[0.9974979,0.0007214639,0.0003152967,0.0004633089,0.0007964437,0.0002055439],"domain_scores_gemma":[0.9930558,0.001889348,0.0002364084,0.00354517,0.00106549,0.0002078853],"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.00009975905,0.00006374516,0.0001631123,0.0001037155,0.00001268301,0.00005782136,0.0001975099,0.00451955,0.004892642,0.8998586,0.006242144,0.08378867],"study_design_scores_gemma":[0.00003915937,0.00008888903,0.00009818001,0.0001290114,0.00004118574,0.0003060009,0.0001334442,0.05232281,0.0113499,0.8957929,0.03966265,0.00003586061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007867626,0.0004014516,0.9831685,0.001039471,0.0002438006,0.0001130599,0.0003667966,0.0005955286,0.006203713],"genre_scores_gemma":[0.1406565,0.001155138,0.843537,0.001591903,0.0003731883,0.0006716186,0.00145936,0.0007811357,0.009774259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006094216,"threshold_uncertainty_score":0.02038717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043985142","doi":"10.1007/s00453-009-9349-5","title":"Approximability of Packing Disjoint Cycles","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Theory of computation; Combinatorics; Packing problems; Set packing; Computer science; Mathematics; Algorithm; Set (abstract data type)","authors":[{"name":"Zachary Friggstad","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007440738904930359,"gpt":0.2074974811256264,"spread":0.2000567422206961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955848,0.001594255,0.002274807,0.001719132,0.001443524,0.005054094,0.00395829,0.002311531,0.01194237],"category_scores_gemma":[0.0218774,0.00135523,0.00253298,0.003483576,0.002646001,0.009107812,0.003638473,0.004384355,0.0008073232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00282625,"about_ca_system_score_gemma":0.001404751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004137458,"about_ca_topic_score_gemma":0.003899548,"domain_scores_codex":[0.9977909,0.0006456506,0.0001260078,0.0004996682,0.0005724955,0.0003653082],"domain_scores_gemma":[0.9883929,0.008762493,0.0005790044,0.001425863,0.0004016543,0.0004380549],"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.00103861,0.0004422201,0.003739222,0.0007373143,0.0002379084,0.0003038124,0.0009657362,0.3771325,0.002833911,0.4941235,0.01192105,0.1065242],"study_design_scores_gemma":[0.00009205819,0.00005835102,0.0004490659,0.00005820362,0.00008512707,0.0001647648,0.0001351699,0.3776829,0.00123889,0.6168318,0.003185448,0.00001810554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.398469,0.002870517,0.5535089,0.002598879,0.0002324161,0.0001889396,0.0009212689,0.001105862,0.04010415],"genre_scores_gemma":[0.8380339,0.001634519,0.1434086,0.0003936584,0.0002916126,0.0002672269,0.001946054,0.0005875509,0.01343702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01194237,"threshold_uncertainty_score":0.03995115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142094448","doi":"10.1007/s00453-009-9311-6","title":"Stochastic Models for Budget Optimization in Search-Based Advertising","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Theory of computation; Probabilistic logic; Stochastic optimization; Mathematical optimization; Simple (philosophy); Budget constraint; Online advertising; Prefix; The Internet; Operations research; Mathematics; Algorithm; Economics; World Wide Web; Artificial intelligence","authors":[{"name":"S. Muthukrishnan","is_ca":false},{"name":"Martin Pál","is_ca":false},{"name":"Zoya Svitkina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02191355678618553,"gpt":0.2746936839958445,"spread":0.252780127209659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008679903,0.002354647,0.0048352,0.002417187,0.001345737,0.005870006,0.004310869,0.005615117,0.0114188],"category_scores_gemma":[0.04111182,0.003253408,0.00245367,0.003449525,0.003943408,0.007427329,0.00258332,0.006468094,0.001194165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006310811,"about_ca_system_score_gemma":0.003005364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01269867,"about_ca_topic_score_gemma":0.01158927,"domain_scores_codex":[0.9954345,0.002788119,0.0001952627,0.0004806846,0.0005961591,0.0005053724],"domain_scores_gemma":[0.9784399,0.01824012,0.001354486,0.000584255,0.0008106442,0.0005706581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006865385,0.00006580331,0.0003749043,0.000130303,0.00007150631,0.0000534407,0.00009915575,0.4168427,0.0001597818,0.5731094,0.003777923,0.005246485],"study_design_scores_gemma":[0.00003819724,0.00001720481,0.0001379369,0.00002833475,0.00003150084,0.00002061593,0.00002439269,0.7460415,0.00004488266,0.2523097,0.001282379,0.00002346968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02598305,0.005725916,0.9444538,0.006508125,0.0003830166,0.0001559685,0.0006503812,0.0002701698,0.01586962],"genre_scores_gemma":[0.7961712,0.01103712,0.1285183,0.001332527,0.00141708,0.001137143,0.00108303,0.0004554442,0.05884806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01269867,"threshold_uncertainty_score":0.04590422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023293538","doi":"10.1007/s00453-005-1185-7","title":"Book Embeddability of Series–Parallel Digraphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Embedding; Series (stratigraphy); Transitive relation; Discrete mathematics; Monotonic function; Set (abstract data type); Point (geometry); Computer science; Geometry","authors":[{"name":"Emilio Di Giacomo","is_ca":false},{"name":"Walter Didimo","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Stephen Wismath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00755424390658528,"gpt":0.2535625659565984,"spread":0.2460083220500131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000860575,0.0003477736,0.0003456407,0.0006673618,0.0006863023,0.001223612,0.0004060825,0.000313458,0.02890094],"category_scores_gemma":[0.0007968392,0.0003328025,0.0003752255,0.001403506,0.0004318906,0.001915338,0.0005082077,0.001247497,0.0029882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000624748,"about_ca_system_score_gemma":0.0002397655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005499875,"about_ca_topic_score_gemma":0.001040071,"domain_scores_codex":[0.9998832,0.00001340872,0.000004903643,0.00004783803,0.00003822877,0.00001245324],"domain_scores_gemma":[0.9995986,0.0001785152,0.00002981892,0.00007923265,0.00005941172,0.00005450527],"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.0001185189,0.00006840807,0.0004500341,0.0002647839,0.00004123126,0.0002856952,0.0003159399,0.007617839,0.006977395,0.8299655,0.05662583,0.09726883],"study_design_scores_gemma":[0.00002749104,0.00005581067,0.0007275826,0.00004589355,0.00004483829,0.0003496674,0.0001274059,0.007989347,0.00401897,0.8185579,0.1680387,0.00001633035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1621358,0.003985854,0.1714018,0.003436632,0.003410794,0.00006142486,0.001392174,0.00141774,0.6527579],"genre_scores_gemma":[0.5520125,0.003025445,0.0320225,0.0006042027,0.001709728,0.00005716323,0.001790953,0.0005797873,0.4081977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02890094,"threshold_uncertainty_score":0.09668332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070346129","doi":"10.1007/s00453-010-9452-7","title":"Succinct Representation of Labeled Graphs","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Computer science; Planar graph; Adjacency list; Representation (politics); Graph; Pathwidth; Mathematics; Discrete mathematics; Theoretical computer science; Line graph","authors":[{"name":"Jérémy Barbay","is_ca":false},{"name":"Luca Castelli Aleardi","is_ca":false},{"name":"Meng He","is_ca":true},{"name":"J. Ian Munro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009785539630708481,"gpt":0.2580985784941446,"spread":0.2483130388634361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009174896,0.0008457478,0.0008351806,0.002163343,0.0006793325,0.003027321,0.002203135,0.001329137,0.00719884],"category_scores_gemma":[0.008896463,0.0005628738,0.0006940786,0.00377536,0.0009555471,0.005685325,0.00214974,0.002406841,0.002035134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001280068,"about_ca_system_score_gemma":0.001525391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00174609,"about_ca_topic_score_gemma":0.003382682,"domain_scores_codex":[0.9983295,0.0004912372,0.0001321144,0.0003072403,0.0005843015,0.0001556825],"domain_scores_gemma":[0.9935703,0.00253804,0.0004241604,0.00230619,0.0009895121,0.0001717874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007452987,0.0003060485,0.001046889,0.0005134646,0.00005883208,0.000326617,0.000558023,0.1653117,0.007968898,0.4376155,0.03056665,0.354982],"study_design_scores_gemma":[0.00005455062,0.00004742813,0.0001812385,0.00009057124,0.0000309268,0.0001457451,0.0001103926,0.348316,0.005570803,0.6343234,0.01110629,0.00002265117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0304439,0.0004744034,0.9546358,0.001292322,0.000159201,0.0001510134,0.004289025,0.002243592,0.006310683],"genre_scores_gemma":[0.3519621,0.001006164,0.6189424,0.0005949203,0.000214165,0.000555538,0.01581758,0.0009505145,0.009956549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00719884,"threshold_uncertainty_score":0.02408254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1592802262","doi":"10.1007/s00453-005-1181-y","title":"A Fixed-Parameter Approach to 2-Layer Planarization","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University; McGill University","funders":"","keywords":"Chemical-mechanical planarization; Bipartite graph; Mathematics; Time complexity; Combinatorics; Permutation (music); Theory of computation; Graph; Layer (electronics); Line graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science; Physics; Materials science","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Michael R. Fellows","is_ca":false},{"name":"Michael Hallett","is_ca":true},{"name":"Matthew Kitching","is_ca":true},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Catherine McCartin","is_ca":false},{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Frances Rosamond","is_ca":false},{"name":"Matthew Suderman","is_ca":true},{"name":"Sue Whitesides","is_ca":true},{"name":"David R. Wood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01268942985563965,"gpt":0.2240374547533742,"spread":0.2113480248977345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005694151,0.0007938672,0.0008280259,0.00121261,0.0007763552,0.001579175,0.003401885,0.001670766,0.007316418],"category_scores_gemma":[0.002895605,0.0008387487,0.001218468,0.001019244,0.001449192,0.002553931,0.00348696,0.002479762,0.001480509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008362417,"about_ca_system_score_gemma":0.0006146392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001677215,"about_ca_topic_score_gemma":0.001913616,"domain_scores_codex":[0.9995914,0.0001112108,0.00001973341,0.00008283741,0.0001548196,0.0000400259],"domain_scores_gemma":[0.9995462,0.0001407991,0.00003182572,0.0001685717,0.00008710093,0.00002549305],"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.00006385726,0.00004825668,0.0002692429,0.0001335643,0.00004741004,0.0001007564,0.0001733807,0.366147,0.005784603,0.5390204,0.00387423,0.08433735],"study_design_scores_gemma":[0.00001243961,0.0000193276,0.00005817719,0.00001467879,0.00001313951,0.00004398817,0.00002644812,0.8003234,0.001300571,0.1923731,0.005796264,0.00001847107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003602499,0.0001182604,0.9917685,0.00009056803,0.00004063925,0.00002812348,0.00004053969,0.0001754729,0.004135439],"genre_scores_gemma":[0.1799899,0.0005243583,0.807937,0.0001602838,0.00008141478,0.0002271434,0.0002257787,0.0005411119,0.01031303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007316418,"threshold_uncertainty_score":0.02447581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754604279","doi":"10.1007/s00453-017-0373-6","title":"Algorithms for Communication Scheduling in Data Gathering Network with Data Compression","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Ningbo; China Scholarship Council","keywords":"Job shop scheduling; Polynomial-time approximation scheme; Approximation algorithm; Computer science; Data compression; Scheduling (production processes); Mathematical optimization; Time complexity; Dynamic programming; Theory of computation; Wireless sensor network; Base station; Optimization problem; Data transmission; Algorithm; Mathematics; Computer network","authors":[{"name":"Wenchang Luo","is_ca":true},{"name":"Yao Xu","is_ca":true},{"name":"Boyuan Gu","is_ca":true},{"name":"Weitian Tong","is_ca":false},{"name":"Randy Goebel","is_ca":true},{"name":"Guohui Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1896481992940429,"gpt":0.3807958753073195,"spread":0.1911476760132766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00225641,0.001217247,0.001648868,0.001540888,0.001502066,0.001959741,0.002385223,0.001686062,0.00421753],"category_scores_gemma":[0.008411657,0.0007037025,0.0009261139,0.002823146,0.001157469,0.002769157,0.001771465,0.001875954,0.0004309026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002580294,"about_ca_system_score_gemma":0.003700142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006644467,"about_ca_topic_score_gemma":0.005430401,"domain_scores_codex":[0.9991438,0.0002836986,0.00004780494,0.0001592129,0.0001975642,0.0001678424],"domain_scores_gemma":[0.9948631,0.00389395,0.0003267298,0.000350445,0.0003744143,0.0001913625],"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.0001842728,0.0001187612,0.0005472411,0.0001580365,0.00003201106,0.00003296348,0.0001238424,0.8786215,0.0007841712,0.04032959,0.004615804,0.07445181],"study_design_scores_gemma":[0.00002077271,0.00001614414,0.00005770919,0.00000678289,0.000007074626,0.00000994572,0.0000185942,0.9830043,0.0002442125,0.01619889,0.0004120374,0.00000357053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01863513,0.0005705646,0.9760485,0.0005633513,0.0001105517,0.0001492967,0.0001152064,0.0003946444,0.003412727],"genre_scores_gemma":[0.3531828,0.0008220695,0.6391032,0.0002134767,0.000259521,0.0006614588,0.000365961,0.0002593484,0.005132297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006644467,"threshold_uncertainty_score":0.01872146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116643655","doi":"10.1007/s00453-010-9461-6","title":"Shortest Paths in Time-Dependent FIFO Networks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Combinatorics; Disjoint sets; Mathematics; Interval (graph theory); Function (biology); Node (physics); Binary logarithm; Time complexity; Path (computing); Discrete mathematics; Computer science; Graph; Physics","authors":[{"name":"Frank Dehne","is_ca":true},{"name":"Masoud T. Omran","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004630311136895341,"gpt":0.2092553920371225,"spread":0.2046250809002272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003054294,0.0008561947,0.001325695,0.00189664,0.001864626,0.003208422,0.002655723,0.001619091,0.004373976],"category_scores_gemma":[0.01879836,0.0009844027,0.0006256513,0.002659052,0.001897968,0.005587725,0.001974281,0.001741226,0.0003942709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002359508,"about_ca_system_score_gemma":0.002282489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003969797,"about_ca_topic_score_gemma":0.004145592,"domain_scores_codex":[0.9984669,0.0004652761,0.0001199182,0.0002794472,0.0004140926,0.0002543612],"domain_scores_gemma":[0.9877216,0.009853768,0.0009415781,0.0004960632,0.0005822976,0.0004047291],"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.0006371259,0.0001660383,0.001737952,0.0003865797,0.00008351273,0.000142771,0.000382248,0.5099952,0.001591708,0.4130466,0.005359331,0.06647095],"study_design_scores_gemma":[0.0001246186,0.00007532707,0.0002510591,0.00004427077,0.00005291013,0.00007759757,0.0001013724,0.6692885,0.0006081539,0.3261453,0.00320619,0.00002472726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09669831,0.002590111,0.8884054,0.001838233,0.0003043463,0.0002043483,0.0004537077,0.0003740615,0.009131512],"genre_scores_gemma":[0.7386566,0.004052103,0.2357207,0.0003817958,0.0004171107,0.0007076074,0.0009649836,0.0001797867,0.01891931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004373976,"threshold_uncertainty_score":0.01711953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999760725","doi":"10.1007/s00453-004-1121-2","title":"Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Minimum spanning tree; Combinatorics; Spanning tree; Mathematics; Degree (music); k-minimum spanning tree; Bounded function; Gomory–Hu tree; Theory of computation; Steiner tree problem; Approximation algorithm; Shortest-path tree; Discrete mathematics; Graph; Node (physics); Kruskal's algorithm; Undirected graph; Connected dominating set; Algorithm; K-ary tree; Tree structure; Binary tree","authors":[{"name":"Jochen Könemann","is_ca":true},{"name":"Asaf Levin","is_ca":false},{"name":"Amitabh Sinha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04624586313923365,"gpt":0.256247606757736,"spread":0.2100017436185024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387223,0.0009217414,0.001434031,0.0009492036,0.0006431022,0.001605285,0.002076856,0.00198898,0.003343654],"category_scores_gemma":[0.01285773,0.0005401938,0.0006619586,0.001664801,0.0008102807,0.003059224,0.001679361,0.001494982,0.0006331037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302564,"about_ca_system_score_gemma":0.0009975362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002270858,"about_ca_topic_score_gemma":0.003215917,"domain_scores_codex":[0.9991314,0.0003282674,0.00003282604,0.0001834866,0.0002057474,0.0001183379],"domain_scores_gemma":[0.9959413,0.0029461,0.000274065,0.0003148344,0.0003099176,0.000213914],"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.0005126552,0.0001547247,0.002078874,0.0003820682,0.00006816661,0.0001140453,0.000164951,0.8349798,0.003457535,0.06297056,0.01060334,0.08451325],"study_design_scores_gemma":[0.00003637481,0.00003488304,0.0002416959,0.00001747909,0.00001760629,0.00005831223,0.00003643738,0.9512646,0.0005843345,0.04658049,0.001123538,0.000004268547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1824057,0.002455052,0.7973991,0.002755455,0.0002330878,0.00008979918,0.0007501451,0.0005850928,0.01332676],"genre_scores_gemma":[0.7183557,0.00143094,0.2728746,0.0002881809,0.000205196,0.0001377599,0.001136156,0.0002756689,0.005295882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003343654,"threshold_uncertainty_score":0.01118559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023800056","doi":"10.1007/s00453-011-9544-z","title":"Shorthand Universal Cycles for Permutations","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Victoria","funders":"","keywords":"Combinatorics; Substring; Mathematics; Lexicographical order; Permutation (music); Parity of a permutation; Discrete mathematics; Symmetric group; Set (abstract data type); Cyclic permutation; Computer science; Physics","authors":[{"name":"Alexander E. Holroyd","is_ca":false},{"name":"Frank Ruskey","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04240240890345279,"gpt":0.2506469803726523,"spread":0.2082445714691995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007860262,0.001461452,0.0009047898,0.003077824,0.001832073,0.003263144,0.001216591,0.001578155,0.02024472],"category_scores_gemma":[0.004342838,0.0005486829,0.0008714022,0.005858083,0.002525985,0.005087808,0.002488648,0.003127593,0.005498127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009887816,"about_ca_system_score_gemma":0.0008610635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007240346,"about_ca_topic_score_gemma":0.0008206188,"domain_scores_codex":[0.9987816,0.0002948744,0.0001028901,0.0003474937,0.0002491862,0.0002238898],"domain_scores_gemma":[0.9984376,0.0006838921,0.0001367549,0.0004288784,0.0002070482,0.0001057592],"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.00003621745,0.0000151944,0.0001198453,0.0001049209,0.000008913963,0.00008216851,0.0001634811,0.0008896816,0.0008095442,0.9228787,0.01055139,0.06434003],"study_design_scores_gemma":[0.000005961155,0.00001419107,0.00005263312,0.00004290116,0.000008514784,0.0001232317,0.00003859855,0.001899897,0.0007526255,0.9389477,0.0581029,0.00001076983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03576677,0.0164956,0.8166552,0.00364931,0.004672651,0.00025353,0.002094885,0.002400931,0.1180111],"genre_scores_gemma":[0.5354246,0.01182816,0.3303778,0.003471809,0.003438423,0.001293124,0.003719645,0.003317182,0.1071293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02024472,"threshold_uncertainty_score":0.0677253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008126942","doi":"10.1007/s00453-001-0039-1","title":"On-Line Competitive Algorithms for Call Admission in Optical Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Computer science; Logarithm; Network topology; Competitive analysis; Telecommunications network; Line (geometry); Algorithm; Computer network; Mathematics; Upper and lower bounds","authors":[{"name":"Baruch Awerbuch","is_ca":false},{"name":"Yossi Azar","is_ca":false},{"name":"Amos Fiat","is_ca":false},{"name":"Stefano Leonardi","is_ca":false},{"name":"Alon Rosen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03568695878688269,"gpt":0.311284834257148,"spread":0.2755978754702653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006013452,0.002006111,0.003477254,0.001833247,0.002369306,0.005152312,0.006273418,0.004763344,0.0135598],"category_scores_gemma":[0.03122453,0.001192543,0.001092988,0.003341496,0.00312435,0.005968346,0.003689088,0.004492057,0.001423825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003949205,"about_ca_system_score_gemma":0.003827746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007513229,"about_ca_topic_score_gemma":0.006214103,"domain_scores_codex":[0.9951773,0.00244613,0.0001218861,0.0003412627,0.001001222,0.0009121704],"domain_scores_gemma":[0.978152,0.01771007,0.0008738824,0.0009167918,0.001283812,0.001063479],"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.0008608418,0.0006457979,0.000654057,0.0002201017,0.00007713847,0.00006165066,0.0002352614,0.7999468,0.0007547184,0.09200454,0.01502264,0.08951648],"study_design_scores_gemma":[0.00008281872,0.00005439113,0.00006276312,0.00000847698,0.00001067927,0.00001240116,0.00002722698,0.9600446,0.0001614637,0.03890057,0.000626159,0.000008465307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05593266,0.001405298,0.9168251,0.002393844,0.000394307,0.000380532,0.0002419801,0.0008405756,0.02158576],"genre_scores_gemma":[0.7629399,0.001153949,0.2141896,0.000855012,0.0008819048,0.000639444,0.0004518171,0.0004626433,0.01842575],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0135598,"threshold_uncertainty_score":0.045362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060429191","doi":"10.1007/s00453-008-9192-0","title":"Random Matrices and Codes for the Erasure Channel","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; List decoding; Mathematics; Erasure; Overhead (engineering); Discrete mathematics; Algorithm; Computer science; Block code; Concatenated error correction code","authors":[{"name":"Chris Studholme","is_ca":true},{"name":"Ian F. Blake","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0217023613800945,"gpt":0.2532438025626427,"spread":0.2315414411825482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001367144,0.001166957,0.0009087676,0.002310586,0.001018948,0.002156154,0.001080366,0.00216623,0.003508395],"category_scores_gemma":[0.01190674,0.000657579,0.0007457181,0.00217822,0.0027263,0.003102338,0.001510522,0.00366507,0.0008275636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001442871,"about_ca_system_score_gemma":0.001577117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001918761,"about_ca_topic_score_gemma":0.002073203,"domain_scores_codex":[0.9986894,0.0005135232,0.00004893799,0.0002032889,0.0004015574,0.0001433323],"domain_scores_gemma":[0.9929972,0.004879524,0.0006725477,0.0006098062,0.0006804294,0.0001604152],"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.00003555914,0.00001670069,0.0001836512,0.00007448411,0.00001441482,0.00005392994,0.0001197194,0.02737432,0.0006548781,0.9586204,0.001948688,0.01090324],"study_design_scores_gemma":[0.000018731,0.00001675933,0.0001580286,0.00004270829,0.00001087552,0.00007819745,0.00002470748,0.0832642,0.0004175205,0.912318,0.003624303,0.00002598464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0961753,0.01493919,0.8456748,0.008548381,0.0009101558,0.0001073828,0.0007253481,0.000350902,0.03256859],"genre_scores_gemma":[0.7521846,0.01687052,0.1849668,0.001609642,0.002765723,0.0005155894,0.0009060162,0.0002508831,0.03993024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003508395,"threshold_uncertainty_score":0.01173675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978321932","doi":"10.1007/s00453-004-1093-2","title":"An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Theory of computation; Minification; Constant (computer programming); Algorithm; Mathematics; Running time; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematical optimization; Telecommunications","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01570207297804851,"gpt":0.272842290635547,"spread":0.2571402176574985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001056606,0.001643048,0.001623478,0.001164978,0.0008976148,0.001719667,0.002982598,0.002052949,0.01736377],"category_scores_gemma":[0.005397643,0.0008459947,0.001281038,0.001730384,0.001075587,0.002381278,0.003488084,0.003118926,0.00442789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001187721,"about_ca_system_score_gemma":0.001922432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002506196,"about_ca_topic_score_gemma":0.004446,"domain_scores_codex":[0.9990282,0.0002129482,0.00004611454,0.0002362284,0.0003514386,0.0001250699],"domain_scores_gemma":[0.998486,0.0008207584,0.00007719159,0.0003716301,0.0001671506,0.00007732539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004522594,0.0003157659,0.0007278945,0.0003735402,0.00008856908,0.0001919901,0.0002304186,0.2622032,0.01002527,0.1137152,0.03147386,0.580202],"study_design_scores_gemma":[0.0001432031,0.00009014688,0.0002133995,0.00003015576,0.00003359355,0.0001231013,0.00005415158,0.8715948,0.002625852,0.118939,0.006130809,0.00002173244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006386587,0.000130574,0.9848306,0.0002148564,0.00005840946,0.0001037606,0.0001664421,0.001805707,0.006303002],"genre_scores_gemma":[0.08918969,0.0001127757,0.9027131,0.0001654498,0.00004483801,0.0003379535,0.0007832908,0.0007902779,0.005862614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01736377,"threshold_uncertainty_score":0.05808753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065769146","doi":"10.1007/s00453-001-0015-9","title":"Structural Lines, TINs, and DEMs","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Triangulated irregular network; Triangulation; Digital elevation model; Initialization; Terrain; Curvature; Surface (topology); Elevation (ballistics); Geometry; Computer science; Algorithm; Mathematics; Geodesy; Geology; Remote sensing; Geography","authors":[{"name":"James J. Little","is_ca":true},{"name":"P. Shi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01326208031414038,"gpt":0.2392971103008179,"spread":0.2260350299866775,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008048483,0.0004485898,0.0004809384,0.001719473,0.001006458,0.001538614,0.001113819,0.0008851321,0.01437452],"category_scores_gemma":[0.004808023,0.0004229998,0.0004840391,0.001458787,0.002100131,0.002955243,0.001823002,0.001449034,0.001786002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005969174,"about_ca_system_score_gemma":0.0005104308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001333487,"about_ca_topic_score_gemma":0.002690392,"domain_scores_codex":[0.9995744,0.0001291361,0.00002496298,0.00009713443,0.0001251908,0.00004919088],"domain_scores_gemma":[0.998798,0.0003936824,0.0001286584,0.0003095978,0.0002625771,0.0001074804],"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.00006852728,0.00003228109,0.001004376,0.0001069092,0.00001265392,0.00008382521,0.0001451837,0.06262108,0.0009672881,0.8385657,0.007269521,0.08912258],"study_design_scores_gemma":[0.00003119613,0.00005427311,0.0003278627,0.00006409418,0.0000141043,0.000199675,0.0001658424,0.225757,0.001463122,0.7345563,0.03734774,0.00001871958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03856873,0.001024648,0.9211597,0.001098475,0.0002908499,0.000104963,0.0004084755,0.0007136344,0.0366305],"genre_scores_gemma":[0.4915247,0.001853678,0.4585017,0.000403918,0.0002217167,0.0002311962,0.001188667,0.0004745892,0.04559987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01437452,"threshold_uncertainty_score":0.0480876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021716813","doi":"10.1007/s00453-009-9293-4","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Society for the Study of School Psychology","keywords":"Spanner; Greedy algorithm; Combinatorics; Dimension (graph theory); Logarithm; Mathematics; Time complexity; Running time; Upper and lower bounds; Bounded function; Quadratic equation; Binary logarithm; Metric space; Metric (unit); Euclidean space; Discrete mathematics; Computer science; Algorithm","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Paz Carmi","is_ca":true},{"name":"Mohammad Farshi","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006244191694777135,"gpt":0.2270014671969099,"spread":0.2207572755021327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301613,0.001381709,0.001822817,0.00112863,0.0008878325,0.002202589,0.002017187,0.001650626,0.02085748],"category_scores_gemma":[0.007295846,0.0006672716,0.001142719,0.001687837,0.001362283,0.004627681,0.002736863,0.00193286,0.003725673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211932,"about_ca_system_score_gemma":0.001847648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002468606,"about_ca_topic_score_gemma":0.006054221,"domain_scores_codex":[0.998758,0.0003163158,0.00006696498,0.0003236216,0.0003260935,0.0002091119],"domain_scores_gemma":[0.9973443,0.001726864,0.0001156844,0.0004557427,0.0001806908,0.0001767326],"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.001681956,0.0004410144,0.002852468,0.0007811816,0.0002149643,0.0002671628,0.0003054467,0.3812455,0.01089034,0.1426607,0.04098812,0.4176712],"study_design_scores_gemma":[0.0001629324,0.0001211587,0.000346235,0.00002752195,0.00004752673,0.0001120507,0.0001417493,0.728106,0.002499416,0.2648794,0.003538264,0.00001773849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09447374,0.0009170935,0.8776708,0.001488544,0.0003281608,0.0001907824,0.0008979233,0.003785819,0.02024717],"genre_scores_gemma":[0.3956087,0.0004003259,0.5877826,0.0004455843,0.00016192,0.0002943044,0.002069125,0.001042608,0.01219493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02085748,"threshold_uncertainty_score":0.06977522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1589676939","doi":"10.1007/s00453-002-0972-7","title":"Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Quantum entanglement; Classical capacity; Quantum; Quantum information; Quantum channel; Quantum capacity; Quantum teleportation; No-teleportation theorem; Computer science; Alice and Bob; Key (lock); Amplitude damping channel; Theoretical computer science; Quantum mechanics; Mathematics; Quantum network; Physics; Computer security","authors":[{"name":"Gisin","is_ca":false},{"name":"Renner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01998562375341762,"gpt":0.2402538119730662,"spread":0.2202681882196486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005074723,0.0004307911,0.001431835,0.001631164,0.003507245,0.006910115,0.002973361,0.005165449,0.01333789],"category_scores_gemma":[0.03736459,0.000866054,0.001066828,0.002288604,0.01447982,0.03532148,0.006206469,0.006019772,0.001271552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002077673,"about_ca_system_score_gemma":0.001939605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00111485,"about_ca_topic_score_gemma":0.0006078465,"domain_scores_codex":[0.9962255,0.001445439,0.0001700824,0.0007232272,0.0009294041,0.000506413],"domain_scores_gemma":[0.97832,0.01530156,0.001529559,0.003138651,0.001092173,0.000618068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003160935,0.00002491206,0.0001301195,0.00003046625,0.00000825573,0.00002148412,0.0001067694,0.001128454,0.00007869546,0.9942273,0.0005945065,0.003617468],"study_design_scores_gemma":[0.000006858303,0.000004019081,0.00003131687,0.000007578703,0.000002628794,0.00001020348,0.00003128063,0.00294141,0.00005256877,0.9964496,0.0004565573,0.000005985696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1730785,0.003542496,0.6649185,0.0437276,0.001679449,0.000165056,0.0004692788,0.0004414996,0.1119777],"genre_scores_gemma":[0.9586418,0.001353171,0.02856258,0.002213049,0.0009306926,0.0001314195,0.0001753074,0.00009057335,0.007901338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01333789,"threshold_uncertainty_score":0.04461968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023624817","doi":"10.1007/s00453-010-9469-y","title":"Approximability of the Firefighter Problem","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Kempe Foundation","keywords":"Theory of computation; Computer science; Combinatorics; Mathematics; Algorithm","authors":[{"name":"Elliot Anshelevich","is_ca":false},{"name":"Deeparnab Chakrabarty","is_ca":false},{"name":"Ameya Hate","is_ca":false},{"name":"Chaitanya Swamy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008076166490145996,"gpt":0.1912632363978393,"spread":0.1831870699076933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002293439,0.001106291,0.001569126,0.001043276,0.001406852,0.003848621,0.003222723,0.00227934,0.01221258],"category_scores_gemma":[0.01798712,0.0009032828,0.002318632,0.001084905,0.002738834,0.006794783,0.002499267,0.004977579,0.0006842489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002468968,"about_ca_system_score_gemma":0.002004037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006282238,"about_ca_topic_score_gemma":0.006280416,"domain_scores_codex":[0.9984229,0.0005918629,0.00006101541,0.000322526,0.0002919479,0.0003097256],"domain_scores_gemma":[0.9886452,0.009509766,0.0004216475,0.0007510739,0.0003580307,0.0003142668],"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.0003231325,0.0002802551,0.003500461,0.0003843954,0.0001301073,0.0002144543,0.0006343323,0.2187713,0.0008173194,0.7426568,0.008951347,0.02333606],"study_design_scores_gemma":[0.0000625126,0.00002505506,0.000438129,0.00003442637,0.00004126612,0.00006885979,0.0001377274,0.3315251,0.0002430663,0.6657422,0.001669497,0.00001203273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3336529,0.00235757,0.6065742,0.006998555,0.0002491671,0.000116797,0.0008134667,0.0006673627,0.04857],"genre_scores_gemma":[0.8835868,0.001337506,0.0960867,0.0005341055,0.0003512395,0.0001659562,0.001363471,0.0002898028,0.01628429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01221258,"threshold_uncertainty_score":0.04085511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089845008","doi":"10.1007/s00453-015-9982-0","title":"Anonymous Meeting in Networks","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Node (physics); Computer science; Theory of computation; Deterministic algorithm; Upper and lower bounds; Time complexity; Algorithm; Construct (python library); Existential quantification; Theoretical computer science; Mathematics; Discrete mathematics; Computer network","authors":[{"name":"Yoann Dieudonné","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0283711810022501,"gpt":0.2560131383583552,"spread":0.2276419573561051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156798,0.000517846,0.0004615672,0.0008538532,0.003293037,0.003072119,0.001122799,0.002075016,0.09204441],"category_scores_gemma":[0.007466613,0.0002242198,0.0004102394,0.001115319,0.0007924273,0.004601624,0.002769615,0.001807482,0.02036431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001216671,"about_ca_system_score_gemma":0.001209763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001876506,"about_ca_topic_score_gemma":0.003534721,"domain_scores_codex":[0.9985529,0.0006150177,0.00003762227,0.0003067252,0.0002728963,0.0002148793],"domain_scores_gemma":[0.9977571,0.0006060828,0.000213319,0.0004977512,0.0003707654,0.0005550163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003073665,0.00009945458,0.001524927,0.0001590834,0.00004396308,0.0004533524,0.0006809834,0.005795821,0.001181626,0.5819921,0.2773355,0.1304259],"study_design_scores_gemma":[0.0000345769,0.00004542864,0.001082204,0.00004937529,0.00003175077,0.0003598834,0.00086697,0.01437907,0.0009624492,0.3510906,0.6310663,0.00003144173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04647278,0.001645439,0.1247041,0.02490934,0.00565373,0.0002418351,0.00236623,0.001252024,0.7927546],"genre_scores_gemma":[0.3954504,0.00104479,0.02444801,0.001654376,0.001756411,0.0001845645,0.001158577,0.0003196855,0.5739832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.09204441,"threshold_uncertainty_score":0.3079193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987966922","doi":"10.1007/s00453-001-0043-5","title":"All-to-All Optical Routing in Chordal Rings of Degree 4","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optical Network Technologies","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Chordal graph; Degree (music); Theory of computation; Routing (electronic design automation); Computer science; Mathematics; Combinatorics; Computer network; Algorithm; Physics; Graph","authors":[{"name":"Lata Narayanan","is_ca":true},{"name":"Jaroslav Opatrný","is_ca":false},{"name":"Dominique Sotteau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02399159042280458,"gpt":0.2442627159242618,"spread":0.2202711255014572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007896824,0.0006367223,0.0007979844,0.0006857396,0.002083819,0.002303451,0.001943975,0.0008605825,0.005678043],"category_scores_gemma":[0.003684898,0.0004523277,0.0007050652,0.0008376565,0.001360688,0.004588398,0.002606105,0.001124462,0.0008337207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009052097,"about_ca_system_score_gemma":0.001185874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001218277,"about_ca_topic_score_gemma":0.002765638,"domain_scores_codex":[0.9993743,0.0001473757,0.00004184247,0.0001281969,0.0001164383,0.0001919],"domain_scores_gemma":[0.9980947,0.0008049507,0.0002493449,0.000454902,0.0001907403,0.0002053206],"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.001016446,0.0002213442,0.001962442,0.0004731438,0.0001041577,0.0005266949,0.0006552724,0.1016322,0.0106902,0.7660397,0.01090729,0.105771],"study_design_scores_gemma":[0.0001565712,0.0002155218,0.0005285234,0.0000563683,0.0001030529,0.0004149251,0.0004745913,0.1700627,0.007918093,0.8069692,0.01305479,0.00004569953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4074273,0.001103159,0.5281702,0.00229666,0.0004067993,0.0004192576,0.0006436564,0.0007532293,0.0587797],"genre_scores_gemma":[0.8041915,0.00114402,0.1669905,0.0003305046,0.0001342215,0.000164208,0.0004832194,0.0001903507,0.02637137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005678043,"threshold_uncertainty_score":0.01899499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967767406","doi":"10.1007/s00453-011-9496-3","title":"Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; École de Technologie Supérieure; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Asynchronous communication; Topology (electrical circuits); Node (physics); Network topology; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network; Physics","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"David Ilcinkas","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03662411861360209,"gpt":0.2460601860938201,"spread":0.209436067480218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717111,0.001083999,0.001783703,0.001376614,0.001976302,0.001394972,0.002508789,0.003383617,0.006978475],"category_scores_gemma":[0.01054104,0.001024098,0.001067095,0.001088783,0.002951591,0.00404897,0.003309177,0.002571083,0.0005703067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001150655,"about_ca_system_score_gemma":0.001342118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002418516,"about_ca_topic_score_gemma":0.002877925,"domain_scores_codex":[0.9992245,0.0003987052,0.00001849416,0.0001374944,0.0001011119,0.0001196075],"domain_scores_gemma":[0.9965186,0.002633898,0.000156089,0.0002831047,0.0001406472,0.0002675932],"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.0006673093,0.0002986298,0.001050113,0.0002983857,0.00009807609,0.0003006388,0.0004175174,0.5425288,0.001626594,0.3848936,0.01029236,0.05752788],"study_design_scores_gemma":[0.00007684386,0.00007196006,0.00007394634,0.00002625525,0.00002261999,0.00004522259,0.00007857439,0.6312192,0.0003918463,0.3667614,0.00122021,0.00001192466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2030211,0.001088292,0.7674524,0.002679869,0.000265512,0.0002493729,0.0001403659,0.0007724891,0.02433068],"genre_scores_gemma":[0.7383621,0.0004585492,0.2450768,0.0005658238,0.00009183709,0.0002290125,0.0002146045,0.0003472308,0.01465408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006978475,"threshold_uncertainty_score":0.02334535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139322641","doi":"10.1007/s00453-002-0978-1","title":"Sharp Quantum versus Classical Query Complexity Separations","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Simple (philosophy); Noncommutative geometry; Quantum complexity theory; Mathematics; Quantum algorithm; Quantum; Theory of computation; Bounded function; Polynomial; Fourier transform; Quantum Fourier transform; Discrete mathematics; Algorithm; Quantum error correction; Pure mathematics; Quantum mechanics; Physics; Mathematical analysis","authors":[{"name":"J. Niel de Beaudrap","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05649716913227652,"gpt":0.2721984185858378,"spread":0.2157012494535613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006278625,0.001116674,0.001906674,0.002480254,0.002845751,0.008598048,0.003418574,0.003375991,0.02189621],"category_scores_gemma":[0.03114989,0.001336349,0.001557173,0.002303526,0.009678307,0.02642302,0.00826574,0.01239121,0.002018362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002942429,"about_ca_system_score_gemma":0.001576701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006995145,"about_ca_topic_score_gemma":0.0006765272,"domain_scores_codex":[0.9948985,0.001353865,0.0001865783,0.000824537,0.001867855,0.0008686645],"domain_scores_gemma":[0.964181,0.02582722,0.001315666,0.005205449,0.001505239,0.001965353],"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.00006614484,0.00001904619,0.0000828694,0.00005060481,0.000006324819,0.00001369773,0.00009047172,0.0009662473,0.0003371658,0.9935202,0.001303981,0.003543174],"study_design_scores_gemma":[0.00002048288,0.00001790292,0.00015111,0.00001213404,0.00001072481,0.00005459138,0.00005459216,0.006102724,0.0004377687,0.9915541,0.001573874,0.00001001349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1345016,0.006809508,0.6558394,0.02768057,0.001076584,0.0001491627,0.0007484746,0.001428934,0.1717659],"genre_scores_gemma":[0.9108769,0.002487714,0.05816558,0.004118659,0.001866264,0.0001713642,0.0003122934,0.000470447,0.02153074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02189621,"threshold_uncertainty_score":0.07325011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W98190632","doi":"10.1007/s00453-003-1018-5","title":"Multicast Pull Scheduling: When Fairness Is Fine","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Multicast; Unicast; Scheduling (production processes); Computer network; Distributed computing; Competitive analysis; Approximation algorithm; Parallel computing; Algorithm; Mathematical optimization; Upper and lower bounds; Mathematics","authors":[{"name":"Edmonds","is_ca":true},{"name":"Pruhs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02439670081495226,"gpt":0.2598636974486351,"spread":0.2354669966336828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01047113,0.0007076623,0.002127018,0.0008622733,0.002974586,0.005290375,0.002570725,0.003366233,0.008556717],"category_scores_gemma":[0.05685393,0.0008891379,0.0006001685,0.001047871,0.002867926,0.01090815,0.003728499,0.004200865,0.0006271605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001931338,"about_ca_system_score_gemma":0.00256876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001639388,"about_ca_topic_score_gemma":0.001858252,"domain_scores_codex":[0.996213,0.001426756,0.0001488901,0.0006889659,0.0005867255,0.0009356777],"domain_scores_gemma":[0.9740089,0.01849602,0.001383883,0.003030714,0.001414031,0.001666402],"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.001862058,0.0003391448,0.005853156,0.0002506352,0.0001314472,0.0004360499,0.000803915,0.122654,0.003029058,0.7558997,0.02213622,0.0866045],"study_design_scores_gemma":[0.00008801359,0.00005581545,0.0005098386,0.000029048,0.00004060556,0.0001284813,0.0002779429,0.2346875,0.0008058666,0.7594009,0.003955331,0.00002065911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1927713,0.001520029,0.7419857,0.0156756,0.00147735,0.0001731818,0.0003352091,0.000892712,0.04516882],"genre_scores_gemma":[0.9581061,0.0002352347,0.03149791,0.0007503857,0.0005963668,0.00007760296,0.00005837407,0.0002012708,0.008476768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01047113,"threshold_uncertainty_score":0.05537724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010561968","doi":"10.1007/s00453-009-9357-5","title":"Crossing Number and Weighted Crossing Number of Near-Planar Graphs","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Crossing number (knot theory); Combinatorics; Planar graph; Mathematics; Planar; Book embedding; Theory of computation; Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science; Algorithm","authors":[{"name":"Sergio Cabello","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01015910372001161,"gpt":0.271349627299671,"spread":0.2611905235796594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008597117,0.0005905722,0.0005826067,0.003412442,0.0009121838,0.0020033,0.001410521,0.001005409,0.005135234],"category_scores_gemma":[0.008026461,0.0004975186,0.0004522581,0.002726242,0.001519497,0.003227994,0.001217834,0.00113271,0.0003498544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009226539,"about_ca_system_score_gemma":0.0003106117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000602516,"about_ca_topic_score_gemma":0.0007451412,"domain_scores_codex":[0.9994237,0.0001269998,0.00002947845,0.0001472118,0.0001927457,0.00007989298],"domain_scores_gemma":[0.9957367,0.002284175,0.0008274079,0.0003653704,0.0003390936,0.0004471046],"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.0004639179,0.0001615878,0.008901457,0.0002741912,0.00009761572,0.000317408,0.0004766642,0.1993831,0.01420893,0.6991521,0.003476847,0.07308628],"study_design_scores_gemma":[0.00002954887,0.00007581533,0.005049574,0.00004186573,0.00006844121,0.0004176772,0.0002194348,0.2955541,0.005324629,0.689598,0.003586843,0.00003417372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8003844,0.000728655,0.1792702,0.0003981806,0.00009453938,0.00004551076,0.000411497,0.0002106032,0.01845637],"genre_scores_gemma":[0.9432893,0.0006830922,0.04969869,0.00007681227,0.00007969651,0.00006530541,0.0004728507,0.0001188372,0.005515352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005135234,"threshold_uncertainty_score":0.01717907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037328176","doi":"10.1007/s00453-001-0017-7","title":"On Rooted Node-Connectivity Problems","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Node (physics); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Physics","authors":[{"name":"Joseph Cheriyan","is_ca":true},{"name":"Tibor Jordán","is_ca":false},{"name":"Zeev Nutov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02023012807082956,"gpt":0.2773567718637909,"spread":0.2571266437929613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002012878,0.001415312,0.001652246,0.002371224,0.002156348,0.00372112,0.003686938,0.003511568,0.01573444],"category_scores_gemma":[0.02062137,0.001000779,0.001245401,0.004922618,0.00400344,0.01356525,0.004498151,0.006005719,0.001469595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00188147,"about_ca_system_score_gemma":0.0008126535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001297873,"about_ca_topic_score_gemma":0.001523847,"domain_scores_codex":[0.9984761,0.0006116289,0.00005889912,0.000332516,0.0003405962,0.0001802576],"domain_scores_gemma":[0.9849031,0.01248752,0.0007734463,0.0005523521,0.0005400295,0.0007434185],"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.0001032051,0.00009922561,0.0007409197,0.0002878728,0.00003703627,0.0001539226,0.0004146958,0.02610566,0.0005360082,0.9395946,0.01027775,0.02164923],"study_design_scores_gemma":[0.00002802142,0.00001733951,0.0001646226,0.00004111959,0.00001916119,0.00008611883,0.0001056442,0.02681203,0.000145316,0.9691591,0.003413749,0.000007838408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.218842,0.008582391,0.6145981,0.01579729,0.0008255163,0.0002927447,0.00127007,0.0003699113,0.139422],"genre_scores_gemma":[0.738902,0.01380783,0.1779362,0.002686125,0.002519071,0.0006655446,0.003592809,0.000667314,0.05922301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01573444,"threshold_uncertainty_score":0.05263692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999576733","doi":"10.1007/s00453-007-9045-2","title":"Maximum Induced Matchings for Chordal Graphs in Linear Time","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Indifference graph; Split graph; Maximal independent set; Treewidth; Discrete mathematics; Pathwidth; Bipartite graph; Time complexity; Cograph; Line graph; Graph; 1-planar graph","authors":[{"name":"Andreas Brandstädt","is_ca":false},{"name":"Chı́nh T. Hoàng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01783560561319089,"gpt":0.3055982628954908,"spread":0.2877626572822999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232291,0.002047895,0.003004599,0.002040826,0.002877455,0.006519879,0.005614182,0.003148719,0.03270825],"category_scores_gemma":[0.01677998,0.001788838,0.002837477,0.004952717,0.002314768,0.0182565,0.005216811,0.004346763,0.005021857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004846838,"about_ca_system_score_gemma":0.004317794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002743425,"about_ca_topic_score_gemma":0.008983204,"domain_scores_codex":[0.9959182,0.0007871222,0.0002725033,0.001220592,0.001007761,0.0007938981],"domain_scores_gemma":[0.9843876,0.01038897,0.001039643,0.002315101,0.0007172308,0.00115144],"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.00690388,0.003438392,0.006492111,0.004570376,0.0008362355,0.0005310248,0.002120264,0.1049162,0.03227206,0.2917629,0.09260239,0.4535541],"study_design_scores_gemma":[0.001612253,0.0004253087,0.001534763,0.000151793,0.0005179144,0.00048182,0.0007611502,0.2124496,0.01170404,0.7556226,0.01465007,0.00008868172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3632899,0.002711138,0.532885,0.008906701,0.000654566,0.002162858,0.01078753,0.01147411,0.06712819],"genre_scores_gemma":[0.5700659,0.001196134,0.3847926,0.001344474,0.0004779648,0.001099041,0.01341225,0.002159122,0.02545244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03270825,"threshold_uncertainty_score":0.10942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963550906","doi":"10.1007/s00453-017-0275-7","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Linear programming relaxation; Combinatorics; Relaxation (psychology); Theory of computation; Tree (set theory); Approximation algorithm; Integer programming; Integer (computer science); Discrete mathematics; Algorithm; Computer science","authors":[{"name":"Joseph Cheriyan","is_ca":true},{"name":"Zhihan Gao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08491445882408623,"gpt":0.3916150911468806,"spread":0.3067006323227944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001753969,0.001424078,0.002011935,0.001090526,0.0007058921,0.001979276,0.00259421,0.001591834,0.009547127],"category_scores_gemma":[0.009705571,0.0007072234,0.001460643,0.001876182,0.001503201,0.004209096,0.004140135,0.003807213,0.002825257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009382993,"about_ca_system_score_gemma":0.001673576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001740303,"about_ca_topic_score_gemma":0.003082335,"domain_scores_codex":[0.9985791,0.0003899037,0.00006620226,0.0002788729,0.0004319719,0.0002539365],"domain_scores_gemma":[0.9962351,0.001590291,0.0001781726,0.001370425,0.0003689454,0.0002570722],"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.0008260402,0.0004988254,0.002876855,0.0006462542,0.0001186866,0.000270856,0.0003191997,0.2936781,0.01330117,0.1567475,0.02683975,0.5038768],"study_design_scores_gemma":[0.00004410382,0.0001297663,0.0003842795,0.00005727879,0.00003566358,0.0001633026,0.00006803868,0.8453513,0.003169077,0.1463275,0.00425328,0.00001641103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04669274,0.0006689131,0.9424569,0.0005451773,0.0002340419,0.0001211235,0.0004464731,0.002039162,0.006795486],"genre_scores_gemma":[0.2840583,0.0005829501,0.7044256,0.0002910635,0.000252528,0.0003447743,0.001418318,0.0008055343,0.007820969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009547127,"threshold_uncertainty_score":0.03193825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139596748","doi":"10.1007/s00453-006-1217-y","title":"FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Parallel computing; Computer science; Algorithm; Linear space; Parallel algorithm; Sequence (biology); Smith–Waterman algorithm; Space (punctuation); Theory of computation; Dynamic programming; Mathematics; Sequence alignment; Combinatorics","authors":[{"name":"Adrian Driga","is_ca":true},{"name":"Paul Lu","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true},{"name":"Duane Szafron","is_ca":true},{"name":"Kevin Charter","is_ca":false},{"name":"Ian Parsons","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01417743984069811,"gpt":0.2535281535787954,"spread":0.2393507137380973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003714774,0.004311463,0.003398669,0.003903774,0.003059195,0.003986051,0.005374161,0.002404936,0.01109116],"category_scores_gemma":[0.01309724,0.002302699,0.002735504,0.004789577,0.001721614,0.004063305,0.003344307,0.005865361,0.009327234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001858557,"about_ca_system_score_gemma":0.004463249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005394892,"about_ca_topic_score_gemma":0.008565414,"domain_scores_codex":[0.9960899,0.001472096,0.0003769032,0.0008579058,0.0009664783,0.0002367057],"domain_scores_gemma":[0.9963045,0.002060778,0.0002767937,0.0006025084,0.0005877584,0.0001675111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001605905,0.0004076056,0.001112411,0.001719662,0.0006383779,0.0002671056,0.0006622354,0.04407969,0.03084983,0.03176545,0.1131254,0.7737664],"study_design_scores_gemma":[0.001028107,0.0003810225,0.0008506781,0.0002164653,0.0001938047,0.0005035225,0.0002195586,0.7470334,0.02785542,0.1246216,0.09687273,0.0002236073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002307723,0.0006174932,0.9645399,0.0002092883,0.0001565334,0.0002094191,0.0008755387,0.0303656,0.0007182831],"genre_scores_gemma":[0.008125316,0.0002332697,0.9852368,0.000125305,0.00005696416,0.0004786009,0.002792842,0.001984247,0.0009667155],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01109116,"threshold_uncertainty_score":0.03710365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}