{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Michael Molloy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088483,0.0002569925,0.0007632308,0.001916868,0.0006717927,0.001751872,0.0009422066,0.0007770194,0.002574091],"category_scores_gemma":[0.01851732,0.0007758695,0.0006001721,0.001082524,0.001723929,0.002582578,0.001369613,0.001213612,0.0001958963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001498878,"about_ca_system_score_gemma":0.0005502173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001083081,"about_ca_topic_score_gemma":0.001638112,"domain_scores_codex":[0.9980454,0.0007519203,0.0001185873,0.0003148062,0.0005162557,0.0002529382],"domain_scores_gemma":[0.9850501,0.009843964,0.001750389,0.001370214,0.00125005,0.0007353326],"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.0006963592,0.000177681,0.01078421,0.0001838787,0.0001060362,0.0007306114,0.0006062512,0.1320066,0.01174524,0.7918308,0.003800042,0.04733245],"study_design_scores_gemma":[0.00009227467,0.00008045331,0.002426132,0.00003208111,0.00003209549,0.0003735514,0.0001224184,0.4783832,0.005885577,0.5108154,0.001730937,0.00002590985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6949804,0.0004277419,0.2947053,0.0005842866,0.00003447134,0.0001167452,0.000265007,0.0008358909,0.008050154],"genre_scores_gemma":[0.9524162,0.00009226433,0.04525099,0.0001773082,0.00002623749,0.0001249191,0.0002537839,0.00009741756,0.001560774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002574091,"threshold_uncertainty_score":0.0110451,"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","authors":[{"name":"James Allen Fill","is_ca":false},{"name":"Motoya Machida","is_ca":false},{"name":"Duncan J. Murdoch","is_ca":true},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007727746,0.0006745356,0.001322734,0.001418052,0.0008683723,0.001689432,0.002966059,0.001822175,0.004869838],"category_scores_gemma":[0.02817465,0.0006512977,0.001413378,0.001373836,0.002394612,0.003188899,0.004807571,0.002711489,0.001077536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105157,"about_ca_system_score_gemma":0.002014113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001796972,"about_ca_topic_score_gemma":0.001636517,"domain_scores_codex":[0.9965127,0.001491386,0.0001812526,0.0004694478,0.001071836,0.0002733306],"domain_scores_gemma":[0.9897631,0.00601688,0.0004449057,0.002351377,0.001091506,0.0003321492],"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.0002469296,0.0001039826,0.001399835,0.0001434501,0.0000740508,0.0001917342,0.000305658,0.1762895,0.00223692,0.6427599,0.003929606,0.1723185],"study_design_scores_gemma":[0.00004367485,0.00006100117,0.0001549759,0.00002149639,0.00001545744,0.0001146929,0.00001859464,0.7810189,0.001382797,0.2115465,0.005597035,0.00002488724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002942312,0.00004323458,0.994969,0.0001189117,0.00001854935,0.00004248516,0.00002990927,0.0002197047,0.001615924],"genre_scores_gemma":[0.1722412,0.0002243512,0.8216298,0.0003823242,0.0001233476,0.0003172409,0.0002273784,0.0002635269,0.004590862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007727746,"threshold_uncertainty_score":0.0408687,"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","authors":[{"name":"Christian Borgs","is_ca":false},{"name":"Jennifer Chayes","is_ca":false},{"name":"Remco van der Hofstad","is_ca":false},{"name":"Gordon Slade","is_ca":true},{"name":"Joel Spencer","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007883455,0.0002481551,0.0005256427,0.0007257803,0.0004661026,0.0009519155,0.0007266904,0.0006539137,0.002060027],"category_scores_gemma":[0.005470914,0.0002609374,0.0005121161,0.0004644877,0.001232356,0.001960377,0.0005889394,0.0006955963,0.00009678314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009878936,"about_ca_system_score_gemma":0.0002891148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002466576,"about_ca_topic_score_gemma":0.001315017,"domain_scores_codex":[0.999727,0.00007705474,0.000009290859,0.00006274114,0.00005340359,0.00007050061],"domain_scores_gemma":[0.9971993,0.001720621,0.0004590965,0.0002325174,0.0001174596,0.0002710547],"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.0003782372,0.0001568697,0.01024693,0.0001929,0.00007740082,0.001035029,0.0006182428,0.2030288,0.03106124,0.7394118,0.002266229,0.0115263],"study_design_scores_gemma":[0.00006289612,0.0001203867,0.004865102,0.00003135942,0.00003947144,0.0003532484,0.0001669036,0.7207729,0.004864741,0.2676578,0.001029858,0.00003542123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9440477,0.0006011795,0.04909302,0.0004412309,0.00002865147,0.0000272263,0.00008302922,0.0001781303,0.005499774],"genre_scores_gemma":[0.9978167,0.0001065144,0.001672311,0.00002450456,0.00002265955,0.00001434991,0.00003462171,0.00001832666,0.0002900987],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002466576,"threshold_uncertainty_score":0.007167637,"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","authors":[{"name":"Eli Ben‐Sasson","is_ca":false},{"name":"Nicola Galesi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01059411,0.0007591376,0.002310361,0.001799774,0.00170792,0.00450786,0.004487703,0.002574031,0.01082665],"category_scores_gemma":[0.07077478,0.00110151,0.002218955,0.002024437,0.004166876,0.01088822,0.004132679,0.003465591,0.0007791726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004220206,"about_ca_system_score_gemma":0.003034224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002593603,"about_ca_topic_score_gemma":0.002469519,"domain_scores_codex":[0.9816566,0.008455631,0.0009944747,0.00251896,0.00424944,0.002124972],"domain_scores_gemma":[0.8646049,0.1154568,0.004684088,0.01060245,0.002853912,0.001797903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002719929,0.0004912352,0.009522404,0.0008758113,0.0005751632,0.0007005301,0.001335258,0.6066797,0.0180929,0.2946386,0.006176455,0.058192],"study_design_scores_gemma":[0.0001495573,0.0001296658,0.0008421839,0.00002891383,0.00009581519,0.0001663272,0.00014113,0.8217736,0.005899857,0.1698202,0.0009126341,0.00004003415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6435637,0.0007106917,0.338526,0.005164404,0.0000836995,0.0003942041,0.001161566,0.001892345,0.008503458],"genre_scores_gemma":[0.955188,0.000231607,0.04010147,0.0003900488,0.00008409814,0.0002463345,0.0007010237,0.000327472,0.002729826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01082665,"threshold_uncertainty_score":0.05602771,"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","authors":[{"name":"Yoshiharu Kohayakawa","is_ca":false},{"name":"Sang June Lee","is_ca":false},{"name":"Vojtěch Rödl","is_ca":false},{"name":"Wojciech Samotij","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004260585,0.0003605971,0.0009270091,0.002066691,0.001097629,0.002344349,0.001496035,0.0009982835,0.002799579],"category_scores_gemma":[0.03915912,0.0006459191,0.0005645205,0.0009948664,0.002765011,0.003701235,0.002143013,0.001240571,0.0001818861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001365186,"about_ca_system_score_gemma":0.0005015786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005647326,"about_ca_topic_score_gemma":0.000452221,"domain_scores_codex":[0.998229,0.00066234,0.000120216,0.0003590473,0.0004284827,0.000200935],"domain_scores_gemma":[0.9437293,0.04662009,0.003543632,0.002699686,0.001606766,0.001800431],"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.001745373,0.0001996753,0.07646369,0.0004735512,0.0002448218,0.0006876774,0.0009579057,0.1354975,0.01950555,0.7258212,0.006044227,0.03235888],"study_design_scores_gemma":[0.0001314,0.0002522719,0.02496433,0.0002239473,0.00007656164,0.001159509,0.0007209114,0.5551614,0.01748219,0.394806,0.004880062,0.0001414565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.865222,0.0005958802,0.1220673,0.001777336,0.00005714983,0.00005885351,0.0007798386,0.0001213941,0.009320298],"genre_scores_gemma":[0.9860891,0.0002050964,0.01225105,0.00009892481,0.00007232326,0.00009491087,0.0003319609,0.00002724646,0.0008294501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004260585,"threshold_uncertainty_score":0.0225324,"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","authors":[{"name":"Heidi Gebauer","is_ca":true},{"name":"Tibor Szabó","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001796196,0.0004323703,0.0006790319,0.0008613651,0.00064036,0.001652223,0.001476265,0.001205974,0.005238725],"category_scores_gemma":[0.01354748,0.000314295,0.0004804049,0.0004738071,0.002192979,0.003393502,0.001491964,0.001729838,0.0004059227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001883661,"about_ca_system_score_gemma":0.0006458742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00126537,"about_ca_topic_score_gemma":0.001243132,"domain_scores_codex":[0.9986787,0.0005526597,0.00004024458,0.0001758124,0.0003673696,0.0001851595],"domain_scores_gemma":[0.9924726,0.004775397,0.0009009737,0.0007218928,0.0005224506,0.000606664],"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.00009117585,0.00004626877,0.001396705,0.00005714281,0.00002503432,0.0001549497,0.0001854467,0.04066566,0.002774848,0.9488506,0.001744904,0.004007226],"study_design_scores_gemma":[0.00006064256,0.00003856673,0.0007123516,0.00001751961,0.00001648352,0.0002051244,0.00007974273,0.2546462,0.0007182388,0.7417871,0.001696719,0.00002131361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5423672,0.0005871945,0.4067726,0.003472855,0.00007560092,0.0001449444,0.0003180934,0.0003561873,0.04590539],"genre_scores_gemma":[0.9807581,0.0001976113,0.01498923,0.000377553,0.00004683289,0.0001088069,0.00009087654,0.00005903273,0.003372008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005238725,"threshold_uncertainty_score":0.01752526,"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","authors":[{"name":"Itaï Benjamini","is_ca":false},{"name":"Gady Kozma","is_ca":false},{"name":"Nicholas Wormald","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998082,0.0004232079,0.0005395469,0.001606266,0.0007332696,0.001169816,0.0009896929,0.0008685212,0.003086694],"category_scores_gemma":[0.008280764,0.0004181658,0.0005070296,0.0005335268,0.002036645,0.001730204,0.001376645,0.0008080986,0.00022957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262517,"about_ca_system_score_gemma":0.0004066142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00217259,"about_ca_topic_score_gemma":0.001560024,"domain_scores_codex":[0.999608,0.0001227216,0.00001320378,0.0001017256,0.0000907946,0.00006361611],"domain_scores_gemma":[0.9967437,0.001829407,0.0004056164,0.0002122788,0.0002343025,0.0005745871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003083393,0.00004642312,0.006874146,0.0001632605,0.0001418307,0.0004997664,0.0004951488,0.1292338,0.01991295,0.828392,0.002793229,0.01113913],"study_design_scores_gemma":[0.00002863838,0.00004922513,0.002741455,0.00003750157,0.00004121666,0.0002116427,0.00007712388,0.731237,0.004071643,0.2598553,0.001602047,0.00004721913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8143937,0.0005164596,0.1721253,0.0009116731,0.00008373645,0.00006391773,0.0002097845,0.0003994615,0.01129591],"genre_scores_gemma":[0.9902061,0.0001129118,0.007201837,0.00007256726,0.00003285196,0.00004437098,0.0001184947,0.00007097478,0.002139937],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003086694,"threshold_uncertainty_score":0.01032597,"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","authors":[{"name":"Nicholas Pippenger","is_ca":false},{"name":"Kristin Schleich","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007503437,0.0001849249,0.0004771822,0.001799384,0.0004956819,0.001281801,0.0006434072,0.0006285506,0.001556782],"category_scores_gemma":[0.006654029,0.0002170757,0.0002566034,0.0009083417,0.001262236,0.001402205,0.0007105769,0.0003367946,0.00009844312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008783064,"about_ca_system_score_gemma":0.0002372602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006044651,"about_ca_topic_score_gemma":0.0006015905,"domain_scores_codex":[0.9995623,0.0001155779,0.00001658755,0.00006261056,0.0001683281,0.00007454891],"domain_scores_gemma":[0.997386,0.001170344,0.0006342616,0.0002512589,0.0002811238,0.0002769486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003779379,0.0001138713,0.04720573,0.0001287968,0.0001233628,0.0008091569,0.0004328128,0.6018661,0.01489532,0.3167387,0.001171883,0.01613638],"study_design_scores_gemma":[0.00005974844,0.0001499452,0.01644721,0.00002785062,0.00003894823,0.0005376196,0.0003957057,0.8569711,0.005101196,0.1186443,0.001570099,0.00005618362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9888172,0.00006532765,0.009276824,0.0000628163,0.000007998048,0.0000126218,0.00004372151,0.00002847342,0.001684957],"genre_scores_gemma":[0.9989116,0.00002218228,0.0008379819,0.00000626143,0.000003680982,0.000008888175,0.00004653604,0.000005858489,0.0001569446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001799384,"threshold_uncertainty_score":0.006372571,"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","authors":[{"name":"Zhidong Bai","is_ca":false},{"name":"Luc Devroye","is_ca":true},{"name":"Hsien‐Kuei Hwang","is_ca":false},{"name":"Tsung‐Hsi Tsai","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003686853,0.000609327,0.001562051,0.003280805,0.00149373,0.003369234,0.001307899,0.001343128,0.008471735],"category_scores_gemma":[0.02429057,0.001109989,0.001025778,0.001930875,0.002546826,0.004728362,0.003852502,0.001558325,0.001683597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001356924,"about_ca_system_score_gemma":0.0006255339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004666897,"about_ca_topic_score_gemma":0.0005354643,"domain_scores_codex":[0.997108,0.00120691,0.0001586006,0.0005651013,0.0006564001,0.0003049989],"domain_scores_gemma":[0.9898396,0.006801114,0.001175974,0.0006823094,0.0008824512,0.0006185688],"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.000194585,0.00004665005,0.00127691,0.0002279391,0.00005530038,0.0001645694,0.0003103093,0.03980033,0.001807354,0.9274163,0.003857998,0.02484175],"study_design_scores_gemma":[0.0000607816,0.00005495362,0.0006233671,0.00008438255,0.00001661132,0.0002267087,0.0001134411,0.1372073,0.001612839,0.854077,0.005893235,0.00002929809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2235961,0.003676197,0.7256559,0.001474715,0.0002203304,0.0002846229,0.0007635668,0.0006478929,0.04368067],"genre_scores_gemma":[0.7497112,0.001784463,0.226921,0.0006921844,0.0003548831,0.00104823,0.00096317,0.0004637641,0.01806112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008471735,"threshold_uncertainty_score":0.02834076,"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","authors":[{"name":"Neal Madras","is_ca":true},{"name":"Zhongrong Zheng","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002871867,0.0008152215,0.0009655001,0.00105434,0.00110106,0.001378632,0.002136249,0.001734975,0.01075628],"category_scores_gemma":[0.01173793,0.0004677902,0.0007750892,0.00149712,0.001973583,0.003167558,0.003266925,0.00250011,0.002656922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008093417,"about_ca_system_score_gemma":0.001469119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001338112,"about_ca_topic_score_gemma":0.0009993445,"domain_scores_codex":[0.9973434,0.001216201,0.0001269393,0.0004153303,0.0006269769,0.0002712645],"domain_scores_gemma":[0.9943229,0.003151724,0.0001716679,0.001579286,0.0005773451,0.0001970942],"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.0004100621,0.0001461679,0.001014375,0.0001021073,0.00006120779,0.0001092311,0.0001524989,0.09925736,0.002650053,0.6032752,0.01248442,0.2803375],"study_design_scores_gemma":[0.00009930061,0.00005806987,0.0001273672,0.00001800321,0.00001859951,0.00009534294,0.00001732434,0.6726813,0.002331288,0.3171726,0.007362218,0.00001856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02458826,0.0003162472,0.9567585,0.0006025455,0.0001580117,0.0001880728,0.0001162186,0.001165467,0.01610663],"genre_scores_gemma":[0.3567726,0.0003304295,0.6247086,0.0007337046,0.0002563599,0.0006282406,0.0005546013,0.0005217651,0.01549373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01075628,"threshold_uncertainty_score":0.03598338,"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","authors":[{"name":"János Pach","is_ca":false},{"name":"Márió Szegedy","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007121565,0.0005981945,0.0007945051,0.00275843,0.0008861598,0.001690788,0.001239151,0.0007956226,0.003620459],"category_scores_gemma":[0.006697567,0.001129559,0.0008583324,0.002049123,0.001827531,0.002496706,0.00248829,0.001323311,0.0004914784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001329715,"about_ca_system_score_gemma":0.0005179916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004835451,"about_ca_topic_score_gemma":0.003245733,"domain_scores_codex":[0.9985247,0.0003628222,0.00008711005,0.0003480108,0.000510183,0.0001671576],"domain_scores_gemma":[0.9907433,0.004973678,0.001784844,0.0009572096,0.0009237432,0.0006172747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005884375,0.0001129957,0.005160141,0.0003382133,0.0001270775,0.0005349756,0.001383252,0.4482775,0.02549145,0.4642777,0.003424969,0.0502832],"study_design_scores_gemma":[0.0001396748,0.000137836,0.004833493,0.0000802052,0.00005116023,0.0004978252,0.000587128,0.6275916,0.01387002,0.3394012,0.01274621,0.00006365688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.417684,0.000475034,0.5702333,0.000618854,0.0000393427,0.0001801689,0.0006381603,0.0003872096,0.009743895],"genre_scores_gemma":[0.7506882,0.000557551,0.2425575,0.000205219,0.00005806591,0.000280904,0.001174573,0.0001355566,0.004342481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004835451,"threshold_uncertainty_score":0.0121116,"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","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Michael Molloy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629275,0.0003746557,0.0008781479,0.001692089,0.0006838897,0.001403525,0.0009595539,0.000783385,0.002678943],"category_scores_gemma":[0.01085445,0.0003739973,0.000465304,0.0006939552,0.001634124,0.00397035,0.001063392,0.000790428,0.0002791404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144102,"about_ca_system_score_gemma":0.0004729292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001029481,"about_ca_topic_score_gemma":0.0005471678,"domain_scores_codex":[0.9995868,0.0001088583,0.0000188486,0.0001327578,0.00008192084,0.00007095704],"domain_scores_gemma":[0.9947518,0.003433582,0.0005339395,0.0004572864,0.0002708934,0.0005526263],"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.000439758,0.00007997933,0.003559788,0.0002069542,0.00005636971,0.000573049,0.0004996351,0.09249588,0.02465391,0.8558155,0.003051888,0.01856724],"study_design_scores_gemma":[0.00005265895,0.00009184016,0.001681284,0.00003492987,0.00003050635,0.0002837224,0.00009998089,0.6524995,0.00384857,0.3393146,0.0020226,0.00003977177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7755103,0.0008085926,0.2153083,0.001175465,0.00008823883,0.0000711323,0.0002686359,0.0005591215,0.006210264],"genre_scores_gemma":[0.9791266,0.000403126,0.01846156,0.0001000961,0.00007686512,0.00008608977,0.0001485618,0.00008548436,0.001511615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002678943,"threshold_uncertainty_score":0.008961916,"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","authors":[{"name":"Nikolaos Fountoulakis","is_ca":false},{"name":"Bruce A. Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008870313,0.0003549178,0.0004237993,0.001437321,0.0007515384,0.001227182,0.0006387636,0.0007916574,0.002035265],"category_scores_gemma":[0.008505559,0.0002740554,0.0004232936,0.0004514664,0.001357162,0.001409333,0.0007725459,0.0007445283,0.0001962049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001098425,"about_ca_system_score_gemma":0.0003486765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00268624,"about_ca_topic_score_gemma":0.001385031,"domain_scores_codex":[0.9997907,0.00007415711,0.000007020756,0.00004617316,0.00004288803,0.00003907857],"domain_scores_gemma":[0.9965805,0.001956099,0.0004936403,0.0001950049,0.0003096126,0.0004651699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006137242,0.0001337735,0.02782435,0.0002254256,0.0001735499,0.001130457,0.0009031693,0.2763715,0.06575259,0.6086553,0.003615605,0.01460051],"study_design_scores_gemma":[0.00003184961,0.00006510637,0.005089223,0.00002093026,0.0000325168,0.000218096,0.0001243073,0.9196685,0.004984206,0.06871337,0.001011244,0.00004065977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9518167,0.0002374612,0.0433087,0.000542784,0.00002898129,0.00002580614,0.00008757012,0.0001722797,0.003779722],"genre_scores_gemma":[0.9937015,0.00008484886,0.005200308,0.0000279554,0.00001773656,0.00001963503,0.00005369406,0.00003544618,0.000858951],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00268624,"threshold_uncertainty_score":0.007969677,"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)","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967298,0.0008518323,0.001002835,0.002105261,0.0009231991,0.001412061,0.001357916,0.001086935,0.002557494],"category_scores_gemma":[0.01590142,0.0005730379,0.001383811,0.001263584,0.003488311,0.001920935,0.002157443,0.002327516,0.0004745006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001310772,"about_ca_system_score_gemma":0.0007676372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001315877,"about_ca_topic_score_gemma":0.001286501,"domain_scores_codex":[0.9990746,0.0003144682,0.00003309669,0.0001619009,0.0002514844,0.0001644175],"domain_scores_gemma":[0.9892635,0.007575887,0.001126063,0.001007847,0.0005104176,0.0005163446],"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.000105805,0.00007242562,0.003217302,0.0000940234,0.00006742684,0.0002773224,0.0003604546,0.16244,0.004883681,0.8164644,0.001742118,0.01027519],"study_design_scores_gemma":[0.00001987997,0.00002581329,0.0006651266,0.00001589245,0.00001765259,0.0001045631,0.00004216213,0.6018485,0.001695779,0.3947382,0.0008090815,0.00001740911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2140477,0.0003229632,0.7759154,0.0005776565,0.00005712092,0.00006288715,0.0001336089,0.0002431918,0.0086395],"genre_scores_gemma":[0.9180496,0.0005492434,0.07730784,0.0002150364,0.0001382273,0.0001279532,0.0001895515,0.0001029002,0.003319686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002557494,"threshold_uncertainty_score":0.01040417,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002844722,0.0008343637,0.001215162,0.001622044,0.001588739,0.002968427,0.002168318,0.001009386,0.005498244],"category_scores_gemma":[0.01887699,0.0006989727,0.0009313688,0.001012905,0.002101307,0.004091709,0.004914804,0.001802076,0.0007169853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001723095,"about_ca_system_score_gemma":0.001127957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002251991,"about_ca_topic_score_gemma":0.002184417,"domain_scores_codex":[0.995859,0.0010861,0.0002564833,0.000572941,0.001633059,0.0005925553],"domain_scores_gemma":[0.9828095,0.007053165,0.002080303,0.004955567,0.001983889,0.001117675],"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.002958669,0.0003923905,0.06224333,0.0005794854,0.0005898247,0.001394533,0.001767505,0.2113119,0.04699864,0.2712249,0.01856868,0.3819702],"study_design_scores_gemma":[0.00009725819,0.0006862238,0.0124365,0.0001906563,0.0002358449,0.001265505,0.0007535391,0.7636346,0.05162332,0.1426612,0.02631827,0.00009705582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5753798,0.0005872324,0.3994305,0.00176418,0.0002109923,0.0002613308,0.0003658321,0.0008338693,0.02116631],"genre_scores_gemma":[0.8678417,0.0003267605,0.1164881,0.0003188982,0.0000979948,0.0001961303,0.0008194225,0.0003347325,0.01357624],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005498244,"threshold_uncertainty_score":0.0183934,"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","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Michael Molloy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006308025,0.0007220395,0.001554417,0.002536679,0.0009365246,0.004648176,0.001677328,0.00178741,0.004222754],"category_scores_gemma":[0.03989351,0.000854079,0.001759417,0.001458078,0.004564749,0.00748686,0.003745833,0.004558026,0.0003072391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002772694,"about_ca_system_score_gemma":0.0008836817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009824767,"about_ca_topic_score_gemma":0.0007252552,"domain_scores_codex":[0.9942266,0.002038042,0.0004281938,0.0008341483,0.001619421,0.0008534801],"domain_scores_gemma":[0.9473813,0.04079875,0.003965092,0.003210932,0.001913236,0.002730662],"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.0002611699,0.0001092759,0.002613876,0.0001668568,0.00007514367,0.000305683,0.0005790889,0.0493832,0.004507758,0.9343064,0.001260228,0.006431193],"study_design_scores_gemma":[0.00005129741,0.00009072825,0.0009710601,0.00003159588,0.00002226001,0.0002597444,0.0001782455,0.1548621,0.002028523,0.8407093,0.0007593896,0.00003563625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5836156,0.001242933,0.393767,0.002496041,0.00007339702,0.0001525041,0.0003961789,0.0006706482,0.01758576],"genre_scores_gemma":[0.977126,0.0002167728,0.02071145,0.0002504046,0.00006206318,0.0001171827,0.000237477,0.00006459873,0.001214155],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006308025,"threshold_uncertainty_score":0.03336042,"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","authors":[{"name":"Luc Devroye","is_ca":true},{"name":"Nicolás Fraiman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654086,0.0004354907,0.0008330354,0.003406248,0.0009952551,0.001905326,0.001509501,0.001201656,0.003747677],"category_scores_gemma":[0.01473739,0.0005028958,0.0005970161,0.0009778012,0.002311439,0.003061795,0.001917676,0.001388831,0.0002787649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088932,"about_ca_system_score_gemma":0.0003246886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001512771,"about_ca_topic_score_gemma":0.001536079,"domain_scores_codex":[0.9987174,0.0003872054,0.00007736073,0.0002936404,0.000271866,0.0002524797],"domain_scores_gemma":[0.987875,0.006441941,0.002165908,0.0009421339,0.001138924,0.001436065],"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.0002690351,0.00008928662,0.009862904,0.0001254011,0.00004462681,0.0008867103,0.0006030133,0.04481757,0.007972588,0.9284819,0.002081566,0.004765242],"study_design_scores_gemma":[0.00009044124,0.0001202596,0.0111043,0.00004812909,0.00006205683,0.0009118532,0.0002849959,0.3298831,0.003300775,0.6519299,0.002203617,0.00006068985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8193157,0.00030043,0.1646985,0.0008453513,0.00003752051,0.0001034557,0.0005535672,0.0002883037,0.01385724],"genre_scores_gemma":[0.9939889,0.00008461429,0.004780738,0.00008718476,0.00004756981,0.00005382116,0.0002173942,0.0000305354,0.0007092821],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003747677,"threshold_uncertainty_score":0.01253724,"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","authors":[{"name":"Alex Gamburd","is_ca":false},{"name":"Shlomo Hoory","is_ca":false},{"name":"Mehrdad Shahshahani","is_ca":false},{"name":"Aner Shalev","is_ca":false},{"name":"Bálint Virág","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003810924,0.0005038297,0.001215906,0.002409222,0.001122399,0.002376033,0.001904608,0.001510039,0.003610748],"category_scores_gemma":[0.04058785,0.0006928371,0.0006012892,0.001309233,0.004189775,0.003815501,0.002629308,0.001679815,0.0004436834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001710959,"about_ca_system_score_gemma":0.0006119232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006994742,"about_ca_topic_score_gemma":0.000612714,"domain_scores_codex":[0.9975843,0.001039103,0.00008287436,0.0004885226,0.0005412646,0.0002639104],"domain_scores_gemma":[0.9569173,0.03198124,0.003311414,0.004426909,0.001617858,0.001745194],"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.0007464923,0.0001287995,0.0225206,0.0003060341,0.0002146652,0.0005815027,0.00100359,0.1317409,0.009457858,0.8006911,0.00596709,0.02664144],"study_design_scores_gemma":[0.0001087713,0.0001534578,0.00424952,0.00007775478,0.0000571025,0.0006748083,0.0002100867,0.3381323,0.005177874,0.6483547,0.002728432,0.00007529362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9009675,0.0008231664,0.08570839,0.001992042,0.00008421767,0.00006763351,0.0003832205,0.0003884986,0.009585426],"genre_scores_gemma":[0.9947681,0.000323512,0.003413566,0.0001524564,0.00006283983,0.00006517243,0.0001823022,0.0000528898,0.00097917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003810924,"threshold_uncertainty_score":0.02015436,"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","authors":[{"name":"Nicolas Broutin","is_ca":true},{"name":"Luc Devroye","is_ca":true},{"name":"Erin McLeish","is_ca":true},{"name":"Mikael de la Salle","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443569,0.0003155614,0.0006895501,0.001965276,0.0007867508,0.002117908,0.001305144,0.0006828415,0.00311885],"category_scores_gemma":[0.01261907,0.0003849144,0.0005616273,0.001087217,0.002775301,0.003613889,0.001582915,0.001539308,0.0003154706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001077276,"about_ca_system_score_gemma":0.0004864728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008815142,"about_ca_topic_score_gemma":0.0004907725,"domain_scores_codex":[0.9990127,0.0002069907,0.00003744397,0.0002331925,0.0003586302,0.0001511577],"domain_scores_gemma":[0.990562,0.005933984,0.001159143,0.0008001567,0.0007800725,0.0007647183],"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.00005116681,0.00002035137,0.003093319,0.00009356088,0.00001586395,0.0001415794,0.0004418388,0.02515051,0.003645188,0.9535111,0.001148132,0.01268741],"study_design_scores_gemma":[0.00001693276,0.00007650651,0.003005227,0.00002740983,0.00001724865,0.0003750346,0.0001389013,0.1847358,0.00148116,0.8067717,0.003329392,0.00002477935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.678655,0.001946447,0.300986,0.0009148299,0.0001271072,0.00004398346,0.0002882351,0.0003578889,0.01668045],"genre_scores_gemma":[0.9838135,0.0005595134,0.01305732,0.0001029687,0.000148805,0.00002385724,0.0001216549,0.00005277235,0.002119584],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00311885,"threshold_uncertainty_score":0.01043355,"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","authors":[{"name":"Imre Bárány","is_ca":false},{"name":"Santosh Vempala","is_ca":false},{"name":"Adrian Vetta","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526394,0.0008501756,0.001076005,0.001372716,0.0008467996,0.002256311,0.001273083,0.00120799,0.004257788],"category_scores_gemma":[0.01157305,0.0006155575,0.0007085159,0.0006459213,0.002317385,0.003146622,0.001638981,0.001143982,0.0006040463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001424578,"about_ca_system_score_gemma":0.0007927223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00154551,"about_ca_topic_score_gemma":0.001084715,"domain_scores_codex":[0.9971884,0.001600891,0.00008101494,0.0003749478,0.0004535341,0.000301225],"domain_scores_gemma":[0.994316,0.004249478,0.0005398513,0.0002633626,0.0004112461,0.0002199696],"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.0001073647,0.00005690992,0.0005330876,0.00007335532,0.00005422869,0.0001443702,0.0001739942,0.1375544,0.001052359,0.8504711,0.001318915,0.008459987],"study_design_scores_gemma":[0.00006021417,0.0000453285,0.0001254678,0.00001892015,0.00001127075,0.00007431998,0.00006154367,0.500717,0.0005460749,0.4965402,0.001783946,0.00001572246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1605801,0.0004471372,0.8173934,0.0008457704,0.00005081368,0.0001841715,0.0001126858,0.0002499013,0.02013608],"genre_scores_gemma":[0.9157442,0.0003498658,0.07722475,0.0001908709,0.00006520841,0.0004009747,0.0001110734,0.00005033728,0.005862735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004257788,"threshold_uncertainty_score":0.01424378,"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","authors":[{"name":"Neal Madras","is_ca":true},{"name":"Lerna Pehlivan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003437748,0.0004851195,0.001095569,0.003353288,0.001453477,0.001986665,0.001597474,0.001355248,0.005381818],"category_scores_gemma":[0.01835247,0.0006362976,0.000725632,0.001610073,0.00264121,0.002912314,0.001483218,0.001353168,0.0006048754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001685958,"about_ca_system_score_gemma":0.0008850603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00163267,"about_ca_topic_score_gemma":0.001510117,"domain_scores_codex":[0.9981675,0.0007301338,0.00008696627,0.0003313782,0.0004408188,0.0002431245],"domain_scores_gemma":[0.9902169,0.005809393,0.001441929,0.001059405,0.0009763711,0.0004961586],"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.0003162533,0.0001052859,0.006791984,0.00009469825,0.00004582559,0.0004747935,0.0002927624,0.2094086,0.003562171,0.7614214,0.001621787,0.01586444],"study_design_scores_gemma":[0.00003481039,0.00004072854,0.00159776,0.00004001405,0.00001865576,0.0001846784,0.0000606552,0.5760162,0.001696294,0.4192412,0.001029326,0.00003970323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6227669,0.0002912001,0.3632705,0.0004600605,0.00004341294,0.0001344196,0.0003160656,0.0003464621,0.01237094],"genre_scores_gemma":[0.9586025,0.0001346404,0.03772664,0.00008302296,0.00003571444,0.0001809382,0.0004440307,0.0001179542,0.002674499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005381818,"threshold_uncertainty_score":0.01818073,"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","authors":[{"name":"Alan Frieze","is_ca":false},{"name":"Michael Molloy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00607133,0.0004028165,0.001020818,0.001211223,0.000624756,0.002337738,0.001944108,0.001639665,0.002806433],"category_scores_gemma":[0.05508346,0.0006951343,0.0009231177,0.0006755875,0.002441001,0.004143061,0.001463645,0.002631971,0.0002456822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002604848,"about_ca_system_score_gemma":0.001013015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001297873,"about_ca_topic_score_gemma":0.0009460223,"domain_scores_codex":[0.9961652,0.001809517,0.0002062577,0.0005964997,0.0008432315,0.0003793469],"domain_scores_gemma":[0.9201263,0.06683888,0.005310447,0.004367932,0.001722764,0.001633793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007110955,0.000478997,0.007843064,0.0002930215,0.0002020456,0.0005662129,0.0006708438,0.6052099,0.02355453,0.3434837,0.002712077,0.01427455],"study_design_scores_gemma":[0.00005404661,0.00009843938,0.0006824308,0.00001424693,0.00002257067,0.0001582944,0.0000704253,0.9041598,0.004138221,0.09019337,0.0003871582,0.00002104438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7801865,0.0003718637,0.2104298,0.002097093,0.00003320782,0.0001412078,0.0003597367,0.0008807425,0.005499842],"genre_scores_gemma":[0.9745841,0.0001139537,0.02376264,0.0001637442,0.00002155712,0.00009987141,0.0003143317,0.00008746534,0.0008523043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00607133,"threshold_uncertainty_score":0.03210866,"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","authors":[{"name":"Svante Janson","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961965,0.0004126804,0.0008074578,0.002481347,0.001135498,0.001637537,0.001271066,0.001024566,0.00251035],"category_scores_gemma":[0.01570436,0.000783198,0.0006168504,0.001039376,0.002567455,0.002628547,0.001723939,0.0009608147,0.0003051429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002039496,"about_ca_system_score_gemma":0.0008594372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00241225,"about_ca_topic_score_gemma":0.002396367,"domain_scores_codex":[0.9986221,0.0005050141,0.00005242421,0.0003027483,0.0003167089,0.0002011405],"domain_scores_gemma":[0.9895896,0.005794581,0.001578225,0.001153574,0.0008497961,0.001034167],"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.0001722297,0.00005685087,0.002793306,0.00009783702,0.00005405804,0.0002986552,0.0004234897,0.04864218,0.002668794,0.9318259,0.002846002,0.01012061],"study_design_scores_gemma":[0.00007203909,0.00004557396,0.0009243542,0.00002421352,0.00002082901,0.0001676444,0.00008854657,0.1923901,0.001082998,0.8032834,0.00187014,0.00003015612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7938812,0.0007719895,0.1897894,0.001079062,0.00007090872,0.0001552172,0.000395518,0.0006896456,0.01316711],"genre_scores_gemma":[0.9806672,0.0002856312,0.01489826,0.0001947773,0.00004192915,0.0001836345,0.0002030201,0.00008202849,0.003443409],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00251035,"threshold_uncertainty_score":0.01479763,"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","authors":[{"name":"Zhicheng Gao","is_ca":true},{"name":"N. C. Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003281255,0.0004288124,0.0009165538,0.00257501,0.0005556354,0.001548977,0.001551471,0.0009880988,0.002616947],"category_scores_gemma":[0.02423069,0.0005642718,0.0006005212,0.0009000684,0.002733967,0.002866532,0.001352626,0.001032882,0.0003650885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001908656,"about_ca_system_score_gemma":0.0003969048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001230808,"about_ca_topic_score_gemma":0.0008294331,"domain_scores_codex":[0.9985298,0.0005891592,0.00005120776,0.0003665115,0.000292933,0.0001703598],"domain_scores_gemma":[0.9819834,0.01086114,0.002150794,0.00241673,0.001641176,0.0009467112],"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.0008729458,0.0001594596,0.03189813,0.0003355133,0.0001638487,0.0009623756,0.0008246501,0.1746956,0.03120841,0.7245827,0.005116581,0.02917985],"study_design_scores_gemma":[0.00007485973,0.0001312348,0.01059709,0.00006005713,0.00005692058,0.0007871354,0.00015926,0.6612735,0.008143295,0.3163648,0.002282344,0.00006952473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.835353,0.0005644084,0.1562758,0.0008850115,0.00004481046,0.00008318802,0.0006320917,0.0007404462,0.005421267],"genre_scores_gemma":[0.9901612,0.0002197709,0.007623395,0.00008439841,0.00005767725,0.0000868893,0.0004018373,0.0000956738,0.001269092],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003281255,"threshold_uncertainty_score":0.01735312,"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","authors":[{"name":"Alex Brodsky","is_ca":true},{"name":"Shlomo Hoory","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001855166,0.0008433882,0.001029207,0.001114938,0.001778182,0.00174412,0.0009439537,0.001164975,0.01047453],"category_scores_gemma":[0.009237908,0.0006159716,0.001306326,0.0009733063,0.001671471,0.003528061,0.002437754,0.001688205,0.002763152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006326649,"about_ca_system_score_gemma":0.0005363653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003135976,"about_ca_topic_score_gemma":0.0004768901,"domain_scores_codex":[0.9974795,0.0008321533,0.0001226252,0.000647984,0.000656768,0.0002609965],"domain_scores_gemma":[0.994852,0.00148192,0.0006168172,0.00178554,0.0005885531,0.0006751653],"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.004093966,0.001020537,0.02512673,0.0005781153,0.001002399,0.002894727,0.001543666,0.1209837,0.1477156,0.5071183,0.01266055,0.1752618],"study_design_scores_gemma":[0.0003899685,0.001594553,0.0096843,0.0001259572,0.0003731603,0.00335424,0.0007464046,0.3142878,0.06618102,0.5487475,0.05431139,0.0002037321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.662114,0.0004927731,0.302079,0.001056684,0.0004827386,0.0004069077,0.0003890684,0.001096728,0.03188202],"genre_scores_gemma":[0.916739,0.0002360348,0.06874467,0.0005468256,0.0002064445,0.0002449981,0.0005938618,0.000401755,0.01228644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01047453,"threshold_uncertainty_score":0.0350408,"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","authors":[{"name":"Martin Dyer","is_ca":false},{"name":"Catherine Greenhill","is_ca":false},{"name":"Mike Molloy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928861,0.0005484288,0.0008068048,0.001068294,0.001331052,0.001881988,0.0008518627,0.001197894,0.004013185],"category_scores_gemma":[0.01199551,0.0006933883,0.0007125665,0.0003774042,0.002541534,0.00315357,0.001940752,0.001494669,0.0004386276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002033133,"about_ca_system_score_gemma":0.0007864168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002248969,"about_ca_topic_score_gemma":0.002010942,"domain_scores_codex":[0.9991135,0.0003615259,0.0000322066,0.0001782624,0.0001395571,0.0001748967],"domain_scores_gemma":[0.993942,0.00376258,0.0006726653,0.0005900049,0.0002829792,0.0007498221],"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.0004904773,0.0001011734,0.002616675,0.00007840119,0.00005181696,0.0001979603,0.0006062914,0.1752113,0.01355749,0.7943847,0.001835228,0.01086856],"study_design_scores_gemma":[0.00005423575,0.00004266491,0.0003680803,0.00000991909,0.000009694176,0.00003996116,0.00005477092,0.6530799,0.002755663,0.3429246,0.0006377979,0.00002270463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.624688,0.000312965,0.3640587,0.001067427,0.00005777529,0.0001018916,0.0001188938,0.0006437667,0.008950529],"genre_scores_gemma":[0.9701413,0.0001085649,0.02691773,0.0001031246,0.00002236559,0.000116338,0.00009545577,0.000105586,0.002389651],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004013185,"threshold_uncertainty_score":0.01475143,"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","authors":[{"name":"Colin McDiarmid","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01185536,0.001419583,0.002049956,0.004460962,0.001875383,0.003866637,0.002903687,0.002349281,0.007512095],"category_scores_gemma":[0.0376637,0.0009272913,0.002545172,0.001710503,0.006989755,0.007847138,0.006891064,0.004594694,0.0008781763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0033729,"about_ca_system_score_gemma":0.001333099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001707607,"about_ca_topic_score_gemma":0.0006789031,"domain_scores_codex":[0.9947372,0.002479717,0.0002012734,0.0006075967,0.001328454,0.0006457866],"domain_scores_gemma":[0.959734,0.031625,0.001585248,0.00209875,0.003425775,0.001531193],"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.00005696089,0.00002554689,0.0003839048,0.0001109567,0.00003641404,0.00009347445,0.0001542624,0.009629749,0.001473005,0.9818112,0.001927049,0.004297434],"study_design_scores_gemma":[0.00002456084,0.00005045779,0.000490738,0.00007767895,0.00003231246,0.0001807106,0.00004522572,0.2232089,0.002784999,0.770115,0.002941258,0.00004818061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1051944,0.005631744,0.807686,0.007524972,0.0004988844,0.0001324387,0.0003303887,0.0003853176,0.0726159],"genre_scores_gemma":[0.9072257,0.002956111,0.06918854,0.002113925,0.001124368,0.0004692428,0.0003035493,0.0004474217,0.01617115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01185536,"threshold_uncertainty_score":0.06269789,"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","authors":[{"name":"Yulia Dementieva","is_ca":false},{"name":"Penny Haxell","is_ca":true},{"name":"Brendan Nagle","is_ca":false},{"name":"V. Rödl","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003298295,0.0005407383,0.001056003,0.002974767,0.001431031,0.002634611,0.001541621,0.002217637,0.00397124],"category_scores_gemma":[0.03566073,0.0006642301,0.001050084,0.002066971,0.0065061,0.007423413,0.003411647,0.003370405,0.0004712545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001968681,"about_ca_system_score_gemma":0.0007777917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009763314,"about_ca_topic_score_gemma":0.0005225729,"domain_scores_codex":[0.9938864,0.002167057,0.0002850941,0.001482363,0.001541274,0.00063778],"domain_scores_gemma":[0.9537617,0.03191865,0.003871316,0.005350817,0.003640684,0.001456808],"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.0001260124,0.00003692634,0.00315646,0.0001308956,0.00003212606,0.0002861885,0.0004914561,0.01637441,0.005315319,0.9607129,0.001630617,0.01170665],"study_design_scores_gemma":[0.00002515647,0.00008184191,0.0014074,0.00004934402,0.00002142418,0.0002928376,0.0001931499,0.0905256,0.003703895,0.8995575,0.0040965,0.00004532361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3387819,0.001325508,0.6201043,0.002744961,0.0002050707,0.0002414287,0.0009745812,0.0004185977,0.03520368],"genre_scores_gemma":[0.9521537,0.0007151245,0.04142112,0.0006437971,0.0005689373,0.0002387098,0.0005656834,0.000138579,0.003554462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00397124,"threshold_uncertainty_score":0.0174433,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Nicolas Broutin","is_ca":true},{"name":"Bruce Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001351945,0.0002465427,0.0005810271,0.001858685,0.0008294983,0.001264748,0.0007629785,0.0008662484,0.001481751],"category_scores_gemma":[0.0099402,0.0004397815,0.0002535337,0.0006165219,0.002109083,0.001958782,0.001125875,0.0007243237,0.0001760528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009419314,"about_ca_system_score_gemma":0.000328945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005303528,"about_ca_topic_score_gemma":0.0004925209,"domain_scores_codex":[0.999598,0.0001606809,0.00001377342,0.00008197616,0.00008526302,0.00006019921],"domain_scores_gemma":[0.9936891,0.003614289,0.001116213,0.0003648576,0.0005370929,0.0006784404],"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.0001104053,0.00003953905,0.002836816,0.00007797765,0.00003105498,0.0002645067,0.0002594114,0.04186727,0.004139816,0.9434407,0.001801071,0.005131323],"study_design_scores_gemma":[0.00004210197,0.00004297528,0.001467055,0.0000330655,0.00001605327,0.0002816356,0.0001114378,0.1798561,0.001417481,0.8151608,0.001549851,0.00002159448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8631909,0.001125818,0.1268707,0.001065759,0.00004532198,0.00003469698,0.0001211254,0.0001610082,0.007384629],"genre_scores_gemma":[0.992152,0.0001921074,0.006948616,0.000073572,0.00004004949,0.0000248797,0.00005660614,0.00002103411,0.0004909895],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001858685,"threshold_uncertainty_score":0.007149816,"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","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Brendan Nagle","is_ca":false},{"name":"Vojtěch Rödl","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088282,0.0002967873,0.0006150177,0.00153325,0.001106953,0.001870087,0.0007421913,0.000647713,0.002340238],"category_scores_gemma":[0.007013522,0.0005455618,0.0005237807,0.001395602,0.001595208,0.003133502,0.001503606,0.0006244828,0.0001980784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291868,"about_ca_system_score_gemma":0.0002481847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001044059,"about_ca_topic_score_gemma":0.001039556,"domain_scores_codex":[0.9993216,0.0002020052,0.00004896906,0.0001517353,0.0001494557,0.0001262664],"domain_scores_gemma":[0.9954815,0.002446556,0.0008648199,0.0005775368,0.0002282366,0.0004012823],"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.000729176,0.0001835484,0.01174966,0.0001677405,0.000097416,0.0006624339,0.00106739,0.1396715,0.0104005,0.7905333,0.002926608,0.04181078],"study_design_scores_gemma":[0.00004812311,0.0001025463,0.004397333,0.00004138127,0.00003656076,0.0006653839,0.0003513393,0.3420455,0.00431312,0.6445275,0.003434062,0.00003717822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9141976,0.0003619565,0.0786363,0.0002295339,0.00001637299,0.00002476707,0.0001670683,0.0001306758,0.006235676],"genre_scores_gemma":[0.9798104,0.0001549007,0.01818606,0.00006157254,0.00002776377,0.00004299063,0.0001835367,0.00004099449,0.00149183],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002340238,"threshold_uncertainty_score":0.009373248,"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","authors":[{"name":"Dan Hefetz","is_ca":false},{"name":"Michael Krivelevich","is_ca":false},{"name":"Miloš Stojaković","is_ca":false},{"name":"Tibor Szabó","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00368451,0.0009102737,0.002049153,0.002119115,0.001556512,0.005239165,0.002721433,0.003401143,0.006744944],"category_scores_gemma":[0.02964286,0.0008663615,0.001213505,0.0008813937,0.00486645,0.007624186,0.003372329,0.004517928,0.000759372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002538649,"about_ca_system_score_gemma":0.001210518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00139423,"about_ca_topic_score_gemma":0.0008231414,"domain_scores_codex":[0.9968197,0.0008609006,0.0001735977,0.000715272,0.0007198893,0.000710619],"domain_scores_gemma":[0.9733899,0.01833614,0.002377475,0.001813184,0.0009924504,0.003090842],"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.0005525796,0.0001870975,0.003294565,0.0002617637,0.0001408847,0.000389697,0.0008195101,0.03971586,0.01029069,0.9297717,0.003404266,0.0111714],"study_design_scores_gemma":[0.0001243787,0.0001835668,0.0006761801,0.00004551191,0.00005379198,0.0002616972,0.0001695675,0.1948728,0.003281821,0.7984849,0.001774922,0.00007110368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6000707,0.001128259,0.3562633,0.003378859,0.00009159299,0.0002962495,0.0005487786,0.000989143,0.03723311],"genre_scores_gemma":[0.9834292,0.0002543812,0.01278897,0.0004057687,0.00004642785,0.0001608715,0.0001403098,0.00007138793,0.002702736],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006744944,"threshold_uncertainty_score":0.02256411,"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","authors":[{"name":"Luc Devroye","is_ca":true},{"name":"Svante Janson","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002372808,0.0005856627,0.001207188,0.003072494,0.001415558,0.00253437,0.002457268,0.001453402,0.003981458],"category_scores_gemma":[0.02059442,0.0008468541,0.0007701856,0.00169558,0.003173961,0.003997236,0.00295658,0.001928166,0.0004798595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001685295,"about_ca_system_score_gemma":0.0005536236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001200004,"about_ca_topic_score_gemma":0.0007840579,"domain_scores_codex":[0.9985392,0.0003696979,0.00008873841,0.0003290144,0.0004545363,0.0002188189],"domain_scores_gemma":[0.9884124,0.006467078,0.001605058,0.0007772188,0.001212756,0.001525417],"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.0002778213,0.00007539478,0.009021306,0.0001168728,0.00006665169,0.0004548462,0.0004500892,0.06712872,0.007019512,0.903141,0.0008657209,0.01138206],"study_design_scores_gemma":[0.0000474548,0.0000953011,0.003121816,0.00005451253,0.0000348954,0.0005097014,0.0002019842,0.3851955,0.004893014,0.6045024,0.001275145,0.00006827017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7891375,0.0004133416,0.2041087,0.0002671383,0.00003470538,0.00006630358,0.0002073757,0.0001338234,0.005631144],"genre_scores_gemma":[0.9754784,0.0002107517,0.02172218,0.00006816836,0.00004327007,0.00008886524,0.0003212118,0.00005250445,0.002014619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003981458,"threshold_uncertainty_score":0.01331937,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003369348,0.001099826,0.00114867,0.00199461,0.001433263,0.002208472,0.002647365,0.001233468,0.007397578],"category_scores_gemma":[0.02462598,0.0008355014,0.0008831099,0.001597529,0.002883531,0.006614848,0.003046382,0.003436583,0.002097266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003702604,"about_ca_system_score_gemma":0.001250463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003231451,"about_ca_topic_score_gemma":0.003842212,"domain_scores_codex":[0.9981152,0.0004677493,0.00006646387,0.0004093487,0.0004514396,0.0004898284],"domain_scores_gemma":[0.9780203,0.01530306,0.001273316,0.002496463,0.001617191,0.00128973],"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.001688701,0.0003001385,0.01248161,0.0005529952,0.0001939847,0.0005476141,0.001266143,0.2269506,0.03378496,0.6380261,0.02235027,0.06185692],"study_design_scores_gemma":[0.00006697055,0.0001057493,0.002458092,0.000138665,0.00007217849,0.0002432834,0.0001614371,0.7320728,0.008327266,0.2515324,0.004745177,0.00007596266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2088227,0.002861469,0.7576309,0.003373703,0.0002385839,0.0001054229,0.001427618,0.001782737,0.02375682],"genre_scores_gemma":[0.9235349,0.001808462,0.05872111,0.001138957,0.0004528995,0.0003675181,0.001340142,0.0009339,0.01170211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007397578,"threshold_uncertainty_score":0.02686447,"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","authors":[{"name":"Luc Devroye","is_ca":true},{"name":"Omar Fawzi","is_ca":true},{"name":"Nicolás Fraiman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001703809,0.0003862257,0.0007510515,0.001365472,0.001000708,0.001670574,0.001377828,0.0009909293,0.003538722],"category_scores_gemma":[0.01363343,0.0006587169,0.000606011,0.0006925017,0.001693456,0.002728841,0.001452049,0.001287084,0.0003300243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001967169,"about_ca_system_score_gemma":0.0005769567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002292698,"about_ca_topic_score_gemma":0.002637016,"domain_scores_codex":[0.9992908,0.0001647764,0.00003130097,0.0001626464,0.0001833999,0.0001669515],"domain_scores_gemma":[0.9915065,0.005106238,0.00117243,0.0006710157,0.0006679886,0.0008758904],"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.0002723638,0.00008670207,0.01357133,0.0002012048,0.00007057223,0.0005600857,0.001000116,0.1149513,0.01798101,0.8253675,0.003335725,0.02260227],"study_design_scores_gemma":[0.00007479035,0.0001313943,0.006761667,0.00005165303,0.00005184679,0.0008235021,0.0002741003,0.556806,0.003485167,0.4274601,0.00402159,0.00005804294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8157262,0.0009477459,0.1734636,0.0004363728,0.00002466962,0.00008732721,0.0003953932,0.000304433,0.008614294],"genre_scores_gemma":[0.9799867,0.000274702,0.01678313,0.0001107561,0.00003485623,0.00006679474,0.0002269511,0.00007473824,0.002441387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003538722,"threshold_uncertainty_score":0.01427281,"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","authors":[{"name":"Frédéric Magniez","is_ca":false},{"name":"Ashwin Nayak","is_ca":true},{"name":"Miklós Sántha","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006818144,0.001257647,0.001882444,0.001570823,0.001402181,0.004026255,0.004082324,0.002253836,0.009384719],"category_scores_gemma":[0.03384617,0.0005932011,0.002037799,0.001461568,0.003524909,0.008015186,0.004983535,0.006049405,0.001430407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004547804,"about_ca_system_score_gemma":0.003837096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002049691,"about_ca_topic_score_gemma":0.002390715,"domain_scores_codex":[0.9878653,0.003506224,0.0005306982,0.001792168,0.004563416,0.00174215],"domain_scores_gemma":[0.9584361,0.03093414,0.001445343,0.005457627,0.002904239,0.000822477],"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.00132301,0.0005703892,0.002963098,0.0004560229,0.0001833423,0.0002569195,0.0004060338,0.2190595,0.0169903,0.6563666,0.01041978,0.09100495],"study_design_scores_gemma":[0.0001296472,0.0001210487,0.0005673023,0.00005408752,0.00007408224,0.000100182,0.00004091444,0.6930017,0.008147062,0.2954097,0.002306384,0.00004786814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1142129,0.001524013,0.855591,0.003739622,0.000356984,0.0002737765,0.0005142429,0.001665157,0.02212232],"genre_scores_gemma":[0.7804252,0.0005411851,0.2090883,0.00107582,0.0004299376,0.0004880397,0.0006201892,0.0005211626,0.006810164],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009384719,"threshold_uncertainty_score":0.03605825,"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","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Colin Cooper","is_ca":false},{"name":"Tom Friedetzky","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000901482,0.0005710797,0.0008254439,0.0007615173,0.0005376452,0.001041357,0.001030413,0.000868746,0.003829355],"category_scores_gemma":[0.00693691,0.0004124038,0.0006291518,0.0006783637,0.0008670655,0.001881126,0.001261459,0.0007895191,0.000389423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006707765,"about_ca_system_score_gemma":0.0004249324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001188668,"about_ca_topic_score_gemma":0.001684953,"domain_scores_codex":[0.9994575,0.0001728446,0.00002058761,0.00009912465,0.00009385201,0.000155943],"domain_scores_gemma":[0.993236,0.005605957,0.000382496,0.0003027669,0.000152626,0.0003202531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001382353,0.00035443,0.004800284,0.0002495548,0.0001197771,0.0006842423,0.0005525175,0.8441635,0.02362044,0.07320347,0.002299676,0.04856976],"study_design_scores_gemma":[0.00005499822,0.00009629309,0.00029967,0.000009061772,0.0000154821,0.00004882228,0.00004628201,0.9640438,0.001714206,0.03329913,0.0003650484,0.000007263764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8065007,0.0002543622,0.1861957,0.0004559436,0.00002381257,0.0001340975,0.0001278421,0.0006373148,0.005670199],"genre_scores_gemma":[0.9490497,0.0001179445,0.04753097,0.00008998824,0.00002077939,0.0001204665,0.0001811757,0.0001256872,0.002763236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003829355,"threshold_uncertainty_score":0.01281047,"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","authors":[{"name":"Luc Devroye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003461796,0.0005164586,0.001154834,0.00294578,0.001051223,0.001930291,0.001787954,0.001248378,0.00618203],"category_scores_gemma":[0.0325048,0.0006317789,0.0008842992,0.002396242,0.00264961,0.004124184,0.003107495,0.001672268,0.0009437689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002002828,"about_ca_system_score_gemma":0.001292583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106497,"about_ca_topic_score_gemma":0.0009754666,"domain_scores_codex":[0.9970589,0.000927318,0.0001496223,0.0003684587,0.0009276603,0.0005680292],"domain_scores_gemma":[0.9712569,0.017781,0.002750123,0.003776837,0.003329138,0.001106121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006117856,0.0001112428,0.009855498,0.0003229465,0.0001268594,0.0007311424,0.0005597068,0.2716549,0.00625391,0.6583108,0.01125319,0.04020797],"study_design_scores_gemma":[0.00004237546,0.00009166884,0.001213707,0.00005346104,0.00004062031,0.0004658996,0.0001122404,0.7972772,0.002777009,0.19513,0.002765704,0.00003021502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4417989,0.002013725,0.5259132,0.001465415,0.00009743804,0.0002698929,0.001248837,0.001854056,0.02533853],"genre_scores_gemma":[0.9592751,0.000600416,0.03187514,0.0003901657,0.0001443294,0.000307679,0.001037461,0.0003469858,0.00602285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00618203,"threshold_uncertainty_score":0.02068102,"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","authors":[{"name":"Bernd Gärtner","is_ca":false},{"name":"Falk Tschirschnitz","is_ca":false},{"name":"Emo Welzl","is_ca":false},{"name":"József Solymosi","is_ca":true},{"name":"Pável Valtr","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001200307,0.0004405263,0.0008319169,0.0006308571,0.001105948,0.001253389,0.001288588,0.00118808,0.01015395],"category_scores_gemma":[0.005927761,0.0004763799,0.0009694337,0.0008948449,0.001920982,0.001817259,0.001710324,0.001231491,0.001218551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001042897,"about_ca_system_score_gemma":0.0007740957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004499533,"about_ca_topic_score_gemma":0.003372647,"domain_scores_codex":[0.9982804,0.0004377537,0.00007387453,0.0003444687,0.0005128021,0.0003506672],"domain_scores_gemma":[0.9966677,0.001569535,0.0005439563,0.0006790556,0.0002843311,0.0002555316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001807484,0.0003676248,0.006667229,0.0002257944,0.0001520338,0.0009584644,0.0002992737,0.7559163,0.01669299,0.1439104,0.003442296,0.06956006],"study_design_scores_gemma":[0.0002142966,0.0002595594,0.001162414,0.00003200419,0.00003469079,0.0001678223,0.0001499947,0.9339766,0.01275181,0.04730235,0.003904855,0.0000436348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4257527,0.0002709663,0.5620812,0.0005933576,0.0001250549,0.0003428122,0.0002833984,0.0005892927,0.009961278],"genre_scores_gemma":[0.8746708,0.0001316492,0.1171968,0.0001191404,0.00003002099,0.0001406424,0.0003582569,0.0000979921,0.007254678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01015395,"threshold_uncertainty_score":0.03396833,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Laura Eslava","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004411565,0.000364354,0.001168627,0.002453701,0.001559559,0.002857114,0.00156018,0.001015012,0.003050501],"category_scores_gemma":[0.03196256,0.0008218138,0.0008825336,0.001059243,0.004441752,0.004125998,0.002826379,0.002001997,0.0004668096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00225796,"about_ca_system_score_gemma":0.0007087148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002530916,"about_ca_topic_score_gemma":0.002682311,"domain_scores_codex":[0.9979898,0.0007743847,0.00008044931,0.0003762561,0.000473866,0.0003053143],"domain_scores_gemma":[0.9825943,0.01188959,0.001566002,0.001130988,0.001505607,0.001313521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007574055,0.00002618202,0.004223089,0.00006150016,0.00002664576,0.0001913049,0.0005488548,0.03727216,0.001989378,0.949639,0.0007501683,0.005196017],"study_design_scores_gemma":[0.00002870164,0.00004030793,0.001947858,0.00004170492,0.000016695,0.0002386826,0.0002091159,0.2467965,0.001249203,0.7478341,0.001563962,0.00003310426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5608802,0.0006690432,0.4273213,0.001462723,0.00005802505,0.00006403369,0.0002248185,0.0002854756,0.009034414],"genre_scores_gemma":[0.9800792,0.0002706457,0.01549851,0.0001454545,0.00007346932,0.00008137867,0.000122725,0.0000858289,0.003642705],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004411565,"threshold_uncertainty_score":0.02333087,"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","authors":[{"name":"Alex Brodsky","is_ca":true},{"name":"Nicholas Pippenger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002282158,0.0004756849,0.0004938669,0.001101908,0.0007290522,0.002986148,0.000812923,0.00110627,0.005702327],"category_scores_gemma":[0.0189304,0.0003455121,0.0006859694,0.0005759235,0.002550563,0.006439457,0.001246152,0.001621674,0.0007735526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001130638,"about_ca_system_score_gemma":0.000698628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009293084,"about_ca_topic_score_gemma":0.0007010488,"domain_scores_codex":[0.9990772,0.0002893744,0.00005845421,0.0001817437,0.0002571561,0.000135997],"domain_scores_gemma":[0.9867987,0.009759557,0.000607908,0.001022423,0.001318349,0.0004930014],"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.0001393032,0.0000319237,0.001280002,0.00008858871,0.00001911611,0.0001192082,0.0003547941,0.02574957,0.008233767,0.9408205,0.001433076,0.02173021],"study_design_scores_gemma":[0.0000227389,0.00002932726,0.0003520081,0.00003619389,0.00002120558,0.0001097023,0.0001243639,0.2808333,0.01391455,0.7020178,0.002511968,0.00002688532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3725602,0.0004544094,0.5998454,0.002548166,0.0001092606,0.00008989891,0.0002235401,0.0005032579,0.02366585],"genre_scores_gemma":[0.9205443,0.000288386,0.07222049,0.0002873603,0.00006335169,0.0001260389,0.0001675512,0.0001908591,0.006111688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005702327,"threshold_uncertainty_score":0.01907617,"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","authors":[{"name":"Sébastien Bubeck","is_ca":false},{"name":"Luc Devroye","is_ca":true},{"name":"Gábor Lugosi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00356886,0.0008391372,0.00176036,0.001329067,0.00129369,0.002035903,0.001961374,0.002108069,0.00332323],"category_scores_gemma":[0.02554328,0.001032689,0.001221864,0.001135206,0.002189477,0.003521597,0.002258151,0.001888275,0.0008177579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001376875,"about_ca_system_score_gemma":0.0008236721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008287544,"about_ca_topic_score_gemma":0.001159143,"domain_scores_codex":[0.998149,0.000865062,0.0001069141,0.0004559954,0.0002451794,0.0001777037],"domain_scores_gemma":[0.9797472,0.01653088,0.001259213,0.001180846,0.000624586,0.000657333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005358639,0.0001535648,0.006693902,0.0005259679,0.0001589397,0.0004407051,0.0007012587,0.5766267,0.005001923,0.3381758,0.006369334,0.06461619],"study_design_scores_gemma":[0.00004370733,0.00004175226,0.0002288771,0.0000272106,0.00001603768,0.0000913251,0.00003950767,0.8134655,0.001154268,0.1839199,0.0009612684,0.00001048154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2849437,0.0008839428,0.7066562,0.001357158,0.00007956924,0.0001441873,0.0002464552,0.0009447068,0.004743996],"genre_scores_gemma":[0.7340002,0.0004280945,0.2598999,0.0002929542,0.00007727636,0.0002097558,0.0004812324,0.0002838865,0.004326737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00356886,"threshold_uncertainty_score":0.01887417,"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","authors":[{"name":"Béla Bollobás","is_ca":false},{"name":"Jeong Han Kim","is_ca":false},{"name":"Jacques Verstraëte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275214,0.0003032526,0.000622633,0.001501034,0.0007659555,0.001118161,0.0007860003,0.0006135646,0.002195538],"category_scores_gemma":[0.01192323,0.000450157,0.0005822345,0.0006236177,0.001642823,0.001862458,0.00151117,0.0008047681,0.000286484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000882955,"about_ca_system_score_gemma":0.0003850987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008659038,"about_ca_topic_score_gemma":0.000741092,"domain_scores_codex":[0.9986532,0.0005208277,0.00005724782,0.0002590094,0.0003334951,0.0001762489],"domain_scores_gemma":[0.9899767,0.005485606,0.001760952,0.001396776,0.0007162651,0.0006638188],"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.0006924726,0.0001393928,0.01452756,0.0003531221,0.0001421007,0.001032385,0.001138192,0.08038769,0.01535038,0.8438443,0.005973579,0.03641885],"study_design_scores_gemma":[0.00008989518,0.0001401174,0.003289862,0.00005194643,0.00005171821,0.001052512,0.0002052058,0.3154507,0.006361345,0.6684701,0.004807665,0.0000288933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8304664,0.000565601,0.1541249,0.0008444058,0.0000487735,0.0001151491,0.0002818355,0.0004685032,0.01308437],"genre_scores_gemma":[0.9896111,0.0001445545,0.008515707,0.0001263726,0.00003940344,0.00005702195,0.0001772307,0.00004659836,0.001282034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002195538,"threshold_uncertainty_score":0.007344782,"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","authors":[{"name":"Mark Holmes","is_ca":false},{"name":"Thomas S. Salisbury","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001650985,0.0006196331,0.00133257,0.001912827,0.001199641,0.002202306,0.001442055,0.001862743,0.005848688],"category_scores_gemma":[0.01143883,0.0004853078,0.0008854678,0.001072754,0.003402262,0.00238237,0.002169698,0.001482292,0.000532377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001348434,"about_ca_system_score_gemma":0.0003994137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001523136,"about_ca_topic_score_gemma":0.0009279037,"domain_scores_codex":[0.9974778,0.001156438,0.0001252743,0.0005447523,0.0003545699,0.000341049],"domain_scores_gemma":[0.9944116,0.002551417,0.000945608,0.0008684937,0.0004812518,0.0007415087],"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.0001105113,0.00005216105,0.001751972,0.00008019117,0.00003463119,0.000515462,0.0002090938,0.05449531,0.0009421624,0.9369794,0.001773485,0.003055598],"study_design_scores_gemma":[0.00005184841,0.00004779211,0.0006754603,0.00002843219,0.0000210294,0.0004485846,0.0001211457,0.3188389,0.0005154312,0.6760652,0.003153519,0.00003274798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4963934,0.001561421,0.4144707,0.002984977,0.0003031151,0.0002178985,0.001196831,0.0003771889,0.08249453],"genre_scores_gemma":[0.9815474,0.0002420782,0.01272615,0.0003180286,0.0001128051,0.00009904708,0.0002160237,0.00003417483,0.004704339],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005848688,"threshold_uncertainty_score":0.01956576,"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","authors":[{"name":"David Aldous","is_ca":false},{"name":"Shankar Bhamidi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00186622,0.0003823329,0.0005887067,0.001757731,0.0005178946,0.001015827,0.001039939,0.001001536,0.001850953],"category_scores_gemma":[0.009543287,0.0004800837,0.0003027955,0.0008220694,0.00120439,0.002861803,0.000919827,0.0006137602,0.0002278123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001272701,"about_ca_system_score_gemma":0.0004799437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002174835,"about_ca_topic_score_gemma":0.001961363,"domain_scores_codex":[0.9994979,0.0002274383,0.00001522331,0.00009254171,0.0001004913,0.00006641684],"domain_scores_gemma":[0.9961487,0.002437765,0.0006005969,0.0002230281,0.000334854,0.0002549627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001645473,0.00003871121,0.002638853,0.00007082576,0.00003492147,0.0001462499,0.0001543162,0.5531942,0.001409282,0.4288386,0.002012714,0.01129687],"study_design_scores_gemma":[0.0000248566,0.00001313291,0.0009165034,0.00001232295,0.00000893216,0.00004793141,0.00002545108,0.801079,0.0003176843,0.1966881,0.0008498906,0.00001615586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6584562,0.0005965434,0.3325978,0.001583396,0.00004801901,0.00008267321,0.0008709008,0.0002115653,0.005552889],"genre_scores_gemma":[0.9691786,0.0005709518,0.02474032,0.0001654391,0.00006954509,0.0001816392,0.0005118883,0.00004584287,0.004535738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002174835,"threshold_uncertainty_score":0.009869635,"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","authors":[{"name":"Dmitry Panchenko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003310572,0.001075962,0.002118337,0.001276491,0.001806009,0.003649054,0.002949279,0.002565594,0.005127561],"category_scores_gemma":[0.01314118,0.0009467956,0.00142639,0.00129425,0.003951119,0.005761648,0.001792848,0.003346938,0.0004537704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003336939,"about_ca_system_score_gemma":0.001757944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007635538,"about_ca_topic_score_gemma":0.005744824,"domain_scores_codex":[0.9986392,0.0005701227,0.00003953562,0.0001803254,0.0002380615,0.0003327263],"domain_scores_gemma":[0.9885147,0.00872549,0.001203914,0.0005349519,0.0003936938,0.0006272164],"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.0002793251,0.0001043444,0.001509672,0.0002114112,0.00006381177,0.0003142765,0.000147057,0.1713868,0.002453745,0.8158197,0.004636304,0.003073593],"study_design_scores_gemma":[0.00007286121,0.0000345491,0.0005156422,0.00002997027,0.00002686456,0.0001140116,0.00005291841,0.6719624,0.0005991677,0.3260927,0.0004670347,0.00003177381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7011578,0.002767215,0.2366074,0.01157152,0.0002139427,0.00009531261,0.0008057129,0.0006339535,0.04614701],"genre_scores_gemma":[0.9829973,0.0004837567,0.01163359,0.0005182405,0.0001422937,0.00007422451,0.0002454713,0.0001265229,0.003778665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007635538,"threshold_uncertainty_score":0.02421129,"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","authors":[{"name":"Nicholas Pippenger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003066641,0.0007223223,0.001056973,0.001774022,0.001118597,0.002598547,0.00145398,0.001162324,0.006148535],"category_scores_gemma":[0.03143372,0.0007742259,0.001285929,0.001190451,0.003662878,0.008081424,0.001609273,0.003199527,0.0008835643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002584424,"about_ca_system_score_gemma":0.001069206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001051313,"about_ca_topic_score_gemma":0.0007403642,"domain_scores_codex":[0.9962315,0.0009430104,0.0002848693,0.0009544021,0.001086851,0.000499322],"domain_scores_gemma":[0.9657453,0.02482118,0.002045266,0.003228692,0.002976539,0.001182933],"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.000696419,0.000140339,0.00568775,0.000428034,0.0001187165,0.0003302699,0.0005219042,0.07174565,0.02152661,0.836452,0.005639603,0.05671275],"study_design_scores_gemma":[0.00005853361,0.000206835,0.002853177,0.00008638884,0.00004625455,0.0005874262,0.00008606895,0.2385951,0.009343993,0.7393757,0.008643067,0.000117441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3564701,0.002038567,0.6064399,0.004346414,0.0003459903,0.0001614267,0.001447782,0.001153862,0.02759591],"genre_scores_gemma":[0.897415,0.000931058,0.0921415,0.0005898885,0.0004871681,0.000326826,0.0007009978,0.0003259428,0.007081555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006148535,"threshold_uncertainty_score":0.02056897,"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","authors":[{"name":"Ehsan Ebrahimzadeh","is_ca":true},{"name":"Linda Farczadi","is_ca":true},{"name":"Pu Gao","is_ca":true},{"name":"Abbas Mehrabian","is_ca":true},{"name":"Cristiane M. Sato","is_ca":true},{"name":"Nick Wormald","is_ca":true},{"name":"Jonathan Zung","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003792681,0.0006158967,0.001107655,0.002943692,0.001517068,0.001965658,0.002194698,0.001853514,0.003283873],"category_scores_gemma":[0.03195477,0.000891935,0.0006821875,0.001224414,0.003453074,0.005344937,0.0023758,0.001331622,0.0003391509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002305433,"about_ca_system_score_gemma":0.0005923728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001517485,"about_ca_topic_score_gemma":0.001571457,"domain_scores_codex":[0.9985884,0.0007082087,0.00005718823,0.0002875606,0.0001800907,0.0001786257],"domain_scores_gemma":[0.9645631,0.02789303,0.003091442,0.001476081,0.001272856,0.00170342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004803831,0.00007765547,0.008329854,0.0002947675,0.0001230012,0.0003662528,0.0007684638,0.2459675,0.004659102,0.7209257,0.004545581,0.01346165],"study_design_scores_gemma":[0.00006078584,0.00007908689,0.001418709,0.00007328152,0.00004293049,0.0002414049,0.0001378306,0.5894714,0.001151923,0.4050186,0.002260212,0.00004394805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6797806,0.002297199,0.3055641,0.002577301,0.0001153117,0.00009172325,0.0005900287,0.0003259743,0.008657709],"genre_scores_gemma":[0.9627022,0.001499749,0.0323172,0.0002082904,0.0001698835,0.0002200406,0.0003991421,0.0001386563,0.002345002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003792681,"threshold_uncertainty_score":0.02005792,"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","authors":[{"name":"Michael Molloy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00438029,0.001047015,0.001133483,0.002008908,0.001800179,0.002842361,0.001982857,0.002236631,0.0041872],"category_scores_gemma":[0.02369041,0.001259664,0.0021664,0.0009100556,0.003540352,0.005826829,0.003173298,0.004013933,0.0008732736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002413502,"about_ca_system_score_gemma":0.0009829557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001939661,"about_ca_topic_score_gemma":0.002194938,"domain_scores_codex":[0.9979122,0.0008991776,0.00008485807,0.0004371078,0.0003808067,0.0002858189],"domain_scores_gemma":[0.977958,0.01627261,0.002251063,0.001721158,0.0007903608,0.001006864],"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.0002486793,0.00008171555,0.003247037,0.00008889353,0.00006993034,0.0002185283,0.0006676951,0.1103531,0.004881585,0.8677556,0.001456056,0.01093114],"study_design_scores_gemma":[0.00003929744,0.0000286721,0.0004315519,0.00002196695,0.00001905098,0.00009893217,0.00005195575,0.601771,0.001884425,0.3945195,0.001094997,0.00003861506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1503901,0.0004739986,0.8428118,0.001064723,0.00005394787,0.0001475951,0.000158595,0.0003883454,0.004510846],"genre_scores_gemma":[0.7853365,0.0007263295,0.2036121,0.0005066986,0.0001749459,0.0009666309,0.0005540002,0.0003402362,0.007782482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00438029,"threshold_uncertainty_score":0.02316546,"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","authors":[{"name":"András Telcs","is_ca":false},{"name":"Nicholas Wormald","is_ca":true},{"name":"Sanming Zhou","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001785536,0.0003577719,0.0008532672,0.00166212,0.0006527963,0.001617408,0.001028622,0.001180148,0.002936233],"category_scores_gemma":[0.009108109,0.0005344544,0.0008036458,0.0005955838,0.00208726,0.001685084,0.001137894,0.0008894222,0.0003292829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291234,"about_ca_system_score_gemma":0.000556341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002452177,"about_ca_topic_score_gemma":0.002062363,"domain_scores_codex":[0.9990778,0.0003517273,0.00003657735,0.0002040489,0.0001721738,0.0001575863],"domain_scores_gemma":[0.9918125,0.005079236,0.001206925,0.0006938405,0.0005891565,0.0006183293],"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.0002334388,0.00005649348,0.003696641,0.0000761522,0.00006596536,0.0006806004,0.0004479664,0.0964929,0.00592357,0.885576,0.001471917,0.005278394],"study_design_scores_gemma":[0.00009028806,0.00006665409,0.001816518,0.00002368936,0.00002072979,0.0001450019,0.00008675658,0.4065827,0.001620714,0.5884701,0.001023774,0.00005298668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8366778,0.0002560063,0.1540956,0.0007261134,0.00005400045,0.00009851179,0.0002541715,0.0003619927,0.007475765],"genre_scores_gemma":[0.990772,0.0001104536,0.006165189,0.000108465,0.00003142665,0.00009230377,0.0001358538,0.00004312741,0.002541181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002936233,"threshold_uncertainty_score":0.009822726,"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","authors":[{"name":"Michael Krivelevich","is_ca":false},{"name":"Benny Sudakov","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410742,0.0002945244,0.0007703391,0.001671559,0.000776063,0.001332137,0.0008714105,0.0007321411,0.003320196],"category_scores_gemma":[0.01105225,0.0004399577,0.0005645622,0.0008617735,0.00166562,0.002180768,0.001305795,0.001011475,0.0004299979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001122,"about_ca_system_score_gemma":0.0004522417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008764167,"about_ca_topic_score_gemma":0.001015857,"domain_scores_codex":[0.9981962,0.0006036121,0.00007444624,0.000400711,0.0005142163,0.0002107964],"domain_scores_gemma":[0.9893055,0.00644839,0.001351034,0.001287085,0.0007946517,0.0008133447],"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.0003837002,0.0001115963,0.006557917,0.0001712117,0.00007722357,0.0005736253,0.0004477273,0.03660063,0.009073575,0.9243069,0.005765964,0.0159299],"study_design_scores_gemma":[0.0000857797,0.0000680005,0.001933269,0.00002780881,0.00003773359,0.0005317793,0.000110974,0.1867936,0.003584588,0.8027577,0.004045995,0.00002265273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7581401,0.0004565451,0.2188163,0.001681071,0.0000507177,0.000107665,0.000755387,0.0005888775,0.01940333],"genre_scores_gemma":[0.975916,0.0001893431,0.01950227,0.0002124868,0.00006914962,0.00008999874,0.0005478871,0.00006932909,0.003403477],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003320196,"threshold_uncertainty_score":0.01110715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}