{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":82,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":82,"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":"df19c594e022","filters":{"venue":"Information Processing Letters"}},"results":[{"id":"W2094285453","doi":"10.1016/j.ipl.2004.10.007","title":"Broadcasting with locally bounded Byzantine faults","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":130,"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":"Computer science; Resilience (materials science); Distributed computing; Broadcasting (networking); Node (physics); Greedy algorithm; Heuristic; Byzantine fault tolerance; Wireless sensor network; Computer network; Fault tolerance; Algorithm","authors":[{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005448011887945285,"gpt":0.1968997007259594,"spread":0.1914516888380141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519158,0.0006926318,0.001640537,0.001203205,0.001622169,0.002434381,0.001284694,0.001894181,0.003396774],"category_scores_gemma":[0.011807,0.0004870438,0.0002787295,0.001568554,0.001753583,0.004792341,0.002873678,0.001925369,0.0006482855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002163641,"about_ca_system_score_gemma":0.001149242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001917048,"about_ca_topic_score_gemma":0.002288798,"domain_scores_codex":[0.9987168,0.0003415039,0.00007370397,0.0001754217,0.0003755305,0.0003170526],"domain_scores_gemma":[0.988781,0.006983841,0.0008161111,0.0023655,0.0007696653,0.0002838231],"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.004465342,0.0001549763,0.001889904,0.0008376281,0.00008069442,0.001258355,0.001412695,0.345364,0.04993916,0.4405574,0.01184043,0.1421994],"study_design_scores_gemma":[0.0002626241,0.0003060249,0.0003933468,0.00006814943,0.00006165108,0.000490233,0.000236736,0.6472647,0.02770091,0.3142623,0.00889203,0.00006134569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.357158,0.003073584,0.6061857,0.003742066,0.0004616644,0.0001502223,0.0004197357,0.00367296,0.02513614],"genre_scores_gemma":[0.9559171,0.0005826784,0.03573666,0.0001964379,0.0001559945,0.0000782526,0.0001345851,0.0001770385,0.007021318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003396774,"threshold_uncertainty_score":0.01569831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048541619","doi":"10.1016/s0020-0190(02)00500-8","title":"Cuckoo hashing: Further analysis","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":89,"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":"Computer science; Cuckoo; Hash function; Cuckoo search; Theoretical computer science; Algorithm; Programming language","authors":[{"name":"Luc Devroye","is_ca":true},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00865126449561512,"gpt":0.2204994529410758,"spread":0.2118481884454607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306641,0.0007424014,0.000990538,0.001816147,0.001409966,0.001909466,0.001567001,0.001083885,0.01772729],"category_scores_gemma":[0.01510229,0.0003534635,0.000688301,0.002860469,0.001672576,0.004268828,0.001583788,0.001670751,0.002328007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001348098,"about_ca_system_score_gemma":0.001283648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002354566,"about_ca_topic_score_gemma":0.002512161,"domain_scores_codex":[0.9986103,0.0003221039,0.00005117034,0.0001764425,0.0006570449,0.000182999],"domain_scores_gemma":[0.9935887,0.003143391,0.000352675,0.001472799,0.001261327,0.0001810233],"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.0002766173,0.0001692318,0.003366688,0.000285048,0.00003650532,0.0002707605,0.0003583017,0.03372028,0.003066701,0.8250535,0.03002633,0.10337],"study_design_scores_gemma":[0.00003739777,0.00008142999,0.002790496,0.00007294877,0.00003310319,0.0006435518,0.00017637,0.4431173,0.002562916,0.5342103,0.01620326,0.0000708305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654066,0.006460902,0.7277422,0.005787178,0.001022536,0.0005553606,0.001156629,0.001393463,0.09047517],"genre_scores_gemma":[0.8656198,0.003198602,0.07894488,0.001058419,0.001441864,0.0003583964,0.001411232,0.0005773531,0.0473895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01772729,"threshold_uncertainty_score":0.0593037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157953951","doi":"10.1016/j.ipl.2007.08.034","title":"Compact Hilbert indices: Space-filling curves for domains with unequal side lengths","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Hilbert curve; Hilbert R-tree; Hilbert space; Dimension (graph theory); Mathematics; Hilbert manifold; Representation (politics); Grid; Reproducing kernel Hilbert space; Space (punctuation); Rigged Hilbert space; Pure mathematics; Algorithm; Mathematical analysis; Computer science; Geometry","authors":[{"name":"Chris Hamilton","is_ca":true},{"name":"Andrew Rau‐Chaplin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01501040566804906,"gpt":0.2603718954116698,"spread":0.2453614897436208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173348,0.000907183,0.0008612251,0.001760087,0.001100214,0.004137973,0.00128179,0.001548566,0.007268443],"category_scores_gemma":[0.005727411,0.0004319212,0.0005061824,0.001706657,0.002875852,0.005061576,0.002586147,0.002579241,0.001638538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001038004,"about_ca_system_score_gemma":0.0006915218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002589866,"about_ca_topic_score_gemma":0.0001912682,"domain_scores_codex":[0.9993451,0.000174293,0.00003370836,0.00008766109,0.0002217808,0.0001374044],"domain_scores_gemma":[0.9981754,0.0006723538,0.0001939293,0.0004231095,0.0002362652,0.0002988946],"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.0000808427,0.00001599002,0.00008118102,0.00003252728,0.000002490297,0.00004477631,0.0001453802,0.002021212,0.002234629,0.9797431,0.001324827,0.01427304],"study_design_scores_gemma":[0.00002684614,0.00003061493,0.00007081972,0.00001863241,0.00000322163,0.0001234972,0.00008494428,0.02279544,0.002723855,0.967859,0.006241304,0.00002190852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2002543,0.001327181,0.7190952,0.001245887,0.0004976959,0.0001603193,0.0005605033,0.001022709,0.07583624],"genre_scores_gemma":[0.7935701,0.001268156,0.1829373,0.0003990851,0.0003082906,0.000232769,0.0004977758,0.0009953269,0.01979122],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007268443,"threshold_uncertainty_score":0.0243153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2758508602","doi":"10.1016/j.ipl.2017.09.011","title":"Stream VByte : Faster byte-oriented integer compression","year":2017,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"National Research Council Canada","keywords":"Byte; Computer science; SIMD; Data compression; Parallel computing; Data stream; Decoding methods; Integer (computer science); Cache; Compression (physics); Algorithm; Computer hardware; Programming language","authors":[{"name":"Daniel Lemire","is_ca":true},{"name":"Nathan Kurz","is_ca":false},{"name":"Christoph Rupp","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01176430296315444,"gpt":0.2485986174629158,"spread":0.2368343144997614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007262747,0.001143056,0.0008561021,0.002000146,0.0004244375,0.002025091,0.001317184,0.0006560505,0.02664535],"category_scores_gemma":[0.002858659,0.0004012488,0.000446249,0.002329244,0.0004390723,0.002220825,0.001676997,0.001081418,0.00656005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006362324,"about_ca_system_score_gemma":0.0009817166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002051197,"about_ca_topic_score_gemma":0.00283503,"domain_scores_codex":[0.9993429,0.00008011998,0.00005233028,0.00008292058,0.0003554893,0.00008625296],"domain_scores_gemma":[0.9990255,0.0003260692,0.00004605965,0.0003042602,0.0002332976,0.00006477215],"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.002153601,0.0002089493,0.0008846833,0.0003446069,0.00008739533,0.000204445,0.0001430356,0.005816563,0.03734106,0.01888416,0.06892744,0.865004],"study_design_scores_gemma":[0.001166318,0.0006736012,0.001620995,0.0002840807,0.0001282785,0.001107384,0.0002225022,0.4669552,0.336898,0.03538906,0.1554009,0.0001536833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05266717,0.0051403,0.8034176,0.001053191,0.002315471,0.0005026883,0.004251147,0.09495306,0.03569941],"genre_scores_gemma":[0.2316259,0.001718433,0.7150393,0.001138411,0.0006166769,0.0004487806,0.007938086,0.006404495,0.03507003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02664535,"threshold_uncertainty_score":0.08913749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155875791","doi":"10.1016/j.ipl.2003.09.019","title":"A note on maximum independent sets in rectangle intersection graphs","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":48,"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; Mathematics; Rectangle; Intersection (aeronautics); Upper and lower bounds; Intersection graph; Running time; Integer (computer science); Constant (computer programming); Time complexity; Approximation algorithm; Independent set; Discrete mathematics; Graph; Algorithm; Computer science; Line graph; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01023388897993671,"gpt":0.2389956860104497,"spread":0.228761797030513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004413322,0.002197247,0.003636595,0.003673957,0.004192434,0.004771722,0.006887211,0.003461889,0.01305413],"category_scores_gemma":[0.02676651,0.001952921,0.003762051,0.01038213,0.004975485,0.01682337,0.007103477,0.01558537,0.002749819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002779154,"about_ca_system_score_gemma":0.00146164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003391702,"about_ca_topic_score_gemma":0.00385051,"domain_scores_codex":[0.9958835,0.001127158,0.0002753143,0.001036334,0.001289187,0.0003884396],"domain_scores_gemma":[0.9720757,0.02238159,0.0006723232,0.002854296,0.001322077,0.0006939648],"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.0004593009,0.0001194853,0.0006828816,0.0008537258,0.000122404,0.0003393186,0.0005056692,0.03033186,0.002812497,0.8273858,0.05602085,0.08036628],"study_design_scores_gemma":[0.00003930533,0.00005632029,0.0004410538,0.0001025096,0.00008228933,0.0001616689,0.00009676108,0.03162783,0.001436763,0.9414773,0.02442447,0.00005380104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01945709,0.0112323,0.8634326,0.01473374,0.006545037,0.0001946867,0.001275479,0.0009480378,0.08218104],"genre_scores_gemma":[0.3390424,0.02295858,0.5666546,0.008425834,0.01895641,0.0009714121,0.00263576,0.00202881,0.0383261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01305413,"threshold_uncertainty_score":0.04367042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1482663448","doi":"10.1016/j.ipl.2005.06.011","title":"The state complexity of and","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Unary operation; Alphabet; State (computer science); Mathematics; Computational complexity theory; Combinatorics; Time complexity; Discrete mathematics; Regular language; Algorithm; Computer science; Automaton; Theoretical computer science; Linguistics","authors":[{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01051109242909641,"gpt":0.2119664226953609,"spread":0.2014553302662645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002353238,0.0006406258,0.001375706,0.001416873,0.002226319,0.00734341,0.002194801,0.002797401,0.01832925],"category_scores_gemma":[0.02635446,0.0008422706,0.001283456,0.001587805,0.003691269,0.01726889,0.003460721,0.003933174,0.001536638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002922206,"about_ca_system_score_gemma":0.002607784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001592805,"about_ca_topic_score_gemma":0.001109624,"domain_scores_codex":[0.9955782,0.001126692,0.00025507,0.00105208,0.00125401,0.0007338779],"domain_scores_gemma":[0.9672207,0.02383666,0.00163769,0.004420321,0.001866247,0.001018304],"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.00009922231,0.0000333491,0.00061185,0.00005283153,0.00001829523,0.00005103087,0.0003049185,0.008387187,0.0006733522,0.9819139,0.001335397,0.006518736],"study_design_scores_gemma":[0.00001459366,0.00001545775,0.0003886551,0.00001497777,0.00001570934,0.00006437488,0.00008030095,0.05745262,0.0009530405,0.9394457,0.001533128,0.00002129909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4494058,0.001066315,0.4014953,0.01306688,0.0003499373,0.0001967804,0.002753061,0.0009056286,0.1307601],"genre_scores_gemma":[0.9772618,0.0002457304,0.01031391,0.0002445286,0.000150962,0.0001212809,0.0006257269,0.0001440849,0.01089202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01832925,"threshold_uncertainty_score":0.0613175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970669897","doi":"10.1016/j.ipl.2011.07.018","title":"How many oblivious robots can explore a line","year":2011,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Asynchronous communication; Robot; Impossibility; Computer science; Line (geometry); Theoretical computer science; Mobile robot; Node (physics); Combinatorics; Distributed computing; Artificial intelligence; Mathematics; Computer network; Physics","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.05675376930657339,"gpt":0.2349867679873912,"spread":0.1782329986808179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009012806,0.0004624951,0.0006204838,0.0003386704,0.001063874,0.001913599,0.00116329,0.001418891,0.00669868],"category_scores_gemma":[0.007256211,0.0004216521,0.0004691824,0.0005636208,0.001558907,0.005637109,0.001659383,0.001425627,0.000852598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006964583,"about_ca_system_score_gemma":0.0007925191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008196172,"about_ca_topic_score_gemma":0.001175147,"domain_scores_codex":[0.9993318,0.000241393,0.00003622246,0.0001561825,0.00009047239,0.0001440143],"domain_scores_gemma":[0.9969872,0.001907985,0.000238934,0.000528541,0.0001481083,0.0001893772],"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.001707315,0.0002574175,0.004498696,0.0005630443,0.0002567122,0.0001779863,0.0007747339,0.4909207,0.007052832,0.2895738,0.01532241,0.1888942],"study_design_scores_gemma":[0.0001271241,0.0002587185,0.0008227075,0.0000636059,0.0000911255,0.0001657827,0.000536617,0.557677,0.004709796,0.4275558,0.007959676,0.00003208393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5203198,0.002107785,0.4147348,0.009901595,0.000261269,0.0001497844,0.000357492,0.001351748,0.05081567],"genre_scores_gemma":[0.9354521,0.0005413452,0.05211351,0.0002807441,0.00006851187,0.0001078056,0.000164944,0.000193783,0.01107721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00669868,"threshold_uncertainty_score":0.02240926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072626792","doi":"10.1016/j.ipl.2010.06.006","title":"Block-wise 2D kernel PCA/LDA for face recognition","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Face and Expression Recognition","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":"Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Kernel principal component analysis; Subspace topology; Pattern recognition (psychology); Linear discriminant analysis; Kernel Fisher discriminant analysis; Kernel (algebra); Block (permutation group theory); Kernel method; Principal component analysis; Artificial intelligence; Facial recognition system; Computer science; Mathematics; Linear subspace; Algorithm; Support vector machine; Combinatorics","authors":[{"name":"Armin Eftekhari","is_ca":false},{"name":"Mohamad Forouzanfar","is_ca":true},{"name":"Hamid Abrishami Moghaddam","is_ca":false},{"name":"Javad Alirezaie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01519062657803476,"gpt":0.2362413239505906,"spread":0.2210506973725558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002701112,0.000404695,0.0005826581,0.0006143647,0.00035032,0.0004290751,0.0004604477,0.0003470975,0.003935691],"category_scores_gemma":[0.0007809503,0.0002250545,0.0005457079,0.0008605812,0.0002053266,0.0005183939,0.0004728184,0.0004959835,0.003134183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002478484,"about_ca_system_score_gemma":0.0005896642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003105462,"about_ca_topic_score_gemma":0.004744288,"domain_scores_codex":[0.9996872,0.00007304261,0.00001563384,0.00004965251,0.0001322854,0.00004220796],"domain_scores_gemma":[0.9997509,0.00004924511,0.0000165156,0.00006689738,0.0001043705,0.00001196653],"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.0003184107,0.000104823,0.0006937897,0.0001661512,0.00005815371,0.00006103728,0.00007006746,0.02510343,0.1080619,0.007119182,0.009729149,0.8485138],"study_design_scores_gemma":[0.00001419327,0.00006510897,0.002843003,0.00001286314,0.00003318529,0.000186112,0.00002928222,0.9403902,0.04421068,0.003651961,0.008531611,0.00003180878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01389066,0.0006926519,0.9821966,0.0001115914,0.00009328898,0.00004134198,0.0002841949,0.001380353,0.001309321],"genre_scores_gemma":[0.256689,0.001171452,0.727864,0.00009700146,0.00009662173,0.0002235192,0.001298625,0.000335324,0.01222445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003935691,"threshold_uncertainty_score":0.01316619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048438387","doi":"10.1016/s0020-0190(03)00227-8","title":"Proof of correctness of Ressel's adOPTed algorithm","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":29,"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":"Correctness; Algorithm; Computer science","authors":[{"name":"Brad Lushman","is_ca":true},{"name":"Gordon V. Cormack","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007103674795007354,"gpt":0.2133890013111565,"spread":0.2062853265161492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006475,0.001041823,0.0009239304,0.0008396147,0.001183246,0.002718956,0.002390605,0.001952671,0.01171805],"category_scores_gemma":[0.009932272,0.0005481936,0.001126066,0.0009436076,0.002519888,0.002647062,0.00453189,0.002373521,0.004727589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001192915,"about_ca_system_score_gemma":0.001738005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001310515,"about_ca_topic_score_gemma":0.0009508477,"domain_scores_codex":[0.99655,0.0006493508,0.0002350239,0.0006339263,0.001284605,0.0006472245],"domain_scores_gemma":[0.9949279,0.001548763,0.0001518249,0.001716223,0.00153929,0.0001160474],"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.0007990136,0.0001519893,0.001415628,0.0005400331,0.0001396786,0.0005870846,0.0006613892,0.01778592,0.02107721,0.8113568,0.02463653,0.1208487],"study_design_scores_gemma":[0.0004465304,0.0002140063,0.001135963,0.0001985776,0.0001848357,0.000689453,0.0002569277,0.08714081,0.06558003,0.7596214,0.08440004,0.0001314414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05262178,0.0008112454,0.8595985,0.003788711,0.00126006,0.000351343,0.0007918573,0.00582069,0.07495574],"genre_scores_gemma":[0.6492817,0.0009163986,0.315632,0.001954346,0.0003628267,0.000460806,0.0007831468,0.001138722,0.02947004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01171805,"threshold_uncertainty_score":0.03920084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065242306","doi":"10.1016/s0020-0190(01)00325-8","title":"A note on the Consecutive Ones Submatrix problem","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"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; Permutation (music); Completeness (order theory); Row; Property (philosophy); Logical matrix; Column (typography); Existential quantification; Mathematics; Integer (computer science); Binary number; Matrix (chemical analysis); Row and column spaces; Discrete mathematics; Computer science; Arithmetic; Group (periodic table); Chemistry; Database; Programming language; Philosophy","authors":[{"name":"Mohammad Taghi Hajiaghayi","is_ca":true},{"name":"Yashar Ganjali","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02259951765581697,"gpt":0.26169837773066,"spread":0.239098860074843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002739133,0.00141973,0.001964173,0.001243644,0.002866202,0.003243991,0.00374268,0.003364428,0.02278115],"category_scores_gemma":[0.01461699,0.0006348481,0.001643342,0.003699159,0.003384602,0.009786746,0.005178334,0.01019316,0.007330596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007060015,"about_ca_system_score_gemma":0.001595358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001426566,"about_ca_topic_score_gemma":0.001665375,"domain_scores_codex":[0.9974017,0.0008866924,0.0001587666,0.0006190813,0.0006722794,0.0002615706],"domain_scores_gemma":[0.9902228,0.006364984,0.0003309865,0.001986915,0.0006488065,0.0004455039],"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.0004008892,0.0002330594,0.0005316701,0.000735669,0.000077344,0.0007397339,0.0002663916,0.01411263,0.002701612,0.6061083,0.1830908,0.1910019],"study_design_scores_gemma":[0.0000533597,0.00008510753,0.0002136266,0.0000807616,0.00001838764,0.0003880074,0.000105753,0.017388,0.0009651649,0.9359885,0.04466765,0.00004575829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01994889,0.008294348,0.8001786,0.03872738,0.01817252,0.0002927016,0.001479465,0.0007870437,0.112119],"genre_scores_gemma":[0.1889126,0.01360567,0.6508427,0.01403311,0.02820191,0.0007620925,0.003947789,0.001768134,0.09792595],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02278115,"threshold_uncertainty_score":0.0762105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975841184","doi":"10.1016/j.ipl.2007.09.005","title":"A note on the Markoff condition and central words","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"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 à Montréal","funders":"","keywords":"Computer science; Mathematics; Natural language processing; Theoretical computer science; Programming language","authors":[{"name":"Amy Glen","is_ca":true},{"name":"Aaron Lauve","is_ca":true},{"name":"Franco Saliola","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005901160824610333,"gpt":0.2216395394854219,"spread":0.2157383786608116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004808933,0.0008230229,0.001956861,0.002138774,0.003429621,0.004312253,0.002332032,0.004810218,0.01341491],"category_scores_gemma":[0.01832923,0.000877635,0.001694809,0.002421521,0.009492171,0.02115717,0.005314274,0.007541439,0.002354582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550448,"about_ca_system_score_gemma":0.001483192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000891032,"about_ca_topic_score_gemma":0.0007404467,"domain_scores_codex":[0.9973655,0.0008813759,0.0002153288,0.0006729488,0.0005470141,0.0003178159],"domain_scores_gemma":[0.9816996,0.01413595,0.000511951,0.00182607,0.001241751,0.0005846862],"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.00003907841,0.000006607803,0.00005308737,0.00003638453,0.00000360052,0.00005345728,0.00008934293,0.0001850081,0.000387631,0.9942917,0.001728051,0.003126043],"study_design_scores_gemma":[0.000007654792,0.0000105898,0.00004169563,0.000009375145,0.000004720845,0.00004482307,0.0000212143,0.0006638221,0.0003221588,0.9950194,0.003842332,0.00001216114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08395252,0.0120839,0.6063264,0.03366526,0.01213414,0.0001056298,0.0006190016,0.0008737258,0.2502395],"genre_scores_gemma":[0.8088099,0.006219507,0.1177663,0.009212529,0.01232499,0.0003175847,0.0004907477,0.0008426387,0.04401582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01341491,"threshold_uncertainty_score":0.04487735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128278061","doi":"10.1016/s0020-0190(02)00481-7","title":"A CAT algorithm for generating permutations with a fixed number of inversions","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Combinatorics; Algorithm; Mathematics; Constant (computer programming); Data structure; Computer science; Discrete mathematics","authors":[{"name":"Scott Effler","is_ca":true},{"name":"Frank Ruskey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0235454759834219,"gpt":0.3017395781108965,"spread":0.2781941021274746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068867,0.0008475783,0.0008804875,0.001390541,0.001373251,0.002294478,0.00189246,0.001860925,0.01233953],"category_scores_gemma":[0.004269464,0.0006628487,0.001263326,0.001822854,0.001115406,0.002508811,0.001909902,0.001965507,0.003788793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001298305,"about_ca_system_score_gemma":0.003078043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002498812,"about_ca_topic_score_gemma":0.004820103,"domain_scores_codex":[0.9986706,0.0003412501,0.0000804563,0.0002792362,0.0004257616,0.0002027602],"domain_scores_gemma":[0.9974371,0.001132148,0.00008467648,0.0008007411,0.0004227937,0.0001225286],"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.001244463,0.0003062682,0.001106536,0.0002732633,0.00008773791,0.0002643607,0.0003191565,0.04917113,0.02007264,0.3951179,0.02366348,0.508373],"study_design_scores_gemma":[0.0004759384,0.0003745088,0.0003889851,0.00009627886,0.0001227426,0.0005522535,0.0001344956,0.4975158,0.02632319,0.4411349,0.03278071,0.0001001165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03801486,0.0002267688,0.9340559,0.0005038244,0.0002187818,0.000363005,0.0004545628,0.002654837,0.02350752],"genre_scores_gemma":[0.2323924,0.0001936797,0.7426293,0.0003701503,0.00008164824,0.0006467185,0.001124155,0.0007649962,0.02179706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01233953,"threshold_uncertainty_score":0.04127985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079685570","doi":"10.1016/j.ipl.2005.11.022","title":"A new tree inclusion algorithm","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Tree (set theory); Mathematics; Matching (statistics); Algorithm; Node (physics); Space (punctuation); Time complexity; Discrete mathematics; Computer science; Physics; Statistics","authors":[{"name":"Yangjun Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004709152392638082,"gpt":0.2048582784913232,"spread":0.2001491260986852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001241146,0.0009067078,0.001499003,0.00259829,0.001574533,0.002778375,0.002544228,0.001705938,0.01224441],"category_scores_gemma":[0.005210631,0.0005628459,0.001070862,0.00360441,0.0008005397,0.004965901,0.004040635,0.002285268,0.007588717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006858381,"about_ca_system_score_gemma":0.001757218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073505,"about_ca_topic_score_gemma":0.001769591,"domain_scores_codex":[0.9980822,0.00031841,0.0001477349,0.0003401201,0.0009439909,0.0001675303],"domain_scores_gemma":[0.997097,0.000721378,0.0000940524,0.0008929078,0.00102052,0.0001741004],"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.0003197582,0.0002455424,0.0003762326,0.0001925055,0.00005533118,0.0001281998,0.0001472755,0.01220348,0.01204218,0.08790998,0.0230738,0.8633057],"study_design_scores_gemma":[0.000162375,0.0003190773,0.000520517,0.0001217424,0.000140459,0.0009247195,0.00009706808,0.6461272,0.03398832,0.1931186,0.1243963,0.00008361441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005569203,0.0005331956,0.983631,0.0003282777,0.0003698276,0.0001306826,0.0001924308,0.00187029,0.007375044],"genre_scores_gemma":[0.04219493,0.0004693333,0.9408841,0.0003602795,0.0003537912,0.0002230806,0.0007737622,0.0008208198,0.0139199],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01224441,"threshold_uncertainty_score":0.04096162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982630460","doi":"10.1016/j.ipl.2009.03.009","title":"Honeycomb toroidal graphs are Cayley graphs","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Cayley graph; Toroid; Combinatorics; Chordal graph; Mathematics; Discrete mathematics; Computer science; Physics; Graph; Quantum mechanics","authors":[{"name":"Brian Alspach","is_ca":true},{"name":"Matthew Dean","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007792930118177193,"gpt":0.2087345980343869,"spread":0.2009416679162097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007789116,0.0003278117,0.0003290642,0.0007097705,0.0006855195,0.001275998,0.000335631,0.0005964121,0.008474771],"category_scores_gemma":[0.0005270861,0.0002591904,0.0002795092,0.000694238,0.0005856027,0.001014205,0.0004371048,0.0006951165,0.001205148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002971859,"about_ca_system_score_gemma":0.0002545951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007646756,"about_ca_topic_score_gemma":0.001464974,"domain_scores_codex":[0.9999031,0.00001978123,0.000004617282,0.00002208227,0.00002776463,0.00002265372],"domain_scores_gemma":[0.9996376,0.00007788793,0.00007569213,0.00005265208,0.00009584236,0.00006032936],"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.0001415276,0.00003509965,0.0006918647,0.0001752318,0.00003603713,0.0005449512,0.0002710617,0.008787936,0.01420591,0.9137464,0.01400714,0.04735685],"study_design_scores_gemma":[0.00004188655,0.00009405618,0.001490008,0.00003671299,0.00002961094,0.0007585206,0.0004062975,0.04143811,0.006479481,0.9146528,0.0345298,0.00004271261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5381309,0.001882295,0.2560414,0.001487472,0.001432503,0.0003222808,0.001284664,0.001429899,0.1979886],"genre_scores_gemma":[0.9394472,0.0009939979,0.02780482,0.0005082064,0.0001453099,0.000129008,0.0005916128,0.0001156105,0.03026424],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008474771,"threshold_uncertainty_score":0.02835095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016325519","doi":"10.1016/j.ipl.2003.09.002","title":"A new differential LSI space-based probabilistic document classifier","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Classifier (UML); Probabilistic logic; Probabilistic classification; Computer science; Search engine indexing; Artificial intelligence; Pattern recognition (psychology); Data mining; A priori and a posteriori; Document classification; Adaptability; Machine learning; Support vector machine; Naive Bayes classifier","authors":[{"name":"Liang Chen","is_ca":true},{"name":"Naoyuki Tokuda","is_ca":false},{"name":"Akira Nagai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01159156178863901,"gpt":0.2222046444828678,"spread":0.2106130826942288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188324,0.0006479241,0.001552768,0.002576335,0.0008110926,0.001757364,0.00189342,0.001186156,0.00368075],"category_scores_gemma":[0.002225165,0.0003160977,0.0008805097,0.002327062,0.0005291114,0.002772886,0.001532103,0.001087392,0.003641387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007419487,"about_ca_system_score_gemma":0.001384441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001874523,"about_ca_topic_score_gemma":0.002566508,"domain_scores_codex":[0.9980991,0.0001944043,0.0001148645,0.0003303493,0.001129663,0.0001316619],"domain_scores_gemma":[0.9988662,0.0002393232,0.0000702782,0.0001779411,0.0005756838,0.00007062799],"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.0003115185,0.0001837218,0.001605414,0.0001292464,0.00006462381,0.00008552875,0.00004543299,0.007016772,0.03513928,0.00658657,0.007404163,0.9414276],"study_design_scores_gemma":[0.00004370655,0.0002139353,0.002131874,0.00001761053,0.00009017247,0.0007700149,0.00003328452,0.9458182,0.03148755,0.005711124,0.01362372,0.00005887488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01824903,0.001110075,0.9736264,0.0003125898,0.0002875182,0.0001006625,0.0003724873,0.003134225,0.002806987],"genre_scores_gemma":[0.2873691,0.0009865219,0.6909477,0.0005192067,0.0005526026,0.000315207,0.002370823,0.0002674306,0.01667142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00368075,"threshold_uncertainty_score":0.01231331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025673372","doi":"10.1016/j.ipl.2014.09.021","title":"A simple algorithm for computing positively weighted straight skeletons of monotone polygons","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"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; Austrian Science Fund","keywords":"Monotone polygon; Polygon (computer graphics); Combinatorics; Simple (philosophy); Rectilinear polygon; Simple polygon; Algorithm; Mathematics; SIMPLE algorithm; Polygon covering; Computational geometry; Computer science; Geometry","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Martin Held","is_ca":false},{"name":"Stefan Huber","is_ca":false},{"name":"Dominik Kaaser","is_ca":false},{"name":"Peter Palfrader","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006981099113149264,"gpt":0.2381842154663723,"spread":0.231203116353223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003560212,0.000667395,0.0005665036,0.001361595,0.0005415133,0.0007979806,0.0009291667,0.0005455345,0.007430866],"category_scores_gemma":[0.002211034,0.0004267962,0.0006326552,0.001332571,0.0006678963,0.001441945,0.001563186,0.0007192646,0.001489579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002949355,"about_ca_system_score_gemma":0.0005597736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008765311,"about_ca_topic_score_gemma":0.001951057,"domain_scores_codex":[0.999679,0.0000362998,0.00002942326,0.00006804863,0.0001473155,0.00004001784],"domain_scores_gemma":[0.99934,0.0001765613,0.00006461101,0.0001390295,0.0002293086,0.00005047108],"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.0002677166,0.0001067846,0.001981291,0.0003549721,0.0000615251,0.0002873243,0.0003406144,0.06992222,0.06754088,0.07483404,0.005305071,0.7789975],"study_design_scores_gemma":[0.0001225623,0.0003772084,0.001522915,0.00007812537,0.00005277175,0.0006318582,0.000257672,0.7804042,0.03878656,0.1567693,0.0209209,0.00007591498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01697507,0.00004941028,0.980058,0.00003184751,0.00001620155,0.00008120952,0.00009573803,0.0008794356,0.001813193],"genre_scores_gemma":[0.09827895,0.00009785286,0.8989304,0.00002180406,0.00001382147,0.0001116588,0.0004797748,0.0002114511,0.001854227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007430866,"threshold_uncertainty_score":0.02485865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042983118","doi":"10.1016/j.ipl.2006.08.003","title":"On the longest increasing subsequence of a circular list","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"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":"Longest common subsequence problem; Longest increasing subsequence; Subsequence; Monte Carlo method; Combinatorics; Algorithm; Mathematics; Computer science; Discrete mathematics; Statistics","authors":[{"name":"Michael Albert","is_ca":false},{"name":"M. D. Atkinson","is_ca":false},{"name":"Doron Nussbaum","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008014596510657073,"gpt":0.199122138349867,"spread":0.1911075418392099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005815643,0.0004723631,0.0005328755,0.002300802,0.001098191,0.001100648,0.0009716192,0.0007190747,0.006884772],"category_scores_gemma":[0.005618224,0.0002600786,0.0004489141,0.003409971,0.0008879894,0.002017447,0.0009848609,0.0007836195,0.001995693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005597632,"about_ca_system_score_gemma":0.0009085875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001835518,"about_ca_topic_score_gemma":0.002305224,"domain_scores_codex":[0.9994643,0.00008482309,0.00005076407,0.0001049958,0.0002126668,0.0000824766],"domain_scores_gemma":[0.9974172,0.001124329,0.0002431332,0.0004412133,0.0006132494,0.0001607892],"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.001420817,0.0001906235,0.004674622,0.0005199494,0.00006303488,0.001565584,0.0009524685,0.04000222,0.04852887,0.4796137,0.02701509,0.395453],"study_design_scores_gemma":[0.00008458283,0.0004259487,0.002817238,0.0001964791,0.00008038618,0.001469091,0.000460271,0.3663155,0.02211486,0.561465,0.04449064,0.00007997647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3044029,0.00196763,0.6529098,0.00124368,0.001057363,0.0001658762,0.001250903,0.001601364,0.03540051],"genre_scores_gemma":[0.6287199,0.001880261,0.3273833,0.0005994337,0.0007540497,0.0001776814,0.004143088,0.0006485956,0.03569375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006884772,"threshold_uncertainty_score":0.02303189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1492505833","doi":"10.1016/j.ipl.2016.07.001","title":"Palindromic rich words and run-length encodings","year":2016,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"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":"Palindrome; Upper and lower bounds; Integer (computer science); Function (biology); Combinatorics; Binary number; Word (group theory); Word length; Mathematics; Order (exchange); Discrete mathematics; Computer science; Arithmetic; Natural language processing; Geometry","authors":[{"name":"Chuan Guo","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true},{"name":"Arseny M. Shur","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007036341748443108,"gpt":0.2083122267060296,"spread":0.2012758849575864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005960768,0.0005270779,0.0004793313,0.00104235,0.0005176883,0.001411075,0.0007485806,0.0009034825,0.005379914],"category_scores_gemma":[0.004244153,0.000305681,0.0003931408,0.00131572,0.001011601,0.002415764,0.001280781,0.00127266,0.002178006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003977036,"about_ca_system_score_gemma":0.0003717604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000250906,"about_ca_topic_score_gemma":0.0003376448,"domain_scores_codex":[0.9992218,0.0002501018,0.00007747245,0.0001275148,0.0002181714,0.000104882],"domain_scores_gemma":[0.9975467,0.001174608,0.0002539979,0.00075032,0.0002128714,0.00006151822],"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.0005546059,0.00007126434,0.0005295125,0.000194403,0.00002605095,0.0006742512,0.0003658858,0.02128474,0.02499975,0.7939263,0.004508789,0.1528644],"study_design_scores_gemma":[0.00003981796,0.0001381847,0.0004019836,0.00009617672,0.00004285452,0.0009502755,0.0001520322,0.09530105,0.02816414,0.8599762,0.01467695,0.00006038121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2049401,0.002331903,0.749554,0.001507967,0.0003878758,0.00009674901,0.0007636806,0.001895314,0.0385224],"genre_scores_gemma":[0.7686164,0.00152224,0.2008315,0.0005803893,0.0005547353,0.0001848344,0.001255267,0.000798959,0.02565568],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005379914,"threshold_uncertainty_score":0.01799762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106874035","doi":"10.1016/j.ipl.2005.10.002","title":"A flaw in the electronic commerce protocol SET","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Protocol (science); Database transaction; Computer security; Computer science; Set (abstract data type); Credit card; TRACE (psycholinguistics); E-commerce; Software; World Wide Web; Database; Operating system; Programming language; Payment","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Sardaouna Hamadou","is_ca":true},{"name":"John Mullins","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0128002726312432,"gpt":0.2970579060767822,"spread":0.284257633445539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01702785,0.00105981,0.002271941,0.003022984,0.006524357,0.01027087,0.005065458,0.007972171,0.01034035],"category_scores_gemma":[0.06765243,0.00222103,0.002257884,0.002875587,0.01101433,0.02149133,0.008741272,0.0158679,0.005791026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002653996,"about_ca_system_score_gemma":0.004349267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00129458,"about_ca_topic_score_gemma":0.0007754069,"domain_scores_codex":[0.9663063,0.007449452,0.002516996,0.002664287,0.01919986,0.001863191],"domain_scores_gemma":[0.933363,0.02465617,0.001814721,0.03145102,0.007790321,0.0009247856],"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.0001844719,0.00005987121,0.0003054327,0.00006454338,0.00002538159,0.0001592915,0.0004355578,0.0009942553,0.001445818,0.9725198,0.008679678,0.01512601],"study_design_scores_gemma":[0.00009670646,0.00008353698,0.000168131,0.000116273,0.00006463776,0.0005787392,0.000155987,0.01789636,0.007700887,0.9442287,0.02882669,0.00008326671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06323297,0.0006186983,0.7982357,0.03505086,0.002992592,0.0004858716,0.001094173,0.006923378,0.09136581],"genre_scores_gemma":[0.7110913,0.0007976035,0.2431072,0.006640838,0.0009881872,0.0008256936,0.001081927,0.002135044,0.03333235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01702785,"threshold_uncertainty_score":0.0900529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057222780","doi":"10.1016/s0020-0190(01)00266-6","title":"Signature files and signature trees","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Signature (topology); Search engine indexing; Overhead (engineering); Tree (set theory); Information retrieval; Inefficiency; Inverted index; Data mining; Database; Mathematics; Operating system","authors":[{"name":"Yangjun Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008946689608552622,"gpt":0.1941975431758288,"spread":0.1852508535672761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001699553,0.0007759594,0.001145714,0.003164141,0.002475947,0.007405716,0.001706081,0.002592732,0.0164415],"category_scores_gemma":[0.0112419,0.0008558909,0.0006853052,0.008496371,0.003499712,0.01972167,0.003123063,0.002989789,0.006935186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001741264,"about_ca_system_score_gemma":0.002106728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009710843,"about_ca_topic_score_gemma":0.0006801384,"domain_scores_codex":[0.9960214,0.0006225127,0.0003607921,0.0006974532,0.001856582,0.0004412835],"domain_scores_gemma":[0.9919543,0.002560055,0.0009393957,0.003159109,0.001068983,0.0003181672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001535215,0.00003359681,0.0004158101,0.00007107251,0.00000997059,0.0001252045,0.0002015645,0.003004428,0.000839439,0.9129966,0.01108481,0.07106389],"study_design_scores_gemma":[0.00001738693,0.00002296301,0.0001285384,0.00002813025,0.00001293284,0.0003717918,0.000101564,0.01059697,0.002155068,0.9501308,0.03640985,0.0000239229],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04065147,0.003397292,0.8860234,0.005496299,0.001014383,0.0002256168,0.002896296,0.003694499,0.05660082],"genre_scores_gemma":[0.588085,0.005716112,0.2956996,0.002045851,0.001885051,0.0004113275,0.006356892,0.001443791,0.09835631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0164415,"threshold_uncertainty_score":0.05500227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123276592","doi":"10.1016/s0020-0190(00)00011-9","title":"Estimating the number of vertices of a polyhedron","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"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":"Polyhedron; Combinatorics; Computer science; Mathematics","authors":[{"name":"David Avis","is_ca":true},{"name":"Luc Devroye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007484566432026362,"gpt":0.2457550538839969,"spread":0.2382704874519706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004254555,0.0007271881,0.001233459,0.001904387,0.0006287373,0.001674849,0.001598569,0.002224778,0.003647092],"category_scores_gemma":[0.007842888,0.001015784,0.0007845624,0.001194709,0.0007559673,0.00187501,0.001240758,0.001328494,0.001302107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004514397,"about_ca_system_score_gemma":0.0005348498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003234831,"about_ca_topic_score_gemma":0.003470422,"domain_scores_codex":[0.9991465,0.0001611591,0.00005691341,0.0002560916,0.0002824807,0.00009680825],"domain_scores_gemma":[0.9965171,0.002113889,0.0002431794,0.0004950084,0.0004401596,0.0001906776],"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.00152601,0.0001765055,0.02067039,0.0004420769,0.0001625926,0.0005055883,0.0001595601,0.6100462,0.0397702,0.01693236,0.005156427,0.3044521],"study_design_scores_gemma":[0.00002090361,0.00005561559,0.002081597,0.00002089289,0.00001369804,0.0001262541,0.00005929288,0.9835089,0.006768655,0.00652387,0.0008057929,0.00001450509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2279235,0.0005264342,0.7645453,0.0002875455,0.0001182023,0.0001177666,0.001151938,0.0014209,0.003908545],"genre_scores_gemma":[0.6228578,0.0002979944,0.3728482,0.00004022315,0.00005154348,0.00006739709,0.00148642,0.0001929988,0.002157409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003647092,"threshold_uncertainty_score":0.01220071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046831124","doi":"10.1016/j.ipl.2006.09.015","title":"Dynamic Shannon coding","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"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":"Alphabet; ENCODE; Mathematics; Coding (social sciences); Entropy (arrow of time); Algorithm; Entropy encoding; Combinatorics; Variable-length code; Discrete mathematics; Decoding methods; Statistics; Physics","authors":[{"name":"Travis Gagie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004679726946155797,"gpt":0.2091892238708659,"spread":0.2045094969247101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005255045,0.000692853,0.0006071742,0.001672514,0.0009986488,0.002073395,0.0007923386,0.001339774,0.01501689],"category_scores_gemma":[0.003138562,0.0003424343,0.000412006,0.001684128,0.001634424,0.002220294,0.002059932,0.001791327,0.003994617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009002137,"about_ca_system_score_gemma":0.00111239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007209789,"about_ca_topic_score_gemma":0.0006128387,"domain_scores_codex":[0.9992637,0.0001456988,0.00003068673,0.0001199981,0.0003445505,0.00009532557],"domain_scores_gemma":[0.9990036,0.0003030434,0.0000648266,0.0003544121,0.0002097604,0.00006446736],"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.00004027963,0.00001326727,0.00008285552,0.00003194334,0.000007250766,0.00005698673,0.00003658824,0.006737237,0.002089716,0.9476776,0.006294915,0.03693143],"study_design_scores_gemma":[0.00001662814,0.00003087357,0.0001592125,0.0000497168,0.00001405299,0.0003384788,0.00003306835,0.07977954,0.005472214,0.87978,0.03428417,0.00004216233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02235058,0.002598407,0.7044961,0.003151317,0.001612554,0.0001672922,0.001301944,0.001109416,0.2632123],"genre_scores_gemma":[0.6919389,0.004735615,0.1503419,0.002626431,0.001507468,0.0004206893,0.001974816,0.0006378437,0.1458163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01501689,"threshold_uncertainty_score":0.05023646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054063908","doi":"10.1016/j.ipl.2014.05.008","title":"Estimating the number of connected components in sublinear time","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":17,"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":"Connected component; Sublinear function; Connectivity; Combinatorics; Strongly connected component; Graph; Component (thermodynamics); Computer science; Time complexity; Discrete mathematics; Mathematics; Minimum spanning tree; Algorithm","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Bruce Krayenhoff","is_ca":true},{"name":"Frederik Mallmann-Trenn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01252798965915144,"gpt":0.2463268695536741,"spread":0.2337988798945227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001300484,0.001482831,0.001497569,0.00180636,0.0006533422,0.002509498,0.00227248,0.002068693,0.007608073],"category_scores_gemma":[0.01860785,0.0009251358,0.0008790101,0.001605183,0.00114717,0.005762451,0.002234421,0.002351509,0.002260623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001514525,"about_ca_system_score_gemma":0.001515976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005634252,"about_ca_topic_score_gemma":0.01099523,"domain_scores_codex":[0.9987097,0.0003100809,0.0000852256,0.0003511937,0.0003845996,0.0001592318],"domain_scores_gemma":[0.9845752,0.01239443,0.0005740136,0.001330889,0.0007863949,0.0003390283],"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.002845688,0.0003397339,0.01200956,0.001042807,0.0003186058,0.0005445686,0.0003451257,0.3960838,0.04587388,0.04627703,0.02192025,0.4723989],"study_design_scores_gemma":[0.00004115086,0.00003404759,0.001256963,0.00001849357,0.00002610022,0.000095021,0.00004808024,0.9560732,0.003769272,0.03730865,0.0013157,0.00001343176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1129278,0.001604258,0.8713328,0.0022435,0.0002939887,0.0001441274,0.001253363,0.003766118,0.00643402],"genre_scores_gemma":[0.5433758,0.0007886179,0.438632,0.0004779689,0.0003574958,0.0002594733,0.003084279,0.0007886276,0.01223575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007608073,"threshold_uncertainty_score":0.0254516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082135431","doi":"10.1016/j.ipl.2004.09.007","title":"Pattern expressions and pattern automata","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Automaton; Computer science; Regular expression; Theoretical computer science; Mathematics; Programming language","authors":[{"name":"Cezar Câmpeanu","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006898938926469907,"gpt":0.2098543368587782,"spread":0.2029553979323083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287855,0.0008749856,0.001297832,0.001915797,0.001858233,0.005521839,0.001237192,0.001839081,0.01301225],"category_scores_gemma":[0.0070543,0.0008803055,0.001477433,0.002989159,0.003881378,0.01472967,0.003273791,0.002740991,0.003415285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008982418,"about_ca_system_score_gemma":0.0007825083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007450634,"about_ca_topic_score_gemma":0.0004318822,"domain_scores_codex":[0.9976641,0.0006056244,0.0002914783,0.0006727373,0.0005822109,0.0001838406],"domain_scores_gemma":[0.9964266,0.001787079,0.0002488444,0.0009491931,0.0004614359,0.0001267228],"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.0000179869,0.00001095547,0.0001473758,0.00004058246,0.000007293243,0.00008686595,0.0002388077,0.0006299442,0.0004379981,0.9800435,0.001608468,0.01673017],"study_design_scores_gemma":[0.00000376302,0.000005603773,0.00002953762,0.000009305166,0.000006053798,0.00009842007,0.00004701535,0.003610256,0.0003940029,0.9894466,0.006344087,0.000005360596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02735851,0.002172145,0.9086885,0.003360269,0.0005973503,0.0001264349,0.0006846467,0.001158162,0.05585395],"genre_scores_gemma":[0.5793183,0.003390152,0.3490126,0.00165692,0.001025829,0.0007786273,0.002182569,0.0008259455,0.06180905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01301225,"threshold_uncertainty_score":0.04353034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002707982","doi":"10.1016/j.ipl.2004.09.003","title":"Optimal preemptive semi-online scheduling on two uniform processors","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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":"Competitive analysis; Job shop scheduling; Scheduling (production processes); Computer science; Online algorithm; Preemption; Parallel computing; Upper and lower bounds; Fair-share scheduling; Mathematical optimization; Algorithm; Mathematics; Schedule","authors":[{"name":"Donglei Du","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009031892342331585,"gpt":0.230946689564967,"spread":0.2219147972226354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142122,0.0007148266,0.001675034,0.0004306008,0.0007597875,0.001081166,0.001553693,0.00086739,0.003731665],"category_scores_gemma":[0.003867903,0.0006944107,0.0003936694,0.001032652,0.0006248147,0.001390452,0.001341458,0.0007488806,0.0003606344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008197438,"about_ca_system_score_gemma":0.001346287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001538837,"about_ca_topic_score_gemma":0.002228936,"domain_scores_codex":[0.9989861,0.0004193408,0.00005352155,0.0001428365,0.0001369257,0.000261293],"domain_scores_gemma":[0.9969926,0.001613064,0.0002231615,0.0004946617,0.0003599186,0.0003165689],"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.005219787,0.0006205559,0.00112833,0.0003593117,0.00007739414,0.0003518738,0.0001577835,0.8507627,0.02049329,0.0309582,0.004393402,0.08547744],"study_design_scores_gemma":[0.00009649815,0.0001103218,0.0002545736,0.000003820844,0.00001064793,0.00002163836,0.00002071079,0.9909293,0.001740665,0.006553275,0.0002523837,0.000006197596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3562916,0.000369003,0.6329851,0.0004696457,0.0002483917,0.0001408018,0.0001949638,0.0009651316,0.00833548],"genre_scores_gemma":[0.8991991,0.00007407607,0.09771653,0.00007779559,0.00005155177,0.0001096055,0.00008935536,0.0000841702,0.002597736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003731665,"threshold_uncertainty_score":0.01248366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063494850","doi":"10.1016/j.ipl.2010.05.011","title":"Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Combinatorics; Bipartite graph; Mathematics; Indifference graph; Maximal independent set; Interval graph; Permutation graph; Pathwidth; Induced subgraph isomorphism problem; Cograph; Discrete mathematics; Clique-sum; Split graph; Algorithm; 1-planar graph; Line graph; Graph; Voltage graph","authors":[{"name":"Jonathan Backer","is_ca":true},{"name":"Julian Keil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02339380593617962,"gpt":0.2534392109635155,"spread":0.2300454050273358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002373487,0.002287305,0.002967359,0.00198215,0.001300663,0.003670892,0.005413797,0.002600932,0.01064803],"category_scores_gemma":[0.01441201,0.00106237,0.001714171,0.005707666,0.001893556,0.01057995,0.00271551,0.003646181,0.001782884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003690745,"about_ca_system_score_gemma":0.002764954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008779399,"about_ca_topic_score_gemma":0.01031432,"domain_scores_codex":[0.9974401,0.0007311097,0.0001145438,0.000740674,0.00046007,0.0005135565],"domain_scores_gemma":[0.9906397,0.006007507,0.0006720188,0.001802297,0.0004560489,0.0004223559],"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.002605297,0.001092398,0.003144269,0.0008670263,0.0002809244,0.0002330865,0.0007225612,0.5615088,0.004436537,0.1476899,0.03292501,0.2444941],"study_design_scores_gemma":[0.0002229764,0.00009898426,0.0004083131,0.00002808178,0.00005795044,0.0001053234,0.0001344872,0.8357042,0.001005087,0.1603222,0.001890753,0.0000217491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.104491,0.001988691,0.8748285,0.002321189,0.000173531,0.0002734612,0.001205121,0.002682969,0.01203547],"genre_scores_gemma":[0.5511084,0.001253022,0.4361972,0.0004978922,0.0002925075,0.0003701101,0.003197038,0.0007900426,0.006293855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064803,"threshold_uncertainty_score":0.03562123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081396989","doi":"10.1016/j.ipl.2013.05.005","title":"The complexity of two supply chain scheduling problems","year":2013,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Beijing Postdoctoral Science Foundation","keywords":"Unary operation; Bottleneck; Scheduling (production processes); Computer science; Component (thermodynamics); Binary number; Supply chain; Job shop scheduling; Product (mathematics); Mathematical optimization; Mathematics; Combinatorics; Arithmetic; Business; Operating system","authors":[{"name":"Jianfeng Ren","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Dachuan Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01560448787905895,"gpt":0.2173835268507453,"spread":0.2017790389716864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003708577,0.001295806,0.002349332,0.001395571,0.001372292,0.00502079,0.002309527,0.003765383,0.01160421],"category_scores_gemma":[0.02266869,0.001091577,0.001506008,0.002290118,0.002306197,0.006074159,0.00282877,0.003828377,0.0004362768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004079093,"about_ca_system_score_gemma":0.003292795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006916735,"about_ca_topic_score_gemma":0.004475294,"domain_scores_codex":[0.9968042,0.001387163,0.0001383028,0.0004792482,0.000739436,0.0004516199],"domain_scores_gemma":[0.9724064,0.02446877,0.001009734,0.0005966746,0.0006693395,0.0008490453],"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.0008536114,0.0004349515,0.001763257,0.0004652942,0.0001530517,0.0004373152,0.0003272759,0.7625642,0.001012979,0.1957384,0.008230195,0.02801935],"study_design_scores_gemma":[0.0001636081,0.00004880796,0.0004931598,0.00001964978,0.00002946914,0.00005280718,0.0001084283,0.8558717,0.0002368381,0.1419226,0.001029936,0.00002285682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4067475,0.002567628,0.5088353,0.01923844,0.000669933,0.0004333046,0.002591379,0.0004122487,0.05850421],"genre_scores_gemma":[0.8938748,0.001044132,0.08763404,0.0005645785,0.0005191515,0.0003829853,0.001552548,0.0001863441,0.01424143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01160421,"threshold_uncertainty_score":0.03881997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114125964","doi":"10.1016/j.ipl.2007.05.009","title":"On planar path transformation","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Planar; Mathematics; Path (computing); General position; Position (finance); Hamiltonian path; Regular polygon; Combinatorics; Hamiltonian (control theory); Plane (geometry); Geometry; Computer science; Mathematical optimization; Graph","authors":[{"name":"Selim G. Akl","is_ca":true},{"name":"Md. Kamrul Islam","is_ca":true},{"name":"Henk Meijer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008217308766478882,"gpt":0.2267885536003852,"spread":0.2185712448339063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002207949,0.000715152,0.0005167237,0.001371692,0.0006589125,0.0008601557,0.0007559007,0.000585557,0.01764566],"category_scores_gemma":[0.00134403,0.0003034446,0.0005900377,0.001535115,0.0009458195,0.001635024,0.002158854,0.001713018,0.003945461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004876502,"about_ca_system_score_gemma":0.0004416397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001610586,"about_ca_topic_score_gemma":0.001220273,"domain_scores_codex":[0.999649,0.00005919262,0.00001211225,0.00009703539,0.0001430633,0.00003940003],"domain_scores_gemma":[0.9997225,0.00007245456,0.00002268344,0.00008719816,0.00007524131,0.00001996385],"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.00007147129,0.00003224285,0.0002193204,0.0000653389,0.00001712723,0.00007470537,0.0001226018,0.02289281,0.004197822,0.7442507,0.01321508,0.2148409],"study_design_scores_gemma":[0.00001623146,0.00006039561,0.0002871687,0.00002398887,0.00001671561,0.0001968695,0.0001015294,0.1190588,0.003862848,0.8121742,0.06418327,0.00001789621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02044554,0.0006908892,0.9028835,0.0006649566,0.000535196,0.00008796673,0.0004238229,0.0008214134,0.07344678],"genre_scores_gemma":[0.4629911,0.003197467,0.3670461,0.0009072601,0.0005676161,0.0002461389,0.002603217,0.001639835,0.1608012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01764566,"threshold_uncertainty_score":0.05903059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003833943","doi":"10.1016/j.ipl.2007.08.023","title":"Feedback arc set problem in bipartite tournaments","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multipartite; Bipartite graph; Arc (geometry); Feedback arc set; Set (abstract data type); Mathematics; Tournament; Combinatorics; Discrete mathematics; Computer science; Quantum entanglement","authors":[{"name":"Sushmita Gupta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01714777052366188,"gpt":0.2536164302606104,"spread":0.2364686597369486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003517233,0.001204481,0.003397553,0.001539562,0.002111672,0.006328379,0.004750657,0.003750709,0.01501696],"category_scores_gemma":[0.02377393,0.001007756,0.001512146,0.002951723,0.001947152,0.008423434,0.002669293,0.003025697,0.0009576912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002337089,"about_ca_system_score_gemma":0.001765148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00266525,"about_ca_topic_score_gemma":0.002455456,"domain_scores_codex":[0.996329,0.001706955,0.0001967647,0.0006531271,0.0005992329,0.0005148913],"domain_scores_gemma":[0.9789108,0.01656525,0.001154578,0.0009438872,0.0009041799,0.001521287],"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.002585,0.00111999,0.003070467,0.001243316,0.0003180019,0.0004926744,0.0008074307,0.3686424,0.003735311,0.5029051,0.02429643,0.09078393],"study_design_scores_gemma":[0.00032898,0.0001560486,0.0005233515,0.00007150185,0.00008555015,0.000164566,0.0002474661,0.5822614,0.001384127,0.4124615,0.002272366,0.00004304805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4042649,0.001676894,0.5536684,0.00510108,0.0003629872,0.000542107,0.00240753,0.001098566,0.03087753],"genre_scores_gemma":[0.8857975,0.0007857723,0.09741978,0.0005122309,0.0003266185,0.0004966854,0.001733203,0.0002353985,0.01269275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01501696,"threshold_uncertainty_score":0.05023676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981011717","doi":"10.1016/s0020-0190(00)00103-4","title":"Computing the cycles in the perfect shuffle permutation","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Permutation (music); Computer science; Combinatorics; Theoretical computer science; Mathematics; Parallel computing; Algorithm","authors":[{"name":"John Ellis","is_ca":true},{"name":"Tobias Krahn","is_ca":true},{"name":"Hongbing Fan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007141469881151602,"gpt":0.2216170375375544,"spread":0.2144755676564028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004924529,0.0003999241,0.0005410358,0.0008296781,0.001002216,0.002372127,0.0005684624,0.0009320421,0.003985829],"category_scores_gemma":[0.003302283,0.0003262575,0.0003750041,0.000856644,0.001546278,0.003162249,0.001120906,0.0008228712,0.0007443946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008444565,"about_ca_system_score_gemma":0.001447889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00227461,"about_ca_topic_score_gemma":0.003845434,"domain_scores_codex":[0.9996146,0.0001115644,0.0000222078,0.00008001912,0.00007916867,0.00009253804],"domain_scores_gemma":[0.998976,0.0004714431,0.0001029105,0.0002165126,0.000119433,0.0001136809],"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.001075958,0.0001417416,0.003670296,0.000195651,0.00004428349,0.0002717107,0.000457077,0.09259355,0.01143376,0.71779,0.009132104,0.1631939],"study_design_scores_gemma":[0.00004229252,0.00008343175,0.0003595087,0.0000266155,0.00001230423,0.00006571618,0.0001008287,0.1138485,0.006311606,0.874741,0.004383461,0.00002472271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7766916,0.0007916972,0.1880046,0.001834371,0.0002430669,0.0001070878,0.0005242822,0.0007379141,0.03106554],"genre_scores_gemma":[0.9457211,0.000357328,0.04532021,0.0002051028,0.00007341544,0.00004198613,0.0003344508,0.0001063481,0.007839936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003985829,"threshold_uncertainty_score":0.01333392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979429135","doi":"10.1016/j.ipl.2014.03.005","title":"Integral distinguishers for reduced-round Stribog","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"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":"Hash function; GOST (hash function); Permutation (music); Mathematics; Cryptographic hash function; Function (biology); Cryptography; Computer science; Algorithm; Statistics; Computer security","authors":[{"name":"Riham AlTawy","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01248796643599444,"gpt":0.2607166727354172,"spread":0.2482287062994228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073354,0.000637183,0.001248644,0.001046007,0.001541582,0.003264515,0.001643725,0.001769179,0.01125101],"category_scores_gemma":[0.005612335,0.0005255723,0.0006529149,0.0008872667,0.002601248,0.005091116,0.005357957,0.003725551,0.002966596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001267347,"about_ca_system_score_gemma":0.001556099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003046203,"about_ca_topic_score_gemma":0.0004637542,"domain_scores_codex":[0.9976071,0.0003738617,0.0001402179,0.0004969003,0.0007854213,0.0005965012],"domain_scores_gemma":[0.9967781,0.00133784,0.0002331191,0.001160584,0.0002611248,0.0002292135],"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.0007426164,0.0001115654,0.0003480218,0.0000949929,0.00002513871,0.0001158964,0.0003156249,0.008120398,0.00859163,0.9278622,0.003616953,0.05005497],"study_design_scores_gemma":[0.00009501555,0.0001493964,0.0002520866,0.0000524407,0.00003389364,0.0001597357,0.00006985059,0.07575731,0.01491329,0.9000751,0.008380689,0.00006127824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1996026,0.0007660371,0.7412628,0.00152324,0.0004516951,0.0002144344,0.0003832767,0.002895171,0.05290089],"genre_scores_gemma":[0.9022019,0.0002503703,0.07940837,0.0005060355,0.0001670489,0.0001752816,0.0003036027,0.00033822,0.01664919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01125101,"threshold_uncertainty_score":0.03763837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245009066","doi":"10.1016/j.ipl.2003.07.005","title":"Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"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":"Topological sorting; Cover (algebra); Sorting; Directed acyclic graph; Algorithm; Node (physics); Bounded function; Mathematics; Computational complexity theory; Computer science; Combinatorics; Discrete mathematics","authors":[{"name":"Jianjun Zhou","is_ca":true},{"name":"Martin Müller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01465455923753785,"gpt":0.2469811749659108,"spread":0.232326615728373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001553368,0.001111439,0.002221153,0.00662007,0.001938515,0.002593728,0.00348239,0.001664448,0.004789114],"category_scores_gemma":[0.007900411,0.0009117989,0.001175137,0.005951975,0.00107697,0.003986019,0.002559177,0.001968577,0.001324116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147414,"about_ca_system_score_gemma":0.005470211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009694192,"about_ca_topic_score_gemma":0.01609933,"domain_scores_codex":[0.9987478,0.0002158906,0.0001323328,0.0002542567,0.0004448763,0.0002047595],"domain_scores_gemma":[0.9949304,0.0026855,0.000366627,0.0008916036,0.000862042,0.0002638427],"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.0007679925,0.0004057307,0.002209121,0.000587654,0.0001187273,0.0001656578,0.0004160092,0.07270363,0.009403979,0.05095044,0.01774342,0.8445277],"study_design_scores_gemma":[0.0002447706,0.0002682489,0.0009557528,0.0000901528,0.0001335619,0.0003276664,0.0002597955,0.8576761,0.01563729,0.1104628,0.01386266,0.0000811847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03145603,0.0008712456,0.9586254,0.0005533091,0.0001208611,0.0003490091,0.001082814,0.004024348,0.002917005],"genre_scores_gemma":[0.1127867,0.0003577918,0.8806113,0.0001643345,0.00005013725,0.0002074179,0.002638129,0.0002408007,0.002943457],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009694192,"threshold_uncertainty_score":0.01927555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059051297","doi":"10.1016/j.ipl.2009.02.013","title":"An algorithm for computing simple k-factors","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Simple (philosophy); Combinatorics; Algorithm; SIMPLE algorithm; Factor (programming language); Degenerate energy levels; Graphics; Computer science; Simple graph; Mathematics; Graph theory; Factor graph; Graph; Discrete mathematics","authors":[{"name":"Henk Meijer","is_ca":false},{"name":"Yurai Núñez-Rodríguez","is_ca":true},{"name":"David Rappaport","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01734897957320729,"gpt":0.3084865655723162,"spread":0.2911375859991089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005437993,0.00165392,0.001388466,0.001681099,0.001496797,0.002278292,0.001754211,0.001147632,0.01942554],"category_scores_gemma":[0.003259314,0.0006529285,0.001565538,0.003057442,0.001040034,0.003938685,0.002600773,0.001397804,0.009580457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001015709,"about_ca_system_score_gemma":0.001839313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002696301,"about_ca_topic_score_gemma":0.005073532,"domain_scores_codex":[0.999141,0.0001029984,0.00007338928,0.0002254764,0.0002777414,0.0001793504],"domain_scores_gemma":[0.9985999,0.0004087879,0.00006961184,0.0004673124,0.0003504537,0.000103912],"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.001078853,0.0002489636,0.001463805,0.0005813205,0.0001182016,0.0001711919,0.0004616491,0.009890327,0.02075985,0.090918,0.02885126,0.8454565],"study_design_scores_gemma":[0.000793676,0.0005790347,0.001992119,0.0001688207,0.0003239381,0.001048714,0.0006151956,0.1549061,0.03713465,0.7183349,0.08385859,0.0002442216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03138113,0.0005619263,0.944168,0.0004396321,0.0002746141,0.0003403552,0.000849052,0.00717116,0.01481402],"genre_scores_gemma":[0.1082301,0.0002694943,0.8788674,0.0001457567,0.00007817672,0.0002850587,0.001592049,0.0006397539,0.009892128],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01942554,"threshold_uncertainty_score":0.06498492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142543306","doi":"10.1016/j.ipl.2006.05.013","title":"A polynomial time algorithm for the minimum quartet inconsistency problem with quartet errors","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"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":"Time complexity; Polynomial; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Mathematical analysis","authors":[{"name":"Gang Wu","is_ca":true},{"name":"Jia-Huai You","is_ca":true},{"name":"Guohui Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004749491763813111,"gpt":0.1964781987211015,"spread":0.1917287069572884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654944,0.001454051,0.002285007,0.001505151,0.001623276,0.002629716,0.003821701,0.002350304,0.0123431],"category_scores_gemma":[0.008546715,0.001069559,0.001501642,0.003070343,0.001085402,0.004627209,0.004040685,0.00309405,0.001993195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283274,"about_ca_system_score_gemma":0.002305563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002372343,"about_ca_topic_score_gemma":0.003536768,"domain_scores_codex":[0.9981695,0.0002885466,0.0001620575,0.0005814388,0.000535309,0.0002630729],"domain_scores_gemma":[0.9949987,0.002729759,0.0003700438,0.001162967,0.000548179,0.0001902447],"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.001161153,0.0005437279,0.001323623,0.000774826,0.0001609233,0.0003456872,0.0005031958,0.1072642,0.01298913,0.05436725,0.0348938,0.7856724],"study_design_scores_gemma":[0.0007882065,0.0003063145,0.0006720382,0.00007924925,0.0001206305,0.00069957,0.0003572115,0.7397814,0.009690913,0.2379807,0.009455596,0.00006820958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02332559,0.000416994,0.9670291,0.0008951735,0.0001906829,0.0002879684,0.0003347441,0.002857675,0.00466198],"genre_scores_gemma":[0.1366133,0.0001874135,0.8574331,0.0002937751,0.000115626,0.0002493389,0.001316563,0.0006521791,0.003138653],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0123431,"threshold_uncertainty_score":0.04129183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058621291","doi":"10.1016/j.ipl.2005.09.006","title":"Vertex covering by paths on trees with its applications in machine translation","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"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":"Edge cover; Vertex cover; Vertex (graph theory); Path (computing); Combinatorics; Set cover problem; Enhanced Data Rates for GSM Evolution; Tree (set theory); Mathematics; Cover (algebra); Translation (biology); Computer science; Set (abstract data type); Algorithm; Time complexity; Discrete mathematics; Artificial intelligence; Graph","authors":[{"name":"Guohui Lin","is_ca":true},{"name":"Zhipeng Cai","is_ca":true},{"name":"Dekang Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006243725173338033,"gpt":0.2270362528958371,"spread":0.220792527722499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006968158,0.0005288571,0.0009406095,0.00164089,0.00129727,0.001240007,0.0009384284,0.001156055,0.004900102],"category_scores_gemma":[0.005296209,0.0005397334,0.001020581,0.004412056,0.001313903,0.002671715,0.001982617,0.001160877,0.0008767808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005017737,"about_ca_system_score_gemma":0.0005468774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002318605,"about_ca_topic_score_gemma":0.001864334,"domain_scores_codex":[0.9993829,0.0002322713,0.00003516564,0.0001569008,0.0001152298,0.00007763644],"domain_scores_gemma":[0.9960418,0.002928069,0.0002156661,0.000420973,0.0002365261,0.000157032],"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.0004919661,0.0001378512,0.001696031,0.000452813,0.00007149937,0.0005158956,0.0008119756,0.1304494,0.006560424,0.5171266,0.01241417,0.3292714],"study_design_scores_gemma":[0.0000247909,0.0000637684,0.0004231952,0.0000378376,0.00003308952,0.0001916638,0.00007207559,0.2637965,0.001946872,0.7237874,0.009601187,0.00002166788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07700977,0.002080202,0.9069874,0.0006871701,0.0001860925,0.0000859795,0.0004962714,0.001130353,0.01133674],"genre_scores_gemma":[0.3971783,0.002591128,0.5870802,0.0002299484,0.0003868522,0.0002179144,0.001236929,0.0005866779,0.01049199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004900102,"threshold_uncertainty_score":0.01639247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074892433","doi":"10.1016/j.ipl.2007.08.005","title":"Approximation and inapproximability results for maximum clique of disc graphs in high dimensions","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Clique; Mathematics; Approximation algorithm; Set (abstract data type); Euclidean geometry; Euclidean space; Time complexity; Space (punctuation); Independent set; Euclidean distance; Discrete mathematics; Graph; Computer science; Geometry","authors":[{"name":"Peyman Afshani","is_ca":true},{"name":"Hamed Hatami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01400968390451881,"gpt":0.278734077731017,"spread":0.2647243938264982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009136013,0.005957948,0.006631098,0.005781055,0.004499454,0.01104353,0.01406077,0.00643522,0.01382233],"category_scores_gemma":[0.0543543,0.003079986,0.004496695,0.00948178,0.006761577,0.02090231,0.009021281,0.01390593,0.002387447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008481152,"about_ca_system_score_gemma":0.004486593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006454252,"about_ca_topic_score_gemma":0.007487541,"domain_scores_codex":[0.9916806,0.002868744,0.0003065739,0.001560178,0.001756411,0.001827645],"domain_scores_gemma":[0.9305681,0.05533617,0.002868089,0.005969026,0.002100591,0.003157992],"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.006013601,0.002581799,0.01016636,0.003347413,0.0008061339,0.0004624832,0.002473106,0.3919572,0.006755308,0.4093305,0.07686062,0.08924552],"study_design_scores_gemma":[0.0003430034,0.00016293,0.0009693173,0.000129033,0.0002212024,0.0002281479,0.0003963767,0.6060913,0.001900804,0.3855767,0.003919283,0.00006189099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2943048,0.01634714,0.5678044,0.03017278,0.001172613,0.000834918,0.006685615,0.003104023,0.0795737],"genre_scores_gemma":[0.7758729,0.006788012,0.1880936,0.003439083,0.002488592,0.001123348,0.00578039,0.001208001,0.01520607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01406077,"threshold_uncertainty_score":0.06153542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1910560010","doi":"10.1016/j.ipl.2004.02.005","title":"Polynomial time quantum computation with advice","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University; University of Ottawa","funders":"","keywords":"Advice (programming); Computation; Quantum computer; Bounded function; Polynomial; Computer science; Quantum algorithm; Quantum; State (computer science); Discrete mathematics; Mathematics; Algorithm; Quantum mechanics; Physics; Mathematical analysis","authors":[{"name":"Harumichi Nishimura","is_ca":true},{"name":"Tomoyuki Yamakami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003628772144208344,"gpt":0.1975534397641265,"spread":0.1939246676199182,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008471504,0.0004855037,0.0007978494,0.0006040147,0.001172416,0.001322791,0.000936995,0.001154073,0.008821818],"category_scores_gemma":[0.007155732,0.0002766818,0.0004880434,0.0009596953,0.001314966,0.00199456,0.001597954,0.002179068,0.00185893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00155247,"about_ca_system_score_gemma":0.001732273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003004026,"about_ca_topic_score_gemma":0.004882233,"domain_scores_codex":[0.9989637,0.0001954496,0.00004098565,0.0001339139,0.0004549497,0.0002110188],"domain_scores_gemma":[0.9974681,0.001237041,0.00007143962,0.0006250105,0.0004574288,0.0001409583],"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.0005072412,0.0000919539,0.0007530198,0.0001803496,0.00002791577,0.000141108,0.0003024485,0.01174913,0.006523783,0.8619928,0.02052598,0.09720428],"study_design_scores_gemma":[0.00009527607,0.00002750616,0.0002034362,0.00001975395,0.00002501471,0.00005784222,0.00002249308,0.08861148,0.004501457,0.8975714,0.008849149,0.00001521807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1620185,0.000968829,0.6697317,0.01006013,0.001161215,0.0002253242,0.0005514957,0.006663563,0.1486192],"genre_scores_gemma":[0.8389003,0.0004756126,0.1231263,0.0009429395,0.0003947873,0.0001084712,0.0002531407,0.0005054229,0.03529293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008821818,"threshold_uncertainty_score":0.02951193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964180408","doi":"10.1016/j.ipl.2007.08.014","title":"Improved FPT algorithm for feedback vertex set problem in bipartite tournament","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"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":"Tournament; Bipartite graph; Vertex (graph theory); Feedback vertex set; Mathematics; Algorithm; Combinatorics; Set (abstract data type); Vertex cover; Feedback arc set; Approximation algorithm; Computer science; Graph","authors":[{"name":"Prashant Sasatte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01527569381448809,"gpt":0.254955030244869,"spread":0.2396793364303809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461317,0.001142444,0.002547422,0.001315277,0.00151332,0.002527985,0.003826592,0.002630597,0.01147412],"category_scores_gemma":[0.006193281,0.0004920217,0.001480213,0.002079001,0.0007496857,0.002980433,0.001835942,0.002177684,0.0012693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001999931,"about_ca_system_score_gemma":0.002807688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006295827,"about_ca_topic_score_gemma":0.005243391,"domain_scores_codex":[0.9979066,0.0004997966,0.0001115017,0.0005080615,0.0005101826,0.0004639499],"domain_scores_gemma":[0.9969132,0.001750729,0.0001345471,0.000527698,0.0004345559,0.0002391766],"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.001958509,0.001214207,0.002640978,0.0007424416,0.0002001376,0.0004847099,0.0002929019,0.3166898,0.009313174,0.05098274,0.06080863,0.5546718],"study_design_scores_gemma":[0.0003337873,0.0001550241,0.0003995028,0.00002939049,0.00005221389,0.0002046389,0.0000599999,0.95179,0.001809875,0.04254597,0.002599711,0.00001984341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09074248,0.00129917,0.8804411,0.001917384,0.0006730445,0.0005620232,0.001209051,0.004520351,0.01863535],"genre_scores_gemma":[0.438487,0.0003179744,0.5487474,0.0006691603,0.000397324,0.0007143174,0.002360997,0.0004456718,0.007860194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01147412,"threshold_uncertainty_score":0.0383848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049589900","doi":"10.1016/j.ipl.2008.09.006","title":"The relative neighbourhood graph is a part of every 30°-triangulation","year":2008,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Neighbourhood (mathematics); Combinatorics; Pitteway triangulation; Mathematics; Delaunay triangulation; Triangulation; Euclidean geometry; Graph; Surface triangulation; Discrete mathematics; Constrained Delaunay triangulation; Geometry; Mathematical analysis","authors":[{"name":"Julian Keil","is_ca":true},{"name":"Tzvetalin S. Vassilev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01415525648592204,"gpt":0.2178802028324236,"spread":0.2037249463465015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002220276,0.0004580574,0.0004207465,0.0008943144,0.001135028,0.001269451,0.0007929372,0.0007103095,0.01442006],"category_scores_gemma":[0.001413036,0.0004023838,0.0004610329,0.0006782331,0.0007949986,0.001544702,0.001166561,0.00116738,0.004220455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002667651,"about_ca_system_score_gemma":0.0004219438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001296885,"about_ca_topic_score_gemma":0.001550859,"domain_scores_codex":[0.9994912,0.00006508031,0.00002917486,0.000153492,0.0001970918,0.00006397999],"domain_scores_gemma":[0.9993198,0.0001314563,0.00007343785,0.0001796185,0.0002106223,0.00008516226],"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.0003588265,0.0001316806,0.004060508,0.000389426,0.00005873104,0.0007750764,0.0007972733,0.01354367,0.0618506,0.719555,0.01267225,0.185807],"study_design_scores_gemma":[0.00005927029,0.0002997004,0.009628172,0.000156703,0.00006288235,0.002114566,0.001656673,0.05813902,0.03565221,0.7386247,0.1534837,0.0001223357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1427997,0.0003432693,0.7457846,0.000638136,0.0005331003,0.000172018,0.001527004,0.0009041372,0.107298],"genre_scores_gemma":[0.6839496,0.0005708492,0.265494,0.0003287659,0.00009505521,0.0002779181,0.003813089,0.0009954065,0.04447528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01442006,"threshold_uncertainty_score":0.04823989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074482157","doi":"10.1016/j.ipl.2010.09.004","title":"Highly-fair bakery algorithm using symmetric tokens","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Food Supply Chain Traceability","field":"Agricultural and Biological Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Algorithm","authors":[{"name":"Alex Aravind","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01111684133219854,"gpt":0.2083102172990459,"spread":0.1971933759668474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003177375,0.0007673685,0.001833845,0.0015826,0.00206915,0.002783789,0.003550378,0.001913381,0.01240836],"category_scores_gemma":[0.009624103,0.0005710786,0.0008130442,0.001860684,0.001436628,0.005504401,0.003486119,0.001989237,0.001780518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001404225,"about_ca_system_score_gemma":0.004571913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004075284,"about_ca_topic_score_gemma":0.006634897,"domain_scores_codex":[0.9981503,0.0003691763,0.0001372557,0.000476842,0.0005319912,0.0003343759],"domain_scores_gemma":[0.9960427,0.00162608,0.0001411787,0.001384384,0.0005971026,0.000208538],"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.003899581,0.001092569,0.00344278,0.0002971456,0.0002087801,0.0002674112,0.0003394654,0.1114022,0.01376001,0.1788293,0.01810022,0.6683606],"study_design_scores_gemma":[0.0004969898,0.0002456477,0.0004367302,0.00002414327,0.00006966466,0.0001302739,0.0001033024,0.7668679,0.009678639,0.2181504,0.003750832,0.00004549668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09047324,0.0003957359,0.8963875,0.0009554145,0.0004187119,0.0003043004,0.0003124191,0.003543033,0.00720965],"genre_scores_gemma":[0.472442,0.0001083785,0.511941,0.0003236424,0.0001557191,0.00018219,0.000619222,0.0004819756,0.01374592],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01240836,"threshold_uncertainty_score":0.04151005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093941744","doi":"10.1016/s0020-0190(03)00228-x","title":"From a simple elimination ordering to a strong elimination ordering in linear time","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Simple (philosophy); Chordal graph; Mathematics; Time complexity; Graph; Computer science; Combinatorics; Algorithm","authors":[{"name":"Joe Sawada","is_ca":true},{"name":"Jeremy Spinrad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01366666184045553,"gpt":0.2796372488493467,"spread":0.2659705870088912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435296,0.0007923265,0.0007850567,0.001001524,0.001401176,0.00280258,0.001230078,0.0007838099,0.01040063],"category_scores_gemma":[0.004934496,0.0006776904,0.001011178,0.001925708,0.001701073,0.00690529,0.001979602,0.003102125,0.001658894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212181,"about_ca_system_score_gemma":0.002309174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002674045,"about_ca_topic_score_gemma":0.005525085,"domain_scores_codex":[0.9987611,0.0003277145,0.0000868776,0.0002143796,0.0003480861,0.0002617628],"domain_scores_gemma":[0.9949656,0.003063929,0.0002508213,0.000839212,0.000563953,0.0003164268],"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.0007482482,0.0003497702,0.0007141109,0.0004449639,0.00005846467,0.000253536,0.000725484,0.02342243,0.00801007,0.7265176,0.03200543,0.2067499],"study_design_scores_gemma":[0.0000816464,0.0000711221,0.0001486087,0.00001797538,0.00003537331,0.00008410359,0.00009930344,0.03395826,0.002374391,0.9559115,0.00719836,0.00001936684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1165197,0.0008054044,0.8216427,0.003826941,0.0005598551,0.0001906298,0.0009458712,0.003677782,0.05183109],"genre_scores_gemma":[0.5037665,0.0007945871,0.4590153,0.00141954,0.0005208625,0.0002223639,0.00151865,0.001421235,0.03132096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01040063,"threshold_uncertainty_score":0.03479356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970247635","doi":"10.1016/j.ipl.2010.12.014","title":"Using 5-isogenies to quintuple points on elliptic curves","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Elliptic curve; Supersingular elliptic curve; Computer science; Pure mathematics","authors":[{"name":"Dustin Moody","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01480046710351335,"gpt":0.2552411734903963,"spread":0.240440706386883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497033,0.0012579,0.0008595998,0.002954131,0.00139506,0.003206341,0.000903873,0.00115086,0.008087191],"category_scores_gemma":[0.003194224,0.0005120448,0.001192051,0.001811572,0.002904627,0.005017273,0.004010425,0.002403716,0.00223578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052081,"about_ca_system_score_gemma":0.0003672071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003804372,"about_ca_topic_score_gemma":0.0003423024,"domain_scores_codex":[0.9990937,0.0002666229,0.00006776845,0.0001474113,0.0002302731,0.0001943675],"domain_scores_gemma":[0.9991276,0.0002475101,0.00009649598,0.0002779942,0.0001329119,0.000117508],"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.0002357631,0.00006592592,0.0005139006,0.00006716884,0.00002003161,0.0003809168,0.0006170361,0.00292228,0.003558192,0.9505193,0.001551128,0.03954828],"study_design_scores_gemma":[0.00005869389,0.0001418528,0.0003710379,0.00007128806,0.00003000333,0.0003262851,0.0003060728,0.01001104,0.0056308,0.9696518,0.0133541,0.00004711148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5283855,0.002021457,0.3505675,0.002017019,0.001963607,0.0001754748,0.0001344965,0.00116368,0.1135713],"genre_scores_gemma":[0.9268255,0.001302639,0.04759368,0.0003585917,0.0005213634,0.00006872162,0.0001060317,0.0003671457,0.02285618],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008087191,"threshold_uncertainty_score":0.02705431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045037050","doi":"10.1016/j.ipl.2010.05.019","title":"Upper signed k-domination in a general graph","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Domination analysis; Mathematics; Upper and lower bounds; Graph; Computer science; Discrete mathematics; Vertex (graph theory)","authors":[{"name":"Dejan Delić","is_ca":true},{"name":"Changping Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007070255514333437,"gpt":0.258272288875039,"spread":0.2512020333607056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008527856,0.0005880472,0.0009431824,0.001981925,0.001930257,0.002988171,0.001537516,0.001124023,0.008715075],"category_scores_gemma":[0.005084471,0.0004340846,0.0006036245,0.001740543,0.001932119,0.003757482,0.001962396,0.001680591,0.0009060994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113781,"about_ca_system_score_gemma":0.0007163931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001040926,"about_ca_topic_score_gemma":0.001970094,"domain_scores_codex":[0.998973,0.0002155757,0.00005524222,0.0002222274,0.0002921583,0.0002417931],"domain_scores_gemma":[0.9943087,0.003124405,0.0006531168,0.0005630928,0.0006248516,0.0007258331],"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.0003836517,0.0001314754,0.001860759,0.0002466081,0.00004092512,0.0009789754,0.0009230611,0.01476604,0.01328603,0.9366478,0.004721831,0.02601285],"study_design_scores_gemma":[0.0000438241,0.00004200551,0.001187883,0.00003614108,0.00002379423,0.0005162722,0.0002218405,0.04929334,0.003270386,0.9421041,0.00322846,0.00003196939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7867482,0.0005575956,0.1404189,0.001529475,0.0001410113,0.00009047973,0.0006772481,0.0003407295,0.06949632],"genre_scores_gemma":[0.9519784,0.0003248134,0.0224035,0.0003834014,0.00009103786,0.00009631465,0.0004724687,0.0001574482,0.02409253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008715075,"threshold_uncertainty_score":0.02915478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071709128","doi":"10.1016/j.ipl.2012.02.004","title":"Improved approximation algorithms for the robust fault-tolerant facility location problem","year":2012,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Facility location problem; Subroutine; Rounding; Approximation algorithm; Algorithm; Computer science; Key (lock); Mathematics; Mathematical optimization","authors":[{"name":"Yu Li","is_ca":false},{"name":"Dachuan Xu","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Naihua Xiu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0325648758186621,"gpt":0.2328679527158756,"spread":0.2003030768972135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348499,0.001423503,0.002390763,0.001149268,0.0007204974,0.001866865,0.003814802,0.00218024,0.004700752],"category_scores_gemma":[0.01206459,0.0007073858,0.001146977,0.002059746,0.0009791231,0.003249121,0.002117189,0.002704849,0.0007947372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002307351,"about_ca_system_score_gemma":0.002012894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00863924,"about_ca_topic_score_gemma":0.005917783,"domain_scores_codex":[0.9982467,0.0005777774,0.00008756373,0.0003091322,0.0004643865,0.0003145092],"domain_scores_gemma":[0.9949169,0.003363824,0.0004158359,0.0006165245,0.000495707,0.0001911883],"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.0002662929,0.0001022286,0.0003700963,0.0001055696,0.00004285439,0.00004659978,0.00005289984,0.9313957,0.0006120834,0.0166116,0.003307995,0.04708603],"study_design_scores_gemma":[0.00002902749,0.00002309808,0.00005361321,0.000005822259,0.000008391516,0.00001517444,0.00001043722,0.9904476,0.0001492939,0.008926154,0.0003270252,0.000004308815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01839462,0.0006646757,0.9766706,0.0005039625,0.0001121703,0.00005746095,0.0001754193,0.0006067015,0.002814363],"genre_scores_gemma":[0.5302442,0.000669088,0.4627961,0.0002950621,0.0002283345,0.0002441608,0.0009076702,0.0003023942,0.004313074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00863924,"threshold_uncertainty_score":0.01717794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000986355","doi":"10.1016/s0020-0190(01)00231-9","title":"On enumeration of catastrophic fault patterns","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Enumeration; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","authors":[{"name":"Soumen Maity","is_ca":false},{"name":"Bimal Roy","is_ca":false},{"name":"Amiya Nayak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009894622370969868,"gpt":0.2006876457793229,"spread":0.190793023408353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007035895,0.0006856697,0.0008861219,0.001631254,0.0008099473,0.00166621,0.001211837,0.001140424,0.006129548],"category_scores_gemma":[0.01293974,0.0005069712,0.0007202863,0.002039174,0.001082326,0.002735474,0.001938282,0.001342738,0.000652249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005968477,"about_ca_system_score_gemma":0.0006551679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000771334,"about_ca_topic_score_gemma":0.001425105,"domain_scores_codex":[0.9991685,0.0002416089,0.00007012444,0.0001309377,0.0002522529,0.0001364709],"domain_scores_gemma":[0.9905887,0.006865363,0.0005591535,0.0009123553,0.0008128397,0.0002617028],"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.0004496688,0.000142104,0.005402778,0.0005122771,0.00007770165,0.0004582656,0.0004127244,0.1379652,0.006250289,0.6426857,0.01751747,0.1881259],"study_design_scores_gemma":[0.00002348202,0.00004355341,0.0005071412,0.00005073606,0.00001850905,0.0002305637,0.00007361777,0.21359,0.001556148,0.7816882,0.002202281,0.0000158098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2699005,0.0009058736,0.6850488,0.00189177,0.0002823859,0.0001300156,0.001323307,0.001079109,0.03943821],"genre_scores_gemma":[0.832767,0.000957834,0.1500262,0.0006031073,0.0002077683,0.000233814,0.00257168,0.0002907674,0.01234186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006129548,"threshold_uncertainty_score":0.02050543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027107615","doi":"10.1016/j.ipl.2014.05.005","title":"Parallelization of entanglement-resistant multi-prover interactive proofs","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canada Foundation for Innovation; Ontario Research Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Gas meter prover; Soundness; Mathematical proof; Quantum entanglement; Computer science; Theoretical computer science; Proof assistant; Programming language; Mathematics; Quantum; Quantum mechanics; Physics","authors":[{"name":"Tsuyoshi Ito","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007859988746605873,"gpt":0.2420452847884894,"spread":0.2341852960418836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00439193,0.001620952,0.002705578,0.001298121,0.002081892,0.004052088,0.004231415,0.001783493,0.02230495],"category_scores_gemma":[0.01713728,0.001192321,0.001936481,0.001582272,0.002210684,0.00514612,0.007788299,0.003305698,0.003634322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001689398,"about_ca_system_score_gemma":0.004322551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001237926,"about_ca_topic_score_gemma":0.002456307,"domain_scores_codex":[0.9873045,0.003262467,0.0006960364,0.001820586,0.004674266,0.002242046],"domain_scores_gemma":[0.9720922,0.01284101,0.0009246607,0.01069323,0.002636893,0.0008120792],"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.008382523,0.001638099,0.002276229,0.001234774,0.0005488257,0.001336258,0.001008543,0.2393383,0.06408134,0.2969792,0.03139325,0.3517827],"study_design_scores_gemma":[0.0005617126,0.0003125356,0.0003868597,0.00004516372,0.0001049252,0.0002484585,0.00009446859,0.7942274,0.03854897,0.1596552,0.00573966,0.00007474263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09828404,0.0007180235,0.8569111,0.001507897,0.0006624105,0.0005265435,0.0007168364,0.01252964,0.02814352],"genre_scores_gemma":[0.7981402,0.000212988,0.189636,0.0003688715,0.0003254891,0.0003159645,0.0006850414,0.001280254,0.009035224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02230495,"threshold_uncertainty_score":0.07461751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021931635","doi":"10.1016/j.ipl.2010.10.002","title":"Developing fault-tolerant distributed loops","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Circulant matrix; Computer science; Fault tolerance; Loop (graph theory); Distributed computing; Node (physics); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Engineering","authors":[{"name":"Abdel Aziz Farrag","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0102807948615451,"gpt":0.2269768062843992,"spread":0.2166960114228541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535,0.0004013175,0.0004611727,0.0003396776,0.0003460667,0.0005049259,0.001056433,0.000660767,0.002118568],"category_scores_gemma":[0.002754756,0.0002842037,0.0002416667,0.0002443199,0.0005132684,0.0008155762,0.001070698,0.0006000615,0.0002914254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004517318,"about_ca_system_score_gemma":0.0004780823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005149969,"about_ca_topic_score_gemma":0.0006801981,"domain_scores_codex":[0.999751,0.00005268106,0.00001477717,0.00005783311,0.0000772686,0.00004647474],"domain_scores_gemma":[0.9987172,0.0006296145,0.0001464262,0.0001850404,0.000255345,0.00006632111],"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.0001959716,0.0001622773,0.001003514,0.0001927436,0.00003422315,0.0002284059,0.0003154533,0.7587311,0.04599388,0.0438986,0.001460532,0.1477833],"study_design_scores_gemma":[0.00003458182,0.0001632784,0.00006492034,0.000008328893,0.00001247012,0.00003343248,0.00002971278,0.9701376,0.01132476,0.01664918,0.001537073,0.00000475868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09267981,0.0001168775,0.9023243,0.0001521458,0.0000606168,0.00008784309,0.00002147946,0.0009292373,0.003627788],"genre_scores_gemma":[0.8483037,0.0001094537,0.1478363,0.0001028847,0.00003082865,0.0001084461,0.00006584755,0.0001105584,0.003332073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002118568,"threshold_uncertainty_score":0.00708729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060313721","doi":"10.1016/j.ipl.2007.08.008","title":"Flying over a polyhedral terrain","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Terrain; Approximation algorithm; Shortest path problem; Combinatorics; Metric (unit); Mathematics; Obstacle; Euclidean shortest path; Euclidean space; Computational geometry; Euclidean geometry; Path (computing); Space (punctuation); Euclidean distance; Metric space; Algorithm; Computer science; Discrete mathematics; K shortest path routing; Graph; Geometry; Geography","authors":[{"name":"Hamid Zarrabi-Zadeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007763657452015505,"gpt":0.2452831917936056,"spread":0.2375195343415901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009934571,0.0002367201,0.0003767539,0.0003207001,0.0007252541,0.0005349536,0.0005394997,0.0006724125,0.002356386],"category_scores_gemma":[0.0005364637,0.0002275839,0.0003316525,0.0004318357,0.0004502652,0.00053924,0.0007528455,0.0004941315,0.0002051465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003053146,"about_ca_system_score_gemma":0.0003438583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007903563,"about_ca_topic_score_gemma":0.00576585,"domain_scores_codex":[0.9999079,0.00001312512,0.000002799839,0.00002047267,0.00003454099,0.00002120103],"domain_scores_gemma":[0.9998351,0.0000638194,0.0000166514,0.00003058309,0.00002032102,0.00003351449],"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.0002963747,0.00007793074,0.002786421,0.00008293059,0.00009597573,0.0009012505,0.0002075127,0.9182751,0.0278822,0.0134149,0.00249556,0.03348381],"study_design_scores_gemma":[0.00001577052,0.00005229126,0.0008269187,0.000004698105,0.000007534219,0.00008298132,0.00007842545,0.993835,0.0009832634,0.003568506,0.0005373386,0.00000733862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7022244,0.0002678779,0.279851,0.0006782847,0.0001978412,0.00008495706,0.0004825408,0.0005041315,0.01570897],"genre_scores_gemma":[0.9458067,0.0001628146,0.05060913,0.0000550638,0.00003026383,0.00001747602,0.0002954765,0.00004234122,0.002980859],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007903563,"threshold_uncertainty_score":0.01571512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4323659995","doi":"10.1016/j.ipl.2023.106391","title":"Optimal circle search despite the presence of faulty robots","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Search and rescue; Computer science; Linear search; Crash; Search algorithm; Algorithm; Mobile robot; Artificial intelligence","authors":[{"name":"Konstantinos Georgiou","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Nikos Leonardos","is_ca":false},{"name":"Aris Pagourtzis","is_ca":false},{"name":"Ioannis Papaioannou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0242194292745434,"gpt":0.2745886169192998,"spread":0.2503691876447564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009101216,0.0004331306,0.001169682,0.0005788998,0.0006990833,0.0009267379,0.0009164839,0.001975077,0.00185757],"category_scores_gemma":[0.008788309,0.0004524903,0.0002283603,0.0007959044,0.001355038,0.001491765,0.001196805,0.0006986018,0.0004880476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007663034,"about_ca_system_score_gemma":0.0009410643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003449551,"about_ca_topic_score_gemma":0.00229313,"domain_scores_codex":[0.9995289,0.000140139,0.00002188976,0.000107712,0.0001164248,0.0000849104],"domain_scores_gemma":[0.9948257,0.003171263,0.0005215979,0.0005192119,0.0006298293,0.0003324182],"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.0009608404,0.00006209468,0.0008313811,0.0001107344,0.00004849984,0.0003095501,0.0002144831,0.9146909,0.006982598,0.0441769,0.003454765,0.02815728],"study_design_scores_gemma":[0.00003358688,0.00005452619,0.0002082991,0.000004893571,0.000004853512,0.00003971415,0.00002887607,0.9860848,0.00145678,0.01165362,0.0004197511,0.00001029954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4767106,0.001113182,0.4943546,0.00215322,0.0001899442,0.000052201,0.0001395373,0.001034807,0.02425194],"genre_scores_gemma":[0.9686581,0.00007572864,0.02772972,0.00006810019,0.00002157941,0.00002368954,0.00004968973,0.00006076384,0.003312683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003449551,"threshold_uncertainty_score":0.006858945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107945074","doi":"10.1016/j.ipl.2006.06.015","title":"On the All-Farthest-Segments problem for a planar set of points","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Set (abstract data type); Planar; Combinatorics; Computer science; Mathematics; Computational geometry; Algorithm; Computer graphics (images); Programming language","authors":[{"name":"Asish Mukhopadhyay","is_ca":true},{"name":"Samidh Chatterjee","is_ca":true},{"name":"Benjamin Lafreniere","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01560613353605302,"gpt":0.2338658622227816,"spread":0.2182597286867285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141619,0.002198803,0.003770696,0.001939397,0.001777108,0.0031183,0.004375163,0.00706769,0.02100974],"category_scores_gemma":[0.01220767,0.001590631,0.001819649,0.002684268,0.0026893,0.007177208,0.00415703,0.003404271,0.001705592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00130515,"about_ca_system_score_gemma":0.001252025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00668337,"about_ca_topic_score_gemma":0.005135156,"domain_scores_codex":[0.9988962,0.0003842975,0.00006444065,0.0003081776,0.0002081999,0.0001386786],"domain_scores_gemma":[0.994093,0.004722564,0.0003506707,0.0003316143,0.0002510515,0.0002511602],"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.0006633477,0.0002755641,0.0009837039,0.0008218237,0.00009234475,0.0003521766,0.0003972324,0.7531407,0.001504595,0.1385471,0.01836629,0.08485524],"study_design_scores_gemma":[0.0001078013,0.0001167383,0.0002190938,0.00007057986,0.00002375735,0.00009651697,0.0002271224,0.8068912,0.0005277959,0.1888134,0.00288255,0.00002344403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09382423,0.001512597,0.8759166,0.003777332,0.0002335632,0.0004203142,0.001694853,0.0004643381,0.02215609],"genre_scores_gemma":[0.3974806,0.002177243,0.5554804,0.0007429427,0.0006872768,0.0006316759,0.005178423,0.001065727,0.03655577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02100974,"threshold_uncertainty_score":0.07028461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}