{"meta":{"query_hash":"2bb9cd8d5902","filters":{"venue":"Random Structures and Algorithms"},"cohort_total":109,"direct_labels_cover":0,"predictions_cover":109,"exported":109,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2bb9cd8d5902","api":"https://metacan.xera.ac/api/v1/cohort?venue=Random+Structures+and+Algorithms"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015114203494403162,"score_gpt":0.2716785362266982,"score_spread":0.256564332732295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488446430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9009304,0.0028798685,0.08960737,0.0007617342,0.0010048343,0.0014937229,0.000066873414,0.00004640287,0.0032087741],"genre_scores_gemma":[0.9732144,0.00023534885,0.025829785,0.000068591464,0.00018776546,0.000016135496,0.000002022892,0.000028633473,0.0004173581],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998519,0.00043879965,0.00042740745,0.00015555983,0.00027060485,0.00018859809],"domain_scores_gemma":[0.9970578,0.0021072307,0.00031041517,0.00039604524,0.000078368306,0.00005011749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014275276,0.00016189784,0.00051541295,0.000032796797,0.00021896277,0.000018681141,0.00024887425,0.000064736334,0.0000085679685],"category_scores_gemma":[0.00048813372,0.00007276821,0.00025071,0.00009901488,0.00026242356,0.000020169822,0.00010793743,0.00013362907,1.2616562e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005534273,0.00023034151,0.00068095134,0.0015743233,0.0015232973,0.000006426782,0.009032185,0.0002318621,0.1401388,0.25120473,0.0049719606,0.5848708],"study_design_scores_gemma":[0.08240771,0.0004996967,0.0059737307,0.0008371544,0.0010526578,0.000168462,0.0015755037,0.109135374,0.11609106,0.659934,0.021098582,0.001226088],"about_ca_topic_score_codex":0.000038169386,"about_ca_topic_score_gemma":0.000009198062,"teacher_disagreement_score":0.58364475,"about_ca_system_score_codex":0.000005250579,"about_ca_system_score_gemma":0.0000132218065,"threshold_uncertainty_score":0.29674014},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013121963399212858,"score_gpt":0.26789424007888807,"score_spread":0.2547722766796752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492951456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05083208,0.0005488174,0.9472498,0.00017098915,0.0003161951,0.00041444818,0.000026772848,0.000041226285,0.00039964417],"genre_scores_gemma":[0.97956324,0.00014723066,0.01970568,0.0002641889,0.00021557343,0.000026167196,0.0000047272674,0.000029130248,0.000044077085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878395,0.00008703797,0.00029681323,0.00033845895,0.00017778088,0.0003159683],"domain_scores_gemma":[0.99712175,0.002454611,0.00008039054,0.00017215712,0.000026283005,0.00014481292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037726838,0.00023668539,0.0005276872,0.00006922352,0.00010301377,0.000083865976,0.000087519446,0.000131344,0.00003428322],"category_scores_gemma":[0.0010406515,0.00016711662,0.000045730092,0.00009084397,0.0000738772,0.000040161296,0.000048971935,0.00024042594,9.2016137e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014134482,0.0000665169,0.000099803816,0.00022906993,0.00006110421,0.00003503167,0.0005378462,0.00017029014,0.000025396765,0.65375483,0.0003249175,0.34328172],"study_design_scores_gemma":[0.013463019,0.00025017766,0.0006430805,0.000096192794,0.00004846534,0.0000328083,0.000037735084,0.16739504,0.000028455088,0.81755257,0.0001797291,0.00027273592],"about_ca_topic_score_codex":0.000023250977,"about_ca_topic_score_gemma":0.000033038577,"teacher_disagreement_score":0.92873114,"about_ca_system_score_codex":0.000010182082,"about_ca_system_score_gemma":0.000009531536,"threshold_uncertainty_score":0.6814818},"labels":[],"label_agreement":null},{"id":"W1517540866","doi":"10.1002/rsa.20693","title":"The cutoff phenomenon for random birth and death chains","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Statistics Canada","funders":"","keywords":"Cutoff; Pi; Tridiagonal matrix; Mathematics; Combinatorics; Block (permutation group theory); Random matrix; Distribution (mathematics); Stationary distribution; Markov chain; Matrix (chemical analysis); Physics; Mathematical analysis; Quantum mechanics; Statistics; Chemistry; Eigenvalues and eigenvectors; Geometry","score_opus":0.045748252455866945,"score_gpt":0.33821568476917685,"score_spread":0.2924674323133099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517540866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09129176,0.0335886,0.8522425,0.0026872233,0.0048472136,0.008907953,0.0020183031,0.000340529,0.004075894],"genre_scores_gemma":[0.40849584,0.062689975,0.46983954,0.0011358703,0.01547892,0.0041558715,0.00023374303,0.001008594,0.03696161],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746615,0.00030420636,0.0006101818,0.0007505861,0.000292819,0.00057603023],"domain_scores_gemma":[0.994783,0.003759144,0.0004269773,0.00066467334,0.00014895134,0.0002172522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017420525,0.0006204921,0.001165598,0.0000944895,0.00065690855,0.00033058677,0.00034062486,0.00038556766,0.00000927907],"category_scores_gemma":[0.0006979571,0.00032129162,0.00032918053,0.000042387903,0.00019599636,0.00004475328,0.00053647923,0.0004298557,1.9825602e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049544442,0.000049116337,0.00010785122,0.002274641,0.0012827723,0.000017320519,0.0025189447,0.000009245468,0.00035644005,0.27690277,0.003562578,0.7079639],"study_design_scores_gemma":[0.02952609,0.00016102182,0.00008238095,0.0003025919,0.0003963289,0.000052323678,0.0003057969,0.006853523,0.0003479432,0.89011383,0.07097214,0.0008860314],"about_ca_topic_score_codex":0.00002502044,"about_ca_topic_score_gemma":0.00002472332,"teacher_disagreement_score":0.70707786,"about_ca_system_score_codex":0.000041266914,"about_ca_system_score_gemma":0.000078150166,"threshold_uncertainty_score":0.99992394},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Line (geometry); Mathematics; Geometry","score_opus":0.01310099690627803,"score_gpt":0.23891851597771457,"score_spread":0.22581751907143655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562525740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07673593,0.0020644634,0.9194102,0.0007838912,0.0003251284,0.00014372282,0.000003253242,0.00004697844,0.00048637792],"genre_scores_gemma":[0.8437169,0.00018370396,0.15551922,0.0003248173,0.000113370035,0.0000035666524,0.0000041993703,0.000003882105,0.00013032842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938136,0.000049837385,0.000112221445,0.0002190505,0.00012541722,0.00011212808],"domain_scores_gemma":[0.99967164,0.00008194869,0.000033285898,0.000102566344,0.0000358266,0.00007472887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017268126,0.00008069579,0.00012358172,0.000056210047,0.00012950001,0.00012243725,0.000063377694,0.00003281922,0.000012659476],"category_scores_gemma":[0.000047452115,0.00006982868,0.00001947553,0.00013089452,0.000026129568,0.00014919128,0.000038492904,0.0000581967,0.0000011946883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027087333,0.000025668734,0.000087322034,0.000021682901,0.000037996077,0.000006283346,0.00033591024,0.0005276526,0.0008406722,0.35838208,0.00015825016,0.63954943],"study_design_scores_gemma":[0.011432611,0.0002584946,0.020364001,0.000024299412,0.000030609463,0.00028783348,0.00003252998,0.15134943,0.015431738,0.7830842,0.017135603,0.0005686651],"about_ca_topic_score_codex":0.0000052132445,"about_ca_topic_score_gemma":0.0000015142394,"teacher_disagreement_score":0.766981,"about_ca_system_score_codex":0.0000038034157,"about_ca_system_score_gemma":0.000016331369,"threshold_uncertainty_score":0.2847531},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03529323304074504,"score_gpt":0.31872748233742687,"score_spread":0.2834342492966818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1702956999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022088869,0.0026111421,0.9708604,0.0003993147,0.0015143913,0.0010828861,0.00039038324,0.00012906248,0.000923533],"genre_scores_gemma":[0.92545855,0.00071260624,0.072038606,0.00013603274,0.0010512619,0.00017591592,0.000036711095,0.00011911321,0.00027117168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756014,0.0001082131,0.0007125892,0.0006958148,0.0004000694,0.000523171],"domain_scores_gemma":[0.99670875,0.0024301591,0.0002786154,0.0003506062,0.000067744986,0.0001640998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005366833,0.0005207243,0.0012418398,0.00019080404,0.00013920579,0.00015197274,0.00031353367,0.00042645875,0.00010944756],"category_scores_gemma":[0.0016100276,0.00035318517,0.00018556308,0.000098887314,0.00008358999,0.00009088447,0.00045103388,0.0006558218,0.000001937466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022675802,0.000095586314,0.00007012936,0.0024879938,0.0004476988,0.00029694694,0.0016541295,0.000127585,0.00045891796,0.7217855,0.0009307432,0.26937723],"study_design_scores_gemma":[0.011908868,0.0000453776,0.000101975966,0.00086444913,0.00012614757,0.000035129917,0.00010039003,0.010133527,0.00021687771,0.9757671,0.00019781326,0.00050234],"about_ca_topic_score_codex":0.000041769672,"about_ca_topic_score_gemma":0.00002948511,"teacher_disagreement_score":0.9033697,"about_ca_system_score_codex":0.000057648132,"about_ca_system_score_gemma":0.000100402794,"threshold_uncertainty_score":0.999892},"labels":[],"label_agreement":null},{"id":"W1778602239","doi":"10.1002/rsa.20625","title":"Random walks on stochastic hyperbolic half planar triangulations","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Random walk; Planar; Boundary (topology); Mathematics; Simple (philosophy); Simple random sample; Point (geometry); Combinatorics; Mathematical analysis; Statistical physics; Geometry; Physics; Computer science; Statistics; Demography","score_opus":0.04674601922730397,"score_gpt":0.3337392050272816,"score_spread":0.2869931857999776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778602239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07899087,0.0050256182,0.8903917,0.0024458806,0.0065202396,0.005565057,0.0017053467,0.00057655014,0.008778753],"genre_scores_gemma":[0.83955735,0.0011007041,0.14157152,0.00073284964,0.008602783,0.00081363827,0.00035909348,0.00050003506,0.0067620566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996872,0.00046916812,0.0007578766,0.0008684672,0.00050362264,0.00052886864],"domain_scores_gemma":[0.9955303,0.0027359985,0.0004502177,0.0008765087,0.00012184772,0.00028510467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093453244,0.0007384326,0.0015779352,0.00027827595,0.00030076693,0.00016731437,0.00035211642,0.0006160881,0.00008845377],"category_scores_gemma":[0.0010562431,0.00048114074,0.0004917783,0.000086294145,0.00016225714,0.00004581776,0.00024472072,0.00076200545,3.8324586e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014841709,0.0004219801,0.000041128584,0.002620281,0.0035643287,0.00027227085,0.005792517,0.0018587734,0.0016479002,0.27002147,0.02117895,0.6777387],"study_design_scores_gemma":[0.059084028,0.00024324276,0.00018801427,0.0012123885,0.0009903057,0.00014092737,0.00019969452,0.0113425255,0.00038982846,0.91571623,0.008613941,0.0018788897],"about_ca_topic_score_codex":0.00005817058,"about_ca_topic_score_gemma":0.000021400956,"teacher_disagreement_score":0.7605665,"about_ca_system_score_codex":0.000068468544,"about_ca_system_score_gemma":0.000097933,"threshold_uncertainty_score":0.999764},"labels":[],"label_agreement":null},{"id":"W1786028087","doi":"10.1002/rsa.20674","title":"On martingale tail sums for the path length in random trees","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Martingale (probability theory); Central limit theorem; Combinatorics; Law of the iterated logarithm; Random variable; Convergence of random variables; Discrete mathematics; Martingale difference sequence; Iterated function; Iterated logarithm; Logarithm; Local martingale; Binary tree; Applied mathematics; Mathematical analysis; Statistics","score_opus":0.029674942316421427,"score_gpt":0.30820563645586635,"score_spread":0.2785306941394449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1786028087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045521627,0.0017524154,0.9882484,0.00079724897,0.0011550834,0.002201767,0.00091440475,0.000064625936,0.00031391086],"genre_scores_gemma":[0.95276654,0.0010074816,0.04223669,0.00033356782,0.0014763713,0.001170655,0.000054903936,0.00016641364,0.0007873582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979106,0.000091815324,0.000603524,0.0005883863,0.00034542155,0.00046026194],"domain_scores_gemma":[0.98952144,0.009538722,0.0003066699,0.00043497566,0.000094628,0.00010354468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007554779,0.00046013502,0.0009313297,0.00007957006,0.00021624917,0.00013982366,0.00034856808,0.0003047087,0.00006179119],"category_scores_gemma":[0.0031919167,0.0002352902,0.00021637934,0.00005996739,0.000104051425,0.000028057306,0.00023043406,0.0005146037,0.0000012693047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050998526,0.00010262055,0.000009094779,0.001203019,0.00033525814,0.000026753141,0.0009039166,0.00015477909,0.00005385302,0.7446185,0.004016585,0.24347582],"study_design_scores_gemma":[0.014432383,0.00013771451,0.000057880927,0.00040892,0.00015926745,0.000009018167,0.00009400635,0.034068953,0.00009048728,0.9496456,0.00054960244,0.0003461667],"about_ca_topic_score_codex":0.000026282867,"about_ca_topic_score_gemma":0.000047529178,"teacher_disagreement_score":0.9482144,"about_ca_system_score_codex":0.000036559475,"about_ca_system_score_gemma":0.000086251355,"threshold_uncertainty_score":0.9594856},"labels":[],"label_agreement":null},{"id":"W1916296292","doi":"10.1002/rsa.20707","title":"The graph structure of a deterministic automaton chosen at random","year":2016,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Deterministic automaton; Alphabet; Digraph; Deterministic finite automaton; Two-way deterministic finite automaton; Büchi automaton; Strongly connected component; Automaton","score_opus":0.004889465677345986,"score_gpt":0.21578913220370488,"score_spread":0.2108996665263589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916296292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8482344,0.005073464,0.14178169,0.0012418828,0.001850422,0.0008733993,0.00016643408,0.00036556603,0.00041269689],"genre_scores_gemma":[0.9956208,0.00037214128,0.0036098852,0.00008912555,0.00012013291,0.000007766468,0.0000019140127,0.000015021626,0.00016321207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983756,0.0001483892,0.00038007682,0.0004051668,0.00032219765,0.00036859527],"domain_scores_gemma":[0.9978803,0.0010961628,0.00022681624,0.0006223452,0.000055125805,0.00011927405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027901863,0.0002504755,0.00040964255,0.000070840026,0.00041315847,0.00013538227,0.0007460752,0.00009770867,0.00003026197],"category_scores_gemma":[0.00010446731,0.00011161503,0.00014663515,0.00016761948,0.0003272654,0.00018556188,0.00031594504,0.00008938413,0.0000016645367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006108747,0.000015395402,0.00032170955,0.000056967834,0.00016917224,0.00003207385,0.0007040192,0.000011047302,0.046794508,0.12186814,0.0006808422,0.82873523],"study_design_scores_gemma":[0.052144818,0.00044932612,0.024509666,0.00028814987,0.0001468236,0.0010862402,0.00013952986,0.032488726,0.09745535,0.7693929,0.020515487,0.0013829455],"about_ca_topic_score_codex":0.000013792353,"about_ca_topic_score_gemma":0.000012331773,"teacher_disagreement_score":0.8273523,"about_ca_system_score_codex":0.000018684905,"about_ca_system_score_gemma":0.00003056855,"threshold_uncertainty_score":0.45515287},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021360138136575044,"score_gpt":0.2776378002865467,"score_spread":0.25627766214997166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924956554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031017128,0.0017104106,0.96573585,0.00024702458,0.0005258769,0.00023369081,0.000027645694,0.000060444916,0.00044195252],"genre_scores_gemma":[0.65069336,0.000048382954,0.34895363,0.00009431796,0.00013846309,0.0000029103865,0.000004862474,0.000009518468,0.00005452192],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847245,0.00025488308,0.00032741218,0.0003735975,0.0003122018,0.0002594612],"domain_scores_gemma":[0.998876,0.00025101093,0.00014777221,0.00035489412,0.00014979216,0.00022053625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004481086,0.00021223375,0.00046165733,0.000120037905,0.00016921556,0.00012822227,0.00039024308,0.0001126723,0.000012181853],"category_scores_gemma":[0.00017063637,0.00015446363,0.00010049743,0.00025807068,0.00009647933,0.00030738304,0.00013574997,0.00022751604,5.1218177e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004299449,0.000042207397,0.0002556013,0.00011789014,0.00021603632,0.000039581068,0.011843703,0.0009899171,0.016270231,0.4484728,0.0016430632,0.519679],"study_design_scores_gemma":[0.01907189,0.0001555551,0.00073087076,0.00004016207,0.00006971765,0.00025446792,0.00022302006,0.09993662,0.016344931,0.86119944,0.0014658102,0.0005075059],"about_ca_topic_score_codex":0.000043158332,"about_ca_topic_score_gemma":0.0000046057257,"teacher_disagreement_score":0.61967623,"about_ca_system_score_codex":0.000014532412,"about_ca_system_score_gemma":0.0000842259,"threshold_uncertainty_score":0.6298844},"labels":[],"label_agreement":null},{"id":"W1926931217","doi":"10.1002/rsa.20781","title":"The diameter of inhomogeneous random graphs","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Metric space; Separable space; Metric (unit); Kernel (algebra); Space (punctuation); Combinatorics; Random graph; Constant (computer programming); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Graph; Computer science","score_opus":0.01626645147185195,"score_gpt":0.27604747824386133,"score_spread":0.25978102677200937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926931217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97616816,0.004240825,0.013015611,0.0001638092,0.0020287815,0.00088260527,0.000071520146,0.00009747135,0.0033312233],"genre_scores_gemma":[0.9883246,0.0005002064,0.010399145,0.00009752524,0.00042560726,0.000014489967,0.0000020419852,0.0000318375,0.00020456509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984739,0.00017813695,0.00045187218,0.0002705382,0.00029519683,0.000330369],"domain_scores_gemma":[0.9976195,0.0014714216,0.00021665847,0.00046549056,0.00013538475,0.000091513066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060349,0.00024902265,0.00048157055,0.00007688072,0.0007740558,0.00006317152,0.00030909502,0.00012233591,0.00007762938],"category_scores_gemma":[0.00038717105,0.00012952188,0.00021316014,0.00015566655,0.0010139379,0.000050752566,0.0001095285,0.00016802471,6.4521026e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032533193,0.000040224186,0.0009027953,0.0001466442,0.0007538034,0.000016552482,0.0042110793,0.0000028063237,0.0020566995,0.75124896,0.0029777575,0.23438935],"study_design_scores_gemma":[0.00625629,0.00015448008,0.000958316,0.000020949394,0.00010026919,0.00008005529,0.00014388352,0.00022062124,0.007500199,0.98109937,0.0032577985,0.00020776261],"about_ca_topic_score_codex":0.000019180708,"about_ca_topic_score_gemma":0.00001815186,"teacher_disagreement_score":0.23418158,"about_ca_system_score_codex":0.0000059393037,"about_ca_system_score_gemma":0.000015643474,"threshold_uncertainty_score":0.59534895},"labels":[],"label_agreement":null},{"id":"W1965196198","doi":"10.1002/rsa.10011","title":"Analysis of Rabin's irreducibility test for polynomials over finite fields","year":2001,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"University of Waterloo","keywords":"Irreducibility; Mathematics; Degree (music); Combinatorics; Prime (order theory); Prime factor; Finite field; Divisor (algebraic geometry); Polynomial; Discrete mathematics; Expected value; Irreducible polynomial; Pure mathematics; Statistics; Matrix polynomial","score_opus":0.0115574254576437,"score_gpt":0.26212360890644865,"score_spread":0.25056618344880494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965196198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4155715,0.0011522982,0.58187395,0.00040492855,0.000320793,0.0003920621,0.00009415511,0.00004957129,0.00014069917],"genre_scores_gemma":[0.9832722,0.00019834987,0.016245306,0.00011877505,0.00008915728,0.0000132434725,0.00001012071,0.000005061104,0.00004777801],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99881864,0.00004494101,0.00031914155,0.00042250194,0.00016371794,0.0002310614],"domain_scores_gemma":[0.99810565,0.0011472877,0.00012735155,0.00046282765,0.00006936646,0.00008753723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034042937,0.00015202764,0.00047636405,0.00027927783,0.00013642607,0.000087994216,0.0003149911,0.000097834025,0.000037708334],"category_scores_gemma":[0.00017996278,0.00011254064,0.00033505214,0.00082607823,0.00010541418,0.00013536359,0.00008278525,0.000082082224,1.4208993e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008153413,0.0004375939,0.12679626,0.0002191685,0.0034888734,0.000032799377,0.0030810933,0.0074389777,0.0029575494,0.015468903,0.0010111306,0.8382523],"study_design_scores_gemma":[0.0107371155,0.00042969146,0.54112065,0.000026161486,0.0011100608,0.000023055743,0.00008641381,0.39298955,0.0031143222,0.046418823,0.0032971383,0.0006470164],"about_ca_topic_score_codex":0.00013527645,"about_ca_topic_score_gemma":0.000038425635,"teacher_disagreement_score":0.8376053,"about_ca_system_score_codex":0.0000055185815,"about_ca_system_score_gemma":0.000023149085,"threshold_uncertainty_score":0.45892742},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Excursion; Combinatorics; Watson; Mathematical proof; Conjecture; Tree (set theory); Geometry; Computer science","score_opus":0.019274962154813256,"score_gpt":0.30211331847985984,"score_spread":0.28283835632504656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973441387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93894225,0.00030905567,0.059867598,0.000115887626,0.00014122964,0.0003085198,0.00015525593,0.000024770508,0.0001354258],"genre_scores_gemma":[0.9793472,0.00003656342,0.020471921,0.000010925881,0.00008352882,0.000016671444,0.000010950041,0.000011353029,0.000010867119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903274,0.000030383875,0.00032733986,0.00021986883,0.00019101618,0.00019864016],"domain_scores_gemma":[0.99850976,0.0011723414,0.00006437203,0.00010741364,0.00004397679,0.00010212354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018829829,0.00014701512,0.0004271673,0.00004862008,0.0000708678,0.00003468627,0.000078568766,0.000101185804,0.00007456367],"category_scores_gemma":[0.0007376649,0.00010573818,0.000030293835,0.000083611965,0.00017808026,0.00007372646,0.00003646333,0.00019354696,2.958231e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008917245,0.00013710531,0.005656656,0.0011763524,0.00014966246,0.000026552525,0.00172213,0.0000019974766,0.008200673,0.8698646,0.00016986731,0.11200268],"study_design_scores_gemma":[0.005293376,0.00021240732,0.025649138,0.00008468549,0.00011396556,0.000013984296,0.00031368056,0.008154742,0.004522094,0.9553018,0.00009429215,0.00024579963],"about_ca_topic_score_codex":0.000030731502,"about_ca_topic_score_gemma":0.0000890147,"teacher_disagreement_score":0.11175688,"about_ca_system_score_codex":0.000004458007,"about_ca_system_score_gemma":0.000019121951,"threshold_uncertainty_score":0.43118778},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Space (punctuation); Resolution (logic); Computer science; Mathematics; Artificial intelligence","score_opus":0.024313043305218624,"score_gpt":0.25316967239074095,"score_spread":0.22885662908552232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974070050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03158595,0.0026080315,0.9611246,0.00012602801,0.0006250446,0.00061158184,0.000002946275,0.00006772571,0.0032480853],"genre_scores_gemma":[0.9796321,0.00006440518,0.020156296,0.000023876268,0.000044878834,0.000008626453,0.0000024095793,0.000005418491,0.000062019826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877167,0.00017734997,0.00029977472,0.0002822114,0.00020692522,0.00026204475],"domain_scores_gemma":[0.99938726,0.0001011038,0.00013147504,0.00026199623,0.000048266716,0.00006988883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688687,0.00014351231,0.00037932157,0.000094544455,0.00009486647,0.000070360606,0.00021749793,0.00007968163,0.000009371296],"category_scores_gemma":[0.00007816661,0.00010566316,0.00007492869,0.00023749242,0.00012578967,0.00016899448,0.00005582683,0.00011248631,0.0000010712373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001194738,0.000023604664,0.00084039476,0.000056322464,0.000021477521,0.000010626951,0.0008519655,0.00015147743,0.00026851994,0.9807488,0.00007693622,0.016830405],"study_design_scores_gemma":[0.032938637,0.00024279836,0.009065062,0.000020465772,0.000019993398,0.00015008367,0.00019637741,0.061252564,0.0051868963,0.8772364,0.013188936,0.0005017882],"about_ca_topic_score_codex":0.0003477585,"about_ca_topic_score_gemma":0.00006816649,"teacher_disagreement_score":0.94804615,"about_ca_system_score_codex":0.000022807448,"about_ca_system_score_gemma":0.000036711208,"threshold_uncertainty_score":0.43088186},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020699561443162123,"score_gpt":0.2864416798429761,"score_spread":0.265742118399814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983805560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98896897,0.0015595527,0.00052142504,0.00031815367,0.00027706765,0.00030640897,0.00002065977,0.000082993574,0.007944767],"genre_scores_gemma":[0.9757369,0.00022215494,0.023065683,0.000286508,0.00044527036,0.000010460503,0.0000021332519,0.000024550085,0.0002063535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882054,0.000071358096,0.00030460133,0.00027463856,0.00023322714,0.00029563595],"domain_scores_gemma":[0.99934536,0.00029276407,0.000059011436,0.00018847406,0.000033208893,0.000081199825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034855344,0.00021021548,0.00037475236,0.00012386178,0.00016543394,0.000045540222,0.00015386836,0.000117764575,0.00014348247],"category_scores_gemma":[0.00015357064,0.00014806227,0.00008379815,0.000113719776,0.00011797025,0.000111832815,0.000088425375,0.0002158367,0.0000017747087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040171106,0.00006449624,0.0019671277,0.00011875628,0.000096388445,0.000034921195,0.0032762121,0.000068872774,0.0004706652,0.6733215,0.002085888,0.3180935],"study_design_scores_gemma":[0.004703169,0.00003220112,0.0044941776,0.000023117505,0.000020708498,0.000113847826,0.00015629375,0.0012835374,0.00064393185,0.9790692,0.009181268,0.00027858946],"about_ca_topic_score_codex":0.000018380935,"about_ca_topic_score_gemma":0.00002755789,"teacher_disagreement_score":0.31781492,"about_ca_system_score_codex":0.000023559121,"about_ca_system_score_gemma":0.000012868943,"threshold_uncertainty_score":0.60378045},"labels":[],"label_agreement":null},{"id":"W1987347588","doi":"10.1002/rsa.20494","title":"The solution space geometry of random linear equations","year":2013,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; National Science Foundation","keywords":"Sequence (biology); Mathematics; Sigma; Space (punctuation); Random variable; Parity (physics); Omega; Combinatorics; Cluster analysis; Discrete mathematics; Physics; Computer science; Quantum mechanics; Statistics","score_opus":0.01376655750895992,"score_gpt":0.24812262774930283,"score_spread":0.2343560702403429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987347588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021430822,0.0053758943,0.9696888,0.0009562574,0.0015420417,0.00063731486,0.000030509344,0.00010018652,0.00023822606],"genre_scores_gemma":[0.93752664,0.0018754185,0.059696715,0.00006976169,0.00052972464,0.00008507843,0.000023396331,0.000021724527,0.00017155752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998244,0.0002502363,0.00040966467,0.00045836458,0.00034218334,0.00029555507],"domain_scores_gemma":[0.9974561,0.0011500088,0.000356455,0.0007817764,0.00016052705,0.0000951397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249448,0.0002797523,0.0004687497,0.0001726581,0.00050039444,0.00032014493,0.000899994,0.0002101755,0.000017131717],"category_scores_gemma":[0.00019354018,0.00017882824,0.0002882107,0.00028299,0.00026177324,0.00013275025,0.00087513187,0.00048042092,0.000002274161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004206538,0.00005049959,0.00005637874,0.00022674467,0.00051675446,0.000004315621,0.0015531592,0.002790142,0.00074810896,0.6003589,0.0010056866,0.39226866],"study_design_scores_gemma":[0.0059531266,0.0000875022,0.00072405813,0.00010932662,0.00009946881,0.0000143451225,0.00006552829,0.25965372,0.0012209746,0.7285864,0.0030277928,0.0004577911],"about_ca_topic_score_codex":0.00011556714,"about_ca_topic_score_gemma":0.0000058815044,"teacher_disagreement_score":0.9160958,"about_ca_system_score_codex":0.000012220429,"about_ca_system_score_gemma":0.000065523665,"threshold_uncertainty_score":0.7292404},"labels":[],"label_agreement":null},{"id":"W1993340924","doi":"10.1002/rsa.20067","title":"Probabilistic behavior of asymmetric level compressed tries","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Bernoulli's principle; Binary logarithm; Log-log plot; Entropy (arrow of time); Physics; Quantum mechanics","score_opus":0.02344448903966029,"score_gpt":0.2618566098971203,"score_spread":0.23841212085746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993340924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09117196,0.004205095,0.901754,0.000371552,0.0006670937,0.00090595824,0.00022942928,0.00018894984,0.0005059673],"genre_scores_gemma":[0.8291175,0.000131662,0.1703094,0.00007021063,0.00020336692,0.000028559165,0.000019308807,0.000012366424,0.000107664324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844843,0.0000694909,0.0004025041,0.00042735063,0.00037496228,0.00027726672],"domain_scores_gemma":[0.99885976,0.00022833895,0.00017793347,0.0004918687,0.000110919456,0.00013120392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021264624,0.00022197209,0.0004326769,0.0001768778,0.00017579045,0.00014254796,0.00060386315,0.000089706424,0.000023955448],"category_scores_gemma":[0.00006976848,0.00016192194,0.00008802397,0.0003662011,0.0001350947,0.00045216168,0.00032208045,0.00015231085,0.000002265005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087549,0.00011218076,0.00019334316,0.00005230126,0.000031513828,0.000010206325,0.00026783362,0.00034224422,0.0007289118,0.016503138,0.0006554567,0.9810153],"study_design_scores_gemma":[0.026066486,0.0007709337,0.09511364,0.00014885757,0.00020713151,0.00033861445,0.00010486337,0.7996349,0.024076708,0.025486859,0.026490068,0.0015609501],"about_ca_topic_score_codex":0.000073643416,"about_ca_topic_score_gemma":0.0000048832358,"teacher_disagreement_score":0.9794544,"about_ca_system_score_codex":0.000015903328,"about_ca_system_score_gemma":0.000043200926,"threshold_uncertainty_score":0.66029847},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012260669117951846,"score_gpt":0.27480424031656014,"score_spread":0.26254357119860827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994460676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99626684,0.0011324747,0.0002118,0.00028042242,0.00023718223,0.00118383,0.00007916629,0.000012433102,0.00059582375],"genre_scores_gemma":[0.99746215,0.0006041673,0.001718113,0.000059703354,0.00004773245,0.000034553053,0.000003655645,0.00002513294,0.000044786757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977601,0.00045890585,0.0008813171,0.00025572462,0.00033990614,0.00030404716],"domain_scores_gemma":[0.99329686,0.005493194,0.00054499705,0.0004417411,0.00015174816,0.000071476315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011773927,0.00030414303,0.001040366,0.00006083882,0.00017745112,0.000042382093,0.00030216266,0.00016306003,0.000102084305],"category_scores_gemma":[0.00094638683,0.00014489786,0.00021162865,0.00016402751,0.0011801203,0.00009033178,0.00017642562,0.0002834751,1.9449735e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04959156,0.00022096858,0.01809194,0.0029784336,0.0030691095,0.00003674543,0.054699592,0.0002142696,0.004274207,0.6649465,0.002397436,0.19947922],"study_design_scores_gemma":[0.03778512,0.000077323486,0.0059331395,0.00012801548,0.00014748338,0.000058866277,0.0025823778,0.002494427,0.0017067831,0.9487817,0.000092658374,0.00021210291],"about_ca_topic_score_codex":0.0005447079,"about_ca_topic_score_gemma":0.00005470641,"teacher_disagreement_score":0.2838352,"about_ca_system_score_codex":0.000010322574,"about_ca_system_score_gemma":0.000026580703,"threshold_uncertainty_score":0.59087634},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.050283589901445325,"score_gpt":0.32036737159289536,"score_spread":0.27008378169145003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996168307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81688255,0.0012039202,0.17859966,0.00026065536,0.00023018713,0.002344526,0.00008492408,0.00005256445,0.00034104043],"genre_scores_gemma":[0.5181582,0.0009600224,0.4788937,0.00027035238,0.0003337045,0.0007080086,0.000027701668,0.00011452079,0.00053377385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848485,0.00007094138,0.0003435962,0.000455053,0.00018326205,0.00046231772],"domain_scores_gemma":[0.9984892,0.00095341506,0.00014487575,0.00019806229,0.00007489233,0.00013956097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088236935,0.00031161378,0.0006161291,0.00018761655,0.0001850159,0.00008850775,0.00010947965,0.00015728462,0.0000044987637],"category_scores_gemma":[0.00019469768,0.00022721768,0.00011586767,0.00013470948,0.00008310651,0.00010206251,0.000057238907,0.00016315359,3.1922203e-9],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01590875,0.00018642512,0.0062912568,0.0021686407,0.0006047771,0.00016184691,0.0045168754,0.00003784856,0.0014519695,0.026080638,0.0008323559,0.94175863],"study_design_scores_gemma":[0.2159594,0.0035961065,0.017295256,0.0011456887,0.0009934083,0.0015382628,0.0063537736,0.041891426,0.0034752202,0.68176776,0.022240397,0.0037433251],"about_ca_topic_score_codex":0.000054898213,"about_ca_topic_score_gemma":0.00030486495,"teacher_disagreement_score":0.9380153,"about_ca_system_score_codex":0.000028143426,"about_ca_system_score_gemma":0.00002860755,"threshold_uncertainty_score":0.9265668},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016115455177745156,"score_gpt":0.2739155880886527,"score_spread":0.25780013291090753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003634762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99567,0.00039015745,0.0012686445,0.000058539652,0.0010359378,0.0004905488,0.000039015347,0.0000779103,0.00096920755],"genre_scores_gemma":[0.9849471,0.00010719523,0.014482091,0.000058242706,0.00027821015,0.000016828044,0.000006165831,0.000040900333,0.00006326112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981762,0.0001302681,0.0005566161,0.00039508694,0.00038076984,0.00036101814],"domain_scores_gemma":[0.9981373,0.00069275504,0.00028456975,0.0005933827,0.00012579137,0.00016620955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006788221,0.00034485158,0.00079322216,0.00023993496,0.00032994212,0.00004720539,0.0003206886,0.00029308817,0.0001616268],"category_scores_gemma":[0.00040097436,0.00023743363,0.0003171787,0.00026917647,0.00039557865,0.00010296957,0.00012463139,0.00052695704,2.870609e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015932557,0.00007046725,0.0012282707,0.00028223265,0.0004624252,0.000023704717,0.0024429718,0.0000022978402,0.056420643,0.89316267,0.0005552227,0.043755822],"study_design_scores_gemma":[0.011769101,0.00008991342,0.0027916438,0.000026215277,0.00013540593,0.00010372142,0.00014243004,0.000118072676,0.018492663,0.9654399,0.0005620424,0.0003288885],"about_ca_topic_score_codex":0.00004322218,"about_ca_topic_score_gemma":0.000023195695,"teacher_disagreement_score":0.07227721,"about_ca_system_score_codex":0.00000352397,"about_ca_system_score_gemma":0.000024337456,"threshold_uncertainty_score":0.96822625},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05776540759295678,"score_gpt":0.30948693935227717,"score_spread":0.2517215317593204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006001667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014991363,0.0036426627,0.97987986,0.0002332684,0.00013302092,0.0008142577,0.00016612498,0.000022231447,0.00011721139],"genre_scores_gemma":[0.86486524,0.0001947074,0.13448367,0.000061514955,0.00019649419,0.00009218726,0.0000047913413,0.000026365595,0.000075045726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902785,0.000030119389,0.0002493832,0.00018271446,0.00020769655,0.00030224046],"domain_scores_gemma":[0.99702096,0.0024572068,0.0001462339,0.00017116468,0.000089335364,0.00011508183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034519559,0.00019713254,0.0004498912,0.000027844177,0.00020522972,0.0000477078,0.000116629664,0.00006876667,0.000017972645],"category_scores_gemma":[0.0004949846,0.00009884526,0.000050739996,0.000080853984,0.00020354403,0.00008200764,0.000042452928,0.00010556569,1.2165104e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005856101,0.00008984559,0.00020612405,0.0011218347,0.00057335955,0.000007001426,0.0032686114,0.000006810944,0.000460395,0.5726728,0.00057192537,0.4151652],"study_design_scores_gemma":[0.026696345,0.00060193794,0.00062898215,0.00014113591,0.0007217238,0.0002582993,0.00060232513,0.024474276,0.0008907227,0.94304454,0.001534148,0.00040553603],"about_ca_topic_score_codex":0.00001798068,"about_ca_topic_score_gemma":0.000019290574,"teacher_disagreement_score":0.84987384,"about_ca_system_score_codex":0.000007857025,"about_ca_system_score_gemma":0.000029136656,"threshold_uncertainty_score":0.40307927},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028362531967793286,"score_gpt":0.2904313842626388,"score_spread":0.26206885229484556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020722320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029834503,0.0018849664,0.9670323,0.00005231044,0.00050949084,0.00029261262,0.00005243478,0.000039197526,0.00030215256],"genre_scores_gemma":[0.91044146,0.00022369459,0.08819958,0.00014586392,0.00058486045,0.000033207376,0.000011078714,0.000035254936,0.00032501214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988679,0.000047824982,0.00025473218,0.00019694903,0.00023171004,0.0004008341],"domain_scores_gemma":[0.9990059,0.0005136941,0.00008348969,0.00015884782,0.000013092852,0.00022496907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002698404,0.00020608948,0.00036586478,0.00003174147,0.00016228946,0.00004162615,0.00009020672,0.00008859915,0.00018981053],"category_scores_gemma":[0.00033776354,0.00014641036,0.000059930735,0.000054989418,0.000055838715,0.00009209889,0.000059011225,0.00012798906,0.00000943076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011077031,0.00019424577,0.0001743838,0.0002772209,0.00031838677,0.000021026302,0.0013510402,0.000025902205,0.0028679785,0.73634434,0.0018784646,0.25543928],"study_design_scores_gemma":[0.0152789,0.0000965899,0.00036371523,0.000029638903,0.00022821107,0.00012310978,0.00010377894,0.010912264,0.0044462304,0.9635302,0.004370396,0.00051701],"about_ca_topic_score_codex":0.000004945233,"about_ca_topic_score_gemma":6.9412795e-7,"teacher_disagreement_score":0.88060695,"about_ca_system_score_codex":0.000013372761,"about_ca_system_score_gemma":0.000008218732,"threshold_uncertainty_score":0.5970441},"labels":[],"label_agreement":null},{"id":"W2022319070","doi":"10.1002/rsa.20488","title":"For most graphs<i>H</i>, most<i>H</i>‐free graphs have a linear homogeneous set","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Split graph; Conjecture; Cograph; Graph; Induced subgraph; Discrete mathematics; Homogeneous; Random regular graph; Chordal graph; 1-planar graph","score_opus":0.02067114998214117,"score_gpt":0.2743805863062095,"score_spread":0.25370943632406834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022319070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9720534,0.003322071,0.013517236,0.00064635335,0.0019480071,0.0048271706,0.0014631303,0.0004768727,0.0017457664],"genre_scores_gemma":[0.86016107,0.0009570627,0.13391298,0.0017213109,0.0009795465,0.00065004866,0.00017150093,0.0002682761,0.0011782313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722743,0.00013632984,0.00069340714,0.00071746996,0.00043282183,0.0007925626],"domain_scores_gemma":[0.9971959,0.0010177704,0.00027900242,0.0009198494,0.00026095187,0.00032651384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041520144,0.00063345575,0.0009101983,0.00023967569,0.00088804896,0.00019739449,0.0006277813,0.00034128252,0.00020065528],"category_scores_gemma":[0.0005095518,0.00045607053,0.0003864498,0.0002874829,0.0003832865,0.00020301143,0.00029223866,0.00037116566,0.0000020569091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001555421,0.00018733532,0.001862893,0.0011554781,0.0018746491,0.00008435528,0.0069585564,0.00010379144,0.0025444585,0.75185186,0.08912159,0.14269961],"study_design_scores_gemma":[0.008771922,0.00020342554,0.00034817404,0.000036625053,0.00019513749,0.00018648856,0.00036040344,0.0026200355,0.0017006572,0.9796368,0.005279483,0.0006608542],"about_ca_topic_score_codex":0.00016334374,"about_ca_topic_score_gemma":0.000030186677,"teacher_disagreement_score":0.22778493,"about_ca_system_score_codex":0.000018051634,"about_ca_system_score_gemma":0.0000381822,"threshold_uncertainty_score":0.9997891},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.015311106766374377,"score_gpt":0.2811028403101518,"score_spread":0.26579173354377744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023729725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1529195,0.0010332472,0.8435024,0.000289202,0.00028593684,0.00077961246,0.00032351492,0.0000820819,0.0007845105],"genre_scores_gemma":[0.9789007,0.00012067212,0.020744003,0.000102004866,0.00005755301,0.000013647611,0.000008064253,0.000022914497,0.000030459785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987484,0.00005314014,0.00031515228,0.00031265174,0.00031229103,0.00025831803],"domain_scores_gemma":[0.9986939,0.0007244788,0.00016186341,0.00018895233,0.00009038634,0.00014041972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443893,0.00021651608,0.00048018017,0.00007562585,0.00013303224,0.000047037225,0.000108250526,0.0001120692,0.000032546544],"category_scores_gemma":[0.0010928359,0.00014910176,0.000038236096,0.00012218308,0.00007323913,0.0000469437,0.000065264525,0.00015219122,4.3293136e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026427765,0.00005773366,0.00002221639,0.0009608482,0.00006312816,0.0000083841815,0.00045546357,0.0000021838603,0.00012391957,0.97942716,0.00010948464,0.018505212],"study_design_scores_gemma":[0.0047547654,0.00034196052,0.00035964267,0.00014332433,0.00008269786,0.000045131517,0.00015485853,0.0057370714,0.0012366823,0.9867515,0.00018117788,0.00021119449],"about_ca_topic_score_codex":0.0000104133715,"about_ca_topic_score_gemma":0.000015495616,"teacher_disagreement_score":0.8259812,"about_ca_system_score_codex":0.0000051410793,"about_ca_system_score_gemma":0.000028909668,"threshold_uncertainty_score":0.60801935},"labels":[],"label_agreement":null},{"id":"W2030099274","doi":"10.1002/rsa.20491","title":"Sets that are connected in two random graphs","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; struct; Mathematics; Random graph; Vertex (graph theory); Vertex connectivity; Set (abstract data type); Random regular graph; Discrete mathematics; Graph; Chordal graph; Computer science; 1-planar graph","score_opus":0.022245076795035533,"score_gpt":0.2897099671517167,"score_spread":0.2674648903566812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030099274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99526626,0.0011844522,0.00055711705,0.00018577011,0.0005932044,0.0010380754,0.00004128851,0.000121743244,0.0010121093],"genre_scores_gemma":[0.99396086,0.00021628733,0.0051927543,0.00026602967,0.00012590835,0.00007414677,0.000012241576,0.000046253757,0.00010554069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979496,0.00025843355,0.00046857516,0.00047556087,0.0003294502,0.0005183954],"domain_scores_gemma":[0.99803776,0.0010549427,0.0002343901,0.00041356147,0.0000827839,0.00017654423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038429874,0.00041324366,0.0008377672,0.00023857995,0.000314151,0.00014664097,0.0002700644,0.0001552444,0.0004948416],"category_scores_gemma":[0.0002715872,0.00028236993,0.00019005283,0.00024074629,0.00023528222,0.0002098897,0.00013768027,0.00038777394,0.0000031589984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003542504,0.00027068343,0.0781718,0.00092895475,0.0011661802,0.00032398463,0.011675228,0.00012423999,0.0015144191,0.7260953,0.011325896,0.1648608],"study_design_scores_gemma":[0.023217358,0.00003165498,0.032549497,0.00006981068,0.000053152504,0.00008678267,0.00056269363,0.0013236867,0.00051013153,0.9409136,0.0002572734,0.00042435343],"about_ca_topic_score_codex":0.00023545435,"about_ca_topic_score_gemma":0.00009346172,"teacher_disagreement_score":0.2148183,"about_ca_system_score_codex":0.000018100309,"about_ca_system_score_gemma":0.000013582511,"threshold_uncertainty_score":0.99996287},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005996719707171033,"score_gpt":0.22160962294414435,"score_spread":0.21561290323697332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047467760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.314379,0.0029124452,0.6772009,0.002473271,0.0004632635,0.0006627478,0.000011735864,0.00019313343,0.0017034872],"genre_scores_gemma":[0.9569929,0.0006382672,0.041939545,0.00027991703,0.00007761501,0.000006756823,0.0000031167203,0.0000058565315,0.00005597995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918824,0.00004054911,0.00020182863,0.00026502743,0.00012655949,0.00017780164],"domain_scores_gemma":[0.9996022,0.00010464252,0.000051169365,0.00013423854,0.000022368418,0.0000853724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001497027,0.0001315614,0.00021023669,0.00013916564,0.000115156734,0.00015482352,0.000108586966,0.00005737435,0.00002661591],"category_scores_gemma":[0.000025358884,0.00010468557,0.000037257083,0.0001458161,0.00006816487,0.00034376158,0.000058244594,0.000105130384,9.3218455e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011449998,0.000009977838,0.002953678,0.000010400109,0.000015904823,0.000006974883,0.00068424427,0.0012114361,0.00013663911,0.017647527,0.00010574231,0.977103],"study_design_scores_gemma":[0.04240464,0.000108604305,0.11718741,0.00004546648,0.000023243905,0.00031958445,0.00015564117,0.8058005,0.0009096539,0.021969747,0.010426752,0.00064875814],"about_ca_topic_score_codex":0.00004060765,"about_ca_topic_score_gemma":0.00010754398,"teacher_disagreement_score":0.9764542,"about_ca_system_score_codex":0.000010416044,"about_ca_system_score_gemma":0.000019265059,"threshold_uncertainty_score":0.42689535},"labels":[],"label_agreement":null},{"id":"W2056191455","doi":"10.1002/rsa.20543","title":"Sandwiching a densest subgraph by consecutive cores","year":2014,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Vertex (graph theory); Core (optical fiber); Mathematics; Induced subgraph; Graph; Set (abstract data type); Induced subgraph isomorphism problem; Random graph; Integer (computer science); Discrete mathematics; Computer science; Line graph","score_opus":0.011963355358640543,"score_gpt":0.2657602499152009,"score_spread":0.2537968945565604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056191455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9753753,0.0015762136,0.018916387,0.00012469362,0.0006385767,0.00041323656,0.000099506695,0.00015833831,0.0026977765],"genre_scores_gemma":[0.99171597,0.0001640186,0.007263009,0.00035267134,0.00026186506,0.000012946956,0.000013667208,0.000039706843,0.00017614856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983485,0.0002268612,0.00035116295,0.00040814557,0.00027610437,0.000389238],"domain_scores_gemma":[0.997962,0.0013210995,0.00016918356,0.00031499227,0.00006343056,0.00016928218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043730723,0.0003374609,0.00056254043,0.000099496196,0.0006120253,0.00011145242,0.00021086985,0.00016193837,0.000086135704],"category_scores_gemma":[0.00042522745,0.00023522293,0.00015244758,0.00011828142,0.00035947256,0.00008466164,0.00010995613,0.00028866835,8.244367e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076900236,0.000049692677,0.0033722513,0.00020427843,0.00043689957,0.000021074882,0.004074463,0.0000057839907,0.0019239557,0.9127183,0.016675998,0.05974831],"study_design_scores_gemma":[0.0054881927,0.000112799906,0.0019430388,0.00003987356,0.000113836475,0.00013224458,0.00026107917,0.00080372184,0.0017486318,0.9825357,0.006381934,0.0004389352],"about_ca_topic_score_codex":0.000051293566,"about_ca_topic_score_gemma":0.000011990191,"teacher_disagreement_score":0.069817424,"about_ca_system_score_codex":0.000010003827,"about_ca_system_score_gemma":0.000012360059,"threshold_uncertainty_score":0.9592113},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010305402516997797,"score_gpt":0.2496198197540519,"score_spread":0.2393144172370541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066574146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06695808,0.0025600332,0.92915916,0.00019663318,0.00033378447,0.00020118213,0.000049603495,0.0000857926,0.00045570938],"genre_scores_gemma":[0.9498578,0.0014669324,0.048058502,0.00015243201,0.00017188751,0.000011673727,0.000050176026,0.000011967958,0.00021867934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985166,0.000088110304,0.000377037,0.0004206823,0.00034072172,0.00025682658],"domain_scores_gemma":[0.9988292,0.0002624954,0.000172799,0.0005289915,0.000084339714,0.00012220911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029674,0.00019863137,0.00066433154,0.00031668154,0.00018089297,0.00014933807,0.00051208807,0.00008017747,0.00007488424],"category_scores_gemma":[0.00004702015,0.00013832832,0.00020895599,0.0009754254,0.000106394524,0.00037736454,0.0002459968,0.000111323774,0.0000010450844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091418886,0.00009096939,0.0054052165,0.000039847673,0.001719702,0.00008143545,0.0013571632,0.0022410718,0.0007399219,0.017616546,0.00088015787,0.9689138],"study_design_scores_gemma":[0.019321108,0.00016910348,0.047723055,0.000033086704,0.00075976324,0.00008578351,0.000114040435,0.89446425,0.0012718405,0.0149969915,0.020449385,0.00061157125],"about_ca_topic_score_codex":0.00014775555,"about_ca_topic_score_gemma":0.000010222556,"teacher_disagreement_score":0.9683022,"about_ca_system_score_codex":0.000007807139,"about_ca_system_score_gemma":0.000024494231,"threshold_uncertainty_score":0.5640865},"labels":[],"label_agreement":null},{"id":"W2073677433","doi":"10.1002/rsa.20416","title":"Asymptotic enumeration of strongly connected digraphs by vertices and edges","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Digraph; Combinatorics; Enumeration; Mathematics; Strongly connected component; Discrete mathematics","score_opus":0.01617367823140158,"score_gpt":0.26665309169573986,"score_spread":0.2504794134643383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073677433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908822,0.006155638,0.0020689706,0.00003102683,0.00032690543,0.0002506974,0.00006091994,0.00003684235,0.00018677497],"genre_scores_gemma":[0.99548674,0.0003064171,0.0039434982,0.000027575876,0.00015733793,0.0000070912142,0.00001339201,0.00001919001,0.000038735405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989198,0.00011058484,0.00030837336,0.0001913108,0.00019306563,0.0002768548],"domain_scores_gemma":[0.99892247,0.000562282,0.000161569,0.00017538316,0.00005158212,0.0001267113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000257476,0.00021215773,0.0004024431,0.00007350921,0.00022541003,0.000041887903,0.00008897598,0.00011629171,0.000052118758],"category_scores_gemma":[0.00017926804,0.0001493285,0.000066048546,0.00008673273,0.0002220171,0.00019839605,0.00006194412,0.00012582281,1.2868574e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013462628,0.00024465506,0.050706122,0.0011758143,0.0012964397,0.000004032367,0.023908626,0.000010961684,0.022526305,0.76008767,0.0034945714,0.1351985],"study_design_scores_gemma":[0.015552567,0.00043350845,0.09113844,0.00012978191,0.0007435116,0.00012817017,0.0016435832,0.0014256721,0.03533602,0.8501966,0.0021903433,0.0010817704],"about_ca_topic_score_codex":0.000021660746,"about_ca_topic_score_gemma":0.000002494166,"teacher_disagreement_score":0.13411674,"about_ca_system_score_codex":0.0000053935887,"about_ca_system_score_gemma":0.0000067832825,"threshold_uncertainty_score":0.60894394},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008246097426498877,"score_gpt":0.23088304871805626,"score_spread":0.2226369512915574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089842370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05055908,0.0010775899,0.9440027,0.0034741974,0.0004738593,0.00012386894,0.000001130508,0.000050627255,0.000236984],"genre_scores_gemma":[0.96254975,0.00007239896,0.03637044,0.0006562839,0.00029362648,0.0000047621097,0.0000037909115,0.0000030554195,0.00004587408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945426,0.00002303441,0.000098226425,0.00015875002,0.00015854853,0.000107204854],"domain_scores_gemma":[0.99969476,0.000070014496,0.00003915788,0.00011912338,0.000036070123,0.00004089755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018257159,0.000070018636,0.00007453755,0.00003117707,0.00029091764,0.00019163784,0.00014963398,0.000023201486,0.000003912755],"category_scores_gemma":[0.0000330127,0.00004247936,0.000028857577,0.00015773156,0.000027839691,0.00015627556,0.00005978714,0.00006908415,0.0000020878301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022826662,0.000015154224,0.00004321671,0.000014708779,0.000031365747,0.000008390907,0.0012913898,0.040254284,0.0010439231,0.50117743,0.00037036836,0.45572695],"study_design_scores_gemma":[0.008753563,0.00011628652,0.013463448,0.00003086666,0.000020434576,0.00032046103,0.00010271455,0.189315,0.0059446776,0.75774217,0.023775797,0.00041460508],"about_ca_topic_score_codex":0.000021814423,"about_ca_topic_score_gemma":0.0000025736604,"teacher_disagreement_score":0.9119907,"about_ca_system_score_codex":0.000009689758,"about_ca_system_score_gemma":0.000036806596,"threshold_uncertainty_score":0.22375327},"labels":[],"label_agreement":null},{"id":"W2091047457","doi":"10.1002/rsa.20016","title":"A (1 + ϵ)‐approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma*","year":2004,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Hypergraph; Lemma (botany); Combinatorics; Mathematics; Time complexity; Speedup; Discrete mathematics; Range (aeronautics); Constant (computer programming); Algorithm; Computer science; Parallel computing","score_opus":0.015757152850869025,"score_gpt":0.27120383096649214,"score_spread":0.2554466781156231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091047457","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01567725,0.0005682786,0.982418,0.00024695968,0.0003142728,0.0006846611,0.000026874974,0.000046692894,0.00001703719],"genre_scores_gemma":[0.28695226,0.000052640145,0.71266985,0.00007454363,0.00016868477,0.000021894339,0.000008083255,0.000021342934,0.00003069572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838334,0.00008569717,0.00031978817,0.00041980713,0.00041366546,0.00037771647],"domain_scores_gemma":[0.99900186,0.0001575825,0.00017785771,0.0003956109,0.00013624552,0.00013084304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034535374,0.00020615583,0.00030695897,0.00014635292,0.00043515174,0.00010512981,0.00053070346,0.00009560096,0.000004992967],"category_scores_gemma":[0.00005399753,0.00014624548,0.00018327274,0.0005458918,0.000258671,0.00044379823,0.00021548854,0.0001835013,5.514693e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014815216,0.000042720978,0.00003870275,0.00006890511,0.00008651359,0.0000050016893,0.00083501346,0.020612234,0.0049039912,0.061844148,0.00004148605,0.91137314],"study_design_scores_gemma":[0.008921308,0.0001408679,0.00026235034,0.000090063135,0.000030823543,0.000096156415,0.0001307488,0.528718,0.023045208,0.43804812,0.00028252398,0.00023381018],"about_ca_topic_score_codex":0.00013641246,"about_ca_topic_score_gemma":0.0000060443654,"teacher_disagreement_score":0.9111393,"about_ca_system_score_codex":0.00006181245,"about_ca_system_score_gemma":0.00016163588,"threshold_uncertainty_score":0.59637177},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03572688288415451,"score_gpt":0.2431883776456975,"score_spread":0.207461494761543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091712762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3544288,0.0010481097,0.63571745,0.0026725668,0.0012258199,0.002916172,0.000016340138,0.00051979313,0.001454923],"genre_scores_gemma":[0.92027223,0.0006971826,0.077203624,0.00032733774,0.00026499244,0.00023636608,0.00003923958,0.000040930445,0.0009181167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790156,0.00021040798,0.00041466558,0.0005751289,0.00038813092,0.0005101329],"domain_scores_gemma":[0.9988411,0.0002479552,0.000092487,0.00041387253,0.00017748293,0.00022711932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003857959,0.00028040694,0.0004663724,0.00025011547,0.00019283721,0.00036173238,0.0005038946,0.00012392741,0.0002876191],"category_scores_gemma":[0.0001032441,0.0002148275,0.000069543894,0.0005673682,0.000060064976,0.0009748501,0.00023159942,0.0003072775,0.0000452247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008077577,0.00021549735,0.00195357,0.00021845817,0.00032850655,0.000053625816,0.010298801,0.056100994,0.0028424482,0.0038626108,0.0026310452,0.92068666],"study_design_scores_gemma":[0.035369564,0.00018096036,0.019657468,0.00009641872,0.000014657151,0.00002580943,0.00017425284,0.93239665,0.00082396116,0.009399432,0.0011216777,0.00073916186],"about_ca_topic_score_codex":0.0003011285,"about_ca_topic_score_gemma":0.000022510309,"teacher_disagreement_score":0.9199475,"about_ca_system_score_codex":0.000031025225,"about_ca_system_score_gemma":0.00005416912,"threshold_uncertainty_score":0.87604105},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04942200943055145,"score_gpt":0.3026302775420053,"score_spread":0.2532082681114538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094948820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8425766,0.011117552,0.13791317,0.0006631045,0.0018631442,0.0039916732,0.00021667445,0.0002667817,0.0013913044],"genre_scores_gemma":[0.9644755,0.00024876604,0.034137357,0.00012595615,0.0006957818,0.00013086708,0.000007031369,0.000052392163,0.000126347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825025,0.00014246267,0.00034780952,0.00029312153,0.00030998825,0.00065635284],"domain_scores_gemma":[0.9968,0.002323768,0.0002009461,0.00038621714,0.00010141533,0.00018767425],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00097631745,0.00033838855,0.0005000936,0.000066581895,0.001422144,0.00014066111,0.00028810542,0.0001273481,0.000013954608],"category_scores_gemma":[0.00031559545,0.0001657147,0.00019902909,0.00014593473,0.00043310065,0.0001736622,0.000084591156,0.00023958263,2.6792355e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010103948,0.00006902581,0.0027899777,0.00044095374,0.0012543307,0.000014158342,0.008705371,0.000051021343,0.00073330686,0.6976423,0.0013916702,0.27680394],"study_design_scores_gemma":[0.020713361,0.00015626769,0.0019544342,0.00008166797,0.00032814595,0.00028539012,0.00077367236,0.000693521,0.0011514076,0.96672976,0.0065907044,0.0005416773],"about_ca_topic_score_codex":0.00001596553,"about_ca_topic_score_gemma":0.000011522756,"teacher_disagreement_score":0.27626225,"about_ca_system_score_codex":0.000015901705,"about_ca_system_score_gemma":0.00002336635,"threshold_uncertainty_score":0.99987787},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018493175040415845,"score_gpt":0.2743402856101648,"score_spread":0.25584711056974896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112209432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36840284,0.0008242439,0.6290205,0.000086186985,0.00029098245,0.0007568261,0.00008512046,0.000060432278,0.00047284362],"genre_scores_gemma":[0.9658052,0.000082665305,0.033894993,0.000045277568,0.000063800326,0.00003839599,0.0000034639716,0.00001961585,0.00004658442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988933,0.000053050186,0.00034469078,0.00024086962,0.0002257879,0.00024225221],"domain_scores_gemma":[0.9979574,0.001448045,0.00014701372,0.00018343245,0.00014022252,0.00012384869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018535048,0.00019468073,0.0005699752,0.00005644849,0.00009908878,0.000040538158,0.00011432523,0.00009783366,0.0002630232],"category_scores_gemma":[0.0009514428,0.00013706829,0.00009420054,0.00011320863,0.00010865999,0.00006199459,0.000055102068,0.0001264079,0.0000023598614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006337787,0.00010447078,0.00008086649,0.0005734315,0.00025414603,0.000018098179,0.00058705127,0.000013676874,0.002721429,0.79895407,0.00094524515,0.19511373],"study_design_scores_gemma":[0.006791428,0.00012361891,0.00032328896,0.000028289298,0.000073844254,0.00006235424,0.000087604254,0.009260267,0.0019680574,0.98105526,0.000044327688,0.00018165977],"about_ca_topic_score_codex":0.00009247162,"about_ca_topic_score_gemma":0.0000064652277,"teacher_disagreement_score":0.5974024,"about_ca_system_score_codex":0.0000064051615,"about_ca_system_score_gemma":0.000020385023,"threshold_uncertainty_score":0.5589482},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.051178455649638334,"score_gpt":0.3076444219577712,"score_spread":0.25646596630813284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117032256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975598,0.0005910933,0.015938073,0.00041482356,0.00090635434,0.001584422,0.000088290355,0.000047661917,0.004831294],"genre_scores_gemma":[0.91503817,0.00046838558,0.08066928,0.00036361607,0.00039349953,0.00014864957,0.000013898378,0.000098758595,0.002805771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988031,0.00010543484,0.0003218844,0.00026383795,0.00023172144,0.00027403206],"domain_scores_gemma":[0.9986822,0.0006531857,0.00017972682,0.00032610557,0.00009449555,0.00006428432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005689278,0.00022344152,0.00044329595,0.00006220293,0.00023363189,0.000047811613,0.00018854457,0.00011874863,0.000013126765],"category_scores_gemma":[0.00031202528,0.00012736379,0.0002483181,0.00013437984,0.00014351051,0.000049820355,0.00006991361,0.00016563982,1.0403394e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040990873,0.00019573854,0.0021474527,0.0010263063,0.0005957334,0.00001610763,0.0016539496,0.000040474177,0.0020274601,0.5000281,0.0026951164,0.4854745],"study_design_scores_gemma":[0.042725496,0.0013392022,0.0044800933,0.0006814577,0.0007894751,0.00027193472,0.0016112848,0.035768636,0.012248429,0.83864623,0.05982487,0.0016129122],"about_ca_topic_score_codex":0.000032325457,"about_ca_topic_score_gemma":0.000052670475,"teacher_disagreement_score":0.4838616,"about_ca_system_score_codex":0.00003067555,"about_ca_system_score_gemma":0.000026876065,"threshold_uncertainty_score":0.51937443},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005735867594603812,"score_gpt":0.21022642284365153,"score_spread":0.20449055524904772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118804107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009840072,0.0025516252,0.96869767,0.01591392,0.0014298195,0.00086176937,0.000047412363,0.00028207627,0.00037561305],"genre_scores_gemma":[0.9787627,0.0002481798,0.009639323,0.00428581,0.0017576681,0.00010777926,0.00004129086,0.00004553047,0.00511173],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813384,0.00018212212,0.00030317943,0.0004985362,0.0003861628,0.00049616146],"domain_scores_gemma":[0.99817,0.0007650291,0.00013535113,0.0006633154,0.000075148106,0.00019115137],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064860366,0.00031471156,0.00032665225,0.00006644808,0.0017006682,0.0010634427,0.0008283405,0.000090411486,0.000042007407],"category_scores_gemma":[0.00006372493,0.0001421723,0.00015085615,0.000356632,0.00014362313,0.0004595741,0.000244015,0.00027158883,0.000013406158],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010096064,0.00003322105,0.000012493202,0.000010185353,0.00017316944,0.0000063067237,0.0006313059,0.0004731664,0.00057826546,0.023946762,0.11492398,0.85820156],"study_design_scores_gemma":[0.011445871,0.000276114,0.0010959811,0.000024730727,0.000073592084,0.00015261091,0.00026064058,0.1873209,0.0010781301,0.012892882,0.784905,0.00047352168],"about_ca_topic_score_codex":0.00002649121,"about_ca_topic_score_gemma":0.00006509832,"teacher_disagreement_score":0.9689226,"about_ca_system_score_codex":0.00003202417,"about_ca_system_score_gemma":0.000033226017,"threshold_uncertainty_score":0.99997354},"labels":[],"label_agreement":null},{"id":"W2125078199","doi":"10.1002/rsa.20695","title":"Acyclic edge colourings of graphs with large girth","year":2016,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Girth (graph theory); Directed acyclic graph; Graph; Enhanced Data Rates for GSM Evolution; Triangle-free graph; Edge coloring; Random graph","score_opus":0.007833057280669756,"score_gpt":0.2503309449894059,"score_spread":0.24249788770873615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125078199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39386213,0.0007752696,0.603944,0.00040848274,0.00014205984,0.00038468398,0.000037530397,0.00009508045,0.0003507398],"genre_scores_gemma":[0.9769827,0.00018652217,0.022506244,0.00004909392,0.000035320485,0.00001319642,7.433155e-7,0.000012176622,0.00021397849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998702,0.00007853536,0.00017748805,0.00036189758,0.00030532613,0.00037473795],"domain_scores_gemma":[0.9990116,0.00027646087,0.000098182405,0.00039761828,0.00008617345,0.0001299803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027764533,0.00015841646,0.00028902048,0.00014172461,0.00013466242,0.000043720855,0.0004926564,0.00004991229,0.000021897527],"category_scores_gemma":[0.000041391668,0.000081848695,0.000060871447,0.0003065751,0.00023846189,0.00030504624,0.00020100713,0.00009945384,0.0000014169532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009270619,0.000067424255,0.0053436495,0.00007955287,0.00016237571,0.000059321716,0.0007457973,0.00001738116,0.011354194,0.6524229,0.00019757808,0.32862276],"study_design_scores_gemma":[0.037724037,0.00104702,0.035743427,0.00018297935,0.000031608462,0.00022968928,0.00009451151,0.0022542195,0.048620164,0.86454767,0.008705987,0.0008186893],"about_ca_topic_score_codex":0.000006917277,"about_ca_topic_score_gemma":0.0000048011093,"teacher_disagreement_score":0.5831206,"about_ca_system_score_codex":0.000008241688,"about_ca_system_score_gemma":0.000027915023,"threshold_uncertainty_score":0.3337693},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00805450382717353,"score_gpt":0.2060959177221728,"score_spread":0.19804141389499927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130047894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2872274,0.0009697704,0.58844596,0.00646408,0.0011632718,0.0011397864,0.0002769041,0.00018980744,0.114123],"genre_scores_gemma":[0.9975383,0.000004997178,0.0011754018,0.00033146093,0.00054968876,0.000012441833,0.0000075418516,0.000010156213,0.0003700003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936116,0.00004053824,0.00011437309,0.00017020079,0.00014710284,0.00016660185],"domain_scores_gemma":[0.9994247,0.00034383216,0.000038645125,0.00011233478,0.000022557855,0.000057928453],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000058161702,0.00013301274,0.00014144038,0.000015546462,0.00024783894,0.000077702665,0.00010100892,0.000018635192,0.0016719879],"category_scores_gemma":[0.000004823085,0.00007534846,0.000076882825,0.000074283584,0.00010364739,0.00003719532,0.000032751595,0.0001506472,0.00003670426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008129889,0.000017830278,0.000012059888,0.0000013557969,0.000038080383,7.161607e-7,0.00010398302,0.000088597706,0.00001227205,0.6903203,0.00095890515,0.30843773],"study_design_scores_gemma":[0.0012654987,0.00003091892,0.00021625018,0.000008628935,0.000014582259,0.0000019109505,0.00008646651,0.05528512,0.0002073534,0.9409251,0.001822009,0.00013614357],"about_ca_topic_score_codex":0.000011609546,"about_ca_topic_score_gemma":3.2246305e-8,"teacher_disagreement_score":0.7103109,"about_ca_system_score_codex":0.0000031395334,"about_ca_system_score_gemma":0.0000028739134,"threshold_uncertainty_score":0.99924064},"labels":[],"label_agreement":null},{"id":"W2136721967","doi":"10.1002/rsa.20648","title":"Justifying the small‐world phenomenon via random recursive trees","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Monash University","keywords":"Logarithm; Random graph; Combinatorics; Upper and lower bounds; Mathematical proof; Mathematics; Simple (philosophy); Computer science; Graph; Discrete mathematics","score_opus":0.025615070192616458,"score_gpt":0.28638147534731206,"score_spread":0.2607664051546956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136721967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020775325,0.008086613,0.98181695,0.0023227918,0.0019348698,0.0015787493,0.00007370942,0.00020361254,0.0019051452],"genre_scores_gemma":[0.8231622,0.0058884765,0.15799855,0.0010324868,0.0052921553,0.00097369414,0.00008222864,0.0002803042,0.0052899113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960525,0.00065340014,0.0005487387,0.0012804177,0.0006318184,0.0008331098],"domain_scores_gemma":[0.9959011,0.0017415442,0.0003972443,0.0015080861,0.00019715654,0.00025488314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001170391,0.0006512144,0.00092416,0.0003626525,0.00072420354,0.00065001386,0.0024708717,0.00023463844,0.00005420596],"category_scores_gemma":[0.00014122394,0.0003586472,0.00033435647,0.0003366655,0.00053611875,0.00023419654,0.0025130322,0.001189737,0.000008756305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011203553,0.000025875328,0.000051822324,0.00016963528,0.00040856493,0.00007032244,0.001852347,0.00072984933,0.0004562121,0.09514233,0.00031561012,0.8996571],"study_design_scores_gemma":[0.009758369,0.00006703596,0.0003808431,0.00019425902,0.00006986571,0.00005879276,0.000067018475,0.011067229,0.00085072743,0.9714617,0.00535402,0.0006701343],"about_ca_topic_score_codex":0.00004452518,"about_ca_topic_score_gemma":0.00005442524,"teacher_disagreement_score":0.89898694,"about_ca_system_score_codex":0.00007814799,"about_ca_system_score_gemma":0.00011693095,"threshold_uncertainty_score":0.9998866},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012298840770661462,"score_gpt":0.2507774985054351,"score_spread":0.23847865773477367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139991023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93041545,0.004910425,0.047350824,0.00010859487,0.0025468776,0.0015812931,0.00008399004,0.00012255013,0.012879996],"genre_scores_gemma":[0.9973463,0.00023247709,0.001847031,0.000051017683,0.00017495171,0.000023792005,0.0000045458814,0.000028508388,0.00029139465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843985,0.00018038329,0.00045665982,0.0002638102,0.0003165405,0.00034276038],"domain_scores_gemma":[0.9979519,0.0012682182,0.0002263153,0.00035320385,0.00010408144,0.000096283045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073988846,0.0002715954,0.00046929857,0.000062440726,0.0007930304,0.00006391481,0.00017048516,0.00012227034,0.00007183974],"category_scores_gemma":[0.00046284942,0.00014711666,0.00021418581,0.00014053589,0.00035470974,0.000118657474,0.00006244923,0.0002446493,3.4634814e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024412428,0.000033381344,0.0010642473,0.00007198027,0.000411076,0.0000046474656,0.0019236628,0.000013054966,0.00020813617,0.9474118,0.00063167466,0.045785103],"study_design_scores_gemma":[0.009309184,0.0001684351,0.003420918,0.000020824275,0.00019594419,0.000060683764,0.0007796978,0.00034122172,0.00118918,0.9798094,0.004466471,0.00023804014],"about_ca_topic_score_codex":0.000012748667,"about_ca_topic_score_gemma":0.000020347974,"teacher_disagreement_score":0.06693083,"about_ca_system_score_codex":0.000013574014,"about_ca_system_score_gemma":0.000025569147,"threshold_uncertainty_score":0.6099429},"labels":[],"label_agreement":null},{"id":"W2153541768","doi":"10.1002/rsa.10103","title":"Random suffix search trees","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Random binary tree; Binary search tree; Self-balancing binary search tree; Independent and identically distributed random variables; Tree (set theory); Optimal binary search tree; B-tree; Suffix; Sequence (biology); Suffix tree; Binary number; Discrete mathematics; Binary tree; K-ary tree; Random variable; Statistics; Tree structure; Arithmetic","score_opus":0.013034325146850363,"score_gpt":0.2517538110391782,"score_spread":0.23871948589232786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153541768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02390391,0.0038502682,0.96781117,0.00029308247,0.0009243204,0.00043708054,0.000028480956,0.0002040939,0.0025475952],"genre_scores_gemma":[0.7788144,0.0009380354,0.2187045,0.00037263782,0.00038430037,0.000029115867,0.000025485966,0.000034588476,0.0006969874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980012,0.0002302305,0.00029052375,0.00059305754,0.00042553095,0.0004594134],"domain_scores_gemma":[0.9987739,0.0002724402,0.000069094065,0.00057968043,0.00007234032,0.00023258908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171915,0.0002669899,0.00040994323,0.00011713911,0.0003977704,0.00040223796,0.0005497471,0.000105063984,0.00008764339],"category_scores_gemma":[0.00007373699,0.00018784766,0.0001069933,0.000270687,0.00010458643,0.00047119515,0.00022246475,0.00023984072,0.000009861188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004046761,0.00013546884,0.00080147356,0.00006820592,0.00017372017,0.00017388299,0.0017671094,0.0009085277,0.0021524155,0.19492659,0.0048560454,0.7936319],"study_design_scores_gemma":[0.09941838,0.00077356375,0.016239889,0.00016991203,0.00011507653,0.0014145835,0.0005581139,0.45085824,0.024407936,0.13573855,0.26726368,0.0030420683],"about_ca_topic_score_codex":0.000074601834,"about_ca_topic_score_gemma":0.000005339326,"teacher_disagreement_score":0.7905898,"about_ca_system_score_codex":0.00001468096,"about_ca_system_score_gemma":0.000058796395,"threshold_uncertainty_score":0.76602054},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.029155839348809075,"score_gpt":0.26107007061866516,"score_spread":0.23191423126985608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163453622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924388,0.00084705977,0.0005517511,0.0003209671,0.0007404829,0.00032611884,0.000037773367,0.0001525728,0.004584471],"genre_scores_gemma":[0.9937751,0.00027847022,0.0046419105,0.00047174943,0.000343491,0.000010952747,0.000004149138,0.000035365967,0.00043879726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855196,0.00010599519,0.00029049674,0.00037357234,0.00028051384,0.00039748268],"domain_scores_gemma":[0.99884,0.00046221167,0.00011822913,0.00038782976,0.000034722503,0.00015703261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002758988,0.0002866463,0.0004376887,0.00011795324,0.00052723003,0.00008109763,0.0001839881,0.00015309497,0.0004285537],"category_scores_gemma":[0.00022712146,0.00020049982,0.00015973432,0.00012470467,0.00016383143,0.00009176335,0.00008301184,0.0002942935,0.0000027040217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018465712,0.00004758693,0.00032095445,0.00008604346,0.0001309058,0.00003222499,0.0010345386,0.0000018437252,0.0005861997,0.9391757,0.002162949,0.056236386],"study_design_scores_gemma":[0.0034107731,0.00010358269,0.0029884826,0.00003780416,0.000054779837,0.00010545744,0.000037484428,0.0012479167,0.0008807263,0.98582137,0.004957921,0.00035373413],"about_ca_topic_score_codex":0.000016776783,"about_ca_topic_score_gemma":0.0000028246543,"teacher_disagreement_score":0.05588265,"about_ca_system_score_codex":0.000012940346,"about_ca_system_score_gemma":0.0000031992101,"threshold_uncertainty_score":0.81761456},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015432795212788257,"score_gpt":0.26914049053799227,"score_spread":0.25370769532520404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167858467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992441,0.0013336163,0.0022697612,0.00006271986,0.00041519824,0.00028035708,0.000016735743,0.00004205061,0.003138583],"genre_scores_gemma":[0.9886584,0.00037836697,0.010520295,0.0001715912,0.00008622906,0.000010970944,0.0000028202517,0.000024296085,0.00014698798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988081,0.000102533515,0.000300617,0.00030688362,0.00020054266,0.00028136134],"domain_scores_gemma":[0.99905586,0.0005245196,0.000092831615,0.00017968025,0.00004103887,0.000106041334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040456184,0.00023989817,0.00037858187,0.0001703207,0.0002511959,0.00006480385,0.00007987475,0.00015130104,0.00013220364],"category_scores_gemma":[0.00031289228,0.00017092486,0.00007790333,0.00014496893,0.00019409262,0.00012778163,0.000050285853,0.00031207295,3.5184223e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021907102,0.000026176049,0.0054332744,0.00007683368,0.00008406666,0.000032913442,0.0013129775,0.0000074292993,0.00015113092,0.9798912,0.00023113501,0.012533815],"study_design_scores_gemma":[0.0041305367,0.000039361566,0.006621542,0.00002882155,0.000033051452,0.00030922628,0.00037254125,0.00027155364,0.00038812056,0.9837642,0.0037800716,0.00026099276],"about_ca_topic_score_codex":0.000025662252,"about_ca_topic_score_gemma":0.000020552008,"teacher_disagreement_score":0.012272823,"about_ca_system_score_codex":0.000014737389,"about_ca_system_score_gemma":0.000016365084,"threshold_uncertainty_score":0.69701135},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04046938814774089,"score_gpt":0.3395489419876489,"score_spread":0.29907955383990803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168173277","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80307674,0.0006661806,0.19366801,0.00012819488,0.0004751843,0.00065326225,0.00007440277,0.000089913075,0.001168094],"genre_scores_gemma":[0.11061946,0.00078279944,0.8841713,0.00026123069,0.0010501016,0.0000350685,0.000021467655,0.00006983027,0.0029887066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984624,0.0001616938,0.0004049907,0.00040373264,0.000262874,0.00030433031],"domain_scores_gemma":[0.9990152,0.00030466824,0.00010155976,0.00032124534,0.00009531929,0.00016201948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006385744,0.00025363782,0.0005690079,0.00012199872,0.00017962512,0.00003852007,0.00010521342,0.00013271284,0.00017612703],"category_scores_gemma":[0.00017879254,0.0001951812,0.00016206299,0.00018508198,0.000053503918,0.00006152897,0.000047646092,0.00016460115,1.1412275e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002514774,0.000026923126,0.000014596538,0.00007082807,0.00005062634,0.0000065804306,0.0006753643,0.00016409488,0.0054348335,0.0015160625,0.0004519765,0.99133664],"study_design_scores_gemma":[0.06237288,0.004463271,0.010652217,0.0016476649,0.0013597098,0.0017387717,0.0025526648,0.51200354,0.11598269,0.14060798,0.14057757,0.00604104],"about_ca_topic_score_codex":0.00014859291,"about_ca_topic_score_gemma":0.000012201868,"teacher_disagreement_score":0.9852956,"about_ca_system_score_codex":0.000023756553,"about_ca_system_score_gemma":0.000017532031,"threshold_uncertainty_score":0.79592586},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03208426629164039,"score_gpt":0.31690473738690783,"score_spread":0.2848204710952674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255223375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17782807,0.002177241,0.8119785,0.0012538558,0.0019055622,0.0015235732,0.00032843015,0.00013479468,0.0028699783],"genre_scores_gemma":[0.91905826,0.0002750534,0.080043495,0.00004729608,0.00028668263,0.00003651011,0.000006568303,0.000028720948,0.00021740005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998762,0.00004337196,0.0003260671,0.00032409784,0.00022737012,0.00031710096],"domain_scores_gemma":[0.9983146,0.00094113726,0.00020442787,0.0003617111,0.00006059461,0.00011753053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027542113,0.00023154975,0.0005992267,0.000061127015,0.00036177813,0.00019424719,0.0002878636,0.00012142435,0.00012449537],"category_scores_gemma":[0.002063028,0.00016665374,0.00006880181,0.000035547626,0.00013620168,0.00011581904,0.000103167826,0.0002025528,0.0000026054615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012758708,0.000047287533,0.000100652214,0.00014990478,0.000081447775,0.00010661493,0.0005144135,0.000020750947,0.00007687007,0.84126234,0.00043375083,0.15593009],"study_design_scores_gemma":[0.015318579,0.000094707124,0.0025326733,0.00009207546,0.00006147081,0.000034144698,0.00011741597,0.0043644365,0.00023717912,0.97669655,0.00020006804,0.00025069623],"about_ca_topic_score_codex":0.00018077041,"about_ca_topic_score_gemma":0.00020069066,"teacher_disagreement_score":0.7412302,"about_ca_system_score_codex":0.000015834605,"about_ca_system_score_gemma":0.000030504145,"threshold_uncertainty_score":0.6795942},"labels":[],"label_agreement":null},{"id":"W2287236900","doi":"10.1002/rsa.20717","title":"Rainbow perfect matchings and Hamilton cycles in the random geometric graph","year":2017,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University; Simons Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Vertex (graph theory); Graph; Hamiltonian path; Discrete mathematics","score_opus":0.028198398681098653,"score_gpt":0.30371194710728594,"score_spread":0.2755135484261873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287236900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807177,0.013112905,0.0015040329,0.00031620197,0.0012890128,0.0018236438,0.00017700685,0.00008686399,0.0009726322],"genre_scores_gemma":[0.987339,0.0068160864,0.004672195,0.00021112143,0.000631442,0.00010457671,0.000034512228,0.0000774673,0.000113550675],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996508,0.0006087373,0.0007193411,0.0009345227,0.0006299927,0.0005993846],"domain_scores_gemma":[0.99544615,0.0025186287,0.0006143117,0.0012089616,0.00007096292,0.0001409626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024260997,0.0008229341,0.001528877,0.00064740994,0.0011752809,0.0007609293,0.0010417276,0.0006365134,0.000032891363],"category_scores_gemma":[0.0007896335,0.00048127348,0.0004210914,0.0001981313,0.0006645493,0.00013079437,0.00080455776,0.0016472817,3.3159168e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008685864,0.00040543676,0.014614144,0.009966677,0.003637802,0.00095886574,0.11248297,0.00043851018,0.00023240256,0.2794453,0.007565269,0.56156677],"study_design_scores_gemma":[0.011290395,0.000058751135,0.015200737,0.00025279517,0.00028739887,0.00022475593,0.00044713475,0.0005501266,0.00005849047,0.9702073,0.0007472861,0.0006748685],"about_ca_topic_score_codex":0.00031168634,"about_ca_topic_score_gemma":0.000044791268,"teacher_disagreement_score":0.690762,"about_ca_system_score_codex":0.00002532371,"about_ca_system_score_gemma":0.000039670867,"threshold_uncertainty_score":0.9997639},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0134014026243379,"score_gpt":0.2381435086761491,"score_spread":0.22474210605181122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514202683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8033941,0.00073774706,0.19396842,0.0011329692,0.00011806835,0.00036490752,0.000009592407,0.000024226425,0.00024999428],"genre_scores_gemma":[0.929836,0.00007205169,0.06976404,0.00024950766,0.000038230482,0.000010685239,0.000007130064,0.000003411123,0.000018939438],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991209,0.00008943044,0.00017361631,0.0002211309,0.00026017026,0.00013476271],"domain_scores_gemma":[0.99948275,0.00019359637,0.000055135966,0.0001790357,0.000044058834,0.000045419743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023326805,0.000105170635,0.00017239734,0.0001446761,0.00011877565,0.00003831528,0.00022157599,0.000028672048,0.00000390916],"category_scores_gemma":[0.000024360694,0.00006078851,0.00003097231,0.00046279468,0.00004372784,0.00010987521,0.00004008383,0.00008172893,5.108711e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004887224,0.00039506037,0.0068903696,0.0001546827,0.00033642037,0.0010066908,0.056935005,0.15973113,0.005255861,0.32490307,0.008433258,0.43107122],"study_design_scores_gemma":[0.029999359,0.003200731,0.53482395,0.00018250737,0.000053942564,0.0052249064,0.0008162324,0.10599192,0.009389781,0.3033954,0.005414012,0.0015072256],"about_ca_topic_score_codex":0.000067224835,"about_ca_topic_score_gemma":0.000054983,"teacher_disagreement_score":0.5279336,"about_ca_system_score_codex":0.000006258085,"about_ca_system_score_gemma":0.000032105138,"threshold_uncertainty_score":0.24788834},"labels":[],"label_agreement":null},{"id":"W2516383456","doi":"10.1002/rsa.20743","title":"Arboricity and spanning‐tree packing in random graphs","year":2017,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Minimum spanning tree; Degeneracy (biology); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Planar graph","score_opus":0.018074560900552906,"score_gpt":0.2960829136122864,"score_spread":0.27800835271173346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516383456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837275,0.003799309,0.20856413,0.0008113861,0.0005935535,0.0007367277,0.000010901177,0.00011936145,0.0016371232],"genre_scores_gemma":[0.98289055,0.00050834124,0.016400632,0.00005286287,0.000076127064,0.00001449571,9.2316134e-7,0.000011653586,0.000044397413],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838823,0.00012675644,0.00022429503,0.0005381233,0.00028657698,0.00043602329],"domain_scores_gemma":[0.99867636,0.000314851,0.0001402321,0.00066316954,0.000047771093,0.0001576356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068658165,0.00021315344,0.00040771454,0.00019409155,0.0006571117,0.0006096128,0.00073999714,0.00008261032,0.00000457225],"category_scores_gemma":[0.00025677079,0.00016604921,0.00006423386,0.00014799349,0.00034434153,0.00063906267,0.000496399,0.00031441302,5.885253e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007905494,0.000031332103,0.0330611,0.00006847054,0.00007106827,0.00024794773,0.0014777137,0.00009656852,0.0012925623,0.18853915,0.000046908604,0.7742766],"study_design_scores_gemma":[0.022728236,0.0000935418,0.20687695,0.00006936167,0.000010853124,0.00008647715,0.00006389213,0.028910479,0.0012716731,0.73890054,0.00053831504,0.0004496904],"about_ca_topic_score_codex":0.0001297932,"about_ca_topic_score_gemma":0.00005036482,"teacher_disagreement_score":0.77382696,"about_ca_system_score_codex":0.0000121541725,"about_ca_system_score_gemma":0.000025182637,"threshold_uncertainty_score":0.67712903},"labels":[],"label_agreement":null},{"id":"W2542588801","doi":"10.1002/rsa.20778","title":"Perfect matchings and Hamiltonian cycles in the preferential attachment model","year":2018,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Preferential attachment; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Vertex (graph theory); Graph; Complex network; Mathematical optimization","score_opus":0.04485699537068072,"score_gpt":0.3393181932293433,"score_spread":0.2944611978586626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542588801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27685016,0.001286762,0.7190334,0.0003464212,0.0004403575,0.0012616212,0.00037624477,0.000058385976,0.00034665904],"genre_scores_gemma":[0.93317974,0.0004056222,0.06575213,0.00013504732,0.00032547384,0.000096037795,0.000027773187,0.00003894797,0.000039233983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982478,0.00009899688,0.00041105377,0.0005448253,0.0003698238,0.00032750747],"domain_scores_gemma":[0.99876827,0.00059570913,0.00016797564,0.00032597448,0.00005108465,0.000090975154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048003017,0.00040035875,0.00063650263,0.000071053284,0.00018906308,0.00025580628,0.00029731056,0.00026663495,0.000025064668],"category_scores_gemma":[0.00023577333,0.0002437155,0.000083164836,0.0000456925,0.00013489806,0.000036110145,0.00044697817,0.0006129465,5.6993673e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018652135,0.00034532268,0.00014428997,0.006938023,0.0006904238,0.00008570361,0.027116384,0.0010999487,0.00019227953,0.80466276,0.0029025779,0.1539571],"study_design_scores_gemma":[0.0018147023,0.00006123862,0.00026078807,0.00015138673,0.00013003581,0.000032938937,0.00011151766,0.22408327,0.00002618745,0.7730598,0.000022183962,0.00024594055],"about_ca_topic_score_codex":0.00007051651,"about_ca_topic_score_gemma":0.000042503878,"teacher_disagreement_score":0.6563296,"about_ca_system_score_codex":0.00002217562,"about_ca_system_score_gemma":0.00005142981,"threshold_uncertainty_score":0.993843},"labels":[],"label_agreement":null},{"id":"W2571496458","doi":"10.1002/rsa.20341","title":"Smoothed analysis of balancing networks","year":2010,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Security token; Combinatorics; Upper and lower bounds; Computer science; Binary logarithm; Mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.016492966255816654,"score_gpt":0.3117600488426788,"score_spread":0.2952670825868622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571496458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8160548,0.0003016661,0.1816553,0.000039701103,0.00048758,0.00019903976,0.000026178397,0.00004024072,0.0011954556],"genre_scores_gemma":[0.9100155,0.00006563147,0.08950148,0.00004491562,0.00020853414,0.00000571974,0.000008265054,0.000016520198,0.00013340576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990721,0.0000759331,0.00030414562,0.00020722409,0.00015043329,0.00019021532],"domain_scores_gemma":[0.9987505,0.0006418135,0.00016868162,0.00028842955,0.00006362826,0.00008692819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064538734,0.0001513493,0.0006164003,0.00015149802,0.00007411264,0.000027728902,0.0001082953,0.00012365244,0.00007650839],"category_scores_gemma":[0.00026013926,0.00010754725,0.00021275674,0.00031332966,0.00007802493,0.000031327985,0.000046478213,0.00021783792,3.6931098e-9],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009672211,0.00016075734,0.021245519,0.00044495342,0.007973825,0.0000444923,0.003740007,0.0019170033,0.03885026,0.23433617,0.0015352198,0.6887846],"study_design_scores_gemma":[0.014060612,0.00015350911,0.0253855,0.000058714882,0.006110873,0.00005023417,0.00060797826,0.86766315,0.005458587,0.07413244,0.005174494,0.001143935],"about_ca_topic_score_codex":0.000059985807,"about_ca_topic_score_gemma":0.00012423418,"teacher_disagreement_score":0.86574614,"about_ca_system_score_codex":0.0000036764254,"about_ca_system_score_gemma":0.000009902756,"threshold_uncertainty_score":0.43856493},"labels":[],"label_agreement":null},{"id":"W2577805882","doi":"10.1002/rsa.20807","title":"A characterization of constant‐sample testable properties","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constant (computer programming); Mathematics; Characterization (materials science); Monotonic function; Affine transformation; Property testing; Property (philosophy); Constant function; Partition (number theory); Combinatorics; Invariant (physics); Discrete mathematics; Pure mathematics; Mathematical analysis; Physics; Piecewise; Computer science","score_opus":0.019380667144622523,"score_gpt":0.22796953370269527,"score_spread":0.20858886655807274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577805882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2999891,0.00029706777,0.69802946,0.00022156988,0.00055412663,0.00030812394,0.00006529463,0.00011464654,0.00042060358],"genre_scores_gemma":[0.9371938,0.00008918803,0.06230512,0.00012043667,0.00020996526,0.000008847704,0.000009042449,0.000008227056,0.000055355435],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989866,0.000050115963,0.0002518262,0.00028906198,0.0002018663,0.00022055052],"domain_scores_gemma":[0.99927765,0.000092660775,0.00011938624,0.00028913995,0.00015292782,0.00006825176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016745465,0.00014461097,0.0002697438,0.00009656078,0.00022828353,0.00012916468,0.00032745476,0.00005073402,0.000038371898],"category_scores_gemma":[0.00006209132,0.00010822285,0.00005069226,0.00028738682,0.0003675457,0.00031597193,0.00016772855,0.00007623892,0.0000012950758],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026037064,0.00010593289,0.0011506991,0.00018249272,0.00014091552,0.000009028638,0.0043334593,0.000007279825,0.255823,0.24050239,0.00011594446,0.49736848],"study_design_scores_gemma":[0.01065349,0.0010703664,0.013079488,0.0002469682,0.00006011829,0.0002139969,0.00022461628,0.28151366,0.4152962,0.2610084,0.015448264,0.0011844258],"about_ca_topic_score_codex":0.000089069916,"about_ca_topic_score_gemma":0.000006903298,"teacher_disagreement_score":0.6372047,"about_ca_system_score_codex":0.000006255348,"about_ca_system_score_gemma":0.00004038788,"threshold_uncertainty_score":0.44131997},"labels":[],"label_agreement":null},{"id":"W2592011129","doi":"10.1002/rsa.20415","title":"Asymptotic enumeration of sparse 2‐connected graphs","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Enumeration; Social connectedness; Degree (music); Sequence (biology); Simple (philosophy); Discrete mathematics; Kernel (algebra); Wright; struct; Computer science; Physics","score_opus":0.024462672049415806,"score_gpt":0.28026428087793304,"score_spread":0.2558016088285172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592011129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933965,0.0015187253,0.003064423,0.00002751782,0.000729079,0.00031182708,0.000028728995,0.000057759822,0.00086544006],"genre_scores_gemma":[0.989308,0.00011155157,0.010180762,0.000048368707,0.00025467452,0.000007997528,0.000009353833,0.000023735416,0.000055532793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877405,0.00012869928,0.00037023498,0.00018185274,0.00023105953,0.0003140902],"domain_scores_gemma":[0.9989006,0.0004559345,0.00018874613,0.00026138863,0.00006663419,0.00012670513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037735145,0.0002159108,0.0004304954,0.00011882913,0.00021738607,0.000023228158,0.000117280375,0.00012927719,0.0001525331],"category_scores_gemma":[0.00023703589,0.00015273705,0.0001289894,0.00014912614,0.00015569245,0.00015801174,0.000064912114,0.0001495507,5.647013e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022122078,0.00005128719,0.0038613172,0.00015802067,0.00020236467,0.0000020095197,0.0027070325,0.0000070533342,0.0020805881,0.9700331,0.00034270267,0.020333268],"study_design_scores_gemma":[0.0039425925,0.00007407178,0.0152678825,0.00003197707,0.00016770072,0.00007484091,0.00021064383,0.00036971137,0.008473088,0.9705859,0.0004991076,0.00030252992],"about_ca_topic_score_codex":0.000014437757,"about_ca_topic_score_gemma":0.0000021199285,"teacher_disagreement_score":0.020030739,"about_ca_system_score_codex":0.00000759636,"about_ca_system_score_gemma":0.000009545435,"threshold_uncertainty_score":0.6228436},"labels":[],"label_agreement":null},{"id":"W2784087054","doi":"10.1002/rsa.20841","title":"Enumeration and randomized constructions of hypertrees","year":2019,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Azrieli Foundation","keywords":"Enumeration; Vertex (graph theory); Homology (biology); Combinatorics; Mathematics; Face (sociological concept); Upper and lower bounds; Discrete mathematics; Physics; Biology; Genetics; Graph; Mathematical analysis","score_opus":0.010571807602737545,"score_gpt":0.23958239543593088,"score_spread":0.22901058783319334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784087054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084852874,0.012244507,0.89891624,0.0009314282,0.0012467705,0.0009423403,0.00026023327,0.00009036823,0.0005152255],"genre_scores_gemma":[0.93198466,0.0037476013,0.06381528,0.00007897737,0.00013176707,0.00002496222,0.00007529996,0.0000070746296,0.00013436814],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983486,0.00020647347,0.0004688297,0.0005626684,0.00024750683,0.000165914],"domain_scores_gemma":[0.99837655,0.00066040916,0.00032776882,0.00045151717,0.00009860189,0.00008517051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042240214,0.000249976,0.0012029966,0.00028653772,0.000105210835,0.00021694392,0.00035983848,0.00021423565,0.000036283705],"category_scores_gemma":[0.00023407594,0.00016306611,0.00021922057,0.00024655517,0.0003548435,0.00014160087,0.0007857058,0.00027008564,8.846956e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040811873,0.000074429154,0.0009900447,0.00047745195,0.0017845266,0.000016245998,0.0010825653,0.0030694618,0.0002287217,0.23823665,0.0004613549,0.74949735],"study_design_scores_gemma":[0.16964133,0.00013613241,0.004146577,0.00012037759,0.0008592774,0.00017442805,0.0001336204,0.3518052,0.00076060125,0.4693632,0.0018128001,0.0010464134],"about_ca_topic_score_codex":0.00028238777,"about_ca_topic_score_gemma":0.000004674301,"teacher_disagreement_score":0.8471318,"about_ca_system_score_codex":0.0000066511466,"about_ca_system_score_gemma":0.000040356732,"threshold_uncertainty_score":0.6649643},"labels":[],"label_agreement":null},{"id":"W2787054667","doi":"10.1002/rsa.20930","title":"Projections of the Aldous chain on binary trees: Intertwining and consistency","year":2020,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council; University of Washington; National Science Foundation","keywords":"Markov chain; Binary tree; Combinatorics; Binary number; Chain (unit); Mathematics; Random binary tree; Tree (set theory); Consistency (knowledge bases); Space (punctuation); Discrete mathematics; Physics; Computer science; Statistics","score_opus":0.05102238902869827,"score_gpt":0.31473130244810865,"score_spread":0.2637089134194104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787054667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14140405,0.0059958603,0.82738674,0.006749332,0.0054201987,0.0062860125,0.0026646326,0.0003681821,0.00372502],"genre_scores_gemma":[0.974824,0.0002272997,0.024300717,0.00022239587,0.00022928353,0.00006179542,0.00001012768,0.000040246305,0.00008412708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868476,0.000077175915,0.00041810918,0.00040938432,0.00023599566,0.00017457412],"domain_scores_gemma":[0.99838054,0.000911429,0.0002775481,0.0002741013,0.00006942879,0.00008696744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014562118,0.00029200283,0.00064951315,0.000056618046,0.00017065248,0.00005570308,0.0001855529,0.00018619464,0.000018520845],"category_scores_gemma":[0.0012048465,0.00017671214,0.00012265572,0.00009036204,0.00017003818,0.000014806704,0.00045130204,0.0005525984,2.257353e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013728286,0.0001738899,0.000036310183,0.005252409,0.0008948391,0.000057859867,0.008192438,0.00013439803,0.0005104137,0.8702583,0.002063066,0.11105326],"study_design_scores_gemma":[0.002411147,0.0003007512,0.00017315077,0.0005903607,0.00028423333,0.00004691834,0.0005325666,0.038303785,0.0001908886,0.95676285,0.00012938156,0.00027396617],"about_ca_topic_score_codex":0.00004257191,"about_ca_topic_score_gemma":0.0000099834815,"teacher_disagreement_score":0.83342,"about_ca_system_score_codex":0.000014065609,"about_ca_system_score_gemma":0.0000787783,"threshold_uncertainty_score":0.7206112},"labels":[],"label_agreement":null},{"id":"W2803279847","doi":"10.1002/rsa.20921","title":"Recursive functions on conditional Galton‐Watson trees","year":2020,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Tree (set theory); Function (biology); Limit (mathematics); Value (mathematics); Combinatorics; Node (physics); Random tree; Random function; Set (abstract data type); Discrete mathematics; Expected value; Applied mathematics; Random variable; Statistics; Mathematical analysis; Computer science","score_opus":0.0538303328248761,"score_gpt":0.32674757633531,"score_spread":0.2729172435104339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803279847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016621081,0.0005964166,0.9889947,0.0014696397,0.0014410887,0.00083013484,0.0035747616,0.00015721495,0.0012739116],"genre_scores_gemma":[0.8165944,0.00069683784,0.17284994,0.0015278585,0.004527621,0.0004751295,0.0020296036,0.00023475043,0.0010638084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980838,0.00006772443,0.0004359358,0.0006664604,0.0004499183,0.00029621564],"domain_scores_gemma":[0.99773353,0.0013709938,0.0002512197,0.00026835423,0.0001365342,0.0002393481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012488996,0.00044206207,0.0007741193,0.00008039237,0.00023831191,0.00013537119,0.00019636929,0.000321604,0.0003298494],"category_scores_gemma":[0.0012039059,0.0003474396,0.00018214312,0.00008174399,0.00010256321,0.000029476081,0.0002164874,0.0008260018,0.0000122008905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007127798,0.000068430105,0.0000014594649,0.0005695369,0.0003478253,0.000056805693,0.00042451147,0.00017931098,0.000031710835,0.961887,0.014064939,0.021655679],"study_design_scores_gemma":[0.0026051311,0.0002503438,0.0000866763,0.00016301376,0.00025988717,0.00003355699,0.00013879062,0.011067901,0.00008920677,0.98346823,0.0014504967,0.00038676042],"about_ca_topic_score_codex":0.000014687956,"about_ca_topic_score_gemma":0.0000071400614,"teacher_disagreement_score":0.81614476,"about_ca_system_score_codex":0.000041074032,"about_ca_system_score_gemma":0.00010025648,"threshold_uncertainty_score":0.9998978},"labels":[],"label_agreement":null},{"id":"W2805309537","doi":"10.1002/rsa.20760","title":"The stripping process can be slow: Part I","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Vertex (graph theory); Mathematics; Constant (computer programming); Integer (computer science); Stripping (fiber); Degree (music); Upper and lower bounds; Discrete mathematics; Physics; Computer science; Mathematical analysis; Graph; Materials science","score_opus":0.03176608976674083,"score_gpt":0.31839516693372516,"score_spread":0.2866290771669843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805309537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06534093,0.0019288465,0.9210867,0.0034691228,0.0028230709,0.0014967795,0.00036810973,0.00030537753,0.0031810154],"genre_scores_gemma":[0.97919536,0.00021739934,0.017604897,0.0005153863,0.0016826297,0.000066033106,0.000009254935,0.00005234755,0.0006567081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880093,0.000032855285,0.00027644163,0.00025647096,0.00027962838,0.00035368445],"domain_scores_gemma":[0.99851245,0.0008963594,0.00010772367,0.0002009291,0.00015832877,0.00012419418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027415092,0.00018514828,0.00026925263,0.000021598089,0.00067616417,0.00014530383,0.00018882818,0.000074093245,0.000053017662],"category_scores_gemma":[0.0011173753,0.00010628717,0.000043802458,0.00011856898,0.00020233371,0.000038049355,0.00005374443,0.00015538812,0.0000011624389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003750545,0.000025849711,0.000010362347,0.00022038342,0.00014936582,0.0000139181175,0.0016435796,0.0000022289157,0.00008296062,0.78877544,0.0047525964,0.20394823],"study_design_scores_gemma":[0.0021507752,0.00015064675,0.00002628278,0.000045205827,0.00006681315,0.00004446052,0.0005404935,0.010877554,0.00076984765,0.97900313,0.006113406,0.00021136909],"about_ca_topic_score_codex":0.000013258647,"about_ca_topic_score_gemma":0.000036844474,"teacher_disagreement_score":0.9138544,"about_ca_system_score_codex":0.000011170062,"about_ca_system_score_gemma":0.000048072798,"threshold_uncertainty_score":0.5200576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Scaling; Vertex (graph theory); Random graph; Discrete mathematics; Graph; Geometry","score_opus":0.02395075425206081,"score_gpt":0.2966950371011621,"score_spread":0.27274428284910124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949544577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047398493,0.0027544962,0.9469311,0.0012611123,0.000327074,0.00086108514,0.00016759477,0.00004858897,0.00025045944],"genre_scores_gemma":[0.9886594,0.00024566977,0.010460777,0.0002987631,0.00022369433,0.000033930555,0.0000103223765,0.000021030806,0.000046424797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986668,0.00012296518,0.0004387411,0.00020691479,0.00031884323,0.00024568758],"domain_scores_gemma":[0.9950928,0.0042837295,0.00021616223,0.00024608016,0.00009658912,0.000064632964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006369664,0.0001984368,0.000433806,0.000053161453,0.00033760883,0.00007050206,0.00020526924,0.00008938899,0.00010085038],"category_scores_gemma":[0.00065167935,0.00009534524,0.00016383108,0.00019125629,0.0002237399,0.000061785344,0.000043144853,0.00021528186,0.0000011181124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010375032,0.000054749566,0.00000716769,0.00013713496,0.00026402326,0.0000032824316,0.0012368737,0.00062891806,0.00029983014,0.9182781,0.0006479627,0.07740447],"study_design_scores_gemma":[0.010565344,0.00006625856,0.0001683779,0.00004755102,0.00022477473,0.00003096832,0.00067842193,0.025266318,0.0008866108,0.96156675,0.0003425327,0.00015609876],"about_ca_topic_score_codex":0.000017851034,"about_ca_topic_score_gemma":0.000015411295,"teacher_disagreement_score":0.9412609,"about_ca_system_score_codex":0.000007851732,"about_ca_system_score_gemma":0.000025453463,"threshold_uncertainty_score":0.3888066},"labels":[],"label_agreement":null},{"id":"W2949999231","doi":"10.1002/rsa.20163","title":"Routing complexity of faulty networks","year":2007,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypercube; Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Static routing; Link-state routing protocol; Upper and lower bounds; Distributed computing; Theoretical computer science; Mathematics; Routing protocol; Parallel computing; Computer network","score_opus":0.05136076555920528,"score_gpt":0.3298675291891993,"score_spread":0.27850676362999405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949999231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019679736,0.00024734327,0.97919214,0.000023307679,0.00019019553,0.0001617269,0.000028462115,0.000032078508,0.00044502763],"genre_scores_gemma":[0.877288,0.000018681741,0.122465156,0.000033894517,0.00015757898,0.0000014476589,0.000004500522,0.000012345472,0.000018395986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989825,0.000018882587,0.00036662846,0.00017628874,0.00018839416,0.0002673318],"domain_scores_gemma":[0.9986241,0.0009244729,0.0001480296,0.0001249955,0.00007884729,0.00009959617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004644616,0.00014012711,0.0003772738,0.000030487225,0.00010795639,0.000019593876,0.00009253845,0.00008494607,0.000042910593],"category_scores_gemma":[0.0005334249,0.000103917744,0.00005530315,0.00010011011,0.00013087077,0.000027836644,0.000054621356,0.00014833995,2.2030495e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021301497,0.000020053365,0.000031619773,0.00010271771,0.00004157776,0.000009052524,0.00020012216,0.000022552078,0.0000837035,0.92052156,0.00007004882,0.078683965],"study_design_scores_gemma":[0.0024600653,0.000070647366,0.0008933407,0.00003788746,0.000050893028,0.000034044187,0.00016878634,0.088064015,0.00048770112,0.9075334,0.000047656085,0.00015154917],"about_ca_topic_score_codex":0.000025631414,"about_ca_topic_score_gemma":0.000012896828,"teacher_disagreement_score":0.85760826,"about_ca_system_score_codex":0.0000083641935,"about_ca_system_score_gemma":0.00000976726,"threshold_uncertainty_score":0.42376426},"labels":[],"label_agreement":null},{"id":"W2951317322","doi":"10.1002/rsa.20230","title":"A percolating hard sphere model","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"struct; SPHERES; Invariant (physics); Dimension (graph theory); Homogeneous; Poisson distribution; Mathematics; Poisson point process; Point (geometry); Translation (biology); Point process; Pure mathematics; Statistical physics; Combinatorics; Physics; Geometry; Computer science; Mathematical physics; Statistics","score_opus":0.05984098628708964,"score_gpt":0.30165796647301224,"score_spread":0.2418169801859226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951317322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060532745,0.00036140357,0.9376534,0.000059023023,0.000109247514,0.00021593389,0.00004497473,0.000077190096,0.00094606035],"genre_scores_gemma":[0.5729734,0.00008899109,0.42623982,0.00009795768,0.00014958654,0.000015242695,0.0000031639293,0.000026189484,0.00040569864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900186,0.00001801016,0.00024558857,0.00025260943,0.00022657678,0.0002553618],"domain_scores_gemma":[0.99922454,0.00037584422,0.000070158865,0.00014285564,0.00006245093,0.00012416957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101510224,0.00018012358,0.0003483325,0.000023789655,0.00028927714,0.000033100634,0.00009433282,0.00008470908,0.00009148078],"category_scores_gemma":[0.00049964595,0.0001342608,0.00006151268,0.00007034059,0.00006301904,0.0000617666,0.00005068351,0.00016415554,0.0000020759032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043381206,0.00007599634,0.000059449234,0.0004644958,0.0001499523,0.00014437023,0.0032004488,0.00060911983,0.001025399,0.90415996,0.0032675532,0.086409464],"study_design_scores_gemma":[0.0018509607,0.0000375652,0.000046715853,0.000018571956,0.000029399327,0.00015383979,0.00006467814,0.39403075,0.00007510766,0.60349524,0.000048294187,0.0001488748],"about_ca_topic_score_codex":0.000010166032,"about_ca_topic_score_gemma":0.0000027112221,"teacher_disagreement_score":0.5124406,"about_ca_system_score_codex":0.000011275516,"about_ca_system_score_gemma":0.0000402382,"threshold_uncertainty_score":0.54749966},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041386304586397284,"score_gpt":0.2870490232514411,"score_spread":0.24566271866504383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951684049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00511101,0.0030151012,0.98766947,0.0009894739,0.0014944401,0.0014016307,0.00006369272,0.00006879949,0.00018637753],"genre_scores_gemma":[0.37549376,0.00038239406,0.6230624,0.00027986028,0.0005022366,0.0001517627,0.000018605428,0.000023833143,0.00008520904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794,0.00022281421,0.00056938425,0.00048549008,0.00042221582,0.0003600894],"domain_scores_gemma":[0.99575853,0.0027356027,0.0003061967,0.000649792,0.0003610741,0.00018879383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019342538,0.00028364506,0.0009045404,0.00010936021,0.00040040136,0.00023289889,0.0009795751,0.00010939991,0.0000073488713],"category_scores_gemma":[0.00072291953,0.00016873576,0.00038322603,0.00032103187,0.0010167274,0.00026054893,0.00034412794,0.00020891814,3.862754e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.024724184,0.00007127596,0.000017932174,0.000049420178,0.00030260903,0.0000035350022,0.0019332322,0.00009823069,0.00008416204,0.42738676,0.0012821503,0.5440465],"study_design_scores_gemma":[0.11261919,0.00014244395,0.00019312112,0.000016795404,0.00006140623,0.00002792462,0.00010920546,0.27559605,0.00043895643,0.6093004,0.0013074367,0.0001871232],"about_ca_topic_score_codex":0.00026616195,"about_ca_topic_score_gemma":0.00006059196,"teacher_disagreement_score":0.54385936,"about_ca_system_score_codex":0.00002460853,"about_ca_system_score_gemma":0.00009697856,"threshold_uncertainty_score":0.6880844},"labels":[],"label_agreement":null},{"id":"W2952664795","doi":"10.1002/rsa.20305","title":"Network delay inference from additive metrics","year":2010,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Center for Integrated Protection Research of Engineering Structures; Division of Emerging Frontiers; Fonds Québécois de la Recherche sur la Nature et les Technologies; Harvard University; National Science Foundation","keywords":"Inference; Metric (unit); Multicast; Computer science; Network delay; Network topology; Algorithm; Time complexity; Mathematics; Topology (electrical circuits); Theoretical computer science; Artificial intelligence; Computer network; Combinatorics","score_opus":0.015375381536003947,"score_gpt":0.260441818624611,"score_spread":0.24506643708860706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952664795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056482307,0.005581894,0.9810733,0.00021713592,0.005253977,0.0005368156,0.0011317518,0.00024929756,0.00030760028],"genre_scores_gemma":[0.1759388,0.002944276,0.81451064,0.00078027305,0.0043958556,0.00009671472,0.0011793447,0.00006141418,0.0000926948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659777,0.00018006879,0.0005472214,0.0013931855,0.0006927987,0.0005889875],"domain_scores_gemma":[0.9965684,0.0010357266,0.00046360595,0.0013976946,0.00020762472,0.00032695514],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00039140755,0.0006436969,0.0009264762,0.00017646409,0.00040849825,0.0011627959,0.0020606222,0.00077601307,0.00010799869],"category_scores_gemma":[0.00019943703,0.00049573893,0.0001877259,0.00034643925,0.00015521438,0.00038696267,0.0048687058,0.0019672837,0.000007975768],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101491525,0.00004042128,0.00016200342,0.000043506552,0.00023355735,0.00013629395,0.00055674085,0.0022261415,0.000051532905,0.012707492,0.00825419,0.97548664],"study_design_scores_gemma":[0.0034056562,0.00007423253,0.0046650823,0.00019426679,0.00010405837,0.000033730183,0.000017165261,0.52800083,0.00025137558,0.43182132,0.030260677,0.0011716022],"about_ca_topic_score_codex":0.0008466003,"about_ca_topic_score_gemma":0.000036739,"teacher_disagreement_score":0.97431505,"about_ca_system_score_codex":0.000029846475,"about_ca_system_score_gemma":0.00018316775,"threshold_uncertainty_score":0.9998741},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011840481271994528,"score_gpt":0.2582866701298389,"score_spread":0.2464461888578444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953220200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99230015,0.0026843587,0.0012461285,0.00009390686,0.0005109966,0.0006313065,0.000038292274,0.00012228753,0.0023725496],"genre_scores_gemma":[0.9881813,0.00031951413,0.010599289,0.0001055836,0.0003487068,0.000030243058,0.000020034593,0.000052051026,0.00034330267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978116,0.00022513933,0.00060585095,0.0004930999,0.00035987012,0.00050440547],"domain_scores_gemma":[0.9985927,0.0006663416,0.00017792644,0.000416269,0.000048564823,0.00009820748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063221366,0.00040321305,0.00076523836,0.00027764632,0.00036066797,0.0000985167,0.00025327774,0.00023501279,0.00007203864],"category_scores_gemma":[0.0001139382,0.00029142882,0.00023188065,0.00027128585,0.00030508032,0.00012925103,0.00008571237,0.00032274768,6.302988e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017422574,0.00009797331,0.0033769147,0.000252625,0.00016587104,0.00014788004,0.0032791686,0.00016041598,0.0010955761,0.9650557,0.002437406,0.022188228],"study_design_scores_gemma":[0.016124317,0.00003853175,0.008950134,0.00005100258,0.000057425543,0.00007584857,0.00022963302,0.00051874487,0.0012218861,0.9704842,0.0018464267,0.00040183993],"about_ca_topic_score_codex":0.00016334276,"about_ca_topic_score_gemma":0.000076649754,"teacher_disagreement_score":0.021786388,"about_ca_system_score_codex":0.000022437493,"about_ca_system_score_gemma":0.000018652447,"threshold_uncertainty_score":0.9999538},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029820832391979118,"score_gpt":0.30409188759829436,"score_spread":0.27427105520631523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953254115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990686,0.00058248173,0.0019673326,0.0008449796,0.00014696336,0.00088657596,0.000049974507,0.000059094073,0.004776585],"genre_scores_gemma":[0.9977195,0.000114788825,0.0016240707,0.00019868399,0.000081651364,0.000010272252,0.0000035623525,0.000017343784,0.0002301188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985104,0.00025581373,0.00030669157,0.00022854215,0.00041375888,0.00028475214],"domain_scores_gemma":[0.99669564,0.0026345877,0.00011750967,0.00040343613,0.00006935591,0.00007945187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090427604,0.00019817261,0.00044509667,0.000105364685,0.00017736878,0.000048437632,0.00026379095,0.00008580511,0.00021387372],"category_scores_gemma":[0.00070541905,0.00010640016,0.00015185974,0.0001957407,0.00019444627,0.000043221215,0.000036498717,0.00028140825,0.0000024312587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002342431,0.000061963205,0.00003175275,0.00005223715,0.00009818862,0.0000123649015,0.0008349542,0.000013666759,0.0011564787,0.9632664,0.0019006792,0.030228905],"study_design_scores_gemma":[0.009054379,0.00024265281,0.00072563917,0.000036041703,0.00003185906,0.000019702919,0.00012562248,0.00062670466,0.0028061145,0.98600394,0.00019153011,0.00013580281],"about_ca_topic_score_codex":0.000013928888,"about_ca_topic_score_gemma":0.0000030799183,"teacher_disagreement_score":0.030093102,"about_ca_system_score_codex":0.000008132845,"about_ca_system_score_gemma":0.000017858833,"threshold_uncertainty_score":0.43388727},"labels":[],"label_agreement":null},{"id":"W2963002110","doi":"10.1002/rsa.20740","title":"Inside the clustering window for random linear equations","year":2017,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Mathematics; Statistical physics; Cluster (spacecraft); Partition (number theory); Random variable; Combinatorics; Physics; Computer science; Statistics","score_opus":0.023716603420420194,"score_gpt":0.28154028905786654,"score_spread":0.25782368563744634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963002110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014266849,0.0000974011,0.99437785,0.0025881457,0.0006426465,0.00046547802,0.000011007276,0.000049744547,0.00034103415],"genre_scores_gemma":[0.881757,0.000095693445,0.11729376,0.00031851706,0.0003306789,0.00004413844,0.000006570663,0.0000090338335,0.00014458584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929315,0.000036824298,0.0001708162,0.00021936289,0.00012350388,0.00015637101],"domain_scores_gemma":[0.99897003,0.00035212428,0.00014138878,0.00041353915,0.00006732172,0.00005561092],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00026183252,0.000111978414,0.00016298359,0.000037756028,0.0013637117,0.0005695805,0.00036475004,0.000046588197,0.000012810418],"category_scores_gemma":[0.00025654348,0.000072413495,0.00007553594,0.000036487734,0.00010323942,0.00034430323,0.00012589496,0.000087513305,0.0000010051551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017481,0.000007978625,0.00020059859,0.000020969033,0.0000696581,0.0000029139114,0.00097476796,0.008735551,0.00030120093,0.02611332,0.00016119434,0.96323705],"study_design_scores_gemma":[0.009377827,0.000027664104,0.0062803943,0.000011572236,0.000019155957,0.000024239689,0.000038484217,0.9713415,0.00026920892,0.009661714,0.0028006674,0.00014755658],"about_ca_topic_score_codex":0.000044761866,"about_ca_topic_score_gemma":0.00006297957,"teacher_disagreement_score":0.96308947,"about_ca_system_score_codex":0.000008277745,"about_ca_system_score_gemma":0.00003081322,"threshold_uncertainty_score":0.9999364},"labels":[],"label_agreement":null},{"id":"W2963259603","doi":"10.1002/rsa.20804","title":"Clique coloring of binomial random graphs","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Combinatorics; Mathematics; Brooks' theorem; Clique number; Graph coloring; Monochromatic color; Random graph; Clique; Clique graph; Fractional coloring; Discrete mathematics; Split graph; Chromatic scale; Graph; Chordal graph; 1-planar graph; Graph power; Line graph; Physics","score_opus":0.02181948832564345,"score_gpt":0.2919788505881161,"score_spread":0.27015936226247267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963259603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907883,0.00045784464,0.004389011,0.00004220554,0.0011652752,0.00048191787,0.000050744446,0.000076445314,0.0025482797],"genre_scores_gemma":[0.9862994,0.00014357467,0.012702491,0.00007319109,0.0006340201,0.000012961434,0.000004254956,0.000032968026,0.00009715675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984043,0.00014612405,0.0005162775,0.00033781023,0.00025978102,0.00033567258],"domain_scores_gemma":[0.99846363,0.0006919448,0.00024312662,0.00034739097,0.00013433828,0.00011956617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005448735,0.00028061707,0.00068721897,0.00015951582,0.00039388225,0.000039502655,0.0002392831,0.00018198008,0.00015471093],"category_scores_gemma":[0.00027476985,0.00019649974,0.0002107755,0.00018061834,0.00063786976,0.00009203674,0.00014710851,0.00020758898,6.5623885e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046257013,0.00005213577,0.0016453923,0.00029285767,0.0004877043,0.00001753626,0.0039852113,0.000006464166,0.003029734,0.945976,0.0013853176,0.03849594],"study_design_scores_gemma":[0.014074919,0.00025425036,0.001965107,0.000048176935,0.00012266866,0.00006379017,0.000167275,0.000461228,0.013765085,0.9672101,0.0015514713,0.0003159361],"about_ca_topic_score_codex":0.0000359876,"about_ca_topic_score_gemma":0.000011715229,"teacher_disagreement_score":0.03818,"about_ca_system_score_codex":0.000010376452,"about_ca_system_score_gemma":0.00002495395,"threshold_uncertainty_score":0.8013027},"labels":[],"label_agreement":null},{"id":"W2963647147","doi":"10.1002/rsa.20874","title":"Meyniel's conjecture holds for random <b><i>d</i></b>‐regular graphs","year":2019,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics; Graph; Random regular graph; Random graph; Constant (computer programming); Chordal graph; 1-planar graph; Computer science","score_opus":0.01381986529594286,"score_gpt":0.2690248282542968,"score_spread":0.25520496295835393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963647147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729365,0.0033676834,0.01489837,0.0003443373,0.0026704753,0.0032652968,0.00027060512,0.00027761533,0.0019691046],"genre_scores_gemma":[0.9772911,0.00023551549,0.020216659,0.00043238068,0.0004900983,0.00008640008,0.000039027444,0.000101405254,0.0011074237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977347,0.00014062274,0.0005177344,0.00064556074,0.00037521808,0.0005861678],"domain_scores_gemma":[0.99751943,0.0013372791,0.00023580529,0.0006114824,0.000106924716,0.00018905269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064081245,0.00051054655,0.0010087868,0.00016489116,0.00047505813,0.0001288418,0.0003540715,0.0003488808,0.00026522132],"category_scores_gemma":[0.00019712417,0.00035019632,0.00046394678,0.0001754279,0.00022204213,0.00014325668,0.000131956,0.00031911719,0.000002116268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002498701,0.00003938116,0.0006268283,0.00058281963,0.0005962557,0.000013241149,0.0015502597,0.000050505587,0.0015650198,0.96535045,0.004456961,0.022669567],"study_design_scores_gemma":[0.026034446,0.00020482323,0.00043173955,0.000047835023,0.00021031265,0.00009440655,0.00019319895,0.00084102794,0.0024429155,0.9549155,0.014030627,0.00055314053],"about_ca_topic_score_codex":0.000012827128,"about_ca_topic_score_gemma":0.000004432179,"teacher_disagreement_score":0.023535745,"about_ca_system_score_codex":0.000016912934,"about_ca_system_score_gemma":0.000030492098,"threshold_uncertainty_score":0.999895},"labels":[],"label_agreement":null},{"id":"W2963992790","doi":"10.1002/rsa.20828","title":"Notes on growing a tree in a graph","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of British Columbia; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of California Berkeley; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Spanning tree; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Random graph; Tree (set theory); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.02932689345265869,"score_gpt":0.31033260566423465,"score_spread":0.28100571221157594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963992790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19347985,0.0003116784,0.8031351,0.00045877558,0.0005393013,0.00047970816,0.000050222116,0.00009559094,0.0014497751],"genre_scores_gemma":[0.954621,0.00002442411,0.044806715,0.00022496065,0.00026678655,0.000014612511,0.0000018459206,0.000018617116,0.000021045471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908245,0.000027302836,0.00021988818,0.00024741536,0.00017730439,0.00024561532],"domain_scores_gemma":[0.9986744,0.0010301351,0.00005031301,0.00013011359,0.00003805257,0.00007701024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016711603,0.00016515047,0.00031319854,0.0000887158,0.000100810925,0.000042311094,0.000089252615,0.000074063915,0.00005206932],"category_scores_gemma":[0.0009545718,0.00011402386,0.000045407338,0.00015055067,0.00007644943,0.000050487135,0.00003325003,0.00013459146,0.000002727859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004554761,0.000040119638,0.000021623999,0.00008970238,0.000032487616,0.000030690215,0.0006275385,0.0000023048053,0.00030569333,0.8204725,0.00013196582,0.1777899],"study_design_scores_gemma":[0.0036763176,0.00027172727,0.00030029885,0.000076164615,0.000023392195,0.000021010837,0.00008160574,0.008165579,0.0009647752,0.9861598,0.000093592425,0.00016572894],"about_ca_topic_score_codex":0.000027702104,"about_ca_topic_score_gemma":0.000045133,"teacher_disagreement_score":0.7611411,"about_ca_system_score_codex":0.000009750961,"about_ca_system_score_gemma":0.000012301817,"threshold_uncertainty_score":0.4649758},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007191773732953024,"score_gpt":0.25165787940833034,"score_spread":0.24446610567537733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964041306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9288134,0.000014408015,0.05914099,0.0004240564,0.000053188214,0.00015275848,0.00016399726,0.000008605247,0.011228569],"genre_scores_gemma":[0.9988725,0.0000013374682,0.00076540373,0.000085305925,0.00013356075,0.0000062738095,0.000008817402,0.000008158582,0.00011864362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995238,0.000016485528,0.00008678608,0.00012256851,0.00013110635,0.000119260236],"domain_scores_gemma":[0.9994936,0.0001362404,0.00009230304,0.00020477602,0.00003714549,0.00003594503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053452542,0.00010557106,0.00015754542,0.000005110528,0.0003302099,0.00007033683,0.00014768071,0.000015366562,0.00011575458],"category_scores_gemma":[0.0000044127833,0.00005185518,0.000051889474,0.00001435009,0.00017694043,0.00005171331,0.00004786009,0.00009320403,0.0000029151745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013659018,0.000023936349,0.0011734053,0.000003820442,0.000050646282,3.0431562e-7,0.00007246668,0.00076853886,0.000018798812,0.9930975,0.00011082347,0.0045432015],"study_design_scores_gemma":[0.0021876353,0.00002468894,0.0020522904,0.000015482985,0.000024574243,8.115449e-7,0.000050301784,0.021659354,0.0006352831,0.9731759,0.00008109147,0.000092578615],"about_ca_topic_score_codex":0.00001895116,"about_ca_topic_score_gemma":4.3222883e-7,"teacher_disagreement_score":0.070059076,"about_ca_system_score_codex":0.0000012768802,"about_ca_system_score_gemma":0.000013659182,"threshold_uncertainty_score":0.2539741},"labels":[],"label_agreement":null},{"id":"W2969214740","doi":"10.1002/rsa.21032","title":"Finitary codings for gradient models and a new graphical representation for the six‐vertex model","year":2021,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Victoria","funders":"","keywords":"Finitary; Ising model; Potts model; Vertex (graph theory); Mathematics; Representation (politics); Statistical physics; Combinatorics; Function (biology); Bounded function; Pure mathematics; Physics; Mathematical analysis; Graph","score_opus":0.11102559755104825,"score_gpt":0.3499221949084578,"score_spread":0.23889659735740953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969214740","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031782407,0.0031912078,0.9898825,0.0007476224,0.00045534613,0.0018990105,0.00059382216,0.000038302882,0.000013897835],"genre_scores_gemma":[0.3229926,0.002135044,0.6729366,0.00029816086,0.00046316686,0.00071843184,0.00022113498,0.00008923825,0.00014562358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982843,0.00002758233,0.000455353,0.00065618905,0.0002621662,0.00031441555],"domain_scores_gemma":[0.99549437,0.0036232052,0.0002001699,0.0003127929,0.00019543641,0.00017400234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027693517,0.00035660126,0.0007135693,0.00005402411,0.00044505298,0.00019767793,0.00019399408,0.00028222403,0.0000058850046],"category_scores_gemma":[0.0011483635,0.00023998258,0.00023097672,0.00006378691,0.00008686691,0.000063501415,0.00035957733,0.0003380047,1.979485e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010217752,0.0000388452,9.891247e-7,0.0015763524,0.00045444007,0.000003969711,0.0025483663,0.007949935,0.000033433087,0.93012506,0.0020805835,0.05416624],"study_design_scores_gemma":[0.0022599252,0.000043157408,0.000003210853,0.00006622849,0.00031069104,0.000013290375,0.00011749065,0.49461126,0.000022157747,0.50238574,0.000014940065,0.00015194068],"about_ca_topic_score_codex":0.000064098436,"about_ca_topic_score_gemma":0.000031703472,"teacher_disagreement_score":0.48666131,"about_ca_system_score_codex":0.000016121601,"about_ca_system_score_gemma":0.00011702919,"threshold_uncertainty_score":0.9786205},"labels":[],"label_agreement":null},{"id":"W3000977365","doi":"10.1002/rsa.21085","title":"The rank of sparse random matrices","year":2022,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Random matrix; Mathematics; Rank (graph theory); Conjecture; Sparse matrix; Matrix (chemical analysis); Discrete mathematics; Combinatorics; Computer science; Physics","score_opus":0.017434872758805384,"score_gpt":0.25678329902424085,"score_spread":0.23934842626543545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000977365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14040896,0.18916437,0.64475995,0.013114345,0.0040498152,0.0024710938,0.0000597146,0.00039458214,0.005577142],"genre_scores_gemma":[0.9878436,0.0068039373,0.004859532,0.00017375236,0.00006697124,0.000037750247,0.000002753674,0.0000060239254,0.0002056803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989011,0.00031486526,0.00022668675,0.00017241602,0.00023405638,0.00015082308],"domain_scores_gemma":[0.99880654,0.000564932,0.00012369742,0.00041374573,0.000049570295,0.00004152448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328754,0.00009645031,0.00019546143,0.000045754896,0.0010519973,0.000119011165,0.0008002389,0.000014848941,0.000044299668],"category_scores_gemma":[0.000037640424,0.00006137244,0.00006823846,0.00029198316,0.0000844792,0.00009279956,0.000621603,0.00016844456,4.33297e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033873878,0.00002236389,0.00011453499,0.000010354062,0.00007490824,0.000005110763,0.0016235743,0.0011951015,0.00053238386,0.09674904,0.0022046366,0.89712924],"study_design_scores_gemma":[0.034298297,0.0003170086,0.004336953,0.000025976358,0.000056785946,0.00019086793,0.0007243393,0.5078082,0.0017921308,0.041917525,0.40785527,0.00067666476],"about_ca_topic_score_codex":0.000009975665,"about_ca_topic_score_gemma":0.0000051415764,"teacher_disagreement_score":0.8964526,"about_ca_system_score_codex":0.000010307957,"about_ca_system_score_gemma":0.000027985028,"threshold_uncertainty_score":0.8091219},"labels":[],"label_agreement":null},{"id":"W3041621019","doi":"10.1002/rsa.21072","title":"Root estimation in Galton–Watson trees","year":2022,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Tree (set theory); Root (linguistics); Mathematics; Estimator; Statistics; Galton's problem; Tree structure; K-ary tree; Interval tree; Combinatorics; Binary tree","score_opus":0.028908649124874328,"score_gpt":0.3278969222721739,"score_spread":0.29898827314729953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041621019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045378085,0.0022289492,0.9483445,0.00026975197,0.0012827308,0.00121611,0.0005060821,0.00013532866,0.0006384499],"genre_scores_gemma":[0.81561553,0.00028413069,0.18288197,0.00006815302,0.00028340932,0.00032335412,0.00020814703,0.00009104334,0.00024425884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802047,0.00010100149,0.0005548051,0.00056358834,0.00043036338,0.00032975938],"domain_scores_gemma":[0.9983837,0.0008924999,0.00024994038,0.00032078708,0.00004550351,0.000107590764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039709845,0.00037711026,0.000791313,0.00015600855,0.00014767038,0.00012553019,0.00025648213,0.00023756869,0.00040467645],"category_scores_gemma":[0.00092613866,0.00031819814,0.00010582366,0.00012672775,0.000047587848,0.000044291894,0.00049654493,0.00081599405,9.166129e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009781079,0.00020553649,0.000087397915,0.0028557682,0.00025922628,0.00019675799,0.0031823337,0.009919895,0.000033539112,0.6417414,0.0012147105,0.33932534],"study_design_scores_gemma":[0.0023113643,0.000066956796,0.00041755554,0.000101636266,0.000081770384,0.00002073555,0.00012721324,0.20311113,0.000027126382,0.7932745,0.00015568337,0.00030430735],"about_ca_topic_score_codex":0.00012299494,"about_ca_topic_score_gemma":0.000102611906,"teacher_disagreement_score":0.77023745,"about_ca_system_score_codex":0.00007806026,"about_ca_system_score_gemma":0.000082402235,"threshold_uncertainty_score":0.999927},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0614846637957399,"score_gpt":0.2928030503401969,"score_spread":0.23131838654445697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083134037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14678872,0.0033742946,0.84547067,0.00007127628,0.0005226818,0.0012582149,0.000101860685,0.00010062466,0.0023116653],"genre_scores_gemma":[0.9375351,0.00014005206,0.06206122,0.000029468765,0.00008156038,0.00003599757,0.0000027094252,0.000022440712,0.000091452814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987596,0.000055877423,0.00041454533,0.00025807353,0.00025822464,0.00025362577],"domain_scores_gemma":[0.9991081,0.0002927857,0.00017610531,0.00018662596,0.00012149342,0.000114900795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020689139,0.00022176126,0.0005946935,0.00005449147,0.000102015816,0.000021121314,0.0001459542,0.00009105264,0.00011123071],"category_scores_gemma":[0.00046227197,0.00014169322,0.00009525825,0.00007287904,0.0001427452,0.000056065932,0.00006122857,0.000118960124,0.0000013742597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009745105,0.0003826806,0.0001659036,0.001512639,0.0007587976,0.00005282223,0.010893589,0.0000067490396,0.0036419407,0.78865576,0.00063041406,0.18355359],"study_design_scores_gemma":[0.014977073,0.00039922356,0.00048898876,0.0002069903,0.00028669342,0.0000558655,0.0007105815,0.0032877591,0.025579238,0.9535701,0.00008214903,0.00035531132],"about_ca_topic_score_codex":0.00004358145,"about_ca_topic_score_gemma":0.000017548688,"teacher_disagreement_score":0.7907464,"about_ca_system_score_codex":0.000010523692,"about_ca_system_score_gemma":0.000027243324,"threshold_uncertainty_score":0.5778082},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012982554437415035,"score_gpt":0.2710556701729983,"score_spread":0.2580731157355833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083145360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96967316,0.0015926961,0.027304552,0.00001723172,0.00037642036,0.00040260536,0.00014060926,0.000037953225,0.00045476807],"genre_scores_gemma":[0.9935743,0.0002600064,0.005974244,0.000014192545,0.00008850369,0.0000033887088,0.000030908817,0.00002164665,0.000032759213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981755,0.00010361348,0.00074153085,0.0002728238,0.0003887571,0.0003177682],"domain_scores_gemma":[0.9980939,0.0008463428,0.0004066702,0.00037984012,0.0001638048,0.00010946165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011965891,0.0002563411,0.00075259065,0.00016075517,0.00018306618,0.000013178685,0.00020341964,0.00018757035,0.000039075356],"category_scores_gemma":[0.00028849847,0.00018182646,0.00030877267,0.00030509479,0.0004900161,0.0000732009,0.000080273785,0.00017789789,6.488953e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026266773,0.00005969915,0.0024815036,0.00040460864,0.00032924116,0.000011860573,0.0010836108,0.000007666301,0.0038319367,0.9576573,0.0003405895,0.031165304],"study_design_scores_gemma":[0.009918774,0.000115187504,0.013944526,0.000058292902,0.00016091636,0.000041239768,0.00024394407,0.00007591221,0.03233335,0.9425106,0.00036938337,0.00022786856],"about_ca_topic_score_codex":0.000035538455,"about_ca_topic_score_gemma":0.0000068867876,"teacher_disagreement_score":0.030937435,"about_ca_system_score_codex":0.0000088776305,"about_ca_system_score_gemma":0.000014093185,"threshold_uncertainty_score":0.74146676},"labels":[],"label_agreement":null},{"id":"W3083259271","doi":"10.1002/rsa.20253","title":"Short cycle distribution in random regular graphs recursively generated by pegging","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain; Random graph; struct; Mathematics; Poisson distribution; Limit (mathematics); Type (biology); Coupling (piping); Distribution (mathematics); Joint probability distribution; Combinatorics; Homogeneous; Discrete mathematics; Computer science; Graph; Statistics","score_opus":0.02014204919939748,"score_gpt":0.2733798636874811,"score_spread":0.2532378144880836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083259271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33393088,0.0014433027,0.66334057,0.000099828205,0.00021105699,0.00046990465,0.0003559858,0.000071896764,0.00007655223],"genre_scores_gemma":[0.98629034,0.00055386755,0.012745929,0.000044942484,0.00008468882,0.0000356206,0.00016389803,0.00002789713,0.00005283786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848425,0.0000745116,0.00041335073,0.00036999368,0.0002879187,0.00036995663],"domain_scores_gemma":[0.99909806,0.00043739693,0.000082034196,0.00015856333,0.00008565785,0.0001383064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024846283,0.00025021497,0.0005294066,0.00005616291,0.00025622273,0.000041238585,0.00011765126,0.0001375921,0.00002489359],"category_scores_gemma":[0.0005407322,0.00020124376,0.00007505251,0.00024213736,0.000104827086,0.00008169437,0.00003989239,0.00022458761,7.517577e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006415517,0.0005546125,0.0006320535,0.0007792854,0.0005514525,0.00084408326,0.0031248697,0.00030155163,0.008871009,0.6990654,0.024327379,0.25453278],"study_design_scores_gemma":[0.015954422,0.00013725116,0.0007886817,0.00009533597,0.0001043305,0.00029359435,0.00016118637,0.060517922,0.003304882,0.9175164,0.0005344939,0.0005914725],"about_ca_topic_score_codex":0.00003678721,"about_ca_topic_score_gemma":0.0000055133414,"teacher_disagreement_score":0.6523594,"about_ca_system_score_codex":0.0000330444,"about_ca_system_score_gemma":0.000031001564,"threshold_uncertainty_score":0.82064825},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019740144231858853,"score_gpt":0.31870924486373264,"score_spread":0.29896910063187376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083295155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60264754,0.00025630507,0.3939533,0.00019219461,0.00065008976,0.00059625914,0.000029285533,0.00017969852,0.0014953704],"genre_scores_gemma":[0.8926153,0.000017177723,0.10638381,0.00014188951,0.00054221106,0.000013133729,0.000011621856,0.000047688685,0.00022717354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988333,0.000031291467,0.0003550011,0.00021839926,0.00024980976,0.00031218267],"domain_scores_gemma":[0.9985142,0.0009260426,0.00012791778,0.00024505824,0.00007100171,0.00011580451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003215561,0.00019581645,0.00033567374,0.00007039566,0.00019457917,0.000047360747,0.00012382066,0.000095581614,0.0000841628],"category_scores_gemma":[0.00035710857,0.00015497097,0.00008063846,0.000121238634,0.00007238806,0.00010051296,0.000057222365,0.00016748907,0.000004094849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029945408,0.00015249118,0.0006641097,0.00039735617,0.0002745032,0.00010140321,0.0043150224,0.000036950263,0.0024486557,0.899069,0.003809849,0.08843122],"study_design_scores_gemma":[0.0031646064,0.000036172452,0.00081170007,0.000013532673,0.000051365703,0.000043146192,0.00022702717,0.00047191035,0.001472394,0.9909068,0.0025939655,0.00020741779],"about_ca_topic_score_codex":0.000006773343,"about_ca_topic_score_gemma":0.000007621528,"teacher_disagreement_score":0.28996778,"about_ca_system_score_codex":0.000025281419,"about_ca_system_score_gemma":0.000013311476,"threshold_uncertainty_score":0.6319533},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017241933446507637,"score_gpt":0.27435222067546555,"score_spread":0.2571102872289579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083377090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917499,0.0046031685,0.0016275366,0.000244921,0.00047536637,0.0005703148,0.00007833276,0.000059114504,0.0005913793],"genre_scores_gemma":[0.98975265,0.00060655124,0.009190863,0.0001501825,0.00018439822,0.000006453365,0.0000038659828,0.000034849898,0.00007016346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792284,0.00031027637,0.0005816953,0.00039688853,0.0004065996,0.0003816985],"domain_scores_gemma":[0.9958843,0.0032492212,0.00019810788,0.00040440052,0.00012031305,0.00014367994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042053653,0.0003765346,0.0009889744,0.00012994018,0.0008149988,0.000052667183,0.0002594434,0.00020152735,0.00007136128],"category_scores_gemma":[0.0010342578,0.00020301227,0.00024898804,0.0001799084,0.002358069,0.0001204789,0.00018125016,0.00039008263,8.830349e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004715184,0.000025895291,0.0009300418,0.0003007895,0.0003798846,0.000047762664,0.008281936,0.000007147319,0.0012879192,0.9724633,0.0006681037,0.010892005],"study_design_scores_gemma":[0.025627362,0.00007893408,0.0026797785,0.00004848414,0.00023014854,0.0007410801,0.0003827358,0.0009016298,0.001429774,0.96740335,0.00018234162,0.00029438088],"about_ca_topic_score_codex":0.00003095377,"about_ca_topic_score_gemma":0.0000074616405,"teacher_disagreement_score":0.020912176,"about_ca_system_score_codex":0.0000051295624,"about_ca_system_score_gemma":0.000024028137,"threshold_uncertainty_score":0.86884034},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008304581060683752,"score_gpt":0.2488744036981109,"score_spread":0.24056982263742716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083548150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9241416,0.0012633201,0.055736486,0.0010153496,0.0012064342,0.0020277812,0.00010821188,0.00018743241,0.014313395],"genre_scores_gemma":[0.9915502,0.000025077094,0.005848675,0.00015627695,0.0022376417,0.00006286448,0.00005470883,0.00001944976,0.000045094388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853873,0.00016996542,0.0003515435,0.00032500713,0.00020869008,0.00040603342],"domain_scores_gemma":[0.99890465,0.00047160286,0.0001108743,0.00040412488,0.0000360392,0.00007270221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006254289,0.0002594635,0.00049133616,0.000061385734,0.00029524288,0.00016665066,0.00036564108,0.00006309201,0.0005114831],"category_scores_gemma":[0.000010457964,0.00016419917,0.0001927805,0.00027927925,0.00010937877,0.00007638113,0.000088608715,0.0005916109,0.0000032436942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009456762,0.00018855646,0.033000458,0.000036853085,0.00058329693,0.000030563046,0.0022017097,0.0023894124,0.002225266,0.17125013,0.022864286,0.7642838],"study_design_scores_gemma":[0.029837862,0.000115862735,0.037706196,0.000059445098,0.00033029105,0.00004465918,0.0005223746,0.15212676,0.00028147668,0.5478121,0.22983538,0.0013275812],"about_ca_topic_score_codex":0.00032001472,"about_ca_topic_score_gemma":0.00019331858,"teacher_disagreement_score":0.7629562,"about_ca_system_score_codex":0.000004360994,"about_ca_system_score_gemma":0.000016952434,"threshold_uncertainty_score":0.6695848},"labels":[],"label_agreement":null},{"id":"W3088015146","doi":"10.1002/rsa.20960","title":"The Glauber dynamics for edge‐colorings of trees","year":2020,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council","keywords":"Glauber; Mathematics; Combinatorics; Tree (set theory); Monotonic function; Ergodic theory; Degree (music); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Block (permutation group theory); Relaxation (psychology); Computer science; Pure mathematics; Physics; Mathematical analysis","score_opus":0.04033608779503749,"score_gpt":0.3188249526561544,"score_spread":0.2784888648611169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088015146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562438,0.0049772575,0.41122964,0.008647841,0.0012635703,0.0036340742,0.00050741807,0.00019783223,0.007104353],"genre_scores_gemma":[0.81931704,0.000507756,0.17785919,0.00036308568,0.0007308274,0.000111015965,0.00001669823,0.00007411498,0.0010202582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917465,0.000057421912,0.00027474447,0.00018022984,0.0001278744,0.00018505815],"domain_scores_gemma":[0.99825144,0.0013095847,0.0001333049,0.00014848467,0.00007050612,0.000086675995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035357467,0.00014389797,0.00035369795,0.000015491838,0.0001658057,0.000039200295,0.00014309405,0.00006845138,0.000004042636],"category_scores_gemma":[0.0005760823,0.00008363866,0.00014395497,0.00006615067,0.000102260456,0.000030250034,0.000058675498,0.0000933168,6.1906222e-9],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021419215,0.000032135827,0.00031771758,0.0006928828,0.00040453294,0.0000050640224,0.0026810227,0.000024559762,0.0016245849,0.59621054,0.0051272754,0.39073774],"study_design_scores_gemma":[0.036685567,0.0013090953,0.0010127175,0.00012380793,0.0007720743,0.000048999005,0.0054291887,0.23022208,0.013276532,0.4952086,0.21464731,0.0012640326],"about_ca_topic_score_codex":0.000008647063,"about_ca_topic_score_gemma":0.000045711564,"teacher_disagreement_score":0.3894737,"about_ca_system_score_codex":0.000008931383,"about_ca_system_score_gemma":0.000015042596,"threshold_uncertainty_score":0.34106857},"labels":[],"label_agreement":null},{"id":"W3096725197","doi":"10.1002/rsa.20966","title":"A probabilistic approach to the leader problem in random graphs","year":2020,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Coalescent theory; Multiplicative function; Mathematics; Probabilistic logic; Random graph; Jump; Combinatorics; Brownian motion; Fixation (population genetics); Statistical physics; Graph; Discrete mathematics; Statistics; Mathematical analysis; Physics; Phylogenetic tree","score_opus":0.042101582419352766,"score_gpt":0.28141235183195706,"score_spread":0.2393107694126043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096725197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00456181,0.0005711677,0.98805183,0.0030596112,0.000120373435,0.0022857857,0.0000682669,0.00008155442,0.001199579],"genre_scores_gemma":[0.81305623,0.000041840667,0.18466087,0.0014942106,0.00028499283,0.00034092108,0.000010170973,0.00005220419,0.00005853204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984773,0.00008210559,0.00038672137,0.00041751502,0.00028970916,0.00034664889],"domain_scores_gemma":[0.9987423,0.00075386476,0.00007361249,0.00017382685,0.000054334127,0.00020206026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031734712,0.00024207769,0.00050975924,0.000044200733,0.0001304182,0.000093341245,0.0002405721,0.0000825363,0.00002240952],"category_scores_gemma":[0.0012898725,0.00013900216,0.000071637696,0.00035596025,0.00006841751,0.00004130227,0.00008997809,0.00028021098,0.0000030917492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013527685,0.00008834481,0.000008837829,0.00082419225,0.00007855369,0.000015136581,0.0069488403,0.00069401175,0.00005562887,0.9583242,0.002017776,0.029591687],"study_design_scores_gemma":[0.008806947,0.0001577335,0.00005513672,0.000044555763,0.00007739141,0.000034901645,0.0005962283,0.084539235,0.000029021841,0.90445185,0.00092034583,0.00028665736],"about_ca_topic_score_codex":0.000018518613,"about_ca_topic_score_gemma":0.000008412118,"teacher_disagreement_score":0.80849445,"about_ca_system_score_codex":0.0000115273915,"about_ca_system_score_gemma":0.000037784168,"threshold_uncertainty_score":0.5668344},"labels":[],"label_agreement":null},{"id":"W3106018864","doi":"10.1002/rsa.21167","title":"Matchings on trees and the adjacency matrix: A determinantal viewpoint","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Mathematics; Logarithm; Adjacency matrix; Combinatorics; Vertex (graph theory); Matching (statistics); Entropy (arrow of time); Adjacency list; Discrete mathematics; Statistics; Mathematical analysis; Graph","score_opus":0.018177185056195175,"score_gpt":0.3068621500989922,"score_spread":0.288684965042797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106018864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99570704,0.0004511829,0.00043469985,0.002123415,0.0001013523,0.000589194,0.000042761574,0.00012500772,0.00042535755],"genre_scores_gemma":[0.9965896,0.00070810417,0.0017336978,0.00022539857,0.0001269711,0.000089975154,0.0000064538544,0.000022887754,0.00049690844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919033,0.00009046217,0.00019904762,0.00020935142,0.00012992043,0.00018089372],"domain_scores_gemma":[0.9987511,0.00088785245,0.00007781926,0.00019971271,0.0000127910935,0.00007069831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043482083,0.00015772496,0.00028079486,0.000058363847,0.00036753452,0.00006946929,0.000112280126,0.0000527606,0.000024777986],"category_scores_gemma":[0.00012834108,0.000084914864,0.00008710073,0.00014381691,0.00020903922,0.0000392491,0.00006352662,0.00014348437,0.0000063692346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003518808,0.000013167192,0.000024761111,0.00005794941,0.000040719067,0.000007684065,0.001626946,0.0000027586511,0.00033642218,0.9606295,0.00096013455,0.035948057],"study_design_scores_gemma":[0.0050185146,0.00003320566,0.0013465526,0.00003233268,0.00005457457,0.00006622309,0.00037417107,0.0011004581,0.00037077442,0.9900978,0.0013768936,0.0001284773],"about_ca_topic_score_codex":0.000012771865,"about_ca_topic_score_gemma":0.000006059551,"teacher_disagreement_score":0.03581958,"about_ca_system_score_codex":0.000003430941,"about_ca_system_score_gemma":0.0000064249825,"threshold_uncertainty_score":0.34627277},"labels":[],"label_agreement":null},{"id":"W3140827421","doi":"10.1002/rsa.70030","title":"Sampling Matrices From Harish‐Chandra–Itzykson–Zuber Densities With Applications to Quantum Inference and Differential Privacy","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Science and Technology Agency; Deutsche Forschungsgemeinschaft; National Science Foundation; National Science and Technology Council","keywords":"Lambda; Hermitian matrix; Random matrix; Haar measure; Unitary matrix; Eigenvalues and eigenvectors; Distribution (mathematics); Matrix (chemical analysis); Combinatorics; Mathematics; Discrete mathematics; Physics; Unitary state; Pure mathematics; Quantum mechanics; Mathematical analysis","score_opus":0.025200538939365812,"score_gpt":0.3218748276282398,"score_spread":0.296674288688874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140827421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5571833,0.00088108494,0.44028318,0.0004205045,0.0000609085,0.00086395076,0.00011241267,0.000079651174,0.000114993236],"genre_scores_gemma":[0.93834543,0.0004568338,0.060307473,0.00010815941,0.0002175552,0.0003131037,0.000033109296,0.000025110638,0.00019321058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998703,0.000036751706,0.00034206288,0.00046344442,0.0001943609,0.00026035303],"domain_scores_gemma":[0.99832195,0.0009849579,0.00013147613,0.00033790848,0.00009203556,0.00013168046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092721304,0.00027565507,0.00049824244,0.000142911,0.00047486142,0.000347023,0.00019080256,0.00009994826,0.000039517105],"category_scores_gemma":[0.000061740924,0.00019640001,0.000054174114,0.00027560504,0.00010430072,0.00010628908,0.00015741428,0.0001691302,0.000001842032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002668005,0.00031261356,0.008138742,0.001191159,0.0013387982,0.000010987186,0.0069546066,0.00022980828,0.005130692,0.7756262,0.0026026734,0.19579573],"study_design_scores_gemma":[0.01624572,0.00012546022,0.023883384,0.00033949674,0.000935445,0.000028733786,0.001475206,0.010632186,0.0014247447,0.9287267,0.015155339,0.0010276274],"about_ca_topic_score_codex":0.00030732318,"about_ca_topic_score_gemma":0.00005198467,"teacher_disagreement_score":0.38116214,"about_ca_system_score_codex":0.000015099082,"about_ca_system_score_gemma":0.000035536927,"threshold_uncertainty_score":0.80089605},"labels":[],"label_agreement":null},{"id":"W3180425134","doi":"10.1002/rsa.21033","title":"Random cographs: Brownian graphon limit and asymptotic degree distribution","year":2021,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Random graph; Discrete mathematics; Degree distribution; Weak convergence; Degree (music); Limit (mathematics); Graph; Complex network; Computer science; Mathematical analysis; Physics","score_opus":0.032420914388817376,"score_gpt":0.28193330761518287,"score_spread":0.24951239322636548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180425134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06070201,0.0045221844,0.93292195,0.0002894092,0.000441345,0.00040942122,0.00041533654,0.00009673804,0.00020161284],"genre_scores_gemma":[0.9463006,0.0013892979,0.051585514,0.00016260004,0.0002310625,0.0000354988,0.00013924537,0.000042228163,0.000113903385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851173,0.00007942184,0.00035728997,0.00042659332,0.00027892465,0.00034602784],"domain_scores_gemma":[0.998218,0.0010997744,0.00011003465,0.00020683273,0.00014885563,0.00021648164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021970438,0.00027222402,0.00055372046,0.00004739875,0.00027469202,0.00015719618,0.000086073094,0.00014622766,0.00006857539],"category_scores_gemma":[0.0011403852,0.00021213919,0.000106362655,0.00023407278,0.00012847611,0.00007256069,0.00008077165,0.00021344243,0.0000010142707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013656927,0.00014400718,0.00022773443,0.0009587017,0.00048352714,0.0002463401,0.0006406836,0.000006708721,0.00077857036,0.6526302,0.0016382579,0.3408796],"study_design_scores_gemma":[0.014507109,0.00015352987,0.0016780699,0.000120071265,0.00034919157,0.000411092,0.00026634193,0.008555803,0.0009801403,0.9716562,0.0008957678,0.00042666373],"about_ca_topic_score_codex":0.00001506935,"about_ca_topic_score_gemma":0.000022553288,"teacher_disagreement_score":0.88559866,"about_ca_system_score_codex":0.00001200005,"about_ca_system_score_gemma":0.000037057416,"threshold_uncertainty_score":0.86507845},"labels":[],"label_agreement":null},{"id":"W3189397579","doi":"10.1002/rsa.21117","title":"Self‐avoiding walk on the hypercube","year":2022,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constant (computer programming); Hypercube; Integer (computer science); Mathematical proof; Mathematics; Function (biology); Dimension (graph theory); Combinatorics; Computer science; Geometry","score_opus":0.03188254265950904,"score_gpt":0.2804943814639603,"score_spread":0.24861183880445123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189397579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21074976,0.0033137712,0.76270187,0.005974122,0.0033597045,0.0030220528,0.00073633017,0.00071089406,0.009431492],"genre_scores_gemma":[0.98169494,0.00006216703,0.017098434,0.0006518487,0.0002085422,0.000089504014,0.0000044260937,0.00003048478,0.00015962715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888897,0.000119648816,0.00018736112,0.00022731829,0.00034631183,0.00023036585],"domain_scores_gemma":[0.9974168,0.002238506,0.00006690626,0.00018666421,0.000025444542,0.00006571129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045133635,0.00015525139,0.00023927956,0.000031752228,0.0008646241,0.000050183335,0.00018522285,0.000031354994,0.00036881864],"category_scores_gemma":[0.0005924046,0.000092638795,0.000058009555,0.00011493915,0.000029574172,0.000021006257,0.00013745706,0.00038885634,0.0000020363223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100596924,0.0000264308,7.707292e-7,0.00004191284,0.00004326479,0.000014006281,0.0006046339,0.000016350208,0.000054758395,0.98173416,0.0011133134,0.016249826],"study_design_scores_gemma":[0.0016197221,0.00017507118,0.000014591603,0.000008292862,0.000056239554,0.000097194206,0.000865914,0.028800795,0.00015194654,0.96389824,0.0041468223,0.00016517226],"about_ca_topic_score_codex":0.000005604639,"about_ca_topic_score_gemma":5.2987565e-7,"teacher_disagreement_score":0.7709452,"about_ca_system_score_codex":0.000025823547,"about_ca_system_score_gemma":0.000019905863,"threshold_uncertainty_score":0.6650077},"labels":[],"label_agreement":null},{"id":"W4226108323","doi":"10.1002/rsa.21110","title":"The height of record‐biased trees","year":2022,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Permutation (music); Sigma; Tree (set theory); Mathematics; Binary tree; Order (exchange); Random permutation; Binary number; Binary search tree; Random binary tree; Rank (graph theory); Binary logarithm; Discrete mathematics; Physics; Symmetric group; Arithmetic","score_opus":0.01583621775068175,"score_gpt":0.2714602099799519,"score_spread":0.2556239922292702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226108323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022931274,0.008226492,0.98483074,0.0008084192,0.0021320514,0.00046547965,0.00005797066,0.00006366962,0.0011220797],"genre_scores_gemma":[0.059397954,0.0055383593,0.9330029,0.00028387186,0.00059642224,0.00013358863,0.00002651665,0.000044048033,0.00097633444],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977466,0.0004689692,0.00046463992,0.00062803633,0.0003899461,0.00030181505],"domain_scores_gemma":[0.9978384,0.0006233397,0.00036907697,0.001001697,0.00006605794,0.00010145996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008814842,0.0003188517,0.00061396806,0.0000827437,0.00042625415,0.00026092157,0.0013665264,0.00016653367,0.00004184584],"category_scores_gemma":[0.00006314014,0.00019395696,0.0002670352,0.00014799323,0.00014109231,0.000069444155,0.0015680549,0.00067866413,1.9161965e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086976615,0.000013066569,0.000025931222,0.00006027249,0.00012233293,0.00001370035,0.0005589384,0.00010227858,0.00007083295,0.057809256,0.00090197875,0.9402344],"study_design_scores_gemma":[0.0032047906,0.00012779048,0.0013203023,0.00005742123,0.00007255973,0.000037148176,0.000045495435,0.06810765,0.000734155,0.88547033,0.040266495,0.0005558662],"about_ca_topic_score_codex":0.00014457724,"about_ca_topic_score_gemma":0.00001913302,"teacher_disagreement_score":0.93967855,"about_ca_system_score_codex":0.000020092248,"about_ca_system_score_gemma":0.00011449335,"threshold_uncertainty_score":0.79093355},"labels":[],"label_agreement":null},{"id":"W4230636836","doi":"10.1002/rsa.20234","title":"Multiple choice tries and distributed hash tables","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"String (physics); Mathematics; Constant (computer programming); Hash function; Combinatorics; Bounded function; Perfect hash function; Binary logarithm; Hash table; Reduction (mathematics); Discrete mathematics; Trie; Simple (philosophy); Computation; Randomized algorithm; Online algorithm; Asymptotically optimal algorithm; Data structure; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.01424389141719585,"score_gpt":0.22836968136473534,"score_spread":0.2141257899475395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230636836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62562245,0.0035947377,0.3671245,0.0020467166,0.00038613912,0.0004215347,0.000116451265,0.00063343573,0.00005405624],"genre_scores_gemma":[0.9327889,0.00042976145,0.06631724,0.00018191572,0.00012741846,0.00002202793,0.000017149574,0.000010709022,0.0001048986],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986851,0.000035299774,0.00020718198,0.00047145164,0.00022660756,0.00037436583],"domain_scores_gemma":[0.99891955,0.0004439027,0.000065480344,0.00037615385,0.000057664056,0.00013726928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011472626,0.00022478623,0.0003549182,0.00009857699,0.00042230933,0.00018986868,0.0004846038,0.00010824449,0.0000039650113],"category_scores_gemma":[0.00035489697,0.00017435857,0.000037475675,0.00035324346,0.00023111484,0.0002772691,0.0004480485,0.00016322787,0.0000013574953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042464954,0.00010894944,0.082063965,0.00012659498,0.00033995303,0.00038760432,0.0031648807,0.002248601,0.0035614052,0.016152652,0.043838065,0.8475827],"study_design_scores_gemma":[0.027095221,0.0005530655,0.5729445,0.000102103804,0.00006369803,0.0014197307,0.00025871524,0.15780981,0.010165065,0.043129712,0.18436402,0.0020943584],"about_ca_topic_score_codex":0.0001485567,"about_ca_topic_score_gemma":0.00004000821,"teacher_disagreement_score":0.8454883,"about_ca_system_score_codex":0.000014284278,"about_ca_system_score_gemma":0.000023996163,"threshold_uncertainty_score":0.7110136},"labels":[],"label_agreement":null},{"id":"W4231640515","doi":"10.1002/rsa.20093","title":"Degree distribution of the greatest common divisor of polynomials over 𝔽<sub><i>q</i></sub>","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Universidade de Macau","keywords":"Mathematics; Degree (music); Greatest common divisor; Poisson distribution; Finite field; Divisor (algebraic geometry); Distribution (mathematics); Combinatorics; Degree distribution; Irreducible polynomial; Discrete mathematics; Statistics; Polynomial; Mathematical analysis","score_opus":0.03064747437101656,"score_gpt":0.3002957214514596,"score_spread":0.26964824708044305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231640515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99701875,0.00023892273,0.0016946952,0.0001630329,0.000061908664,0.00035149133,0.00021572986,0.000014521117,0.00024095886],"genre_scores_gemma":[0.99921006,0.00006111283,0.00046117266,0.000019343717,0.00013345717,0.0000059602025,0.000012708407,0.00001766231,0.00007850565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998603,0.0001689787,0.00043468768,0.0001790676,0.00037680982,0.00023745756],"domain_scores_gemma":[0.99856764,0.0006505448,0.0002566329,0.0003732756,0.00008149613,0.000070405884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044585182,0.00016887486,0.00048950984,0.00003535192,0.00011489572,0.000022393691,0.00024324887,0.00009585355,0.000047443827],"category_scores_gemma":[0.00026494046,0.00010331663,0.00016961861,0.000154811,0.00032647094,0.0000687556,0.00014731797,0.00017118844,0.0000011570776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033390566,0.0006697102,0.043179784,0.0013896661,0.001460794,0.000015362451,0.0025731,0.00022372772,0.13339892,0.15883143,0.0069448915,0.64797354],"study_design_scores_gemma":[0.012839439,0.00015597702,0.08607444,0.00020055364,0.00038747542,0.00006784024,0.00017253704,0.0045838603,0.61893576,0.27545074,0.00068945455,0.00044193384],"about_ca_topic_score_codex":0.0000633182,"about_ca_topic_score_gemma":0.00004552652,"teacher_disagreement_score":0.6475316,"about_ca_system_score_codex":0.000029325318,"about_ca_system_score_gemma":0.000030471727,"threshold_uncertainty_score":0.421313},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010650095032135227,"score_gpt":0.2527004330042177,"score_spread":0.24205033797208245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232597137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98855406,0.0063206395,0.0026536612,0.000070636954,0.0003583761,0.0006131494,0.00017132323,0.000106886626,0.0011512392],"genre_scores_gemma":[0.9942968,0.00039027928,0.0048028505,0.00004684561,0.00018399983,0.000019907859,0.000020887848,0.000037467387,0.00020098551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816674,0.00011519828,0.0005759392,0.00042905516,0.0003626627,0.00035039196],"domain_scores_gemma":[0.9984032,0.000686475,0.00029843868,0.0003680873,0.00016416072,0.000079633464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039834747,0.0003388735,0.0007487733,0.0001118583,0.00032817878,0.00004894282,0.000245855,0.00015942367,0.000064127846],"category_scores_gemma":[0.00033102254,0.00023296442,0.00016791615,0.00027035835,0.0003472015,0.00011059645,0.00009151729,0.00020038403,2.0702942e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051242528,0.00046787472,0.006741845,0.0040107435,0.00093238725,0.000033952725,0.0025097788,0.00008436167,0.034460973,0.8903873,0.028585197,0.026661312],"study_design_scores_gemma":[0.0106707895,0.00007628092,0.0009861195,0.00005133422,0.00013179655,0.000031950833,0.000065752574,0.00011296294,0.05597589,0.93042344,0.0011189067,0.00035474732],"about_ca_topic_score_codex":0.00012544198,"about_ca_topic_score_gemma":0.000012932675,"teacher_disagreement_score":0.040036146,"about_ca_system_score_codex":0.000009132974,"about_ca_system_score_gemma":0.00003232744,"threshold_uncertainty_score":0.95000136},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028496874241570196,"score_gpt":0.2856307604095207,"score_spread":0.25713388616795047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233522140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33430567,0.0046402444,0.6583379,0.0002643053,0.00043793386,0.00045992088,0.00007665344,0.00006919395,0.0014081665],"genre_scores_gemma":[0.9603158,0.0004930732,0.038960107,0.000021560865,0.00011069286,0.0000060672605,0.0000013563593,0.000012444742,0.00007889956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923974,0.00004241333,0.00024050377,0.00012373159,0.00019006454,0.00016354924],"domain_scores_gemma":[0.9976211,0.0020301002,0.000096304255,0.00013420513,0.00005969774,0.000058543876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020476179,0.00011053267,0.0002579848,0.000018486251,0.00031907778,0.000018363904,0.000104363266,0.000045328547,0.000017023858],"category_scores_gemma":[0.00097361126,0.000059844133,0.00004815788,0.00006788932,0.00015195362,0.00002660449,0.00003908682,0.00008771278,3.3774936e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005814531,0.000028523456,0.000057794554,0.00010419379,0.00010543701,0.0000240059,0.000750395,0.000003714237,0.0004606948,0.9022847,0.00056669157,0.095032446],"study_design_scores_gemma":[0.0023097603,0.00008285721,0.0008277922,0.00002739468,0.000045979294,0.00024686966,0.00013472665,0.006307138,0.00092604617,0.988303,0.0006633793,0.00012503855],"about_ca_topic_score_codex":0.00002564065,"about_ca_topic_score_gemma":0.000006979717,"teacher_disagreement_score":0.6260101,"about_ca_system_score_codex":0.000004545869,"about_ca_system_score_gemma":0.000021228187,"threshold_uncertainty_score":0.24541205},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028628187330112166,"score_gpt":0.2886299335355384,"score_spread":0.2600017462054262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233604521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942512,0.0005313167,0.0038786829,0.00021977244,0.00017398265,0.00028510496,0.00004721112,0.000060961607,0.0005517744],"genre_scores_gemma":[0.9855623,0.00010948319,0.013623084,0.000048526614,0.0002669735,0.0000049877804,0.0000110432575,0.00001287541,0.0003607239],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878144,0.000103259474,0.0004663927,0.00021543243,0.00020322601,0.00023022674],"domain_scores_gemma":[0.99890226,0.00055766065,0.0001954769,0.00019584007,0.00006476732,0.00008397456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034251876,0.00019574996,0.0006582692,0.00006867773,0.0001059089,0.000037395665,0.00014439753,0.00013038126,0.0006084119],"category_scores_gemma":[0.0002568243,0.00013544234,0.00012433817,0.00012937392,0.000117707794,0.00006220463,0.00005670022,0.00013725579,0.0000022672245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013510444,0.0009539493,0.004972159,0.0010981675,0.0015545806,0.000121874196,0.00437573,0.0002528577,0.01600893,0.31036747,0.0037443521,0.64303946],"study_design_scores_gemma":[0.10758699,0.0009644647,0.0974065,0.00016348295,0.0006530706,0.00044210252,0.0008765015,0.024400705,0.019776233,0.72017354,0.025687184,0.0018692497],"about_ca_topic_score_codex":0.00001649734,"about_ca_topic_score_gemma":0.0000041576895,"teacher_disagreement_score":0.6411702,"about_ca_system_score_codex":0.000007638273,"about_ca_system_score_gemma":0.000012021527,"threshold_uncertainty_score":0.6661684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021293882123815177,"score_gpt":0.2314728767151354,"score_spread":0.21017899459132022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234267841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06678541,0.00048738104,0.93082494,0.0005497221,0.00036982715,0.000620906,0.000031622356,0.00012638824,0.00020380155],"genre_scores_gemma":[0.91230184,0.0005570567,0.08679266,0.00016056666,0.00008377222,0.00003588161,0.000010530549,0.000008795943,0.000048886606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906725,0.000026639227,0.00021371868,0.00035277076,0.00014475986,0.00019486865],"domain_scores_gemma":[0.9994723,0.00011060168,0.00008774404,0.0001504871,0.00006779077,0.00011106493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012865945,0.00015968518,0.00022010507,0.000083945924,0.0003965097,0.00013063147,0.00008597368,0.00008202828,0.000028292827],"category_scores_gemma":[0.000025904345,0.00013333677,0.00005029632,0.00009958062,0.00019003871,0.0003134794,0.00004708815,0.00009440674,6.1630607e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084925996,0.000016660992,0.008414672,0.00007350939,0.000080462596,0.000015688196,0.0015790308,0.0010294197,0.00089335913,0.08726814,0.00044925057,0.90009487],"study_design_scores_gemma":[0.027208174,0.0005248731,0.30478787,0.00007585963,0.000072094204,0.004914505,0.00019880779,0.5576561,0.001384266,0.09550214,0.0063554966,0.0013197701],"about_ca_topic_score_codex":0.000037675934,"about_ca_topic_score_gemma":0.00001587016,"teacher_disagreement_score":0.8987751,"about_ca_system_score_codex":0.000013848668,"about_ca_system_score_gemma":0.000033550805,"threshold_uncertainty_score":0.5437316},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03757259098329083,"score_gpt":0.28908713285420556,"score_spread":0.2515145418709147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236302493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9619558,0.0062619504,0.024327088,0.00062952616,0.0016689008,0.0023255895,0.00025724052,0.0002456622,0.0023282815],"genre_scores_gemma":[0.9886923,0.00078336935,0.008209545,0.0005404181,0.0007926855,0.00010332567,0.000010572548,0.000060823746,0.0008069766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846613,0.00004931989,0.00036293847,0.0003882991,0.0002994587,0.00043382237],"domain_scores_gemma":[0.99803466,0.0011396938,0.00013849184,0.0004998427,0.00007689284,0.00011041373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033862074,0.00032693494,0.00047776225,0.000061107916,0.0009976582,0.00006898003,0.00031670838,0.00016024207,0.00010744999],"category_scores_gemma":[0.00013393785,0.00017950965,0.00027019493,0.000113689064,0.00038077505,0.00009121276,0.00010216212,0.00024464578,9.817727e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023230591,0.00009971875,0.0009035294,0.00035735156,0.0010129552,0.00008380657,0.014404669,0.0002186667,0.0004694429,0.90104014,0.019463621,0.05962305],"study_design_scores_gemma":[0.00792464,0.000101502475,0.004059906,0.000026126303,0.0001693121,0.00046704675,0.00021315995,0.0070325043,0.0005543152,0.9574085,0.021618921,0.00042406892],"about_ca_topic_score_codex":0.000020157775,"about_ca_topic_score_gemma":0.000007833598,"teacher_disagreement_score":0.059198983,"about_ca_system_score_codex":0.00001509916,"about_ca_system_score_gemma":0.000019880701,"threshold_uncertainty_score":0.76732814},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03935174806480356,"score_gpt":0.362859618645556,"score_spread":0.3235078705807524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238105167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.967072,0.0009232177,0.024924714,0.00041718307,0.00029963307,0.0003788264,0.000019787978,0.00004238155,0.0059222686],"genre_scores_gemma":[0.9963397,0.000050108574,0.0022664056,0.00019025763,0.00022268461,0.000010934481,0.0000041463645,0.000010448735,0.000905337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978352,0.00015529404,0.0006420108,0.0004661281,0.0005452947,0.00035604846],"domain_scores_gemma":[0.9968817,0.0023517737,0.00014556771,0.00039371557,0.00007262986,0.00015458163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038864717,0.00017563837,0.00044125222,0.00024223441,0.00015126797,0.00020467557,0.00040883673,0.0000998071,0.0003961732],"category_scores_gemma":[0.0007492288,0.0001161427,0.00010785984,0.0005656225,0.00020616638,0.00018175477,0.000103172424,0.00018619496,0.000030785242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025797477,0.00006499233,0.0053714537,0.000010508969,0.000038710154,0.000050028644,0.0021445,0.0001813705,0.009101199,0.0727631,0.0018385844,0.9058558],"study_design_scores_gemma":[0.020503715,0.000057813337,0.07785823,0.000018822147,0.00001962914,0.00008223549,0.0013948345,0.00293909,0.0034134556,0.85156626,0.041748356,0.00039756915],"about_ca_topic_score_codex":0.000034216657,"about_ca_topic_score_gemma":0.000054143333,"teacher_disagreement_score":0.9054582,"about_ca_system_score_codex":0.0000113901315,"about_ca_system_score_gemma":0.000027234559,"threshold_uncertainty_score":0.47361618},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Intuition; Random graph; Mathematics; Graph; Discrete mathematics; Mathematical economics; Psychology","score_opus":0.01809614125711018,"score_gpt":0.2568782022790673,"score_spread":0.23878206102195715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242064191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011620877,0.0014854637,0.9827552,0.0020998141,0.0008065208,0.00091471476,0.000030190327,0.00017216409,0.00011508101],"genre_scores_gemma":[0.9752729,0.00026131712,0.023043081,0.0009316319,0.00039085743,0.000052730724,0.00001082418,0.00001046218,0.000026207195],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983403,0.00013070999,0.00030413998,0.0005213115,0.00029262848,0.0004108812],"domain_scores_gemma":[0.9976753,0.0014723483,0.00013428433,0.0004974511,0.000100197416,0.00012043752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063212286,0.00027805584,0.00042165455,0.00013242908,0.00062335836,0.00041141763,0.00061763945,0.000095853764,0.000014272012],"category_scores_gemma":[0.00016060384,0.00017985688,0.00026712113,0.0003834847,0.000176299,0.00032312504,0.00008428195,0.00022415849,0.0000010375902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047565534,0.00006254184,0.000024745143,0.00002460477,0.00010725329,0.0000078432795,0.0006014458,0.0005572425,0.00037718663,0.19573434,0.00057212816,0.801455],"study_design_scores_gemma":[0.016211666,0.00034839398,0.0071236533,0.000027514365,0.000060534006,0.00009018394,0.000041754003,0.27444482,0.0010009905,0.69699687,0.0032645336,0.0003890509],"about_ca_topic_score_codex":0.000033834593,"about_ca_topic_score_gemma":0.000009245192,"teacher_disagreement_score":0.963652,"about_ca_system_score_codex":0.000015950298,"about_ca_system_score_gemma":0.00003243368,"threshold_uncertainty_score":0.7334351},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034684852864017277,"score_gpt":0.3432106182288202,"score_spread":0.3085257653648029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245097098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84364784,0.00039627714,0.15480697,0.000034645072,0.00017892165,0.00046191362,0.000091251524,0.000035089404,0.00034708143],"genre_scores_gemma":[0.9065285,0.000041404594,0.09295009,0.000013202861,0.0003023868,0.000020120453,0.000033767556,0.000012516357,0.000098016055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992113,0.00009433865,0.00027505305,0.00018542608,0.00009735418,0.00013652086],"domain_scores_gemma":[0.9991954,0.00043370703,0.00012994706,0.000114190676,0.00007315487,0.00005357744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005373603,0.00011984744,0.00029872925,0.0000291833,0.00015925456,0.00004878535,0.000032817097,0.00007285553,0.0000043056216],"category_scores_gemma":[0.00009637428,0.00009212812,0.00005319771,0.000049181686,0.00006179454,0.00009201526,0.000014129545,0.000051198145,1.3064632e-9],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023528375,0.00043590713,0.01215855,0.0029289667,0.0004479321,0.0000062999466,0.0060411426,0.00008378988,0.04818457,0.7165799,0.002144831,0.20863526],"study_design_scores_gemma":[0.05678205,0.001091572,0.008739139,0.00015072737,0.0009950771,0.00010302214,0.00298171,0.06967363,0.021616612,0.8236488,0.012919472,0.0012981861],"about_ca_topic_score_codex":0.00007903765,"about_ca_topic_score_gemma":0.000049570703,"teacher_disagreement_score":0.20733707,"about_ca_system_score_codex":0.000008485075,"about_ca_system_score_gemma":0.000012843928,"threshold_uncertainty_score":0.37568757},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011113094537414308,"score_gpt":0.25131214853708483,"score_spread":0.24019905399967054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245919572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98736936,0.0035750465,0.0044801338,0.000062227096,0.00057517656,0.00057829544,0.000077033445,0.00011259666,0.0031701315],"genre_scores_gemma":[0.9856436,0.00021837115,0.013563173,0.00004092973,0.0002297566,0.000013530048,0.000014657997,0.000040397754,0.0002355463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980927,0.00015547127,0.00062110723,0.00037735788,0.00038887703,0.00036445144],"domain_scores_gemma":[0.9984576,0.00061273325,0.0002832005,0.0004507507,0.000103910366,0.00009180691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997211,0.0003382095,0.00078942056,0.00021770077,0.00032054575,0.0000426756,0.00024533152,0.00018830232,0.00010338708],"category_scores_gemma":[0.00011743681,0.00023611079,0.00033701336,0.00026273014,0.0004382476,0.000092859904,0.000095815536,0.00020517588,2.6402765e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078347203,0.000042452866,0.0014365272,0.0001908957,0.00017584398,0.000016673643,0.00037417377,0.000019372534,0.0014375862,0.9846565,0.0016169974,0.009249476],"study_design_scores_gemma":[0.010671,0.00006317393,0.004119426,0.000034216257,0.00013675817,0.00006729628,0.00008663065,0.00018243935,0.0051037427,0.9781603,0.0010787072,0.00029626492],"about_ca_topic_score_codex":0.00011009266,"about_ca_topic_score_gemma":0.000013772852,"teacher_disagreement_score":0.009887528,"about_ca_system_score_codex":0.0000073694496,"about_ca_system_score_gemma":0.000015131363,"threshold_uncertainty_score":0.96283185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02167791884311004,"score_gpt":0.2598681421901732,"score_spread":0.23819022334706313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247423216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41685343,0.0022176688,0.5778644,0.0005608813,0.00042578383,0.0016457159,0.00023769678,0.000020860292,0.00017358092],"genre_scores_gemma":[0.99776393,0.00026238163,0.0018251442,0.00003164156,0.000051472518,0.00002503959,0.00000178649,0.000015602302,0.000023012208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829,0.0002641876,0.0006409179,0.00018278389,0.00038945253,0.00023265935],"domain_scores_gemma":[0.99299675,0.005929318,0.000489087,0.00036773854,0.00016933141,0.000047775637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282854,0.00020193728,0.0006191426,0.000039513277,0.00044571934,0.000014653082,0.0003061274,0.000069411566,0.000016838721],"category_scores_gemma":[0.0017015616,0.000082619874,0.00023551486,0.00021213174,0.0004287189,0.00002366016,0.000084704145,0.00019437309,1.5443784e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010497868,0.00016381305,0.000034418073,0.00052564614,0.00054206623,0.000007061811,0.0026818947,0.00038772836,0.0106573,0.9626211,0.0008250842,0.0110560525],"study_design_scores_gemma":[0.019738967,0.00019309412,0.0007281208,0.0001700942,0.00019805218,0.00004250665,0.0006845777,0.0370193,0.009092223,0.93190044,0.00007747649,0.00015514268],"about_ca_topic_score_codex":0.00014328466,"about_ca_topic_score_gemma":0.000016574118,"teacher_disagreement_score":0.5809105,"about_ca_system_score_codex":0.000017333508,"about_ca_system_score_gemma":0.000059351994,"threshold_uncertainty_score":0.3428158},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013276901874903858,"score_gpt":0.2629478193031268,"score_spread":0.24967091742822292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301417336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1774873,0.0028921186,0.81511426,0.001152677,0.00058216474,0.0023168235,0.000052197916,0.0001888714,0.00021356907],"genre_scores_gemma":[0.97343236,0.00017568143,0.025782289,0.000049635524,0.00020385582,0.00019970912,0.000013183655,0.000015994914,0.00012726168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982794,0.00015773176,0.00034730913,0.00048154936,0.00029167812,0.00044235773],"domain_scores_gemma":[0.9983746,0.0008512523,0.0001130329,0.00042556287,0.00015141805,0.00008414701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095166086,0.00021022359,0.0002817891,0.000064704385,0.00089899095,0.0003622078,0.0003411494,0.00008221009,0.0000061222927],"category_scores_gemma":[0.00007869647,0.00012844645,0.00011230884,0.0002451738,0.00040310403,0.00025909176,0.00010915554,0.00019327182,6.649336e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011879809,0.000034584697,0.0025732948,0.00008465855,0.000109223416,0.000009645231,0.00020457951,0.00765024,0.013721896,0.5102849,0.0011475121,0.4629915],"study_design_scores_gemma":[0.013308205,0.00016186944,0.016999729,0.000012672304,0.000014442827,0.000056551144,0.00003418772,0.15684025,0.0025739686,0.80735934,0.0023354087,0.00030341416],"about_ca_topic_score_codex":0.000105460706,"about_ca_topic_score_gemma":0.0000823019,"teacher_disagreement_score":0.7959451,"about_ca_system_score_codex":0.000033681885,"about_ca_system_score_gemma":0.00005338957,"threshold_uncertainty_score":0.6914403},"labels":[],"label_agreement":null},{"id":"W4309583437","doi":"10.1002/rsa.21123","title":"Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity","year":2022,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Random graph; Vertex (graph theory); Combinatorics; Mathematical proof; Degree (music); Probabilistic logic; Discrete mathematics; Joint probability distribution; Graph; Set (abstract data type); Upper and lower bounds; Computer science; Statistics","score_opus":0.013205083916041905,"score_gpt":0.23581597389450187,"score_spread":0.22261088997845996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309583437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77273035,0.0006656012,0.22504576,0.00044412006,0.000031729433,0.00078470854,0.00010283917,0.0000427919,0.00015209935],"genre_scores_gemma":[0.9781749,0.00006164109,0.021548286,0.000060092043,0.000016797214,0.00011728757,0.0000072749403,0.0000035797796,0.000010091522],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987899,0.00012783679,0.00021077017,0.0004588606,0.00024473254,0.00016790046],"domain_scores_gemma":[0.99903953,0.00040181808,0.000077900775,0.00030794402,0.000043396674,0.0001293915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003665033,0.00014460347,0.0004207892,0.00013609756,0.0003283045,0.00008196447,0.00024115326,0.000027135062,0.00003737714],"category_scores_gemma":[0.000037777125,0.000094484814,0.000049506674,0.0009849081,0.00020127313,0.00011689771,0.00033531504,0.000108925145,1.649072e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016691224,0.00038264587,0.052945096,0.00029207495,0.00064451,0.000025284582,0.0017895772,0.000852935,0.00059451174,0.31210876,0.00020256496,0.62849295],"study_design_scores_gemma":[0.016273832,0.0008287994,0.49000067,0.000016911808,0.00024755136,0.0003618271,0.00045427226,0.011644883,0.0005671052,0.4756366,0.0031496591,0.0008179061],"about_ca_topic_score_codex":0.00013693629,"about_ca_topic_score_gemma":0.00002934949,"teacher_disagreement_score":0.627675,"about_ca_system_score_codex":0.0000073512256,"about_ca_system_score_gemma":0.000012446173,"threshold_uncertainty_score":0.3852979},"labels":[],"label_agreement":null},{"id":"W4319835964","doi":"10.1002/rsa.21127","title":"The number of perfect matchings, and the nesting properties, of random regular graphs","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Asymptotically optimal algorithm; Nesting (process); Graph; Mathematical optimization","score_opus":0.022064760954172882,"score_gpt":0.27986213489796563,"score_spread":0.25779737394379276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319835964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9187404,0.0056633414,0.072457016,0.000850175,0.00043031955,0.0014404068,0.00007035131,0.00009957744,0.00024844802],"genre_scores_gemma":[0.9947767,0.0006747566,0.004337867,0.000018926317,0.000053052252,0.000028102784,0.0000015690395,0.000020210204,0.00008881693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884623,0.00011402971,0.00039433545,0.00016743303,0.00027138254,0.00020655809],"domain_scores_gemma":[0.99668586,0.002792978,0.00019679243,0.00018865796,0.000090645626,0.000045039582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999594,0.00015512502,0.0004801728,0.000024709463,0.00031918345,0.000049474947,0.00014898696,0.000055449967,0.000005747587],"category_scores_gemma":[0.0018550967,0.000067327426,0.00008299671,0.00018355538,0.00039657703,0.000030926374,0.00010027887,0.00013830229,2.9262588e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025287538,0.000013038955,0.000053441603,0.0009088971,0.00021102799,0.0000053181743,0.0024416454,0.0000131021425,0.0009914441,0.94395316,0.00019367973,0.048686467],"study_design_scores_gemma":[0.009828702,0.000030519765,0.00007817861,0.0001370621,0.00013441443,0.000062090076,0.00067033456,0.02817785,0.0011258716,0.9595964,0.00005218612,0.00010642461],"about_ca_topic_score_codex":0.00007138809,"about_ca_topic_score_gemma":0.000004220683,"teacher_disagreement_score":0.076036334,"about_ca_system_score_codex":0.000002858202,"about_ca_system_score_gemma":0.000021695028,"threshold_uncertainty_score":0.27455327},"labels":[],"label_agreement":null},{"id":"W4320917315","doi":"10.1002/rsa.21145","title":"Approximately counting independent sets in bipartite graphs via graph containers","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Discrete mathematics; Cograph; Maximal independent set; Partition (number theory); Line graph; Graph; 1-planar graph","score_opus":0.024999747221256044,"score_gpt":0.29259423499592785,"score_spread":0.2675944877746718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320917315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996388,0.0004603299,0.0009663156,0.000087164786,0.0006410274,0.0005746581,0.000041173735,0.00023956773,0.0006017262],"genre_scores_gemma":[0.9968826,0.0002999728,0.0024330653,0.00012272736,0.00009898755,0.000044198376,0.000025826299,0.000050700786,0.000041927302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977524,0.00014907774,0.00055433816,0.00049135194,0.00043603743,0.0006167647],"domain_scores_gemma":[0.99877197,0.00052462396,0.0001854348,0.00032274492,0.00005709559,0.00013812985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095821556,0.00036269036,0.00062071916,0.00048031315,0.00036203777,0.00010416996,0.00024742834,0.00020612424,0.000058574027],"category_scores_gemma":[0.00016345031,0.0002741801,0.00017037439,0.00070404465,0.00020253264,0.00014781248,0.0001826677,0.00038004742,0.000002325891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016956015,0.0001235529,0.036141105,0.001190025,0.00078612415,0.00069426384,0.015244836,0.00031032026,0.005927874,0.8427499,0.0023355442,0.09280088],"study_design_scores_gemma":[0.00598595,0.00004618209,0.011570141,0.00005531703,0.00004848387,0.00007847745,0.00071495184,0.004465833,0.00089916616,0.9754576,0.00025673475,0.00042117512],"about_ca_topic_score_codex":0.000091421556,"about_ca_topic_score_gemma":0.000060202317,"teacher_disagreement_score":0.13270772,"about_ca_system_score_codex":0.000021229202,"about_ca_system_score_gemma":0.00001739229,"threshold_uncertainty_score":0.99997103},"labels":[],"label_agreement":null},{"id":"W4322009295","doi":"10.1002/rsa.21144","title":"Kemeny's constant for nonbacktracking random walks","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Random walk; Constant (computer programming); Vertex (graph theory); Combinatorics; Mathematics; Discrete mathematics; Simple random sample; Random regular graph; Graph; Random graph; Simple (philosophy); Statistics; Computer science; Line graph; 1-planar graph; Demography","score_opus":0.01448669002151564,"score_gpt":0.28364847749616545,"score_spread":0.2691617874746498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322009295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2872507,0.0012602882,0.6944885,0.0009576677,0.000987928,0.0035274895,0.00066848437,0.0010710355,0.00978791],"genre_scores_gemma":[0.990122,0.000057694157,0.008331651,0.000051281153,0.0008383453,0.00012983743,0.00018945463,0.00003316599,0.0002465497],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986933,0.000047234866,0.00033037656,0.00036282215,0.00016566584,0.00040060343],"domain_scores_gemma":[0.99906313,0.0004260989,0.00012309196,0.00021834517,0.00007299072,0.000096347954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035908038,0.00023663788,0.00050564023,0.000119292425,0.0003278968,0.00014080374,0.0001482038,0.000048519145,0.00023011019],"category_scores_gemma":[0.000013195812,0.00018980599,0.0002491425,0.0002673067,0.000088529516,0.0000767984,0.00007942184,0.00013220728,0.0000039670376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010704134,0.00005448827,0.0058528483,0.00009262915,0.001168445,0.0000131682955,0.00074061606,0.00056993146,0.0030023728,0.13125831,0.021111615,0.8350652],"study_design_scores_gemma":[0.03691564,0.00015826327,0.002824634,0.00009856771,0.0004943461,0.0000097067095,0.0008158512,0.12484975,0.004132593,0.7613487,0.06716093,0.0011910116],"about_ca_topic_score_codex":0.00007923826,"about_ca_topic_score_gemma":0.000005502921,"teacher_disagreement_score":0.83387417,"about_ca_system_score_codex":0.000009846248,"about_ca_system_score_gemma":0.000022816292,"threshold_uncertainty_score":0.77400637},"labels":[],"label_agreement":null},{"id":"W4388456631","doi":"10.1002/rsa.21197","title":"Sharp thresholds in adaptive random graph processes","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation of Sri Lanka; University of Toronto; National Science Foundation","keywords":"Mathematics; Random regular graph; Graph; Monotone polygon; Null graph; Combinatorics; Random graph; Line graph; Complement graph; Discrete mathematics; Voltage graph; Geometry; Pathwidth","score_opus":0.0224160680928744,"score_gpt":0.2887039899985048,"score_spread":0.2662879219056304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388456631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29983562,0.0095357,0.6813723,0.0017504507,0.0010917749,0.0027392395,0.00010086595,0.0012845086,0.0022895655],"genre_scores_gemma":[0.9874152,0.0011992637,0.010799208,0.000107762215,0.00011798841,0.00011089589,0.000010206845,0.00002436634,0.00021513083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980293,0.00013157411,0.00026612388,0.0005966865,0.0004196538,0.0005566908],"domain_scores_gemma":[0.9987077,0.00062651734,0.00006583281,0.00035939825,0.00009959259,0.00014094789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006038502,0.00023016868,0.00039261536,0.00046615055,0.00020946431,0.00018038691,0.00068150513,0.00008664604,0.000015771662],"category_scores_gemma":[0.00018311231,0.0001750515,0.00007423885,0.002037898,0.00018242281,0.0005041187,0.00032378046,0.0002810762,0.000008935946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00526311,0.00014928736,0.0064551816,0.0005779867,0.0003204931,0.0012051137,0.009930859,0.009546167,0.0020199826,0.34200597,0.0019899765,0.62053585],"study_design_scores_gemma":[0.019312538,0.000177272,0.0076362407,0.00007687372,0.000008407599,0.00007371257,0.00028075944,0.047657114,0.0017795741,0.9216551,0.0008349109,0.0005074868],"about_ca_topic_score_codex":0.000030399005,"about_ca_topic_score_gemma":0.000035531546,"teacher_disagreement_score":0.6875796,"about_ca_system_score_codex":0.000014637362,"about_ca_system_score_gemma":0.00006908902,"threshold_uncertainty_score":0.7138393},"labels":[],"label_agreement":null},{"id":"W4388496202","doi":"10.1002/rsa.21196","title":"Counting orientations of random graphs with no directed <i>k</i>‐cycles","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Conjecture; Mathematics; Binomial (polynomial); Random graph; Graph; Directed graph; Discrete mathematics; Statistics","score_opus":0.015726966115128974,"score_gpt":0.27565891537523707,"score_spread":0.2599319492601081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388496202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950456,0.00029908065,0.0013385167,0.000041031464,0.00050038146,0.00053431164,0.000120661076,0.00033998233,0.0017804579],"genre_scores_gemma":[0.9845671,0.000311311,0.014555626,0.00004591564,0.00016317633,0.000031865147,0.000038414815,0.000049692033,0.0002369022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984565,0.00011013992,0.00041951574,0.0003147486,0.0003739601,0.00032516455],"domain_scores_gemma":[0.99807036,0.0011282648,0.00023788436,0.00028301732,0.00019069765,0.00008977909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039726714,0.00026413618,0.0005788284,0.00021007379,0.0004513481,0.000050918316,0.00016672543,0.000100572805,0.0000682868],"category_scores_gemma":[0.00030028287,0.0001699402,0.00013153063,0.0005580665,0.0003058352,0.00010790091,0.00008244761,0.0001741615,0.0000013065712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006535155,0.00013406051,0.019970788,0.0015774114,0.0020516226,0.00011546752,0.013509889,0.00031676667,0.005003652,0.9070895,0.0075422376,0.036153488],"study_design_scores_gemma":[0.021722054,0.00015717682,0.016029967,0.00015588567,0.0003219719,0.000070907685,0.0009331286,0.0029701337,0.002501982,0.95329934,0.001263808,0.00057367067],"about_ca_topic_score_codex":0.000039352697,"about_ca_topic_score_gemma":0.00001274903,"teacher_disagreement_score":0.046209853,"about_ca_system_score_codex":0.0000065469194,"about_ca_system_score_gemma":0.000024205454,"threshold_uncertainty_score":0.692996},"labels":[],"label_agreement":null},{"id":"W4400833954","doi":"10.1002/rsa.21250","title":"Coboundary expansion for the union of determinantal hypertrees","year":2024,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constant (computer programming); Mathematics; Computer science","score_opus":0.029660243822913088,"score_gpt":0.3231823902906258,"score_spread":0.2935221464677127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400833954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011729599,0.0044804933,0.98245466,0.00016664912,0.000567301,0.00037280263,0.00015596322,0.000035188965,0.00003736114],"genre_scores_gemma":[0.96561855,0.00025670885,0.03373778,0.000025846357,0.00020546358,0.00003272815,0.000005425786,0.00002152808,0.00009599247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993688,0.000017211634,0.00019416615,0.0001549031,0.00013420053,0.00013073943],"domain_scores_gemma":[0.9974443,0.002338279,0.00003780022,0.00010332399,0.000041794465,0.000034536803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020806694,0.00011174145,0.00021933815,0.000027634787,0.00013615914,0.000058692396,0.000082078644,0.000052672847,0.000018950599],"category_scores_gemma":[0.0002893487,0.00005852976,0.00006938247,0.00006221859,0.00008039211,0.000036725927,0.000033435397,0.00007634925,2.469271e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019359005,0.000012476823,0.0000010908612,0.00077098253,0.000072743685,0.00000799666,0.00044448394,0.0000037941873,0.0011052134,0.39951792,0.00059572805,0.59727395],"study_design_scores_gemma":[0.0013439308,0.00016896265,0.00003416458,0.00012615889,0.00015272404,0.000076360724,0.00021861668,0.13935052,0.0017612671,0.85491425,0.001742994,0.00011006292],"about_ca_topic_score_codex":0.000011604434,"about_ca_topic_score_gemma":0.000003939559,"teacher_disagreement_score":0.95388895,"about_ca_system_score_codex":0.000005467188,"about_ca_system_score_gemma":0.00002921938,"threshold_uncertainty_score":0.23867743},"labels":[],"label_agreement":null},{"id":"W4404725980","doi":"10.1002/rsa.21272","title":"Typical Structure of Hereditary Graph Families. II. Exotic Examples","year":2024,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Computer science; Genealogy; History","score_opus":0.0235831217979606,"score_gpt":0.268930274852945,"score_spread":0.24534715305498442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404725980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857536,0.008697472,0.0023168887,0.00008313746,0.0018039565,0.00038101448,0.0003282754,0.00018503431,0.00045065218],"genre_scores_gemma":[0.9860497,0.00043723613,0.0126193445,0.00006128165,0.0006173208,0.0000050168205,0.000023313958,0.000053679003,0.00013309454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981224,0.00010984314,0.00052464206,0.00048761355,0.0003880501,0.00036743618],"domain_scores_gemma":[0.9985511,0.000751451,0.00009717498,0.00039757343,0.00006469748,0.00013800879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020554423,0.0003858894,0.00067676516,0.00024340932,0.00035503847,0.00006815649,0.0002699952,0.0002557342,0.00031902248],"category_scores_gemma":[0.00015553128,0.00025559915,0.00025486044,0.0002986371,0.00043621848,0.00013346526,0.00022532564,0.00041933169,4.1583112e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005596563,0.000037438887,0.00020633881,0.0013923282,0.00071967405,0.00016626902,0.004176642,0.0000348667,0.0030744604,0.9110854,0.0046007494,0.073946156],"study_design_scores_gemma":[0.0017450885,0.00013327644,0.001949242,0.0001312849,0.00019691236,0.00038082985,0.0003703978,0.0006309682,0.001692648,0.98984617,0.0025765765,0.00034659434],"about_ca_topic_score_codex":0.00003058587,"about_ca_topic_score_gemma":0.000013462954,"teacher_disagreement_score":0.07876076,"about_ca_system_score_codex":0.000014285549,"about_ca_system_score_gemma":0.000037918042,"threshold_uncertainty_score":0.9999896},"labels":[],"label_agreement":null},{"id":"W4404885503","doi":"10.1002/rsa.21271","title":"Typical Structure of Hereditary Graph Families. I. Apex‐free Families","year":2024,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.008741220257620879,"score_gpt":0.258519497421506,"score_spread":0.2497782771638851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404885503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38808545,0.036734417,0.56713194,0.0009739547,0.0036375446,0.0010541126,0.00059614744,0.00074723014,0.001039198],"genre_scores_gemma":[0.9563374,0.0009788614,0.04216792,0.000081897066,0.00029953427,0.000007554972,0.000013171675,0.00002721838,0.00008646667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979745,0.000121246936,0.0003373834,0.0006189758,0.00052811083,0.00041978128],"domain_scores_gemma":[0.99854845,0.00044419066,0.000050979317,0.0007110642,0.00008636273,0.00015895999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019597294,0.0002842748,0.00043910087,0.00036293583,0.0001541169,0.00017517866,0.0009918255,0.00014514488,0.00004328463],"category_scores_gemma":[0.00009473605,0.00020482205,0.00016387319,0.0007634996,0.00044140022,0.00043269974,0.0005001768,0.0004338835,0.0000017657333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042646637,0.000025855079,0.00017259784,0.00046960634,0.00030282894,0.00024315753,0.0016791547,0.00038981665,0.008606459,0.4131659,0.0022119381,0.5723062],"study_design_scores_gemma":[0.0029870234,0.00019470282,0.0028851184,0.00008532012,0.000029891686,0.0002535666,0.000276595,0.020216584,0.006738009,0.96228445,0.0036334123,0.0004153248],"about_ca_topic_score_codex":0.000035353918,"about_ca_topic_score_gemma":0.000012106837,"teacher_disagreement_score":0.5718909,"about_ca_system_score_codex":0.000015399379,"about_ca_system_score_gemma":0.00006672268,"threshold_uncertainty_score":0.83524007},"labels":[],"label_agreement":null},{"id":"W4408337137","doi":"10.1002/rsa.21270","title":"Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Computer science","score_opus":0.015197328818766329,"score_gpt":0.29336122787991226,"score_spread":0.2781638990611459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408337137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889355,0.004380927,0.0035174356,0.0003147037,0.00020186396,0.0005824541,0.00002637399,0.000051765222,0.0019890168],"genre_scores_gemma":[0.99252725,0.001067326,0.005486758,0.000622081,0.00007478268,0.0000315112,0.0000038622125,0.000020482354,0.00016596739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985012,0.00021016414,0.000361943,0.00038156693,0.00022884409,0.00031630878],"domain_scores_gemma":[0.99843866,0.0010515746,0.000084691725,0.00034237487,0.000028810457,0.00005389197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617205,0.000311739,0.0005233046,0.00019375875,0.0004879619,0.0001388585,0.000271453,0.0001580435,0.000008657834],"category_scores_gemma":[0.0001359421,0.00017826214,0.0001286019,0.00021325833,0.00026717005,0.00010171848,0.00011194754,0.00038356846,1.0841091e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001286784,0.000068473346,0.0026681155,0.0005129487,0.00024654402,0.00003593432,0.01661651,0.0002876321,0.0007566643,0.9034089,0.0012841793,0.07282732],"study_design_scores_gemma":[0.00704455,0.0000259022,0.003106186,0.0000742959,0.00009854283,0.000057577126,0.0004273025,0.013588475,0.00018268503,0.9749137,0.00025501,0.00022574262],"about_ca_topic_score_codex":0.000040255843,"about_ca_topic_score_gemma":0.000028340708,"teacher_disagreement_score":0.07260158,"about_ca_system_score_codex":0.000010513584,"about_ca_system_score_gemma":0.000017808512,"threshold_uncertainty_score":0.7269319},"labels":[],"label_agreement":null},{"id":"W4412946758","doi":"10.1002/rsa.70023","title":"Leaf Stripping on Uniform Attachment Trees","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Banco Bilbao Vizcaya Argentaria; Canada Research Chairs; McGill University; Fundación BBVA; Simons Foundation; Ministerio de Economía y Competitividad; National Science Foundation","keywords":"Stripping (fiber); Mathematics; Horticulture; Combinatorics; Computer science; Biology; Botany; Materials science; Composite material","score_opus":0.013784659978995658,"score_gpt":0.3026938574745666,"score_spread":0.288909197495571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412946758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032110393,0.0015537823,0.9557969,0.001723297,0.0006923788,0.00061571324,0.000012686039,0.00021024246,0.007284595],"genre_scores_gemma":[0.966193,0.00030861906,0.031142551,0.0006256404,0.00011209588,0.000030723626,0.0000049578507,0.00001137598,0.0015709877],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875665,0.00007272473,0.00018039801,0.00040270833,0.00026272342,0.000324826],"domain_scores_gemma":[0.9991517,0.00026948258,0.00004353638,0.00040686384,0.000042074,0.00008632479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026171745,0.00016762114,0.00023388339,0.00021528793,0.00028777783,0.00018086599,0.00049893407,0.00005493992,0.000012242122],"category_scores_gemma":[0.00004598854,0.00012436892,0.0000677227,0.0003838082,0.00009541539,0.00018766658,0.0002294514,0.00020840617,0.000002354493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013156632,0.000016257995,0.00015285688,0.000019316592,0.000048229664,0.000014149039,0.00013890918,0.0006745905,0.0003037137,0.4412617,0.0002339457,0.55700475],"study_design_scores_gemma":[0.01398163,0.0004065076,0.010591273,0.00016222782,0.000022176151,0.000030064932,0.00021876286,0.08993995,0.011735929,0.84083205,0.03146385,0.00061557593],"about_ca_topic_score_codex":0.000011563116,"about_ca_topic_score_gemma":0.000004465107,"teacher_disagreement_score":0.9340826,"about_ca_system_score_codex":0.000033288376,"about_ca_system_score_gemma":0.0000368805,"threshold_uncertainty_score":0.50716174},"labels":[],"label_agreement":null},{"id":"W4413241235","doi":"10.1002/rsa.70026","title":"Sidorenko‐Type Inequalities for Pairs of Trees","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mitacs; Pacific Institute for the Mathematical Sciences; University of Victoria","keywords":"Homomorphism; Mathematics; Combinatorics; Vertex (graph theory); Path (computing); Type (biology); Graph; Discrete mathematics; Computer science","score_opus":0.019395925844421836,"score_gpt":0.3092716544559079,"score_spread":0.289875728611486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413241235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041000113,0.0028711082,0.9538964,0.00047234024,0.00048926653,0.00051616214,0.00003519215,0.00007919447,0.00064019434],"genre_scores_gemma":[0.9243872,0.00016283775,0.07455464,0.00010245387,0.000059889415,0.000027529342,0.000005675313,0.000007644231,0.00069212046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991182,0.00006985655,0.00020791791,0.00024712883,0.00014573963,0.00021112943],"domain_scores_gemma":[0.99884886,0.00064877555,0.000057190213,0.00027415293,0.00012710271,0.00004392267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003032416,0.00011423863,0.0002746835,0.00015298584,0.00011817909,0.0000547092,0.00037315453,0.000048463837,0.000005470634],"category_scores_gemma":[0.00017249904,0.000085537875,0.00007216392,0.00030863713,0.00014779539,0.00014022223,0.00014120407,0.00007502301,1.4242555e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036283367,0.000014124258,0.00030688904,0.0001296116,0.00007541911,0.0000017169428,0.0005106554,0.00017335814,0.0013280095,0.7878062,0.00041341386,0.20887776],"study_design_scores_gemma":[0.0047344468,0.00019138253,0.001948357,0.000039123646,0.000012800376,0.000003865567,0.00020581509,0.017936056,0.01265185,0.95794874,0.004166475,0.00016111242],"about_ca_topic_score_codex":0.00001441586,"about_ca_topic_score_gemma":0.000008429789,"teacher_disagreement_score":0.8833871,"about_ca_system_score_codex":0.000006963968,"about_ca_system_score_gemma":0.00004560061,"threshold_uncertainty_score":0.34881333},"labels":[],"label_agreement":null},{"id":"W7117479425","doi":"10.1002/rsa.70040","title":"Uniform Temporal Trees","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Tree (set theory); Path (computing); Random variable; Random tree; Limit (mathematics); Class (philosophy); Enhanced Data Rates for GSM Evolution","score_opus":0.019168763083710814,"score_gpt":0.30955591607194466,"score_spread":0.29038715298823387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117479425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006702066,0.00065638305,0.98793584,0.00032879406,0.00038592613,0.0002651486,0.000054299853,0.000085827814,0.003585717],"genre_scores_gemma":[0.8614368,0.00010179286,0.13639638,0.0002770105,0.00016304066,0.000025031777,0.000011691547,0.000020222038,0.0015680195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992106,0.000017164402,0.0002301852,0.00020426944,0.00013580055,0.0002020033],"domain_scores_gemma":[0.9991698,0.0005182736,0.00005224997,0.00014207952,0.00004862589,0.00006891999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013008821,0.00015401514,0.000313857,0.000059440885,0.0001435208,0.000059784645,0.00010592425,0.00007833318,0.000065684515],"category_scores_gemma":[0.00042356225,0.00010817918,0.000050225393,0.00013063135,0.000055675602,0.00003927056,0.000056680226,0.00011984939,0.0000011065529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111265435,0.000014722041,0.000021067499,0.00011359211,0.000049092938,0.000007716092,0.00007750225,0.0000018895026,0.00003223964,0.9116281,0.0012109206,0.08673189],"study_design_scores_gemma":[0.0027330667,0.000047046968,0.00016325641,0.000041982443,0.00006158698,0.000013023371,0.000115580246,0.011169315,0.00020711795,0.9828602,0.0024567277,0.00013107604],"about_ca_topic_score_codex":0.000021742004,"about_ca_topic_score_gemma":0.000018412318,"teacher_disagreement_score":0.8547347,"about_ca_system_score_codex":0.000011168199,"about_ca_system_score_gemma":0.000033542896,"threshold_uncertainty_score":0.44114187},"labels":[],"label_agreement":null}]}