{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718746,0.0001396787,0.0001245895,0.00009736826,0.0002537379,0.0006630765,0.0004164203,0.00003853124,0.00000118307],"category_scores_gemma":[0.0000213142,0.0001136025,0.00002421006,0.000509926,0.00004836665,0.005139667,0.00004638548,0.0001246366,0.00007387179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004771828,"about_ca_system_score_gemma":0.0001373377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003072404,"about_ca_topic_score_gemma":0.000002495108,"domain_scores_codex":[0.9988219,0.000009032993,0.0003603386,0.0001509577,0.0003799651,0.0002778459],"domain_scores_gemma":[0.9992697,0.000008783256,0.0002717462,0.0002187472,0.0001639848,0.00006703754],"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.0001116171,0.0001533968,0.001365148,0.001112313,0.00007048393,0.0001263578,0.022367,0.1479543,0.004555457,0.03882858,0.002703867,0.7806515],"study_design_scores_gemma":[0.02258615,0.0006857519,0.01766514,0.00673693,0.00005653234,0.003059762,0.001655837,0.5943952,0.01590413,0.001800177,0.3307933,0.004661006],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04918167,0.00002108739,0.9442424,0.003917927,0.0001097633,0.0001223244,0.000002471654,0.0002993443,0.002103066],"genre_scores_gemma":[0.9511752,4.738042e-7,0.04385436,0.004886436,0.00003704535,0.00001353453,0.00001701385,0.000005108974,0.00001089527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9019935,"threshold_uncertainty_score":0.6394063,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002619623,0.0001009529,0.000108705,0.0002929765,0.0001885211,0.0007612088,0.0004226921,0.0000355329,0.00002701773],"category_scores_gemma":[0.00003701741,0.00008558577,0.00005748196,0.0009997587,0.000022058,0.006225945,0.0000594862,0.00009473004,0.0001045891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002913989,"about_ca_system_score_gemma":0.00004111243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008520559,"about_ca_topic_score_gemma":5.013276e-7,"domain_scores_codex":[0.9990841,0.00003039117,0.0002651256,0.0001318342,0.0002995869,0.0001890263],"domain_scores_gemma":[0.9993524,0.00001698016,0.0001752218,0.0003252914,0.00007103628,0.00005907811],"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.00001226235,0.00009973594,0.009207245,0.0001558711,0.0002904043,0.00001221767,0.02229653,0.0279057,0.00163917,0.02407226,0.02513928,0.8891693],"study_design_scores_gemma":[0.0006290104,0.00002039677,0.005888114,0.00004676618,0.00008057831,0.00002209924,0.0002228993,0.6652657,0.002031127,0.0006936958,0.3245089,0.0005906934],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005632772,0.00004848624,0.9899861,0.001699063,0.0001269289,0.00004898944,0.000001515953,0.00016988,0.002286329],"genre_scores_gemma":[0.797756,0.000004761312,0.1919169,0.0101952,0.00003015328,0.00001300324,0.00003521869,0.000005585204,0.00004324734],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8885786,"threshold_uncertainty_score":0.7340354,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005260255,0.0002000143,0.0001832653,0.0003346469,0.0003118305,0.0003187366,0.000773643,0.00006706703,9.39463e-7],"category_scores_gemma":[0.0001867155,0.0001660904,0.0000341851,0.0006076421,0.0001364395,0.008582957,0.00008772465,0.000199398,0.00001493871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001300907,"about_ca_system_score_gemma":0.00007886955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000128908,"about_ca_topic_score_gemma":0.000009886084,"domain_scores_codex":[0.9985164,0.000009525035,0.0004230453,0.0002050976,0.0003974451,0.0004484273],"domain_scores_gemma":[0.9987265,0.0002018088,0.0004805237,0.0003914232,0.0001351425,0.0000645691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002731575,0.0001243903,0.001875808,0.003507549,0.0001283907,0.00005290129,0.02087218,0.03737059,0.005920687,0.03704459,0.01829896,0.8745308],"study_design_scores_gemma":[0.01224632,0.001546316,0.007070099,0.008734868,0.0001826177,0.0005424321,0.01160329,0.2862026,0.1838399,0.009997192,0.4712189,0.006815449],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01847613,0.0001236824,0.9731841,0.006396667,0.0000986366,0.0003366523,0.00001186418,0.0008425626,0.0005297109],"genre_scores_gemma":[0.6509243,0.0000141754,0.3404562,0.00845791,0.0000403113,0.00001416665,0.00007129673,0.00001347933,0.000008105495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8677154,"threshold_uncertainty_score":0.6772972,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0001950736,0.0001768377,0.0001465159,0.0001418832,0.001029778,0.002153128,0.001377355,0.00006565017,0.00001689875],"category_scores_gemma":[0.00006750499,0.0001414382,0.00004623482,0.00009710503,0.00008833708,0.01549723,0.0006804839,0.0002002322,0.0001659697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004026932,"about_ca_system_score_gemma":0.00004829131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003206445,"about_ca_topic_score_gemma":8.237161e-7,"domain_scores_codex":[0.9986783,0.00002263353,0.0003745207,0.0002126436,0.000429655,0.0002822304],"domain_scores_gemma":[0.9982379,0.0000187374,0.0005368549,0.0009386897,0.0001668744,0.0001009645],"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.00002388313,0.00004374138,0.001290673,0.000105354,0.00001213015,0.000007888279,0.003111162,0.0003492171,0.002140868,0.001418265,0.02494893,0.9665479],"study_design_scores_gemma":[0.001636462,0.00005654516,0.01759504,0.0007243695,0.00001207949,0.00003962217,0.0001800724,0.7163879,0.006266118,0.0003560518,0.2560188,0.0007270184],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0188138,0.00002203922,0.9727694,0.004115354,0.0006841915,0.0001329698,0.000007989303,0.0002415354,0.003212664],"genre_scores_gemma":[0.937162,0.000005709324,0.05658754,0.005864681,0.0001445238,0.00002443578,0.000078692,0.00001115571,0.0001213068],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9658208,"threshold_uncertainty_score":0.9988827,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003697507,0.0001063161,0.0000782913,0.000579681,0.0001184422,0.0002906561,0.0001737445,0.00004864456,0.000006547107],"category_scores_gemma":[0.00007494896,0.0001081745,0.00003151259,0.000828624,0.00001314566,0.002732573,0.00002183466,0.0001558997,0.00006587302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001470199,"about_ca_system_score_gemma":0.00007254849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006790794,"about_ca_topic_score_gemma":0.000006335499,"domain_scores_codex":[0.9990016,0.00005518752,0.0003084,0.0001504165,0.0003142431,0.000170147],"domain_scores_gemma":[0.999578,0.00003129016,0.0001462856,0.0001344139,0.00007014731,0.00003985242],"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.0000536477,0.000135871,0.000759432,0.0001170152,0.0000113359,0.00001199815,0.01222022,0.1146241,0.003992071,0.0332527,0.002560856,0.8322608],"study_design_scores_gemma":[0.006381866,0.0006093936,0.03226685,0.0007430492,0.00001878508,0.000390022,0.000905651,0.7657507,0.05520372,0.06610902,0.06941857,0.002202348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2050064,0.00001160979,0.789466,0.001574383,0.0005427529,0.0001433296,6.889512e-7,0.0001101931,0.003144596],"genre_scores_gemma":[0.9819676,0.000001294016,0.01272837,0.005242375,0.00001252547,0.00002161752,0.00001342527,0.000003376497,0.000009376617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8300585,"threshold_uncertainty_score":0.4411229,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002020565,0.00004018285,0.00004152971,0.00003220837,0.0001541034,0.0002518224,0.0002011061,0.000007834926,3.876077e-7],"category_scores_gemma":[0.000007208823,0.00002716898,0.000009715919,0.0001064141,0.0001384422,0.001456434,0.00004953757,0.00003273878,0.000003478737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006663359,"about_ca_system_score_gemma":0.00001233311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002815822,"about_ca_topic_score_gemma":0.000001346844,"domain_scores_codex":[0.9995706,0.00001115984,0.0001796765,0.00003804545,0.0001147996,0.00008568558],"domain_scores_gemma":[0.9996824,0.00003010759,0.0001388567,0.000103589,0.00003450158,0.00001050207],"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.000007534363,0.00001114835,0.0004948795,0.0001237074,0.000005368018,6.050278e-7,0.003499109,0.0008214387,0.00290719,0.1327277,0.003880219,0.8555211],"study_design_scores_gemma":[0.0007504844,0.00003279166,0.04747141,0.0001022287,0.00000526497,0.00003786202,0.0002386179,0.7434259,0.01306679,0.1669155,0.02759849,0.0003546078],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3494722,0.00008658624,0.6445156,0.004831857,0.00005299733,0.00005385003,0.00000155413,0.00008885411,0.0008964755],"genre_scores_gemma":[0.9916698,0.000002063949,0.006994813,0.001311184,0.000007966822,0.000002096216,0.000001955458,0.000001096026,0.000009028364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8551665,"threshold_uncertainty_score":0.242833,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000182362,0.0001210362,0.00009545462,0.0002469417,0.0001881983,0.0008709763,0.0005447038,0.00004380798,0.00001159495],"category_scores_gemma":[0.00003730012,0.0001094693,0.000032369,0.0004564126,0.00004436968,0.005991455,0.0001034986,0.000134659,0.00005034006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004105688,"about_ca_system_score_gemma":0.00007358736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001393519,"about_ca_topic_score_gemma":0.000001792835,"domain_scores_codex":[0.999011,0.00002438526,0.0002437726,0.0001321099,0.0003164781,0.0002721973],"domain_scores_gemma":[0.9992952,0.00000849706,0.0001766908,0.0002476126,0.000169126,0.0001028213],"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.00002314263,0.0001186451,0.0006807061,0.0004285962,0.00003515571,0.00002382833,0.1454022,0.01322974,0.001143007,0.0149489,0.01085044,0.8131157],"study_design_scores_gemma":[0.001479787,0.0001533098,0.001569493,0.0002006022,0.00001042546,0.00007583824,0.001201466,0.9712354,0.005835868,0.001456687,0.01591752,0.0008635778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00278315,0.00001449721,0.9806233,0.0140455,0.0001285395,0.0001521453,9.619714e-7,0.0003607599,0.001891144],"genre_scores_gemma":[0.8133296,0.000009370269,0.1706893,0.01568128,0.00004005836,0.00004852412,0.00002061521,0.000009482251,0.0001718029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9580057,"threshold_uncertainty_score":0.8398845,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002716691,0.000142539,0.0001063322,0.0001874383,0.0002992265,0.0006358357,0.0003775956,0.0001010516,0.00001385287],"category_scores_gemma":[0.000108936,0.0001332469,0.00005946844,0.0002381959,0.00003785888,0.005783152,0.00005648945,0.0002106701,0.0003256763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000020698,"about_ca_system_score_gemma":0.00005938399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006010293,"about_ca_topic_score_gemma":0.000001634771,"domain_scores_codex":[0.9989353,0.00001326784,0.0003542863,0.000175126,0.0002593589,0.0002626793],"domain_scores_gemma":[0.9991632,0.00005063221,0.0002578543,0.0002191018,0.0002254953,0.00008378887],"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.00002274793,0.000032951,0.00003682097,0.0001865086,0.00000770126,9.917679e-7,0.002790701,0.0001881224,0.05256335,0.0001552662,0.02569164,0.9183232],"study_design_scores_gemma":[0.004499476,0.0001655908,0.001284104,0.0005894667,0.00005352194,0.0001795934,0.0009549716,0.3948052,0.2783375,0.005851382,0.3113884,0.001890822],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.22772,0.000007527934,0.7616207,0.007775202,0.0008298785,0.0003715506,0.0000166032,0.000397465,0.001261062],"genre_scores_gemma":[0.8805568,0.000003996096,0.1022989,0.01649211,0.0001764136,0.0001949106,0.0001732848,0.0000132324,0.00009035548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9164324,"threshold_uncertainty_score":0.6131378,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002974424,0.00008745289,0.0001650005,0.0001137281,0.00005440015,0.00007874562,0.0003240584,0.00004113833,0.000002811811],"category_scores_gemma":[0.00005604521,0.00007980404,0.0000342451,0.0005605138,0.000049607,0.002085092,0.00002253158,0.00006776733,0.000003549366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001893897,"about_ca_system_score_gemma":0.00009126373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008227691,"about_ca_topic_score_gemma":1.669917e-7,"domain_scores_codex":[0.9989128,0.00003091901,0.0005208774,0.0000868851,0.0003070532,0.0001415164],"domain_scores_gemma":[0.9989143,0.00001818215,0.0005164267,0.0002202128,0.000298887,0.00003201249],"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.000009109413,0.00008326096,0.0003533772,0.0009369712,0.00002112434,0.000001990463,0.004891572,0.004043044,0.002117042,0.01059223,0.002456202,0.9744941],"study_design_scores_gemma":[0.002836013,0.0001755001,0.002310257,0.001589649,0.00002556031,0.0001180166,0.0009381961,0.5790603,0.3215468,0.0008136762,0.08963238,0.0009536783],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007334273,0.00005771975,0.99009,0.0002038622,0.0002355795,0.0001236771,0.000008427782,0.00004686847,0.001899665],"genre_scores_gemma":[0.9567761,7.951841e-7,0.04277131,0.0004075267,0.000007877903,0.0000118027,0.00001037155,0.00000297754,0.0000112148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9735404,"threshold_uncertainty_score":0.3254314,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003797343,0.0001177402,0.00008237179,0.0001914078,0.0003990559,0.0004889725,0.0007225328,0.0000324862,0.00002326622],"category_scores_gemma":[0.0001114926,0.00008021254,0.00003729051,0.0006330619,0.0001458633,0.003051249,0.0000926865,0.0002422767,0.0005302826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005461674,"about_ca_system_score_gemma":0.00002549747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002020454,"about_ca_topic_score_gemma":3.122689e-7,"domain_scores_codex":[0.9988226,0.0000673707,0.0002464021,0.0001299254,0.0004444705,0.0002891862],"domain_scores_gemma":[0.9991443,0.0002049246,0.0001668477,0.000313818,0.0001212194,0.0000489026],"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.00005377824,0.00008488855,0.0001561199,0.0002121848,0.00002966031,0.00001550555,0.05251423,0.003949943,0.002586592,0.3251785,0.03140154,0.583817],"study_design_scores_gemma":[0.002255924,0.0003363113,0.0008852417,0.0006202376,0.00001568719,0.0001866678,0.001182499,0.7551307,0.02125311,0.06286535,0.1537462,0.001522073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01498746,0.00004469759,0.9000389,0.07192653,0.0001092422,0.0004687941,0.000003149334,0.0003606322,0.01206061],"genre_scores_gemma":[0.9649156,0.000005560307,0.01428329,0.0205969,0.00002687742,0.00007075528,0.000002084358,0.000006766081,0.00009219741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9499281,"threshold_uncertainty_score":0.6815886,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966135,0.00007202821,0.00004600768,0.00008181885,0.0002011667,0.0003986766,0.0002152703,0.00002592651,0.000005834715],"category_scores_gemma":[0.0000325636,0.0000496844,0.00001547065,0.0001732844,0.0000506606,0.00193987,0.00003839514,0.00009690038,0.00002566364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003120501,"about_ca_system_score_gemma":0.0000164112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002708935,"about_ca_topic_score_gemma":4.078988e-7,"domain_scores_codex":[0.9993606,0.00001457662,0.00017267,0.00007268322,0.0001864024,0.0001930773],"domain_scores_gemma":[0.9996065,0.00009128068,0.000110922,0.0001320607,0.00002174163,0.00003751747],"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.00002153711,0.00001333946,0.0001619763,0.00005625524,0.000005649648,0.000004365324,0.01224849,0.0001259596,0.002472069,0.05148727,0.005752912,0.9276502],"study_design_scores_gemma":[0.002900564,0.0002287019,0.1901564,0.0009466009,0.00003112129,0.0003074997,0.002707449,0.5905929,0.0418591,0.02178547,0.1467272,0.00175703],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2106113,0.00001119044,0.7759774,0.01121154,0.0001520235,0.00008281942,0.000001042888,0.0001326226,0.001820141],"genre_scores_gemma":[0.9671886,0.000001214493,0.0030984,0.02965492,0.0000394225,0.000003592621,0.000004825811,0.000002236299,0.000006817941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9258931,"threshold_uncertainty_score":0.3844447,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000152392,0.0001347957,0.0001844289,0.00008281021,0.0002161767,0.00006233797,0.00009553017,0.00004773403,0.00005130641],"category_scores_gemma":[0.000836537,0.0001176313,0.0000451862,0.0002430195,0.00005714982,0.0008430171,0.00001175605,0.00006746611,0.000009195472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006941874,"about_ca_system_score_gemma":0.0001230251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001466724,"about_ca_topic_score_gemma":7.464773e-7,"domain_scores_codex":[0.9990192,0.00002171785,0.0004510936,0.00008411546,0.0002418019,0.0001820928],"domain_scores_gemma":[0.9985662,0.000300302,0.000615101,0.0001526744,0.0003202769,0.00004540859],"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.0001384548,0.0009399069,0.0006170716,0.01064613,0.0005355277,0.000007807236,0.1111194,0.007406382,0.01548238,0.5425857,0.08689816,0.2236231],"study_design_scores_gemma":[0.01427561,0.0004024385,0.00002852851,0.002896169,0.0007122673,0.0004828688,0.02432163,0.3674964,0.05184215,0.4908772,0.04374479,0.002919869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05060162,0.000002061368,0.9476675,0.0001374625,0.0000797234,0.00040367,0.00004253134,0.00008462265,0.0009807437],"genre_scores_gemma":[0.04728706,3.336072e-7,0.9519085,0.0004736524,0.00002326958,0.0001784528,0.00004585436,0.00002111684,0.00006173506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3600901,"threshold_uncertainty_score":0.4796863,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001446259,0.0001219243,0.00009248759,0.0001708163,0.0004663058,0.0005572892,0.0006173943,0.00004615164,0.000009583468],"category_scores_gemma":[0.000007692087,0.0001052635,0.00003257793,0.0003742705,0.00001637864,0.007184886,0.0006932776,0.0001024055,0.00009830816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005147871,"about_ca_system_score_gemma":0.00008882197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001690616,"about_ca_topic_score_gemma":0.000001775609,"domain_scores_codex":[0.9988909,0.00001326385,0.0003189225,0.000139201,0.0004248788,0.0002128111],"domain_scores_gemma":[0.9994095,0.00001400029,0.0001868454,0.0002631258,0.00006165972,0.00006484469],"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.000001260319,0.000006511509,0.00001446614,0.0000102665,9.039424e-7,0.000001763234,0.0005413729,0.000222994,0.0004911884,0.0006527344,0.02618312,0.9718734],"study_design_scores_gemma":[0.000801486,0.00002472212,0.001829045,0.00009534577,0.00000449749,0.00003826947,0.00001985335,0.7157542,0.002761389,0.004245898,0.2740574,0.0003679498],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000617197,0.0000637216,0.9926643,0.004024165,0.0002176458,0.00007900572,0.000002318994,0.0003142931,0.002017396],"genre_scores_gemma":[0.0308682,0.000002333034,0.9617468,0.006836024,0.0002792441,0.000008446194,0.00009457061,0.000007181941,0.0001572538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9715055,"threshold_uncertainty_score":0.5373952,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002705379,0.0001549821,0.0001529516,0.0002678316,0.0002964957,0.0008445291,0.000500467,0.00006868154,0.000006462099],"category_scores_gemma":[0.0000178941,0.0001408807,0.00008320557,0.000547448,0.00002622402,0.004999719,0.00003158125,0.0001618626,0.00009992853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005116617,"about_ca_system_score_gemma":0.00003126344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001626243,"about_ca_topic_score_gemma":0.000002690677,"domain_scores_codex":[0.9987307,0.00003307334,0.000448989,0.0001620639,0.0003371053,0.0002880366],"domain_scores_gemma":[0.9991332,0.00001564011,0.0003403026,0.0002795059,0.0001507016,0.00008064036],"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.00004899506,0.0001214803,0.002659525,0.0002822442,0.00005347736,0.00002899988,0.02336702,0.0100212,0.003169637,0.09491909,0.2016494,0.6636789],"study_design_scores_gemma":[0.004645709,0.0006058997,0.05565646,0.001572021,0.00004462282,0.0008244455,0.002464675,0.6368509,0.004591012,0.02324047,0.265735,0.003768844],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0917272,0.0001182236,0.8877118,0.0124588,0.001475932,0.0002336397,0.000002507119,0.0007389106,0.005533049],"genre_scores_gemma":[0.9766152,0.000003326674,0.002664717,0.02059338,0.00007020351,0.0000103453,0.00000828977,0.000003778594,0.00003074746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.885047,"threshold_uncertainty_score":0.8143814,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001512553,0.0001770006,0.0001288748,0.000267087,0.000199742,0.00106636,0.0005662534,0.00007780603,0.00006707586],"category_scores_gemma":[0.0001256397,0.0001550285,0.00005405561,0.0004903569,0.00006064076,0.00330794,0.00005213387,0.0001526844,0.0001581677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001342837,"about_ca_system_score_gemma":0.0002551068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005293341,"about_ca_topic_score_gemma":6.533801e-7,"domain_scores_codex":[0.9986607,0.00003371789,0.0003980983,0.0002036081,0.0004106517,0.0002932558],"domain_scores_gemma":[0.9990957,0.00003317816,0.0002827913,0.0004200621,0.00008020216,0.00008807869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001879472,0.00006738297,0.0005672735,0.0002394376,0.00002151548,0.000002680753,0.002033707,0.001478795,0.003833164,0.4534614,0.03481549,0.5034604],"study_design_scores_gemma":[0.006608456,0.0002735509,0.006397063,0.0004001215,0.00007084514,0.00004452365,0.0006231376,0.1148789,0.08724255,0.06269126,0.7182018,0.00256783],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006092139,0.00001977597,0.9752547,0.01517612,0.0002799119,0.000237093,5.334801e-7,0.000770431,0.002169275],"genre_scores_gemma":[0.9063312,0.000001403762,0.09048315,0.002885533,0.00002182932,0.00005814388,0.00001008499,0.000006764216,0.0002018772],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9002391,"threshold_uncertainty_score":0.9999706,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000311589,0.0001139247,0.0001387093,0.0002611948,0.0002523526,0.000200017,0.0003457957,0.00004034727,0.000002591672],"category_scores_gemma":[0.00005262763,0.000114921,0.00005812478,0.0004568432,0.0000334981,0.00188574,0.00007449457,0.00006643073,0.000005851604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003125392,"about_ca_system_score_gemma":0.00007563991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005646534,"about_ca_topic_score_gemma":3.794647e-7,"domain_scores_codex":[0.9989714,0.00003028354,0.0004256296,0.0001387948,0.0002392523,0.0001946145],"domain_scores_gemma":[0.9990619,0.000118724,0.0003312293,0.000153959,0.000280081,0.00005409554],"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.000004000991,0.00002428625,0.0000176534,0.00006853425,0.00001332236,1.205124e-7,0.001148848,0.008704562,0.002925377,0.005446967,0.001273178,0.9803731],"study_design_scores_gemma":[0.0004476166,0.0000498099,0.0008951219,0.00002947365,0.000006718943,0.000006316572,0.00001921464,0.9849041,0.007538993,0.001170899,0.004792261,0.0001395446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.015894,0.00001007914,0.9816483,0.001676844,0.000191913,0.0002092914,0.00001389234,0.0001095118,0.0002462132],"genre_scores_gemma":[0.4954108,2.253159e-7,0.5025349,0.001842846,0.000099121,0.00001074928,0.00009128292,0.000003785844,0.000006339941],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9802336,"threshold_uncertainty_score":0.4686342,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003624086,0.00008559517,0.00007547998,0.00009110587,0.0002066282,0.0003408154,0.0005485254,0.00002664549,0.000004437626],"category_scores_gemma":[0.00006079348,0.00005855003,0.00002699345,0.0003077631,0.00006791278,0.002619188,0.00008238473,0.00009792444,0.00001764241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003141819,"about_ca_system_score_gemma":0.00004238044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001920492,"about_ca_topic_score_gemma":8.011084e-7,"domain_scores_codex":[0.9991213,0.0000368805,0.0002752607,0.00009376144,0.0003351611,0.0001376375],"domain_scores_gemma":[0.9992527,0.00008624861,0.0002520836,0.0003059933,0.00008272299,0.00002030015],"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.00009450674,0.0002788175,0.00475075,0.0009852302,0.00003728921,0.00003785476,0.00915525,0.0320405,0.09135597,0.3484968,0.03687039,0.4758967],"study_design_scores_gemma":[0.001102291,0.0001062672,0.03628549,0.001373148,0.00001988279,0.0001788368,0.0002140156,0.8879683,0.03947518,0.01368888,0.01863484,0.0009528772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2792058,0.0000335919,0.7157043,0.003632881,0.00007875704,0.00008555425,0.000003081951,0.00007934974,0.001176624],"genre_scores_gemma":[0.9867995,8.490015e-7,0.009826786,0.00331647,0.00003040754,0.000006535002,0.00001399046,0.000002703783,0.000002695045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8559278,"threshold_uncertainty_score":0.3286491,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001946515,0.0001008925,0.00008394826,0.0001249304,0.0001809217,0.0004130183,0.0003583692,0.0000386783,0.000006811563],"category_scores_gemma":[0.00003104938,0.0000657878,0.00001442027,0.0001696427,0.00004478484,0.006896581,0.0001791218,0.000063369,0.00006340445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003133507,"about_ca_system_score_gemma":0.00003253334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004723066,"about_ca_topic_score_gemma":1.581457e-7,"domain_scores_codex":[0.9992023,0.00001262801,0.0002386011,0.0001386351,0.0002223836,0.0001854709],"domain_scores_gemma":[0.9994978,0.00003570878,0.0001559417,0.0002042682,0.00004340253,0.00006284626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004204197,0.00000586652,0.0005027805,0.00003702979,0.000003524836,0.000001613852,0.002461317,0.000007288305,0.003132937,0.001085175,0.002978202,0.9897801],"study_design_scores_gemma":[0.009842822,0.000337087,0.04664079,0.003333525,0.00005678339,0.0006787662,0.0008896582,0.4330273,0.03598757,0.009744603,0.4554384,0.004022692],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1158926,0.00003545197,0.8772722,0.005993902,0.0001638675,0.00006301468,0.000003149708,0.0001658875,0.0004098795],"genre_scores_gemma":[0.9509046,0.00002240728,0.04437689,0.004590364,0.00005392625,0.00001034846,0.000005357744,0.000004488377,0.00003162282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9857574,"threshold_uncertainty_score":0.4999854,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894663,0.0001168396,0.00008462874,0.0001272294,0.0001754447,0.0004510869,0.001010698,0.00003403321,0.000007400281],"category_scores_gemma":[0.00003631301,0.00008918619,0.0000265748,0.0005690751,0.00004737912,0.006146086,0.00007241116,0.0002747855,0.0001413349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001290535,"about_ca_system_score_gemma":0.00009587232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002987328,"about_ca_topic_score_gemma":0.000004986186,"domain_scores_codex":[0.9987183,0.00007403035,0.0004073001,0.0001282015,0.0003487618,0.0003234592],"domain_scores_gemma":[0.999266,0.00003916147,0.0002368309,0.0003711281,0.00006006425,0.00002683325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000369876,0.0001589658,0.000377154,0.0003368278,0.000007015191,0.000002598075,0.06230544,0.004858389,0.0005240201,0.300098,0.003123617,0.628171],"study_design_scores_gemma":[0.002245278,0.00006925135,0.002906684,0.0001319226,0.000003515958,0.00009670166,0.0003784559,0.304493,0.001709201,0.02190645,0.6655262,0.0005333651],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001132844,0.000001952297,0.9197791,0.02630277,0.00001330751,0.05148108,6.253947e-7,0.0001580295,0.001130263],"genre_scores_gemma":[0.7156155,1.460469e-7,0.01403584,0.04202092,0.00004357042,0.2282608,0.000007261311,0.000005865968,0.00001006122],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057433,"threshold_uncertainty_score":0.4455764,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000868811,0.00009966171,0.00006875778,0.0001429566,0.0001572758,0.0009142335,0.000384043,0.00004318122,0.00002066616],"category_scores_gemma":[0.00001621033,0.00008525471,0.00001659675,0.0003039982,0.00003251004,0.007908346,0.0001123236,0.0001286948,0.00005448402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001044571,"about_ca_system_score_gemma":0.000003693613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001232388,"about_ca_topic_score_gemma":2.893999e-7,"domain_scores_codex":[0.9993559,0.000009299177,0.0001563504,0.0001149073,0.0002093284,0.0001542141],"domain_scores_gemma":[0.9996549,0.00001489751,0.0001015521,0.000159584,0.00003091372,0.00003810203],"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":[9.413458e-7,0.000009147339,0.00004792862,0.00007173269,0.00000675452,0.00000371487,0.002484815,0.0001398067,0.0002990587,0.001643265,0.09668241,0.8986104],"study_design_scores_gemma":[0.0006243009,0.00003235135,0.002138936,0.0001147938,0.00001118369,0.00001887761,0.0001762849,0.6983917,0.0006092555,0.0004763612,0.2969172,0.0004886984],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007760521,0.000956741,0.9470272,0.0345506,0.0003993897,0.0002595939,0.00001457799,0.0007178832,0.008313511],"genre_scores_gemma":[0.897251,0.00005820289,0.06757921,0.03440896,0.0001410791,0.00002010644,0.00007276157,0.000009166509,0.000459486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8981217,"threshold_uncertainty_score":0.8815975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001936358,0.00004843457,0.00006094139,0.00004982982,0.00008835898,0.00008041767,0.0002494176,0.00001483114,0.00003139377],"category_scores_gemma":[0.0000246068,0.00003635377,0.00002365156,0.0003608329,0.00003520602,0.001967205,0.0000201533,0.0000400157,0.00002213235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008737405,"about_ca_system_score_gemma":0.00004212471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001034945,"about_ca_topic_score_gemma":1.422484e-7,"domain_scores_codex":[0.999333,0.00001781832,0.0002969931,0.00004917562,0.0002296219,0.00007340858],"domain_scores_gemma":[0.9995599,0.0000395282,0.0001924572,0.0001133469,0.00008130215,0.00001348761],"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.000007211513,0.00001345745,0.000342445,0.0001053131,0.000006694735,1.108839e-7,0.004877524,0.1535928,0.001266483,0.001515416,0.0003108878,0.8379617],"study_design_scores_gemma":[0.0001901723,0.00001128384,0.003722068,0.00006517473,0.000005405791,0.00001493424,0.00003295426,0.9876356,0.006263901,0.0006307103,0.001349794,0.00007800935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.474016,0.00001479305,0.5230353,0.001457881,0.00006278142,0.00004384445,5.996724e-7,0.00002430358,0.001344509],"genre_scores_gemma":[0.9311858,5.757914e-7,0.06758845,0.001179475,0.00002228168,0.000003707953,0.000004039219,0.000001207078,0.00001443087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8378837,"threshold_uncertainty_score":0.1482464,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001246315,0.00008778051,0.00006730085,0.0001326824,0.0002145533,0.0006320383,0.0004046086,0.00003002577,0.000004604584],"category_scores_gemma":[0.00000696809,0.00007856886,0.00002149878,0.0002518529,0.00002036396,0.006474611,0.0001089809,0.00008025832,0.00009366757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004524972,"about_ca_system_score_gemma":0.00002719703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002317455,"about_ca_topic_score_gemma":7.123127e-7,"domain_scores_codex":[0.9992194,0.000009216489,0.000247437,0.0001050059,0.0002416557,0.0001773314],"domain_scores_gemma":[0.999565,0.0000115659,0.0001502668,0.0001935791,0.00005245752,0.00002712553],"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.000007164421,0.00003651246,0.000271118,0.0001777928,0.00000526749,0.000008611702,0.001504757,0.006910327,0.009920458,0.01163343,0.02964297,0.9398816],"study_design_scores_gemma":[0.0002540024,0.000008149384,0.002440896,0.00007262871,0.000001937148,0.00002027527,0.00002070597,0.9613966,0.0007852469,0.0007052917,0.03409701,0.0001972877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008103375,0.00003004179,0.9872432,0.002127554,0.0001878614,0.0000578369,0.000002489607,0.0002711599,0.001976526],"genre_scores_gemma":[0.8603806,0.000002016279,0.1352066,0.004212755,0.00004836611,0.00001119924,0.00008632608,0.000005086919,0.00004707539],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9544863,"threshold_uncertainty_score":0.609476,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444628,0.0001032088,0.0001298839,0.0001320192,0.00008431422,0.000559733,0.0007349932,0.00003218458,0.000003308238],"category_scores_gemma":[0.0002578037,0.00008032112,0.00002377611,0.0005433405,0.0000901305,0.005294007,0.0001392042,0.0001193737,0.0000706769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002770944,"about_ca_system_score_gemma":0.00003325659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001323752,"about_ca_topic_score_gemma":1.574627e-7,"domain_scores_codex":[0.9989433,0.00003979509,0.0004530422,0.0001023293,0.0002860363,0.0001755074],"domain_scores_gemma":[0.9991484,0.00008253626,0.0003509341,0.0002474111,0.0001459327,0.00002482522],"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.00002483956,0.0001284281,0.00721636,0.0007848871,0.00001731866,0.000002574156,0.01018954,0.005872667,0.01703966,0.005792264,0.004108645,0.9488228],"study_design_scores_gemma":[0.0002201815,0.000006844567,0.001592723,0.0001879342,0.000001673607,0.00001556525,0.000007298293,0.9914079,0.004080081,0.001802611,0.0005528379,0.0001243204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1553191,0.000003177961,0.8384771,0.002391842,0.00005231947,0.0000945037,6.751312e-7,0.0002884754,0.003372791],"genre_scores_gemma":[0.7796389,6.697447e-8,0.217901,0.002419647,0.00001217039,0.000009624698,0.000007973747,0.000004398406,0.000006159401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9855353,"threshold_uncertainty_score":0.5397518,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002051141,0.0001272433,0.00009660944,0.0001348204,0.0002262716,0.0006443151,0.0004332681,0.00004209051,0.000005476476],"category_scores_gemma":[0.00002364354,0.0001102329,0.00002409533,0.0001706444,0.00004891772,0.004966747,0.0001830503,0.0001083846,0.00007734294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004579479,"about_ca_system_score_gemma":0.00004751646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002649456,"about_ca_topic_score_gemma":8.524266e-7,"domain_scores_codex":[0.9990379,0.00001504552,0.0002697429,0.0001472507,0.000309685,0.0002204118],"domain_scores_gemma":[0.9994185,0.00002001752,0.0001539163,0.0002809831,0.00005016525,0.00007643843],"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":[9.622065e-7,0.00001611407,0.0002170051,0.00008619431,0.000004514358,0.00000536686,0.005845211,0.0003093192,0.001761268,0.000666184,0.0009272202,0.9901606],"study_design_scores_gemma":[0.01426631,0.0003387222,0.09071013,0.004420687,0.00007369049,0.001384621,0.002910299,0.7224512,0.04316861,0.02758336,0.0876664,0.005026033],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1036373,0.00003009933,0.8863679,0.008937798,0.0001360999,0.00007798609,0.000003108181,0.0004430478,0.0003667321],"genre_scores_gemma":[0.9747488,0.000004653436,0.008028676,0.0171512,0.00003255901,0.0000158002,0.000008817954,0.000005689535,0.000003760598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9851346,"threshold_uncertainty_score":0.6213145,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001512806,0.0002431981,0.0001604074,0.0002940409,0.0002052579,0.0002508278,0.0001924869,0.00008475529,0.00001409725],"category_scores_gemma":[0.00005737409,0.0002411899,0.00004750065,0.0004859544,0.00004926681,0.002084718,0.00002041221,0.0003309606,0.0001316484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002106915,"about_ca_system_score_gemma":0.00007060577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004575419,"about_ca_topic_score_gemma":0.000001029143,"domain_scores_codex":[0.9987089,0.000006375713,0.0004431085,0.000133377,0.0003426033,0.0003656282],"domain_scores_gemma":[0.9994692,0.0000173011,0.0001265568,0.0001463807,0.0001393533,0.0001012479],"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.00001341039,0.00001832567,0.00003103104,0.0001197089,0.0000146169,0.000001451448,0.002473055,0.9862347,0.0001378796,0.00006037599,0.00003017335,0.0108653],"study_design_scores_gemma":[0.00157647,0.00003933393,0.0001156404,0.0003610573,0.00001714175,0.00002006432,0.0009934425,0.988843,0.007060302,0.00004328564,0.0004913285,0.0004389079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4542188,0.00004064654,0.5420766,0.0009151699,0.0002520857,0.0001766279,0.00001475412,0.0009879478,0.001317384],"genre_scores_gemma":[0.7745441,0.00001071413,0.2224699,0.002564374,0.0001563839,0.00002939682,0.0001778077,0.00003587397,0.00001143342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3203253,"threshold_uncertainty_score":0.9835439,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004408214,0.0002248533,0.0001548669,0.0003624595,0.0007503144,0.001205028,0.0004879313,0.00007809598,0.000004208026],"category_scores_gemma":[0.00007255089,0.0001580563,0.00009223773,0.0005561172,0.0002882244,0.003362549,0.00007566183,0.0003281788,0.000008347339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001920831,"about_ca_system_score_gemma":0.0000604606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001239995,"about_ca_topic_score_gemma":0.000009111693,"domain_scores_codex":[0.9985289,0.00003210849,0.000477693,0.000261113,0.0003928119,0.0003073584],"domain_scores_gemma":[0.9988626,0.0001677204,0.0003344829,0.000302274,0.0002552249,0.00007775862],"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.00004781849,0.00006567552,0.0004746976,0.0003137322,0.00004550941,0.00000103886,0.01147845,0.0003334556,0.004981799,0.1171803,0.000714681,0.8643628],"study_design_scores_gemma":[0.001842843,0.0003018634,0.006718911,0.0002565829,0.00004713124,0.0001264945,0.0006402985,0.9254496,0.005692525,0.04811925,0.009916153,0.0008883315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1394208,0.00003588694,0.8517661,0.0065661,0.0005984597,0.001086402,0.00002611239,0.0003173091,0.0001827947],"genre_scores_gemma":[0.9059928,0.00000989333,0.08980224,0.003810714,0.00004147609,0.0002879146,0.00003419445,0.00001256332,0.000008224479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9251162,"threshold_uncertainty_score":0.9998318,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001907958,0.00009898306,0.00009081094,0.0000797301,0.0001826399,0.0002458441,0.0001591202,0.00002994085,0.00002359703],"category_scores_gemma":[0.00003299207,0.00007688625,0.00002831611,0.0002252557,0.0001395943,0.001186703,0.00001500399,0.000127405,0.00007070821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000297588,"about_ca_system_score_gemma":0.00001603094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002047217,"about_ca_topic_score_gemma":0.000001247184,"domain_scores_codex":[0.9991891,0.00001121365,0.0003843625,0.0000464519,0.0001863803,0.0001825408],"domain_scores_gemma":[0.9995688,0.00002710088,0.0001140099,0.0001178533,0.0001333028,0.00003897511],"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.000001224354,0.00000359575,0.0001932695,0.0001557016,0.00001207623,4.308888e-8,0.001920352,0.9462193,0.001062486,0.0004268898,0.0004167864,0.04958832],"study_design_scores_gemma":[0.0002605571,0.000003955141,0.0003756963,0.00006389352,0.000003667466,0.000002637164,0.0003031767,0.9963965,0.00171902,0.0003184357,0.0004434422,0.0001090001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.20019,0.0002197763,0.7914505,0.004836892,0.0004190209,0.0004252111,0.000005078867,0.0005934159,0.001860096],"genre_scores_gemma":[0.9166128,0.00001127338,0.08258799,0.0006539956,0.00004311716,0.00004544573,0.00002472476,0.00001192565,0.0000087119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7164228,"threshold_uncertainty_score":0.313533,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842276,0.00009248147,0.00006102687,0.0003189147,0.0002041375,0.0002818092,0.0002165728,0.00003705689,0.000005022448],"category_scores_gemma":[0.00002713054,0.00008788893,0.00002879414,0.0004649145,0.00001328945,0.004146771,0.00000896102,0.00009322003,0.0001357036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005750205,"about_ca_system_score_gemma":0.00003926973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001833427,"about_ca_topic_score_gemma":5.211641e-7,"domain_scores_codex":[0.9990206,0.00001175159,0.0003259519,0.00009198576,0.0003714698,0.0001781929],"domain_scores_gemma":[0.9995579,0.00005099371,0.0001339971,0.0001161514,0.000086422,0.0000545992],"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.00002925844,0.00002739501,0.00001890274,0.00006418915,0.000005757823,0.000002631983,0.006039482,0.01535475,0.001880159,0.1104319,0.00393965,0.8622059],"study_design_scores_gemma":[0.00325255,0.0003821197,0.0159195,0.000297498,0.00001808905,0.0001549569,0.0004858846,0.7446314,0.03960509,0.01763847,0.176137,0.001477465],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03777259,0.000008415013,0.9535303,0.002853862,0.0002408696,0.0001018681,0.000001241723,0.0001850644,0.005305772],"genre_scores_gemma":[0.9622576,9.967173e-7,0.02441348,0.01319689,0.00005555452,0.000005390395,0.0000560664,0.000002750844,0.00001122377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9291168,"threshold_uncertainty_score":0.3584007,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624348,0.0001100963,0.00009678798,0.0003772963,0.0001375545,0.0004547023,0.0004939522,0.00003806517,0.000006816019],"category_scores_gemma":[0.00001671976,0.0001085987,0.00003131585,0.000793629,0.0000371616,0.004463047,0.0001054672,0.0001797629,0.00007470835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007797972,"about_ca_system_score_gemma":0.0000389622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001624329,"about_ca_topic_score_gemma":0.000007297015,"domain_scores_codex":[0.9987373,0.00001501136,0.0004566827,0.0001235027,0.0003295616,0.0003379337],"domain_scores_gemma":[0.9994834,0.00002279936,0.00018799,0.0001814737,0.00005871796,0.00006559883],"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.00002194013,0.00006263261,0.005916839,0.0002208458,0.00001108634,0.00002158447,0.02212907,0.001233664,0.001556879,0.004113081,0.003810124,0.9609023],"study_design_scores_gemma":[0.007815895,0.0002756791,0.1194131,0.002126302,0.00002128248,0.0003773107,0.003357297,0.5984618,0.03530576,0.03037149,0.1991219,0.003352166],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.110899,0.00002062761,0.8805165,0.004914372,0.00022096,0.0001608388,0.000001356656,0.0001766022,0.003089723],"genre_scores_gemma":[0.8560497,0.000002613299,0.1341568,0.009703055,0.00004750387,0.00001094949,0.00001066556,0.00000491303,0.00001383746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9575501,"threshold_uncertainty_score":0.4428528,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042594,0.00007727794,0.00005141154,0.00009347174,0.0004310959,0.0007031081,0.0006506111,0.00001992445,0.00001195361],"category_scores_gemma":[0.00001716049,0.00004618257,0.00003690663,0.0005793081,0.00005750633,0.002091598,0.00002452099,0.0001499529,0.00005064562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001538746,"about_ca_system_score_gemma":0.00001966393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009372001,"about_ca_topic_score_gemma":0.000001368319,"domain_scores_codex":[0.9992229,0.0001050639,0.0002139141,0.00008025718,0.0002208954,0.0001570162],"domain_scores_gemma":[0.9995775,0.0001130096,0.0000812732,0.0001940086,0.00002211579,0.00001208838],"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.000006228231,0.00001087929,0.000501916,0.0000228578,0.000002514534,0.000001038272,0.05345373,0.00775838,0.0000745732,0.006818657,0.0005129323,0.9308363],"study_design_scores_gemma":[0.001013853,0.00007858734,0.09043026,0.0002510167,0.000016904,0.0001655598,0.004697525,0.8501868,0.0004537435,0.01125239,0.04081771,0.0006356949],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7722051,0.00003708645,0.2087931,0.01414947,0.0000702226,0.0001466266,3.390465e-7,0.0001302031,0.00446777],"genre_scores_gemma":[0.9842021,0.000001787493,0.001264986,0.01448241,0.00003231479,0.000008632243,0.000003094363,0.000001906921,0.000002804481],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9302006,"threshold_uncertainty_score":0.6780087,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632002,0.00009675124,0.00008512073,0.0001567728,0.0003113918,0.0007670842,0.000355627,0.00002750351,0.000003762374],"category_scores_gemma":[0.0001345243,0.00009039866,0.00005137187,0.0003179566,0.00003990871,0.002659345,0.00004160497,0.0000758849,0.000007242492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003697643,"about_ca_system_score_gemma":0.00003889174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002123052,"about_ca_topic_score_gemma":0.000003291828,"domain_scores_codex":[0.9991527,0.00001681761,0.0003125578,0.0001158907,0.0001845063,0.0002175402],"domain_scores_gemma":[0.9993939,0.0000572396,0.0001837202,0.0001769752,0.0001391321,0.00004904713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000112306,0.00002482768,0.0005119817,0.0001799542,0.00001426544,2.046853e-7,0.009974773,0.000148578,0.0007466664,0.1180984,0.01813723,0.8521519],"study_design_scores_gemma":[0.002361857,0.000180266,0.004566977,0.0001288945,0.00002571044,0.00002409547,0.001015128,0.4411742,0.002007555,0.02081279,0.5268366,0.0008659622],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06702804,0.000003449625,0.9277705,0.003994194,0.0002695908,0.0001584958,0.000004731499,0.0001534546,0.0006175468],"genre_scores_gemma":[0.9178117,2.920198e-7,0.07720334,0.004802583,0.0000693715,0.00004451856,0.00006034259,0.000003750717,0.000004109259],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8512859,"threshold_uncertainty_score":0.7397011,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002858006,0.0001293114,0.000154926,0.0001433787,0.0002877286,0.0003229006,0.0003831016,0.00005238901,0.000003059127],"category_scores_gemma":[0.0001015347,0.0001072908,0.00006463045,0.0003173325,0.00006312603,0.005528548,0.00009636244,0.00008661859,0.000003206252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003568714,"about_ca_system_score_gemma":0.00004344723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001541278,"about_ca_topic_score_gemma":0.000001265464,"domain_scores_codex":[0.9988146,0.00002680675,0.0004840519,0.0001586865,0.0002722151,0.0002436004],"domain_scores_gemma":[0.9992096,0.00006966491,0.0003860398,0.0002012852,0.00008600406,0.00004736933],"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.00002035662,0.000136645,0.00275568,0.0002951076,0.00003708905,0.000002587698,0.002799224,0.0004910904,0.004642935,0.01356827,0.002620644,0.9726304],"study_design_scores_gemma":[0.003391246,0.000245664,0.00808904,0.0004796211,0.00003982571,0.00007395594,0.0007529021,0.9068133,0.05453396,0.006420574,0.01804353,0.001116335],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03458985,0.00003925526,0.9640784,0.0003627127,0.0002153924,0.0001965525,0.00001024833,0.0001527185,0.0003548489],"genre_scores_gemma":[0.5862526,0.000004759672,0.4122548,0.001356761,0.00002325686,0.00004075222,0.000055383,0.000005409996,0.000006205449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.971514,"threshold_uncertainty_score":0.4375192,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003565172,0.0001174096,0.0001036785,0.0002246401,0.0003776034,0.0005884112,0.0006659068,0.00003588768,0.00000142664],"category_scores_gemma":[0.00004076977,0.0001094102,0.00004017099,0.0004111514,0.00003532604,0.007206419,0.00003284077,0.0001118399,0.000008344833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004740237,"about_ca_system_score_gemma":0.00004272429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001401201,"about_ca_topic_score_gemma":8.781198e-8,"domain_scores_codex":[0.998927,0.00002449371,0.0002755192,0.000152245,0.0002778938,0.0003428524],"domain_scores_gemma":[0.9992803,0.00006044981,0.0001554953,0.0002588501,0.0001527227,0.00009212325],"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.000002614674,0.0000121237,0.00004879599,0.00001412922,0.000001862554,3.567876e-7,0.002044228,0.001879629,0.0008917041,0.002576697,0.0002467444,0.9922811],"study_design_scores_gemma":[0.0003654335,0.0001087768,0.001285588,0.0000173346,0.000001733005,0.00000555479,0.0001675244,0.9811255,0.003920563,0.009399466,0.003381019,0.0002215122],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02809106,0.000007375785,0.9701835,0.001013374,0.00006951116,0.0001936714,0.000003202144,0.000326725,0.0001116192],"genre_scores_gemma":[0.6532647,2.782867e-7,0.341424,0.005217186,0.00004399079,0.000004826782,0.00003836644,0.000004390097,0.000002341805],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9920596,"threshold_uncertainty_score":0.5674062,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003011482,0.0001975116,0.0001562885,0.0001349141,0.0005838637,0.0008051748,0.0006839168,0.00005639223,0.000004603296],"category_scores_gemma":[0.000008362366,0.0001257744,0.00005502529,0.0003440552,0.00009462768,0.004443112,0.00008423546,0.0001290078,0.00005169647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004896619,"about_ca_system_score_gemma":0.0001499001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008595125,"about_ca_topic_score_gemma":0.000004572597,"domain_scores_codex":[0.9985953,0.00002424502,0.0004509192,0.0002095229,0.0003803373,0.0003396668],"domain_scores_gemma":[0.9989586,0.0001029046,0.0003628165,0.0003683023,0.0001568628,0.00005048884],"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.00003222336,0.00005357361,0.00003814511,0.00008720675,0.00002193061,0.000002764926,0.002325453,0.001609884,0.0005874608,0.0001836275,0.1709105,0.8241472],"study_design_scores_gemma":[0.0010446,0.0001191379,0.0003323157,0.00009260121,0.0000187914,0.0000511512,0.0001536841,0.912398,0.0003367148,0.0001277234,0.08500137,0.0003238508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001147622,0.00004998464,0.9892562,0.00811807,0.0001492218,0.0004967281,0.00002734737,0.000225058,0.0005297706],"genre_scores_gemma":[0.05282918,0.000001744523,0.9382446,0.007598593,0.0004409123,0.0003480082,0.0002668251,0.00002744231,0.0002426815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9107882,"threshold_uncertainty_score":0.7764319,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001422307,0.0001430191,0.0001020134,0.000236142,0.0001266648,0.0003271354,0.0003979225,0.00005046551,0.000002626168],"category_scores_gemma":[0.00001439834,0.0001179998,0.00001735752,0.0005174674,0.00002100648,0.004938986,0.00002230058,0.0001874864,0.0000180584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001042887,"about_ca_system_score_gemma":0.0000345744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009331487,"about_ca_topic_score_gemma":0.00001007229,"domain_scores_codex":[0.9990606,0.00001501669,0.0002824453,0.0001600184,0.000293993,0.0001879603],"domain_scores_gemma":[0.9995309,0.00003945595,0.0001635591,0.0001776176,0.00005086858,0.00003757585],"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.00001646365,0.00003618635,0.0001310404,0.00007950947,0.000003100175,7.810191e-7,0.002884327,0.001895858,0.005774787,0.001165384,0.0004663407,0.9875462],"study_design_scores_gemma":[0.002182973,0.000170538,0.0008260606,0.0007559281,0.00001496334,0.00003688295,0.0001252926,0.8158783,0.115031,0.0007948259,0.06295933,0.001223958],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008074978,0.0006749855,0.9840894,0.005795626,0.00001643002,0.0002852813,0.000005885037,0.0005277082,0.0005296723],"genre_scores_gemma":[0.8729607,0.000006161011,0.122893,0.003989289,0.00001390644,0.00007510791,0.0000454943,0.000007397337,0.000008902372],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9863223,"threshold_uncertainty_score":0.4811893,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00246682,0.0001028167,0.0001415619,0.0004707958,0.0001169059,0.00008821108,0.0002714095,0.00005655285,1.811362e-7],"category_scores_gemma":[0.0004178532,0.00009446874,0.00002844074,0.0007222319,0.0001535813,0.003441641,0.00009593443,0.0001357888,7.714761e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005165007,"about_ca_system_score_gemma":0.00004143906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001230768,"about_ca_topic_score_gemma":0.000006037292,"domain_scores_codex":[0.9986266,0.00004565737,0.0006266254,0.000181422,0.0002531529,0.0002665689],"domain_scores_gemma":[0.9989404,0.0002811305,0.0002897734,0.0002584551,0.0001764848,0.00005373283],"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.001048374,0.0002025775,0.005016157,0.001679259,0.00001720021,0.000002670882,0.02018859,0.002606928,0.01517418,0.2687197,0.0002049984,0.6851394],"study_design_scores_gemma":[0.006837336,0.0003217754,0.0647092,0.0004552609,0.00001109254,0.00002570337,0.001176307,0.1746024,0.04914262,0.701008,0.0008844571,0.0008258522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3317304,0.00001071916,0.6664199,0.001298894,0.00003418554,0.0003521699,0.000006072377,0.00004313643,0.0001045351],"genre_scores_gemma":[0.874285,0.000002270872,0.1252401,0.0004082924,0.000004887673,0.00003354115,0.00002085492,0.000003515261,0.000001511739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6843135,"threshold_uncertainty_score":0.3852324,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001455511,0.0001475876,0.0001138824,0.0001799501,0.0002820276,0.0005594577,0.0003656014,0.00003677058,0.000001448984],"category_scores_gemma":[0.00001047618,0.0001204094,0.00002878078,0.0004507569,0.00004865554,0.002551365,0.00006344328,0.0001604609,0.0001465775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006157121,"about_ca_system_score_gemma":0.0001324344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001971127,"about_ca_topic_score_gemma":5.195529e-7,"domain_scores_codex":[0.9989783,0.00001659517,0.0002701733,0.0001582042,0.0003278653,0.000248837],"domain_scores_gemma":[0.9994465,0.00002065677,0.0002195352,0.0001543094,0.00009219207,0.00006676665],"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.00003242913,0.00003474852,0.00002692081,0.00008868105,0.00001498693,0.00001094107,0.007817151,0.7321492,0.0008834977,0.0003961406,0.003273949,0.2552713],"study_design_scores_gemma":[0.0008801264,0.0001034843,0.0005832451,0.0001183459,0.000004330478,0.0001158395,0.00002841669,0.9943114,0.0004463358,0.0001783907,0.002968867,0.0002612259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1482116,0.000009996545,0.8425127,0.008079848,0.0001159905,0.00009800891,0.000001077887,0.0005920379,0.0003786836],"genre_scores_gemma":[0.8167487,2.813035e-7,0.1760252,0.00709725,0.00008868563,0.000005890893,0.00001903797,0.000008400717,0.000006542054],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6685371,"threshold_uncertainty_score":0.5394863,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161608,0.0001583997,0.0001490416,0.0003614847,0.0002028028,0.0005165162,0.0005283037,0.00006557655,0.000004219105],"category_scores_gemma":[0.00002403122,0.0001558701,0.00006227254,0.0006376642,0.00004811742,0.003641209,0.00009959189,0.0001852618,0.00001506813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001297916,"about_ca_system_score_gemma":0.00006835881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001968905,"about_ca_topic_score_gemma":0.000008310426,"domain_scores_codex":[0.9984741,0.00001449642,0.0005945674,0.0001845852,0.0002720366,0.0004602617],"domain_scores_gemma":[0.9992624,0.00006651464,0.000252311,0.000213809,0.0001209307,0.00008402501],"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.000009200327,0.00002549484,0.0000543631,0.00008771731,0.000006335837,0.000001783403,0.004245504,0.0001313124,0.0008962004,0.0005458027,0.0008803449,0.993116],"study_design_scores_gemma":[0.001451544,0.00007908234,0.0009386492,0.0001566792,0.000004892484,0.00002242877,0.0003177069,0.9687629,0.005846505,0.002021177,0.02001113,0.000387336],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006338904,0.00002749543,0.9895304,0.002903265,0.0003189896,0.0004103756,0.000006222258,0.0001540224,0.0003103199],"genre_scores_gemma":[0.1030535,0.000004238525,0.8864072,0.01027429,0.00009438381,0.00009168787,0.00004113374,0.00001181722,0.00002173331],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9927286,"threshold_uncertainty_score":0.63562,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002735443,0.00008563678,0.00007899203,0.0001571948,0.000520568,0.0001366033,0.0002544543,0.00003504008,0.000009182334],"category_scores_gemma":[0.00006858979,0.00006746766,0.00005348128,0.0006624445,0.00006633115,0.003953458,0.00004120725,0.00008391772,0.00003381649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002978137,"about_ca_system_score_gemma":0.0001098995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003918921,"about_ca_topic_score_gemma":1.672302e-7,"domain_scores_codex":[0.9989324,0.00003663474,0.0004053789,0.00009558341,0.0003983933,0.0001316041],"domain_scores_gemma":[0.9990826,0.0001026867,0.000376035,0.0001689816,0.0002380347,0.00003164901],"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.00005077833,0.00006059378,0.001042248,0.0001115218,0.00008237889,0.000002404183,0.04619311,0.02939348,0.001279108,0.04218672,0.03028112,0.8493165],"study_design_scores_gemma":[0.002708324,0.0002008702,0.06336969,0.0002510588,0.00004274919,0.0001371085,0.0004486407,0.7736277,0.02194727,0.02750606,0.1087364,0.001024124],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04827308,0.0001019887,0.9451632,0.00487519,0.0002476014,0.0001267904,0.000002052826,0.00006693307,0.001143089],"genre_scores_gemma":[0.984215,0.00001918511,0.01217437,0.003432374,0.00006667057,0.00001452204,0.0000166886,0.000003013073,0.00005817322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9359419,"threshold_uncertainty_score":0.4003841,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475116,0.0001456703,0.0001260172,0.00005529008,0.0003281856,0.0002950371,0.000238144,0.000109442,0.0001143879],"category_scores_gemma":[0.0001070599,0.00006495787,0.00006325678,0.0007491294,0.00008987201,0.002033777,0.00004724244,0.0002899772,0.00007140631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004297249,"about_ca_system_score_gemma":0.00001918165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001105286,"about_ca_topic_score_gemma":0.00002375016,"domain_scores_codex":[0.9988475,0.00002469643,0.0003586024,0.0001502019,0.0003201452,0.0002988187],"domain_scores_gemma":[0.9994498,0.00008233794,0.0001808836,0.00006992471,0.000123034,0.00009403819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000007143547,0.00003330264,0.002522388,0.00003458993,0.000005421265,0.00000133663,0.0003485994,0.00006878269,0.186292,0.00003613708,0.0007391475,0.8099112],"study_design_scores_gemma":[0.001634585,0.0003815852,0.3755669,0.0001928333,0.0001032883,0.000328646,0.002934054,0.2130325,0.06927636,0.0009486607,0.3324728,0.003127788],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9930764,0.00001307902,0.00110771,0.00452159,0.0003989509,0.0001636843,0.00002620386,0.0002048306,0.0004875509],"genre_scores_gemma":[0.9885602,8.115168e-7,0.007827708,0.003282345,0.0002330794,0.000009248664,0.00007733323,9.848056e-7,0.000008274332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8067834,"threshold_uncertainty_score":0.2845049,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005721982,0.0001496433,0.0001329858,0.000633991,0.0001706321,0.0003681766,0.0004268095,0.00005136042,0.00001745338],"category_scores_gemma":[0.0004108324,0.0001660339,0.00002599251,0.001210666,0.00002487705,0.005869155,0.0001026758,0.0001899083,0.0001522906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001836562,"about_ca_system_score_gemma":0.00007353894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000242762,"about_ca_topic_score_gemma":0.000005558835,"domain_scores_codex":[0.9984632,0.00007246779,0.0004239843,0.0002268489,0.0004452781,0.0003682719],"domain_scores_gemma":[0.9992465,0.00008694574,0.0001565807,0.0002620716,0.0001664837,0.00008135429],"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.00005653021,0.00007213395,0.0008039279,0.000175955,0.0000157157,0.0000105337,0.03095834,0.191525,0.0287555,0.007262988,0.000360803,0.7400026],"study_design_scores_gemma":[0.001112719,0.00007291626,0.00544219,0.0002171352,0.000004394831,0.000009371488,0.0008554195,0.9697693,0.01073048,0.004607504,0.006578245,0.0006003458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2234151,0.000008673927,0.7740722,0.001628209,0.00007187523,0.0002252627,0.000001881286,0.0001411472,0.0004356602],"genre_scores_gemma":[0.8925728,9.513375e-7,0.1060408,0.001253161,0.00002592834,0.0000539493,0.00002614337,0.00001076818,0.00001548935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7782443,"threshold_uncertainty_score":0.6770664,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002299588,0.0001203089,0.00009571933,0.0003356046,0.0002428149,0.0004202412,0.0004720189,0.00003986696,0.000009218546],"category_scores_gemma":[0.00006836635,0.0001058926,0.00004785438,0.000601569,0.00004729778,0.00228491,0.00007449886,0.0001923296,0.0001376449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001548122,"about_ca_system_score_gemma":0.00004375289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001129169,"about_ca_topic_score_gemma":0.000002336842,"domain_scores_codex":[0.9990472,0.00001525302,0.0002589151,0.0001368423,0.0003094346,0.0002323951],"domain_scores_gemma":[0.9993969,0.00003081514,0.0001183111,0.0002807062,0.0000841623,0.00008913548],"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.00007948464,0.0002705773,0.004068732,0.002232432,0.00009533206,0.00002389543,0.03597381,0.01526862,0.2507888,0.04892421,0.02549688,0.6167772],"study_design_scores_gemma":[0.003466266,0.0006932169,0.04876116,0.004893189,0.0001241534,0.0005723392,0.0009091805,0.5396268,0.2380715,0.008423945,0.1495056,0.004952515],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4731327,0.0000312167,0.5146081,0.01080957,0.0005039322,0.0001694879,0.000001403525,0.0001993735,0.0005441591],"genre_scores_gemma":[0.8696516,0.000003782541,0.09729653,0.03296319,0.00005827613,0.00001206128,0.000003693362,0.000006237973,0.00000466868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6118248,"threshold_uncertainty_score":0.4318176,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000507117,0.00009624413,0.00008185049,0.0006097998,0.0001255565,0.0003500862,0.0005347925,0.00005150463,0.000009645693],"category_scores_gemma":[0.00009799072,0.00009247311,0.0000306381,0.0008315356,0.00007233839,0.006842675,0.00007701485,0.0002860719,0.00005517693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003059095,"about_ca_system_score_gemma":0.00005313701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006357926,"about_ca_topic_score_gemma":0.000004694493,"domain_scores_codex":[0.99896,0.00003184915,0.0002825123,0.0001316573,0.0003292204,0.000264785],"domain_scores_gemma":[0.9994516,0.00003652674,0.0001186338,0.0002346702,0.0001056067,0.00005296459],"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.00003856583,0.00005038689,0.002662618,0.0001069807,0.000005998525,0.000007736281,0.00884484,0.002120355,0.2158676,0.102833,0.0007824741,0.6666795],"study_design_scores_gemma":[0.00504641,0.000121859,0.0633734,0.0001698901,0.000007019427,0.0001285448,0.0003848169,0.7364271,0.06284763,0.11108,0.01874342,0.001669838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3719433,0.000004700622,0.623632,0.003125836,0.0001628243,0.0001337803,5.444691e-7,0.0001105047,0.0008864561],"genre_scores_gemma":[0.9297992,6.770251e-7,0.06693844,0.003165398,0.00002343317,0.00004018491,0.00000753007,0.000004737587,0.00002037903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7343068,"threshold_uncertainty_score":0.4960774,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107518,0.0001843356,0.0001196157,0.0001732996,0.0006086284,0.0005745146,0.0002413951,0.00005431975,0.00004708451],"category_scores_gemma":[0.0001188237,0.000140901,0.00006339717,0.0005053335,0.00005630966,0.009040853,0.00005876706,0.0001048034,0.0002352551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008104181,"about_ca_system_score_gemma":0.00002393973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002433619,"about_ca_topic_score_gemma":0.00001534733,"domain_scores_codex":[0.9986175,0.000008357141,0.0005636819,0.0001382401,0.0003077815,0.0003644579],"domain_scores_gemma":[0.9990528,0.00002077785,0.0002679126,0.0002276337,0.0004134396,0.00001745925],"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.0001171961,0.0001924048,0.00119654,0.004891556,0.0000750308,4.252804e-8,0.00437194,0.1616033,0.0005193715,0.005069287,0.02627302,0.7956903],"study_design_scores_gemma":[0.0004823035,0.000003586237,0.002300842,0.00002844142,0.00005068431,4.88237e-7,0.001060153,0.84306,0.00006604569,0.00007054545,0.1526411,0.000235849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008403251,0.00007186141,0.9767513,0.01152246,0.0006297569,0.001444319,0.000008476552,0.0002632321,0.0009053042],"genre_scores_gemma":[0.9793601,0.000003362535,0.005367015,0.01336868,0.0005514878,0.0006902609,0.0005698279,0.00001219472,0.00007703945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9713843,"threshold_uncertainty_score":0.65544,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006232429,0.00006934217,0.00006260592,0.000120734,0.0001011581,0.0001586891,0.0002834412,0.00002320361,0.00002114914],"category_scores_gemma":[0.00001249958,0.00006615743,0.0000246884,0.0002205775,0.00001751085,0.00177008,0.00002771217,0.00006509983,0.0001544036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002293385,"about_ca_system_score_gemma":0.000008403581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000599779,"about_ca_topic_score_gemma":2.919634e-7,"domain_scores_codex":[0.9993365,0.000009983026,0.0002510253,0.00008218946,0.0002164467,0.0001038783],"domain_scores_gemma":[0.9994926,0.00001524243,0.0001797781,0.0002323342,0.00005245154,0.00002755978],"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.000004016792,0.000133673,0.0004028401,0.0002689578,0.00001434045,0.000001937864,0.0103277,0.01007572,0.01824251,0.0271306,0.01110044,0.9222972],"study_design_scores_gemma":[0.0005165607,0.00005270046,0.002159071,0.0001072881,0.000007194193,0.00001794944,0.00005172137,0.9635645,0.02397595,0.0003295425,0.008937902,0.0002796813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1323082,0.000009342842,0.8638149,0.003117946,0.00004978589,0.00008325688,0.00000589967,0.0001076635,0.0005030527],"genre_scores_gemma":[0.9937991,0.000001967334,0.003837089,0.002293193,0.0000134897,0.000016963,0.0000241693,0.000002511635,0.00001153442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9534887,"threshold_uncertainty_score":0.2697822,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001053362,0.00008189059,0.00008642789,0.00006447307,0.00008926773,0.0000670108,0.00009409544,0.00001466347,0.00005777465],"category_scores_gemma":[0.000007293394,0.0000759804,0.00003446454,0.0001171029,0.00001843198,0.0007988684,0.00002105427,0.00005735449,0.00002656525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001802809,"about_ca_system_score_gemma":0.0000208861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002234382,"about_ca_topic_score_gemma":6.146497e-7,"domain_scores_codex":[0.9993708,0.0000132505,0.000310952,0.00007240449,0.0001266795,0.0001059213],"domain_scores_gemma":[0.9994223,0.00001309938,0.0003326916,0.0001029234,0.0001025121,0.00002644216],"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.0001062064,0.0004194206,0.004378697,0.0004461366,0.0001196296,9.531191e-8,0.01008123,0.001540057,0.08587708,0.3523425,0.003908817,0.5407801],"study_design_scores_gemma":[0.004131583,0.000145272,0.004832833,0.0004248125,0.0001084169,9.535241e-7,0.003474859,0.778294,0.08976739,0.02382319,0.09405548,0.0009412194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08166662,0.000002526679,0.9163237,0.000515414,0.00005276237,0.0002055681,0.00001607713,0.0000260442,0.001191277],"genre_scores_gemma":[0.9959967,1.881693e-7,0.003253723,0.000508354,0.00003973546,0.00006034309,0.0001237977,0.000005672405,0.00001155296],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.91433,"threshold_uncertainty_score":0.3098391,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002923206,0.0001124517,0.0001046761,0.0001184099,0.0002803227,0.0008642741,0.0004499764,0.00006518028,0.000007571961],"category_scores_gemma":[0.00003788271,0.00009879375,0.00003617209,0.0003616574,0.00002820485,0.003797554,0.00006407798,0.0002297776,0.0001151798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004437565,"about_ca_system_score_gemma":0.00007672142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001258031,"about_ca_topic_score_gemma":0.000004884163,"domain_scores_codex":[0.9990025,0.00001656484,0.0003976652,0.0001191742,0.0002335551,0.0002304995],"domain_scores_gemma":[0.999326,0.00002189303,0.0002116977,0.0002134252,0.0001745074,0.00005247332],"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.00002367374,0.00004343665,0.001426868,0.0004840318,0.00005371011,0.00001770666,0.0184196,0.01386416,0.01283473,0.1622574,0.03815368,0.752421],"study_design_scores_gemma":[0.0005015944,0.00001434544,0.001533077,0.0001389352,0.00000361216,0.0001643623,0.000182118,0.7441759,0.002664429,0.0004882983,0.2496601,0.0004732546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05318709,0.000004734873,0.9379524,0.006482888,0.001313292,0.00008849589,0.000001879925,0.0002826897,0.0006865368],"genre_scores_gemma":[0.9707412,4.124381e-7,0.02222775,0.006845779,0.0001270095,0.0000173503,0.0000240121,0.000004050705,0.00001251271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.917554,"threshold_uncertainty_score":0.8334215,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004834419,0.00008688417,0.00006098131,0.0002988398,0.0003031385,0.0004212045,0.0002474562,0.00003270383,0.000008081775],"category_scores_gemma":[0.00003537732,0.00008619382,0.00003053675,0.0005269408,0.00001799247,0.00473308,0.00005447781,0.00008559851,0.00005546576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005592063,"about_ca_system_score_gemma":0.00005087287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007440494,"about_ca_topic_score_gemma":0.000001358571,"domain_scores_codex":[0.9990669,0.00001078226,0.0003004764,0.0001022174,0.0003095008,0.0002101207],"domain_scores_gemma":[0.9995748,0.00003176243,0.0001431753,0.0001210881,0.00007179862,0.00005737654],"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.000008728203,0.00001261466,0.0003061228,0.00003856293,0.00000551769,0.000003248484,0.006984244,0.002893696,0.007720265,0.005813982,0.00228771,0.9739253],"study_design_scores_gemma":[0.001455381,0.00006308016,0.05715766,0.0001165123,0.000009567408,0.0001369614,0.0003382414,0.8369568,0.01345731,0.002003913,0.0874569,0.0008476896],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.119898,0.00001793611,0.8764008,0.001991376,0.0002562301,0.00006470145,4.302548e-7,0.0001638601,0.001206603],"genre_scores_gemma":[0.9298236,3.43765e-7,0.05690966,0.01311006,0.0001071185,0.00000390112,0.00001692124,0.000002815672,0.00002552564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9730776,"threshold_uncertainty_score":0.4061684,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006891066,0.00006874814,0.0000737575,0.0001924532,0.0002432942,0.0004029033,0.0007548845,0.00002872172,0.000006436109],"category_scores_gemma":[0.00008334606,0.00005457719,0.00003056627,0.001215026,0.00009622178,0.003267015,0.0002021819,0.0001338291,0.0001349357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000019191,"about_ca_system_score_gemma":0.00009356212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001122949,"about_ca_topic_score_gemma":3.300318e-7,"domain_scores_codex":[0.9987956,0.00005226623,0.00029066,0.0001021513,0.0005101404,0.0002491789],"domain_scores_gemma":[0.9992898,0.00007653111,0.0001212789,0.0002643272,0.000200258,0.00004785175],"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.00000392661,0.000007699789,0.0001884148,0.00009857197,0.000005468317,9.461181e-7,0.01237921,0.8591527,0.0009480509,0.0007924685,0.003879789,0.1225427],"study_design_scores_gemma":[0.0001810944,0.0000159169,0.003936589,0.00004291116,0.000001173871,0.000003786746,0.0002171279,0.9918381,0.001838593,0.00004958636,0.001787622,0.00008748439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04263834,0.00000942873,0.9405947,0.01568319,0.00009459777,0.000202109,0.000001858957,0.0002485074,0.0005272182],"genre_scores_gemma":[0.9616261,0.00001148608,0.03530186,0.002914593,0.00002211216,0.00002917193,0.00001578015,0.0000056206,0.00007324688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9189878,"threshold_uncertainty_score":0.3885206,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003076537,0.00007550915,0.00006331121,0.0001224147,0.0001237638,0.0001688948,0.0002536348,0.00002195791,0.000002306219],"category_scores_gemma":[0.00002871524,0.00005577386,0.00003217722,0.0002272279,0.00001923712,0.001145037,0.00001741955,0.00004352704,0.00001796019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002360707,"about_ca_system_score_gemma":0.00004159663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005030331,"about_ca_topic_score_gemma":6.833417e-7,"domain_scores_codex":[0.9992375,0.00001860865,0.0002862646,0.00008285642,0.0002551738,0.0001195904],"domain_scores_gemma":[0.9994223,0.000105661,0.0002334977,0.0001166363,0.0001063766,0.00001554032],"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.0001083107,0.0001299585,0.0002056332,0.0005448811,0.00005878915,0.000001088743,0.007675482,0.1426451,0.009320333,0.4819097,0.1283145,0.2290862],"study_design_scores_gemma":[0.002425703,0.0003182938,0.002997676,0.0003028616,0.00002810937,0.00002831412,0.0001437808,0.7398568,0.04038079,0.1217855,0.09106502,0.0006672223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05577536,0.000007170423,0.9289739,0.01411476,0.00008124109,0.0002942042,0.000008423298,0.00004926055,0.0006956568],"genre_scores_gemma":[0.9088579,4.610666e-7,0.07674341,0.01410056,0.00007077986,0.00006318129,0.0001205555,0.000004482361,0.00003868379],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8530825,"threshold_uncertainty_score":0.2274392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}