{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":109,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":109,"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":"2bb9cd8d5902","filters":{"venue":"Random Structures and Algorithms"}},"results":[{"id":"W2047467760","doi":"10.1002/rsa.20061","title":"Cores in random hypergraphs and Boolean formulas","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; struct; Mathematics; Literal (mathematical logic); Combinatorics; Core (optical fiber); Discrete mathematics; Random graph; Algorithm; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.005996719707171033,"gpt":0.2216096229441444,"spread":0.2156129032369733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001497027,0.0001315614,0.0002102367,0.0001391656,0.0001151567,0.0001548235,0.000108587,0.00005737435,0.00002661591],"category_scores_gemma":[0.00002535888,0.0001046856,0.00003725708,0.0001458161,0.00006816487,0.0003437616,0.00005824459,0.0001051304,9.321845e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001041604,"about_ca_system_score_gemma":0.00001926506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004060765,"about_ca_topic_score_gemma":0.000107544,"domain_scores_codex":[0.9991882,0.00004054911,0.0002018286,0.0002650274,0.0001265595,0.0001778016],"domain_scores_gemma":[0.9996022,0.0001046425,0.00005116937,0.0001342385,0.00002236842,0.0000853724],"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.0001145,0.000009977838,0.002953678,0.00001040011,0.00001590482,0.000006974883,0.0006842443,0.001211436,0.0001366391,0.01764753,0.0001057423,0.977103],"study_design_scores_gemma":[0.04240464,0.0001086043,0.1171874,0.00004546648,0.00002324391,0.0003195844,0.0001556412,0.8058005,0.0009096539,0.02196975,0.01042675,0.0006487581],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.314379,0.002912445,0.6772009,0.002473271,0.0004632635,0.0006627478,0.00001173586,0.0001931334,0.001703487],"genre_scores_gemma":[0.9569929,0.0006382672,0.04193955,0.000279917,0.00007761501,0.000006756823,0.00000311672,0.000005856532,0.00005597995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9764542,"threshold_uncertainty_score":0.4268954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168173277","doi":"10.1002/1098-2418(200010/12)17:3/4<290::aid-rsa6>3.0.co;2-q","title":"Extension of Fill's perfect rejection sampling algorithm to general chains","year":2000,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Western University","funders":"","keywords":"Extension (predicate logic); Randomness; Bounding overwatch; Algorithm; Sampling (signal processing); Computer science; Simple (philosophy); Connection (principal bundle); Rejection sampling; Mathematics; Theoretical computer science; Artificial intelligence; Statistics; Programming language; Hybrid Monte Carlo; Markov chain Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.04046938814774089,"gpt":0.3395489419876489,"spread":0.299079553839908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006385744,0.0002536378,0.0005690079,0.0001219987,0.0001796251,0.00003852007,0.0001052134,0.0001327128,0.000176127],"category_scores_gemma":[0.0001787925,0.0001951812,0.000162063,0.000185082,0.00005350392,0.00006152897,0.00004764609,0.0001646012,1.141227e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002375655,"about_ca_system_score_gemma":0.00001753203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001485929,"about_ca_topic_score_gemma":0.00001220187,"domain_scores_codex":[0.9984624,0.0001616938,0.0004049907,0.0004037326,0.000262874,0.0003043303],"domain_scores_gemma":[0.9990152,0.0003046682,0.0001015598,0.0003212453,0.00009531929,0.0001620195],"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.0002514774,0.00002692313,0.00001459654,0.00007082807,0.00005062634,0.000006580431,0.0006753643,0.0001640949,0.005434833,0.001516063,0.0004519765,0.9913366],"study_design_scores_gemma":[0.06237288,0.004463271,0.01065222,0.001647665,0.00135971,0.001738772,0.002552665,0.5120035,0.1159827,0.140608,0.1405776,0.00604104],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8030767,0.0006661806,0.193668,0.0001281949,0.0004751843,0.0006532623,0.00007440277,0.00008991308,0.001168094],"genre_scores_gemma":[0.1106195,0.0007827994,0.8841713,0.0002612307,0.001050102,0.0000350685,0.00002146765,0.00006983027,0.002988707],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9852956,"threshold_uncertainty_score":0.7959259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949544577","doi":"10.1002/rsa.20051","title":"Random subgraphs of finite graphs: I. The scaling window under the triangle condition","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Scaling; Vertex (graph theory); Random graph; Discrete mathematics; Graph; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02395075425206081,"gpt":0.2966950371011621,"spread":0.2727442828491012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006369664,0.0001984368,0.000433806,0.00005316145,0.0003376088,0.00007050206,0.0002052692,0.00008938899,0.0001008504],"category_scores_gemma":[0.0006516794,0.00009534524,0.0001638311,0.0001912563,0.0002237399,0.00006178534,0.00004314485,0.0002152819,0.000001118112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007851732,"about_ca_system_score_gemma":0.00002545346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001785103,"about_ca_topic_score_gemma":0.00001541129,"domain_scores_codex":[0.9986668,0.0001229652,0.0004387411,0.0002069148,0.0003188432,0.0002456876],"domain_scores_gemma":[0.9950928,0.004283729,0.0002161622,0.0002460802,0.00009658912,0.00006463296],"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.001037503,0.00005474957,0.00000716769,0.000137135,0.0002640233,0.000003282432,0.001236874,0.0006289181,0.0002998301,0.9182781,0.0006479627,0.07740447],"study_design_scores_gemma":[0.01056534,0.00006625856,0.0001683779,0.00004755102,0.0002247747,0.00003096832,0.0006784219,0.02526632,0.0008866108,0.9615667,0.0003425327,0.0001560988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04739849,0.002754496,0.9469311,0.001261112,0.000327074,0.0008610851,0.0001675948,0.00004858897,0.0002504594],"genre_scores_gemma":[0.9886594,0.0002456698,0.01046078,0.0002987631,0.0002236943,0.00003393056,0.00001032238,0.00002103081,0.0000464248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9412609,"threshold_uncertainty_score":0.3888066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974070050","doi":"10.1002/rsa.10089","title":"Space complexity of random formulae in resolution","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Space (punctuation); Resolution (logic); Computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02431304330521862,"gpt":0.253169672390741,"spread":0.2288566290855223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688687,0.0001435123,0.0003793216,0.00009454446,0.00009486647,0.00007036061,0.0002174979,0.00007968163,0.000009371296],"category_scores_gemma":[0.00007816661,0.0001056632,0.00007492869,0.0002374924,0.0001257897,0.0001689945,0.00005582683,0.0001124863,0.000001071237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002280745,"about_ca_system_score_gemma":0.00003671121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003477585,"about_ca_topic_score_gemma":0.00006816649,"domain_scores_codex":[0.9987717,0.00017735,0.0002997747,0.0002822114,0.0002069252,0.0002620447],"domain_scores_gemma":[0.9993873,0.0001011038,0.000131475,0.0002619962,0.00004826672,0.00006988883],"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.0001194738,0.00002360466,0.0008403948,0.00005632246,0.00002147752,0.00001062695,0.0008519655,0.0001514774,0.0002685199,0.9807488,0.00007693622,0.01683041],"study_design_scores_gemma":[0.03293864,0.0002427984,0.009065062,0.00002046577,0.0000199934,0.0001500837,0.0001963774,0.06125256,0.005186896,0.8772364,0.01318894,0.0005017882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03158595,0.002608032,0.9611246,0.000126028,0.0006250446,0.0006115818,0.000002946275,0.00006772571,0.003248085],"genre_scores_gemma":[0.9796321,0.00006440518,0.0201563,0.00002387627,0.00004487883,0.000008626453,0.000002409579,0.000005418491,0.00006201983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9480461,"threshold_uncertainty_score":0.4308819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994460676","doi":"10.1002/rsa.20496","title":"The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Constant (computer programming); Function (biology); Discrete mathematics; Set (abstract data type); Piecewise; Piecewise linear function; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01226066911795185,"gpt":0.2748042403165601,"spread":0.2625435711986083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177393,0.000304143,0.001040366,0.00006083882,0.0001774511,0.00004238209,0.0003021627,0.00016306,0.0001020843],"category_scores_gemma":[0.0009463868,0.0001448979,0.0002116286,0.0001640275,0.00118012,0.00009033178,0.0001764256,0.0002834751,1.944973e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001032257,"about_ca_system_score_gemma":0.0000265807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005447079,"about_ca_topic_score_gemma":0.00005470641,"domain_scores_codex":[0.9977601,0.0004589059,0.0008813171,0.0002557246,0.0003399061,0.0003040472],"domain_scores_gemma":[0.9932969,0.005493194,0.000544997,0.0004417411,0.0001517482,0.00007147632],"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.04959156,0.0002209686,0.01809194,0.002978434,0.00306911,0.00003674543,0.05469959,0.0002142696,0.004274207,0.6649465,0.002397436,0.1994792],"study_design_scores_gemma":[0.03778512,0.00007732349,0.005933139,0.0001280155,0.0001474834,0.00005886628,0.002582378,0.002494427,0.001706783,0.9487817,0.00009265837,0.0002121029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9962668,0.001132475,0.0002118,0.0002804224,0.0002371822,0.00118383,0.00007916629,0.0000124331,0.0005958237],"genre_scores_gemma":[0.9974622,0.0006041673,0.001718113,0.00005970335,0.00004773245,0.00003455305,0.000003655645,0.00002513294,0.00004478676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2838352,"threshold_uncertainty_score":0.5908763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242064191","doi":"10.1002/rsa.20279","title":"Asymptotic random graph intuition for the biased connectivity game","year":2009,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Intuition; Random graph; Mathematics; Graph; Discrete mathematics; Mathematical economics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01809614125711018,"gpt":0.2568782022790673,"spread":0.2387820610219571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006321229,0.0002780558,0.0004216545,0.0001324291,0.0006233584,0.0004114176,0.0006176395,0.00009585376,0.00001427201],"category_scores_gemma":[0.0001606038,0.0001798569,0.0002671211,0.0003834847,0.000176299,0.000323125,0.00008428195,0.0002241585,0.00000103759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159503,"about_ca_system_score_gemma":0.00003243368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003383459,"about_ca_topic_score_gemma":0.000009245192,"domain_scores_codex":[0.9983403,0.00013071,0.00030414,0.0005213115,0.0002926285,0.0004108812],"domain_scores_gemma":[0.9976753,0.001472348,0.0001342843,0.0004974511,0.0001001974,0.0001204375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004756553,0.00006254184,0.00002474514,0.00002460477,0.0001072533,0.000007843279,0.0006014458,0.0005572425,0.0003771866,0.1957343,0.0005721282,0.801455],"study_design_scores_gemma":[0.01621167,0.000348394,0.007123653,0.00002751436,0.00006053401,0.00009018394,0.000041754,0.2744448,0.001000991,0.6969969,0.003264534,0.0003890509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01162088,0.001485464,0.9827552,0.002099814,0.0008065208,0.0009147148,0.00003019033,0.0001721641,0.000115081],"genre_scores_gemma":[0.9752729,0.0002613171,0.02304308,0.0009316319,0.0003908574,0.00005273072,0.00001082418,0.00001046218,0.0000262072],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.963652,"threshold_uncertainty_score":0.7334351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1488446430","doi":"10.1002/rsa.20539","title":"The mixing time of the giant component of a random graph","year":2014,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Expander graph; Mixing (physics); Random graph; Random walk; Mathematics; Combinatorics; Constant (computer programming); Vertex (graph theory); Component (thermodynamics); Exponential function; Discrete mathematics; Graph; Statistical physics; Computer science; Physics; Statistics; Mathematical analysis; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01511420349440316,"gpt":0.2716785362266982,"spread":0.256564332732295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427528,0.0001618978,0.0005154129,0.0000327968,0.0002189628,0.00001868114,0.0002488742,0.00006473633,0.000008567969],"category_scores_gemma":[0.0004881337,0.00007276821,0.00025071,0.00009901488,0.0002624236,0.00002016982,0.0001079374,0.0001336291,1.261656e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005250579,"about_ca_system_score_gemma":0.00001322181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003816939,"about_ca_topic_score_gemma":0.000009198062,"domain_scores_codex":[0.998519,0.0004387996,0.0004274074,0.0001555598,0.0002706049,0.0001885981],"domain_scores_gemma":[0.9970578,0.002107231,0.0003104152,0.0003960452,0.00007836831,0.00005011749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005534273,0.0002303415,0.0006809513,0.001574323,0.001523297,0.000006426782,0.009032185,0.0002318621,0.1401388,0.2512047,0.004971961,0.5848708],"study_design_scores_gemma":[0.08240771,0.0004996967,0.005973731,0.0008371544,0.001052658,0.000168462,0.001575504,0.1091354,0.1160911,0.659934,0.02109858,0.001226088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9009304,0.002879868,0.08960737,0.0007617342,0.001004834,0.001493723,0.00006687341,0.00004640287,0.003208774],"genre_scores_gemma":[0.9732144,0.0002353489,0.02582978,0.00006859146,0.0001877655,0.0000161355,0.000002022892,0.00002863347,0.0004173581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5836447,"threshold_uncertainty_score":0.2967401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233604521","doi":"10.1002/rsa.20080","title":"Topological characteristics of random triangulated surfaces","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Geometry and complex manifolds","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"struct; Euler characteristic; Surface (topology); Euler's formula; Mathematics; Combinatorics; Topology (electrical circuits); Euler number (physics); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Euler equations; Backward Euler method","retraction":null,"screen_n_in":null,"score":{"opus":0.02862818733011217,"gpt":0.2886299335355384,"spread":0.2600017462054262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003425188,0.00019575,0.0006582692,0.00006867773,0.0001059089,0.00003739566,0.0001443975,0.0001303813,0.0006084119],"category_scores_gemma":[0.0002568243,0.0001354423,0.0001243382,0.0001293739,0.0001177078,0.00006220463,0.00005670022,0.0001372558,0.000002267225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007638273,"about_ca_system_score_gemma":0.00001202153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001649734,"about_ca_topic_score_gemma":0.00000415769,"domain_scores_codex":[0.9987814,0.0001032595,0.0004663927,0.0002154324,0.000203226,0.0002302267],"domain_scores_gemma":[0.9989023,0.0005576606,0.0001954769,0.0001958401,0.00006476732,0.00008397456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.01351044,0.0009539493,0.004972159,0.001098168,0.001554581,0.0001218742,0.00437573,0.0002528577,0.01600893,0.3103675,0.003744352,0.6430395],"study_design_scores_gemma":[0.107587,0.0009644647,0.0974065,0.000163483,0.0006530706,0.0004421025,0.0008765015,0.02440071,0.01977623,0.7201735,0.02568718,0.00186925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9942512,0.0005313167,0.003878683,0.0002197724,0.0001739827,0.000285105,0.00004721112,0.00006096161,0.0005517744],"genre_scores_gemma":[0.9855623,0.0001094832,0.01362308,0.00004852661,0.0002669735,0.00000498778,0.00001104326,0.00001287541,0.0003607239],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6411702,"threshold_uncertainty_score":0.6661684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983805560","doi":"10.1002/rsa.20053","title":"Maxima in hypercubes","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Maxima; Hypercube; Mathematics; Upper and lower bounds; Combinatorics; Maxima and minima; Poisson distribution; Simplex; Square (algebra); Generality; Discrete mathematics; Mathematical analysis; Geometry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02069956144316212,"gpt":0.2864416798429761,"spread":0.265742118399814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485534,0.0002102155,0.0003747524,0.0001238618,0.0001654339,0.00004554022,0.0001538684,0.0001177646,0.0001434825],"category_scores_gemma":[0.0001535706,0.0001480623,0.00008379815,0.0001137198,0.0001179703,0.0001118328,0.00008842537,0.0002158367,0.000001774709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002355912,"about_ca_system_score_gemma":0.00001286894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001838094,"about_ca_topic_score_gemma":0.00002755789,"domain_scores_codex":[0.9988205,0.0000713581,0.0003046013,0.0002746386,0.0002332271,0.000295636],"domain_scores_gemma":[0.9993454,0.0002927641,0.00005901144,0.0001884741,0.00003320889,0.00008119983],"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.0004017111,0.00006449624,0.001967128,0.0001187563,0.00009638844,0.0000349212,0.003276212,0.00006887277,0.0004706652,0.6733215,0.002085888,0.3180935],"study_design_scores_gemma":[0.004703169,0.00003220112,0.004494178,0.00002311751,0.0000207085,0.0001138478,0.0001562938,0.001283537,0.0006439319,0.9790692,0.009181268,0.0002785895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.988969,0.001559553,0.000521425,0.0003181537,0.0002770677,0.000306409,0.00002065977,0.00008299357,0.007944767],"genre_scores_gemma":[0.9757369,0.0002221549,0.02306568,0.000286508,0.0004452704,0.0000104605,0.000002133252,0.00002455009,0.0002063535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3178149,"threshold_uncertainty_score":0.6037804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130047894","doi":"10.1002/rsa.10066","title":"On the swapping algorithm","year":2002,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"struct; Ising model; Mixing (physics); Markov chain Monte Carlo; Markov chain; Statistical physics; Monte Carlo method; Algorithm; Computer science; Mathematics; Physics; Statistics; Machine learning; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.00805450382717353,"gpt":0.2060959177221728,"spread":0.1980414138949993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000581617,0.0001330127,0.0001414404,0.00001554646,0.0002478389,0.00007770267,0.0001010089,0.00001863519,0.001671988],"category_scores_gemma":[0.000004823085,0.00007534846,0.00007688282,0.00007428358,0.0001036474,0.00003719532,0.0000327516,0.0001506472,0.00003670426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003139533,"about_ca_system_score_gemma":0.000002873913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001160955,"about_ca_topic_score_gemma":3.224631e-8,"domain_scores_codex":[0.9993612,0.00004053824,0.0001143731,0.0001702008,0.0001471028,0.0001666019],"domain_scores_gemma":[0.9994247,0.0003438322,0.00003864512,0.0001123348,0.00002255786,0.00005792845],"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.000008129889,0.00001783028,0.00001205989,0.000001355797,0.00003808038,7.161607e-7,0.000103983,0.00008859771,0.00001227205,0.6903203,0.0009589051,0.3084377],"study_design_scores_gemma":[0.001265499,0.00003091892,0.0002162502,0.000008628935,0.00001458226,0.00000191095,0.00008646651,0.05528512,0.0002073534,0.9409251,0.001822009,0.0001361436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2872274,0.0009697704,0.588446,0.00646408,0.001163272,0.001139786,0.0002769041,0.0001898074,0.114123],"genre_scores_gemma":[0.9975383,0.000004997178,0.001175402,0.0003314609,0.0005496888,0.00001244183,0.000007541852,0.00001015621,0.0003700003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7103109,"threshold_uncertainty_score":0.9992406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2514202683","doi":"10.1002/rsa.20246","title":"Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Rectangle; Vertex (graph theory); Upper and lower bounds; Binary logarithm; Delaunay triangulation; Graph; Discrete mathematics; General position; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0134014026243379,"gpt":0.2381435086761491,"spread":0.2247421060518112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000233268,0.0001051706,0.0001723973,0.0001446761,0.0001187756,0.00003831528,0.000221576,0.00002867205,0.00000390916],"category_scores_gemma":[0.00002436069,0.00006078851,0.00003097231,0.0004627947,0.00004372784,0.0001098752,0.00004008383,0.00008172893,5.108711e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006258085,"about_ca_system_score_gemma":0.00003210514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006722484,"about_ca_topic_score_gemma":0.000054983,"domain_scores_codex":[0.9991209,0.00008943044,0.0001736163,0.0002211309,0.0002601703,0.0001347627],"domain_scores_gemma":[0.9994828,0.0001935964,0.00005513597,0.0001790357,0.00004405883,0.00004541974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.004887224,0.0003950604,0.00689037,0.0001546827,0.0003364204,0.001006691,0.056935,0.1597311,0.005255861,0.3249031,0.008433258,0.4310712],"study_design_scores_gemma":[0.02999936,0.003200731,0.534824,0.0001825074,0.00005394256,0.005224906,0.0008162324,0.1059919,0.009389781,0.3033954,0.005414012,0.001507226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8033941,0.0007377471,0.1939684,0.001132969,0.0001180683,0.0003649075,0.000009592407,0.00002422643,0.0002499943],"genre_scores_gemma":[0.929836,0.00007205169,0.06976404,0.0002495077,0.00003823048,0.00001068524,0.000007130064,0.000003411123,0.00001893944],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5279336,"threshold_uncertainty_score":0.2478883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094948820","doi":"10.1002/rsa.20394","title":"The scaling window for a random graph with a given degree sequence","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Random graph; Combinatorics; Giant component; Scaling; Mathematics; Degree (music); Graph; Sequence (biology); Random sequence; Component (thermodynamics); Window (computing); Discrete mathematics; Physics; Geometry; Computer science; Mathematical analysis; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.04942200943055145,"gpt":0.3026302775420053,"spread":0.2532082681114538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009763174,0.0003383885,0.0005000936,0.0000665819,0.001422144,0.0001406611,0.0002881054,0.0001273481,0.00001395461],"category_scores_gemma":[0.0003155954,0.0001657147,0.0001990291,0.0001459347,0.0004331006,0.0001736622,0.00008459116,0.0002395826,2.679236e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001590171,"about_ca_system_score_gemma":0.00002336635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001596553,"about_ca_topic_score_gemma":0.00001152276,"domain_scores_codex":[0.9982502,0.0001424627,0.0003478095,0.0002931215,0.0003099882,0.0006563528],"domain_scores_gemma":[0.9968,0.002323768,0.0002009461,0.0003862171,0.0001014153,0.0001876742],"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.01010395,0.00006902581,0.002789978,0.0004409537,0.001254331,0.00001415834,0.008705371,0.00005102134,0.0007333069,0.6976423,0.00139167,0.2768039],"study_design_scores_gemma":[0.02071336,0.0001562677,0.001954434,0.00008166797,0.000328146,0.0002853901,0.0007736724,0.000693521,0.001151408,0.9667298,0.006590704,0.0005416773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8425766,0.01111755,0.1379132,0.0006631045,0.001863144,0.003991673,0.0002166745,0.0002667817,0.001391304],"genre_scores_gemma":[0.9644755,0.000248766,0.03413736,0.0001259562,0.0006957818,0.0001308671,0.000007031369,0.00005239216,0.000126347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2762623,"threshold_uncertainty_score":0.9998779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4247423216","doi":"10.1002/rsa.20210","title":"The evolution of the mixing rate of a simple random walk on the giant component of a random graph","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Random walk; Giant component; Mixing (physics); Mathematics; Component (thermodynamics); Combinatorics; Random graph; Degree (music); Simple random sample; Statistical physics; Graph; Discrete mathematics; Statistics; Physics; Thermodynamics; Quantum mechanics; Population","retraction":null,"screen_n_in":null,"score":{"opus":0.02167791884311004,"gpt":0.2598681421901732,"spread":0.2381902233470631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282854,0.0002019373,0.0006191426,0.00003951328,0.0004457193,0.00001465308,0.0003061274,0.00006941157,0.00001683872],"category_scores_gemma":[0.001701562,0.00008261987,0.0002355149,0.0002121317,0.0004287189,0.00002366016,0.00008470414,0.0001943731,1.544378e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001733351,"about_ca_system_score_gemma":0.00005935199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001432847,"about_ca_topic_score_gemma":0.00001657412,"domain_scores_codex":[0.99829,0.0002641876,0.0006409179,0.0001827839,0.0003894525,0.0002326594],"domain_scores_gemma":[0.9929968,0.005929318,0.000489087,0.0003677385,0.0001693314,0.00004777564],"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.01049787,0.000163813,0.00003441807,0.0005256461,0.0005420662,0.000007061811,0.002681895,0.0003877284,0.0106573,0.9626211,0.0008250842,0.01105605],"study_design_scores_gemma":[0.01973897,0.0001930941,0.0007281208,0.0001700942,0.0001980522,0.00004250665,0.0006845777,0.0370193,0.009092223,0.9319004,0.00007747649,0.0001551427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4168534,0.002217669,0.5778644,0.0005608813,0.0004257838,0.001645716,0.0002376968,0.00002086029,0.0001735809],"genre_scores_gemma":[0.9977639,0.0002623816,0.001825144,0.00003164156,0.00005147252,0.00002503959,0.00000178649,0.0000156023,0.00002301221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5809105,"threshold_uncertainty_score":0.3428158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023729725","doi":"10.1002/rsa.20547","title":"Invariant Gaussian processes and independent sets on regular graphs of large girth","year":2014,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; European Commission","keywords":"Eigenvalues and eigenvectors; Invariant (physics); Vertex (graph theory); Upper and lower bounds; Gaussian; Graph; Tree (set theory)","retraction":null,"screen_n_in":null,"score":{"opus":0.01531110676637438,"gpt":0.2811028403101518,"spread":0.2657917335437774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443893,0.0002165161,0.0004801802,0.00007562585,0.0001330322,0.00004703723,0.0001082505,0.0001120692,0.00003254654],"category_scores_gemma":[0.001092836,0.0001491018,0.0000382361,0.0001221831,0.00007323913,0.0000469437,0.00006526452,0.0001521912,4.329314e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005141079,"about_ca_system_score_gemma":0.00002890967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001041337,"about_ca_topic_score_gemma":0.00001549562,"domain_scores_codex":[0.9987484,0.00005314014,0.0003151523,0.0003126517,0.000312291,0.000258318],"domain_scores_gemma":[0.9986939,0.0007244788,0.0001618634,0.0001889523,0.00009038634,0.0001404197],"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.0002642777,0.00005773366,0.00002221639,0.0009608482,0.00006312816,0.000008384181,0.0004554636,0.00000218386,0.0001239196,0.9794272,0.0001094846,0.01850521],"study_design_scores_gemma":[0.004754765,0.0003419605,0.0003596427,0.0001433243,0.00008269786,0.00004513152,0.0001548585,0.005737071,0.001236682,0.9867515,0.0001811779,0.0002111945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1529195,0.001033247,0.8435024,0.000289202,0.0002859368,0.0007796125,0.0003235149,0.0000820819,0.0007845105],"genre_scores_gemma":[0.9789007,0.0001206721,0.020744,0.0001020049,0.00005755301,0.00001364761,0.000008064253,0.0000229145,0.00003045979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8259812,"threshold_uncertainty_score":0.6080194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089842370","doi":"10.1002/rsa.10114","title":"Counting the onion","year":2004,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Convex hull; Regular polygon; Bounded function; Combinatorics; Mathematics; Upper and lower bounds; Ball (mathematics); Hull; Convex body; Set (abstract data type); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.008246097426498877,"gpt":0.2308830487180563,"spread":0.2226369512915574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001825716,0.00007001864,0.00007453755,0.00003117707,0.0002909176,0.0001916378,0.000149634,0.00002320149,0.000003912755],"category_scores_gemma":[0.0000330127,0.00004247936,0.00002885758,0.0001577316,0.00002783969,0.0001562756,0.00005978714,0.00006908415,0.00000208783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009689758,"about_ca_system_score_gemma":0.0000368066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002181442,"about_ca_topic_score_gemma":0.00000257366,"domain_scores_codex":[0.9994543,0.00002303441,0.00009822642,0.00015875,0.0001585485,0.0001072049],"domain_scores_gemma":[0.9996948,0.0000700145,0.00003915788,0.0001191234,0.00003607012,0.00004089755],"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.00002282666,0.00001515422,0.00004321671,0.00001470878,0.00003136575,0.000008390907,0.00129139,0.04025428,0.001043923,0.5011774,0.0003703684,0.455727],"study_design_scores_gemma":[0.008753563,0.0001162865,0.01346345,0.00003086666,0.00002043458,0.000320461,0.0001027145,0.189315,0.005944678,0.7577422,0.0237758,0.0004146051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05055908,0.00107759,0.9440027,0.003474197,0.0004738593,0.0001238689,0.000001130508,0.00005062726,0.000236984],"genre_scores_gemma":[0.9625497,0.00007239896,0.03637044,0.0006562839,0.0002936265,0.00000476211,0.000003790911,0.000003055419,0.00004587408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9119907,"threshold_uncertainty_score":0.2237533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234267841","doi":"10.1002/rsa.20225","title":"Sharp thresholds for constraint satisfaction problems and homomorphisms","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Homomorphism; Constraint satisfaction; Mathematics; Satisfiability; Random graph; Constraint (computer-aided design); Hypergraph; Complexity of constraint satisfaction; Backtracking; Constraint graph; Discrete mathematics; Graph; Binary number; Combinatorics; Local consistency; Mathematical optimization; Statistics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.02129388212381518,"gpt":0.2314728767151354,"spread":0.2101789945913202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001286594,0.0001596852,0.0002201051,0.00008394592,0.0003965097,0.0001306315,0.00008597368,0.00008202828,0.00002829283],"category_scores_gemma":[0.00002590434,0.0001333368,0.00005029632,0.00009958062,0.0001900387,0.0003134794,0.00004708815,0.00009440674,6.163061e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001384867,"about_ca_system_score_gemma":0.0000335508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003767593,"about_ca_topic_score_gemma":0.00001587016,"domain_scores_codex":[0.9990672,0.00002663923,0.0002137187,0.0003527708,0.0001447599,0.0001948687],"domain_scores_gemma":[0.9994723,0.0001106017,0.00008774404,0.0001504871,0.00006779077,0.0001110649],"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.000084926,0.00001666099,0.008414672,0.00007350939,0.0000804626,0.0000156882,0.001579031,0.00102942,0.0008933591,0.08726814,0.0004492506,0.9000949],"study_design_scores_gemma":[0.02720817,0.0005248731,0.3047879,0.00007585963,0.0000720942,0.004914505,0.0001988078,0.5576561,0.001384266,0.09550214,0.006355497,0.00131977],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06678541,0.000487381,0.9308249,0.0005497221,0.0003698271,0.000620906,0.00003162236,0.0001263882,0.0002038016],"genre_scores_gemma":[0.9123018,0.0005570567,0.08679266,0.0001605667,0.00008377222,0.00003588161,0.00001053055,0.000008795943,0.00004888661],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8987751,"threshold_uncertainty_score":0.5437316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112209432","doi":"10.1002/rsa.20490","title":"Connectivity of inhomogeneous random graphs","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"struct; Random graph; Mathematics; Separable space; Combinatorics; Vertex (graph theory); Random regular graph; Metric space; Discrete mathematics; Graph; Space (punctuation); Chordal graph; Computer science; 1-planar graph; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01849317504041584,"gpt":0.2743402856101648,"spread":0.255847110569749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001853505,0.0001946807,0.0005699752,0.00005644849,0.00009908878,0.00004053816,0.0001143252,0.00009783366,0.0002630232],"category_scores_gemma":[0.0009514428,0.0001370683,0.00009420054,0.0001132086,0.00010866,0.00006199459,0.00005510207,0.0001264079,0.000002359861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006405161,"about_ca_system_score_gemma":0.00002038502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009247162,"about_ca_topic_score_gemma":0.000006465228,"domain_scores_codex":[0.9988933,0.00005305019,0.0003446908,0.0002408696,0.0002257879,0.0002422522],"domain_scores_gemma":[0.9979574,0.001448045,0.0001470137,0.0001834325,0.0001402225,0.0001238487],"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.0006337787,0.0001044708,0.00008086649,0.0005734315,0.000254146,0.00001809818,0.0005870513,0.00001367687,0.002721429,0.7989541,0.0009452451,0.1951137],"study_design_scores_gemma":[0.006791428,0.0001236189,0.000323289,0.0000282893,0.00007384425,0.00006235424,0.00008760425,0.009260267,0.001968057,0.9810553,0.00004432769,0.0001816598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3684028,0.0008242439,0.6290205,0.00008618698,0.0002909825,0.0007568261,0.00008512046,0.00006043228,0.0004728436],"genre_scores_gemma":[0.9658052,0.0000826653,0.03389499,0.00004527757,0.00006380033,0.00003839599,0.000003463972,0.00001961585,0.00004658442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5974024,"threshold_uncertainty_score":0.5589482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953254115","doi":"10.1002/rsa.20266","title":"On the girth of random Cayley graphs","year":2009,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Cayley graph; Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics; Odd graph; Random graph; Algebraic number; Chordal graph; Graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02982083239197912,"gpt":0.3040918875982944,"spread":0.2742710552063152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000904276,0.0001981726,0.0004450967,0.0001053647,0.0001773688,0.00004843763,0.0002637909,0.00008580511,0.0002138737],"category_scores_gemma":[0.0007054191,0.0001064002,0.0001518597,0.0001957407,0.0001944463,0.00004322121,0.00003649872,0.0002814083,0.000002431259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008132845,"about_ca_system_score_gemma":0.00001785883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001392889,"about_ca_topic_score_gemma":0.000003079918,"domain_scores_codex":[0.9985104,0.0002558137,0.0003066916,0.0002285422,0.0004137589,0.0002847521],"domain_scores_gemma":[0.9966956,0.002634588,0.0001175097,0.0004034361,0.00006935591,0.00007945187],"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.002342431,0.0000619632,0.00003175275,0.00005223715,0.00009818862,0.0000123649,0.0008349542,0.00001366676,0.001156479,0.9632664,0.001900679,0.03022891],"study_design_scores_gemma":[0.009054379,0.0002426528,0.0007256392,0.0000360417,0.00003185906,0.00001970292,0.0001256225,0.0006267047,0.002806114,0.9860039,0.0001915301,0.0001358028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.990686,0.0005824817,0.001967333,0.0008449796,0.0001469634,0.000886576,0.00004997451,0.00005909407,0.004776585],"genre_scores_gemma":[0.9977195,0.0001147888,0.001624071,0.000198684,0.00008165136,0.00001027225,0.000003562353,0.00001734378,0.0002301188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0300931,"threshold_uncertainty_score":0.4338873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233522140","doi":"10.1002/rsa.20202","title":"The height of increasing trees","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Constant (computer programming); Polynomial; Discrete mathematics; struct; Random tree; Mathematical analysis; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0284968742415702,"gpt":0.2856307604095207,"spread":0.2571338861679505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002047618,0.0001105327,0.0002579848,0.00001848625,0.0003190778,0.0000183639,0.0001043633,0.00004532855,0.00001702386],"category_scores_gemma":[0.0009736113,0.00005984413,0.00004815788,0.00006788932,0.0001519536,0.00002660449,0.00003908682,0.00008771278,3.377494e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004545869,"about_ca_system_score_gemma":0.00002122819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002564065,"about_ca_topic_score_gemma":0.000006979717,"domain_scores_codex":[0.9992397,0.00004241333,0.0002405038,0.0001237316,0.0001900645,0.0001635492],"domain_scores_gemma":[0.9976211,0.0020301,0.00009630425,0.0001342051,0.00005969774,0.00005854388],"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.0005814531,0.00002852346,0.00005779455,0.0001041938,0.000105437,0.0000240059,0.000750395,0.000003714237,0.0004606948,0.9022847,0.0005666916,0.09503245],"study_design_scores_gemma":[0.00230976,0.00008285721,0.0008277922,0.00002739468,0.00004597929,0.0002468697,0.0001347267,0.006307138,0.0009260462,0.988303,0.0006633793,0.0001250386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3343057,0.004640244,0.6583379,0.0002643053,0.0004379339,0.0004599209,0.00007665344,0.00006919395,0.001408166],"genre_scores_gemma":[0.9603158,0.0004930732,0.03896011,0.00002156087,0.0001106929,0.000006067261,0.000001356359,0.00001244474,0.00007889956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6260101,"threshold_uncertainty_score":0.2454121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4238105167","doi":"10.1002/rsa.20199","title":"Nash equilibria in random games","year":2007,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Nash equilibrium; Las vegas; Mathematics; Stochastic game; Best response; Combinatorics; Simple (philosophy); Epsilon-equilibrium; Polytope; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.03935174806480356,"gpt":0.362859618645556,"spread":0.3235078705807524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003886472,0.0001756384,0.0004412522,0.0002422344,0.000151268,0.0002046756,0.0004088367,0.0000998071,0.0003961732],"category_scores_gemma":[0.0007492288,0.0001161427,0.0001078598,0.0005656225,0.0002061664,0.0001817548,0.0001031724,0.000186195,0.00003078524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001139013,"about_ca_system_score_gemma":0.00002723456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003421666,"about_ca_topic_score_gemma":0.00005414333,"domain_scores_codex":[0.9978352,0.000155294,0.0006420108,0.0004661281,0.0005452947,0.0003560485],"domain_scores_gemma":[0.9968817,0.002351774,0.0001455677,0.0003937156,0.00007262986,0.0001545816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002579748,0.00006499233,0.005371454,0.00001050897,0.00003871015,0.00005002864,0.0021445,0.0001813705,0.009101199,0.0727631,0.001838584,0.9058558],"study_design_scores_gemma":[0.02050371,0.00005781334,0.07785823,0.00001882215,0.00001962914,0.00008223549,0.001394834,0.00293909,0.003413456,0.8515663,0.04174836,0.0003975692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.967072,0.0009232177,0.02492471,0.0004171831,0.0002996331,0.0003788264,0.00001978798,0.00004238155,0.005922269],"genre_scores_gemma":[0.9963397,0.00005010857,0.002266406,0.0001902576,0.0002226846,0.00001093448,0.000004146365,0.00001044874,0.000905337],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9054582,"threshold_uncertainty_score":0.4736162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1924956554","doi":"10.1002/rsa.20601","title":"Structure of random 312‐avoiding permutations","year":2015,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Random permutation; Permutation (music); Mathematics; Combinatorics; Diagonal; Random walk; Joint probability distribution; Random graph; struct; Discrete mathematics; Set (abstract data type); Graph; Expected value; Statistics; Computer science; Symmetric group; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02136013813657504,"gpt":0.2776378002865467,"spread":0.2562776621499717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004481086,0.0002122337,0.0004616573,0.0001200379,0.0001692156,0.0001282223,0.0003902431,0.0001126723,0.00001218185],"category_scores_gemma":[0.0001706364,0.0001544636,0.0001004974,0.0002580707,0.00009647933,0.000307383,0.00013575,0.000227516,5.121818e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001453241,"about_ca_system_score_gemma":0.0000842259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004315833,"about_ca_topic_score_gemma":0.000004605726,"domain_scores_codex":[0.9984725,0.0002548831,0.0003274122,0.0003735975,0.0003122018,0.0002594612],"domain_scores_gemma":[0.998876,0.0002510109,0.0001477722,0.0003548941,0.0001497922,0.0002205363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004299449,0.0000422074,0.0002556013,0.0001178901,0.0002160363,0.00003958107,0.0118437,0.0009899171,0.01627023,0.4484728,0.001643063,0.519679],"study_design_scores_gemma":[0.01907189,0.0001555551,0.0007308708,0.00004016207,0.00006971765,0.0002544679,0.0002230201,0.09993662,0.01634493,0.8611994,0.00146581,0.0005075059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03101713,0.001710411,0.9657359,0.0002470246,0.0005258769,0.0002336908,0.00002764569,0.00006044492,0.0004419525],"genre_scores_gemma":[0.6506934,0.00004838295,0.3489536,0.00009431796,0.0001384631,0.000002910386,0.000004862474,0.000009518468,0.00005452192],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6196762,"threshold_uncertainty_score":0.6298844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4301417336","doi":"10.1002/rsa.20118","title":"The satisfiability threshold for randomly generated binary constraint satisfaction problems","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Satisfiability; Homomorphism; Constraint (computer-aided design); Constraint satisfaction; Discrete mathematics; Binary number; Mathematics; Random graph; Computer science; Combinatorics; Statistics; Arithmetic; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01327690187490386,"gpt":0.2629478193031268,"spread":0.2496709174282229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009516609,0.0002102236,0.0002817891,0.00006470439,0.000898991,0.0003622078,0.0003411494,0.00008221009,0.000006122293],"category_scores_gemma":[0.00007869647,0.0001284465,0.0001123088,0.0002451738,0.000403104,0.0002590918,0.0001091555,0.0001932718,6.649336e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003368188,"about_ca_system_score_gemma":0.00005338957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001054607,"about_ca_topic_score_gemma":0.0000823019,"domain_scores_codex":[0.9982794,0.0001577318,0.0003473091,0.0004815494,0.0002916781,0.0004423577],"domain_scores_gemma":[0.9983746,0.0008512523,0.0001130329,0.0004255629,0.000151418,0.00008414701],"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.001187981,0.0000345847,0.002573295,0.00008465855,0.0001092234,0.000009645231,0.0002045795,0.00765024,0.0137219,0.5102849,0.001147512,0.4629915],"study_design_scores_gemma":[0.0133082,0.0001618694,0.01699973,0.0000126723,0.00001444283,0.00005655114,0.00003418772,0.1568402,0.002573969,0.8073593,0.002335409,0.0003034142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1774873,0.002892119,0.8151143,0.001152677,0.0005821647,0.002316823,0.00005219792,0.0001888714,0.0002135691],"genre_scores_gemma":[0.9734324,0.0001756814,0.02578229,0.00004963552,0.0002038558,0.0001997091,0.00001318366,0.00001599491,0.0001272617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7959451,"threshold_uncertainty_score":0.6914403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953220200","doi":"10.1002/rsa.20146","title":"Rainbow Hamilton cycles in random regular graphs","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Rainbow; Colored; Combinatorics; Mathematics; struct; Random graph; Random regular graph; Graph; Discrete mathematics; Graph factorization; Line graph; Computer science; 1-planar graph; Graph power; Physics; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.01184048127199453,"gpt":0.2582866701298389,"spread":0.2464461888578444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006322137,0.0004032131,0.0007652384,0.0002776463,0.000360668,0.0000985167,0.0002532777,0.0002350128,0.00007203864],"category_scores_gemma":[0.0001139382,0.0002914288,0.0002318807,0.0002712859,0.0003050803,0.000129251,0.00008571237,0.0003227477,6.302988e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002243749,"about_ca_system_score_gemma":0.00001865245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001633428,"about_ca_topic_score_gemma":0.00007664975,"domain_scores_codex":[0.9978116,0.0002251393,0.0006058509,0.0004930999,0.0003598701,0.0005044055],"domain_scores_gemma":[0.9985927,0.0006663416,0.0001779264,0.000416269,0.00004856482,0.00009820748],"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.001742257,0.00009797331,0.003376915,0.000252625,0.000165871,0.00014788,0.003279169,0.000160416,0.001095576,0.9650557,0.002437406,0.02218823],"study_design_scores_gemma":[0.01612432,0.00003853175,0.008950134,0.00005100258,0.00005742554,0.00007584857,0.000229633,0.0005187449,0.001221886,0.9704842,0.001846427,0.0004018399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9923002,0.002684359,0.001246128,0.00009390686,0.0005109966,0.0006313065,0.00003829227,0.0001222875,0.00237255],"genre_scores_gemma":[0.9881813,0.0003195141,0.01059929,0.0001055836,0.0003487068,0.00003024306,0.00002003459,0.00005205103,0.0003433027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02178639,"threshold_uncertainty_score":0.9999538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083145360","doi":"10.1002/rsa.20189","title":"Distribution of subgraphs of random regular graphs","year":2007,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Random graph; Asymptotic distribution; struct; Infinity; Bounded function; Discrete mathematics; Distribution (mathematics); Random regular graph; Graph; Line graph; Pathwidth; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01298255443741504,"gpt":0.2710556701729983,"spread":0.2580731157355833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196589,0.0002563411,0.0007525907,0.0001607552,0.0001830662,0.00001317868,0.0002034196,0.0001875703,0.00003907536],"category_scores_gemma":[0.0002884985,0.0001818265,0.0003087727,0.0003050948,0.0004900161,0.0000732009,0.00008027378,0.0001778979,6.488953e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008877631,"about_ca_system_score_gemma":0.00001409319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003553845,"about_ca_topic_score_gemma":0.000006886788,"domain_scores_codex":[0.9981755,0.0001036135,0.0007415309,0.0002728238,0.0003887571,0.0003177682],"domain_scores_gemma":[0.9980939,0.0008463428,0.0004066702,0.0003798401,0.0001638048,0.0001094617],"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.002626677,0.00005969915,0.002481504,0.0004046086,0.0003292412,0.00001186057,0.001083611,0.000007666301,0.003831937,0.9576573,0.0003405895,0.0311653],"study_design_scores_gemma":[0.009918774,0.0001151875,0.01394453,0.0000582929,0.0001609164,0.00004123977,0.0002439441,0.00007591221,0.03233335,0.9425106,0.0003693834,0.0002278686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9696732,0.001592696,0.02730455,0.00001723172,0.0003764204,0.0004026054,0.0001406093,0.00003795322,0.0004547681],"genre_scores_gemma":[0.9935743,0.0002600064,0.005974244,0.00001419254,0.00008850369,0.000003388709,0.00003090882,0.00002164665,0.00003275921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03093744,"threshold_uncertainty_score":0.7414668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083295155","doi":"10.1002/rsa.20194","title":"Simple permutations mix even better","year":2007,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Permutation (music); Simple (philosophy); Mathematics; Notation; Random permutation; Derangement; Parity of a permutation; Simple random sample; Discrete mathematics; Symmetric group; Cyclic permutation; Arithmetic; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01974014423185885,"gpt":0.3187092448637326,"spread":0.2989691006318738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003215561,0.0001958165,0.0003356737,0.00007039566,0.0001945792,0.00004736075,0.0001238207,0.00009558161,0.0000841628],"category_scores_gemma":[0.0003571086,0.000154971,0.00008063846,0.0001212386,0.00007238806,0.000100513,0.00005722237,0.0001674891,0.000004094849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002528142,"about_ca_system_score_gemma":0.00001331148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006773343,"about_ca_topic_score_gemma":0.000007621528,"domain_scores_codex":[0.9988333,0.00003129147,0.0003550011,0.0002183993,0.0002498098,0.0003121827],"domain_scores_gemma":[0.9985142,0.0009260426,0.0001279178,0.0002450582,0.00007100171,0.0001158045],"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.0002994541,0.0001524912,0.0006641097,0.0003973562,0.0002745032,0.0001014032,0.004315022,0.00003695026,0.002448656,0.899069,0.003809849,0.08843122],"study_design_scores_gemma":[0.003164606,0.00003617245,0.0008117001,0.00001353267,0.0000513657,0.00004314619,0.0002270272,0.0004719103,0.001472394,0.9909068,0.002593966,0.0002074178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6026475,0.0002563051,0.3939533,0.0001921946,0.0006500898,0.0005962591,0.00002928553,0.0001796985,0.00149537],"genre_scores_gemma":[0.8926153,0.00001717772,0.1063838,0.0001418895,0.0005422111,0.00001313373,0.00001162186,0.00004768869,0.0002271735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2899678,"threshold_uncertainty_score":0.6319533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117032256","doi":"10.1002/rsa.10020","title":"Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs","year":2001,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Glauber; Mathematics; Combinatorics; Degree (music); Mixing (physics); Constant (computer programming); Graph; Bounded function; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.05117845564963833,"gpt":0.3076444219577712,"spread":0.2564659663081328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005689278,0.0002234415,0.000443296,0.00006220293,0.0002336319,0.00004781161,0.0001885446,0.0001187486,0.00001312677],"category_scores_gemma":[0.0003120253,0.0001273638,0.0002483181,0.0001343798,0.0001435105,0.00004982036,0.00006991361,0.0001656398,1.040339e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003067555,"about_ca_system_score_gemma":0.00002687607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003232546,"about_ca_topic_score_gemma":0.00005267048,"domain_scores_codex":[0.9988031,0.0001054348,0.0003218844,0.000263838,0.0002317214,0.0002740321],"domain_scores_gemma":[0.9986822,0.0006531857,0.0001797268,0.0003261056,0.00009449555,0.00006428432],"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.004099087,0.0001957385,0.002147453,0.001026306,0.0005957334,0.00001610763,0.00165395,0.00004047418,0.00202746,0.5000281,0.002695116,0.4854745],"study_design_scores_gemma":[0.0427255,0.001339202,0.004480093,0.0006814577,0.0007894751,0.0002719347,0.001611285,0.03576864,0.01224843,0.8386462,0.05982487,0.001612912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.975598,0.0005910933,0.01593807,0.0004148236,0.0009063543,0.001584422,0.00008829036,0.00004766192,0.004831294],"genre_scores_gemma":[0.9150382,0.0004683856,0.08066928,0.0003636161,0.0003934995,0.0001486496,0.00001389838,0.0000987586,0.002805771],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4838616,"threshold_uncertainty_score":0.5193744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245097098","doi":"10.1002/rsa.20145","title":"Concentration for self‐bounding functions and an inequality of Talagrand","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Bounding overwatch; Mathematics; Concentration inequality; Inequality; struct; Random variable; Applied mathematics; Statistical physics; Pure mathematics; Physics; Statistics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03468485286401728,"gpt":0.3432106182288202,"spread":0.3085257653648029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005373603,0.0001198474,0.0002987293,0.0000291833,0.0001592546,0.00004878535,0.0000328171,0.00007285553,0.000004305622],"category_scores_gemma":[0.00009637428,0.00009212812,0.00005319771,0.00004918169,0.00006179454,0.00009201526,0.00001412954,0.00005119815,1.306463e-9],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008485075,"about_ca_system_score_gemma":0.00001284393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007903765,"about_ca_topic_score_gemma":0.0000495707,"domain_scores_codex":[0.9992113,0.00009433865,0.0002750531,0.0001854261,0.00009735418,0.0001365209],"domain_scores_gemma":[0.9991954,0.000433707,0.0001299471,0.0001141907,0.00007315487,0.00005357744],"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.002352837,0.0004359071,0.01215855,0.002928967,0.0004479321,0.000006299947,0.006041143,0.00008378988,0.04818457,0.7165799,0.002144831,0.2086353],"study_design_scores_gemma":[0.05678205,0.001091572,0.008739139,0.0001507274,0.0009950771,0.0001030221,0.00298171,0.06967363,0.02161661,0.8236488,0.01291947,0.001298186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8436478,0.0003962771,0.154807,0.00003464507,0.0001789216,0.0004619136,0.00009125152,0.0000350894,0.0003470814],"genre_scores_gemma":[0.9065285,0.00004140459,0.09295009,0.00001320286,0.0003023868,0.00002012045,0.00003376756,0.00001251636,0.00009801605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2073371,"threshold_uncertainty_score":0.3756876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163453622","doi":"10.1002/rsa.10058","title":"On characterizing hypergraph regularity","year":2002,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Lemma (botany); Verifiable secret sharing; Mathematics; Bipartite graph; Discrete mathematics; Combinatorics; Graph; Randomness; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02915583934880907,"gpt":0.2610700706186652,"spread":0.2319142312698561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002758988,0.0002866463,0.0004376887,0.0001179532,0.00052723,0.00008109763,0.0001839881,0.000153095,0.0004285537],"category_scores_gemma":[0.0002271215,0.0002004998,0.0001597343,0.0001247047,0.0001638314,0.00009176335,0.00008301184,0.0002942935,0.000002704022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001294035,"about_ca_system_score_gemma":0.00000319921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001677678,"about_ca_topic_score_gemma":0.000002824654,"domain_scores_codex":[0.998552,0.0001059952,0.0002904967,0.0003735723,0.0002805138,0.0003974827],"domain_scores_gemma":[0.99884,0.0004622117,0.0001182291,0.0003878298,0.0000347225,0.0001570326],"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.0001846571,0.00004758693,0.0003209545,0.00008604346,0.0001309058,0.00003222499,0.001034539,0.000001843725,0.0005861997,0.9391757,0.002162949,0.05623639],"study_design_scores_gemma":[0.003410773,0.0001035827,0.002988483,0.00003780416,0.00005477984,0.0001054574,0.00003748443,0.001247917,0.0008807263,0.9858214,0.004957921,0.0003537341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9924388,0.0008470598,0.0005517511,0.0003209671,0.0007404829,0.0003261188,0.00003777337,0.0001525728,0.004584471],"genre_scores_gemma":[0.9937751,0.0002784702,0.004641911,0.0004717494,0.000343491,0.00001095275,0.000004149138,0.00003536597,0.0004387973],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05588265,"threshold_uncertainty_score":0.8176146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083377090","doi":"10.1002/rsa.20241","title":"Critical random graphs and the structure of a minimum spanning tree","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"struct; Random graph; Combinatorics; Spanning tree; Mathematics; Independent and identically distributed random variables; Mathematical proof; Minimum spanning tree; Random tree; Frieze; Discrete mathematics; Tree (set theory); Enhanced Data Rates for GSM Evolution; Graph; Random variable; Computer science; Geometry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01724193344650764,"gpt":0.2743522206754656,"spread":0.2571102872289579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004205365,0.0003765346,0.0009889744,0.0001299402,0.0008149988,0.00005266718,0.0002594434,0.0002015273,0.00007136128],"category_scores_gemma":[0.001034258,0.0002030123,0.000248988,0.0001799084,0.002358069,0.0001204789,0.0001812502,0.0003900826,8.830349e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005129562,"about_ca_system_score_gemma":0.00002402814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003095377,"about_ca_topic_score_gemma":0.000007461641,"domain_scores_codex":[0.9979228,0.0003102764,0.0005816953,0.0003968885,0.0004065996,0.0003816985],"domain_scores_gemma":[0.9958843,0.003249221,0.0001981079,0.0004044005,0.0001203131,0.0001436799],"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.004715184,0.00002589529,0.0009300418,0.0003007895,0.0003798846,0.00004776266,0.008281936,0.000007147319,0.001287919,0.9724633,0.0006681037,0.010892],"study_design_scores_gemma":[0.02562736,0.00007893408,0.002679778,0.00004848414,0.0002301485,0.0007410801,0.0003827358,0.0009016298,0.001429774,0.9674034,0.0001823416,0.0002943809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917499,0.004603168,0.001627537,0.000244921,0.0004753664,0.0005703148,0.00007833276,0.0000591145,0.0005913793],"genre_scores_gemma":[0.9897527,0.0006065512,0.009190863,0.0001501825,0.0001843982,0.000006453365,0.000003865983,0.0000348499,0.00007016346],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02091218,"threshold_uncertainty_score":0.8688403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167858467","doi":"10.1002/rsa.10075","title":"Integer and fractional packings in dense 3‐uniform hypergraphs","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Hypergraph; Mathematics; Lemma (botany); Combinatorics; Disjoint sets; Integer (computer science); Function (biology); Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01543279521278826,"gpt":0.2691404905379923,"spread":0.253707695325204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004045618,0.0002398982,0.0003785819,0.0001703207,0.0002511959,0.00006480385,0.00007987475,0.000151301,0.0001322036],"category_scores_gemma":[0.0003128923,0.0001709249,0.00007790333,0.0001449689,0.0001940926,0.0001277816,0.00005028585,0.000312073,3.518422e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001473739,"about_ca_system_score_gemma":0.00001636508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002566225,"about_ca_topic_score_gemma":0.00002055201,"domain_scores_codex":[0.9988081,0.0001025335,0.000300617,0.0003068836,0.0002005427,0.0002813613],"domain_scores_gemma":[0.9990559,0.0005245196,0.00009283161,0.0001796803,0.00004103887,0.0001060413],"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.000219071,0.00002617605,0.005433274,0.00007683368,0.00008406666,0.00003291344,0.001312978,0.000007429299,0.0001511309,0.9798912,0.000231135,0.01253381],"study_design_scores_gemma":[0.004130537,0.00003936157,0.006621542,0.00002882155,0.00003305145,0.0003092263,0.0003725413,0.0002715536,0.0003881206,0.9837642,0.003780072,0.0002609928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.992441,0.001333616,0.002269761,0.00006271986,0.0004151982,0.0002803571,0.00001673574,0.00004205061,0.003138583],"genre_scores_gemma":[0.9886584,0.000378367,0.0105203,0.0001715912,0.00008622906,0.00001097094,0.000002820252,0.00002429609,0.000146988],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01227282,"threshold_uncertainty_score":0.6970114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4236302493","doi":"10.1002/rsa.20252","title":"A sharp threshold for the Hamilton cycle Maker–Breaker game","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; struct; Mathematics; Hamiltonian path; Graph; Random graph; Discrete mathematics; Adversary; Mathematical economics; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03757259098329083,"gpt":0.2890871328542056,"spread":0.2515145418709147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003386207,0.0003269349,0.0004777623,0.00006110792,0.0009976582,0.00006898003,0.0003167084,0.0001602421,0.00010745],"category_scores_gemma":[0.0001339379,0.0001795096,0.0002701949,0.0001136891,0.000380775,0.00009121276,0.0001021621,0.0002446458,9.817727e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001509916,"about_ca_system_score_gemma":0.0000198807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002015777,"about_ca_topic_score_gemma":0.000007833598,"domain_scores_codex":[0.9984661,0.00004931989,0.0003629385,0.0003882991,0.0002994587,0.0004338224],"domain_scores_gemma":[0.9980347,0.001139694,0.0001384918,0.0004998427,0.00007689284,0.0001104137],"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.002323059,0.00009971875,0.0009035294,0.0003573516,0.001012955,0.00008380657,0.01440467,0.0002186667,0.0004694429,0.9010401,0.01946362,0.05962305],"study_design_scores_gemma":[0.00792464,0.0001015025,0.004059906,0.0000261263,0.0001693121,0.0004670467,0.0002131599,0.007032504,0.0005543152,0.9574085,0.02161892,0.0004240689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9619558,0.00626195,0.02432709,0.0006295262,0.001668901,0.00232559,0.0002572405,0.0002456622,0.002328282],"genre_scores_gemma":[0.9886923,0.0007833694,0.008209545,0.0005404181,0.0007926855,0.0001033257,0.00001057255,0.00006082375,0.0008069766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05919898,"threshold_uncertainty_score":0.7673281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973441387","doi":"10.1002/rsa.20319","title":"Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees","year":2010,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Excursion; Combinatorics; Watson; Mathematical proof; Conjecture; Tree (set theory); Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01927496215481326,"gpt":0.3021133184798598,"spread":0.2828383563250466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001882983,0.0001470151,0.0004271673,0.00004862008,0.0000708678,0.00003468627,0.00007856877,0.0001011858,0.00007456367],"category_scores_gemma":[0.0007376649,0.0001057382,0.00003029384,0.00008361197,0.0001780803,0.00007372646,0.00003646333,0.000193547,2.958231e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004458007,"about_ca_system_score_gemma":0.00001912195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000307315,"about_ca_topic_score_gemma":0.0000890147,"domain_scores_codex":[0.9990327,0.00003038388,0.0003273399,0.0002198688,0.0001910162,0.0001986402],"domain_scores_gemma":[0.9985098,0.001172341,0.00006437203,0.0001074136,0.00004397679,0.0001021235],"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.0008917245,0.0001371053,0.005656656,0.001176352,0.0001496625,0.00002655253,0.00172213,0.000001997477,0.008200673,0.8698646,0.0001698673,0.1120027],"study_design_scores_gemma":[0.005293376,0.0002124073,0.02564914,0.00008468549,0.0001139656,0.0000139843,0.0003136806,0.008154742,0.004522094,0.9553018,0.00009429215,0.0002457996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9389423,0.0003090557,0.0598676,0.0001158876,0.0001412296,0.0003085198,0.0001552559,0.00002477051,0.0001354258],"genre_scores_gemma":[0.9793472,0.00003656342,0.02047192,0.00001092588,0.00008352882,0.00001667144,0.00001095004,0.00001135303,0.00001086712],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1117569,"threshold_uncertainty_score":0.4311878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006001667","doi":"10.1002/rsa.20438","title":"Tail bounds for the height and width of a random tree with a given degree sequence","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Exponent; Mathematics; Tree (set theory); Sequence (biology); Degree (music); Order (exchange); Plane (geometry); Physics; Geometry; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.05776540759295678,"gpt":0.3094869393522772,"spread":0.2517215317593204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003451956,0.0001971325,0.0004498912,0.00002784418,0.0002052297,0.0000477078,0.0001166297,0.00006876667,0.00001797264],"category_scores_gemma":[0.0004949846,0.00009884526,0.00005074,0.00008085398,0.000203544,0.00008200764,0.00004245293,0.0001055657,1.21651e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007857025,"about_ca_system_score_gemma":0.00002913666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001798068,"about_ca_topic_score_gemma":0.00001929057,"domain_scores_codex":[0.9990278,0.00003011939,0.0002493832,0.0001827145,0.0002076965,0.0003022405],"domain_scores_gemma":[0.997021,0.002457207,0.0001462339,0.0001711647,0.00008933536,0.0001150818],"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.005856101,0.00008984559,0.0002061241,0.001121835,0.0005733595,0.000007001426,0.003268611,0.000006810944,0.000460395,0.5726728,0.0005719254,0.4151652],"study_design_scores_gemma":[0.02669634,0.0006019379,0.0006289821,0.0001411359,0.0007217238,0.0002582993,0.0006023251,0.02447428,0.0008907227,0.9430445,0.001534148,0.000405536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01499136,0.003642663,0.9798799,0.0002332684,0.0001330209,0.0008142577,0.000166125,0.00002223145,0.0001172114],"genre_scores_gemma":[0.8648652,0.0001947074,0.1344837,0.00006151495,0.0001964942,0.00009218726,0.000004791341,0.00002636559,0.00007504573],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8498738,"threshold_uncertainty_score":0.4030793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083134037","doi":"10.1002/rsa.20391","title":"Depth Properties of scaled attachment random recursive trees","year":2011,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Random walk; Binary logarithm; Tree (set theory); Random variable; Random graph; Sequence (biology); Preferential attachment; Random binary tree; Random tree; Discrete mathematics; Binary tree; Statistics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.0614846637957399,"gpt":0.2928030503401969,"spread":0.231318386544457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002068914,0.0002217613,0.0005946935,0.00005449147,0.0001020158,0.00002112131,0.0001459542,0.00009105264,0.0001112307],"category_scores_gemma":[0.000462272,0.0001416932,0.00009525825,0.00007287904,0.0001427452,0.00005606593,0.00006122857,0.0001189601,0.00000137426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001052369,"about_ca_system_score_gemma":0.00002724332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004358145,"about_ca_topic_score_gemma":0.00001754869,"domain_scores_codex":[0.9987596,0.00005587742,0.0004145453,0.0002580735,0.0002582246,0.0002536258],"domain_scores_gemma":[0.9991081,0.0002927857,0.0001761053,0.000186626,0.0001214934,0.0001149008],"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.009745105,0.0003826806,0.0001659036,0.001512639,0.0007587976,0.00005282223,0.01089359,0.00000674904,0.003641941,0.7886558,0.0006304141,0.1835536],"study_design_scores_gemma":[0.01497707,0.0003992236,0.0004889888,0.0002069903,0.0002866934,0.0000558655,0.0007105815,0.003287759,0.02557924,0.9535701,0.00008214903,0.0003553113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1467887,0.003374295,0.8454707,0.00007127628,0.0005226818,0.001258215,0.0001018607,0.0001006247,0.002311665],"genre_scores_gemma":[0.9375351,0.0001400521,0.06206122,0.00002946877,0.00008156038,0.00003599757,0.000002709425,0.00002244071,0.00009145281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7907464,"threshold_uncertainty_score":0.5778082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951684049","doi":"10.1002/rsa.20598","title":"Improved bounds for the randomized decision tree Complexity of recursive majority","year":2015,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Decision tree; Computer science; Tree (set theory); Recursive partitioning; Theoretical computer science; Mathematics; Machine learning; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04138630458639728,"gpt":0.2870490232514411,"spread":0.2456627186650438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001934254,0.0002836451,0.0009045404,0.0001093602,0.0004004014,0.0002328989,0.0009795751,0.0001093999,0.000007348871],"category_scores_gemma":[0.0007229195,0.0001687358,0.000383226,0.0003210319,0.001016727,0.0002605489,0.0003441279,0.0002089181,3.862754e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002460853,"about_ca_system_score_gemma":0.00009697856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000266162,"about_ca_topic_score_gemma":0.00006059196,"domain_scores_codex":[0.99794,0.0002228142,0.0005693843,0.0004854901,0.0004222158,0.0003600894],"domain_scores_gemma":[0.9957585,0.002735603,0.0003061967,0.000649792,0.0003610741,0.0001887938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.02472418,0.00007127596,0.00001793217,0.00004942018,0.000302609,0.000003535002,0.001933232,0.00009823069,0.00008416204,0.4273868,0.00128215,0.5440465],"study_design_scores_gemma":[0.1126192,0.000142444,0.0001931211,0.0000167954,0.00006140623,0.00002792462,0.0001092055,0.2755961,0.0004389564,0.6093004,0.001307437,0.0001871232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00511101,0.003015101,0.9876695,0.0009894739,0.00149444,0.001401631,0.00006369272,0.00006879949,0.0001863775],"genre_scores_gemma":[0.3754938,0.0003823941,0.6230624,0.0002798603,0.0005022366,0.0001517627,0.00001860543,0.00002383314,0.00008520904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5438594,"threshold_uncertainty_score":0.6880844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091712762","doi":"10.1002/rsa.20504","title":"Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Edge cover; Vertex (graph theory); Degree (music); Discrete mathematics; Random walk; Random regular graph; Regular graph; Upper and lower bounds; Graph; Graph power; Line graph; 1-planar graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03572688288415451,"gpt":0.2431883776456975,"spread":0.207461494761543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003857959,0.0002804069,0.0004663724,0.0002501155,0.0001928372,0.0003617324,0.0005038946,0.0001239274,0.0002876191],"category_scores_gemma":[0.0001032441,0.0002148275,0.00006954389,0.0005673682,0.00006006498,0.0009748501,0.0002315994,0.0003072775,0.0000452247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003102523,"about_ca_system_score_gemma":0.00005416912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003011285,"about_ca_topic_score_gemma":0.00002251031,"domain_scores_codex":[0.9979016,0.000210408,0.0004146656,0.0005751289,0.0003881309,0.0005101329],"domain_scores_gemma":[0.9988411,0.0002479552,0.000092487,0.0004138725,0.0001774829,0.0002271193],"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.0008077577,0.0002154973,0.00195357,0.0002184582,0.0003285065,0.00005362582,0.0102988,0.05610099,0.002842448,0.003862611,0.002631045,0.9206867],"study_design_scores_gemma":[0.03536956,0.0001809604,0.01965747,0.00009641872,0.00001465715,0.00002580943,0.0001742528,0.9323967,0.0008239612,0.009399432,0.001121678,0.0007391619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3544288,0.00104811,0.6357175,0.002672567,0.00122582,0.002916172,0.00001634014,0.0005197931,0.001454923],"genre_scores_gemma":[0.9202722,0.0006971826,0.07720362,0.0003273377,0.0002649924,0.0002363661,0.00003923958,0.00004093044,0.0009181167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9199475,"threshold_uncertainty_score":0.8760411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066574146","doi":"10.1002/rsa.10006","title":"Analysis of random LC tries","year":2001,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Trie; Node (physics); Combinatorics; Binary logarithm; Mathematics; Discrete mathematics; Computer science; Physics; Data structure; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.0103054025169978,"gpt":0.2496198197540519,"spread":0.2393144172370541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029674,0.0001986314,0.0006643315,0.0003166815,0.000180893,0.0001493381,0.0005120881,0.00008017747,0.00007488424],"category_scores_gemma":[0.00004702015,0.0001383283,0.000208956,0.0009754254,0.0001063945,0.0003773645,0.0002459968,0.0001113238,0.000001045084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007807139,"about_ca_system_score_gemma":0.00002449423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001477555,"about_ca_topic_score_gemma":0.00001022256,"domain_scores_codex":[0.9985166,0.0000881103,0.000377037,0.0004206823,0.0003407217,0.0002568266],"domain_scores_gemma":[0.9988292,0.0002624954,0.000172799,0.0005289915,0.00008433971,0.0001222091],"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.0009141889,0.00009096939,0.005405216,0.00003984767,0.001719702,0.00008143545,0.001357163,0.002241072,0.0007399219,0.01761655,0.0008801579,0.9689138],"study_design_scores_gemma":[0.01932111,0.0001691035,0.04772305,0.0000330867,0.0007597632,0.00008578351,0.0001140404,0.8944643,0.001271841,0.01499699,0.02044939,0.0006115712],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06695808,0.002560033,0.9291592,0.0001966332,0.0003337845,0.0002011821,0.0000496035,0.0000857926,0.0004557094],"genre_scores_gemma":[0.9498578,0.001466932,0.0480585,0.000152432,0.0001718875,0.00001167373,0.00005017603,0.00001196796,0.0002186793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9683022,"threshold_uncertainty_score":0.5640865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562525740","doi":"10.1002/rsa.10099","title":"One line and n points","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Line (geometry); Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01310099690627803,"gpt":0.2389185159777146,"spread":0.2258175190714365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001726813,0.00008069579,0.0001235817,0.00005621005,0.0001295,0.0001224373,0.00006337769,0.00003281922,0.00001265948],"category_scores_gemma":[0.00004745211,0.00006982868,0.00001947553,0.0001308945,0.00002612957,0.0001491913,0.0000384929,0.0000581967,0.000001194688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003803416,"about_ca_system_score_gemma":0.00001633137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005213245,"about_ca_topic_score_gemma":0.000001514239,"domain_scores_codex":[0.9993814,0.00004983738,0.0001122214,0.0002190505,0.0001254172,0.0001121281],"domain_scores_gemma":[0.9996716,0.00008194869,0.0000332859,0.0001025663,0.0000358266,0.00007472887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002708733,0.00002566873,0.00008732203,0.0000216829,0.00003799608,0.000006283346,0.0003359102,0.0005276526,0.0008406722,0.3583821,0.0001582502,0.6395494],"study_design_scores_gemma":[0.01143261,0.0002584946,0.020364,0.00002429941,0.00003060946,0.0002878335,0.00003252998,0.1513494,0.01543174,0.7830842,0.0171356,0.0005686651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07673593,0.002064463,0.9194102,0.0007838912,0.0003251284,0.0001437228,0.000003253242,0.00004697844,0.0004863779],"genre_scores_gemma":[0.8437169,0.000183704,0.1555192,0.0003248173,0.00011337,0.000003566652,0.00000419937,0.000003882105,0.0001303284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.766981,"threshold_uncertainty_score":0.2847531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2255223375","doi":"10.1002/rsa.20753","title":"High degrees in random recursive trees","year":2017,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Vertex (graph theory); Random tree; Poisson distribution; Coalescent theory; Asymptotic distribution; Rate of convergence; Discrete mathematics; Distribution (mathematics); Graph; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03208426629164039,"gpt":0.3169047373869078,"spread":0.2848204710952674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002754211,0.0002315498,0.0005992267,0.00006112702,0.0003617781,0.0001942472,0.0002878636,0.0001214244,0.0001244954],"category_scores_gemma":[0.002063028,0.0001666537,0.00006880181,0.00003554763,0.0001362017,0.000115819,0.0001031678,0.0002025528,0.000002605462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000158346,"about_ca_system_score_gemma":0.00003050414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001807704,"about_ca_topic_score_gemma":0.0002006907,"domain_scores_codex":[0.998762,0.00004337196,0.0003260671,0.0003240978,0.0002273701,0.000317101],"domain_scores_gemma":[0.9983146,0.0009411373,0.0002044279,0.0003617111,0.00006059461,0.0001175305],"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.001275871,0.00004728753,0.0001006522,0.0001499048,0.00008144778,0.0001066149,0.0005144135,0.00002075095,0.00007687007,0.8412623,0.0004337508,0.1559301],"study_design_scores_gemma":[0.01531858,0.00009470712,0.002532673,0.00009207546,0.00006147081,0.0000341447,0.000117416,0.004364436,0.0002371791,0.9766966,0.000200068,0.0002506962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1778281,0.002177241,0.8119785,0.001253856,0.001905562,0.001523573,0.0003284301,0.0001347947,0.002869978],"genre_scores_gemma":[0.9190583,0.0002750534,0.08004349,0.00004729608,0.0002866826,0.00003651011,0.000006568303,0.00002872095,0.0002174001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7412302,"threshold_uncertainty_score":0.6795942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118804107","doi":"10.1002/rsa.20095","title":"The Boolean functions computed by random Boolean formulas or how to grow the right function","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","funders":"","keywords":"Boolean function; Probabilistic logic; Monotone polygon; Function (biology); Mathematics; Discrete mathematics; Convergence (economics); Combinatorics; Computer science; Theoretical computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.005735867594603812,"gpt":0.2102264228436515,"spread":0.2044905552490477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006486037,0.0003147116,0.0003266523,0.00006644808,0.001700668,0.001063443,0.0008283405,0.00009041149,0.00004200741],"category_scores_gemma":[0.00006372493,0.0001421723,0.0001508562,0.000356632,0.0001436231,0.0004595741,0.000244015,0.0002715888,0.00001340616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003202417,"about_ca_system_score_gemma":0.00003322602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002649121,"about_ca_topic_score_gemma":0.00006509832,"domain_scores_codex":[0.9981338,0.0001821221,0.0003031794,0.0004985362,0.0003861628,0.0004961615],"domain_scores_gemma":[0.99817,0.0007650291,0.0001353511,0.0006633154,0.00007514811,0.0001911514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001009606,0.00003322105,0.0000124932,0.00001018535,0.0001731694,0.000006306724,0.0006313059,0.0004731664,0.0005782655,0.02394676,0.114924,0.8582016],"study_design_scores_gemma":[0.01144587,0.000276114,0.001095981,0.00002473073,0.00007359208,0.0001526109,0.0002606406,0.1873209,0.00107813,0.01289288,0.784905,0.0004735217],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009840072,0.002551625,0.9686977,0.01591392,0.00142982,0.0008617694,0.00004741236,0.0002820763,0.000375613],"genre_scores_gemma":[0.9787627,0.0002481798,0.009639323,0.00428581,0.001757668,0.0001077793,0.00004129086,0.00004553047,0.00511173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9689226,"threshold_uncertainty_score":0.9999735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1702956999","doi":"10.1002/rsa.20649","title":"Finding Adam in random growing trees","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Ministerio de Ciencia y Tecnología","keywords":"Preferential attachment; Combinatorics; Vertex (graph theory); Mathematics; Tree (set theory); Exponential growth; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Graph; Complex network","retraction":null,"screen_n_in":null,"score":{"opus":0.03529323304074504,"gpt":0.3187274823374269,"spread":0.2834342492966818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005366833,0.0005207243,0.00124184,0.000190804,0.0001392058,0.0001519727,0.0003135337,0.0004264587,0.0001094476],"category_scores_gemma":[0.001610028,0.0003531852,0.0001855631,0.00009888731,0.00008358999,0.00009088447,0.0004510339,0.0006558218,0.000001937466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005764813,"about_ca_system_score_gemma":0.0001004028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004176967,"about_ca_topic_score_gemma":0.00002948511,"domain_scores_codex":[0.9975601,0.0001082131,0.0007125892,0.0006958148,0.0004000694,0.000523171],"domain_scores_gemma":[0.9967088,0.002430159,0.0002786154,0.0003506062,0.00006774499,0.0001640998],"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.00226758,0.00009558631,0.00007012936,0.002487994,0.0004476988,0.0002969469,0.001654129,0.000127585,0.000458918,0.7217855,0.0009307432,0.2693772],"study_design_scores_gemma":[0.01190887,0.0000453776,0.000101976,0.0008644491,0.0001261476,0.00003512992,0.00010039,0.01013353,0.0002168777,0.9757671,0.0001978133,0.00050234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02208887,0.002611142,0.9708604,0.0003993147,0.001514391,0.001082886,0.0003903832,0.0001290625,0.000923533],"genre_scores_gemma":[0.9254586,0.0007126062,0.07203861,0.0001360327,0.001051262,0.0001759159,0.0000367111,0.0001191132,0.0002711717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9033697,"threshold_uncertainty_score":0.999892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245919572","doi":"10.1002/rsa.20123","title":"Regular subgraphs of random graphs","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Random regular graph; Combinatorics; struct; Mathematics; Graph; Random graph; Regular graph; Strongly regular graph; Discrete mathematics; Constant (computer programming); Line graph; Pathwidth; Graph power; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01111309453741431,"gpt":0.2513121485370848,"spread":0.2401990539996705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997211,0.0003382095,0.0007894206,0.0002177008,0.0003205457,0.0000426756,0.0002453315,0.0001883023,0.0001033871],"category_scores_gemma":[0.0001174368,0.0002361108,0.0003370134,0.0002627301,0.0004382476,0.0000928599,0.00009581554,0.0002051759,2.640276e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000736945,"about_ca_system_score_gemma":0.00001513136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001100927,"about_ca_topic_score_gemma":0.00001377285,"domain_scores_codex":[0.9980927,0.0001554713,0.0006211072,0.0003773579,0.000388877,0.0003644514],"domain_scores_gemma":[0.9984576,0.0006127332,0.0002832005,0.0004507507,0.0001039104,0.00009180691],"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.000783472,0.00004245287,0.001436527,0.0001908957,0.000175844,0.00001667364,0.0003741738,0.00001937253,0.001437586,0.9846565,0.001616997,0.009249476],"study_design_scores_gemma":[0.010671,0.00006317393,0.004119426,0.00003421626,0.0001367582,0.00006729628,0.00008663065,0.0001824394,0.005103743,0.9781603,0.001078707,0.0002962649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873694,0.003575047,0.004480134,0.0000622271,0.0005751766,0.0005782954,0.00007703344,0.0001125967,0.003170131],"genre_scores_gemma":[0.9856436,0.0002183711,0.01356317,0.00004092973,0.0002297566,0.00001353005,0.000014658,0.00004039775,0.0002355463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009887528,"threshold_uncertainty_score":0.9628319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020722320","doi":"10.1002/rsa.20473","title":"Degenerate random environments","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Percolation (cognitive psychology); Random graph; Random walk; Mathematics; Combinatorics; Statistical physics; Phase transition; Intersection (aeronautics); Monotone polygon; Percolation threshold; Lattice (music); Discrete mathematics; Computer science; Physics; Graph; Geometry; Cartography; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02836253196779329,"gpt":0.2904313842626388,"spread":0.2620688522948456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002698404,0.0002060895,0.0003658648,0.00003174147,0.0001622895,0.00004162615,0.00009020672,0.00008859915,0.0001898105],"category_scores_gemma":[0.0003377635,0.0001464104,0.00005993074,0.00005498942,0.00005583871,0.00009209889,0.00005901122,0.0001279891,0.00000943076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001337276,"about_ca_system_score_gemma":0.000008218732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004945233,"about_ca_topic_score_gemma":6.941279e-7,"domain_scores_codex":[0.9988679,0.00004782498,0.0002547322,0.000196949,0.00023171,0.0004008341],"domain_scores_gemma":[0.9990059,0.0005136941,0.00008348969,0.0001588478,0.00001309285,0.0002249691],"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.001107703,0.0001942458,0.0001743838,0.0002772209,0.0003183868,0.0000210263,0.00135104,0.00002590221,0.002867979,0.7363443,0.001878465,0.2554393],"study_design_scores_gemma":[0.0152789,0.0000965899,0.0003637152,0.0000296389,0.0002282111,0.0001231098,0.0001037789,0.01091226,0.00444623,0.9635302,0.004370396,0.00051701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0298345,0.001884966,0.9670323,0.00005231044,0.0005094908,0.0002926126,0.00005243478,0.00003919753,0.0003021526],"genre_scores_gemma":[0.9104415,0.0002236946,0.08819958,0.0001458639,0.0005848604,0.00003320738,0.00001107871,0.00003525494,0.0003250121],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8806069,"threshold_uncertainty_score":0.5970441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083548150","doi":"10.1002/rsa.20306","title":"Edge flows in the complete random‐lengths network","year":2010,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Random graph; Mathematics; Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; struct; Random variable; Path (computing); Shortest path problem; Flow (mathematics); Limit (mathematics); Constant (computer programming); Path length; Graph; Discrete mathematics; Computer science; Geometry; Mathematical analysis; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.008304581060683752,"gpt":0.2488744036981109,"spread":0.2405698226374272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006254289,0.0002594635,0.0004913362,0.00006138573,0.0002952429,0.0001666507,0.0003656411,0.00006309201,0.0005114831],"category_scores_gemma":[0.00001045796,0.0001641992,0.0001927805,0.0002792793,0.0001093788,0.00007638113,0.00008860871,0.0005916109,0.000003243694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004360994,"about_ca_system_score_gemma":0.00001695243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003200147,"about_ca_topic_score_gemma":0.0001933186,"domain_scores_codex":[0.9985387,0.0001699654,0.0003515435,0.0003250071,0.0002086901,0.0004060334],"domain_scores_gemma":[0.9989046,0.0004716029,0.0001108743,0.0004041249,0.0000360392,0.00007270221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009456762,0.0001885565,0.03300046,0.00003685309,0.0005832969,0.00003056305,0.00220171,0.002389412,0.002225266,0.1712501,0.02286429,0.7642838],"study_design_scores_gemma":[0.02983786,0.0001158627,0.0377062,0.0000594451,0.000330291,0.00004465918,0.0005223746,0.1521268,0.0002814767,0.5478121,0.2298354,0.001327581],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9241416,0.00126332,0.05573649,0.00101535,0.001206434,0.002027781,0.0001082119,0.0001874324,0.0143134],"genre_scores_gemma":[0.9915502,0.00002507709,0.005848675,0.0001562769,0.002237642,0.00006286448,0.00005470883,0.00001944976,0.00004509439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7629562,"threshold_uncertainty_score":0.6695848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964041306","doi":"10.1002/rsa.20748","title":"On the <i>K</i>‐sat model with large number of clauses","year":2017,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spin glass; Mathematics; Limit (mathematics); Combinatorics; Order (exchange); Spin (aerodynamics); Law of large numbers; Energy (signal processing); Discrete mathematics; Physics; Statistics; Quantum mechanics; Mathematical analysis; Random variable; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.007191773732953024,"gpt":0.2516578794083303,"spread":0.2444661056753773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005345254,0.0001055711,0.0001575454,0.000005110528,0.0003302099,0.00007033683,0.0001476807,0.00001536656,0.0001157546],"category_scores_gemma":[0.000004412783,0.00005185518,0.00005188947,0.00001435009,0.0001769404,0.00005171331,0.00004786009,0.00009320403,0.000002915174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000127688,"about_ca_system_score_gemma":0.00001365918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001895116,"about_ca_topic_score_gemma":4.322288e-7,"domain_scores_codex":[0.9995238,0.00001648553,0.00008678608,0.0001225685,0.0001311064,0.0001192602],"domain_scores_gemma":[0.9994936,0.0001362404,0.00009230304,0.000204776,0.00003714549,0.00003594503],"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.0001365902,0.00002393635,0.001173405,0.000003820442,0.00005064628,3.043156e-7,0.00007246668,0.0007685389,0.00001879881,0.9930975,0.0001108235,0.004543202],"study_design_scores_gemma":[0.002187635,0.00002468894,0.00205229,0.00001548298,0.00002457424,8.115449e-7,0.00005030178,0.02165935,0.0006352831,0.9731759,0.00008109147,0.00009257862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9288134,0.00001440801,0.05914099,0.0004240564,0.00005318821,0.0001527585,0.0001639973,0.000008605247,0.01122857],"genre_scores_gemma":[0.9988725,0.000001337468,0.0007654037,0.00008530592,0.0001335608,0.00000627381,0.000008817402,0.000008158582,0.0001186436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07005908,"threshold_uncertainty_score":0.2539741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139991023","doi":"10.1002/rsa.10065","title":"The shortest disjunctive normal form of a random Boolean function","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Boolean function; Logarithm; Function (biology); Discrete mathematics; Parity function; Disjunctive normal form; Binary logarithm; Mathematical proof; Boolean expression","retraction":null,"screen_n_in":null,"score":{"opus":0.01229884077066146,"gpt":0.2507774985054351,"spread":0.2384786577347737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398885,0.0002715954,0.0004692986,0.00006244073,0.0007930304,0.00006391481,0.0001704852,0.0001222703,0.00007183974],"category_scores_gemma":[0.0004628494,0.0001471167,0.0002141858,0.0001405359,0.0003547097,0.0001186575,0.00006244923,0.0002446493,3.463481e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357401,"about_ca_system_score_gemma":0.00002556915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001274867,"about_ca_topic_score_gemma":0.00002034797,"domain_scores_codex":[0.9984398,0.0001803833,0.0004566598,0.0002638102,0.0003165405,0.0003427604],"domain_scores_gemma":[0.9979519,0.001268218,0.0002263153,0.0003532039,0.0001040814,0.00009628305],"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.002441243,0.00003338134,0.001064247,0.00007198027,0.000411076,0.000004647466,0.001923663,0.00001305497,0.0002081362,0.9474118,0.0006316747,0.0457851],"study_design_scores_gemma":[0.009309184,0.0001684351,0.003420918,0.00002082427,0.0001959442,0.00006068376,0.0007796978,0.0003412217,0.00118918,0.9798094,0.004466471,0.0002380401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9304155,0.004910425,0.04735082,0.0001085949,0.002546878,0.001581293,0.00008399004,0.0001225501,0.01288],"genre_scores_gemma":[0.9973463,0.0002324771,0.001847031,0.00005101768,0.0001749517,0.000023792,0.000004545881,0.00002850839,0.0002913947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06693083,"threshold_uncertainty_score":0.6099429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1492951456","doi":"10.1002/rsa.20538","title":"On longest paths and diameter in random apollonian networks","year":2014,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Planar graph; Random graph; Bounded function; Conjecture; Path (computing); Random walk; Plane (geometry); Triangulation; Graph; Discrete mathematics; Geometry; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01312196339921286,"gpt":0.2678942400788881,"spread":0.2547722766796752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003772684,0.0002366854,0.0005276872,0.00006922352,0.0001030138,0.00008386598,0.00008751945,0.000131344,0.00003428322],"category_scores_gemma":[0.001040651,0.0001671166,0.00004573009,0.00009084397,0.0000738772,0.0000401613,0.00004897194,0.0002404259,9.201614e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001018208,"about_ca_system_score_gemma":0.000009531536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002325098,"about_ca_topic_score_gemma":0.00003303858,"domain_scores_codex":[0.9987839,0.00008703797,0.0002968132,0.000338459,0.0001777809,0.0003159683],"domain_scores_gemma":[0.9971218,0.002454611,0.00008039054,0.0001721571,0.00002628301,0.0001448129],"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.001413448,0.0000665169,0.00009980382,0.0002290699,0.00006110421,0.00003503167,0.0005378462,0.0001702901,0.00002539676,0.6537548,0.0003249175,0.3432817],"study_design_scores_gemma":[0.01346302,0.0002501777,0.0006430805,0.00009619279,0.00004846534,0.0000328083,0.00003773508,0.167395,0.00002845509,0.8175526,0.0001797291,0.0002727359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05083208,0.0005488174,0.9472498,0.0001709892,0.0003161951,0.0004144482,0.00002677285,0.00004122629,0.0003996442],"genre_scores_gemma":[0.9795632,0.0001472307,0.01970568,0.0002641889,0.0002155734,0.0000261672,0.000004727267,0.00002913025,0.00004407709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9287311,"threshold_uncertainty_score":0.6814818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996168307","doi":"10.1002/1098-2418(200103)18:2<101::aid-rsa1000>3.0.co;2-d","title":"Very rapidly mixing Markov chains for 2?-colorings and for independent sets in a graph with maximum degree 4","year":2001,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Glauber; Markov chain; Degree (music); Combinatorics; Mixing (physics); Mathematics; Markov chain mixing time; Discrete mathematics; Graph; Markov model; Variable-order Markov model; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05028358990144532,"gpt":0.3203673715928954,"spread":0.27008378169145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008823693,0.0003116138,0.0006161291,0.0001876165,0.0001850159,0.00008850775,0.0001094797,0.0001572846,0.000004498764],"category_scores_gemma":[0.0001946977,0.0002272177,0.0001158677,0.0001347095,0.00008310651,0.0001020625,0.00005723891,0.0001631536,3.19222e-9],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002814343,"about_ca_system_score_gemma":0.00002860755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005489821,"about_ca_topic_score_gemma":0.000304865,"domain_scores_codex":[0.9984848,0.00007094138,0.0003435962,0.000455053,0.000183262,0.0004623177],"domain_scores_gemma":[0.9984892,0.0009534151,0.0001448758,0.0001980623,0.00007489233,0.000139561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.01590875,0.0001864251,0.006291257,0.002168641,0.0006047771,0.0001618469,0.004516875,0.00003784856,0.001451969,0.02608064,0.0008323559,0.9417586],"study_design_scores_gemma":[0.2159594,0.003596107,0.01729526,0.001145689,0.0009934083,0.001538263,0.006353774,0.04189143,0.00347522,0.6817678,0.0222404,0.003743325],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8168826,0.00120392,0.1785997,0.0002606554,0.0002301871,0.002344526,0.00008492408,0.00005256445,0.0003410404],"genre_scores_gemma":[0.5181582,0.0009600224,0.4788937,0.0002703524,0.0003337045,0.0007080086,0.00002770167,0.0001145208,0.0005337739],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9380153,"threshold_uncertainty_score":0.9265668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4232597137","doi":"10.1002/rsa.20133","title":"Hamiltonicity of random graphs produced by 2‐processes","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"struct; Random graph; Random regular graph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Hamiltonian path; Regular graph; Voltage graph; Line graph; Computer science; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01065009503213523,"gpt":0.2527004330042177,"spread":0.2420503379720824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003983475,0.0003388735,0.0007487733,0.0001118583,0.0003281788,0.00004894282,0.000245855,0.0001594237,0.00006412785],"category_scores_gemma":[0.0003310225,0.0002329644,0.0001679162,0.0002703583,0.0003472015,0.0001105964,0.00009151729,0.000200384,2.070294e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009132974,"about_ca_system_score_gemma":0.00003232744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000125442,"about_ca_topic_score_gemma":0.00001293268,"domain_scores_codex":[0.9981667,0.0001151983,0.0005759392,0.0004290552,0.0003626627,0.000350392],"domain_scores_gemma":[0.9984032,0.000686475,0.0002984387,0.0003680873,0.0001641607,0.00007963346],"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.005124253,0.0004678747,0.006741845,0.004010743,0.0009323873,0.00003395273,0.002509779,0.00008436167,0.03446097,0.8903873,0.0285852,0.02666131],"study_design_scores_gemma":[0.01067079,0.00007628092,0.0009861195,0.00005133422,0.0001317966,0.00003195083,0.00006575257,0.0001129629,0.05597589,0.9304234,0.001118907,0.0003547473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9885541,0.00632064,0.002653661,0.00007063695,0.0003583761,0.0006131494,0.0001713232,0.0001068866,0.001151239],"genre_scores_gemma":[0.9942968,0.0003902793,0.004802851,0.00004684561,0.0001839998,0.00001990786,0.00002088785,0.00003746739,0.0002009855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04003615,"threshold_uncertainty_score":0.9500014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003634762","doi":"10.1002/rsa.20324","title":"Regular induced subgraphs of a random Graph","year":2010,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Random regular graph; Induced subgraph isomorphism problem; Graph factorization; Factor-critical graph; Mathematics; Random graph; Graph; Wheel graph; struct; Induced subgraph; Discrete mathematics; Graph power; Line graph; Voltage graph; Computer science; Vertex (graph theory); Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.01611545517774516,"gpt":0.2739155880886527,"spread":0.2578001329109075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006788221,0.0003448516,0.0007932222,0.000239935,0.0003299421,0.00004720539,0.0003206886,0.0002930882,0.0001616268],"category_scores_gemma":[0.0004009744,0.0002374336,0.0003171787,0.0002691765,0.0003955787,0.0001029696,0.0001246314,0.000526957,2.870609e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000352397,"about_ca_system_score_gemma":0.00002433746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004322218,"about_ca_topic_score_gemma":0.00002319569,"domain_scores_codex":[0.9981762,0.0001302681,0.0005566161,0.0003950869,0.0003807698,0.0003610181],"domain_scores_gemma":[0.9981373,0.000692755,0.0002845697,0.0005933827,0.0001257914,0.0001662095],"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.001593256,0.00007046725,0.001228271,0.0002822326,0.0004624252,0.00002370472,0.002442972,0.00000229784,0.05642064,0.8931627,0.0005552227,0.04375582],"study_design_scores_gemma":[0.0117691,0.00008991342,0.002791644,0.00002621528,0.0001354059,0.0001037214,0.00014243,0.0001180727,0.01849266,0.9654399,0.0005620424,0.0003288885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.99567,0.0003901575,0.001268644,0.00005853965,0.001035938,0.0004905488,0.00003901535,0.0000779103,0.0009692076],"genre_scores_gemma":[0.9849471,0.0001071952,0.01448209,0.00005824271,0.0002782102,0.00001682804,0.000006165831,0.00004090033,0.00006326112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07227721,"threshold_uncertainty_score":0.9682263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}