{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":23,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":23,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"d2150b147155","filters":{"venue":"ACM Journal of Experimental Algorithmics"}},"results":[{"id":"W2048442462","doi":"10.1145/2133803.2184450","title":"StreamKM++","year":2012,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":295,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Computer science; Data stream; Tree (set theory); Sample (material); Sampling (signal processing); Streaming algorithm; Cluster analysis; Mathematics; Combinatorics; Upper and lower bounds; Artificial intelligence","authors":[{"name":"Marcel R. Ackermann","is_ca":false},{"name":"Marcus Märtens","is_ca":false},{"name":"Christoph Raupach","is_ca":false},{"name":"Kamil Swierkot","is_ca":false},{"name":"Christiane Lammersen","is_ca":true},{"name":"Christian Sohler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02788303691864616,"gpt":0.3083020289660293,"spread":0.2804189920473832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416698,0.00220538,0.001638081,0.001827882,0.0008975592,0.004056428,0.006345148,0.001649876,0.03837227],"category_scores_gemma":[0.005814671,0.001442612,0.002260164,0.002772977,0.0007494696,0.005651424,0.004418093,0.002936071,0.03703525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001398686,"about_ca_system_score_gemma":0.001826805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00371392,"about_ca_topic_score_gemma":0.00556512,"domain_scores_codex":[0.9979037,0.0002367241,0.0002376502,0.0005688017,0.0008857895,0.0001673569],"domain_scores_gemma":[0.9981711,0.0003088138,0.00009848836,0.000669945,0.0006318412,0.0001197506],"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.0008142507,0.0002171424,0.001295197,0.001073527,0.0001568372,0.0001861348,0.0001931528,0.0287595,0.008816073,0.05227346,0.2879987,0.618216],"study_design_scores_gemma":[0.000370313,0.0001940432,0.0005569643,0.00009858889,0.00005702526,0.0003973061,0.00006130176,0.4190661,0.02349471,0.06423175,0.4913373,0.0001345724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00256059,0.000488618,0.8480858,0.0005317923,0.0006148643,0.0006105235,0.009648777,0.1239257,0.01353335],"genre_scores_gemma":[0.01873788,0.0005400174,0.9210148,0.0008476967,0.0001786903,0.0009624561,0.02571058,0.0124311,0.01957687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03837227,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2994941531","doi":"10.1145/3376122","title":"Xor Filters","year":2020,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bloom filter; Filter (signal processing); Cuckoo; Generalization; Set (abstract data type); Bitwise operation; Filter design","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03599654909467832,"gpt":0.2578440371868842,"spread":0.2218474880922059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107857,0.001101334,0.001574673,0.001966865,0.001982937,0.004024469,0.002128719,0.001617036,0.03029377],"category_scores_gemma":[0.01248617,0.0007962909,0.001125856,0.002452081,0.001177156,0.008318209,0.002669511,0.00159768,0.01048329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002682809,"about_ca_system_score_gemma":0.003103259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003874989,"about_ca_topic_score_gemma":0.004584606,"domain_scores_codex":[0.9967862,0.0003964319,0.0003486462,0.0006618951,0.0013404,0.0004664901],"domain_scores_gemma":[0.992452,0.002274169,0.0005474754,0.002593878,0.001887046,0.0002454784],"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.001607089,0.0002505919,0.003285896,0.0006516608,0.0001292319,0.0003465273,0.0004001684,0.01583508,0.02244734,0.3051123,0.06679122,0.5831429],"study_design_scores_gemma":[0.0003216401,0.0005493909,0.001446698,0.0003432556,0.0002393368,0.001596878,0.0004096496,0.2315807,0.08463404,0.2921669,0.3865237,0.0001878817],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02922039,0.001923474,0.8982734,0.001487809,0.0007028711,0.0009390106,0.003691741,0.0126727,0.05108849],"genre_scores_gemma":[0.3274985,0.002595805,0.5888689,0.001880688,0.0006149513,0.001152399,0.005328514,0.001540268,0.07051992],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03029377,"threshold_uncertainty_score":0.1013427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094154930","doi":"10.1145/1498698.1564507","title":"An experimental investigation of set intersection algorithms for text searching","year":2009,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Context (archaeology); Set (abstract data type); Computer science; Algorithm; Theoretical computer science; Randomized algorithm; Information retrieval; Mathematics","authors":[{"name":"Jérémy Barbay","is_ca":false},{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Tyler Lu","is_ca":true},{"name":"Alejandro Salinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0479229736013965,"gpt":0.3482190534161552,"spread":0.3002960798147586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01357784,0.002003091,0.002437027,0.004347849,0.002110477,0.003180409,0.004360543,0.002915689,0.005356369],"category_scores_gemma":[0.07633378,0.000828636,0.001229983,0.01035625,0.001858535,0.0100238,0.002966919,0.002504588,0.002053349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003162829,"about_ca_system_score_gemma":0.003032711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00566234,"about_ca_topic_score_gemma":0.004351618,"domain_scores_codex":[0.9735156,0.01100332,0.003365615,0.002809769,0.008079876,0.001225744],"domain_scores_gemma":[0.9079359,0.06547686,0.002809742,0.01448052,0.008281083,0.001015889],"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.01764018,0.006767702,0.01547404,0.003142161,0.001037632,0.0002803172,0.001016191,0.1580258,0.02467954,0.02127401,0.0330486,0.7176138],"study_design_scores_gemma":[0.002385447,0.005987216,0.00850171,0.0001481137,0.0003915657,0.0008763836,0.001230593,0.8830354,0.05911114,0.02395898,0.01418534,0.0001880235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7971624,0.008279687,0.1471307,0.001881431,0.0007701963,0.001566219,0.00574924,0.01509611,0.02236395],"genre_scores_gemma":[0.6515135,0.00142655,0.3300089,0.0003507946,0.0002331611,0.001273325,0.01041007,0.001221005,0.003562612],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01357784,"threshold_uncertainty_score":0.07180738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058048384","doi":"10.1145/944618.944628","title":"Finding the chromatic number by means of critical graphs","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Chromatic scale; Critical graph; Mathematics; Graph coloring; Graph; Discrete mathematics; Graph factorization; Random graph; Edge coloring; Graph power; Line graph","authors":[{"name":"Francine Herrmann","is_ca":false},{"name":"Alain Hertz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1340056843624997,"gpt":0.413582351479498,"spread":0.2795766671169983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760273,0.0008248742,0.0007032051,0.002407065,0.0009938182,0.0010815,0.001644499,0.0006890919,0.004127093],"category_scores_gemma":[0.002902941,0.0004904984,0.0004850744,0.001383675,0.0009723772,0.00252527,0.0009675933,0.0008413414,0.0005489627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00146348,"about_ca_system_score_gemma":0.002248592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004792046,"about_ca_topic_score_gemma":0.006459109,"domain_scores_codex":[0.9995452,0.00007173929,0.00001943786,0.0001580191,0.0001365748,0.00006902628],"domain_scores_gemma":[0.9986662,0.0005700904,0.0001947362,0.0002515554,0.0002329874,0.00008441076],"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.000337243,0.0002215456,0.006740414,0.0004218636,0.00007260832,0.0001891543,0.0003175752,0.4354525,0.02504611,0.1172566,0.006525647,0.4074187],"study_design_scores_gemma":[0.00004844564,0.00007425941,0.0006343363,0.00002548717,0.00002088746,0.0001378766,0.00007183677,0.9115338,0.007884038,0.07522649,0.004311097,0.00003147983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04154461,0.0002140987,0.9540816,0.0001737202,0.00003178423,0.00009922959,0.0001646322,0.0007675224,0.002922695],"genre_scores_gemma":[0.2296766,0.0001992778,0.7673078,0.00005605985,0.00003230718,0.0001365125,0.000571261,0.0001479436,0.001872359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004792046,"threshold_uncertainty_score":0.01380646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2220328383","doi":"10.1145/3053370","title":"Array Layouts for Comparison-Based Searching","year":2017,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Binary search algorithm; Value (mathematics); Parallel computing; Binary tree; Binary number; Latency (audio); Algorithm; Search algorithm; Arithmetic; Mathematics","authors":[{"name":"Paul-Virak Khuong","is_ca":false},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05509203364200714,"gpt":0.3722407228452136,"spread":0.3171486892032064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444467,0.00109068,0.0009014493,0.00173974,0.0009955771,0.002910432,0.002823073,0.001176421,0.0270891],"category_scores_gemma":[0.01030409,0.0007366525,0.000814827,0.004315272,0.001115202,0.006000708,0.001902532,0.001370347,0.01142218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001341147,"about_ca_system_score_gemma":0.001582006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001199882,"about_ca_topic_score_gemma":0.001982459,"domain_scores_codex":[0.9983657,0.0004296208,0.0001770696,0.0003461551,0.00054638,0.0001349843],"domain_scores_gemma":[0.9951454,0.001754327,0.0004218521,0.001744248,0.0008130016,0.0001211793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006932633,0.0001739525,0.001340894,0.001069001,0.00008456983,0.0002294142,0.0003851129,0.04103215,0.02645071,0.3475991,0.04319296,0.5377489],"study_design_scores_gemma":[0.0002702942,0.0007623711,0.0008065517,0.0002889437,0.000108912,0.001018321,0.0002872928,0.1353342,0.04996468,0.5146514,0.2963261,0.000180986],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006703267,0.002723938,0.9609267,0.0006575514,0.0004611314,0.0001900565,0.001041091,0.01019318,0.01710323],"genre_scores_gemma":[0.07988312,0.001281188,0.9078268,0.0004929058,0.0001901128,0.0003825683,0.001053291,0.00188333,0.007006536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0270891,"threshold_uncertainty_score":0.09062201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4214926007","doi":"10.1145/3510449","title":"Binary Fuse Filters: Fast and Smaller Than Xor Filters","year":2022,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Bloom filter; Cuckoo; Binary number; Fuse (electrical); Computer science; Cuckoo search; Algorithm; Upper and lower bounds; Quotient; Mathematics; Arithmetic; Engineering; Electrical engineering","authors":[{"name":"Thomas Mueller Graf","is_ca":true},{"name":"Daniel Lemire","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02087264857275021,"gpt":0.2426543320571644,"spread":0.2217816834844142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002423121,0.0008470018,0.001317628,0.00194757,0.001535574,0.003436634,0.001675751,0.001956251,0.006701977],"category_scores_gemma":[0.01407492,0.000586473,0.000790067,0.002233915,0.001167845,0.008185149,0.002082899,0.001282585,0.002015977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004004656,"about_ca_system_score_gemma":0.002646727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01176799,"about_ca_topic_score_gemma":0.009167544,"domain_scores_codex":[0.9970541,0.0003179837,0.0001946088,0.000368905,0.001685124,0.0003792912],"domain_scores_gemma":[0.9915338,0.00322307,0.0007728562,0.002183312,0.001957775,0.0003292161],"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.002522384,0.0004050905,0.006339058,0.0004725057,0.0001456248,0.0001718657,0.0006124629,0.05709815,0.06588234,0.1562636,0.02844092,0.6816459],"study_design_scores_gemma":[0.0002195841,0.0007604783,0.003038861,0.0001524574,0.000157747,0.0008236592,0.0004319696,0.699347,0.1173186,0.113233,0.06432968,0.0001870584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1228732,0.002128179,0.8467761,0.001085368,0.0002447892,0.0004845938,0.0009940555,0.009217025,0.01619676],"genre_scores_gemma":[0.5734394,0.0008799904,0.4112615,0.0006120712,0.0001565068,0.0003019881,0.001360756,0.000542474,0.01144533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01176799,"threshold_uncertainty_score":0.02905595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067110987","doi":"10.1145/1498698.1564499","title":"Experimental study of geometric <i>t</i> -spanners","year":2009,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Euclidean geometry; Set (abstract data type); Perspective (graphical); Point (geometry); Quality (philosophy); Combinatorics; Degree (music); Computer science; Plane (geometry); Euclidean distance; Mathematics; Algorithm; Discrete mathematics; Artificial intelligence; Geometry; Physics; Database","authors":[{"name":"Mohammad Farshi","is_ca":true},{"name":"Joachim Gudmundsson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02280547117846976,"gpt":0.2986947756010033,"spread":0.2758893044225336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002835194,0.001061367,0.0009677062,0.001642735,0.0007899763,0.0007177028,0.00216338,0.00121772,0.006454576],"category_scores_gemma":[0.01432826,0.0003891655,0.0008642417,0.002176855,0.001123321,0.001875311,0.001748036,0.0009417112,0.001348748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00055808,"about_ca_system_score_gemma":0.0004237104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005901066,"about_ca_topic_score_gemma":0.0005494127,"domain_scores_codex":[0.9971494,0.0006954419,0.0003109286,0.0006157408,0.0009268646,0.0003016519],"domain_scores_gemma":[0.9852046,0.008240857,0.0008984956,0.003144263,0.001904321,0.0006075294],"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.003427733,0.003152922,0.01365811,0.002956131,0.0004230456,0.0008208557,0.000932586,0.4381212,0.1939196,0.01861418,0.008821506,0.3151522],"study_design_scores_gemma":[0.0003650124,0.005931551,0.00930714,0.0001541456,0.0001295158,0.001016991,0.0008623506,0.6342566,0.3264102,0.01289819,0.008545038,0.0001231827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8788448,0.0004860394,0.1094443,0.0002225355,0.0001821743,0.000299161,0.001048321,0.002780325,0.00669242],"genre_scores_gemma":[0.8261971,0.0003380968,0.1668591,0.00008281004,0.00004297718,0.0002820528,0.00352247,0.0006756039,0.001999789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006454576,"threshold_uncertainty_score":0.02159274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018416407","doi":"10.1145/2133803.2330083","title":"A topological sorting algorithm for large graphs","year":2012,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Topological sorting; Reachability; Computer science; Sorting; Algorithm; Sorting algorithm; Vertex (graph theory); sort; Directed acyclic graph; Graph; Theoretical computer science; Mathematics","authors":[{"name":"Deepak Ajwani","is_ca":false},{"name":"Adan Cosgaya-Lozano","is_ca":true},{"name":"Norbert Zeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03450389665994346,"gpt":0.314868580395484,"spread":0.2803646837355405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790706,0.0007705079,0.0005440185,0.002135213,0.0007965523,0.001410598,0.001540901,0.000657149,0.008235252],"category_scores_gemma":[0.003215847,0.0004169808,0.000797211,0.002599507,0.0006312396,0.002589837,0.001818952,0.0008550255,0.0020231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009538366,"about_ca_system_score_gemma":0.001578648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326991,"about_ca_topic_score_gemma":0.00336359,"domain_scores_codex":[0.9994255,0.00008271726,0.0000668786,0.0001180613,0.0002333856,0.00007343735],"domain_scores_gemma":[0.998565,0.0004424542,0.0001398003,0.0004136011,0.0003503897,0.00008870178],"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.0004166184,0.0001547256,0.001750826,0.0005189176,0.00009052207,0.0001513051,0.0002681671,0.07660922,0.02379002,0.06422704,0.02572456,0.8062981],"study_design_scores_gemma":[0.0003131663,0.0005266816,0.001358187,0.0001283334,0.0001196492,0.0007661316,0.0003590537,0.6629214,0.05508417,0.1761535,0.1021603,0.0001094161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0175224,0.0002211465,0.9660055,0.0002256793,0.00008270534,0.000164009,0.0008773198,0.009614041,0.005287281],"genre_scores_gemma":[0.1056029,0.0002204593,0.8861035,0.0001262128,0.00004668577,0.0002519132,0.002523874,0.0006260928,0.004498352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008235252,"threshold_uncertainty_score":0.02754962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152727633","doi":"10.1145/944618.944629","title":"Solving a \"Hard\" problem to approximate an \"Easy\" one","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Heuristic; Matching (statistics); Mathematical optimization; Travelling salesman problem; Duality (order theory); Combinatorics; Algorithm","authors":[{"name":"Sándor P. Fekete","is_ca":false},{"name":"Henk Meijer","is_ca":true},{"name":"André Rohe","is_ca":false},{"name":"Walter Tietze","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05586580032839563,"gpt":0.3173452730164984,"spread":0.2614794726881028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452467,0.001276714,0.0009799822,0.000857676,0.0008545349,0.001139054,0.001709694,0.001905252,0.01073825],"category_scores_gemma":[0.009800095,0.0004474419,0.0008915922,0.001017797,0.001309921,0.003829403,0.002024291,0.001616799,0.0009603899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000951793,"about_ca_system_score_gemma":0.001027986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002076816,"about_ca_topic_score_gemma":0.002161204,"domain_scores_codex":[0.9989002,0.0003631619,0.00004004322,0.0002943752,0.0001924969,0.0002097627],"domain_scores_gemma":[0.9973235,0.001796914,0.0002436792,0.0003485794,0.0001633433,0.0001239675],"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.0003573235,0.0003497732,0.001306299,0.0003500951,0.00008194336,0.0001834094,0.00009390651,0.7989491,0.002145546,0.1029454,0.006521345,0.08671581],"study_design_scores_gemma":[0.00007796821,0.0001340408,0.0002795765,0.00002598324,0.00002013837,0.00007214602,0.00009815685,0.9164858,0.001320619,0.07807337,0.003398301,0.00001379435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2710157,0.0008070616,0.6842739,0.003004882,0.0003438043,0.0002374089,0.0004641082,0.001045043,0.03880808],"genre_scores_gemma":[0.5409044,0.0004029364,0.449927,0.0003983883,0.0001608287,0.0002714998,0.0005735511,0.0002160382,0.007145404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01073825,"threshold_uncertainty_score":0.03592306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170069407","doi":"10.1145/1187436.1210588","title":"Partitioning planar graphs with costs and weights","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Graph partition; Book embedding; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Partition (number theory); Computer science; Graph; Outerplanar graph; Mathematics; Discrete mathematics; Pathwidth; Line graph","authors":[{"name":"Lyudmil Aleksandrov","is_ca":false},{"name":"Hristo Djidjev","is_ca":false},{"name":"Hua Guo","is_ca":true},{"name":"Anil Maheshwari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01649643846463986,"gpt":0.2993828352694884,"spread":0.2828863968048486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007499533,0.001141118,0.0008074178,0.00180651,0.0008009521,0.001594081,0.001358396,0.0009115352,0.00262699],"category_scores_gemma":[0.01001373,0.0007508654,0.000719329,0.002689016,0.0009460033,0.003372405,0.00218714,0.001084507,0.0005552152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195375,"about_ca_system_score_gemma":0.001100592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003392149,"about_ca_topic_score_gemma":0.004575341,"domain_scores_codex":[0.9985837,0.0002236553,0.00009501744,0.0002801355,0.0006570637,0.0001604647],"domain_scores_gemma":[0.9946055,0.002529559,0.0007757264,0.001082912,0.0008781769,0.0001280904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006162442,0.0001590902,0.004475978,0.0004361428,0.000113395,0.0002387842,0.000299588,0.6185828,0.0571155,0.07626744,0.003749208,0.2379458],"study_design_scores_gemma":[0.000103653,0.0001710482,0.002495355,0.00003603345,0.0000920356,0.0003296357,0.000331129,0.8137435,0.05024408,0.12457,0.007801059,0.00008243176],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2100763,0.0001999593,0.782519,0.0002939074,0.00003945243,0.0002077975,0.0004512926,0.00154186,0.004670375],"genre_scores_gemma":[0.401096,0.0003472111,0.5937042,0.00009072888,0.0000265938,0.0002321486,0.001337104,0.000449445,0.002716628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003392149,"threshold_uncertainty_score":0.008788168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999806580","doi":"10.1145/1005813.1041511","title":"A performance study of data layout techniques for improving data locality in refinement-based pathfinding","year":2004,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Natural Sciences and Engineering Research Council of Canada","keywords":"Locality; Computer science; Compiler; Locality of reference; Exploit; CAS latency; Pathfinding; Data structure; Parallel computing; Cache; Optimizing compiler; Theoretical computer science; Programming language; Memory controller; Operating system; Graph","authors":[{"name":"Robert Niewiadomski","is_ca":true},{"name":"José Nelson Amaral","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09430588576968296,"gpt":0.3590821632634274,"spread":0.2647762774937444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067822,0.0006432238,0.0004824109,0.001227049,0.0004794844,0.000529033,0.001180277,0.0005581189,0.001274965],"category_scores_gemma":[0.01268228,0.000332167,0.000443457,0.002907061,0.0007395444,0.00183839,0.0005015016,0.0005494723,0.0003610035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009782149,"about_ca_system_score_gemma":0.0009844441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003472675,"about_ca_topic_score_gemma":0.004343186,"domain_scores_codex":[0.9980585,0.00075106,0.000151949,0.0002143686,0.0006678276,0.0001562381],"domain_scores_gemma":[0.9866946,0.008410057,0.000942233,0.002322539,0.001499529,0.0001309731],"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.001643212,0.000760647,0.008450808,0.0006928845,0.0001695974,0.0001488036,0.0005764143,0.1702604,0.1461569,0.006365258,0.002696831,0.6620783],"study_design_scores_gemma":[0.000364261,0.00345503,0.006870884,0.00003445616,0.0001736558,0.0006597333,0.0001802277,0.7223709,0.2580481,0.002789333,0.004961078,0.00009230227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6191695,0.002482913,0.3677601,0.0003316016,0.00006150157,0.0003583112,0.0002292739,0.00542267,0.004184105],"genre_scores_gemma":[0.6737972,0.0005410966,0.3237054,0.00006274613,0.00002036387,0.0001090887,0.0003112503,0.0003228811,0.001129847],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003472675,"threshold_uncertainty_score":0.01093578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968018533","doi":"10.1145/1963190.2063517","title":"Approximation algorithms for speeding up dynamic programming and denoising aCGH data","year":2011,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Genomic variations and chromosomal abnormalities","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Approximation algorithm; Multiplicative function; Mathematics; Logarithm; Regularization (linguistics); Dynamic programming; Normalization (sociology); Computer science; Mathematical optimization; Artificial intelligence","authors":[{"name":"Charalampos E. Tsourakakis","is_ca":false},{"name":"Richard Peng","is_ca":false},{"name":"Maria A. Tsiarli","is_ca":false},{"name":"Gary L. Miller","is_ca":false},{"name":"Russell Schwartz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07553904577710992,"gpt":0.317989338474552,"spread":0.2424502926974421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002849994,0.001983958,0.001918762,0.001078482,0.0008871091,0.001823382,0.002902669,0.00207459,0.004095368],"category_scores_gemma":[0.01094438,0.001080196,0.001446601,0.001788239,0.00149097,0.003134936,0.00241366,0.004725488,0.001349877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001877345,"about_ca_system_score_gemma":0.002434207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008676667,"about_ca_topic_score_gemma":0.00852087,"domain_scores_codex":[0.9983078,0.0005454883,0.00008134144,0.0004247323,0.0004072032,0.000233406],"domain_scores_gemma":[0.9964379,0.00242779,0.0002193436,0.0003963718,0.0004011595,0.0001173773],"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.0002453254,0.0001801087,0.001076189,0.0001819334,0.00008561157,0.00007784503,0.0001681217,0.8310415,0.002858651,0.03060292,0.006995444,0.1264864],"study_design_scores_gemma":[0.00001706894,0.00001425735,0.00004708874,0.000006075709,0.000005109448,0.00001323659,0.00001515098,0.9881117,0.0003692074,0.01069712,0.0006994399,0.000004517577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007951861,0.0003006685,0.9883426,0.0004877753,0.00006520924,0.00005305676,0.00009693121,0.00102777,0.00167411],"genre_scores_gemma":[0.1472017,0.0003711762,0.8468434,0.0004966273,0.0001419638,0.0004233034,0.0008383677,0.0005637382,0.003119629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008676667,"threshold_uncertainty_score":0.01725233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086354937","doi":"10.1145/1227161.1370601","title":"A graph approach to the threshold all-against-all substring matching problem","year":2008,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Substring; Graph; Matching (statistics); Computer science; Upper and lower bounds; Mathematics; Algorithm; Running time; Combinatorics; Theoretical computer science; Data structure; Statistics","authors":[{"name":"Marina Barsky","is_ca":true},{"name":"Ulrike Stege","is_ca":true},{"name":"Alex Thomo","is_ca":true},{"name":"Chris Upton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04409935035977574,"gpt":0.2762889576835892,"spread":0.2321896073238134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009827442,0.001105567,0.00143205,0.002078808,0.001148497,0.001792978,0.003702557,0.002394763,0.006212946],"category_scores_gemma":[0.005142552,0.0005812465,0.00118245,0.003637419,0.001804037,0.007516992,0.002444325,0.002575781,0.001443755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315675,"about_ca_system_score_gemma":0.001639012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002291968,"about_ca_topic_score_gemma":0.002545702,"domain_scores_codex":[0.9981322,0.0004676917,0.0001015582,0.0006508942,0.0004920409,0.0001556794],"domain_scores_gemma":[0.9971619,0.001380364,0.000319483,0.0006915762,0.0002789361,0.0001677525],"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.0003556849,0.0004007122,0.001283303,0.0005991646,0.0001283913,0.0004753618,0.0003990645,0.3700523,0.01364108,0.3918029,0.01663437,0.2042276],"study_design_scores_gemma":[0.00004637883,0.0001171596,0.0002118751,0.00002399903,0.00004752797,0.0003657291,0.0001224716,0.6491219,0.003385541,0.3361694,0.01035721,0.00003082389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008863348,0.0002044784,0.9870735,0.0005383464,0.00004820365,0.0001025455,0.0002485078,0.0005092125,0.002411787],"genre_scores_gemma":[0.1669865,0.0007569353,0.8245127,0.0005720321,0.0001769001,0.0002523141,0.001344067,0.0002946015,0.005103995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006212946,"threshold_uncertainty_score":0.02078438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089486988","doi":"10.1145/3412324","title":"Computing Autotopism Groups of Partial Latin Rectangles","year":2020,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Backtracking; Computation; Graph; Software; Group (periodic table); Theoretical computer science; Algorithm; Programming language","authors":[{"name":"Rebecca J. Stones","is_ca":false},{"name":"Raúl Manuel Falcón Ganfornina","is_ca":false},{"name":"Daniel Kotlar","is_ca":false},{"name":"Trent G. Marbach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03544455592503067,"gpt":0.2810990042413903,"spread":0.2456544483163596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008315643,0.0005180432,0.0006013047,0.001251464,0.0004174443,0.001319765,0.001037003,0.0005287046,0.00532017],"category_scores_gemma":[0.003449115,0.0003762884,0.0009283512,0.0009367891,0.001073144,0.002752126,0.001495756,0.0005453585,0.001212032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005440644,"about_ca_system_score_gemma":0.0008490697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001821121,"about_ca_topic_score_gemma":0.00222451,"domain_scores_codex":[0.9991717,0.000205356,0.00005563142,0.00024397,0.0001880734,0.0001352887],"domain_scores_gemma":[0.9974661,0.001089149,0.0003284195,0.0007271783,0.0002804975,0.0001086156],"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.001085049,0.000234436,0.02068233,0.0005796597,0.0001645155,0.0005107619,0.001467446,0.2370428,0.05119961,0.1720332,0.007949302,0.5070509],"study_design_scores_gemma":[0.0001548763,0.0005419942,0.003665995,0.00006731163,0.0000551302,0.0004354584,0.0007199768,0.8059039,0.05479186,0.1215688,0.01201465,0.00008015126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4567426,0.0002026195,0.5226224,0.0001496464,0.00004799846,0.00009679649,0.0002837615,0.005507499,0.01434657],"genre_scores_gemma":[0.6878049,0.0000766576,0.3070072,0.00007110579,0.00002805558,0.0000667306,0.0008589778,0.0005307067,0.003555737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00532017,"threshold_uncertainty_score":0.01779771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131242765","doi":"10.1145/1064546.1180614","title":"Implementing approximation algorithms for the single-source unsplittable flow problem","year":2005,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Approximation algorithm; Heuristics; Minimum-cost flow problem; Algorithm; Mathematics; Vertex (graph theory); Multi-commodity flow problem; Flow (mathematics); Computer science; Flow network; Enhanced Data Rates for GSM Evolution; Path (computing); Mathematical optimization; Graph; Combinatorics","authors":[{"name":"Jingde Du","is_ca":true},{"name":"Stavros G. Kolliopoulos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04379081623079347,"gpt":0.2955807081901236,"spread":0.2517898919593301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002702145,0.001467947,0.001259887,0.001242134,0.001333387,0.002725662,0.003625601,0.002222394,0.004831193],"category_scores_gemma":[0.01432708,0.0007410036,0.000911795,0.003260789,0.0008872083,0.00399097,0.001748141,0.001657484,0.001355572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002682057,"about_ca_system_score_gemma":0.003283653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007196189,"about_ca_topic_score_gemma":0.008507618,"domain_scores_codex":[0.9974365,0.0006541855,0.0001638111,0.0004641069,0.0007178908,0.0005634411],"domain_scores_gemma":[0.9937553,0.003534238,0.0004611901,0.001300868,0.0007501318,0.0001981859],"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.001187175,0.0007965401,0.00261027,0.0002716084,0.00009284089,0.00009125285,0.0003727588,0.7051436,0.00441377,0.04104488,0.008152114,0.2358232],"study_design_scores_gemma":[0.0001452127,0.00005980035,0.0001646818,0.00001426442,0.00001938717,0.00004760353,0.00006645405,0.9724087,0.002100163,0.02316676,0.00179629,0.00001064548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1172153,0.0008524082,0.8632401,0.0007505214,0.0001335124,0.0002695599,0.0003419328,0.005477558,0.01171899],"genre_scores_gemma":[0.3799961,0.000388587,0.615764,0.000205464,0.00004348733,0.0002918755,0.0009040355,0.0003385289,0.002067873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007196189,"threshold_uncertainty_score":0.01945978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059818323","doi":"10.1145/1064546.1180611","title":"Fast string sorting using order-preserving compression","year":2005,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Algorithm; Sorting; Computer science; String (physics); Sorting algorithm; Data compression; Bounded function; Online algorithm; Compression (physics); Data structure; Theoretical computer science; Mathematics","authors":[{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Mehdi Mirzazadeh","is_ca":true},{"name":"Mohammad Ali Safari","is_ca":true},{"name":"Hossein Sheikhattar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.036574168632612,"gpt":0.3145395867388859,"spread":0.277965418106274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122421,0.0007266756,0.0005714562,0.00183949,0.0008183854,0.001328218,0.001509896,0.0008592956,0.005162708],"category_scores_gemma":[0.006498205,0.000265458,0.0004860341,0.005360911,0.0008515469,0.004294463,0.0009834999,0.0008847564,0.001127451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001284075,"about_ca_system_score_gemma":0.001480131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003178935,"about_ca_topic_score_gemma":0.002417459,"domain_scores_codex":[0.9982176,0.0001601784,0.0001976092,0.0002244122,0.0009471311,0.0002530105],"domain_scores_gemma":[0.9934779,0.002568462,0.0003307795,0.002227446,0.001259016,0.0001363173],"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.003234291,0.001185316,0.004887313,0.0009465941,0.0001608343,0.0005557665,0.0005731552,0.1469307,0.1481266,0.0541721,0.02029135,0.6189361],"study_design_scores_gemma":[0.0004711616,0.001231479,0.002721792,0.00008144102,0.0001016343,0.0006223946,0.0001814541,0.4719974,0.4759842,0.02748742,0.01901169,0.0001079177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5834325,0.002016569,0.3519343,0.0008566729,0.0005262324,0.0005419113,0.002297349,0.03172546,0.02666905],"genre_scores_gemma":[0.7803808,0.000787504,0.2083296,0.0002447288,0.00009997444,0.0003003611,0.00298971,0.000900219,0.005967072],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005162708,"threshold_uncertainty_score":0.01727098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4361003657","doi":"10.1145/3588869","title":"Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring","year":2023,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Graph coloring; Constraint satisfaction problem; Partition (number theory); Computer science; Vertex (graph theory); Implementation; Binary number; Graph; Graph partition; Theoretical computer science; Mathematical optimization; Combinatorics; Mathematics; Artificial intelligence; Arithmetic","authors":[{"name":"Loïc Crombez","is_ca":false},{"name":"Guilherme D. da Fonseca","is_ca":false},{"name":"Florian Fontan","is_ca":false},{"name":"Yan Gérard","is_ca":false},{"name":"Aldo Gonzalez-Lorenzo","is_ca":false},{"name":"Pascal Lafourcade","is_ca":false},{"name":"Luc Libralesso","is_ca":false},{"name":"Benjamin Momège","is_ca":false},{"name":"Jack Spalding-Jamieson","is_ca":true},{"name":"Brandon Zhang","is_ca":false},{"name":"Da Wei Zheng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1174703531014551,"gpt":0.3966672885918802,"spread":0.2791969354904251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002834446,0.001144019,0.001006581,0.001023301,0.000993644,0.001893638,0.001714121,0.001011011,0.005458936],"category_scores_gemma":[0.01093856,0.0005506791,0.001077929,0.002699499,0.001300059,0.002349991,0.002314957,0.002460688,0.0005824982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002228515,"about_ca_system_score_gemma":0.003526391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01103566,"about_ca_topic_score_gemma":0.008016452,"domain_scores_codex":[0.9968863,0.001515749,0.0001131208,0.0003553495,0.0007282234,0.0004011708],"domain_scores_gemma":[0.9949857,0.003688312,0.0002945203,0.0004023348,0.0004282468,0.0002009997],"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.0004058102,0.0002697114,0.0007603705,0.0003401391,0.00007376165,0.00007180595,0.0002098734,0.7251651,0.003776996,0.1645245,0.01020853,0.09419339],"study_design_scores_gemma":[0.00004858637,0.00005106381,0.0001178414,0.00001360503,0.00001263792,0.00002198773,0.00003901389,0.9384384,0.001712716,0.0576851,0.001849989,0.000009061693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02597036,0.0003201115,0.9613932,0.0006560491,0.0001124795,0.0001873487,0.0002847419,0.0006631348,0.01041256],"genre_scores_gemma":[0.3638619,0.0004385945,0.6294782,0.0003443873,0.0001438686,0.0003486353,0.0006926125,0.0005343975,0.004157407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01103566,"threshold_uncertainty_score":0.02194285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112434174","doi":"10.1145/1187436.1216586","title":"Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Synchronization (alternating current); Overhead (engineering); Shared memory; Abstraction; Distributed shared memory; Parallel computing; Consistency (knowledge bases); Memory management; Computer network; Uniform memory access; Operating system; Overlay","authors":[{"name":"Azzedine Boukerche","is_ca":true},{"name":"Alba Cristina Magalhães Alves de Melo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006637733434060977,"gpt":0.2543754159048994,"spread":0.2477376824708384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001662843,0.0005512121,0.000755226,0.0005845602,0.0005590857,0.001317071,0.002083623,0.0008753659,0.001607987],"category_scores_gemma":[0.00601407,0.0004858776,0.0004182798,0.0006487494,0.0006288604,0.001592739,0.002274579,0.001522219,0.000376016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006174751,"about_ca_system_score_gemma":0.001448923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001375085,"about_ca_topic_score_gemma":0.001093064,"domain_scores_codex":[0.9978194,0.0005601378,0.0001471324,0.0002080388,0.0009735514,0.0002916429],"domain_scores_gemma":[0.9962705,0.0009029177,0.0004165871,0.00129926,0.0008493281,0.0002613737],"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.001384699,0.0007559196,0.006078693,0.000926719,0.0002790578,0.0006384322,0.0006728763,0.3927115,0.1933953,0.08134873,0.005567079,0.3162409],"study_design_scores_gemma":[0.0004689772,0.0009935924,0.002800242,0.00007489991,0.0002536549,0.0003873415,0.0002869782,0.8514172,0.09973347,0.0197935,0.02366399,0.0001261563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1461153,0.001235154,0.8409176,0.000558692,0.0001659348,0.000223147,0.00007498908,0.005974217,0.004734957],"genre_scores_gemma":[0.7963099,0.0002442354,0.2014972,0.00008345939,0.00004370743,0.0001145205,0.00008641915,0.0002392505,0.001381378],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002083623,"threshold_uncertainty_score":0.00879401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050275819","doi":"10.1145/1187436.1210589","title":"Heuristics for estimating contact area of supports in layered manufacturing","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Suite; Computer science; Representation (politics); Heuristic; Regular polygon; Range (aeronautics); Mathematical optimization; Key (lock); Convex hull; Algorithm; Mathematics; Artificial intelligence; Engineering; Geometry","authors":[{"name":"Ivayio Ilinkin","is_ca":false},{"name":"Ravi Janardan","is_ca":false},{"name":"Michiel Smid","is_ca":true},{"name":"Eric Johnson","is_ca":false},{"name":"Paul Castillo","is_ca":false},{"name":"Jörg Schwerdt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0256782719106334,"gpt":0.3086487864999469,"spread":0.2829705145893135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626357,0.000947899,0.001495376,0.002322776,0.00064162,0.001783917,0.001869512,0.001220895,0.001285778],"category_scores_gemma":[0.01008897,0.0009251551,0.0008056494,0.001424634,0.0009408304,0.001802741,0.001728262,0.0007638147,0.0003170345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003296,"about_ca_system_score_gemma":0.001085989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003023779,"about_ca_topic_score_gemma":0.003953989,"domain_scores_codex":[0.9987726,0.0003940129,0.00007474655,0.0001727212,0.0004124437,0.0001735125],"domain_scores_gemma":[0.9936575,0.004650109,0.0006070883,0.0004422714,0.000449068,0.0001939303],"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.0002442769,0.0000839653,0.002946001,0.0001039793,0.00004856935,0.0001356764,0.0001543531,0.9109291,0.00402819,0.005431376,0.0005745502,0.07532007],"study_design_scores_gemma":[0.00001828879,0.0000535397,0.0004287091,0.0000118117,0.00001215501,0.00003534646,0.0000525556,0.9922896,0.002494658,0.004317523,0.0002741968,0.00001164837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.107206,0.0003210141,0.8905166,0.00008147761,0.00001225155,0.0001124738,0.00009349029,0.0006408008,0.001015767],"genre_scores_gemma":[0.5320702,0.0001693793,0.4668318,0.00002472294,0.00001387515,0.0001131213,0.000250192,0.0001159577,0.0004107772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003023779,"threshold_uncertainty_score":0.008601129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886931138","doi":"10.1145/3379552","title":"An Experimental Study of Algorithms for Online Bipartite Matching","year":2020,"lang":"en","type":"preprint","venue":"ACM Journal of Experimental Algorithmics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Greedy algorithm; Bipartite graph; Computer science; Matching (statistics); Algorithm; Preprocessor; Ranking (information retrieval); Online algorithm; Theoretical computer science; Machine learning; Artificial intelligence; Mathematics; Graph","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Christodoulos Karavasilis","is_ca":true},{"name":"Denis Pankratov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09766027536202379,"gpt":0.3921035343862945,"spread":0.2944432590242707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01758701,0.002433979,0.001965425,0.002900725,0.002067728,0.002566085,0.00535922,0.002971045,0.007810274],"category_scores_gemma":[0.0748284,0.0008181417,0.001602333,0.00529354,0.002369121,0.006839005,0.003165185,0.004066818,0.002207096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0041132,"about_ca_system_score_gemma":0.002911515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003002397,"about_ca_topic_score_gemma":0.003438161,"domain_scores_codex":[0.971505,0.01293315,0.002758782,0.003988071,0.0063994,0.00241554],"domain_scores_gemma":[0.8803639,0.07446256,0.005766916,0.02883785,0.008531949,0.002036918],"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.01092572,0.01427413,0.01798546,0.00376327,0.001154025,0.0004556653,0.0004419758,0.5092623,0.02048044,0.0447819,0.07299206,0.3034829],"study_design_scores_gemma":[0.001800789,0.003607323,0.00586882,0.0001964337,0.0002307502,0.0007557326,0.0005136722,0.9066765,0.02692543,0.03567978,0.01762562,0.0001191219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7083427,0.008524172,0.1948313,0.005824308,0.002208346,0.002445882,0.0113493,0.0155818,0.05089239],"genre_scores_gemma":[0.7903014,0.001101511,0.1865052,0.001009019,0.0003641069,0.001271289,0.01389503,0.001304899,0.004247545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01758701,"threshold_uncertainty_score":0.09301019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4229008461","doi":"10.1145/3524134","title":"Coordinated Motion Planning Through Randomized <i>k</i> -Opt","year":2022,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Initialization; Job shop scheduling; Mathematical optimization; Computer science; Square (algebra); Sequence (biology); Motion (physics); Robot; Phase (matter); Mathematics; Motion planning; Artificial intelligence; Schedule; Geometry; Physics","authors":[{"name":"Paul Liu","is_ca":false},{"name":"Jack Spalding-Jamieson","is_ca":true},{"name":"Brandon Zhang","is_ca":false},{"name":"Da Wei Zheng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02827921308986038,"gpt":0.2957232502654412,"spread":0.2674440371755809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380877,0.001042366,0.001263589,0.0005534125,0.0009229906,0.001059347,0.002112042,0.00105734,0.004510696],"category_scores_gemma":[0.003971257,0.0006406957,0.0006683465,0.0007361345,0.001829528,0.001447934,0.002224234,0.001263154,0.0009589996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00109429,"about_ca_system_score_gemma":0.002130159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005442457,"about_ca_topic_score_gemma":0.01089795,"domain_scores_codex":[0.9988458,0.0003858191,0.00005150932,0.0002820598,0.0002001865,0.000234597],"domain_scores_gemma":[0.9985696,0.0007931904,0.0001918331,0.0002201737,0.0001224066,0.0001027377],"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.0006437362,0.0001138687,0.0005014699,0.0001198318,0.00004744533,0.0001030115,0.0001083063,0.9205101,0.002489544,0.02000171,0.00407424,0.05128674],"study_design_scores_gemma":[0.0001601514,0.0002183995,0.00011827,0.00001451965,0.00001883645,0.00004078934,0.00004119316,0.9835902,0.001148204,0.01325127,0.001381502,0.00001665135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04662843,0.0002969261,0.9362294,0.0004330699,0.00009584971,0.0002060479,0.0001964054,0.002349396,0.01356439],"genre_scores_gemma":[0.6907636,0.0000992749,0.3035186,0.0002816216,0.00002950232,0.0003779562,0.0002591459,0.0003496457,0.004320736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005442457,"threshold_uncertainty_score":0.01508981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2806308536","doi":"10.1145/3325111","title":"A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer","year":2019,"lang":"en","type":"preprint","venue":"ACM Journal of Experimental Algorithmics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Supercomputer; Parallelizable manifold; Parallel computing; Benchmarking; Computer science; Titan (rocket family); Embarrassingly parallel; Matrix (chemical analysis); Computational science; FLOPS; Algorithm; Parallel algorithm; Physics; Chemistry","authors":[{"name":"Andreas Björklund","is_ca":false},{"name":"Brajesh Gupt","is_ca":true},{"name":"Nicolás Quesada","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04067249351576445,"gpt":0.3062741948405774,"spread":0.265601701324813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002009236,0.0009214266,0.0009518249,0.002790696,0.0007798233,0.00130858,0.002088564,0.001112051,0.008843496],"category_scores_gemma":[0.01204448,0.0002882993,0.0005828864,0.003919073,0.0008327966,0.003849087,0.001130818,0.001387402,0.001665725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001429734,"about_ca_system_score_gemma":0.001462822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007955493,"about_ca_topic_score_gemma":0.006230878,"domain_scores_codex":[0.9978192,0.0003494155,0.0001154732,0.0001952377,0.001336906,0.0001837526],"domain_scores_gemma":[0.9952298,0.001512242,0.0002174366,0.001337101,0.001513976,0.0001893649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005473287,0.0004112145,0.004004014,0.000584627,0.0001290134,0.0002806313,0.000465844,0.2695746,0.01621711,0.2474394,0.03928865,0.4210576],"study_design_scores_gemma":[0.00009347919,0.0001204173,0.001052108,0.00005190041,0.00002087542,0.0001277976,0.00007790319,0.8943,0.01059953,0.07771759,0.01579225,0.00004613076],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1702437,0.002231024,0.7651265,0.001207011,0.0007205936,0.0002086486,0.001314019,0.009632631,0.04931586],"genre_scores_gemma":[0.4742334,0.000835111,0.514487,0.0003184947,0.0002088696,0.0002834798,0.00203467,0.001742795,0.005856118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008843496,"threshold_uncertainty_score":0.02958447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033938169","doi":"10.1145/1412228.1412231","title":"Computing an approximation of the 1-center problem on weighted terrain surfaces","year":2008,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Convex hull; Vertex (graph theory); Running time; Approximation algorithm; Minimum bounding box; Graph; Regular polygon; Algorithm; Geometry; Computer science; Artificial intelligence","authors":[{"name":"Mark Lanthier","is_ca":true},{"name":"Doron Nussbaum","is_ca":true},{"name":"Tsuo-Jung Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02518562286733398,"gpt":0.2741900172678776,"spread":0.2490043944005436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008640914,0.001411193,0.001774301,0.001291418,0.0008656213,0.001563189,0.002375874,0.002479601,0.006413935],"category_scores_gemma":[0.004850545,0.0006499797,0.001144882,0.001436401,0.001071273,0.003049235,0.002327883,0.001363454,0.0009960448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001416621,"about_ca_system_score_gemma":0.001315878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01043262,"about_ca_topic_score_gemma":0.01143545,"domain_scores_codex":[0.999385,0.0001040913,0.00002892669,0.0001732708,0.0001536138,0.0001551574],"domain_scores_gemma":[0.9983348,0.001072264,0.0001444603,0.0001564036,0.0001661187,0.0001259577],"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.0002201205,0.0000854,0.001290453,0.000113435,0.00003115147,0.0001034053,0.00009310804,0.9612878,0.001112917,0.007754003,0.002408218,0.02549999],"study_design_scores_gemma":[0.00001713366,0.00001754009,0.00008768405,0.000004597778,0.00000242567,0.00001425386,0.00003396838,0.9933036,0.0002089418,0.006022582,0.000284702,0.0000026015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2240721,0.0005127735,0.7624981,0.0007668438,0.0001286273,0.0001735398,0.0009009505,0.00240024,0.008546852],"genre_scores_gemma":[0.5096605,0.0001995045,0.4844594,0.0001474745,0.00006607029,0.00021314,0.001944111,0.0003395481,0.002970234],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01043262,"threshold_uncertainty_score":0.02145678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}