{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":83,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":83,"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":"c43675f49fc6","filters":{"venue":"Theory of Computing Systems"}},"results":[{"id":"W1971393213","doi":"10.1007/s00224-007-1345-z","title":"An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"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":"Parameterized complexity; Feedback vertex set; Combinatorics; Undirected graph; Mathematics; Vertex (graph theory); Algorithm; Bounded function; Running time; Exponential function; Vertex cover; Function (biology); Time complexity; Binary logarithm; Graph; Exponential time hypothesis; Set (abstract data type); Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02914474183978229,"gpt":0.3172132712211289,"spread":0.2880685293813466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01049746,0.0002610569,0.0004218546,0.0002349932,0.0004880325,0.0001739699,0.002488953,0.0001076496,0.000003424278],"category_scores_gemma":[0.0001181022,0.000193562,0.0001410716,0.0008785975,0.0002971901,0.0003098686,0.0002809905,0.0002669246,0.00001804065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008161678,"about_ca_system_score_gemma":0.00009238631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003254181,"about_ca_topic_score_gemma":0.000003886331,"domain_scores_codex":[0.9966499,0.0007277011,0.0006609894,0.0005618755,0.0005985305,0.0008010585],"domain_scores_gemma":[0.9935334,0.004191169,0.000362862,0.001288206,0.0004511951,0.0001731111],"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.00007016467,0.00009142618,0.00005864256,0.000121035,0.0001097842,0.000006341721,0.003065785,0.004583657,0.001725445,0.6826939,0.0002168137,0.307257],"study_design_scores_gemma":[0.001061015,0.0005066234,0.0009361132,0.0002630476,0.00002333496,0.00006573248,0.001515705,0.8656185,0.003055497,0.1247654,0.001741103,0.00044799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01608377,0.0004943199,0.9797782,0.0000589406,0.0009438896,0.001255197,0.00001330149,0.0003842512,0.000988084],"genre_scores_gemma":[0.9232524,0.000003759571,0.07604267,0.00005786703,0.0002396446,0.00001970741,0.000006961816,0.00004085786,0.0003361173],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9071686,"threshold_uncertainty_score":0.7893231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041354954","doi":"10.1007/s00224-005-1263-x","title":"Algebraic Results on Quantum Automata","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Sherbrooke; University of Waterloo","funders":"","keywords":"Class (philosophy); Automaton; Construct (python library); Quantum finite automata; Algebraic number; Computer science; Algebraic theory; Quantum; Algebra over a field; Cellular automaton; Quantum cellular automaton; Regular language; Theoretical computer science; Boolean function; Discrete mathematics; Mathematics; Automata theory; Pure mathematics; Programming language; Algorithm; Artificial intelligence; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01856083936426342,"gpt":0.2465511724309238,"spread":0.2279903330666604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003508482,0.0002229776,0.0003920674,0.0001886687,0.0001485586,0.0001230944,0.001529076,0.00008326391,0.000003943015],"category_scores_gemma":[0.0001423557,0.0001908805,0.0001089672,0.0003164985,0.00009295484,0.0002290188,0.0002797412,0.0001616882,0.0002360228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005271844,"about_ca_system_score_gemma":0.00004569772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001410756,"about_ca_topic_score_gemma":3.327004e-7,"domain_scores_codex":[0.9974395,0.0005424063,0.0007144012,0.0004738432,0.0004388835,0.0003909501],"domain_scores_gemma":[0.9969974,0.001130773,0.0004344606,0.001268754,0.00007329636,0.00009534602],"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.00003634782,0.00009206709,0.000005319902,0.0000427229,0.00002575907,0.000005658167,0.001542194,0.004612152,0.0004723646,0.9538585,0.001529652,0.03777726],"study_design_scores_gemma":[0.001237094,0.0003157291,0.0008357941,0.0006718183,0.000009837233,0.00008259965,0.000220849,0.9559972,0.002736508,0.03214293,0.005328824,0.0004208511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5343831,0.0006139514,0.4358933,0.0008592631,0.002215834,0.0004153698,0.00001540108,0.001636194,0.02396761],"genre_scores_gemma":[0.9961641,0.000003171245,0.002843246,0.0002319097,0.0003689293,0.000002314441,0.000003486922,0.00001937619,0.0003634003],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.951385,"threshold_uncertainty_score":0.7783881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049954052","doi":"10.1007/s00224-005-1223-5","title":"Rendezvous and Election of Mobile Agents: Impact of Sense of Direction","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Leader election; Correctness; Computer science; Constructive proof; Node (physics); Context (archaeology); Asynchronous communication; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Protocol (science); Theoretical computer science; Computer network; Distributed computing; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0150854146727756,"gpt":0.2905820463513931,"spread":0.2754966316786175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132437,0.00007725947,0.000283701,0.0001693187,0.00003290799,0.00001113918,0.0001363683,0.00004135877,0.000004190673],"category_scores_gemma":[0.00004382272,0.00006709342,0.00006864405,0.0003314825,0.00007425799,0.0001249563,0.00006282636,0.00005220262,5.320526e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003297922,"about_ca_system_score_gemma":0.00004117507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001359248,"about_ca_topic_score_gemma":0.000001356192,"domain_scores_codex":[0.9987155,0.0003471116,0.0004845157,0.0001364069,0.0002022739,0.0001141873],"domain_scores_gemma":[0.9988036,0.0001877162,0.0005032063,0.0002330812,0.0002369133,0.00003549863],"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.00008647148,0.0003239149,0.00173078,0.0006803538,0.0001807411,5.833155e-7,0.01077656,0.8300089,0.05382067,0.03805307,0.0001816607,0.06415626],"study_design_scores_gemma":[0.0005038901,0.0006826978,0.003733787,0.0003086457,0.00001104438,0.00003817168,0.000185806,0.9769039,0.01700847,0.0004769669,0.00004331809,0.0001033494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6903936,0.0002675542,0.3077745,0.000005080551,0.0001179351,0.0002051344,0.000002264289,0.00003589722,0.001198086],"genre_scores_gemma":[0.9972191,0.00002300326,0.002634309,0.000001873406,0.00002800052,0.000001266826,8.813063e-7,0.000005475968,0.00008607895],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3068255,"threshold_uncertainty_score":0.273599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1533036729","doi":"10.1007/s00224-013-9515-7","title":"Quotient Complexity of Closed Languages","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Suffix; Concatenation (mathematics); Prefix; Closure (psychology); Regular language; Complement (music); Subsequence; Formal language; Abstract family of languages; Mathematics; Quotient; Computer science; Discrete mathematics; Transitive closure; Word (group theory); Combinatorics; Theoretical computer science; Algorithm; Automaton; Linguistics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02442731279508152,"gpt":0.2479190127007407,"spread":0.2234916999056592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232685,0.0001368576,0.0003914699,0.0001058149,0.00005999473,0.00005091294,0.0009703396,0.00004770158,0.00002295067],"category_scores_gemma":[0.00004661596,0.0001137163,0.00009377233,0.0002108495,0.000231045,0.0001552464,0.0002733566,0.00007964016,0.00004332475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001802623,"about_ca_system_score_gemma":0.00002483318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002155467,"about_ca_topic_score_gemma":3.999223e-7,"domain_scores_codex":[0.9983271,0.0004232484,0.0005098768,0.0002264819,0.0002788369,0.0002344354],"domain_scores_gemma":[0.9982559,0.0004547449,0.0004147523,0.0006716794,0.0001440661,0.00005886463],"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.000003552063,0.00006781546,0.0002239608,0.0001701407,0.00003275048,0.000001377339,0.002344917,0.0005947466,0.006275971,0.9809688,0.0002705406,0.009045415],"study_design_scores_gemma":[0.001448123,0.0004771208,0.05262851,0.001343066,0.0000309948,0.00008765712,0.005548912,0.6431879,0.02868062,0.2654893,0.0002446733,0.0008330423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7030852,0.0004334663,0.2908066,0.00004795851,0.0004512504,0.000250069,0.000002945488,0.0001743404,0.004748171],"genre_scores_gemma":[0.9942707,0.000001077296,0.005493982,0.00004110542,0.00007091604,0.000002813097,0.000001720923,0.000009510618,0.0001082009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7154795,"threshold_uncertainty_score":0.4637216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068458312","doi":"10.1007/s00224-010-9263-x","title":"Randomness on Computable Probability Spaces—A Dynamical Point of View","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Randomness; Ergodic theory; Mathematics; Pointwise; Point (geometry); Mixing (physics); Computable analysis; Discrete mathematics; Pure mathematics; Computable function; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01555738778436423,"gpt":0.2465730864953659,"spread":0.2310156987110017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007861274,0.0003881883,0.001259194,0.0002041475,0.0001492752,0.0001294365,0.002087791,0.0001872035,0.00001418903],"category_scores_gemma":[0.0004713185,0.0003273987,0.0002883295,0.0006582173,0.0004905117,0.000197021,0.0008170923,0.0005595168,0.00002121605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008153674,"about_ca_system_score_gemma":0.0001593346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008449632,"about_ca_topic_score_gemma":0.00000593202,"domain_scores_codex":[0.9951428,0.001381552,0.001309872,0.0008412601,0.0007736141,0.0005508782],"domain_scores_gemma":[0.9937348,0.002892331,0.0007846853,0.001901293,0.0005056312,0.0001812671],"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.0001201584,0.0009295724,0.001150646,0.001135318,0.00008658071,0.000006327765,0.001909972,0.04166989,0.002247403,0.9180165,0.00004865502,0.03267901],"study_design_scores_gemma":[0.001945022,0.0004826972,0.004238723,0.0004885332,0.00002424902,0.00009997301,0.00008763972,0.8944809,0.001644096,0.09583446,0.0001755963,0.0004981415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5077227,0.00009392373,0.4875484,0.0001114397,0.002056898,0.0007673673,0.000004330657,0.0002334153,0.001461561],"genre_scores_gemma":[0.973053,8.786462e-7,0.02666452,0.0000329781,0.0001816316,0.000009024814,0.000002298362,0.00002277593,0.00003282134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.852811,"threshold_uncertainty_score":0.9999178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975859913","doi":"10.1007/s00224-013-9455-2","title":"Linear-Space Data Structures for Range Mode Query in Arrays","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Range (aeronautics); Mode (computer interface); Space (punctuation); Range query (database); Computer science; Information retrieval; Web search query; Sargable; Engineering; Aerospace engineering; Search engine","retraction":null,"screen_n_in":null,"score":{"opus":0.0389336755502249,"gpt":0.2943412708216168,"spread":0.2554075952713918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205313,0.0001564788,0.0003473081,0.0001078464,0.00009052629,0.0001128188,0.002062894,0.00007220943,0.000003363812],"category_scores_gemma":[0.00009673699,0.0001268277,0.0000395807,0.0001717076,0.00005018348,0.0005519494,0.000802729,0.0001180921,0.000008746792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002110237,"about_ca_system_score_gemma":0.00005087814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005517952,"about_ca_topic_score_gemma":0.000004585577,"domain_scores_codex":[0.9983643,0.000245875,0.0004263323,0.0004434472,0.0002298152,0.0002901995],"domain_scores_gemma":[0.9974872,0.0006392183,0.0002494848,0.00145651,0.0001050435,0.00006249962],"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.00005701831,0.0001440715,0.001051667,0.0007350829,0.00006983699,0.000006062059,0.004487226,0.06751255,0.003372224,0.853708,0.009775341,0.05908095],"study_design_scores_gemma":[0.000419565,0.00003634852,0.0009234732,0.0002119396,0.000003409272,0.000008597105,0.0001463424,0.975226,0.000200459,0.02205515,0.0006109291,0.0001577399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05022053,0.0004913533,0.9474423,0.00009289877,0.0007988564,0.0005591408,0.00003630398,0.0001016309,0.0002569938],"genre_scores_gemma":[0.9060241,0.000003313127,0.0935621,0.00003485138,0.0002516838,0.000009542418,0.00003139627,0.00001326418,0.0000697413],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9077135,"threshold_uncertainty_score":0.5171884,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046773087","doi":"10.1007/s00224-011-9341-8","title":"Searching for Black Holes in Subways","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Government of Canada; University of Ottawa","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.07450081417601022,"gpt":0.2626419194833614,"spread":0.1881411053073511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002678007,0.0001209747,0.0003035624,0.0001278353,0.0000706352,0.00004494607,0.000709548,0.00006002252,0.000001777329],"category_scores_gemma":[0.00001378389,0.000110984,0.00006803585,0.0001756985,0.0001732026,0.0001098387,0.0001561386,0.0001148752,0.000008123251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001899008,"about_ca_system_score_gemma":0.00005536164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003858703,"about_ca_topic_score_gemma":0.000001093888,"domain_scores_codex":[0.9985488,0.0002571643,0.000438788,0.0002590633,0.0001689849,0.0003271928],"domain_scores_gemma":[0.9986504,0.0006179065,0.0001966448,0.0003919926,0.00007362738,0.00006937338],"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.0000272008,0.00004737536,0.0004229247,0.0001409601,0.00001476087,0.000009538708,0.007926973,0.001271997,0.00005341825,0.9596658,0.0000793443,0.03033967],"study_design_scores_gemma":[0.0003601121,0.00008070198,0.0004841004,0.0003369698,0.000004425731,0.00001338831,0.0004448369,0.9325532,0.00009021908,0.06540983,0.0000722837,0.0001498867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1106906,0.0001371659,0.8771511,0.00001032356,0.0004898667,0.0002644303,0.000001401817,0.00008621001,0.01116894],"genre_scores_gemma":[0.9892527,0.000002251464,0.01048017,0.00003018555,0.0001124105,0.000003417769,0.00000123373,0.00001130055,0.0001062873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9312813,"threshold_uncertainty_score":0.4525796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068006581","doi":"10.1007/s00224-005-1269-4","title":"A Simple 3-Edge-Connected Component Algorithm","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Simple (philosophy); Component (thermodynamics); Enhanced Data Rates for GSM Evolution; Algorithm; Computer science; Mathematics; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01438137595860442,"gpt":0.238066302380063,"spread":0.2236849264214586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002161707,0.0002264735,0.0005171042,0.0001797712,0.0001993752,0.0001525543,0.0009655135,0.00009956098,0.00002051763],"category_scores_gemma":[0.00003644131,0.0002044019,0.0001539803,0.0003689582,0.00006647685,0.0002247504,0.0002288459,0.0001721436,0.00009704413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009043537,"about_ca_system_score_gemma":0.00004132627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007076583,"about_ca_topic_score_gemma":0.000002582566,"domain_scores_codex":[0.9972793,0.0006913934,0.0008366154,0.0004122881,0.0003614475,0.0004188936],"domain_scores_gemma":[0.9978924,0.0005774929,0.0004437951,0.0007264797,0.0002462351,0.0001135908],"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.00001365801,0.000184039,0.0001193452,0.0001244135,0.0001663879,0.00001159658,0.00452014,0.03406023,0.001535624,0.704784,0.004035224,0.2504454],"study_design_scores_gemma":[0.0004659448,0.00009700737,0.0003546124,0.0001880734,0.000007555183,0.0001269747,0.0002604501,0.9856399,0.000574426,0.001476492,0.01055355,0.0002549877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09164189,0.0005173364,0.9013248,0.00007570471,0.002017727,0.0003090915,0.000003273846,0.0004074948,0.003702694],"genre_scores_gemma":[0.9910638,0.000001958544,0.007592904,0.000108275,0.0009208221,0.000006426189,0.000004156772,0.00001933532,0.0002822647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9515797,"threshold_uncertainty_score":0.833527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963052257","doi":"10.1007/s00224-016-9718-9","title":"From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Consistency (knowledge bases); Database; Causality (physics); Database theory; Representation (politics); Information retrieval; Database design; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1368537231830043,"gpt":0.3660417987277245,"spread":0.2291880755447202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00764129,0.0001386859,0.000355032,0.000208553,0.0001711477,0.0002492447,0.0004729057,0.00003032749,0.00001887303],"category_scores_gemma":[0.003110609,0.00008638229,0.00004702975,0.0002128246,0.0002028589,0.0001485258,0.0004541624,0.00002422495,0.00002660034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001593274,"about_ca_system_score_gemma":0.00003056515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001159369,"about_ca_topic_score_gemma":0.00001145837,"domain_scores_codex":[0.9976448,0.0003042564,0.0006108154,0.0007388868,0.000485672,0.0002155328],"domain_scores_gemma":[0.9898008,0.008642592,0.0002663402,0.0009730514,0.0001876469,0.0001295536],"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.001039239,0.0003340429,0.04392662,0.0007048999,0.0002759285,0.00001133394,0.01283573,0.04413516,0.006114618,0.1970485,0.2817384,0.4118355],"study_design_scores_gemma":[0.002367772,0.000370674,0.003982387,0.002758038,0.0001001836,0.000005003749,0.005665752,0.8611471,0.003240953,0.08598635,0.03354578,0.0008299714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5026913,0.000184877,0.4955091,0.0003238039,0.0005147476,0.0003133178,0.0002875236,0.00004077069,0.0001346707],"genre_scores_gemma":[0.9867042,0.000003013452,0.01237171,0.00009194985,0.000102554,0.00001177248,0.000006715964,0.00001023693,0.0006978572],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.817012,"threshold_uncertainty_score":0.3723914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976011284","doi":"10.1007/s00224-007-9085-7","title":"A Randomized Algorithm for Online Unit Clustering","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Online algorithm; Randomized algorithm; Cluster analysis; Partition (number theory); Upper and lower bounds; Extension (predicate logic); Computer science; Set (abstract data type); Mathematics; Combinatorics; Unit (ring theory); Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04092833779722757,"gpt":0.3136730632364606,"spread":0.272744725439233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009720013,0.0001225452,0.0004702277,0.0001873964,0.0001151214,0.00007713279,0.0006015002,0.00005411366,0.000002160137],"category_scores_gemma":[0.0001716786,0.0001048349,0.000124032,0.0003077662,0.0000900528,0.0001117018,0.0001679112,0.00008661789,0.000003286844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002044963,"about_ca_system_score_gemma":0.00004112185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001563032,"about_ca_topic_score_gemma":0.000001423307,"domain_scores_codex":[0.9981464,0.0004444864,0.0006319733,0.0002219775,0.0002378714,0.0003173499],"domain_scores_gemma":[0.9968175,0.002218103,0.0002870994,0.0003253452,0.0002678426,0.00008411201],"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.001804179,0.0001489649,0.000007124111,0.0002936435,0.0001367808,0.000004659466,0.003795879,0.07001206,0.0001785031,0.5505238,0.00006368354,0.3730307],"study_design_scores_gemma":[0.02596869,0.00004934861,0.000008433529,0.0001447606,0.000006654476,0.00001386503,0.0001400174,0.9699624,0.0001040875,0.003109617,0.0003774452,0.0001147478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002237346,0.0001917936,0.9945263,0.0000464123,0.0006976996,0.0008611016,0.000003774213,0.0001941063,0.001241423],"genre_scores_gemma":[0.4292733,0.000005109,0.5697158,0.00008884825,0.0002034775,0.000006966501,0.000008474633,0.00001726519,0.0006807377],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8999503,"threshold_uncertainty_score":0.4275042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045637260","doi":"10.1007/s002240010006","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","year":2000,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Mobile ad hoc network; Wireless; Ad hoc wireless distribution service; Vehicular ad hoc network; Telecommunications; Optimized Link State Routing Protocol","retraction":null,"screen_n_in":null,"score":{"opus":0.01325314377154978,"gpt":0.2421604035834294,"spread":0.2289072598118796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00219547,0.0001807954,0.0003639483,0.00005575086,0.0002406874,0.0001984395,0.001491798,0.00009949687,0.000007482318],"category_scores_gemma":[0.000008058631,0.0001729398,0.0001021168,0.0002833141,0.0001278692,0.0001021333,0.0001519639,0.0001539902,0.00001030093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000438431,"about_ca_system_score_gemma":0.00006076913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001030281,"about_ca_topic_score_gemma":0.000001634894,"domain_scores_codex":[0.9979827,0.0005488781,0.0005549241,0.0003208775,0.0002259868,0.0003666244],"domain_scores_gemma":[0.9972703,0.001059832,0.0003101685,0.001153159,0.0001418849,0.00006461698],"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.00001917173,0.00003209004,0.00000249798,0.00004151862,0.00001713031,6.040476e-7,0.001035286,0.5852122,0.00001549965,0.3288504,0.0001147971,0.08465882],"study_design_scores_gemma":[0.000347957,0.00009158481,0.00008187633,0.000321122,0.000009102512,0.00002079071,0.0003085449,0.9928686,0.0000143668,0.004813152,0.0009463626,0.00017651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.177908,0.00379933,0.8140125,0.00002832995,0.0004051761,0.0005712346,0.000001327361,0.0002323881,0.003041646],"genre_scores_gemma":[0.9931213,0.00003477458,0.006427863,0.00004023029,0.0001249144,0.00002782585,0.000004996548,0.00001942971,0.000198695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8152133,"threshold_uncertainty_score":0.7052281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965378629","doi":"10.1007/s00224-011-9349-0","title":"Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Speedup; Multiprocessing; Competitive analysis; Scaling; Parallel computing; Computer science; Upper and lower bounds; Constant (computer programming); Omega; Randomized algorithm; Mathematics; Algorithm; Physics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05319425553936011,"gpt":0.251091094211444,"spread":0.1978968386720839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228425,0.000155037,0.0003544703,0.0001651812,0.00007033991,0.00003159108,0.0007683503,0.00004080295,0.000006901354],"category_scores_gemma":[0.0001578126,0.0001167894,0.00003931956,0.000629233,0.000141443,0.0002120543,0.00009717804,0.0001132239,0.000007004366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001055151,"about_ca_system_score_gemma":0.0001807982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000348302,"about_ca_topic_score_gemma":9.581643e-7,"domain_scores_codex":[0.9983804,0.0002297734,0.0004589176,0.0002868623,0.0004092335,0.0002347664],"domain_scores_gemma":[0.9982486,0.0004218296,0.0004349974,0.0003933293,0.0004266429,0.00007458926],"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.0006696766,0.00181728,0.005800352,0.03118405,0.0004122283,0.00003905256,0.07350419,0.08222129,0.001871221,0.7933862,0.0002017393,0.008892682],"study_design_scores_gemma":[0.004510429,0.003492009,0.004104801,0.04756336,0.00007918215,0.0001918222,0.004608482,0.8263656,0.09448975,0.01277137,0.00009304844,0.001730084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2381855,0.001071224,0.7371658,0.00004034875,0.0002439015,0.0007306334,0.000003769491,0.0002836814,0.02227517],"genre_scores_gemma":[0.980138,0.00002270848,0.01960221,0.0000731969,0.00003089213,0.000002092802,0.000001299375,0.0000148328,0.0001147698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7806149,"threshold_uncertainty_score":0.4762534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062214685","doi":"10.1007/s00224-007-1329-z","title":"A Faster FPT Algorithm for the Maximum Agreement Forest Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"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":"Disjoint sets; Partition (number theory); Combinatorics; Cardinality (data modeling); Phylogenetic tree; Mathematics; Time complexity; Order (exchange); Binary number; Running time; Set (abstract data type); Algorithm; Pairwise comparison; Computer science; Statistics; Chemistry; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.01855616429137116,"gpt":0.2557037684314387,"spread":0.2371476041400675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004441482,0.0001823529,0.0002725608,0.00008884665,0.0002972208,0.0001417035,0.001326722,0.00006077657,0.000002442075],"category_scores_gemma":[0.000018,0.0001163357,0.0001096507,0.0002054768,0.00008199493,0.0001773241,0.0004864645,0.0001109875,0.00001234579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003652105,"about_ca_system_score_gemma":0.00003637314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004993234,"about_ca_topic_score_gemma":0.000003120674,"domain_scores_codex":[0.9981308,0.0001250742,0.0005696355,0.0003467797,0.0003940283,0.000433703],"domain_scores_gemma":[0.9974259,0.00116198,0.0003631155,0.0007997769,0.0001748228,0.00007438366],"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.00001974305,0.00007396864,0.0000757517,0.0001124027,0.00006900489,0.000004496803,0.001625706,0.002407191,0.0001239663,0.1919388,0.0009102648,0.8026387],"study_design_scores_gemma":[0.0007068893,0.0002131929,0.001066662,0.0003220066,0.00001976189,0.00004578444,0.0005608189,0.9676607,0.0002940334,0.0154655,0.01340186,0.0002428029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001733458,0.0006182146,0.9939879,0.0000802282,0.001276722,0.000891523,0.000009399927,0.000103035,0.001299586],"genre_scores_gemma":[0.7694824,0.00000390157,0.2292921,0.0001176546,0.0005902268,0.00002113542,0.000007480704,0.00002110794,0.0004640488],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9652535,"threshold_uncertainty_score":0.4744031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978605527","doi":"10.1007/s00224-003-1109-3","title":"Nesting Until and Since in Linear Temporal Logic","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"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":"Decidability; Linear temporal logic; Nesting (process); Characterization (materials science); Temporal logic; Hierarchy; Property (philosophy); Interval temporal logic; Class (philosophy); Mathematics; Computation tree logic; Algebraic number; Semigroup; Discrete mathematics; Substitution (logic); Computer science; Algebra over a field; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02136815477456146,"gpt":0.2464909145574841,"spread":0.2251227597829226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003327515,0.0001419648,0.0003097887,0.0001245605,0.00008129835,0.00006451952,0.0004238356,0.00005763557,0.000001267174],"category_scores_gemma":[0.0001893924,0.0001265154,0.00003316206,0.0003320996,0.00009558298,0.0001525315,0.000136236,0.0001213911,0.000006010828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002114281,"about_ca_system_score_gemma":0.00004054409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004316156,"about_ca_topic_score_gemma":0.00000101611,"domain_scores_codex":[0.998226,0.0006073053,0.0004283913,0.0003024192,0.0001634862,0.0002723422],"domain_scores_gemma":[0.9986304,0.000676189,0.0002299668,0.0003655763,0.0000441387,0.00005372175],"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.000003470499,0.00002923649,0.004572111,0.0001007095,0.000005662133,0.00001590139,0.001104726,0.002221641,0.0004801946,0.9886429,0.000007871395,0.002815624],"study_design_scores_gemma":[0.001193553,0.0001926661,0.00718502,0.001345983,0.000009707592,0.0003970311,0.001456211,0.8127363,0.00136551,0.1728901,0.0005740552,0.0006538462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.631668,0.001036374,0.3642816,0.0000348729,0.0005461259,0.0001414935,4.58818e-7,0.0001442005,0.00214691],"genre_scores_gemma":[0.9872039,0.000002298418,0.01261009,0.00005793701,0.00004461412,0.00000113185,4.032869e-7,0.000009375307,0.0000702282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8157528,"threshold_uncertainty_score":0.5159148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036493899","doi":"10.1007/s00224-014-9591-3","title":"On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Manitoba; Dalhousie University","funders":"","keywords":"Minimum spanning tree; Spanning tree; Mathematics; Parameterized complexity; Disjoint sets; Euclidean minimum spanning tree; Minimum weight; Combinatorics; Connected dominating set; Euclidean geometry; Steiner tree problem; Approximation algorithm; Set (abstract data type); Point (geometry); Mathematical proof; Kruskal's algorithm; Mathematical optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01034062075288837,"gpt":0.2233376238070862,"spread":0.2129970030541978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295457,0.0001907694,0.0003127783,0.0002108729,0.0001706407,0.0001269678,0.0003740219,0.000055188,0.000002253349],"category_scores_gemma":[0.00006948118,0.0001539068,0.00004059586,0.000330976,0.0000776884,0.0001549674,0.0001036641,0.00009951801,0.000008240789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001757398,"about_ca_system_score_gemma":0.00003686078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006357379,"about_ca_topic_score_gemma":6.939941e-7,"domain_scores_codex":[0.998306,0.0003801248,0.0003492786,0.0003890167,0.0003448438,0.0002307761],"domain_scores_gemma":[0.9980161,0.001129618,0.0002677573,0.0003781884,0.0001188128,0.00008953879],"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.00005968291,0.00006283294,0.0003853079,0.0000894254,0.00004834692,0.000003685261,0.001635687,0.05023658,0.0008455735,0.9002172,0.0001761692,0.04623956],"study_design_scores_gemma":[0.001104659,0.001001067,0.006105708,0.0005070854,0.0000216457,0.0000916009,0.0001361519,0.9507629,0.00139531,0.03780262,0.0006827927,0.0003884927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3627776,0.0001913174,0.6330203,0.00006906904,0.0003680324,0.0001176321,6.722325e-7,0.00008336267,0.003372018],"genre_scores_gemma":[0.9899843,0.000001554296,0.009478426,0.000104279,0.0002416071,0.000002815976,0.000003169489,0.00001276113,0.0001710407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9005263,"threshold_uncertainty_score":0.6276135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028556486","doi":"10.1007/s00224-011-9333-8","title":"The Complexity of the List Homomorphism Problem for Graphs","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Concordia University; McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Homomorphism; Combinatorics; Mathematics; Algebraic number; Discrete mathematics; Computational complexity theory; Graph; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.09207204870786918,"gpt":0.2876164445971816,"spread":0.1955443958893124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004921438,0.0001668691,0.0003412216,0.00008760834,0.0005902821,0.00004978219,0.003239865,0.00005264356,0.000001773141],"category_scores_gemma":[0.0001584688,0.00009624876,0.0002268834,0.0005636332,0.001924054,0.0001159661,0.0006105463,0.0001819808,0.000002096943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002361124,"about_ca_system_score_gemma":0.00007207795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005386514,"about_ca_topic_score_gemma":0.00000648249,"domain_scores_codex":[0.9972817,0.0009608248,0.0006117445,0.0002986725,0.0004257379,0.0004213023],"domain_scores_gemma":[0.9960842,0.001485594,0.0006193394,0.001354146,0.000397057,0.00005968],"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.00004991363,0.00004872679,0.0002382908,0.000133745,0.00004777887,3.552727e-7,0.002558144,0.0001199533,0.0006979476,0.993498,0.00009142636,0.002515671],"study_design_scores_gemma":[0.0003238625,0.0001442738,0.001237611,0.000187231,0.000009399439,0.00001814389,0.0003447894,0.01229394,0.004669146,0.9803484,0.0002952607,0.0001279021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06958145,0.0007362555,0.9192839,0.0002140008,0.001202314,0.001884021,0.00001762252,0.0001458922,0.006934594],"genre_scores_gemma":[0.9897566,0.000003421163,0.009908312,0.00001665173,0.00003527038,0.00002325908,4.677275e-7,0.00001642742,0.0002395552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9201752,"threshold_uncertainty_score":0.7089257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005304136","doi":"10.1007/s00224-013-9448-1","title":"Tight Bounds for Adopt-Commit Objects","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"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":"Commit; Upper and lower bounds; Binary logarithm; Combinatorics; Log-log plot; Matching (statistics); Mathematics; Deterministic algorithm; Discrete mathematics; Class (philosophy); Computer science; Statistics; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.01309922025277097,"gpt":0.2289366031529144,"spread":0.2158373829001435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376844,0.0002009867,0.0004747579,0.00009291845,0.0001951411,0.0003022316,0.001155269,0.00009254999,0.00000581019],"category_scores_gemma":[0.00006181602,0.0001742176,0.0001398866,0.0002755438,0.00007448367,0.0003024199,0.0001493108,0.00009809137,0.00007734901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004072948,"about_ca_system_score_gemma":0.00006164124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008232385,"about_ca_topic_score_gemma":0.000001113479,"domain_scores_codex":[0.9980788,0.0002276698,0.0006223055,0.0003646287,0.0002882488,0.0004183301],"domain_scores_gemma":[0.9978759,0.0005189391,0.000399905,0.0007634353,0.0003356107,0.0001062264],"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.000009035865,0.00007989014,0.0002586751,0.0004762822,0.00007558805,0.000001972155,0.002157779,0.001232497,0.001202497,0.9719194,0.008593715,0.01399267],"study_design_scores_gemma":[0.002794512,0.0006431103,0.006704916,0.00202357,0.00004106987,0.0001408752,0.001465078,0.8858272,0.002263507,0.04977811,0.04689555,0.001422532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05570958,0.000818577,0.9303771,0.00009128001,0.002067753,0.0008637592,0.00001168359,0.0002678598,0.009792455],"genre_scores_gemma":[0.9937248,0.000001078387,0.004917585,0.00006650035,0.0002583966,0.00004179386,0.000005376672,0.00001686763,0.00096761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9380152,"threshold_uncertainty_score":0.7104386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152951955","doi":"10.1007/s00224-002-1066-2","title":"Bulk Synchronous Parallel Algorithms for the External Memory Model","year":2002,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Parallel Computing and Optimization Techniques","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":"Carleton University","funders":"","keywords":"Computer science; Parallel computing; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0385649866126264,"gpt":0.26619390324245,"spread":0.2276289166298236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001941598,0.0002164954,0.0003543798,0.0001065151,0.0003707645,0.0001564367,0.001682345,0.00008313618,0.000003600909],"category_scores_gemma":[0.00006968733,0.0001628878,0.0001610549,0.0002014664,0.0001672595,0.0001401742,0.0002467953,0.000147658,0.0000105554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004351903,"about_ca_system_score_gemma":0.00003224255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002235076,"about_ca_topic_score_gemma":1.929915e-7,"domain_scores_codex":[0.9981161,0.0002333014,0.0005691702,0.0003787781,0.0003260666,0.0003766278],"domain_scores_gemma":[0.9974566,0.001048046,0.0004090526,0.0008174005,0.0002000285,0.00006883538],"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.000005772434,0.00004703852,0.000003613796,0.00004692231,0.00003042454,0.00000109442,0.00138032,0.7877758,0.00003055783,0.1831997,0.0009582521,0.02652046],"study_design_scores_gemma":[0.0003440201,0.00008137126,0.00001248278,0.0001322195,0.00001309591,0.00004205446,0.00005923544,0.9905988,0.0001450225,0.008242803,0.0001327264,0.000196156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009132111,0.003553829,0.9919,0.000174367,0.0007097262,0.0005893577,0.000002874122,0.0005696861,0.001586932],"genre_scores_gemma":[0.7395255,0.00002712951,0.2589427,0.00008477108,0.0002229779,0.00002250954,6.453168e-7,0.00001877675,0.001155021],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7386123,"threshold_uncertainty_score":0.6642371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071784365","doi":"10.1007/s00224-004-1190-2","title":"Complete Classifications for the Communication Complexity of Regular Languages","year":2004,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","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":"McGill University","funders":"","keywords":"Computer science; Programming language; Linguistics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.0637492406813639,"gpt":0.2897090998430529,"spread":0.225959859161689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002386243,0.0001097893,0.0002768926,0.00007031137,0.0002760616,0.00004965047,0.001666382,0.00004169313,0.000001513284],"category_scores_gemma":[0.00009135563,0.00008122697,0.0001079642,0.0002417657,0.0004810205,0.00009832564,0.0002081486,0.00008251884,0.000003293465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003121764,"about_ca_system_score_gemma":0.00003883582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001124407,"about_ca_topic_score_gemma":0.000003428082,"domain_scores_codex":[0.9986432,0.0003398659,0.0004772698,0.0001763783,0.0001981318,0.000165212],"domain_scores_gemma":[0.9964063,0.001558295,0.0005058712,0.001311248,0.0001900467,0.00002824622],"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.000006701514,0.00004434246,0.00001293976,0.00008524249,0.00003935586,1.079351e-7,0.002386552,0.004291133,0.002849857,0.9868461,0.00006758969,0.003370064],"study_design_scores_gemma":[0.001353414,0.0001601348,0.006427709,0.0007643943,0.00006076823,0.00004078984,0.005934454,0.2886851,0.005566822,0.6891312,0.001538559,0.0003366072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03245289,0.001654883,0.9636715,0.0007079871,0.0001847493,0.0004661553,0.00002537531,0.0001287991,0.000707642],"genre_scores_gemma":[0.9738693,0.000007553474,0.02596152,0.00004602355,0.00004462827,0.00001172455,0.00001157129,0.000009631177,0.00003810013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9414164,"threshold_uncertainty_score":0.331234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006913132","doi":"10.1007/s00224-013-9486-8","title":"The Coolest Way to Generate Binary Strings","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Coding theory and cryptography","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":"McGill University; Carleton University","funders":"","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Binary number; Mathematics; Order (exchange); String (physics); Discrete mathematics; Type (biology); Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01250921817159821,"gpt":0.2153810577082891,"spread":0.2028718395366909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002434961,0.0001650523,0.0002331158,0.0001228283,0.0004460424,0.0003412096,0.00159115,0.00004401572,0.000004890977],"category_scores_gemma":[0.00005555282,0.0001153469,0.00009762104,0.0005411806,0.0001158923,0.00016054,0.000438377,0.0001229434,0.0001452707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001878281,"about_ca_system_score_gemma":0.00002188285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003940025,"about_ca_topic_score_gemma":4.997385e-7,"domain_scores_codex":[0.9981161,0.0005512384,0.0004102784,0.0002964342,0.000255283,0.000370653],"domain_scores_gemma":[0.9978234,0.0008652864,0.0002013541,0.0008204146,0.0001709734,0.0001186322],"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.00001039161,0.00002211391,0.000106733,0.00002702132,0.0000320718,0.000001648703,0.001305043,0.003034386,0.003744869,0.9580069,0.00115992,0.03254886],"study_design_scores_gemma":[0.001981757,0.002189223,0.03550705,0.002045354,0.00007392517,0.00022647,0.004674962,0.4891239,0.01980367,0.4113369,0.03029144,0.002745288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6608177,0.0003917171,0.3345398,0.0002627312,0.001095576,0.0003490367,7.812557e-7,0.0002115096,0.002331147],"genre_scores_gemma":[0.9978595,0.000003272086,0.001498717,0.0001259256,0.0001589839,0.00001369537,3.766508e-7,0.00001212126,0.000327345],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.54667,"threshold_uncertainty_score":0.4703709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065138042","doi":"10.1007/s00224-008-9153-7","title":"The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete","year":2008,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":20,"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":"Quadratic equation; Mathematics; NP-complete; Combinatorics; Group (periodic table); Applied mathematics; Time complexity; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08172012897673582,"gpt":0.302626261127527,"spread":0.2209061321507912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003059553,0.0001640038,0.0004435579,0.00008732308,0.0006240328,0.00002357627,0.0005168171,0.00008280927,0.00002133352],"category_scores_gemma":[0.001924465,0.0001145309,0.0001685389,0.0002614857,0.0003593926,0.00004071659,0.0001164616,0.0001208276,0.00001070377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004153549,"about_ca_system_score_gemma":0.00006095827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004135193,"about_ca_topic_score_gemma":0.000005767032,"domain_scores_codex":[0.9979672,0.0004215201,0.0007688408,0.0002321851,0.0002648228,0.000345459],"domain_scores_gemma":[0.9865931,0.01194749,0.0004916881,0.0007389769,0.0001798886,0.00004887589],"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.00002086495,0.0000744559,0.0003968065,0.0003222687,0.00008607128,4.544127e-7,0.00371677,0.00009287638,0.00005558271,0.9907061,0.004231166,0.0002965819],"study_design_scores_gemma":[0.0006777415,0.0001353567,0.0008252613,0.00007062336,0.00004681688,0.00002978724,0.0008802942,0.01204561,0.00004504365,0.9841828,0.0008984028,0.0001622079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5122903,0.0003296021,0.4835481,0.0002981714,0.0005073218,0.001075688,0.00002994627,0.0001090795,0.001811796],"genre_scores_gemma":[0.9948999,0.000002077674,0.003975936,0.0000505266,0.0001939926,0.00003121555,0.000002637255,0.0000229152,0.0008207667],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4826096,"threshold_uncertainty_score":0.4799619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993150073","doi":"10.1007/s00224-001-0008-8","title":"A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders","year":2001,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Row; Combinatorics; Time complexity; Grid; Vertex (graph theory); Partition (number theory); Mathematics; Minimum weight; Dynamic programming; Running time; Graph; Algorithm; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.015498261918101,"gpt":0.245272595252124,"spread":0.229774333334023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413799,0.0001425538,0.0003878236,0.0001212103,0.0001390407,0.00005926902,0.0006991375,0.00006294304,0.000009256883],"category_scores_gemma":[0.00004222399,0.0001305946,0.0001070736,0.000231683,0.00008096457,0.0002176283,0.0002188395,0.00006474085,0.000009719426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002093241,"about_ca_system_score_gemma":0.00005037088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006963706,"about_ca_topic_score_gemma":2.163888e-7,"domain_scores_codex":[0.9984594,0.0001968969,0.0005346631,0.0002874968,0.0002417861,0.0002797766],"domain_scores_gemma":[0.9983971,0.0004608965,0.0004321628,0.0005114395,0.0001319502,0.00006650134],"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.0001078211,0.0003878257,0.0002343028,0.0004253986,0.0002499996,0.00001926433,0.00510811,0.01541721,0.01283375,0.07415882,0.01422433,0.8768331],"study_design_scores_gemma":[0.0006137718,0.0001601651,0.000251516,0.0004038638,0.0000135188,0.0000448031,0.0001555818,0.99256,0.001822248,0.001350942,0.002441616,0.0001819507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02291954,0.0003328981,0.9746537,0.00003446991,0.0006013167,0.0003027674,0.00002100714,0.0001125142,0.001021788],"genre_scores_gemma":[0.8655738,0.000005124827,0.1335915,0.00002335264,0.000280304,0.000009242574,0.00001551091,0.00001789994,0.0004831974],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9771428,"threshold_uncertainty_score":0.5325493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2947749495","doi":"10.1007/s00224-019-09929-9","title":"Additive Number Theory via Automata Theory","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Natural number; Palindrome; Mathematics; Base (topology); Basis (linear algebra); Automaton; Mathematical proof; Discrete mathematics; Representation (politics); Combinatorics; Computer science; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007762103394063058,"gpt":0.2280083916079614,"spread":0.2202462882138984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007447166,0.0004318275,0.0007900985,0.0001861067,0.0001883729,0.0001782711,0.002411129,0.0001824479,0.0008818951],"category_scores_gemma":[0.0001880839,0.0003720616,0.0002573611,0.0005078756,0.0002586234,0.0005042459,0.0007924289,0.0003181441,0.001858671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000782291,"about_ca_system_score_gemma":0.0001040507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001279268,"about_ca_topic_score_gemma":1.682698e-7,"domain_scores_codex":[0.9944898,0.002596577,0.0008402423,0.000777803,0.0006203129,0.0006752809],"domain_scores_gemma":[0.9917372,0.005335016,0.0007082648,0.001872711,0.0001962904,0.0001504983],"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.00005864594,0.00009471041,0.0001332332,0.0001333383,0.0001416168,0.00001250202,0.002600636,0.000302793,0.000700853,0.9535539,0.001013097,0.0412547],"study_design_scores_gemma":[0.001550229,0.0002811722,0.002567322,0.001463791,0.00005948263,0.000457982,0.002416925,0.1599273,0.002810826,0.8218666,0.005356016,0.001242381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1540079,0.0004045036,0.7772339,0.00003384387,0.002878,0.0006907576,0.00007970058,0.001175897,0.06349546],"genre_scores_gemma":[0.9934325,0.000004310664,0.002929291,0.00022349,0.000266043,0.00001283091,0.00002502324,0.00005517356,0.003051367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8394246,"threshold_uncertainty_score":0.9998732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096141465","doi":"10.1007/s00224-014-9601-5","title":"Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines","year":2015,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","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 New Brunswick","funders":"","keywords":"Copula (linguistics); Upper and lower bounds; Computer science; Scheduling (production processes); Randomized algorithm; Mathematical optimization; Mathematics; Algorithm; Econometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.1348223110732241,"gpt":0.4017495056858833,"spread":0.2669271946126592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02759212,0.0001963268,0.0008580008,0.0002804195,0.0002566263,0.0001117723,0.0006260304,0.00008775127,0.00002645744],"category_scores_gemma":[0.005609831,0.0001374435,0.0002801145,0.0004862464,0.0002134793,0.00007118127,0.00004601413,0.0001264484,0.0001151777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000369513,"about_ca_system_score_gemma":0.00008943272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000136636,"about_ca_topic_score_gemma":4.08376e-7,"domain_scores_codex":[0.9952646,0.002154164,0.001211041,0.0004089135,0.0007361177,0.0002251473],"domain_scores_gemma":[0.9852989,0.01238253,0.000983822,0.0005966082,0.0006014048,0.0001367782],"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.006567535,0.00004771499,0.000006672192,0.00001114317,0.00003290611,2.789806e-7,0.0004239656,0.2230498,0.0002962479,0.7676744,0.0001000123,0.001789275],"study_design_scores_gemma":[0.02499023,0.00007184668,0.000002285098,0.00009080739,0.0000319734,0.00000442828,0.0008637966,0.4210217,0.001442745,0.5512062,0.0001528669,0.0001212074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1548976,0.00009684656,0.8401757,0.0001455522,0.00120086,0.0009851761,0.0000155902,0.0001372607,0.002345456],"genre_scores_gemma":[0.9914591,1.495215e-7,0.007459013,0.0001040708,0.0001784882,0.00004628524,0.00000997401,0.00002227308,0.0007206316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8365616,"threshold_uncertainty_score":0.9562933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W199219868","doi":"10.1007/s00224-016-9687-z","title":"Stable Marriage with General Preferences","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Waterloo; Toronto Metropolitan University","funders":"","keywords":"Stable marriage problem; Generalization; Mathematics; Transitive relation; Matching (statistics); Combinatorics; Partition (number theory); Class (philosophy); Time complexity; Linear programming; Mathematical economics; Mathematical optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03372601474166294,"gpt":0.2064812948759029,"spread":0.17275528013424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003107989,0.0001690675,0.0005671225,0.0001379527,0.00009158495,0.00004475029,0.0003330268,0.00007156769,0.0001117263],"category_scores_gemma":[0.00008026948,0.0001155439,0.00006607006,0.0001400397,0.0001375264,0.0001245396,0.00004930628,0.00006442845,0.0002077012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004228351,"about_ca_system_score_gemma":0.00001772883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009984011,"about_ca_topic_score_gemma":0.000001892871,"domain_scores_codex":[0.9983848,0.0001936937,0.000714465,0.0003297497,0.00005967644,0.0003175545],"domain_scores_gemma":[0.9983804,0.0003783489,0.000721078,0.0004058563,0.00004978358,0.00006452061],"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.00005845621,0.00002911019,0.02163316,0.0001269352,0.00008163245,0.000001533563,0.0006608515,0.0003067262,0.0003499941,0.9759704,0.0001060188,0.0006751097],"study_design_scores_gemma":[0.007944112,0.002098193,0.05544252,0.006136129,0.00008221033,0.0002213034,0.002944506,0.006932072,0.006495038,0.8801038,0.0285212,0.003078919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8810998,0.0007551247,0.06444113,0.00002800616,0.0007276001,0.0002299255,0.00004872319,0.00009394731,0.0525757],"genre_scores_gemma":[0.9915713,0.000005319961,0.0002671123,0.00001291406,0.0002556171,0.000006036813,0.000001541619,0.0000260852,0.007854095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1104714,"threshold_uncertainty_score":0.4711742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124257703","doi":"10.1007/s00224-004-1210-2","title":"A Note on MODp - MODm Circuits","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Electronic circuit; Constant (computer programming); Prime (order theory); Mathematics; Layer (electronics); Prime power; Computer science; Discrete mathematics; Arithmetic; Combinatorics; Physics; Nanotechnology; Materials science; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.02779862653046497,"gpt":0.2622752652652693,"spread":0.2344766387348044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001372368,0.0001766608,0.0003240069,0.0001884775,0.0001685047,0.00009469924,0.001197106,0.00006410677,0.000004979257],"category_scores_gemma":[0.00004499402,0.0001668759,0.0001182251,0.0003473088,0.00009454283,0.0001664733,0.0002163522,0.0001793758,0.00008010895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004902048,"about_ca_system_score_gemma":0.00003978353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001473677,"about_ca_topic_score_gemma":7.190436e-7,"domain_scores_codex":[0.9981897,0.0003027254,0.0004248972,0.0003619646,0.0003981836,0.0003225338],"domain_scores_gemma":[0.9982503,0.0005796927,0.000227381,0.0007725066,0.00008767522,0.00008243098],"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.000004156931,0.00007358834,0.00001033524,0.0000383933,0.00001758961,0.000003128878,0.001717916,0.03031881,0.0002600387,0.8067738,0.00008705251,0.1606952],"study_design_scores_gemma":[0.0004153774,0.00015343,0.0004313927,0.0003367845,0.000006233482,0.0000475995,0.00005274342,0.9618118,0.00105811,0.03311513,0.002285397,0.0002859861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06543226,0.0002551851,0.9178536,0.0001661622,0.0009993205,0.0001980942,0.000002974464,0.0003149451,0.01477749],"genre_scores_gemma":[0.9908444,0.000001684255,0.008376911,0.0001590631,0.0003802594,0.000002434845,7.346208e-7,0.00001192145,0.0002226347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.931493,"threshold_uncertainty_score":0.6805003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973664142","doi":"10.1007/s00224-012-9382-7","title":"(Approximate) Uncertain Skylines","year":2012,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"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":"Skyline; Point (geometry); Probability distribution; Set (abstract data type); Simple (philosophy); Computer science; Lying; Construct (python library); Mathematical optimization; Algorithm; Mathematics; Data mining; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03110128148239794,"gpt":0.2640454652165077,"spread":0.2329441837341097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002512148,0.0001262724,0.0002271057,0.0001038895,0.00008563853,0.00009809863,0.0009796381,0.00003138288,0.000004251803],"category_scores_gemma":[0.00003551011,0.0001058779,0.00005149786,0.0002646908,0.00005003167,0.0005062873,0.000405431,0.00006118754,0.00005019784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001624678,"about_ca_system_score_gemma":0.00001079729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001753704,"about_ca_topic_score_gemma":6.584713e-8,"domain_scores_codex":[0.9986737,0.0002284363,0.0003209797,0.0001838714,0.0002454989,0.0003474703],"domain_scores_gemma":[0.9988995,0.0002042674,0.0002042761,0.000570498,0.00005186538,0.00006964965],"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.000002402384,0.00005582753,0.0006660752,0.0001218317,0.00002900384,0.000001360991,0.001101329,0.0004251605,0.00009995124,0.974532,0.0007216053,0.02224343],"study_design_scores_gemma":[0.001057924,0.0001489154,0.004646922,0.0006197498,0.00005048944,0.00007551385,0.001596823,0.9436138,0.001888645,0.0243349,0.02095716,0.001009155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02934315,0.000712697,0.958398,0.00004923562,0.001881598,0.0001824014,0.00000234553,0.0002542441,0.009176353],"genre_scores_gemma":[0.9837589,0.000002683625,0.01514618,0.00004122944,0.0003919673,0.000002323452,0.000004610256,0.000008886873,0.0006432006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9544157,"threshold_uncertainty_score":0.4317575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004793105","doi":"10.1007/s00224-010-9264-9","title":"Tilings and Submonoids of Metabelian Groups","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"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":"Undecidable problem; Mathematics; Rank (graph theory); Group (periodic table); Combinatorics; Wreath product; Free product; Pure mathematics; Discrete mathematics; Product (mathematics); Physics; Decidability","retraction":null,"screen_n_in":null,"score":{"opus":0.008176804284704712,"gpt":0.2212271870205408,"spread":0.2130503827358361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115517,0.00007947396,0.0002172103,0.00007574777,0.00006283313,0.00003557475,0.0004970218,0.00004290809,0.000001600166],"category_scores_gemma":[0.00002373546,0.00007113397,0.00004053664,0.000186892,0.0001146136,0.00007806355,0.0001592097,0.00009516579,0.000004196364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002644006,"about_ca_system_score_gemma":0.00001924323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003103933,"about_ca_topic_score_gemma":0.000001085608,"domain_scores_codex":[0.9991933,0.000076288,0.0003009457,0.0001795802,0.0001305079,0.0001193624],"domain_scores_gemma":[0.9989634,0.000228301,0.0002104251,0.0004829563,0.00006853751,0.00004644534],"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.000001195373,0.00002406258,0.0003595268,0.00007162706,0.0000134915,3.451392e-7,0.001054863,0.00003177877,0.1017861,0.8894638,0.00001782767,0.007175422],"study_design_scores_gemma":[0.001130228,0.0001953032,0.02679969,0.0003128054,0.00008162685,0.0002487789,0.0006695898,0.765774,0.1169148,0.08387728,0.003273614,0.0007223631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6711665,0.0001968481,0.3273683,0.00002719639,0.0002326715,0.00009854068,0.000001222641,0.00006645895,0.0008422876],"genre_scores_gemma":[0.9925603,0.000001685335,0.007314249,0.000008387967,0.00004409359,0.000001832656,8.916381e-7,0.000005843448,0.00006274239],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8055865,"threshold_uncertainty_score":0.2900759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076983944","doi":"10.1007/s00224-002-1033-y","title":"Routing in Series Parallel Networks","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Series (stratigraphy); Computer science; Routing (electronic design automation); Parallel computing; Computer network; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.01461889209426706,"gpt":0.2234483562985752,"spread":0.2088294642043082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003908052,0.0001662339,0.0004120493,0.0001273429,0.0001158205,0.0001202955,0.0005281105,0.00009553644,0.000003561117],"category_scores_gemma":[0.00008314275,0.0001532052,0.00008289255,0.0004281688,0.0000483678,0.0002316417,0.00008687664,0.0001809554,0.000008095203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005005542,"about_ca_system_score_gemma":0.00003481831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004645254,"about_ca_topic_score_gemma":0.000006767198,"domain_scores_codex":[0.997288,0.001099727,0.0007257478,0.0003088989,0.0001922245,0.0003853301],"domain_scores_gemma":[0.9986465,0.000412197,0.0003321401,0.0004658961,0.00009033874,0.00005292884],"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.000005896603,0.00001631905,0.001065713,0.00002673216,0.00001280001,0.000005696756,0.001234252,0.2027469,0.00001590802,0.7941701,0.00007322986,0.0006264123],"study_design_scores_gemma":[0.000488309,0.00009731521,0.0007649598,0.0006071859,0.000003558629,0.0002138466,0.001197173,0.9874273,0.0000600541,0.007966427,0.0008712379,0.000302668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04243289,0.000513264,0.9398423,0.00001984261,0.002677459,0.0002174545,1.775974e-7,0.0001349241,0.0141617],"genre_scores_gemma":[0.9971678,0.000004059284,0.002164312,0.00003359159,0.000162098,0.000004952738,4.238082e-7,0.00001259791,0.0004501727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9547349,"threshold_uncertainty_score":0.6247525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032278054","doi":"10.1007/s00224-014-9557-5","title":"On the Parameterized Complexity of Computing Balanced Partitions in Graphs","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Combinatorics; Vertex (graph theory); Partition (number theory); Vertex cover; Mathematics; Neighbourhood (mathematics); Time complexity; Feedback vertex set; Graph partition; Constant (computer programming); Graph; Bisection; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05734722256749251,"gpt":0.3022804971018644,"spread":0.2449332745343719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006734774,0.0002126504,0.0006139626,0.0003063846,0.0002089088,0.00005732314,0.001626501,0.00006337881,0.000006870931],"category_scores_gemma":[0.0006644717,0.0001610403,0.0001487249,0.0009959762,0.0007758318,0.0001098649,0.000362263,0.0003242563,0.00001072473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003475711,"about_ca_system_score_gemma":0.00003433497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003341072,"about_ca_topic_score_gemma":0.000002656253,"domain_scores_codex":[0.9948723,0.002894902,0.0008223386,0.0004152422,0.0005161223,0.0004790729],"domain_scores_gemma":[0.9916744,0.006372892,0.0005439658,0.0011621,0.000172709,0.00007399282],"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.00004347043,0.00008999281,0.0004711226,0.00008569577,0.00002414955,0.00000115696,0.001232768,0.01863897,0.002368505,0.9752806,0.00001582072,0.001747708],"study_design_scores_gemma":[0.0006330578,0.0002096143,0.005121348,0.00053602,0.000003947829,0.00000814514,0.0002210962,0.3396102,0.002095231,0.6513672,0.00001575846,0.000178299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5471019,0.00003179609,0.4505613,0.0000886136,0.0002100683,0.0003256712,0.000003195659,0.00007843596,0.001599057],"genre_scores_gemma":[0.9948139,0.00000137427,0.005041554,0.00007262536,0.00002945548,0.000007389266,0.000001918646,0.00001534657,0.00001647049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.447712,"threshold_uncertainty_score":0.6567035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3161660208","doi":"10.1007/s002249910005","title":"The Characterization of Data-Accumulating Algorithms","year":2000,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Neural Networks and Applications","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":"Speedup; Algorithm; Computer science; Parallelism (grammar); Computation; Characterization (materials science); Class (philosophy); Geodetic datum; Unitary state; Parallel algorithm; Parallel computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04788059028256705,"gpt":0.2927200907847261,"spread":0.2448395005021591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166514,0.00007045246,0.000151222,0.00001809215,0.0001933153,0.00006723921,0.001284229,0.00002233526,0.000003293538],"category_scores_gemma":[0.000009734957,0.00004978912,0.00002651233,0.0002384588,0.00006036352,0.0001885632,0.0001762562,0.00005568137,0.000006078756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004998483,"about_ca_system_score_gemma":0.00001510513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001113213,"about_ca_topic_score_gemma":1.681916e-7,"domain_scores_codex":[0.9989235,0.0001863439,0.0004046587,0.0001881789,0.0001631028,0.0001342373],"domain_scores_gemma":[0.9983128,0.0004329541,0.0002863103,0.0008867581,0.00005835927,0.00002284248],"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.000005307883,0.0000272505,0.00005160021,0.0000333086,0.00002385195,3.660817e-7,0.0005271735,0.006871728,0.007976948,0.2708167,0.00004857187,0.7136171],"study_design_scores_gemma":[0.0000788728,0.00001829069,0.001337431,0.00008008291,0.000004809578,0.000007318075,0.00002448564,0.9938008,0.0005089363,0.001520601,0.002548462,0.00006989262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3015073,0.0001211835,0.6968998,0.0001017702,0.0002167228,0.0002072125,0.000007728569,0.00007307716,0.0008652309],"genre_scores_gemma":[0.9970759,0.00001200687,0.002527858,0.00001700588,0.0001428604,0.000001859484,0.00001147708,0.000005646662,0.0002054149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9869291,"threshold_uncertainty_score":0.2386439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092863347","doi":"10.1007/s00224-011-9379-7","title":"Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Terrain; Asynchronous communication; Polygon (computer graphics); Computer science; Bounded function; Trajectory; Point (geometry); Algorithm; Mathematics; Geometry; Geography; Frame (networking); Mathematical analysis; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.06548969616562526,"gpt":0.2818040062851477,"spread":0.2163143101195225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001670264,0.0001393138,0.0003505159,0.000269358,0.00006250358,0.00003336897,0.0008898957,0.0000658962,0.00001951799],"category_scores_gemma":[0.00005826415,0.0001348565,0.00006694516,0.0003373768,0.000176572,0.0001307166,0.0002400123,0.000122932,0.00001178705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005021862,"about_ca_system_score_gemma":0.0001325146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001264567,"about_ca_topic_score_gemma":0.000004993771,"domain_scores_codex":[0.9979378,0.0005015262,0.000669351,0.0002717982,0.0003151942,0.0003043121],"domain_scores_gemma":[0.9987611,0.000214319,0.0003636722,0.000481952,0.00009933132,0.00007961873],"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.0001043252,0.0008810199,0.005007236,0.0009909216,0.0001301088,0.0001008856,0.07086395,0.02114795,0.000840821,0.8429458,0.0001411619,0.05684585],"study_design_scores_gemma":[0.001881381,0.0007761744,0.02195857,0.001121909,0.00001623291,0.0001622702,0.001172384,0.9459904,0.001208019,0.02505346,0.00007344026,0.0005857204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2310344,0.0001799111,0.7364399,0.00001296427,0.0006412656,0.0003736632,0.000003836176,0.0001086616,0.03120531],"genre_scores_gemma":[0.9872465,0.000002603007,0.01249904,0.00002938769,0.0000310566,0.00000317235,0.000001367266,0.00001187233,0.0001749569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9248425,"threshold_uncertainty_score":0.5499287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2613137572","doi":"10.1007/s00224-016-9713-1","title":"Separation Logic with One Quantified Variable","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Logic, programming, and type systems","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":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Heap (data structure); Separation logic; Satisfiability; Boolean satisfiability problem; Fragment (logic); PSPACE; Mathematics; MAGIC (telescope); True quantified Boolean formula; Variable (mathematics); Discrete mathematics; Algorithm; Computer science; Theoretical computer science; Computational complexity theory","retraction":null,"screen_n_in":null,"score":{"opus":0.04982199439789516,"gpt":0.2871277628121783,"spread":0.2373057684142832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511894,0.0001607914,0.0003954262,0.00006899153,0.000529738,0.0005437252,0.001308907,0.00008240077,0.000002908369],"category_scores_gemma":[0.00007861299,0.0001228882,0.00004666447,0.000111632,0.0001371817,0.0003208129,0.0002034707,0.0001034778,0.00004440405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002627029,"about_ca_system_score_gemma":0.00007114095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002012544,"about_ca_topic_score_gemma":0.000004135673,"domain_scores_codex":[0.9983073,0.0003159998,0.0003880248,0.0003611888,0.0003334205,0.0002940786],"domain_scores_gemma":[0.997441,0.0001955953,0.0007939877,0.001301256,0.0002039642,0.00006419144],"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.00001712757,0.00005247973,0.0005217377,0.0001351271,0.00005042286,0.000004632746,0.0007811932,0.001192102,0.0006950492,0.9946073,0.00004975883,0.001893062],"study_design_scores_gemma":[0.004054062,0.002120635,0.01205573,0.000852137,0.0001450355,0.0003221134,0.0009415975,0.4066114,0.005756192,0.5578561,0.007357168,0.001927817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01750727,0.0001840611,0.9465572,0.00004257035,0.001086721,0.0003538199,3.896997e-7,0.0002064131,0.03406158],"genre_scores_gemma":[0.9921363,9.884283e-7,0.00656706,0.00001894298,0.0002020797,0.000005866093,0.000001886859,0.00001126821,0.001055609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.974629,"threshold_uncertainty_score":0.5243154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107000858","doi":"10.1007/s00224-007-9049-y","title":"Incremental Branching Programs","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"McGill University","keywords":"Branching (polymer chemistry); Nondeterministic algorithm; Computation; Computer science; Exponential function; Mathematics; Combinatorics; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0161668605177624,"gpt":0.2463214989355354,"spread":0.230154638417773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005856394,0.0001475931,0.0002661666,0.0001250242,0.0001346242,0.000110438,0.0009376023,0.00005379788,0.000002781981],"category_scores_gemma":[0.00002981814,0.0001314983,0.00008309248,0.000301298,0.0000834101,0.0002033432,0.0002742898,0.0001187739,0.00001951748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003839282,"about_ca_system_score_gemma":0.00002115783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000350362,"about_ca_topic_score_gemma":8.530159e-7,"domain_scores_codex":[0.998282,0.0002262114,0.0005051576,0.0002739678,0.0003326663,0.0003800676],"domain_scores_gemma":[0.9986639,0.0004161691,0.0002836476,0.0005006862,0.00005660217,0.00007900043],"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.00001180555,0.00006933026,0.0008882175,0.00008340345,0.00003120274,0.00001138593,0.002548819,0.0001423768,0.004910335,0.8191488,0.0000318494,0.1721225],"study_design_scores_gemma":[0.006259668,0.001857492,0.04637728,0.005920009,0.0001031649,0.001558831,0.01345238,0.5775155,0.0842743,0.2532076,0.005634184,0.003839594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4452212,0.0002496883,0.5494125,0.000008242777,0.0006487819,0.0001496313,2.776744e-7,0.0002675007,0.004042126],"genre_scores_gemma":[0.9913541,6.087948e-7,0.00832228,0.00005392043,0.0001948029,0.000001095323,0.000001356568,0.00001280502,0.00005900469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5773731,"threshold_uncertainty_score":0.5362344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096830858","doi":"10.1007/s00224-014-9539-7","title":"Probabilistic k-Median Clustering in Data Streams","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"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":"Probabilistic logic; Mathematics; Cluster analysis; Representation (politics); Metric (unit); Probability distribution; Euclidean geometry; Point (geometry); Probabilistic analysis of algorithms; Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03428720038795635,"gpt":0.2571392949994608,"spread":0.2228520946115044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003608461,0.0001219763,0.0002612947,0.0001449413,0.00004771946,0.0001431768,0.00265675,0.00003039579,0.000001469801],"category_scores_gemma":[0.0001594085,0.0001119992,0.00001980397,0.0002815224,0.00005556658,0.0004089868,0.001561215,0.00008860492,0.0000199061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002130434,"about_ca_system_score_gemma":0.00001764377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000675007,"about_ca_topic_score_gemma":0.00001862221,"domain_scores_codex":[0.9983367,0.0003432343,0.0004095382,0.0004156019,0.0002343657,0.0002605523],"domain_scores_gemma":[0.9977779,0.0004016151,0.0001854729,0.001558423,0.00002840549,0.00004813332],"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.000007390465,0.0001008089,0.0006238252,0.0005880188,0.00002977165,0.00001035858,0.001448252,0.01847998,0.00004297293,0.6115885,0.0004452058,0.3666348],"study_design_scores_gemma":[0.0002482213,0.0000299359,0.0006153056,0.000271284,0.000003969442,0.000004641569,0.00009383167,0.9917703,0.000006674235,0.006044809,0.0007831982,0.0001277891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02085354,0.00005840977,0.9734326,0.00008415044,0.001012375,0.0002524319,0.000006073004,0.0001378633,0.004162577],"genre_scores_gemma":[0.9899272,0.000001173473,0.009720277,0.00002439552,0.0001695597,0.00000180098,0.0000235284,0.000008742255,0.0001232938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9732904,"threshold_uncertainty_score":0.4936947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962904359","doi":"10.1007/s00224-017-9803-8","title":"Syntactic Complexity of Regular Ideals","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"European Social Fund; Uniwersytet Wrocławski; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Narodowe Centrum Nauki; University of Toronto; Narodowym Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Mathematics; Prefix; Discrete mathematics; Nondeterministic finite automaton; Descriptive complexity theory; Combinatorics; Computer science; Time complexity; Automaton; Automata theory; Linguistics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05201520097610158,"gpt":0.2847825039784081,"spread":0.2327673030023065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003366337,0.000158091,0.0005463616,0.00009272934,0.0003242373,0.0001534083,0.002481519,0.00006359463,0.000006913386],"category_scores_gemma":[0.0002333932,0.0001410297,0.0001251978,0.00008182292,0.0005117164,0.0002932825,0.0005949009,0.0001002187,0.00001362757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002249826,"about_ca_system_score_gemma":0.00003723528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001253928,"about_ca_topic_score_gemma":6.820167e-7,"domain_scores_codex":[0.9980685,0.0004542829,0.0005811944,0.0002956201,0.0003388009,0.0002616454],"domain_scores_gemma":[0.996011,0.0005364821,0.001215005,0.002028408,0.0001421518,0.00006696382],"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.000009809277,0.00003935933,0.0003512049,0.0002189093,0.00004587097,0.000005075763,0.0007243435,0.0001832007,0.003189581,0.9893993,0.00006792196,0.005765439],"study_design_scores_gemma":[0.0009785191,0.0002372207,0.03830882,0.001919102,0.00004516805,0.0001467412,0.0005710311,0.2098321,0.02336162,0.7237596,0.0002665236,0.0005735538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5447901,0.000427253,0.4451255,0.0001205721,0.001146684,0.0002178788,0.000005168239,0.0001633437,0.008003504],"genre_scores_gemma":[0.9946427,0.000002331828,0.005116596,0.00001966371,0.000100119,0.000001225542,7.267089e-7,0.00001175826,0.0001048374],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4498526,"threshold_uncertainty_score":0.5751024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086421997","doi":"10.1007/s00224-005-1206-6","title":"Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Template; Recombination; Biology; Materials science; Genetics; Nanotechnology; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.01800312734117122,"gpt":0.2428619670079017,"spread":0.2248588396667305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007048257,0.00009417952,0.0001569183,0.00006278337,0.00005484946,0.0000196091,0.0001094305,0.00009577203,0.000003700241],"category_scores_gemma":[0.00004860995,0.00009588632,0.00002517552,0.0000714916,0.00005314027,0.000005272105,0.00006873879,0.00005009907,0.000004263046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001222308,"about_ca_system_score_gemma":0.00001528412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000264458,"about_ca_topic_score_gemma":0.000006574456,"domain_scores_codex":[0.9992011,0.0001876699,0.0002384386,0.0001811476,0.00006245957,0.0001292036],"domain_scores_gemma":[0.9996161,0.00004875782,0.0001158197,0.0001285524,0.00006165414,0.00002907494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004154373,0.0002787565,0.3138953,0.0005610789,0.0002276528,0.000009561226,0.00366735,0.007204442,0.6512977,0.01423347,0.00140872,0.006800531],"study_design_scores_gemma":[0.00591206,0.0009208234,0.3071994,0.001018278,0.00006435008,0.000226988,0.001420279,0.01529262,0.6572731,0.004830733,0.004621489,0.00121992],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.997864,0.0006745691,0.0004606865,0.00002982277,0.000111209,0.0001778142,0.000008185854,0.0000132667,0.000660423],"genre_scores_gemma":[0.999538,0.00001535378,0.0001282271,0.00002994363,0.00006755875,9.958133e-7,0.00003432782,0.00000725442,0.0001783364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009402739,"threshold_uncertainty_score":0.391013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114282507","doi":"10.1007/s00224-013-9462-3","title":"Braess’s Paradox for Flows over Time","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"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":"Transpose; Conjecture; Flow (mathematics); Network topology; Context (archaeology); Mathematics; Computer science; Flow network; Mathematical economics; Topology (electrical circuits); Mathematical optimization; Discrete mathematics; Combinatorics; Physics; Geometry; Geology; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.06699727172578591,"gpt":0.3527810848969236,"spread":0.2857838131711377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005869091,0.0001294074,0.0004005496,0.0001199751,0.0001730819,0.0001537767,0.0008216479,0.00006491617,0.0004465585],"category_scores_gemma":[0.0006737465,0.00009498246,0.0001457565,0.0002907536,0.0001210274,0.0001396469,0.00009141144,0.00006617502,0.00180112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001340624,"about_ca_system_score_gemma":0.00002625519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001483772,"about_ca_topic_score_gemma":2.554672e-7,"domain_scores_codex":[0.9977383,0.0004789928,0.0007697273,0.0003165201,0.0004551924,0.0002412733],"domain_scores_gemma":[0.9930245,0.005446091,0.00043486,0.0007048006,0.0003081487,0.00008165709],"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.000042301,0.00008829107,0.0002958993,0.00004096704,0.00004412458,2.325804e-7,0.001523486,0.005615127,0.01204821,0.9339414,0.01712715,0.02923279],"study_design_scores_gemma":[0.0005262134,0.00008749913,0.003457667,0.00009882663,0.00001972572,0.00001146675,0.0007800491,0.1746005,0.0009141671,0.8088369,0.01041149,0.0002554113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8397661,0.0001101442,0.1501188,0.0001143752,0.0003719963,0.0008204381,0.00001584423,0.00008011683,0.008602131],"genre_scores_gemma":[0.9925364,2.356632e-7,0.0008343032,0.00006526922,0.0002060927,0.00003769894,0.000002846525,0.00001440287,0.006302713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1689854,"threshold_uncertainty_score":0.9989761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168635355","doi":"10.1007/s00224-010-9254-y","title":"On the Complexity of Computing Winning Strategies for Finite Poset Games","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Partially ordered set; Infimum and supremum; Combinatorial game theory; PSPACE; Argument (complex analysis); Mathematics; Combinatorics; Game theory; Simple (philosophy); Theoretical computer science; Computer science; Discrete mathematics; Computational complexity theory; Mathematical economics; Sequential game; Algorithm; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.08009168828994542,"gpt":0.3117809293778928,"spread":0.2316892410879473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003995407,0.0002292872,0.000483417,0.0001344984,0.0003222558,0.0001990018,0.0017761,0.00009192723,0.000006437869],"category_scores_gemma":[0.0006242791,0.0001701994,0.0001632049,0.0003022665,0.0009254852,0.000175262,0.0002971425,0.0003263649,0.000009621539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001618866,"about_ca_system_score_gemma":0.0001096132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007568489,"about_ca_topic_score_gemma":0.000007368114,"domain_scores_codex":[0.9975907,0.0004291073,0.0008425465,0.0003663342,0.0003846214,0.0003867207],"domain_scores_gemma":[0.9908009,0.007104217,0.000802862,0.000883725,0.0003549298,0.00005343061],"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.00001968976,0.00004476697,0.00008636283,0.0001093227,0.00003503162,7.787042e-7,0.007250335,0.02819847,0.004473928,0.9557217,0.0001141829,0.00394545],"study_design_scores_gemma":[0.00009599848,0.000191367,0.000365648,0.0003683465,0.000009323182,0.0000101746,0.003311806,0.6517985,0.01056512,0.3330075,0.00007958615,0.0001966173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4288842,0.00003501751,0.568016,0.0001472625,0.00104097,0.0003410451,0.000006614858,0.0001045142,0.001424407],"genre_scores_gemma":[0.9878174,3.761699e-7,0.01183711,0.00008839512,0.0002044555,0.000003982299,0.000001831808,0.00001817617,0.00002826168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6236001,"threshold_uncertainty_score":0.694053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943463427","doi":"10.1007/s00224-005-1139-0","title":"Bounded-Degree Independent Sets in Planar Graphs","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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; Independent set; Mathematics; Bounded function; Maximal independent set; Degree (music); Planar graph; Discrete mathematics; Graph; Set (abstract data type); Planar; Planar straight-line graph; 1-planar graph; Chordal graph; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02799329073985854,"gpt":0.2603683244860735,"spread":0.232375033746215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001886436,0.0001332377,0.0002411119,0.0003576307,0.00008864523,0.00008809433,0.0005753634,0.0000633676,0.000003611473],"category_scores_gemma":[0.00003413243,0.000132479,0.0000591767,0.0005118358,0.00003650222,0.0002395925,0.00009729581,0.000128916,0.00002865853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006608241,"about_ca_system_score_gemma":0.00007522335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002932868,"about_ca_topic_score_gemma":0.00001507567,"domain_scores_codex":[0.9982619,0.0003322379,0.0004958508,0.0002921079,0.0003831514,0.0002346978],"domain_scores_gemma":[0.9989817,0.0003224872,0.0002166368,0.0003324749,0.00008757081,0.00005910834],"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.0000111956,0.00008117837,0.0004977135,0.00004359684,0.0000199861,0.000006514384,0.002192396,0.08685032,0.0004122128,0.8611852,0.0001654738,0.04853424],"study_design_scores_gemma":[0.001479909,0.0001845388,0.03204381,0.0003658637,0.00001055947,0.0001828626,0.000337694,0.8479359,0.001652721,0.1131461,0.002109176,0.0005508327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.511784,0.0004400568,0.4837984,0.0001145235,0.0006289399,0.0001798031,0.00000150503,0.0000923378,0.002960393],"genre_scores_gemma":[0.9904761,0.000002949785,0.009171428,0.0000830538,0.0001242085,0.000002911489,0.000004667788,0.000006935648,0.0001277626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7610856,"threshold_uncertainty_score":0.5402336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030552895","doi":"10.1007/s00224-007-1325-3","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"University of Waterloo","funders":"","keywords":"Hierarchy; Intersection (aeronautics); Mathematical proof; Extension (predicate logic); Set (abstract data type); Mathematics; Upper and lower bounds; Algorithm; Computer science; State (computer science); Discrete mathematics; Finite-state machine; Combinatorics; Theoretical computer science; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0302898493409319,"gpt":0.3155309478931336,"spread":0.2852410985522017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01654583,0.0001333609,0.0002459705,0.0003307572,0.0001255843,0.00007114197,0.002212098,0.00005271568,0.000001485282],"category_scores_gemma":[0.0001520359,0.00009459269,0.00006947896,0.001089584,0.0002112043,0.0001710147,0.0002581284,0.0002992691,0.00001705233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000384807,"about_ca_system_score_gemma":0.00003659208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001986322,"about_ca_topic_score_gemma":0.000002099279,"domain_scores_codex":[0.9970555,0.001033359,0.0005058944,0.0003007109,0.0005857681,0.0005187675],"domain_scores_gemma":[0.9959509,0.002870103,0.0001696096,0.00085435,0.00009783893,0.00005717433],"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.00001767899,0.00004590408,0.0003462298,0.00003486409,0.000009150084,0.00003348552,0.005394362,0.001171428,0.0003340599,0.9578153,0.00002273586,0.03477478],"study_design_scores_gemma":[0.001720655,0.0005234107,0.02229135,0.0005994526,0.000008610391,0.0004718994,0.007499062,0.149294,0.003389346,0.8106446,0.002784571,0.0007730476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.113554,0.0004779067,0.8770537,0.00007344604,0.0003913057,0.0003174102,5.864129e-7,0.00008309704,0.008048524],"genre_scores_gemma":[0.9920801,0.000002229294,0.007611573,0.00007377514,0.0001151011,0.000002898566,4.664228e-7,0.000009789998,0.0001040628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.878526,"threshold_uncertainty_score":0.5734488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2467644617","doi":"10.1007/s00224-015-9649-x","title":"On the Advice Complexity of the k-server Problem Under Sparse Metrics","year":2015,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","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 Waterloo","funders":"","keywords":"Treewidth; Advice (programming); Combinatorics; Binary logarithm; Competitive analysis; Mathematics; Online algorithm; Metric space; Discrete mathematics; Upper and lower bounds; Sequence (biology); Metric (unit); Tree (set theory); Deterministic algorithm; Path (computing); Time complexity; Graph; Algorithm; Computer science; Pathwidth; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.1207327124076679,"gpt":0.2864676065370435,"spread":0.1657348941293756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005201743,0.0001291975,0.0002546363,0.0001003392,0.0001499107,0.00007741629,0.001698079,0.00004864592,0.000005542088],"category_scores_gemma":[0.0002541686,0.00007089526,0.00008743115,0.001094182,0.0002920575,0.0001013075,0.0004787388,0.0001843123,0.00001795055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004990389,"about_ca_system_score_gemma":0.0001356371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008796351,"about_ca_topic_score_gemma":0.000003346295,"domain_scores_codex":[0.9969565,0.001418852,0.0004640007,0.0002124105,0.000721043,0.0002272379],"domain_scores_gemma":[0.9970981,0.001034986,0.0004469299,0.0009122823,0.0004322305,0.00007542886],"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.000007275632,0.00005403702,0.00009663063,0.00004533361,0.00002152246,1.877928e-7,0.001459112,0.1347593,0.00001721017,0.8624151,0.0009310208,0.0001932283],"study_design_scores_gemma":[0.0005608909,0.0001574493,0.0007733759,0.0003131739,0.00001046113,0.00001025063,0.00077705,0.7714335,0.0003530453,0.2250131,0.0004299005,0.000167842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0726807,0.0002293192,0.8925409,0.001767954,0.00109822,0.001039974,0.000004358714,0.0001946433,0.03044391],"genre_scores_gemma":[0.9950433,0.000001114534,0.004181414,0.0002503586,0.00003345194,0.000002990459,5.720328e-7,0.000009691045,0.0004770835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9223626,"threshold_uncertainty_score":0.3155481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076003965","doi":"10.1007/s00224-003-1082-x","title":"Automatable Verification of Sequential Consistency","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","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 British Columbia","funders":"","keywords":"Undecidable problem; Consistency model; Sequential consistency; Computer science; Consistency (knowledge bases); Decidability; Class (philosophy); Protocol (science); Task (project management); Theoretical computer science; State (computer science); Multiprocessing; Programming language; Finite-state machine; Model checking; Parallel computing; Artificial intelligence; Correctness","retraction":null,"screen_n_in":null,"score":{"opus":0.02071184204497678,"gpt":0.2472285293384058,"spread":0.226516687293429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001998921,0.000114991,0.0003628657,0.00007357627,0.0000812692,0.00004584124,0.0005237822,0.00005885438,0.000004199201],"category_scores_gemma":[0.00008634188,0.0001091338,0.00007679855,0.0003201076,0.00009022845,0.0001499888,0.00004723238,0.00006139487,0.00001253756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002620764,"about_ca_system_score_gemma":0.0001065412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003963142,"about_ca_topic_score_gemma":2.289098e-7,"domain_scores_codex":[0.9981344,0.0004981681,0.0006568186,0.0002399456,0.0002711407,0.0001995141],"domain_scores_gemma":[0.998368,0.0001762135,0.0005387008,0.0006475132,0.0002231157,0.00004644831],"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.000003304399,0.00004497233,0.0001705713,0.0002020621,0.00002722907,0.000001379719,0.0006155784,0.002190532,0.004696435,0.9907902,0.000149901,0.001107763],"study_design_scores_gemma":[0.004657522,0.0007076941,0.007923165,0.004191695,0.0001237763,0.0006687478,0.003344039,0.8003544,0.1004773,0.04696737,0.02859594,0.001988319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09486375,0.0008572104,0.8867367,0.000008711401,0.001244494,0.0002143767,0.000009617768,0.0001228701,0.01594229],"genre_scores_gemma":[0.9962001,0.000001687827,0.003573063,0.00000674102,0.00002950973,0.000002685096,0.00000280176,0.000006812832,0.0001765527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9438229,"threshold_uncertainty_score":0.4450346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942711255","doi":"10.1007/s00224-021-10059-4","title":"The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)","year":2022,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"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":"Common value auction; Monotonic function; Anomaly (physics); Economics; Mathematical economics; Econometrics; Microeconomics; Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1529755991396964,"gpt":0.3846520602568345,"spread":0.2316764611171381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01013014,0.0001377575,0.0002884511,0.0002321842,0.001655259,0.0001298363,0.001117752,0.00004884536,0.0002884331],"category_scores_gemma":[0.0003893363,0.0001093936,0.0001414615,0.001072289,0.0002958813,0.0001385682,0.0004196051,0.000322025,0.0001045779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001071423,"about_ca_system_score_gemma":0.0001298646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001102922,"about_ca_topic_score_gemma":0.000005858712,"domain_scores_codex":[0.9957852,0.001730004,0.0009738895,0.0004357453,0.0007961232,0.0002790496],"domain_scores_gemma":[0.9945692,0.003732202,0.0007387452,0.000691978,0.0002042176,0.00006362936],"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.0003689465,0.000313101,0.0056954,0.00001844968,0.0001300665,0.00001046262,0.03123797,0.108105,0.003258435,0.8365557,0.004139259,0.01016728],"study_design_scores_gemma":[0.003286709,0.0003052208,0.01758764,0.0001465105,0.00009667537,0.0003657073,0.2808005,0.4073478,0.003576342,0.08570386,0.1996965,0.001086522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8327727,0.0001804444,0.1604082,0.0008347293,0.001652902,0.0004437786,0.00006759651,0.00007864337,0.003560984],"genre_scores_gemma":[0.9922306,0.000001939696,0.0002799044,0.0001892304,0.0001207314,0.00001658843,0.000002111414,0.00001389522,0.007144989],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7508518,"threshold_uncertainty_score":0.9996445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2885021324","doi":"10.1007/s00224-018-9876-z","title":"Computing Parameters of Sequence-Based Dynamic Graphs","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Sequence (biology); Bounded function; Amortized analysis; Computer science; Maximization; Algorithm; Minification; Graph; Combinatorics; Mathematics; Discrete mathematics; Mathematical optimization; Data structure","retraction":null,"screen_n_in":null,"score":{"opus":0.03470963640328709,"gpt":0.2690888536117062,"spread":0.2343792172084191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442849,0.0002307771,0.0005860394,0.0002180481,0.0001704157,0.00006450707,0.001134389,0.0001069381,0.000003412697],"category_scores_gemma":[0.00002171494,0.000213416,0.0001566977,0.0005524748,0.0005785988,0.0001002473,0.0001964995,0.0001559247,0.00001079627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003809702,"about_ca_system_score_gemma":0.0001555602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005323656,"about_ca_topic_score_gemma":9.283971e-7,"domain_scores_codex":[0.9973229,0.0005284496,0.0008784857,0.0004186125,0.0004267698,0.0004247363],"domain_scores_gemma":[0.9968767,0.001063683,0.0008154075,0.0008163789,0.0003128476,0.0001149468],"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.0001430515,0.0002705849,0.002165101,0.0008583566,0.0002815609,0.00005090028,0.005856297,0.03403527,0.002845312,0.6715379,0.0004150425,0.2815406],"study_design_scores_gemma":[0.0003667439,0.0002659977,0.000178757,0.0006528762,0.00001790206,0.00003091771,0.0001428693,0.9899342,0.0003960849,0.007773397,0.00002318918,0.0002170505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2855704,0.0001336694,0.7110661,0.00002139574,0.001154948,0.0001797875,0.000003618852,0.0001467871,0.001723256],"genre_scores_gemma":[0.9694595,0.00000130528,0.03032488,0.00008678136,0.00007380553,8.894759e-7,0.000003871244,0.00001678138,0.00003212296],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9558989,"threshold_uncertainty_score":0.8702852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2179209375","doi":"10.1007/s00224-011-9343-6","title":"The Feline Josephus Problem","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 Victoria","funders":"","keywords":"Fibonacci number; Element (criminal law); Sequence (biology); Value (mathematics); Combinatorics; Mathematics; Order (exchange); Position (finance); Arithmetic; Constant (computer programming); Computer science; Statistics; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.077392365069908,"gpt":0.2993293293321627,"spread":0.2219369642622547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00298612,0.0001734614,0.0003853079,0.00004063085,0.0002080507,0.00002358462,0.0005448356,0.00006573628,0.000006142828],"category_scores_gemma":[0.0006408875,0.00011475,0.00008790534,0.0001478832,0.0001549199,0.00004507121,0.0001361986,0.0001518799,0.0000215616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003545279,"about_ca_system_score_gemma":0.00003001527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006510129,"about_ca_topic_score_gemma":7.059897e-7,"domain_scores_codex":[0.9981353,0.0003649457,0.0007591707,0.0001576762,0.0002926529,0.0002902432],"domain_scores_gemma":[0.9959743,0.002473379,0.0006527424,0.0006459598,0.0002024984,0.00005113501],"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.00002844862,0.00007914536,0.00001487617,0.0002762265,0.0000529172,0.000001719746,0.004113062,0.00002578467,0.000119803,0.9937394,0.0002272515,0.001321415],"study_design_scores_gemma":[0.0002775636,0.00008543954,0.00001477135,0.0003156094,0.0000321132,0.00002263105,0.001093199,0.001160149,0.0008697491,0.9955631,0.0004302209,0.0001354849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3548454,0.001056129,0.5369309,0.00004062291,0.00429694,0.001931933,0.000004778332,0.0007515019,0.1001419],"genre_scores_gemma":[0.9770758,0.000003635126,0.02192755,0.000005215995,0.0002065996,0.000009215922,3.051376e-7,0.00004241532,0.0007293022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6222304,"threshold_uncertainty_score":0.467937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985257126","doi":"10.1007/s00224-008-9110-5","title":"Structural Recursion as a Query Language on Lists and Ordered Trees","year":2008,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Semantic Web and Ontologies","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 Regina","funders":"","keywords":"Recursion (computer science); Computer science; Query language; Query optimization; Programming language; Theoretical computer science; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.02133140059131159,"gpt":0.2570534105745805,"spread":0.2357220099832689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004534439,0.0001209736,0.0002601568,0.00008769771,0.0001423717,0.00003908834,0.0003884068,0.00005255143,0.000001716542],"category_scores_gemma":[0.0001161809,0.00009330646,0.00003795553,0.0001187937,0.0001180647,0.00008648142,0.0001268639,0.0000795306,0.000008175226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001424245,"about_ca_system_score_gemma":0.00002824566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001602035,"about_ca_topic_score_gemma":0.000003883896,"domain_scores_codex":[0.9988969,0.0002617436,0.0002284761,0.0002379003,0.0001966538,0.0001783093],"domain_scores_gemma":[0.9989235,0.0004839735,0.0001543044,0.0003550022,0.00004103843,0.00004219563],"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.000155271,0.00006978602,0.003910169,0.0003015462,0.00008616797,0.0002446056,0.05816152,0.001506137,0.004361245,0.8809363,0.0008169858,0.04945032],"study_design_scores_gemma":[0.006843651,0.003510362,0.3260588,0.004934083,0.00007275862,0.007581449,0.02201672,0.5257143,0.02784555,0.07098679,0.001396718,0.003038766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9866585,0.00106401,0.009118714,0.00009513007,0.0005666158,0.0001210458,7.237651e-7,0.0001798254,0.002195474],"genre_scores_gemma":[0.9983461,0.000007542611,0.001171952,0.0000664242,0.00008210201,7.065942e-7,6.897179e-7,0.000005959742,0.0003185119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8099495,"threshold_uncertainty_score":0.3804927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064923761","doi":"10.1007/s00224-001-1037-z","title":"Pursuit and Evasion on a Ring: An Infinite Hierarchy for Parallel Real-Time Systems","year":2001,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Formal Methods in Verification","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":"Queen's University","funders":"","keywords":"Hierarchy; Integer (computer science); Ring (chemistry); Computer science; Computation; Parallel computing; Memory hierarchy; Execution time; Real number; Algorithm; Discrete mathematics; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05175340958556925,"gpt":0.3125254380226435,"spread":0.2607720284370743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00596936,0.0002061324,0.0004206406,0.0002312841,0.0002163267,0.0002196185,0.0008774323,0.0001089042,7.682565e-7],"category_scores_gemma":[0.0001924207,0.0001882776,0.00005877592,0.0002713554,0.00009693726,0.0003375607,0.0001537737,0.0001144238,0.00001255746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005850182,"about_ca_system_score_gemma":0.00003693512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004538202,"about_ca_topic_score_gemma":2.034957e-7,"domain_scores_codex":[0.9972215,0.0009764964,0.0006102229,0.0004648532,0.0003801684,0.0003467484],"domain_scores_gemma":[0.9973917,0.000987938,0.0004750595,0.0008475737,0.0001729259,0.0001248027],"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.0001444882,0.00007085984,0.000124407,0.0002772898,0.00002692476,0.000002634843,0.002055067,0.01705223,0.003429896,0.9594616,0.00004048475,0.01731415],"study_design_scores_gemma":[0.0006470245,0.0007757295,0.001443899,0.0005444607,0.00001215182,0.0000956744,0.0001830813,0.9881377,0.0002229043,0.006757879,0.0009161635,0.000263338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2990147,0.0001583017,0.6961587,0.00002125984,0.0007055865,0.0007324801,0.000002683701,0.0002430542,0.002963254],"genre_scores_gemma":[0.9016922,0.00001879059,0.09766049,0.00002182765,0.0002253275,0.00003002777,0.000004666506,0.00002416205,0.0003224765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9710855,"threshold_uncertainty_score":0.7677738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1602585208","doi":"10.1007/s00224-003-1126-2","title":"Asymmetric Communication Protocols via Hotlink Assignments","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"McGill University; Carleton University","funders":"","keywords":"Computer science; Protocol (science); Communications protocol; Theoretical computer science; Computer network; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.03579338451336043,"gpt":0.2865977298048002,"spread":0.2508043452914398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003568049,0.0001639568,0.0003279191,0.0002516061,0.0002515748,0.0001337067,0.00147626,0.00007003886,0.000004446054],"category_scores_gemma":[0.0001321786,0.0001575562,0.00009484983,0.0008980032,0.0001160791,0.0001961624,0.0002421395,0.0001842495,0.00002528135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000049453,"about_ca_system_score_gemma":0.00004850057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001524814,"about_ca_topic_score_gemma":2.092298e-7,"domain_scores_codex":[0.9970909,0.001371949,0.0005580249,0.0002893261,0.0004104969,0.0002792396],"domain_scores_gemma":[0.9974017,0.0007306637,0.0004438887,0.001203014,0.0001479814,0.00007275159],"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.000004244987,0.0001306161,0.000303071,0.00009146794,0.00003591205,0.000001393002,0.0005954177,0.0006242946,0.0001667503,0.9700501,0.0001222648,0.02787444],"study_design_scores_gemma":[0.002449493,0.0006036303,0.004350185,0.001663524,0.00003086938,0.0001995218,0.0003635693,0.4230869,0.008983536,0.5433837,0.01374275,0.001142362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002938481,0.0003722245,0.9794101,0.00002157753,0.0003881823,0.003095622,0.000001039646,0.0002105847,0.01356223],"genre_scores_gemma":[0.9569438,0.000002020736,0.04267002,0.00003533689,0.00003423667,0.0001860168,0.000001303294,0.00001222604,0.0001150972],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9540052,"threshold_uncertainty_score":0.6424956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2807933378","doi":"10.1007/s00224-019-09955-7","title":"Advice Complexity of Priority Algorithms","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","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":"Concordia University; University of Toronto","funders":"","keywords":"Advice (programming); Oracle; Computer science; Reduction (mathematics); Mathematical proof; Function (biology); Algorithm; Matching (statistics); Adversary; Greedy algorithm; Upper and lower bounds; Theoretical computer science; Mathematics; Programming language; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03455034673156813,"gpt":0.2786913157960295,"spread":0.2441409690644613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302911,0.0001127437,0.0003766119,0.0001125741,0.00005453436,0.00004075341,0.0009085027,0.00005220427,0.00001780329],"category_scores_gemma":[0.00004085451,0.0001033934,0.00007372545,0.0004022493,0.0001421931,0.000167002,0.0002922716,0.0001168188,0.0000421572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002322042,"about_ca_system_score_gemma":0.00007415112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006497009,"about_ca_topic_score_gemma":4.347257e-7,"domain_scores_codex":[0.998111,0.000510878,0.0005070234,0.000253315,0.0003940445,0.0002237019],"domain_scores_gemma":[0.9982938,0.000339065,0.0003764712,0.0006281641,0.0002967201,0.00006579585],"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.000009554566,0.00007817486,0.0009975769,0.0003665525,0.00003094942,6.899934e-7,0.002180717,0.01864993,0.0007092363,0.9728321,0.00006452369,0.004079934],"study_design_scores_gemma":[0.0005038247,0.0001413052,0.002235095,0.0002246123,0.000003649735,0.0000106059,0.0002002432,0.9859535,0.0006670543,0.009595702,0.0003124017,0.0001519665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08752072,0.0001758583,0.8968521,0.00006118057,0.0008470871,0.0004512251,0.000003967401,0.000206676,0.01388116],"genre_scores_gemma":[0.9617743,0.000002579098,0.03776181,0.00002588722,0.0000368178,8.879128e-7,0.000001831487,0.000007520315,0.0003882916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9673036,"threshold_uncertainty_score":0.4216262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}