{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8143937,0.0005164596,0.17212532,0.0009116731,0.00008373645,0.00006391773,0.00020978451,0.00039946145,0.011295909],"genre_scores_gemma":[0.99020606,0.00011291177,0.007201837,0.00007256726,0.00003285196,0.000044370983,0.00011849472,0.000070974784,0.0021399374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999608,0.00012272155,0.0000132037785,0.00010172558,0.0000907946,0.00006361611],"domain_scores_gemma":[0.9967437,0.0018294067,0.00040561645,0.00021227876,0.00023430254,0.0005745871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998082,0.00042320788,0.00053954695,0.0016062655,0.00073326955,0.0011698155,0.0009896929,0.0008685212,0.0030866943],"category_scores_gemma":[0.008280764,0.0004181658,0.00050702965,0.00053352676,0.0020366448,0.001730204,0.0013766446,0.0008080986,0.00022956995],"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.00030833925,0.000046423123,0.006874146,0.00016326047,0.00014183072,0.00049976644,0.00049514876,0.12923376,0.019912954,0.82839197,0.0027932294,0.011139127],"study_design_scores_gemma":[0.000028638378,0.000049225127,0.0027414546,0.000037501573,0.000041216656,0.00021164266,0.000077123885,0.731237,0.0040716426,0.25985527,0.0016020468,0.00004721913],"about_ca_topic_score_codex":0.0021725905,"about_ca_topic_score_gemma":0.0015600236,"teacher_disagreement_score":0.0030866943,"about_ca_system_score_codex":0.001262517,"about_ca_system_score_gemma":0.00040661418,"threshold_uncertainty_score":0.010325968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6797806,0.0022971986,0.30556414,0.0025773006,0.00011531167,0.000091723254,0.0005900287,0.00032597425,0.008657709],"genre_scores_gemma":[0.96270216,0.0014997491,0.032317203,0.00020829037,0.0001698835,0.00022004063,0.0003991421,0.00013865632,0.0023450016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985884,0.0007082087,0.000057188226,0.0002875606,0.00018009075,0.00017862573],"domain_scores_gemma":[0.96456313,0.027893033,0.0030914417,0.0014760811,0.0012728558,0.0017034204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037926808,0.0006158967,0.001107655,0.0029436916,0.0015170685,0.0019656576,0.0021946984,0.0018535136,0.0032838725],"category_scores_gemma":[0.031954773,0.00089193496,0.0006821875,0.001224414,0.0034530738,0.0053449366,0.0023758,0.0013316218,0.00033915092],"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.00048038308,0.00007765547,0.008329854,0.00029476747,0.00012300123,0.00036625276,0.00076846377,0.24596746,0.0046591023,0.7209257,0.0045455806,0.013461651],"study_design_scores_gemma":[0.00006078584,0.00007908689,0.0014187086,0.00007328152,0.000042930493,0.00024140494,0.00013783058,0.5894714,0.0011519231,0.40501857,0.0022602123,0.000043948054],"about_ca_topic_score_codex":0.0015174847,"about_ca_topic_score_gemma":0.001571457,"teacher_disagreement_score":0.0037926808,"about_ca_system_score_codex":0.0023054334,"about_ca_system_score_gemma":0.0005923728,"threshold_uncertainty_score":0.020057917},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47795996,0.0009558455,0.50734574,0.0013427939,0.00006537649,0.000100348254,0.00021361974,0.00039323053,0.01162318],"genre_scores_gemma":[0.96592736,0.00037355677,0.029839136,0.00019568823,0.000057191915,0.00017640594,0.00016644075,0.00007905155,0.003185053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988784,0.0004919326,0.000050023304,0.00020344551,0.0001948439,0.00018134482],"domain_scores_gemma":[0.9865095,0.009307499,0.0013900996,0.0010348279,0.0007683525,0.0009897453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037091428,0.0004581598,0.00092295976,0.0014801895,0.0012158928,0.0019552482,0.0013155125,0.0014150329,0.0029297264],"category_scores_gemma":[0.025457269,0.00041495488,0.0007456555,0.00082370196,0.003577536,0.0028418961,0.0016963184,0.0022563878,0.00030660562],"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.00013317609,0.0000739372,0.005016111,0.0000840872,0.000040018604,0.00049650384,0.00056819594,0.051190697,0.0023796353,0.93268704,0.0014270163,0.005903533],"study_design_scores_gemma":[0.00004861104,0.000033916043,0.0011250243,0.00005405511,0.000015102907,0.00016264802,0.00012987679,0.42647192,0.0008158938,0.57009417,0.0010245655,0.00002425038],"about_ca_topic_score_codex":0.0022329267,"about_ca_topic_score_gemma":0.0016495435,"teacher_disagreement_score":0.0037091428,"about_ca_system_score_codex":0.0020977077,"about_ca_system_score_gemma":0.0009624807,"threshold_uncertainty_score":0.019616008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42575267,0.00027096627,0.5620812,0.0005933576,0.00012505494,0.0003428122,0.00028339837,0.00058929273,0.009961278],"genre_scores_gemma":[0.8746708,0.00013164917,0.11719675,0.000119140364,0.000030020987,0.00014064243,0.00035825686,0.0000979921,0.007254678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982804,0.00043775374,0.00007387453,0.00034446875,0.0005128021,0.00035066716],"domain_scores_gemma":[0.9966677,0.0015695355,0.0005439563,0.00067905564,0.00028433112,0.0002555316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012003067,0.00044052626,0.0008319169,0.0006308571,0.0011059485,0.0012533887,0.0012885879,0.0011880803,0.010153955],"category_scores_gemma":[0.005927761,0.00047637988,0.00096943375,0.0008948449,0.001920982,0.0018172588,0.0017103235,0.0012314909,0.0012185507],"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.0018074844,0.00036762477,0.006667229,0.00022579436,0.00015203375,0.0009584644,0.00029927373,0.7559163,0.016692992,0.14391041,0.0034422963,0.06956006],"study_design_scores_gemma":[0.00021429658,0.00025955943,0.0011624144,0.000032004195,0.000034690795,0.00016782229,0.0001499947,0.9339766,0.012751812,0.047302347,0.003904855,0.0000436348],"about_ca_topic_score_codex":0.004499533,"about_ca_topic_score_gemma":0.0033726466,"teacher_disagreement_score":0.010153955,"about_ca_system_score_codex":0.001042897,"about_ca_system_score_gemma":0.0007740957,"threshold_uncertainty_score":0.03396833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28494373,0.0008839428,0.7066562,0.0013571576,0.00007956924,0.00014418726,0.0002464552,0.0009447068,0.0047439956],"genre_scores_gemma":[0.7340002,0.00042809453,0.25989985,0.0002929542,0.00007727636,0.00020975585,0.00048123245,0.00028388653,0.0043267366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814904,0.000865062,0.0001069141,0.00045599544,0.00024517943,0.00017770373],"domain_scores_gemma":[0.9797472,0.016530875,0.0012592126,0.0011808457,0.000624586,0.000657333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035688605,0.00083913724,0.0017603601,0.0013290668,0.0012936902,0.0020359028,0.001961374,0.0021080691,0.0033232302],"category_scores_gemma":[0.025543284,0.0010326889,0.0012218637,0.0011352056,0.0021894772,0.0035215975,0.0022581513,0.0018882747,0.00081775786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00053586386,0.00015356483,0.006693902,0.00052596786,0.00015893969,0.0004407051,0.00070125866,0.57662666,0.0050019226,0.33817577,0.0063693337,0.06461619],"study_design_scores_gemma":[0.00004370733,0.000041752264,0.00022887706,0.000027210597,0.000016037679,0.0000913251,0.000039507675,0.81346554,0.001154268,0.1839199,0.0009612684,0.000010481539],"about_ca_topic_score_codex":0.00082875445,"about_ca_topic_score_gemma":0.001159143,"teacher_disagreement_score":0.0035688605,"about_ca_system_score_codex":0.0013768747,"about_ca_system_score_gemma":0.0008236721,"threshold_uncertainty_score":0.018874168},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896,0.00072331884,0.2990203,0.0006728568,0.000087468376,0.00007403578,0.00028842487,0.00017256668,0.009361013],"genre_scores_gemma":[0.9784894,0.00042620694,0.016940072,0.00007987552,0.000049451362,0.00005194527,0.0002458711,0.000039740706,0.0036774832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995505,0.00018146062,0.000018935138,0.000058601705,0.000114087474,0.00007638557],"domain_scores_gemma":[0.9982102,0.00082385394,0.00045035244,0.00012379757,0.00014753151,0.0002441964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066111377,0.00062569755,0.00062721496,0.0012905059,0.00055813964,0.0011235971,0.0011009622,0.0012059767,0.002314168],"category_scores_gemma":[0.0044719027,0.0004380915,0.00059850304,0.0008205065,0.0017764524,0.0014784526,0.0014677569,0.000834157,0.0003188505],"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.00012563921,0.000037368212,0.002403174,0.000081205464,0.0000571306,0.00057378033,0.0001645166,0.4025111,0.003296782,0.5851801,0.0010167125,0.0045525385],"study_design_scores_gemma":[0.000030933195,0.000024969038,0.00044843933,0.000014862405,0.0000075599587,0.00008007332,0.000053557877,0.8472639,0.0004860369,0.15095434,0.00061814056,0.000017189073],"about_ca_topic_score_codex":0.0023947433,"about_ca_topic_score_gemma":0.001965329,"teacher_disagreement_score":0.0023947433,"about_ca_system_score_codex":0.00084173476,"about_ca_system_score_gemma":0.00029541022,"threshold_uncertainty_score":0.0077416897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15820438,0.0023881986,0.8301473,0.0011529768,0.00014128014,0.000086547174,0.00020081412,0.00029076575,0.007387737],"genre_scores_gemma":[0.8979731,0.0022428846,0.089124285,0.000562656,0.0005321161,0.00046001366,0.00038825834,0.0003490583,0.008367542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976285,0.000994304,0.00011267842,0.00040097,0.00061534205,0.00024831548],"domain_scores_gemma":[0.9655394,0.02694244,0.0021111541,0.0013025274,0.0022088254,0.0018956615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012663286,0.0011439099,0.0018831295,0.004159934,0.0012655931,0.0033035276,0.0025764178,0.0019515064,0.0049032136],"category_scores_gemma":[0.04853569,0.00083925563,0.001634963,0.0018819825,0.00682001,0.007375475,0.0036236043,0.004248656,0.0005981019],"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.00006501652,0.000044479715,0.0019411024,0.00010806937,0.000044501652,0.00015384471,0.00023677775,0.03344301,0.0010432433,0.95676726,0.00062404224,0.0055286367],"study_design_scores_gemma":[0.000020684696,0.000054090357,0.0008540828,0.00007648286,0.000029704039,0.0001487121,0.00004375152,0.30392927,0.00071851054,0.693282,0.00079495204,0.000047809604],"about_ca_topic_score_codex":0.001437227,"about_ca_topic_score_gemma":0.0009868179,"teacher_disagreement_score":0.012663286,"about_ca_system_score_codex":0.0021922584,"about_ca_system_score_gemma":0.0012495326,"threshold_uncertainty_score":0.066970706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8527782,0.00013941247,0.13410623,0.0010188022,0.00005857174,0.00005740748,0.00046086236,0.0005021324,0.010878485],"genre_scores_gemma":[0.9860973,0.000041052343,0.01134598,0.00006578828,0.000011925,0.00004509707,0.00016508978,0.00003793406,0.0021899363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995353,0.00014622226,0.000023512139,0.00015455789,0.00006810247,0.00007233178],"domain_scores_gemma":[0.9977952,0.0012172911,0.00025078226,0.0002602061,0.00025876836,0.00021769086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041221592,0.00019519038,0.000365704,0.0008855416,0.0006948317,0.001137663,0.0006564389,0.0008338574,0.0030508863],"category_scores_gemma":[0.0025317182,0.00027109802,0.0003551734,0.00041750798,0.0013986789,0.001067197,0.0006956324,0.0005418773,0.00034644146],"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.0003697625,0.00009463559,0.0063354904,0.000116562056,0.000058236663,0.0011221981,0.0008914983,0.11628903,0.02573739,0.8338233,0.0024402232,0.012721624],"study_design_scores_gemma":[0.00007369173,0.000094731404,0.0017192366,0.000023260869,0.000029337996,0.00028140232,0.00015107589,0.64797366,0.0041504726,0.34321013,0.0022494758,0.00004352795],"about_ca_topic_score_codex":0.0019846815,"about_ca_topic_score_gemma":0.0016833865,"teacher_disagreement_score":0.0030508863,"about_ca_system_score_codex":0.0009940625,"about_ca_system_score_gemma":0.00051566,"threshold_uncertainty_score":0.010206282},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62276685,0.0002912001,0.36327052,0.0004600605,0.00004341294,0.00013441964,0.00031606562,0.00034646213,0.012370941],"genre_scores_gemma":[0.95860255,0.00013464036,0.037726637,0.00008302296,0.00003571444,0.00018093822,0.00044403068,0.000117954194,0.002674499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981675,0.0007301338,0.00008696627,0.0003313782,0.0004408188,0.0002431245],"domain_scores_gemma":[0.99021685,0.0058093932,0.0014419286,0.0010594054,0.00097637106,0.0004961586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034377477,0.00048511953,0.0010955693,0.003353288,0.0014534773,0.001986665,0.0015974735,0.001355248,0.005381818],"category_scores_gemma":[0.018352473,0.0006362976,0.00072563195,0.0016100729,0.0026412096,0.002912314,0.0014832182,0.0013531684,0.0006048754],"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.00031625325,0.00010528587,0.006791984,0.00009469825,0.00004582559,0.00047479355,0.00029276244,0.20940855,0.0035621712,0.76142144,0.0016217866,0.015864437],"study_design_scores_gemma":[0.000034810393,0.000040728537,0.0015977597,0.00004001405,0.000018655757,0.00018467844,0.0000606552,0.5760162,0.0016962942,0.41924116,0.0010293265,0.000039703227],"about_ca_topic_score_codex":0.0016326699,"about_ca_topic_score_gemma":0.0015101165,"teacher_disagreement_score":0.005381818,"about_ca_system_score_codex":0.0016859584,"about_ca_system_score_gemma":0.00088506035,"threshold_uncertainty_score":0.018180728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9467248,0.00035219526,0.045285426,0.00031750262,0.000032878885,0.000020653562,0.00012657634,0.00018592674,0.0069542043],"genre_scores_gemma":[0.9962909,0.00013590304,0.0024309594,0.000047953185,0.00006448199,0.000020861255,0.00008587948,0.00004696943,0.0008762017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899405,0.00036658155,0.00003921791,0.00023489939,0.00017548446,0.00018969653],"domain_scores_gemma":[0.9912798,0.0042058406,0.0014279878,0.00084496144,0.0007036566,0.0015376984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015196638,0.00043119045,0.00097207894,0.0016148207,0.00087799184,0.0016944718,0.0011115549,0.0007006076,0.0016725487],"category_scores_gemma":[0.0076734307,0.0004989569,0.0005033341,0.00048731957,0.002518259,0.0028456512,0.0016753505,0.0010529582,0.00019353621],"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.0004095799,0.00009109234,0.0059957136,0.00012854609,0.000055713117,0.00036756057,0.0005166468,0.044816215,0.025900157,0.9158295,0.0016059693,0.004283344],"study_design_scores_gemma":[0.000103860584,0.00020925971,0.013564302,0.00005861277,0.00010388327,0.0007533278,0.00036314313,0.40972507,0.015023928,0.55658036,0.003416164,0.00009807604],"about_ca_topic_score_codex":0.00085870427,"about_ca_topic_score_gemma":0.00053146225,"teacher_disagreement_score":0.0016944718,"about_ca_system_score_codex":0.0012367866,"about_ca_system_score_gemma":0.0002940491,"threshold_uncertainty_score":0.008973539},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7847854,0.00038009515,0.21011138,0.00074362196,0.000025048103,0.00010483036,0.00015911866,0.0006510496,0.0030394245],"genre_scores_gemma":[0.9868716,0.00006124802,0.012469419,0.000039476075,0.00002860599,0.00005274746,0.00012719528,0.000046685906,0.00030306427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98747057,0.0049097193,0.00053456676,0.0019055903,0.003798526,0.0013810042],"domain_scores_gemma":[0.82536185,0.14115512,0.00997118,0.015267244,0.0055702194,0.0026743799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016255142,0.0008203803,0.002195884,0.0030712998,0.0013230167,0.003056151,0.0036190196,0.0021468308,0.0029205421],"category_scores_gemma":[0.10660886,0.00063381036,0.0009230562,0.0017372585,0.0057047764,0.0068630916,0.0021493705,0.0019622114,0.0003147151],"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.0027502996,0.0004677791,0.05637646,0.00027922002,0.00041477446,0.0006884384,0.0005580416,0.42526478,0.019499272,0.43505177,0.0020838326,0.05656538],"study_design_scores_gemma":[0.00007310193,0.00021443436,0.00334151,0.000020613174,0.000032560187,0.00025486434,0.000059714086,0.9053966,0.009090345,0.08111059,0.0003535968,0.000052152893],"about_ca_topic_score_codex":0.0007800296,"about_ca_topic_score_gemma":0.0004963256,"teacher_disagreement_score":0.016255142,"about_ca_system_score_codex":0.003647177,"about_ca_system_score_gemma":0.002443953,"threshold_uncertainty_score":0.08596641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7891375,0.0004133416,0.20410866,0.00026713833,0.000034705376,0.000066303575,0.00020737572,0.0001338234,0.0056311437],"genre_scores_gemma":[0.9754784,0.00021075172,0.02172218,0.00006816836,0.000043270073,0.00008886524,0.00032121185,0.000052504445,0.0020146188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985392,0.0003696979,0.00008873841,0.00032901435,0.0004545363,0.00021881891],"domain_scores_gemma":[0.98841244,0.0064670783,0.0016050584,0.00077721884,0.0012127564,0.001525417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002372808,0.0005856627,0.0012071881,0.003072494,0.0014155579,0.0025343697,0.0024572683,0.0014534019,0.0039814585],"category_scores_gemma":[0.020594422,0.0008468541,0.0007701856,0.0016955804,0.0031739606,0.0039972356,0.00295658,0.0019281657,0.0004798595],"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.00027782132,0.00007539478,0.009021306,0.00011687277,0.00006665169,0.00045484616,0.00045008922,0.06712872,0.0070195124,0.903141,0.0008657209,0.011382058],"study_design_scores_gemma":[0.0000474548,0.000095301104,0.0031218156,0.000054512526,0.0000348954,0.0005097014,0.00020198424,0.38519552,0.004893014,0.6045024,0.0012751452,0.00006827017],"about_ca_topic_score_codex":0.0012000038,"about_ca_topic_score_gemma":0.0007840579,"teacher_disagreement_score":0.0039814585,"about_ca_system_score_codex":0.0016852948,"about_ca_system_score_gemma":0.0005536236,"threshold_uncertainty_score":0.013319373},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6435637,0.0007106917,0.33852598,0.0051644044,0.000083699495,0.0003942041,0.0011615657,0.001892345,0.0085034575],"genre_scores_gemma":[0.955188,0.00023160705,0.040101472,0.0003900488,0.00008409814,0.00024633453,0.00070102373,0.00032747196,0.0027298257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9816566,0.008455631,0.0009944747,0.0025189598,0.00424944,0.0021249722],"domain_scores_gemma":[0.86460495,0.1154568,0.004684088,0.010602446,0.0028539118,0.0017979032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010594114,0.00075913756,0.002310361,0.0017997742,0.0017079195,0.00450786,0.004487703,0.0025740308,0.010826652],"category_scores_gemma":[0.07077478,0.0011015099,0.0022189547,0.0020244373,0.0041668755,0.010888217,0.0041326787,0.0034655915,0.00077917264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0027199285,0.00049123523,0.009522404,0.0008758113,0.00057516317,0.0007005301,0.001335258,0.60667974,0.018092902,0.2946386,0.0061764554,0.058192],"study_design_scores_gemma":[0.00014955727,0.00012966576,0.0008421839,0.000028913833,0.00009581519,0.00016632718,0.00014113002,0.8217736,0.005899857,0.16982025,0.0009126341,0.00004003415],"about_ca_topic_score_codex":0.002593603,"about_ca_topic_score_gemma":0.002469519,"teacher_disagreement_score":0.010826652,"about_ca_system_score_codex":0.0042202063,"about_ca_system_score_gemma":0.003034224,"threshold_uncertainty_score":0.05602771},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22359605,0.0036761966,0.7256559,0.0014747148,0.00022033042,0.0002846229,0.00076356676,0.0006478929,0.04368067],"genre_scores_gemma":[0.74971116,0.0017844633,0.22692104,0.00069218443,0.00035488306,0.0010482303,0.00096316996,0.00046376407,0.018061124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710804,0.0012069102,0.00015860057,0.0005651013,0.0006564001,0.0003049989],"domain_scores_gemma":[0.98983955,0.0068011144,0.001175974,0.00068230944,0.00088245125,0.0006185688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036868525,0.00060932705,0.001562051,0.0032808054,0.0014937302,0.0033692343,0.0013078992,0.0013431278,0.008471735],"category_scores_gemma":[0.024290565,0.0011099894,0.001025778,0.0019308745,0.0025468257,0.0047283624,0.0038525022,0.0015583253,0.0016835965],"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.00019458495,0.000046650046,0.00127691,0.00022793915,0.00005530038,0.00016456936,0.00031030926,0.039800335,0.0018073538,0.92741627,0.0038579982,0.024841748],"study_design_scores_gemma":[0.000060781604,0.000054953616,0.0006233671,0.000084382555,0.000016611317,0.00022670865,0.000113441114,0.13720733,0.0016128393,0.85407704,0.0058932346,0.00002929809],"about_ca_topic_score_codex":0.00046668967,"about_ca_topic_score_gemma":0.00053546426,"teacher_disagreement_score":0.008471735,"about_ca_system_score_codex":0.0013569238,"about_ca_system_score_gemma":0.00062553387,"threshold_uncertainty_score":0.028340757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7987181,0.00073788466,0.18348597,0.001968184,0.000061383435,0.00012350344,0.00030983717,0.00022795383,0.014367124],"genre_scores_gemma":[0.9865955,0.00022384236,0.01034458,0.00012885225,0.000055847515,0.00007545208,0.0001768911,0.00002552325,0.0023734968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986663,0.00052149803,0.000055448916,0.0001924388,0.0003296169,0.00023466541],"domain_scores_gemma":[0.9959615,0.0022057227,0.00064231374,0.0003378425,0.0004858318,0.00036684435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012103728,0.0003238212,0.00077831437,0.0016070672,0.0010826116,0.0016545091,0.0009156583,0.0010196927,0.003623904],"category_scores_gemma":[0.008470372,0.00039055845,0.0005326492,0.00087356166,0.002513066,0.002523399,0.0017437795,0.001246299,0.0004046749],"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.00008147239,0.000020545256,0.00081163005,0.00005332913,0.000018963314,0.00011238333,0.00022965521,0.03597692,0.0016283223,0.9554639,0.000901361,0.0047014304],"study_design_scores_gemma":[0.000062647465,0.00006296859,0.0005936094,0.000022141858,0.000012209241,0.00012731776,0.0001089822,0.2872696,0.0015986054,0.70831466,0.0017950436,0.00003213803],"about_ca_topic_score_codex":0.0012739816,"about_ca_topic_score_gemma":0.0005095216,"teacher_disagreement_score":0.003623904,"about_ca_system_score_codex":0.0015107638,"about_ca_system_score_gemma":0.000628784,"threshold_uncertainty_score":0.0121231675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.857797,0.00039817617,0.12819514,0.0009983787,0.000045783207,0.00006515041,0.00042306256,0.00068353827,0.011393674],"genre_scores_gemma":[0.9940813,0.00007683158,0.0041845813,0.000085737905,0.000032915643,0.00004629383,0.00016393956,0.000062475905,0.0012658113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986492,0.00043486198,0.000057296253,0.00015818766,0.0004358086,0.0002647175],"domain_scores_gemma":[0.9822192,0.011771475,0.0021422752,0.0014328843,0.0015631769,0.0008710456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019379329,0.0002800705,0.0006885605,0.0014628578,0.0007002125,0.0014571798,0.0011440673,0.0009353394,0.003931697],"category_scores_gemma":[0.027875423,0.0004228935,0.00035588807,0.0009051278,0.0021557452,0.0027275237,0.0018000879,0.0012055575,0.0004870981],"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.0007936137,0.000105091276,0.009144561,0.0001971198,0.00006904343,0.00092353404,0.0006836118,0.22175264,0.013505712,0.72879636,0.0044422676,0.019586414],"study_design_scores_gemma":[0.00003894965,0.000070091584,0.0015267222,0.00003128448,0.000017291404,0.0004346604,0.00010257375,0.79624104,0.0031053456,0.19766355,0.00073594716,0.000032470612],"about_ca_topic_score_codex":0.00070123625,"about_ca_topic_score_gemma":0.0005478577,"teacher_disagreement_score":0.003931697,"about_ca_system_score_codex":0.0011954039,"about_ca_system_score_gemma":0.00058433984,"threshold_uncertainty_score":0.013152838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.865222,0.0005958802,0.12206734,0.0017773358,0.000057149828,0.000058853515,0.0007798386,0.00012139406,0.009320298],"genre_scores_gemma":[0.9860891,0.00020509642,0.01225105,0.00009892481,0.00007232326,0.000094910865,0.00033196088,0.000027246462,0.0008294501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822897,0.00066234,0.000120216035,0.00035904735,0.0004284827,0.00020093498],"domain_scores_gemma":[0.94372934,0.04662009,0.0035436316,0.0026996862,0.0016067657,0.001800431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004260585,0.0003605971,0.0009270091,0.0020666912,0.0010976294,0.0023443487,0.0014960349,0.0009982835,0.0027995794],"category_scores_gemma":[0.03915912,0.0006459191,0.00056452054,0.0009948664,0.002765011,0.0037012347,0.0021430128,0.0012405715,0.0001818861],"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.001745373,0.00019967533,0.07646369,0.00047355125,0.0002448218,0.0006876774,0.0009579057,0.13549747,0.019505555,0.7258212,0.006044227,0.032358885],"study_design_scores_gemma":[0.00013139995,0.0002522719,0.024964325,0.00022394728,0.000076561635,0.0011595087,0.0007209114,0.55516136,0.017482193,0.39480603,0.004880062,0.00014145653],"about_ca_topic_score_codex":0.0005647326,"about_ca_topic_score_gemma":0.00045222102,"teacher_disagreement_score":0.004260585,"about_ca_system_score_codex":0.0013651861,"about_ca_system_score_gemma":0.00050157856,"threshold_uncertainty_score":0.022532403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15039015,0.00047399863,0.8428118,0.0010647225,0.000053947868,0.00014759507,0.00015859501,0.00038834536,0.004510846],"genre_scores_gemma":[0.7853365,0.0007263295,0.20361209,0.0005066986,0.00017494593,0.0009666309,0.0005540002,0.00034023618,0.0077824816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979122,0.00089917757,0.000084858075,0.0004371078,0.00038080674,0.00028581894],"domain_scores_gemma":[0.977958,0.016272608,0.0022510628,0.0017211582,0.00079036085,0.0010068641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00438029,0.0010470154,0.0011334831,0.0020089084,0.0018001787,0.002842361,0.0019828575,0.002236631,0.0041871998],"category_scores_gemma":[0.023690414,0.0012596636,0.0021664,0.0009100556,0.0035403515,0.0058268285,0.0031732982,0.004013933,0.00087327365],"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.00024867928,0.000081715545,0.0032470368,0.00008889353,0.00006993034,0.00021852828,0.0006676951,0.1103531,0.004881585,0.8677556,0.0014560559,0.010931136],"study_design_scores_gemma":[0.000039297443,0.000028672095,0.00043155186,0.000021966955,0.000019050978,0.00009893217,0.000051955754,0.601771,0.0018844246,0.39451954,0.0010949973,0.00003861506],"about_ca_topic_score_codex":0.0019396612,"about_ca_topic_score_gemma":0.0021949376,"teacher_disagreement_score":0.00438029,"about_ca_system_score_codex":0.0024135022,"about_ca_system_score_gemma":0.0009829557,"threshold_uncertainty_score":0.023165464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75814015,0.00045654507,0.21881633,0.0016810705,0.0000507177,0.00010766497,0.000755387,0.00058887753,0.019403331],"genre_scores_gemma":[0.975916,0.00018934307,0.019502271,0.0002124868,0.00006914962,0.00008999874,0.00054788706,0.00006932909,0.0034034771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981962,0.0006036121,0.00007444624,0.000400711,0.00051421626,0.00021079637],"domain_scores_gemma":[0.9893055,0.00644839,0.0013510336,0.0012870849,0.00079465174,0.0008133447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410742,0.0002945244,0.0007703391,0.0016715586,0.00077606295,0.0013321368,0.00087141054,0.00073214114,0.003320196],"category_scores_gemma":[0.011052255,0.00043995766,0.0005645622,0.0008617735,0.0016656202,0.002180768,0.001305795,0.0010114749,0.00042999786],"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.00038370024,0.00011159628,0.006557917,0.00017121165,0.000077223565,0.0005736253,0.00044772727,0.036600627,0.009073575,0.92430687,0.005765964,0.015929898],"study_design_scores_gemma":[0.0000857797,0.000068000496,0.001933269,0.000027808808,0.000037733585,0.0005317793,0.00011097404,0.18679361,0.003584588,0.80275774,0.0040459954,0.00002265273],"about_ca_topic_score_codex":0.0008764167,"about_ca_topic_score_gemma":0.0010158569,"teacher_disagreement_score":0.003320196,"about_ca_system_score_codex":0.0011219997,"about_ca_system_score_gemma":0.0004522417,"threshold_uncertainty_score":0.011107147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2088227,0.0028614688,0.75763094,0.0033737025,0.0002385839,0.000105422914,0.0014276181,0.0017827365,0.023756817],"genre_scores_gemma":[0.9235349,0.0018084616,0.05872111,0.0011389572,0.0004528995,0.0003675181,0.0013401416,0.00093389995,0.011702107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981152,0.0004677493,0.00006646387,0.0004093487,0.00045143956,0.0004898284],"domain_scores_gemma":[0.97802025,0.01530306,0.0012733161,0.002496463,0.0016171911,0.0012897296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003369348,0.0010998264,0.0011486695,0.00199461,0.0014332626,0.0022084718,0.0026473652,0.0012334683,0.0073975776],"category_scores_gemma":[0.02462598,0.00083550136,0.00088310987,0.0015975292,0.0028835314,0.0066148476,0.003046382,0.0034365833,0.0020972656],"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.0016887009,0.00030013846,0.012481613,0.0005529952,0.00019398468,0.0005476141,0.0012661434,0.22695056,0.033784956,0.6380261,0.022350274,0.061856918],"study_design_scores_gemma":[0.00006697055,0.00010574932,0.0024580916,0.000138665,0.00007217849,0.00024328342,0.00016143711,0.7320728,0.008327266,0.25153244,0.004745177,0.00007596266],"about_ca_topic_score_codex":0.0032314507,"about_ca_topic_score_gemma":0.0038422118,"teacher_disagreement_score":0.0073975776,"about_ca_system_score_codex":0.0037026042,"about_ca_system_score_gemma":0.0012504631,"threshold_uncertainty_score":0.026864469},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49639335,0.0015614213,0.4144707,0.0029849766,0.00030311506,0.00021789853,0.0011968305,0.00037718887,0.082494535],"genre_scores_gemma":[0.98154736,0.00024207815,0.012726154,0.00031802856,0.000112805064,0.00009904708,0.00021602369,0.000034174827,0.0047043394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974778,0.0011564385,0.00012527434,0.00054475234,0.00035456993,0.00034104902],"domain_scores_gemma":[0.99441165,0.002551417,0.00094560796,0.0008684937,0.0004812518,0.00074150873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016509851,0.0006196331,0.0013325695,0.001912827,0.0011996415,0.0022023062,0.0014420548,0.0018627429,0.005848688],"category_scores_gemma":[0.011438828,0.00048530777,0.0008854678,0.0010727538,0.0034022615,0.0023823697,0.002169698,0.0014822918,0.000532377],"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.00011051132,0.000052161045,0.0017519725,0.000080191174,0.00003463119,0.000515462,0.00020909376,0.054495312,0.00094216235,0.9369794,0.0017734847,0.0030555977],"study_design_scores_gemma":[0.000051848412,0.000047792106,0.00067546027,0.000028432189,0.000021029398,0.00044858461,0.000121145735,0.31883886,0.0005154312,0.6760652,0.0031535185,0.000032747976],"about_ca_topic_score_codex":0.0015231364,"about_ca_topic_score_gemma":0.00092790375,"teacher_disagreement_score":0.005848688,"about_ca_system_score_codex":0.0013484342,"about_ca_system_score_gemma":0.00039941372,"threshold_uncertainty_score":0.019565761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7851304,0.0011699952,0.15164614,0.0043507046,0.00008936964,0.00012943077,0.0014708458,0.0013418691,0.054671172],"genre_scores_gemma":[0.984362,0.00032059217,0.0100101875,0.00044408604,0.00013836181,0.000095721676,0.0006198392,0.00011857375,0.0038905598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988801,0.00014724104,0.00005666911,0.0004881485,0.000192608,0.00023515007],"domain_scores_gemma":[0.98909175,0.005883284,0.0016173277,0.001897354,0.00056009245,0.00095021364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013521834,0.00063775596,0.0010502588,0.0016142213,0.0019838759,0.0032841035,0.0019136536,0.00081455446,0.006610509],"category_scores_gemma":[0.0063525536,0.0006585568,0.0010821914,0.001596438,0.003942258,0.005748611,0.0021846094,0.0015281425,0.0009942742],"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.00059726933,0.00028511806,0.017129704,0.00047473633,0.00017149514,0.00039398443,0.0014487143,0.013709284,0.01636781,0.89921033,0.012346084,0.037865557],"study_design_scores_gemma":[0.000101704165,0.00014173516,0.0074858125,0.00006821026,0.00010870145,0.00065567624,0.0006260914,0.027332926,0.01704468,0.9345566,0.011815512,0.000062460276],"about_ca_topic_score_codex":0.0014167946,"about_ca_topic_score_gemma":0.0012915793,"teacher_disagreement_score":0.006610509,"about_ca_system_score_codex":0.0024213295,"about_ca_system_score_gemma":0.00090405776,"threshold_uncertainty_score":0.022114396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21404772,0.00032296323,0.77591544,0.0005776565,0.00005712092,0.00006288715,0.00013360895,0.0002431918,0.0086395005],"genre_scores_gemma":[0.91804963,0.0005492434,0.077307835,0.00021503636,0.00013822727,0.00012795324,0.0001895515,0.00010290024,0.0033196858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990746,0.00031446823,0.00003309669,0.00016190091,0.00025148437,0.00016441755],"domain_scores_gemma":[0.9892635,0.007575887,0.0011260627,0.0010078468,0.0005104176,0.0005163446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967298,0.0008518323,0.0010028348,0.0021052614,0.0009231991,0.0014120607,0.0013579159,0.0010869354,0.0025574944],"category_scores_gemma":[0.015901422,0.00057303795,0.0013838111,0.0012635841,0.0034883108,0.0019209345,0.0021574434,0.0023275164,0.00047450064],"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.000105805026,0.000072425624,0.0032173025,0.0000940234,0.000067426845,0.00027732237,0.00036045464,0.16243999,0.0048836814,0.81646436,0.0017421184,0.010275187],"study_design_scores_gemma":[0.000019879966,0.000025813291,0.0006651266,0.000015892449,0.000017652594,0.00010456308,0.000042162133,0.6018485,0.0016957792,0.39473817,0.00080908154,0.000017409106],"about_ca_topic_score_codex":0.0013158771,"about_ca_topic_score_gemma":0.0012865008,"teacher_disagreement_score":0.0025574944,"about_ca_system_score_codex":0.0013107724,"about_ca_system_score_gemma":0.0007676372,"threshold_uncertainty_score":0.01040417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768456,0.00013849905,0.016934719,0.0005651197,0.000020011124,0.00004046462,0.00011209557,0.00012103916,0.0052224025],"genre_scores_gemma":[0.99592495,0.000038753824,0.0033344466,0.00008179981,0.000018719797,0.000049253165,0.00013319474,0.0000146384255,0.00040410648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793696,0.00070452073,0.00012546162,0.0003762679,0.0005497053,0.00030704658],"domain_scores_gemma":[0.97323686,0.018484285,0.0032316395,0.0014359547,0.0010877693,0.0025234583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021403173,0.0003718157,0.0011036609,0.0031228676,0.0015590294,0.003620493,0.00120541,0.0018316365,0.003732036],"category_scores_gemma":[0.020524122,0.00073993707,0.0006499558,0.0012967662,0.0037738248,0.003602153,0.0025052417,0.0011374739,0.00024989757],"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.001980294,0.00049529097,0.033266928,0.0004430051,0.00030119976,0.0025987711,0.0025115665,0.0589291,0.015965689,0.8616514,0.0037168106,0.018140009],"study_design_scores_gemma":[0.00029682554,0.00022197267,0.014872821,0.00013822624,0.00016305681,0.0016656605,0.0012576219,0.23065239,0.007841263,0.7399623,0.002803495,0.00012453711],"about_ca_topic_score_codex":0.00053637737,"about_ca_topic_score_gemma":0.00045035782,"teacher_disagreement_score":0.003732036,"about_ca_system_score_codex":0.0012512214,"about_ca_system_score_gemma":0.00037155364,"threshold_uncertainty_score":0.0124848485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6949804,0.00042774188,0.29470527,0.0005842866,0.000034471344,0.000116745236,0.00026500702,0.0008358909,0.008050154],"genre_scores_gemma":[0.95241624,0.00009226433,0.045250993,0.00017730816,0.00002623749,0.00012491914,0.00025378392,0.000097417564,0.0015607738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804544,0.0007519203,0.00011858728,0.00031480618,0.00051625574,0.0002529382],"domain_scores_gemma":[0.98505014,0.009843964,0.0017503893,0.0013702142,0.0012500499,0.0007353326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088483,0.00025699247,0.00076323084,0.0019168678,0.0006717927,0.0017518721,0.0009422066,0.0007770194,0.0025740908],"category_scores_gemma":[0.018517315,0.0007758695,0.00060017215,0.0010825241,0.001723929,0.0025825778,0.001369613,0.0012136117,0.00019589628],"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.0006963592,0.00017768101,0.010784214,0.00018387873,0.00010603617,0.00073061144,0.0006062512,0.13200656,0.011745242,0.7918308,0.0038000424,0.047332447],"study_design_scores_gemma":[0.00009227467,0.00008045331,0.0024261319,0.00003208111,0.000032095493,0.00037355136,0.00012241838,0.47838318,0.0058855773,0.5108154,0.0017309374,0.000025909852],"about_ca_topic_score_codex":0.0010830805,"about_ca_topic_score_gemma":0.001638112,"teacher_disagreement_score":0.0025740908,"about_ca_system_score_codex":0.0014988775,"about_ca_system_score_gemma":0.00055021734,"threshold_uncertainty_score":0.011045098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8594813,0.00038384102,0.13477741,0.0004335183,0.00005091305,0.00007452973,0.00018262074,0.00028970884,0.004326196],"genre_scores_gemma":[0.97924346,0.00010672979,0.018706152,0.00015315085,0.000028821316,0.00006299587,0.00016963914,0.000058465146,0.0014705278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982003,0.00049007527,0.00012560323,0.0005242397,0.00035047156,0.0003093148],"domain_scores_gemma":[0.9865676,0.0059110555,0.0021671578,0.0032790566,0.0007285027,0.0013466665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019502474,0.0006432682,0.0013227855,0.0011063685,0.0012285735,0.0015058087,0.0015247108,0.0009978057,0.0040333476],"category_scores_gemma":[0.014318316,0.000821724,0.00076481,0.0007203975,0.0019023943,0.003918343,0.0034474486,0.00094027433,0.00063605484],"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.00347155,0.0004968914,0.04683886,0.0009868897,0.0006133286,0.0031626737,0.0026917818,0.13374573,0.12898932,0.5692569,0.007563366,0.10218279],"study_design_scores_gemma":[0.00022430831,0.0009022117,0.009570727,0.00016095054,0.00025358025,0.0038672125,0.0010169351,0.42417,0.046667296,0.5051424,0.007879406,0.00014499004],"about_ca_topic_score_codex":0.00063489133,"about_ca_topic_score_gemma":0.00074313226,"teacher_disagreement_score":0.0040333476,"about_ca_system_score_codex":0.0005837924,"about_ca_system_score_gemma":0.0005751114,"threshold_uncertainty_score":0.013492942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44179887,0.0020137252,0.5259132,0.0014654151,0.00009743804,0.00026989286,0.0012488374,0.0018540559,0.025338529],"genre_scores_gemma":[0.95927507,0.000600416,0.031875145,0.0003901657,0.00014432937,0.00030767897,0.0010374613,0.0003469858,0.00602285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705887,0.000927318,0.00014962228,0.00036845868,0.0009276603,0.0005680292],"domain_scores_gemma":[0.9712569,0.017780999,0.002750123,0.0037768367,0.0033291378,0.0011061212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034617963,0.0005164586,0.0011548338,0.0029457803,0.0010512227,0.0019302911,0.0017879545,0.0012483781,0.00618203],"category_scores_gemma":[0.0325048,0.00063177885,0.00088429917,0.0023962418,0.0026496097,0.0041241837,0.0031074954,0.0016722678,0.0009437689],"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.0006117856,0.00011124276,0.009855498,0.00032294652,0.00012685944,0.0007311424,0.0005597068,0.27165487,0.00625391,0.65831083,0.011253194,0.04020797],"study_design_scores_gemma":[0.000042375457,0.00009166884,0.0012137068,0.00005346104,0.000040620314,0.00046589965,0.00011224038,0.79727715,0.0027770093,0.19513,0.002765704,0.000030215024],"about_ca_topic_score_codex":0.0010649698,"about_ca_topic_score_gemma":0.0009754666,"teacher_disagreement_score":0.00618203,"about_ca_system_score_codex":0.002002828,"about_ca_system_score_gemma":0.0012925828,"threshold_uncertainty_score":0.020681024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6048396,0.00056036515,0.3740199,0.001227637,0.000045404275,0.00008369686,0.0005119466,0.00043455703,0.01827684],"genre_scores_gemma":[0.9359571,0.00040507267,0.05746158,0.00026459727,0.00007551312,0.00021149276,0.0006377482,0.000089135625,0.0048978236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982127,0.0006355765,0.00011774275,0.00039292788,0.00045315048,0.00018795133],"domain_scores_gemma":[0.96909684,0.023754768,0.0015815181,0.0027713843,0.0016466168,0.0011488695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024303647,0.00041133724,0.00080841547,0.0020695825,0.0009586666,0.002648127,0.001770796,0.0012471208,0.0036508057],"category_scores_gemma":[0.034902558,0.00074275734,0.0006673625,0.0013920798,0.0022243666,0.005235103,0.002481494,0.0014297822,0.00042882422],"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.00031742398,0.000113684095,0.016797747,0.00034444995,0.00007785292,0.00034329624,0.0006884391,0.07417329,0.008395996,0.8557186,0.0040776515,0.03895166],"study_design_scores_gemma":[0.000035012275,0.00005944973,0.0023879854,0.000059039932,0.000031245545,0.0005054996,0.00012784102,0.309654,0.0037987402,0.6808962,0.0024188093,0.000026214408],"about_ca_topic_score_codex":0.00061174075,"about_ca_topic_score_gemma":0.0009448436,"teacher_disagreement_score":0.0036508057,"about_ca_system_score_codex":0.0015884057,"about_ca_system_score_gemma":0.00069795665,"threshold_uncertainty_score":0.012853146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5753798,0.0005872324,0.39943048,0.0017641805,0.00021099226,0.00026133077,0.00036583212,0.00083386933,0.02116631],"genre_scores_gemma":[0.86784166,0.00032676055,0.11648814,0.00031889818,0.0000979948,0.0001961303,0.0008194225,0.00033473253,0.013576244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99585897,0.0010860997,0.00025648327,0.00057294103,0.0016330588,0.0005925553],"domain_scores_gemma":[0.9828095,0.007053165,0.0020803027,0.004955567,0.0019838891,0.0011176748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028447218,0.00083436375,0.0012151616,0.001622044,0.0015887393,0.0029684275,0.002168318,0.0010093864,0.0054982444],"category_scores_gemma":[0.01887699,0.0006989727,0.00093136885,0.0010129049,0.002101307,0.0040917094,0.0049148044,0.0018020759,0.00071698526],"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.0029586693,0.00039239053,0.062243327,0.00057948544,0.00058982475,0.0013945329,0.0017675051,0.21131186,0.04699864,0.2712249,0.01856868,0.3819702],"study_design_scores_gemma":[0.00009725819,0.0006862238,0.012436499,0.00019065633,0.00023584488,0.0012655045,0.00075353915,0.76363456,0.051623322,0.14266121,0.026318267,0.000097055825],"about_ca_topic_score_codex":0.0022519908,"about_ca_topic_score_gemma":0.002184417,"teacher_disagreement_score":0.0054982444,"about_ca_system_score_codex":0.0017230946,"about_ca_system_score_gemma":0.0011279575,"threshold_uncertainty_score":0.018393397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036880568,0.00037498042,0.9529307,0.0007288271,0.00008904629,0.00015151358,0.00022452751,0.0025705239,0.006049174],"genre_scores_gemma":[0.28709584,0.00030923833,0.70366895,0.0004523931,0.00015007507,0.00039052527,0.0014613147,0.00056213595,0.0059095602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984212,0.0003343368,0.00011006139,0.00047366097,0.00038062414,0.00028008354],"domain_scores_gemma":[0.9972301,0.0011643782,0.00023713104,0.00093837245,0.00024752913,0.00018243022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011791454,0.0010207478,0.0011626469,0.0014325352,0.0010268736,0.002424861,0.0031320774,0.0013693509,0.008305003],"category_scores_gemma":[0.004595984,0.0006866258,0.0014258003,0.0023709813,0.0011468257,0.0053499658,0.00317821,0.0020230715,0.0025823985],"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.0016119194,0.00082415505,0.0046040993,0.00066695566,0.00026583773,0.0002849108,0.00072654756,0.17905924,0.04136457,0.22445683,0.04369753,0.5024374],"study_design_scores_gemma":[0.00032728305,0.00024091844,0.00081586814,0.000042055784,0.00009440064,0.00037429403,0.00013697983,0.8438859,0.013294139,0.13142619,0.009308078,0.00005389076],"about_ca_topic_score_codex":0.002295803,"about_ca_topic_score_gemma":0.003788669,"teacher_disagreement_score":0.008305003,"about_ca_system_score_codex":0.0018631892,"about_ca_system_score_gemma":0.0017401619,"threshold_uncertainty_score":0.027783036},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8065007,0.00025436215,0.18619566,0.0004559436,0.000023812569,0.0001340975,0.00012784207,0.0006373148,0.005670199],"genre_scores_gemma":[0.94904965,0.000117944524,0.047530968,0.000089988236,0.00002077939,0.0001204665,0.00018117565,0.00012568725,0.0027632364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945754,0.00017284462,0.00002058761,0.00009912465,0.00009385201,0.00015594304],"domain_scores_gemma":[0.993236,0.0056059575,0.00038249601,0.0003027669,0.00015262599,0.00032025308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090148195,0.00057107967,0.0008254439,0.0007615173,0.00053764525,0.0010413567,0.0010304133,0.00086874596,0.0038293554],"category_scores_gemma":[0.00693691,0.0004124038,0.0006291518,0.0006783637,0.0008670655,0.0018811256,0.0012614591,0.00078951905,0.00038942302],"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.0013823526,0.00035443003,0.004800284,0.00024955478,0.0001197771,0.0006842423,0.0005525175,0.8441635,0.023620442,0.073203474,0.0022996764,0.048569757],"study_design_scores_gemma":[0.000054998218,0.000096293086,0.00029967,0.000009061772,0.0000154821,0.00004882228,0.000046282013,0.9640438,0.001714206,0.03329913,0.0003650484,0.000007263764],"about_ca_topic_score_codex":0.0011886683,"about_ca_topic_score_gemma":0.0016849531,"teacher_disagreement_score":0.0038293554,"about_ca_system_score_codex":0.00067077647,"about_ca_system_score_gemma":0.0004249324,"threshold_uncertainty_score":0.012810469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77551025,0.0008085926,0.21530834,0.0011754647,0.000088238834,0.0000711323,0.00026863592,0.0005591215,0.006210264],"genre_scores_gemma":[0.9791266,0.000403126,0.018461555,0.000100096055,0.000076865115,0.00008608977,0.0001485618,0.00008548436,0.0015116151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958676,0.00010885826,0.000018848603,0.00013275776,0.000081920836,0.000070957045],"domain_scores_gemma":[0.99475175,0.0034335821,0.00053393946,0.00045728643,0.00027089345,0.0005526263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016292754,0.00037465573,0.0008781479,0.0016920891,0.0006838897,0.0014035245,0.00095955393,0.00078338495,0.0026789429],"category_scores_gemma":[0.010854452,0.00037399735,0.000465304,0.0006939552,0.0016341242,0.0039703497,0.0010633918,0.000790428,0.0002791404],"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.00043975798,0.00007997933,0.0035597882,0.00020695421,0.000056369707,0.000573049,0.0004996351,0.09249588,0.024653913,0.85581553,0.003051888,0.01856724],"study_design_scores_gemma":[0.000052658947,0.00009184016,0.0016812836,0.00003492987,0.00003050635,0.00028372245,0.00009998089,0.6524995,0.0038485702,0.3393146,0.0020226003,0.000039771774],"about_ca_topic_score_codex":0.0010294807,"about_ca_topic_score_gemma":0.00054716785,"teacher_disagreement_score":0.0026789429,"about_ca_system_score_codex":0.0011441022,"about_ca_system_score_gemma":0.00047292924,"threshold_uncertainty_score":0.008961916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8193157,0.00030043002,0.16469851,0.00084535126,0.000037520513,0.00010345569,0.0005535672,0.00028830365,0.013857236],"genre_scores_gemma":[0.9939889,0.000084614294,0.0047807377,0.00008718476,0.000047569814,0.000053821164,0.00021739423,0.0000305354,0.0007092821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987174,0.00038720536,0.00007736073,0.0002936404,0.00027186604,0.00025247975],"domain_scores_gemma":[0.98787504,0.0064419406,0.002165908,0.00094213395,0.0011389237,0.0014360648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016540864,0.00043549066,0.0008330354,0.003406248,0.0009952551,0.0019053257,0.0015095011,0.0012016561,0.0037476772],"category_scores_gemma":[0.014737391,0.0005028958,0.0005970161,0.0009778012,0.0023114393,0.003061795,0.0019176762,0.0013888314,0.00027876487],"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.00026903508,0.000089286616,0.0098629035,0.00012540106,0.000044626813,0.0008867103,0.00060301326,0.04481757,0.007972588,0.92848194,0.0020815658,0.004765242],"study_design_scores_gemma":[0.000090441245,0.000120259574,0.011104304,0.000048129088,0.00006205683,0.00091185316,0.00028499585,0.32988313,0.0033007753,0.65192986,0.0022036175,0.000060689854],"about_ca_topic_score_codex":0.0015127714,"about_ca_topic_score_gemma":0.0015360789,"teacher_disagreement_score":0.0037476772,"about_ca_system_score_codex":0.001088932,"about_ca_system_score_gemma":0.00032468865,"threshold_uncertainty_score":0.012537241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.624688,0.00031296504,0.36405867,0.0010674265,0.000057775287,0.00010189161,0.00011889376,0.00064376666,0.008950529],"genre_scores_gemma":[0.9701413,0.000108564884,0.02691773,0.000103124636,0.000022365588,0.000116338015,0.00009545577,0.000105585976,0.002389651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991135,0.00036152595,0.000032206604,0.00017826245,0.00013955706,0.00017489675],"domain_scores_gemma":[0.99394196,0.0037625798,0.00067266525,0.0005900049,0.0002829792,0.00074982207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019288615,0.0005484288,0.0008068048,0.0010682936,0.0013310519,0.0018819879,0.00085186266,0.0011978945,0.0040131854],"category_scores_gemma":[0.01199551,0.0006933883,0.00071256654,0.00037740418,0.0025415341,0.0031535702,0.0019407517,0.0014946694,0.00043862764],"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.0004904773,0.00010117344,0.0026166749,0.000078401186,0.000051816958,0.00019796033,0.0006062914,0.17521128,0.013557491,0.7943847,0.0018352284,0.010868564],"study_design_scores_gemma":[0.00005423575,0.00004266491,0.00036808033,0.00000991909,0.000009694176,0.00003996116,0.00005477092,0.6530799,0.0027556627,0.3429246,0.00063779793,0.000022704631],"about_ca_topic_score_codex":0.0022489694,"about_ca_topic_score_gemma":0.0020109422,"teacher_disagreement_score":0.0040131854,"about_ca_system_score_codex":0.0020331328,"about_ca_system_score_gemma":0.0007864168,"threshold_uncertainty_score":0.014751434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3725602,0.0004544094,0.5998454,0.002548166,0.000109260625,0.00008989891,0.0002235401,0.0005032579,0.02366585],"genre_scores_gemma":[0.92054427,0.00028838599,0.07222049,0.00028736034,0.00006335169,0.00012603891,0.00016755122,0.00019085908,0.0061116884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990772,0.0002893744,0.000058454207,0.00018174367,0.00025715606,0.00013599696],"domain_scores_gemma":[0.9867987,0.0097595565,0.000607908,0.001022423,0.001318349,0.00049300137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022821582,0.0004756849,0.0004938669,0.0011019076,0.00072905223,0.0029861478,0.000812923,0.0011062705,0.0057023265],"category_scores_gemma":[0.018930404,0.00034551215,0.0006859694,0.00057592354,0.002550563,0.0064394567,0.0012461523,0.0016216742,0.0007735526],"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.00013930319,0.000031923704,0.001280002,0.00008858871,0.00001911611,0.00011920824,0.0003547941,0.02574957,0.008233767,0.94082046,0.0014330762,0.021730205],"study_design_scores_gemma":[0.000022738897,0.000029327257,0.00035200812,0.000036193887,0.000021205577,0.0001097023,0.00012436388,0.2808333,0.013914546,0.7020178,0.0025119681,0.000026885318],"about_ca_topic_score_codex":0.00092930836,"about_ca_topic_score_gemma":0.00070104876,"teacher_disagreement_score":0.0057023265,"about_ca_system_score_codex":0.0011306378,"about_ca_system_score_gemma":0.000698628,"threshold_uncertainty_score":0.019076169},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7786932,0.0008187328,0.20458654,0.0005678909,0.00007857073,0.00009535026,0.0004971523,0.0004917002,0.01417082],"genre_scores_gemma":[0.9503026,0.00055462244,0.044474415,0.00015118827,0.00005972109,0.00008335685,0.00056232937,0.00014571671,0.0036659844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993339,0.0002161154,0.0000488009,0.00016492954,0.000101359576,0.00013483642],"domain_scores_gemma":[0.99345464,0.0038205574,0.0009771644,0.0009634967,0.00028772888,0.00049634895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056728703,0.00043326974,0.00034768754,0.001108755,0.0008093447,0.0013672757,0.0006250476,0.00083073863,0.00294644],"category_scores_gemma":[0.0054358845,0.00051775144,0.0006345686,0.001049514,0.0016046138,0.002111337,0.0015573632,0.0009341492,0.00041003447],"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.0007044043,0.00010664987,0.0140943425,0.00047547175,0.000079504745,0.0013258503,0.0016272676,0.046864364,0.041546054,0.8240967,0.006118275,0.06296106],"study_design_scores_gemma":[0.000050874274,0.00009655917,0.0041898536,0.00006906454,0.0000691367,0.0011645705,0.00028177997,0.058027625,0.011670203,0.9124202,0.011918367,0.000041745196],"about_ca_topic_score_codex":0.00053662976,"about_ca_topic_score_gemma":0.0009789995,"teacher_disagreement_score":0.00294644,"about_ca_system_score_codex":0.000547141,"about_ca_system_score_gemma":0.00033837243,"threshold_uncertainty_score":0.00985682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024588265,0.0003162472,0.9567585,0.0006025455,0.00015801168,0.00018807277,0.000116218645,0.001165467,0.016106628],"genre_scores_gemma":[0.3567726,0.00033042947,0.6247086,0.0007337046,0.00025635993,0.00062824064,0.00055460125,0.00052176515,0.015493725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734336,0.0012162015,0.00012693934,0.00041533026,0.0006269769,0.00027126452],"domain_scores_gemma":[0.9943229,0.003151724,0.00017166794,0.0015792856,0.00057734514,0.0001970942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002871867,0.00081522146,0.00096550013,0.0010543399,0.0011010598,0.0013786316,0.0021362486,0.0017349751,0.010756279],"category_scores_gemma":[0.011737928,0.0004677902,0.0007750892,0.00149712,0.0019735827,0.003167558,0.0032669245,0.0025001098,0.002656922],"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.00041006214,0.00014616789,0.0010143751,0.00010210734,0.000061207786,0.00010923108,0.00015249888,0.099257365,0.0026500535,0.6032752,0.012484415,0.28033748],"study_design_scores_gemma":[0.00009930061,0.00005806987,0.00012736717,0.00001800321,0.00001859951,0.00009534294,0.000017324337,0.6726813,0.0023312878,0.31717265,0.007362218,0.000018559997],"about_ca_topic_score_codex":0.0013381119,"about_ca_topic_score_gemma":0.0009993445,"teacher_disagreement_score":0.010756279,"about_ca_system_score_codex":0.00080934167,"about_ca_system_score_gemma":0.001469119,"threshold_uncertainty_score":0.035983384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056974433,0.001232681,0.92162615,0.0016479323,0.00009729456,0.000055321794,0.00016874423,0.0004161209,0.01778132],"genre_scores_gemma":[0.89614683,0.0013515207,0.09522354,0.00074198254,0.00034533307,0.00023456808,0.0002079744,0.00039951084,0.0053487383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716264,0.0012388987,0.00009540505,0.00053153216,0.00067615934,0.00029525766],"domain_scores_gemma":[0.9378428,0.051666033,0.0030148672,0.004134782,0.0017201606,0.0016213193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00483688,0.0011124744,0.0012558803,0.0024429811,0.0013520619,0.003332335,0.002687781,0.0018644513,0.00557991],"category_scores_gemma":[0.04131841,0.0008595187,0.0014820887,0.001220376,0.0050821416,0.010499549,0.0050492794,0.005355876,0.0007637831],"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.00003199765,0.000024168487,0.0009004551,0.00007880792,0.000020712461,0.00016390994,0.00021064225,0.036194075,0.0015894524,0.95429206,0.001417227,0.005076519],"study_design_scores_gemma":[0.000011117841,0.000021786283,0.00030417775,0.000027139235,0.000014090812,0.00013408356,0.000046889258,0.26267338,0.0010506549,0.7330321,0.002664705,0.000020002879],"about_ca_topic_score_codex":0.0013353957,"about_ca_topic_score_gemma":0.0013703267,"teacher_disagreement_score":0.00557991,"about_ca_system_score_codex":0.0022055306,"about_ca_system_score_gemma":0.00074708584,"threshold_uncertainty_score":0.025580227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35647008,0.0020385673,0.6064399,0.004346414,0.00034599027,0.00016142667,0.0014477818,0.0011538619,0.027595906],"genre_scores_gemma":[0.89741504,0.00093105796,0.0921415,0.0005898885,0.00048716812,0.00032682598,0.00070099777,0.0003259428,0.007081555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962315,0.00094301044,0.00028486934,0.00095440214,0.0010868511,0.000499322],"domain_scores_gemma":[0.96574533,0.02482118,0.0020452656,0.0032286923,0.002976539,0.0011829325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030666413,0.0007223223,0.0010569728,0.0017740222,0.001118597,0.0025985467,0.0014539799,0.0011623235,0.0061485353],"category_scores_gemma":[0.031433724,0.0007742259,0.0012859287,0.0011904507,0.0036628784,0.008081424,0.001609273,0.003199527,0.0008835643],"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.000696419,0.00014033898,0.0056877504,0.00042803402,0.00011871655,0.0003302699,0.0005219042,0.07174565,0.02152661,0.836452,0.0056396034,0.05671275],"study_design_scores_gemma":[0.00005853361,0.00020683504,0.0028531766,0.00008638884,0.00004625455,0.0005874262,0.000086068954,0.23859513,0.009343993,0.73937565,0.008643067,0.00011744098],"about_ca_topic_score_codex":0.0010513129,"about_ca_topic_score_gemma":0.0007403642,"teacher_disagreement_score":0.0061485353,"about_ca_system_score_codex":0.0025844243,"about_ca_system_score_gemma":0.0010692063,"threshold_uncertainty_score":0.020568967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20529664,0.0027299784,0.76095575,0.0014304752,0.00031194475,0.00033229726,0.0027231006,0.0031484638,0.023071337],"genre_scores_gemma":[0.6846106,0.0008512412,0.29426375,0.0006079907,0.00018398059,0.0003866963,0.004218103,0.00045911467,0.014418456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899715,0.0002912404,0.000090855065,0.00019552528,0.00029819223,0.00012697943],"domain_scores_gemma":[0.9964994,0.0015639181,0.00032105818,0.00086207874,0.00058650173,0.00016701882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010005526,0.00026529023,0.0006632595,0.0012319637,0.00073016196,0.0010866164,0.0008955747,0.00088174397,0.006615023],"category_scores_gemma":[0.008745578,0.00031821243,0.00042482713,0.0019528666,0.00077790994,0.0025630447,0.0015698388,0.00064812024,0.0022133011],"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.0010509433,0.00020260223,0.0050308253,0.00059466244,0.0001339564,0.00068319886,0.00045966503,0.15983358,0.02495629,0.4434137,0.03723926,0.32640126],"study_design_scores_gemma":[0.00016157248,0.00018918002,0.0009858842,0.00008034686,0.000057945344,0.0011659013,0.00013486682,0.6566532,0.011753521,0.29972243,0.029052213,0.00004303562],"about_ca_topic_score_codex":0.0004735362,"about_ca_topic_score_gemma":0.0008467831,"teacher_disagreement_score":0.006615023,"about_ca_system_score_codex":0.0006144251,"about_ca_system_score_gemma":0.00074402295,"threshold_uncertainty_score":0.022129416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3387819,0.0013255075,0.6201043,0.0027449608,0.00020507073,0.00024142874,0.00097458117,0.00041859772,0.03520368],"genre_scores_gemma":[0.9521537,0.0007151245,0.041421123,0.0006437971,0.00056893734,0.00023870979,0.00056568335,0.000138579,0.0035544615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938864,0.0021670565,0.00028509405,0.0014823633,0.0015412737,0.00063778],"domain_scores_gemma":[0.9537617,0.031918652,0.003871316,0.0053508165,0.0036406843,0.0014568078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032982954,0.00054073834,0.001056003,0.0029747665,0.0014310307,0.0026346107,0.0015416206,0.0022176374,0.0039712396],"category_scores_gemma":[0.03566073,0.00066423015,0.0010500837,0.0020669706,0.0065061,0.007423413,0.0034116472,0.003370405,0.00047125452],"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.00012601237,0.000036926336,0.0031564597,0.00013089563,0.00003212606,0.0002861885,0.00049145607,0.016374413,0.005315319,0.9607129,0.0016306172,0.011706651],"study_design_scores_gemma":[0.000025156472,0.00008184191,0.0014074,0.00004934402,0.000021424183,0.00029283765,0.00019314987,0.0905256,0.0037038948,0.8995575,0.0040965,0.000045323606],"about_ca_topic_score_codex":0.00097633136,"about_ca_topic_score_gemma":0.0005225729,"teacher_disagreement_score":0.0039712396,"about_ca_system_score_codex":0.0019686813,"about_ca_system_score_gemma":0.0007777917,"threshold_uncertainty_score":0.0174433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9141976,0.00036195645,0.078636296,0.00022953394,0.000016372987,0.000024767074,0.00016706834,0.00013067578,0.0062356764],"genre_scores_gemma":[0.97981036,0.00015490071,0.018186055,0.000061572544,0.000027763774,0.000042990632,0.00018353667,0.00004099449,0.0014918295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993216,0.00020200519,0.00004896906,0.00015173532,0.00014945571,0.00012626644],"domain_scores_gemma":[0.9954815,0.0024465555,0.0008648199,0.0005775368,0.00022823657,0.00040128228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882822,0.00029678727,0.0006150177,0.0015332497,0.001106953,0.0018700868,0.0007421913,0.000647713,0.0023402383],"category_scores_gemma":[0.007013522,0.0005455618,0.0005237807,0.001395602,0.001595208,0.0031335023,0.0015036057,0.00062448275,0.00019807841],"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.00072917604,0.00018354837,0.0117496615,0.00016774047,0.000097416,0.00066243386,0.0010673897,0.13967153,0.010400499,0.7905333,0.002926608,0.04181078],"study_design_scores_gemma":[0.000048123115,0.0001025463,0.0043973327,0.00004138127,0.000036560763,0.00066538394,0.00035133935,0.34204546,0.0043131197,0.6445275,0.0034340618,0.00003717822],"about_ca_topic_score_codex":0.0010440587,"about_ca_topic_score_gemma":0.0010395561,"teacher_disagreement_score":0.0023402383,"about_ca_system_score_codex":0.0012918684,"about_ca_system_score_gemma":0.00024818466,"threshold_uncertainty_score":0.009373248},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029423116,0.00004323458,0.99496895,0.00011891171,0.000018549354,0.000042485164,0.000029909272,0.00021970469,0.0016159236],"genre_scores_gemma":[0.17224123,0.0002243512,0.8216298,0.0003823242,0.00012334756,0.00031724095,0.0002273784,0.00026352695,0.004590862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965127,0.0014913863,0.00018125262,0.0004694478,0.0010718362,0.00027333063],"domain_scores_gemma":[0.98976314,0.0060168803,0.00044490575,0.0023513774,0.0010915062,0.00033214918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007727746,0.00067453564,0.0013227339,0.001418052,0.00086837227,0.0016894323,0.0029660591,0.0018221751,0.0048698382],"category_scores_gemma":[0.028174646,0.00065129774,0.0014133777,0.001373836,0.0023946124,0.0031888993,0.004807571,0.002711489,0.0010775359],"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.0002469296,0.00010398256,0.0013998348,0.00014345007,0.0000740508,0.00019173422,0.000305658,0.17628953,0.00223692,0.6427599,0.003929606,0.17231853],"study_design_scores_gemma":[0.00004367485,0.000061001174,0.00015497595,0.000021496395,0.000015457439,0.00011469289,0.00001859464,0.78101885,0.0013827968,0.21154653,0.0055970354,0.00002488724],"about_ca_topic_score_codex":0.0017969718,"about_ca_topic_score_gemma":0.0016365172,"teacher_disagreement_score":0.007727746,"about_ca_system_score_codex":0.0010515703,"about_ca_system_score_gemma":0.0020141131,"threshold_uncertainty_score":0.0408687},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5608802,0.0006690432,0.4273213,0.0014627225,0.000058025045,0.00006403369,0.0002248185,0.0002854756,0.009034414],"genre_scores_gemma":[0.98007923,0.00027064566,0.015498513,0.00014545454,0.00007346932,0.00008137867,0.00012272503,0.0000858289,0.0036427048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979898,0.0007743847,0.00008044931,0.00037625607,0.00047386604,0.00030531432],"domain_scores_gemma":[0.9825943,0.011889589,0.0015660019,0.001130988,0.0015056072,0.001313521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044115647,0.00036435397,0.0011686266,0.0024537013,0.0015595595,0.0028571142,0.0015601803,0.0010150123,0.0030505005],"category_scores_gemma":[0.03196256,0.00082181377,0.0008825336,0.0010592433,0.0044417516,0.004125998,0.0028263787,0.002001997,0.00046680958],"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.00007574055,0.000026182024,0.0042230887,0.000061500155,0.000026645763,0.00019130488,0.00054885476,0.03727216,0.0019893784,0.94963896,0.00075016834,0.0051960167],"study_design_scores_gemma":[0.000028701641,0.00004030793,0.0019478578,0.000041704923,0.000016694996,0.0002386826,0.0002091159,0.24679655,0.0012492031,0.74783415,0.0015639615,0.000033104265],"about_ca_topic_score_codex":0.0025309164,"about_ca_topic_score_gemma":0.0026823105,"teacher_disagreement_score":0.0044115647,"about_ca_system_score_codex":0.0022579602,"about_ca_system_score_gemma":0.00070871477,"threshold_uncertainty_score":0.023330867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43510783,0.0024639608,0.5198125,0.0031664933,0.00014489942,0.0002748187,0.0007527424,0.0009488546,0.037327845],"genre_scores_gemma":[0.8950179,0.0011583312,0.09230239,0.0006436726,0.00015986168,0.0005305321,0.0005261724,0.00027141595,0.009389797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703526,0.0011275692,0.00014974522,0.00068805064,0.0006207122,0.00037870315],"domain_scores_gemma":[0.98348063,0.010467997,0.0018516149,0.0018675919,0.0010162799,0.0013159394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003490899,0.0008583619,0.0015079495,0.0025874844,0.0019887763,0.0027452176,0.0023032387,0.0017322676,0.004823398],"category_scores_gemma":[0.024384025,0.000973849,0.0013199534,0.001940867,0.004170831,0.006158914,0.0039843093,0.0022550956,0.0008093783],"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.00010768243,0.000052642434,0.0008243679,0.00011563441,0.000036982914,0.00015318778,0.0002431892,0.03136717,0.0012549345,0.9544177,0.0022127337,0.009213817],"study_design_scores_gemma":[0.000052604013,0.0000505249,0.00033254782,0.00004253974,0.000023536608,0.00017045748,0.000051407795,0.12588231,0.00086408324,0.8697538,0.0027461546,0.000030025361],"about_ca_topic_score_codex":0.002514904,"about_ca_topic_score_gemma":0.0020077054,"teacher_disagreement_score":0.004823398,"about_ca_system_score_codex":0.0032545526,"about_ca_system_score_gemma":0.0014202604,"threshold_uncertainty_score":0.023613513},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41768396,0.00047503397,0.57023335,0.00061885396,0.000039342696,0.0001801689,0.0006381603,0.00038720964,0.009743895],"genre_scores_gemma":[0.7506882,0.000557551,0.24255751,0.00020521897,0.000058065907,0.00028090397,0.0011745726,0.00013555662,0.004342481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985247,0.00036282217,0.00008711005,0.0003480108,0.000510183,0.00016715762],"domain_scores_gemma":[0.99074334,0.0049736784,0.0017848444,0.0009572096,0.00092374324,0.0006172747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071215647,0.00059819454,0.0007945051,0.0027584303,0.00088615983,0.0016907878,0.0012391508,0.0007956226,0.0036204585],"category_scores_gemma":[0.0066975667,0.0011295585,0.0008583324,0.0020491234,0.0018275314,0.0024967063,0.0024882902,0.001323311,0.0004914784],"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.00058843754,0.00011299568,0.005160141,0.0003382133,0.00012707754,0.00053497555,0.0013832517,0.44827747,0.02549145,0.4642777,0.0034249688,0.050283205],"study_design_scores_gemma":[0.00013967481,0.00013783602,0.0048334934,0.0000802052,0.00005116023,0.0004978252,0.00058712804,0.6275916,0.013870019,0.3394012,0.012746207,0.00006365688],"about_ca_topic_score_codex":0.0048354506,"about_ca_topic_score_gemma":0.0032457334,"teacher_disagreement_score":0.0048354506,"about_ca_system_score_codex":0.0013297145,"about_ca_system_score_gemma":0.0005179916,"threshold_uncertainty_score":0.012111604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7271904,0.0011098996,0.26048803,0.0013458648,0.00006219246,0.00007133856,0.00017356122,0.0002615488,0.009297202],"genre_scores_gemma":[0.98997915,0.0002619237,0.00845058,0.00010868438,0.00007775913,0.000051308027,0.00008528562,0.000037297566,0.0009479805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862874,0.000565944,0.00006656374,0.00023897529,0.00027530006,0.00022448195],"domain_scores_gemma":[0.98241764,0.0124853505,0.002589561,0.00091080513,0.00066982367,0.0009268243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025509621,0.0006349797,0.0010416678,0.0019109616,0.00093159074,0.0017223016,0.0014902182,0.0012570256,0.0026508246],"category_scores_gemma":[0.015217149,0.00066967076,0.0005640193,0.0011854555,0.0026852041,0.0033296042,0.0016593032,0.0012400794,0.0002751487],"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.0004911084,0.00017587461,0.004829323,0.0002486605,0.00011031677,0.00068504916,0.00040455192,0.25550202,0.013975718,0.7055926,0.0034849104,0.014499972],"study_design_scores_gemma":[0.00005963517,0.00009978052,0.0013673486,0.000044096603,0.000025431016,0.00034274973,0.00009148913,0.7042198,0.0033546356,0.28939497,0.0009708398,0.000029192588],"about_ca_topic_score_codex":0.0005899545,"about_ca_topic_score_gemma":0.00056787883,"teacher_disagreement_score":0.0026508246,"about_ca_system_score_codex":0.0012062042,"about_ca_system_score_gemma":0.0003875406,"threshold_uncertainty_score":0.013490915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4518641,0.0013612421,0.5293007,0.0018873333,0.000087663124,0.000090345246,0.0002116528,0.0001882673,0.015008748],"genre_scores_gemma":[0.9783846,0.000394404,0.01747603,0.0001628127,0.000055848515,0.000059056794,0.0000694594,0.000022298525,0.0033755132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845386,0.0006606759,0.00006311116,0.00028731575,0.0003044091,0.00023060635],"domain_scores_gemma":[0.9921036,0.00494098,0.0011745133,0.00059079024,0.00061354303,0.00057651656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026653225,0.00040661028,0.00096142304,0.0013468779,0.0010526438,0.0016245671,0.0016010299,0.0016783496,0.0034861285],"category_scores_gemma":[0.014851847,0.00057355425,0.0006321833,0.0013163622,0.0025272595,0.0037998564,0.0016849707,0.0011112806,0.0003363637],"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.00009257916,0.000052684958,0.0015937217,0.00009886743,0.000060043036,0.00021906287,0.00026508304,0.07224706,0.0008608666,0.9116091,0.0014774685,0.011423413],"study_design_scores_gemma":[0.0000420279,0.00003799378,0.00041813674,0.00002243436,0.000022656768,0.000102520615,0.00006536126,0.24536118,0.00038278187,0.75221467,0.0013119399,0.000018238206],"about_ca_topic_score_codex":0.00260687,"about_ca_topic_score_gemma":0.0017247908,"teacher_disagreement_score":0.0034861285,"about_ca_system_score_codex":0.0017314325,"about_ca_system_score_gemma":0.0007985982,"threshold_uncertainty_score":0.014095783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17851189,0.00078159047,0.79833996,0.0012364628,0.00014296902,0.000077246434,0.00022092115,0.0006675024,0.020021593],"genre_scores_gemma":[0.9625055,0.00037280933,0.028318865,0.00026590886,0.00015419167,0.00012704368,0.00022690833,0.00019890294,0.007829914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988018,0.00047980304,0.000034463028,0.00021729393,0.00029887122,0.00016776382],"domain_scores_gemma":[0.9931825,0.003795071,0.0011033202,0.00078184233,0.00073724554,0.00040002944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023414986,0.0006623189,0.0007684423,0.0017866895,0.0009807542,0.0015351373,0.0016523643,0.0012934192,0.0070548947],"category_scores_gemma":[0.015867662,0.0005000458,0.0007276422,0.00087890326,0.0019351073,0.0032950225,0.0014437311,0.0016349934,0.00061933],"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.00014089904,0.00003303271,0.00095281616,0.00008831888,0.00003519051,0.00009210374,0.00014062933,0.3860965,0.0033052391,0.5936523,0.003045845,0.012417138],"study_design_scores_gemma":[0.000011492647,0.000029965826,0.0002960535,0.000012313429,0.0000094770085,0.00003661622,0.000020630065,0.8005862,0.0005328017,0.19663404,0.0018189526,0.000011474523],"about_ca_topic_score_codex":0.0027796822,"about_ca_topic_score_gemma":0.0013162261,"teacher_disagreement_score":0.0070548947,"about_ca_system_score_codex":0.0026636918,"about_ca_system_score_gemma":0.0006967862,"threshold_uncertainty_score":0.023600996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76589775,0.0002592518,0.2261864,0.0007813117,0.000030485353,0.00019991078,0.0010596804,0.00062521145,0.004959993],"genre_scores_gemma":[0.98766786,0.00004393051,0.010990031,0.000090699796,0.0000336623,0.00013473154,0.0005734,0.000056434583,0.00040927125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98973036,0.0030875287,0.00079919177,0.002519095,0.0029094159,0.00095436693],"domain_scores_gemma":[0.84834,0.10396378,0.013875286,0.022282684,0.0069932966,0.004544952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067684655,0.0009514268,0.0019139496,0.0020951799,0.0010070379,0.0036776685,0.0037554458,0.0021249885,0.003968022],"category_scores_gemma":[0.078422576,0.0009363582,0.0016981281,0.0015954138,0.006442502,0.007635949,0.0033603196,0.0029213394,0.0003408184],"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.004568112,0.0012719531,0.09528376,0.0008274298,0.0010128398,0.0028838622,0.0014163016,0.27871668,0.07487485,0.4688316,0.0034294904,0.06688306],"study_design_scores_gemma":[0.00028567194,0.0005967435,0.010198373,0.00005320883,0.00014017442,0.0012385537,0.0003015282,0.70375466,0.025847578,0.25606802,0.0014174489,0.00009801293],"about_ca_topic_score_codex":0.00093402195,"about_ca_topic_score_gemma":0.0005377019,"teacher_disagreement_score":0.0067684655,"about_ca_system_score_codex":0.002198693,"about_ca_system_score_gemma":0.0013631703,"threshold_uncertainty_score":0.03579551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82752943,0.0003674663,0.15413941,0.0008523469,0.000045855926,0.000037851296,0.0003255248,0.00039665418,0.016305445],"genre_scores_gemma":[0.9775524,0.00013633055,0.01914451,0.00011300184,0.000059369675,0.00007988956,0.00037433614,0.000068371766,0.0024717404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905866,0.0002908692,0.000036045043,0.00018548642,0.00031453578,0.00011437386],"domain_scores_gemma":[0.99084,0.0059371577,0.0009593256,0.00093140104,0.0008525256,0.00047957472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097158906,0.00030504662,0.00059988565,0.0018330938,0.00061440986,0.0015859553,0.0012504518,0.0010222348,0.0029787803],"category_scores_gemma":[0.01687362,0.00041607898,0.00032391972,0.0010065117,0.0015365711,0.0029634626,0.0014173661,0.00086134457,0.00030260478],"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.0004929296,0.00016102799,0.016040254,0.00037400873,0.000058275436,0.00045227748,0.00068733614,0.07704505,0.021948962,0.83622974,0.0061890916,0.04032112],"study_design_scores_gemma":[0.00003608871,0.000057292447,0.004240966,0.000046223708,0.000020057394,0.00061013,0.000121736346,0.41287285,0.0057704453,0.57378525,0.002415607,0.000023273218],"about_ca_topic_score_codex":0.00043323194,"about_ca_topic_score_gemma":0.00074681494,"teacher_disagreement_score":0.0029787803,"about_ca_system_score_codex":0.0010618101,"about_ca_system_score_gemma":0.0004105747,"threshold_uncertainty_score":0.009965003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33955365,0.0012975454,0.62966007,0.0026106357,0.0001652341,0.00021004582,0.001271751,0.001242262,0.023988742],"genre_scores_gemma":[0.7250112,0.000680681,0.26055416,0.00069138367,0.00012651438,0.0007582817,0.0021051934,0.00048691445,0.009585611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961694,0.0015967475,0.00021805282,0.00083227456,0.0007737518,0.00040979293],"domain_scores_gemma":[0.9853044,0.008124989,0.000996708,0.004083858,0.000790748,0.00069929357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025162664,0.00058631453,0.0010329614,0.0018348868,0.0020220387,0.0035960877,0.0027518403,0.0015596412,0.0066855955],"category_scores_gemma":[0.018626384,0.001056482,0.0009062803,0.0025477635,0.002690533,0.007091344,0.0051834215,0.0022664152,0.0011049686],"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.0002266209,0.00010114277,0.002351069,0.00017453017,0.000040823455,0.000114404254,0.00035205463,0.0440853,0.0047660256,0.90613323,0.0062525477,0.035402283],"study_design_scores_gemma":[0.00008144342,0.00006156149,0.0004364044,0.00005742289,0.00002025059,0.000227663,0.00016074575,0.21026435,0.0047164815,0.7753361,0.008599239,0.000038341193],"about_ca_topic_score_codex":0.0008483241,"about_ca_topic_score_gemma":0.0012992071,"teacher_disagreement_score":0.0066855955,"about_ca_system_score_codex":0.0025685923,"about_ca_system_score_gemma":0.001287875,"threshold_uncertainty_score":0.02236551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3060369,0.00035853073,0.6722863,0.0009843605,0.000089696,0.00006270144,0.00017161075,0.00018119572,0.019828737],"genre_scores_gemma":[0.9173942,0.0003374352,0.07560238,0.00021743613,0.000086505715,0.00011214621,0.00019232751,0.00008509238,0.0059724585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989767,0.0003725583,0.000039021816,0.00018252592,0.0003097379,0.00011938398],"domain_scores_gemma":[0.9965064,0.0015718496,0.0004572075,0.0004053451,0.0004903226,0.0005687489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015118403,0.00031163442,0.00050276547,0.0008090594,0.0010309259,0.0019301074,0.0009314558,0.0009236416,0.0031430766],"category_scores_gemma":[0.008325658,0.00040630382,0.00057549414,0.00063325604,0.0033119475,0.0030411906,0.0023900534,0.0019628522,0.0003351574],"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.000014907616,0.00001130272,0.000346607,0.000011468083,0.00000350785,0.000053397784,0.00011498139,0.005770963,0.0006310419,0.990803,0.00018670266,0.002052122],"study_design_scores_gemma":[0.000013347227,0.000022664895,0.00044404983,0.000013322633,0.0000027341312,0.0000663009,0.00006123013,0.09614904,0.0006141435,0.9014379,0.0011599243,0.000015298936],"about_ca_topic_score_codex":0.0017778609,"about_ca_topic_score_gemma":0.0011367477,"teacher_disagreement_score":0.0031430766,"about_ca_system_score_codex":0.0009926637,"about_ca_system_score_gemma":0.0008300993,"threshold_uncertainty_score":0.010514617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11821755,0.0014784513,0.85914546,0.00078772375,0.00008742142,0.00007095411,0.00022811035,0.00032230746,0.019662084],"genre_scores_gemma":[0.8236341,0.0022196576,0.15278108,0.00043337833,0.00034078563,0.00038563408,0.0005295374,0.00033314162,0.019342676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983473,0.00070619537,0.00007062926,0.00024051045,0.00039486072,0.00024055863],"domain_scores_gemma":[0.9923544,0.0054362374,0.00055361557,0.00046451436,0.00079597684,0.00039523788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034021272,0.0008400264,0.0010109792,0.0023828107,0.0010343997,0.0025723614,0.0015338158,0.0016039945,0.0041597364],"category_scores_gemma":[0.019205837,0.00060975313,0.0011315779,0.0018329866,0.0032317652,0.0051613613,0.0017552803,0.0021134657,0.00082496944],"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.0000056985623,0.0000038432586,0.00015041852,0.0000099189065,0.0000034210698,0.00003228163,0.00007050996,0.00955198,0.00021355695,0.98784536,0.00027641412,0.001836572],"study_design_scores_gemma":[0.00000816826,0.000008482201,0.00020605401,0.000016840999,0.0000052338078,0.000053059895,0.000022752973,0.1641367,0.00026311364,0.83359194,0.0016739818,0.000013724384],"about_ca_topic_score_codex":0.002384161,"about_ca_topic_score_gemma":0.0020473085,"teacher_disagreement_score":0.0041597364,"about_ca_system_score_codex":0.0023126449,"about_ca_system_score_gemma":0.00090019446,"threshold_uncertainty_score":0.017992377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30784297,0.0012286042,0.66908145,0.0017986745,0.00020209845,0.0003066842,0.00026562146,0.0011136498,0.018160284],"genre_scores_gemma":[0.9177159,0.00047450163,0.074106775,0.00031474043,0.00011585943,0.00022176435,0.00015132391,0.00030346765,0.0065957834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822336,0.0004385945,0.00010456471,0.00046786515,0.00035420168,0.00041137185],"domain_scores_gemma":[0.9820225,0.010204237,0.0016520573,0.0040926044,0.0011698122,0.00085876184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039154636,0.000839122,0.0012131036,0.0007216044,0.0013903282,0.0020424293,0.0019424806,0.0013723432,0.0059641493],"category_scores_gemma":[0.020796623,0.0006729689,0.0013036248,0.00067316514,0.0033423274,0.004544433,0.0025493177,0.0030439964,0.0008005671],"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.0015224061,0.00035893358,0.006024475,0.0007706796,0.0002070562,0.00075412024,0.000508083,0.5934892,0.029856443,0.29805493,0.006391919,0.062061783],"study_design_scores_gemma":[0.00007074996,0.00014637031,0.00090822176,0.000045215933,0.000053978656,0.00020419202,0.000106701766,0.86959076,0.010160903,0.116426915,0.0022542872,0.000031675336],"about_ca_topic_score_codex":0.0024259295,"about_ca_topic_score_gemma":0.001689277,"teacher_disagreement_score":0.0059641493,"about_ca_system_score_codex":0.0015025323,"about_ca_system_score_gemma":0.0018240337,"threshold_uncertainty_score":0.02070719},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94404775,0.0006011795,0.04909302,0.00044123092,0.000028651471,0.000027226295,0.00008302922,0.00017813031,0.005499774],"genre_scores_gemma":[0.9978167,0.00010651443,0.0016723115,0.000024504556,0.000022659551,0.000014349912,0.000034621713,0.000018326657,0.00029009872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972695,0.00007705474,0.0000092908585,0.00006274114,0.00005340359,0.00007050061],"domain_scores_gemma":[0.9971993,0.0017206206,0.00045909648,0.00023251736,0.00011745955,0.00027105468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007883455,0.00024815506,0.0005256427,0.0007257803,0.0004661026,0.0009519155,0.0007266904,0.0006539137,0.0020600273],"category_scores_gemma":[0.005470914,0.00026093744,0.00051211606,0.00046448768,0.0012323557,0.0019603765,0.00058893935,0.0006955963,0.000096783144],"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.00037823722,0.00015686969,0.010246925,0.00019290003,0.00007740082,0.0010350291,0.0006182428,0.20302884,0.031061238,0.73941183,0.0022662287,0.0115263015],"study_design_scores_gemma":[0.00006289612,0.00012038666,0.0048651025,0.00003135942,0.000039471437,0.00035324838,0.00016690363,0.72077286,0.0048647407,0.2676578,0.0010298581,0.00003542123],"about_ca_topic_score_codex":0.0024665757,"about_ca_topic_score_gemma":0.001315017,"teacher_disagreement_score":0.0024665757,"about_ca_system_score_codex":0.0009878936,"about_ca_system_score_gemma":0.00028911483,"threshold_uncertainty_score":0.0071676373},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7490353,0.0010343731,0.2322907,0.0040893317,0.00009732676,0.00011328671,0.0008951177,0.00058497087,0.01185965],"genre_scores_gemma":[0.98303026,0.0003934018,0.014024814,0.00012894605,0.00006352781,0.00008868005,0.0004074797,0.000073755415,0.0017890319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981646,0.00048072403,0.000106920044,0.00030704547,0.0006419692,0.00029875492],"domain_scores_gemma":[0.979937,0.014181837,0.0025208828,0.0015587477,0.0011250187,0.00067640503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012636104,0.00040032496,0.0008770014,0.0013046906,0.0008429234,0.002613857,0.0012507685,0.001194767,0.0035093483],"category_scores_gemma":[0.01716221,0.0004655169,0.0005639876,0.0010088879,0.0015850344,0.0031463471,0.0014687497,0.001163593,0.00026624094],"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.0002882281,0.000042137166,0.004191459,0.00020071234,0.00006857289,0.00035326488,0.0002458586,0.828584,0.005608404,0.1411652,0.003155862,0.016096314],"study_design_scores_gemma":[0.00002495799,0.000027841,0.00091841456,0.000013077568,0.00001801901,0.00017277221,0.000062001556,0.800266,0.0014493762,0.19596423,0.0010682505,0.000014950714],"about_ca_topic_score_codex":0.0017303458,"about_ca_topic_score_gemma":0.0010085755,"teacher_disagreement_score":0.0035093483,"about_ca_system_score_codex":0.0022886023,"about_ca_system_score_gemma":0.0009505701,"threshold_uncertainty_score":0.01660502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6996864,0.0010704505,0.19769058,0.0052926424,0.00023741453,0.00015290163,0.0006043698,0.0005143374,0.094751015],"genre_scores_gemma":[0.981048,0.0002425108,0.0057456805,0.00028626717,0.000101584694,0.00007227869,0.00014747988,0.000038750804,0.012317425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.00018111861,0.00002319824,0.000119574936,0.00017522302,0.00013739555],"domain_scores_gemma":[0.9980585,0.00085760746,0.00024486348,0.00021452723,0.000175285,0.00044919198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076076883,0.00052120193,0.0012435025,0.0014560589,0.001370595,0.002330722,0.0016433548,0.0020345189,0.0052692834],"category_scores_gemma":[0.003486009,0.00041590925,0.0006744238,0.0007771808,0.0029803698,0.0023561409,0.0024908432,0.0015129282,0.0007126887],"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.000060919338,0.000054331333,0.00044633384,0.000046690217,0.000032446434,0.00030308962,0.00015852123,0.08164912,0.001096877,0.9127956,0.0018104885,0.0015456943],"study_design_scores_gemma":[0.00007395529,0.000024848725,0.00022648368,0.000013345849,0.000016041186,0.000086251835,0.00006548784,0.6024279,0.00027874342,0.39533532,0.0014298963,0.000021788546],"about_ca_topic_score_codex":0.005252325,"about_ca_topic_score_gemma":0.002494808,"teacher_disagreement_score":0.0052692834,"about_ca_system_score_codex":0.0012246595,"about_ca_system_score_gemma":0.0006752554,"threshold_uncertainty_score":0.017627537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11421289,0.0015240131,0.855591,0.0037396217,0.00035698403,0.0002737765,0.0005142429,0.0016651573,0.022122316],"genre_scores_gemma":[0.7804252,0.0005411851,0.2090883,0.0010758204,0.00042993765,0.0004880397,0.00062018924,0.0005211626,0.0068101636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98786527,0.0035062244,0.0005306982,0.0017921675,0.0045634164,0.0017421497],"domain_scores_gemma":[0.95843613,0.030934136,0.0014453434,0.005457627,0.0029042393,0.00082247704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006818144,0.0012576472,0.0018824438,0.0015708235,0.0014021811,0.0040262546,0.0040823235,0.0022538356,0.009384719],"category_scores_gemma":[0.03384617,0.0005932011,0.0020377988,0.0014615677,0.0035249088,0.008015186,0.0049835346,0.006049405,0.0014304072],"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.0013230097,0.00057038915,0.0029630975,0.0004560229,0.00018334229,0.00025691953,0.00040603383,0.21905951,0.016990298,0.6563666,0.010419784,0.091004945],"study_design_scores_gemma":[0.00012964717,0.000121048724,0.00056730234,0.00005408752,0.000074082236,0.00010018204,0.000040914438,0.69300175,0.008147062,0.2954097,0.0023063843,0.000047868143],"about_ca_topic_score_codex":0.0020496908,"about_ca_topic_score_gemma":0.002390715,"teacher_disagreement_score":0.009384719,"about_ca_system_score_codex":0.0045478037,"about_ca_system_score_gemma":0.0038370958,"threshold_uncertainty_score":0.036058247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029659506,0.0001661985,0.9687224,0.00028166958,0.000025881947,0.000021991169,0.0001887494,0.00026635427,0.00066736195],"genre_scores_gemma":[0.71413594,0.00033228885,0.28296703,0.00014488355,0.00013885918,0.000115582974,0.0008712024,0.00010551253,0.0011887143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714917,0.0011024172,0.0001647007,0.0006778153,0.00076204166,0.00014378334],"domain_scores_gemma":[0.9737464,0.019260475,0.002103901,0.0029637998,0.0015218928,0.00040349056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003992481,0.0007938131,0.0010445407,0.002953319,0.0006376329,0.0019007953,0.002037693,0.0009879373,0.0015602888],"category_scores_gemma":[0.042067375,0.0006415243,0.00072096277,0.0020537972,0.001738324,0.0045147385,0.0023067358,0.0020623852,0.00031131224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00026970237,0.00006401238,0.006172121,0.00012999095,0.000101091944,0.00010898981,0.00019203889,0.7357242,0.0029148487,0.16807936,0.0016955092,0.08454818],"study_design_scores_gemma":[0.00000984372,0.000019443078,0.000417451,0.000012299289,0.000009783009,0.000042243966,0.000019002464,0.87181234,0.0016840211,0.12522049,0.00074226037,0.00001081182],"about_ca_topic_score_codex":0.0018535535,"about_ca_topic_score_gemma":0.0013131609,"teacher_disagreement_score":0.003992481,"about_ca_system_score_codex":0.0018542734,"about_ca_system_score_gemma":0.0010548508,"threshold_uncertainty_score":0.021114528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7938812,0.00077198946,0.18978937,0.001079062,0.00007090872,0.00015521719,0.00039551803,0.00068964565,0.013167109],"genre_scores_gemma":[0.98066723,0.00028563122,0.014898257,0.00019477725,0.00004192915,0.00018363446,0.00020302014,0.00008202849,0.0034434092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862206,0.0005050141,0.000052424213,0.00030274835,0.0003167089,0.00020114047],"domain_scores_gemma":[0.98958963,0.0057945815,0.0015782249,0.0011535743,0.0008497961,0.0010341668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019619649,0.00041268044,0.0008074578,0.0024813474,0.001135498,0.0016375366,0.0012710661,0.0010245655,0.0025103504],"category_scores_gemma":[0.015704358,0.00078319805,0.00061685045,0.0010393759,0.0025674552,0.002628547,0.0017239387,0.00096081465,0.00030514286],"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.00017222969,0.000056850866,0.0027933065,0.000097837015,0.000054058044,0.0002986552,0.00042348966,0.04864218,0.0026687938,0.9318259,0.002846002,0.0101206135],"study_design_scores_gemma":[0.00007203909,0.000045573957,0.00092435424,0.00002421352,0.000020829013,0.00016764436,0.00008854657,0.19239007,0.0010829978,0.8032834,0.0018701401,0.00003015612],"about_ca_topic_score_codex":0.0024122498,"about_ca_topic_score_gemma":0.0023963673,"teacher_disagreement_score":0.0025103504,"about_ca_system_score_codex":0.0020394963,"about_ca_system_score_gemma":0.0008594372,"threshold_uncertainty_score":0.014797628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9009675,0.0008231664,0.08570839,0.001992042,0.00008421767,0.00006763351,0.00038322053,0.00038849862,0.009585426],"genre_scores_gemma":[0.99476814,0.00032351198,0.0034135657,0.0001524564,0.00006283983,0.00006517243,0.00018230223,0.000052889798,0.00097917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758434,0.0010391035,0.00008287436,0.00048852264,0.0005412646,0.00026391045],"domain_scores_gemma":[0.95691735,0.03198124,0.0033114136,0.004426909,0.0016178583,0.0017451937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038109242,0.00050382974,0.0012159055,0.0024092223,0.001122399,0.0023760328,0.0019046075,0.0015100389,0.0036107479],"category_scores_gemma":[0.040587846,0.0006928371,0.0006012892,0.0013092334,0.0041897753,0.0038155015,0.0026293083,0.0016798155,0.00044368344],"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.0007464923,0.00012879945,0.022520602,0.00030603408,0.00021466523,0.0005815027,0.0010035902,0.13174085,0.009457858,0.8006911,0.0059670904,0.026641442],"study_design_scores_gemma":[0.00010877131,0.00015345785,0.00424952,0.00007775478,0.0000571025,0.0006748083,0.00021008671,0.3381323,0.005177874,0.6483547,0.002728432,0.000075293625],"about_ca_topic_score_codex":0.0006994742,"about_ca_topic_score_gemma":0.000612714,"teacher_disagreement_score":0.0038109242,"about_ca_system_score_codex":0.0017109589,"about_ca_system_score_gemma":0.0006119232,"threshold_uncertainty_score":0.020154357},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5555959,0.0014879366,0.41404918,0.0024908853,0.00010827251,0.00009237152,0.00021551232,0.00038344515,0.025576528],"genre_scores_gemma":[0.9761662,0.00035849222,0.0176468,0.00021003802,0.00008739387,0.00008352346,0.00015050145,0.0001036547,0.0051933527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995839,0.00015695064,0.000012096895,0.00008034906,0.00008695996,0.00007963329],"domain_scores_gemma":[0.9969131,0.0021032684,0.0004538203,0.00019288264,0.00014273079,0.00019418754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010337116,0.00038592872,0.0006489494,0.00069618225,0.0007450819,0.0009601374,0.00096979627,0.0008895327,0.0036597385],"category_scores_gemma":[0.006727589,0.00040255106,0.00058968633,0.0004992256,0.0018637575,0.0022339073,0.0012936674,0.0015022233,0.00024373127],"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.00011874387,0.000037396785,0.0011522723,0.00009451931,0.000037110465,0.00020136235,0.00030078535,0.2051687,0.003419548,0.7813362,0.0023804295,0.005752885],"study_design_scores_gemma":[0.000024859719,0.00002625419,0.0005545147,0.000016250344,0.000008724186,0.00006257252,0.000047240286,0.8164961,0.00075981923,0.18107975,0.0009061252,0.000017787463],"about_ca_topic_score_codex":0.0023386343,"about_ca_topic_score_gemma":0.0014135056,"teacher_disagreement_score":0.0036597385,"about_ca_system_score_codex":0.0009863498,"about_ca_system_score_gemma":0.0004984249,"threshold_uncertainty_score":0.012242973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.649437,0.0015551682,0.31482312,0.0022855862,0.00025167273,0.00010815677,0.00046755152,0.00078569993,0.030285949],"genre_scores_gemma":[0.9764415,0.0005748541,0.017942565,0.00026793443,0.00017042826,0.0001408287,0.0002907272,0.0001454688,0.0040257243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.00033970474,0.000013758035,0.00015586529,0.00015421139,0.00017786935],"domain_scores_gemma":[0.989219,0.007839326,0.0008065877,0.0007056719,0.00075219094,0.0006770949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024434053,0.00038565142,0.00064037065,0.0018018829,0.0012230474,0.0015474218,0.0012064208,0.00079419103,0.0034792293],"category_scores_gemma":[0.016166601,0.0005678312,0.00046430266,0.0008001095,0.0029059474,0.002410418,0.0009706185,0.0011991211,0.00036182144],"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.00012924788,0.0000434092,0.002776025,0.000084538726,0.000029850386,0.00016564068,0.00020715239,0.058187056,0.0029340922,0.9250754,0.0042739552,0.0060936157],"study_design_scores_gemma":[0.00004701945,0.000026953197,0.0019131436,0.000039539253,0.000013922193,0.00016724413,0.00007069356,0.4512822,0.0008181844,0.54372144,0.0018685753,0.000031120402],"about_ca_topic_score_codex":0.004216637,"about_ca_topic_score_gemma":0.0038310054,"teacher_disagreement_score":0.004216637,"about_ca_system_score_codex":0.002240833,"about_ca_system_score_gemma":0.00089333416,"threshold_uncertainty_score":0.016258478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6394386,0.000984568,0.3072208,0.011090883,0.00016642002,0.00014919716,0.00067728444,0.0009759427,0.039296325],"genre_scores_gemma":[0.9776363,0.00044298917,0.015876481,0.0011108574,0.00012325238,0.00030173163,0.0003012489,0.00015017728,0.0040569664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997267,0.00063608354,0.0001314083,0.0009802249,0.00043812333,0.0005472574],"domain_scores_gemma":[0.97217464,0.018346084,0.0025108783,0.004005714,0.0015296508,0.001432945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004672244,0.00055693544,0.0018856226,0.0020542694,0.0028209197,0.0027603868,0.0023980709,0.0028054363,0.0042108507],"category_scores_gemma":[0.037615485,0.00079324556,0.0012631778,0.0012747166,0.0058143535,0.008173919,0.0028952719,0.003468348,0.0007314905],"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.00037536418,0.00009864036,0.004995557,0.00013453049,0.00004906284,0.0002213386,0.00066913344,0.021788787,0.0030251944,0.9495022,0.0054398016,0.013700508],"study_design_scores_gemma":[0.00009751324,0.00007910574,0.0017917659,0.000039637547,0.000018497802,0.00030527386,0.00018394792,0.097255416,0.002374662,0.89478934,0.0030172379,0.0000475393],"about_ca_topic_score_codex":0.0024108777,"about_ca_topic_score_gemma":0.0023492933,"teacher_disagreement_score":0.004672244,"about_ca_system_score_codex":0.00292821,"about_ca_system_score_gemma":0.0012868334,"threshold_uncertainty_score":0.024709463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30486834,0.011080053,0.5806233,0.01673322,0.0028140773,0.00012647458,0.00093536946,0.00096288155,0.081856236],"genre_scores_gemma":[0.8785615,0.0056439787,0.08298689,0.0029287096,0.0034431035,0.00021527967,0.0006923455,0.00059277646,0.02493548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895334,0.00033360516,0.0000557625,0.00022171368,0.00031174105,0.00012380315],"domain_scores_gemma":[0.99035,0.007673652,0.00049951265,0.00044348394,0.000486569,0.00054680085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002251829,0.0007283138,0.00096604857,0.0018837729,0.0015790684,0.0016585522,0.0016910052,0.0022014473,0.005619067],"category_scores_gemma":[0.01655674,0.00039470033,0.00093798415,0.00240745,0.004132074,0.0042127883,0.0020457073,0.0027218317,0.0007168483],"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.00013552724,0.000037718168,0.0011108607,0.0002404578,0.000031812782,0.0004174899,0.0005834235,0.05411924,0.003626954,0.91045994,0.010443984,0.018792575],"study_design_scores_gemma":[0.00004246729,0.000091959795,0.00077383505,0.000053047122,0.000026543083,0.00018501816,0.00015230037,0.09451543,0.00086639554,0.8975764,0.005685392,0.000031383013],"about_ca_topic_score_codex":0.0024990018,"about_ca_topic_score_gemma":0.0015287517,"teacher_disagreement_score":0.005619067,"about_ca_system_score_codex":0.0011740777,"about_ca_system_score_gemma":0.0005856206,"threshold_uncertainty_score":0.018797696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7011578,0.0027672146,0.23660742,0.01157152,0.0002139427,0.00009531261,0.00080571295,0.0006339535,0.046147015],"genre_scores_gemma":[0.9829973,0.00048375674,0.011633594,0.0005182405,0.00014229368,0.00007422451,0.00024547134,0.00012652291,0.0037786653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863917,0.00057012273,0.00003953562,0.00018032541,0.00023806153,0.00033272634],"domain_scores_gemma":[0.9885147,0.00872549,0.0012039138,0.00053495186,0.00039369377,0.0006272164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003310572,0.0010759624,0.0021183374,0.0012764911,0.0018060094,0.0036490543,0.0029492793,0.0025655937,0.0051275613],"category_scores_gemma":[0.013141181,0.00094679557,0.0014263904,0.0012942503,0.003951119,0.0057616476,0.0017928478,0.0033469384,0.00045377036],"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.00027932506,0.000104344406,0.0015096716,0.00021141121,0.00006381177,0.00031427652,0.00014705703,0.17138681,0.002453745,0.8158197,0.004636304,0.003073593],"study_design_scores_gemma":[0.000072861214,0.000034549103,0.0005156422,0.000029970271,0.000026864564,0.00011401156,0.000052918407,0.67196244,0.0005991677,0.32609272,0.00046703473,0.00003177381],"about_ca_topic_score_codex":0.0076355375,"about_ca_topic_score_gemma":0.005744824,"teacher_disagreement_score":0.0076355375,"about_ca_system_score_codex":0.0033369386,"about_ca_system_score_gemma":0.0017579442,"threshold_uncertainty_score":0.024211287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25099435,0.00036138602,0.7203228,0.001324381,0.00015598176,0.00007805275,0.00045029615,0.00063175027,0.025681026],"genre_scores_gemma":[0.937095,0.00019308366,0.054806005,0.00022910936,0.00008809171,0.00007951594,0.0002228547,0.00013379195,0.0071524545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942183,0.00020571459,0.00003274664,0.00008175031,0.00016161852,0.00009624946],"domain_scores_gemma":[0.99826294,0.0007804322,0.00023945753,0.0002848813,0.00023253463,0.00019978672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084388664,0.0003895942,0.00043181735,0.0012632699,0.0004639903,0.0015660728,0.0010929175,0.0010015601,0.0056152577],"category_scores_gemma":[0.003674605,0.00022462936,0.00059214246,0.00076524453,0.0016657789,0.0021175144,0.0009317279,0.001255084,0.000521741],"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.000016429974,0.000010423041,0.00010498545,0.000012856911,0.0000019280374,0.000040356783,0.00008029128,0.008307603,0.00074637413,0.98742837,0.00033704453,0.0029132038],"study_design_scores_gemma":[0.000010372271,0.000016793396,0.00010886381,0.000014576919,0.0000033885938,0.00005457305,0.000032728647,0.13953711,0.00052763935,0.8581668,0.0015110361,0.000016157215],"about_ca_topic_score_codex":0.0016441997,"about_ca_topic_score_gemma":0.0014266478,"teacher_disagreement_score":0.0056152577,"about_ca_system_score_codex":0.0009425912,"about_ca_system_score_gemma":0.00047102754,"threshold_uncertainty_score":0.01878494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55422455,0.00096474827,0.41891605,0.0017724445,0.00017418378,0.00006579683,0.0005326558,0.00068828376,0.0226613],"genre_scores_gemma":[0.983949,0.00034297007,0.01224859,0.00014518859,0.00018324945,0.000059109854,0.00020613214,0.000094022194,0.0027717936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982589,0.00082052563,0.000050553936,0.00022943872,0.0004270776,0.00021348179],"domain_scores_gemma":[0.98005646,0.012450355,0.0021631573,0.0023243728,0.0021320188,0.00087364455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025749712,0.0005355066,0.0006103098,0.0015899205,0.00049388735,0.0013550112,0.0010299565,0.000788225,0.003138932],"category_scores_gemma":[0.030559452,0.0004513283,0.0002936899,0.0006312143,0.0029484567,0.0032552273,0.0012717993,0.0012356408,0.0005425748],"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.00028394622,0.00007127322,0.0029244535,0.00016386347,0.00003763472,0.00022061683,0.00021655718,0.13373365,0.013823266,0.8309419,0.0034637917,0.014119047],"study_design_scores_gemma":[0.000031153068,0.000094973126,0.0014451107,0.000057216806,0.000011984548,0.00024759996,0.000075870325,0.6095103,0.0060247676,0.381074,0.0013651702,0.0000618932],"about_ca_topic_score_codex":0.00086174556,"about_ca_topic_score_gemma":0.0006033053,"teacher_disagreement_score":0.003138932,"about_ca_system_score_codex":0.0011463412,"about_ca_system_score_gemma":0.000894579,"threshold_uncertainty_score":0.013617873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06729097,0.0003954983,0.9299612,0.00027497002,0.000037731817,0.000024518376,0.00005871078,0.00026372084,0.0016926306],"genre_scores_gemma":[0.81667286,0.00036598303,0.17913711,0.0001622123,0.00011871169,0.00009307848,0.0002972175,0.00030271593,0.002850177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675214,0.0017605845,0.00010678729,0.0006351158,0.00053742615,0.00020797644],"domain_scores_gemma":[0.96599615,0.029073091,0.0013778326,0.0014239734,0.0015742255,0.00055482186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070992215,0.0008667619,0.0014229924,0.002149346,0.00067765353,0.0018190199,0.0021220047,0.0019819885,0.0027447152],"category_scores_gemma":[0.04428517,0.00089190825,0.00077605963,0.0013486878,0.0033966107,0.004271409,0.0026316766,0.002490585,0.0005757904],"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.0002534437,0.00005043364,0.0047679464,0.00017760294,0.0001100291,0.00022471519,0.00036413412,0.3478614,0.002382548,0.60681736,0.0017472403,0.03524321],"study_design_scores_gemma":[0.000012878375,0.000010843583,0.00024672845,0.000019231593,0.00000671496,0.000029850346,0.000023480043,0.57782096,0.000896705,0.4205092,0.0004088735,0.0000145401],"about_ca_topic_score_codex":0.0014268075,"about_ca_topic_score_gemma":0.00083049404,"teacher_disagreement_score":0.0070992215,"about_ca_system_score_codex":0.001028297,"about_ca_system_score_gemma":0.0006179906,"threshold_uncertainty_score":0.037544727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8157262,0.00094774587,0.17346357,0.0004363728,0.00002466962,0.000087327215,0.0003953932,0.000304433,0.008614294],"genre_scores_gemma":[0.9799867,0.00027470198,0.016783133,0.00011075607,0.000034856228,0.00006679474,0.0002269511,0.000074738244,0.002441387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992908,0.00016477639,0.00003130097,0.00016264636,0.00018339987,0.00016695149],"domain_scores_gemma":[0.9915065,0.0051062377,0.0011724303,0.0006710157,0.0006679886,0.00087589043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017038089,0.00038622573,0.00075105147,0.0013654721,0.0010007084,0.0016705737,0.0013778284,0.0009909293,0.0035387217],"category_scores_gemma":[0.01363343,0.00065871695,0.000606011,0.0006925017,0.0016934557,0.0027288406,0.0014520495,0.0012870842,0.00033002434],"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.0002723638,0.00008670207,0.01357133,0.00020120479,0.00007057223,0.0005600857,0.001000116,0.11495128,0.017981006,0.82536745,0.0033357253,0.022602268],"study_design_scores_gemma":[0.000074790354,0.0001313943,0.0067616673,0.000051653027,0.000051846786,0.0008235021,0.00027410028,0.556806,0.003485167,0.42746013,0.0040215896,0.000058042944],"about_ca_topic_score_codex":0.0022926976,"about_ca_topic_score_gemma":0.0026370161,"teacher_disagreement_score":0.0035387217,"about_ca_system_score_codex":0.0019671689,"about_ca_system_score_gemma":0.0005769567,"threshold_uncertainty_score":0.014272809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83535296,0.00056440843,0.15627576,0.00088501145,0.00004481046,0.000083188024,0.0006320917,0.00074044615,0.0054212674],"genre_scores_gemma":[0.9901612,0.0002197709,0.0076233954,0.00008439841,0.00005767725,0.0000868893,0.00040183731,0.0000956738,0.0012690921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985298,0.0005891592,0.00005120776,0.00036651146,0.00029293302,0.00017035981],"domain_scores_gemma":[0.9819834,0.010861135,0.0021507938,0.0024167304,0.0016411762,0.0009467112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032812546,0.00042881237,0.0009165538,0.0025750103,0.0005556354,0.0015489771,0.001551471,0.0009880988,0.0026169466],"category_scores_gemma":[0.024230687,0.00056427176,0.0006005212,0.00090006844,0.0027339673,0.0028665317,0.0013526265,0.0010328818,0.0003650885],"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.0008729458,0.00015945963,0.031898133,0.0003355133,0.00016384874,0.0009623756,0.0008246501,0.17469558,0.031208415,0.7245827,0.0051165815,0.029179847],"study_design_scores_gemma":[0.00007485973,0.00013123477,0.01059709,0.000060057133,0.000056920577,0.00078713545,0.00015925999,0.6612735,0.008143295,0.31636477,0.0022823443,0.00006952473],"about_ca_topic_score_codex":0.0012308077,"about_ca_topic_score_gemma":0.00082943315,"teacher_disagreement_score":0.0032812546,"about_ca_system_score_codex":0.0019086564,"about_ca_system_score_gemma":0.0003969048,"threshold_uncertainty_score":0.017353117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47517917,0.00009912909,0.52040267,0.0002172687,0.000026687536,0.00009621702,0.000072345,0.00041660047,0.0034899896],"genre_scores_gemma":[0.953571,0.00008615024,0.04325697,0.00004891454,0.00001283731,0.00013929594,0.000099103774,0.000097158394,0.0026886573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.00020010454,0.00001978437,0.00010149134,0.00013566336,0.00005710342],"domain_scores_gemma":[0.9957917,0.002290755,0.0005768524,0.00056338543,0.0004105175,0.00036686106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014000722,0.00030223685,0.00042151683,0.0013821714,0.0004580078,0.00068861956,0.0010577757,0.00060558633,0.0019585488],"category_scores_gemma":[0.008563268,0.0003487495,0.0004928861,0.0005401897,0.0014564631,0.001296731,0.0010496541,0.0007250579,0.00027007228],"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.000190722,0.00008801961,0.0034867404,0.000061543826,0.00003684734,0.00046011852,0.00052080187,0.26432088,0.0151142,0.69349265,0.0012953546,0.020932108],"study_design_scores_gemma":[0.000024133647,0.000036581914,0.0005364324,0.00001032557,0.000009059868,0.00010525644,0.000050368442,0.86910444,0.0042579533,0.12487182,0.00097303966,0.000020537744],"about_ca_topic_score_codex":0.0013640787,"about_ca_topic_score_gemma":0.0011877329,"teacher_disagreement_score":0.0019585488,"about_ca_system_score_codex":0.0010261432,"about_ca_system_score_gemma":0.00037569512,"threshold_uncertainty_score":0.007445216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.662114,0.00049277314,0.30207902,0.0010566842,0.0004827386,0.0004069077,0.00038906836,0.0010967279,0.031882018],"genre_scores_gemma":[0.916739,0.00023603477,0.06874467,0.00054682564,0.00020644453,0.00024499814,0.0005938618,0.00040175495,0.0122864405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974795,0.00083215325,0.00012262525,0.000647984,0.00065676804,0.0002609965],"domain_scores_gemma":[0.994852,0.0014819199,0.00061681715,0.0017855398,0.00058855314,0.0006751653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018551657,0.0008433882,0.0010292071,0.0011149378,0.0017781816,0.0017441198,0.0009439537,0.0011649749,0.010474531],"category_scores_gemma":[0.009237908,0.00061597157,0.0013063262,0.0009733063,0.001671471,0.0035280606,0.0024377538,0.0016882054,0.0027631524],"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.0040939664,0.0010205369,0.025126725,0.0005781153,0.0010023993,0.002894727,0.0015436659,0.1209837,0.14771558,0.50711834,0.012660555,0.1752618],"study_design_scores_gemma":[0.00038996848,0.0015945529,0.0096843,0.00012595716,0.0003731603,0.00335424,0.0007464046,0.31428775,0.06618102,0.5487475,0.054311387,0.00020373208],"about_ca_topic_score_codex":0.00031359761,"about_ca_topic_score_gemma":0.0004768901,"teacher_disagreement_score":0.010474531,"about_ca_system_score_codex":0.0006326649,"about_ca_system_score_gemma":0.0005363653,"threshold_uncertainty_score":0.035040796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86319095,0.0011258179,0.12687068,0.0010657585,0.00004532198,0.00003469698,0.00012112539,0.00016100817,0.007384629],"genre_scores_gemma":[0.99215204,0.00019210743,0.0069486164,0.000073571995,0.000040049494,0.0000248797,0.000056606143,0.000021034111,0.0004909895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959797,0.00016068087,0.000013773422,0.000081976155,0.00008526302,0.00006019921],"domain_scores_gemma":[0.99368906,0.0036142892,0.0011162126,0.00036485764,0.0005370929,0.0006784404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519446,0.0002465427,0.0005810271,0.0018586853,0.0008294983,0.0012647477,0.00076297845,0.0008662484,0.0014817506],"category_scores_gemma":[0.0099402005,0.0004397815,0.00025353368,0.00061652187,0.0021090826,0.0019587816,0.0011258749,0.00072432373,0.00017605284],"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.000110405344,0.000039539053,0.0028368165,0.000077977646,0.000031054984,0.00026450667,0.00025941138,0.041867267,0.004139816,0.94344074,0.0018010713,0.005131323],"study_design_scores_gemma":[0.00004210197,0.000042975284,0.0014670547,0.000033065502,0.00001605327,0.00028163556,0.00011143784,0.17985608,0.0014174813,0.81516075,0.0015498511,0.000021594476],"about_ca_topic_score_codex":0.0005303528,"about_ca_topic_score_gemma":0.0004925209,"teacher_disagreement_score":0.0018586853,"about_ca_system_score_codex":0.0009419314,"about_ca_system_score_gemma":0.00032894503,"threshold_uncertainty_score":0.0071498156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6584562,0.0005965434,0.33259776,0.0015833955,0.000048019006,0.00008267321,0.00087090075,0.00021156532,0.0055528893],"genre_scores_gemma":[0.9691786,0.00057095184,0.02474032,0.0001654391,0.000069545094,0.00018163917,0.0005118883,0.000045842873,0.0045357384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994979,0.0002274383,0.000015223312,0.00009254171,0.00010049131,0.00006641684],"domain_scores_gemma":[0.9961487,0.0024377648,0.0006005969,0.00022302807,0.00033485398,0.00025496268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018662197,0.0003823329,0.0005887067,0.0017577307,0.0005178946,0.0010158268,0.0010399385,0.0010015363,0.0018509526],"category_scores_gemma":[0.009543287,0.0004800837,0.00030279552,0.0008220694,0.0012043902,0.0028618034,0.000919827,0.0006137602,0.0002278123],"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.00016454734,0.000038711212,0.0026388534,0.00007082576,0.00003492147,0.00014624988,0.0001543162,0.5531942,0.0014092816,0.42883855,0.0020127136,0.01129687],"study_design_scores_gemma":[0.000024856605,0.000013132907,0.0009165034,0.000012322948,0.00000893216,0.00004793141,0.000025451081,0.80107903,0.00031768426,0.1966881,0.00084989064,0.000016155862],"about_ca_topic_score_codex":0.0021748347,"about_ca_topic_score_gemma":0.0019613628,"teacher_disagreement_score":0.0021748347,"about_ca_system_score_codex":0.001272701,"about_ca_system_score_gemma":0.00047994373,"threshold_uncertainty_score":0.009869635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19153023,0.00068423705,0.782738,0.0014640227,0.00008969094,0.0001404722,0.00024784898,0.000419911,0.022685701],"genre_scores_gemma":[0.8390785,0.00079043885,0.14122397,0.00060157507,0.00011524627,0.0005193944,0.0003388549,0.00034028172,0.01699179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924797,0.00027393323,0.0000185976,0.00015491861,0.00013395905,0.00017056087],"domain_scores_gemma":[0.9952513,0.0032551342,0.0003984708,0.0003746333,0.00020083219,0.0005195185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014117924,0.00058713934,0.00066207844,0.0008380884,0.0014565615,0.0018147875,0.0011971268,0.0010176905,0.007206703],"category_scores_gemma":[0.009994968,0.0006612625,0.00074402645,0.0006585697,0.0024735983,0.003619105,0.0017534515,0.0030089112,0.0007544696],"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.00008445018,0.00004055915,0.00047005733,0.000055276767,0.000013890237,0.000047945614,0.00025819903,0.06977507,0.0041488744,0.91644645,0.0018556276,0.0068036118],"study_design_scores_gemma":[0.000029550116,0.000023594572,0.00029223584,0.00002119474,0.000006882645,0.0000307452,0.00004707733,0.44202211,0.0009809972,0.55444115,0.0020872995,0.000017180253],"about_ca_topic_score_codex":0.0051997,"about_ca_topic_score_gemma":0.0060211984,"teacher_disagreement_score":0.007206703,"about_ca_system_score_codex":0.0034256396,"about_ca_system_score_gemma":0.0014119416,"threshold_uncertainty_score":0.024854898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064562514,0.0008256988,0.92615855,0.0018968158,0.00010083657,0.000052789535,0.00008572069,0.00016459072,0.0061524827],"genre_scores_gemma":[0.86612225,0.0016743803,0.118530005,0.00058552716,0.00068915676,0.00027519267,0.00016717786,0.00022664832,0.011729633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858737,0.00059935177,0.000039163864,0.0002873109,0.00029915632,0.00018764641],"domain_scores_gemma":[0.986041,0.011268745,0.0011267735,0.0005189709,0.00046942246,0.00057495537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037080932,0.0009412258,0.0011512082,0.0022112706,0.0011977175,0.0018272905,0.0035547803,0.0021862795,0.0030521513],"category_scores_gemma":[0.017445074,0.00071398856,0.0011769964,0.0012814038,0.003930427,0.0044447174,0.0031379752,0.002729357,0.00042662857],"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.000047955375,0.00003675625,0.00062428595,0.00008742068,0.000040527,0.00013893138,0.0002593227,0.13588916,0.001379655,0.85485804,0.0012489798,0.0053890487],"study_design_scores_gemma":[0.000021223033,0.000038694325,0.0002284687,0.000015451087,0.000014535274,0.000057707075,0.00005363345,0.5010204,0.00042217286,0.49679577,0.001310913,0.000021090309],"about_ca_topic_score_codex":0.0015412156,"about_ca_topic_score_gemma":0.0013901673,"teacher_disagreement_score":0.0037080932,"about_ca_system_score_codex":0.0020227386,"about_ca_system_score_gemma":0.0010445656,"threshold_uncertainty_score":0.019610524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41462815,0.001377517,0.5547047,0.0020921172,0.00010014197,0.0000463052,0.0001403129,0.00018513796,0.026725603],"genre_scores_gemma":[0.97991806,0.00043516303,0.016519131,0.00014042326,0.00014897883,0.00003220965,0.00004511404,0.00003400191,0.0027269647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991985,0.0003450956,0.000029717694,0.00010697141,0.00021180157,0.00010796772],"domain_scores_gemma":[0.9952207,0.003103164,0.00054349814,0.00040773072,0.0003576248,0.000367257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635518,0.00027609,0.00066346745,0.0020765185,0.0007636422,0.0019419842,0.0010418141,0.00081178354,0.0022991782],"category_scores_gemma":[0.0072754547,0.0003139069,0.00047668582,0.0009975809,0.0027775853,0.003167626,0.001407713,0.0010467062,0.0002496054],"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.00001259349,0.00001632285,0.0003512317,0.00001795077,0.000008085909,0.00005011153,0.00008806589,0.02020712,0.0007196738,0.9755215,0.0003574381,0.0026498495],"study_design_scores_gemma":[0.0000064711367,0.000016298422,0.00038564534,0.0000099922,0.000005699294,0.000060864117,0.000050445084,0.27412453,0.0002943167,0.72421044,0.0008233144,0.000011963912],"about_ca_topic_score_codex":0.0011755369,"about_ca_topic_score_gemma":0.0012151941,"teacher_disagreement_score":0.0022991782,"about_ca_system_score_codex":0.0014320081,"about_ca_system_score_gemma":0.00049672625,"threshold_uncertainty_score":0.010389924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048052415,0.00018695422,0.94918084,0.00052164384,0.000033233562,0.00007489349,0.00009383335,0.00033528943,0.0015209253],"genre_scores_gemma":[0.64489543,0.00032304754,0.35003766,0.00039196492,0.000110469824,0.00029335963,0.00037346836,0.00017877169,0.00339581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730253,0.0013473203,0.000093337934,0.00039928156,0.00066169887,0.00019579861],"domain_scores_gemma":[0.9865392,0.009967193,0.0007888891,0.0015192452,0.00075680466,0.0004287259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037381148,0.00085564016,0.0011039369,0.0012561897,0.0009574673,0.0015610995,0.0018617937,0.0010839392,0.0023857858],"category_scores_gemma":[0.02566614,0.0006068462,0.0007547131,0.0014163711,0.0030100541,0.003800629,0.0032007545,0.002675626,0.00043308598],"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.00051680213,0.00015904228,0.0019481583,0.00012897396,0.00007343509,0.0001522419,0.00034338897,0.34205532,0.0052830577,0.5944212,0.0020157709,0.05290269],"study_design_scores_gemma":[0.00003697777,0.000039827537,0.0002377516,0.000014354741,0.000006700501,0.00004784736,0.00002550005,0.8202463,0.0030136532,0.17576155,0.00054989866,0.000019709838],"about_ca_topic_score_codex":0.0016957831,"about_ca_topic_score_gemma":0.001753035,"teacher_disagreement_score":0.0037381148,"about_ca_system_score_codex":0.0018765205,"about_ca_system_score_gemma":0.0013943565,"threshold_uncertainty_score":0.019769311},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68451977,0.0007316369,0.30160838,0.0011076973,0.000097777716,0.000059763424,0.00021698211,0.000392881,0.011265083],"genre_scores_gemma":[0.98645115,0.00025603286,0.010403231,0.00012227808,0.00007022898,0.000068250716,0.00012989811,0.00006610931,0.0024327934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993567,0.00022310644,0.000022225919,0.00016511319,0.00012509541,0.00010777595],"domain_scores_gemma":[0.99440706,0.0030453526,0.00079666695,0.000569903,0.0005110159,0.00066993764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018605829,0.00045067503,0.00074295624,0.0021731341,0.00097335636,0.0015402965,0.0015604582,0.0011362496,0.0028285137],"category_scores_gemma":[0.012351226,0.0003547203,0.00067775947,0.0006933179,0.0035353,0.0030394706,0.0014829781,0.0009942614,0.00022737656],"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.000042840777,0.000031563995,0.0014205837,0.00004894708,0.000017361283,0.00019105655,0.0001417359,0.026297707,0.0022049136,0.96630526,0.0007336746,0.0025642707],"study_design_scores_gemma":[0.000027597067,0.000055747187,0.0020137583,0.000038907343,0.00001576495,0.0002205359,0.00012503442,0.38299412,0.0015184144,0.6117857,0.0011622452,0.000042199375],"about_ca_topic_score_codex":0.0025644214,"about_ca_topic_score_gemma":0.0019446423,"teacher_disagreement_score":0.0028285137,"about_ca_system_score_codex":0.0017906366,"about_ca_system_score_gemma":0.00052152836,"threshold_uncertainty_score":0.012992084},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9472669,0.00036865345,0.03907185,0.0003818047,0.000056673274,0.000037004407,0.00010700352,0.00007250613,0.012637525],"genre_scores_gemma":[0.9856286,0.00024540818,0.009227353,0.000053899104,0.000045296485,0.000061216575,0.00012508956,0.000023717379,0.0045894133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998087,0.00007802982,0.000009331437,0.00002578995,0.000043876335,0.000034278073],"domain_scores_gemma":[0.9985765,0.00079445034,0.00020675418,0.0000663365,0.00012719826,0.00022871158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575393,0.00029622047,0.0004734674,0.0010750655,0.0006402691,0.0011943675,0.00061959174,0.0005970536,0.0036370978],"category_scores_gemma":[0.002465771,0.00019539689,0.00023498968,0.0006383108,0.00088520494,0.0013324027,0.0006113703,0.00042419398,0.00028903436],"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.00035595873,0.00016436502,0.0037358752,0.00017859785,0.00007466482,0.0006400005,0.0002145399,0.26652297,0.010718784,0.70432574,0.0023235818,0.010744969],"study_design_scores_gemma":[0.000045104596,0.00008433634,0.0014799216,0.000040528357,0.000010330754,0.00023508766,0.00014880068,0.7990961,0.0028393718,0.19442657,0.0015662252,0.00002757391],"about_ca_topic_score_codex":0.00062649354,"about_ca_topic_score_gemma":0.0005549005,"teacher_disagreement_score":0.0036370978,"about_ca_system_score_codex":0.0005798825,"about_ca_system_score_gemma":0.00028451823,"threshold_uncertainty_score":0.012167335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6332224,0.0009440227,0.3558675,0.0009710126,0.000052448228,0.00004507956,0.0005527824,0.00048437645,0.007860433],"genre_scores_gemma":[0.95018095,0.00032943595,0.046018146,0.00016531574,0.0000636092,0.000056668665,0.0004469141,0.00019416433,0.002544697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985084,0.0005170654,0.000059373866,0.00023244966,0.000447492,0.00023523637],"domain_scores_gemma":[0.9765761,0.017451271,0.0019098204,0.0017350053,0.0014055808,0.00092215627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030487478,0.0002359155,0.0008631171,0.0016830284,0.0009912353,0.0024104845,0.0014348904,0.0016448817,0.0037315837],"category_scores_gemma":[0.026061716,0.0006858017,0.0004889754,0.0014145816,0.001968569,0.0037001623,0.0015239032,0.001769497,0.00048753704],"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.00036961216,0.000088003,0.010187267,0.00022519853,0.00008316929,0.0002508565,0.0007808782,0.17593801,0.013316666,0.7522195,0.0035248366,0.043016013],"study_design_scores_gemma":[0.000036283425,0.000076750795,0.0035404665,0.00004715762,0.000027284095,0.00022792444,0.00014050443,0.52589977,0.0033599224,0.46434993,0.002253352,0.00004067994],"about_ca_topic_score_codex":0.00170132,"about_ca_topic_score_gemma":0.00178692,"teacher_disagreement_score":0.0037315837,"about_ca_system_score_codex":0.0017943137,"about_ca_system_score_gemma":0.0009297671,"threshold_uncertainty_score":0.016123533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22732528,0.001245172,0.76293284,0.0008890335,0.0001653118,0.00019074799,0.00039986803,0.0011663778,0.005685331],"genre_scores_gemma":[0.89403546,0.00025853343,0.100505434,0.00014008363,0.00009187478,0.00023783621,0.0002713723,0.00012725407,0.0043320013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996384,0.0016401387,0.00016196707,0.0005134531,0.0008172276,0.00048315068],"domain_scores_gemma":[0.98459506,0.010844151,0.0010283283,0.0021417204,0.0008502341,0.000540484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003921335,0.0005693014,0.0011825558,0.0010812408,0.0010944918,0.0021641902,0.0024431124,0.0016219444,0.0041596084],"category_scores_gemma":[0.012728982,0.0007449247,0.0008590651,0.0021689858,0.0027746733,0.0055752704,0.0029911902,0.0014810172,0.0008817465],"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.0011850026,0.00015673654,0.0047569512,0.00024839715,0.00014169382,0.00059173815,0.0003956384,0.54150337,0.0062637096,0.39187613,0.0035695226,0.04931104],"study_design_scores_gemma":[0.00016493404,0.0001791575,0.00037360864,0.000027652288,0.000033577413,0.0002552948,0.00009204279,0.8039824,0.0036962905,0.18828511,0.0028724847,0.000037563805],"about_ca_topic_score_codex":0.00057726586,"about_ca_topic_score_gemma":0.00057827996,"teacher_disagreement_score":0.0041596084,"about_ca_system_score_codex":0.0014077346,"about_ca_system_score_gemma":0.00092496484,"threshold_uncertainty_score":0.020738244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9203019,0.00044937362,0.07550489,0.0007374803,0.000029928584,0.000048765392,0.00026410914,0.000193907,0.002469657],"genre_scores_gemma":[0.99538606,0.00023599292,0.0031974711,0.000037905567,0.000057153167,0.00004546044,0.00018602109,0.00004006555,0.00081391324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982905,0.0005695898,0.000068024725,0.00042918796,0.00036162767,0.0002809703],"domain_scores_gemma":[0.96584857,0.021858057,0.0049879085,0.0032105187,0.0018604232,0.0022345504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006644539,0.00057357043,0.0010839888,0.0031123043,0.00088711496,0.0028701157,0.0016334902,0.00090468937,0.002576967],"category_scores_gemma":[0.032614376,0.00062130723,0.0005948336,0.0014330326,0.004984968,0.004191003,0.0017843362,0.0013221155,0.00044907225],"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.0011229243,0.00015906355,0.07964232,0.00025301627,0.00016040869,0.0012078095,0.0015410243,0.15069358,0.02321125,0.71151346,0.0032954353,0.027199732],"study_design_scores_gemma":[0.00015166977,0.0003658535,0.03202464,0.00011120838,0.00011051661,0.0021964342,0.0007528364,0.67991936,0.015916107,0.26431903,0.0039135064,0.0002187678],"about_ca_topic_score_codex":0.0010516425,"about_ca_topic_score_gemma":0.00057066453,"teacher_disagreement_score":0.006644539,"about_ca_system_score_codex":0.002066938,"about_ca_system_score_gemma":0.0005478431,"threshold_uncertainty_score":0.035140038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83667785,0.00025600626,0.15409563,0.00072611345,0.000054000448,0.000098511795,0.00025417152,0.00036199272,0.0074757654],"genre_scores_gemma":[0.990772,0.000110453555,0.006165189,0.00010846501,0.00003142665,0.00009230377,0.00013585384,0.00004312741,0.0025411807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990778,0.00035172733,0.000036577352,0.00020404889,0.00017217381,0.00015758627],"domain_scores_gemma":[0.99181247,0.0050792363,0.0012069249,0.0006938405,0.00058915647,0.0006183293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017855358,0.00035777193,0.0008532672,0.0016621201,0.0006527963,0.0016174075,0.0010286224,0.0011801482,0.002936233],"category_scores_gemma":[0.009108109,0.0005344544,0.0008036458,0.0005955838,0.0020872601,0.0016850837,0.0011378938,0.0008894222,0.00032928295],"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.00023343878,0.000056493478,0.003696641,0.0000761522,0.00006596536,0.0006806004,0.00044796636,0.0964929,0.0059235697,0.885576,0.0014719171,0.005278394],"study_design_scores_gemma":[0.00009028806,0.00006665409,0.0018165184,0.000023689356,0.000020729785,0.00014500186,0.00008675658,0.40658274,0.0016207143,0.5884701,0.0010237736,0.000052986677],"about_ca_topic_score_codex":0.0024521775,"about_ca_topic_score_gemma":0.0020623626,"teacher_disagreement_score":0.002936233,"about_ca_system_score_codex":0.0012912337,"about_ca_system_score_gemma":0.00055634096,"threshold_uncertainty_score":0.009822726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678655,0.0019464466,0.300986,0.0009148299,0.00012710723,0.000043983462,0.00028823514,0.0003578889,0.016680451],"genre_scores_gemma":[0.9838135,0.0005595134,0.013057321,0.00010296872,0.00014880505,0.000023857241,0.00012165492,0.000052772346,0.0021195842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990127,0.00020699074,0.000037443966,0.00023319248,0.0003586302,0.00015115773],"domain_scores_gemma":[0.990562,0.0059339837,0.0011591432,0.0008001567,0.00078007247,0.00076471834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014435688,0.00031556142,0.0006895501,0.0019652757,0.00078675075,0.002117908,0.0013051442,0.0006828415,0.0031188503],"category_scores_gemma":[0.012619072,0.00038491443,0.00056162727,0.0010872165,0.0027753015,0.0036138888,0.0015829153,0.0015393081,0.0003154706],"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.000051166808,0.000020351372,0.0030933185,0.000093560884,0.000015863954,0.00014157944,0.00044183884,0.025150506,0.0036451882,0.95351106,0.0011481323,0.012687413],"study_design_scores_gemma":[0.000016932765,0.000076506505,0.0030052268,0.000027409831,0.000017248647,0.00037503464,0.0001389013,0.18473576,0.0014811598,0.8067717,0.0033293916,0.000024779352],"about_ca_topic_score_codex":0.0008815142,"about_ca_topic_score_gemma":0.0004907725,"teacher_disagreement_score":0.0031188503,"about_ca_system_score_codex":0.0010772757,"about_ca_system_score_gemma":0.00048647283,"threshold_uncertainty_score":0.010433555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888172,0.00006532765,0.009276824,0.0000628163,0.000007998048,0.000012621804,0.000043721513,0.00002847342,0.0016849573],"genre_scores_gemma":[0.9989116,0.000022182276,0.0008379819,0.00000626143,0.000003680982,0.000008888175,0.000046536035,0.0000058584887,0.00015694459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995623,0.00011557786,0.000016587554,0.00006261056,0.00016832813,0.00007454891],"domain_scores_gemma":[0.99738604,0.0011703442,0.0006342616,0.00025125887,0.0002811238,0.0002769486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075034366,0.00018492487,0.0004771822,0.0017993837,0.00049568195,0.0012818011,0.00064340717,0.0006285506,0.0015567822],"category_scores_gemma":[0.006654029,0.00021707574,0.0002566034,0.00090834167,0.0012622356,0.0014022045,0.00071057695,0.00033679462,0.000098443124],"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.0003779379,0.000113871276,0.04720573,0.00012879676,0.0001233628,0.00080915686,0.00043281275,0.60186607,0.014895324,0.3167387,0.0011718828,0.016136382],"study_design_scores_gemma":[0.000059748436,0.0001499452,0.016447213,0.000027850625,0.000038948227,0.0005376196,0.0003957057,0.8569711,0.005101196,0.11864433,0.0015700986,0.000056183624],"about_ca_topic_score_codex":0.0006044651,"about_ca_topic_score_gemma":0.0006015905,"teacher_disagreement_score":0.0017993837,"about_ca_system_score_codex":0.0008783064,"about_ca_system_score_gemma":0.00023726016,"threshold_uncertainty_score":0.006372571},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5836156,0.0012429329,0.393767,0.0024960414,0.00007339702,0.00015250409,0.00039617895,0.0006706482,0.017585756],"genre_scores_gemma":[0.977126,0.00021677284,0.020711446,0.0002504046,0.000062063176,0.00011718266,0.00023747701,0.00006459873,0.0012141552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942266,0.0020380416,0.00042819377,0.00083414826,0.0016194214,0.00085348013],"domain_scores_gemma":[0.9473813,0.04079875,0.003965092,0.0032109316,0.001913236,0.0027306625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063080247,0.0007220395,0.0015544166,0.0025366792,0.0009365246,0.0046481756,0.0016773279,0.0017874101,0.004222754],"category_scores_gemma":[0.03989351,0.00085407903,0.0017594175,0.0014580778,0.0045647486,0.0074868603,0.0037458334,0.004558026,0.00030723913],"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.00026116995,0.000109275854,0.0026138762,0.00016685683,0.00007514367,0.000305683,0.0005790889,0.0493832,0.004507758,0.93430644,0.0012602276,0.0064311926],"study_design_scores_gemma":[0.000051297407,0.00009072825,0.00097106013,0.000031595882,0.00002226001,0.0002597444,0.0001782455,0.15486212,0.002028523,0.8407093,0.0007593896,0.000035636247],"about_ca_topic_score_codex":0.0009824767,"about_ca_topic_score_gemma":0.00072525523,"teacher_disagreement_score":0.0063080247,"about_ca_system_score_codex":0.0027726935,"about_ca_system_score_gemma":0.0008836817,"threshold_uncertainty_score":0.03336042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6000707,0.0011282586,0.3562633,0.0033788595,0.00009159299,0.0002962495,0.0005487786,0.000989143,0.037233107],"genre_scores_gemma":[0.9834292,0.00025438122,0.012788969,0.00040576875,0.000046427853,0.0001608715,0.0001403098,0.00007138793,0.002702736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681973,0.00086090056,0.00017359774,0.00071527204,0.0007198893,0.00071061903],"domain_scores_gemma":[0.9733899,0.01833614,0.002377475,0.0018131838,0.0009924504,0.0030908417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036845098,0.0009102737,0.0020491534,0.0021191149,0.0015565123,0.005239165,0.002721433,0.003401143,0.0067449445],"category_scores_gemma":[0.029642861,0.0008663615,0.0012135053,0.0008813937,0.0048664496,0.007624186,0.0033723293,0.004517928,0.000759372],"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.0005525796,0.00018709748,0.0032945648,0.00026176372,0.00014088473,0.000389697,0.0008195101,0.039715864,0.010290691,0.92977166,0.0034042662,0.011171397],"study_design_scores_gemma":[0.00012437868,0.00018356681,0.00067618006,0.000045511908,0.000053791984,0.00026169722,0.00016956752,0.19487275,0.0032818208,0.79848486,0.0017749225,0.00007110368],"about_ca_topic_score_codex":0.0013942297,"about_ca_topic_score_gemma":0.00082314137,"teacher_disagreement_score":0.0067449445,"about_ca_system_score_codex":0.0025386491,"about_ca_system_score_gemma":0.0012105181,"threshold_uncertainty_score":0.022564113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16058014,0.00044713722,0.81739336,0.0008457704,0.000050813684,0.00018417148,0.00011268585,0.0002499013,0.020136083],"genre_scores_gemma":[0.9157442,0.0003498658,0.07722475,0.0001908709,0.000065208405,0.0004009747,0.000111073445,0.000050337276,0.0058627347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971884,0.0016008905,0.00008101494,0.0003749478,0.00045353413,0.00030122502],"domain_scores_gemma":[0.99431604,0.0042494778,0.00053985126,0.00026336257,0.00041124612,0.00021996963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526394,0.00085017557,0.001076005,0.0013727158,0.00084679964,0.0022563115,0.0012730828,0.0012079898,0.004257788],"category_scores_gemma":[0.011573048,0.0006155575,0.0007085159,0.0006459213,0.002317385,0.0031466223,0.0016389808,0.0011439817,0.00060404633],"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.00010736472,0.000056909925,0.00053308764,0.00007335532,0.000054228687,0.0001443702,0.00017399415,0.13755439,0.001052359,0.8504711,0.0013189152,0.008459987],"study_design_scores_gemma":[0.000060214174,0.0000453285,0.00012546779,0.000018920146,0.000011270746,0.00007431998,0.000061543666,0.500717,0.0005460749,0.49654016,0.001783946,0.000015722464],"about_ca_topic_score_codex":0.0015455098,"about_ca_topic_score_gemma":0.0010847155,"teacher_disagreement_score":0.004257788,"about_ca_system_score_codex":0.0014245781,"about_ca_system_score_gemma":0.0007927223,"threshold_uncertainty_score":0.014243782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5423672,0.00058719446,0.40677258,0.0034728546,0.00007560092,0.00014494438,0.00031809343,0.0003561873,0.04590539],"genre_scores_gemma":[0.9807581,0.00019761131,0.014989226,0.00037755302,0.000046832887,0.0001088069,0.000090876536,0.00005903273,0.0033720082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867874,0.0005526597,0.000040244577,0.00017581244,0.00036736965,0.00018515947],"domain_scores_gemma":[0.99247265,0.0047753965,0.00090097374,0.0007218928,0.0005224506,0.000606664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017961962,0.00043237032,0.0006790319,0.0008613651,0.00064036,0.0016522227,0.0014762649,0.0012059738,0.005238725],"category_scores_gemma":[0.013547485,0.000314295,0.00048040485,0.00047380713,0.0021929792,0.0033935017,0.001491964,0.0017298384,0.00040592268],"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.000091175854,0.000046268775,0.001396705,0.00005714281,0.000025034318,0.00015494972,0.00018544665,0.04066566,0.0027748481,0.94885063,0.0017449035,0.004007226],"study_design_scores_gemma":[0.000060642564,0.00003856673,0.0007123516,0.00001751961,0.000016483518,0.00020512436,0.00007974273,0.25464618,0.0007182388,0.74178714,0.0016967193,0.000021313606],"about_ca_topic_score_codex":0.00126537,"about_ca_topic_score_gemma":0.0012431317,"teacher_disagreement_score":0.005238725,"about_ca_system_score_codex":0.0018836609,"about_ca_system_score_gemma":0.0006458742,"threshold_uncertainty_score":0.017525256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105194375,0.0056317444,0.807686,0.007524972,0.0004988844,0.00013243865,0.00033038872,0.0003853176,0.0726159],"genre_scores_gemma":[0.9072257,0.0029561108,0.06918854,0.0021139248,0.001124368,0.0004692428,0.00030354926,0.00044742168,0.016171148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947372,0.0024797167,0.00020127343,0.00060759665,0.0013284535,0.00064578664],"domain_scores_gemma":[0.959734,0.031624995,0.001585248,0.0020987499,0.003425775,0.0015311935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01185536,0.001419583,0.0020499562,0.004460962,0.001875383,0.003866637,0.0029036866,0.002349281,0.0075120954],"category_scores_gemma":[0.037663702,0.0009272913,0.0025451717,0.0017105028,0.006989755,0.007847138,0.006891064,0.0045946944,0.0008781763],"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.00005696089,0.000025546888,0.00038390476,0.00011095666,0.000036414036,0.000093474446,0.00015426241,0.009629749,0.0014730053,0.9818112,0.0019270495,0.0042974344],"study_design_scores_gemma":[0.000024560837,0.000050457795,0.000490738,0.00007767895,0.00003231246,0.00018071062,0.00004522572,0.22320893,0.0027849993,0.77011496,0.0029412583,0.000048180606],"about_ca_topic_score_codex":0.0017076074,"about_ca_topic_score_gemma":0.00067890313,"teacher_disagreement_score":0.01185536,"about_ca_system_score_codex":0.0033728997,"about_ca_system_score_gemma":0.0013330989,"threshold_uncertainty_score":0.06269789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83046645,0.000565601,0.15412493,0.00084440585,0.000048773498,0.00011514905,0.00028183553,0.0004685032,0.013084365],"genre_scores_gemma":[0.98961115,0.00014455455,0.008515707,0.00012637257,0.000039403443,0.00005702195,0.00017723072,0.00004659836,0.0012820339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986532,0.0005208277,0.00005724782,0.00025900936,0.00033349506,0.00017624894],"domain_scores_gemma":[0.9899767,0.0054856064,0.0017609522,0.001396776,0.0007162651,0.0006638188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012752139,0.00030325257,0.00062263303,0.0015010337,0.00076595554,0.0011181612,0.0007860003,0.00061356457,0.002195538],"category_scores_gemma":[0.011923226,0.00045015698,0.0005822345,0.00062361767,0.0016428228,0.0018624584,0.0015111702,0.0008047681,0.00028648402],"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.0006924726,0.00013939278,0.014527563,0.00035312213,0.00014210072,0.001032385,0.0011381917,0.08038769,0.015350385,0.8438443,0.005973579,0.03641885],"study_design_scores_gemma":[0.000089895184,0.0001401174,0.0032898618,0.000051946427,0.00005171821,0.0010525123,0.00020520577,0.31545073,0.006361345,0.66847014,0.004807665,0.000028893302],"about_ca_topic_score_codex":0.0008659038,"about_ca_topic_score_gemma":0.00074109196,"teacher_disagreement_score":0.002195538,"about_ca_system_score_codex":0.000882955,"about_ca_system_score_gemma":0.0003850987,"threshold_uncertainty_score":0.0073447824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9518167,0.00023746118,0.0433087,0.000542784,0.000028981294,0.000025806135,0.00008757012,0.00017227972,0.0037797224],"genre_scores_gemma":[0.99370146,0.000084848856,0.005200308,0.000027955404,0.000017736556,0.00001963503,0.000053694064,0.000035446177,0.00085895095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997907,0.000074157106,0.0000070207557,0.000046173158,0.000042888034,0.00003907857],"domain_scores_gemma":[0.99658054,0.0019560994,0.00049364025,0.00019500488,0.00030961263,0.00046516987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088703126,0.00035491784,0.0004237993,0.0014373207,0.0007515384,0.0012271823,0.0006387636,0.0007916574,0.0020352653],"category_scores_gemma":[0.008505559,0.00027405538,0.0004232936,0.00045146636,0.0013571623,0.0014093334,0.0007725459,0.00074452825,0.00019620491],"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.0006137242,0.00013377352,0.02782435,0.0002254256,0.00017354988,0.0011304566,0.0009031693,0.27637154,0.06575259,0.60865533,0.0036156054,0.014600508],"study_design_scores_gemma":[0.00003184961,0.00006510637,0.0050892234,0.000020930256,0.000032516804,0.00021809599,0.00012430729,0.9196685,0.0049842056,0.068713374,0.001011244,0.00004065977],"about_ca_topic_score_codex":0.0026862398,"about_ca_topic_score_gemma":0.0013850307,"teacher_disagreement_score":0.0026862398,"about_ca_system_score_codex":0.0010984255,"about_ca_system_score_gemma":0.00034867655,"threshold_uncertainty_score":0.007969677},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7801865,0.00037186372,0.21042982,0.0020970933,0.00003320782,0.00014120775,0.00035973667,0.0008807425,0.005499842],"genre_scores_gemma":[0.9745841,0.00011395366,0.023762638,0.0001637442,0.000021557118,0.00009987141,0.00031433173,0.00008746534,0.0008523043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616516,0.0018095169,0.00020625767,0.0005964997,0.0008432315,0.00037934692],"domain_scores_gemma":[0.92012626,0.06683888,0.0053104474,0.004367932,0.0017227645,0.0016337926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060713296,0.00040281648,0.0010208183,0.0012112233,0.00062475604,0.002337738,0.0019441083,0.0016396645,0.0028064328],"category_scores_gemma":[0.055083465,0.00069513434,0.0009231177,0.0006755875,0.0024410007,0.004143061,0.0014636451,0.0026319707,0.00024568223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0007110955,0.00047899695,0.007843064,0.00029302147,0.00020204563,0.00056621287,0.00067084376,0.60520995,0.023554528,0.34348366,0.0027120765,0.014274545],"study_design_scores_gemma":[0.00005404661,0.000098439385,0.0006824308,0.00001424693,0.000022570666,0.0001582944,0.000070425296,0.90415984,0.0041382206,0.09019337,0.00038715816,0.000021044376],"about_ca_topic_score_codex":0.0012978727,"about_ca_topic_score_gemma":0.00094602234,"teacher_disagreement_score":0.0060713296,"about_ca_system_score_codex":0.0026048485,"about_ca_system_score_gemma":0.0010130154,"threshold_uncertainty_score":0.032108665},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26353076,0.000736872,0.7226973,0.0023300836,0.00007652679,0.000100709665,0.0005402744,0.0004332025,0.009554226],"genre_scores_gemma":[0.9625941,0.0005175553,0.033253036,0.00018760437,0.0001811278,0.00016274078,0.00033402402,0.0001522093,0.0026176486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816614,0.0009011673,0.000063080224,0.00034792416,0.00033428363,0.00018743244],"domain_scores_gemma":[0.9516122,0.039759785,0.0032961734,0.0022780476,0.0016749578,0.0013788723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044995523,0.0008059826,0.0009020301,0.0038964178,0.0010199172,0.0021039345,0.002239068,0.0017520081,0.004694006],"category_scores_gemma":[0.038913134,0.00076656597,0.0007105742,0.0024016532,0.0049678683,0.0053295125,0.0023435904,0.0019870412,0.00030131216],"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.00010013085,0.000055309793,0.0035543728,0.0000737235,0.000027600685,0.0001409785,0.000224054,0.21187444,0.0019784989,0.7753395,0.001529345,0.005102095],"study_design_scores_gemma":[0.000025894376,0.000029038321,0.0014175207,0.000034139004,0.0000139365,0.00011128459,0.00007350357,0.7022556,0.0009710549,0.29413435,0.0008883811,0.000045302033],"about_ca_topic_score_codex":0.0035246192,"about_ca_topic_score_gemma":0.003682896,"teacher_disagreement_score":0.004694006,"about_ca_system_score_codex":0.0031519847,"about_ca_system_score_gemma":0.000876775,"threshold_uncertainty_score":0.0237962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8630048,0.00045356763,0.12893216,0.00085641403,0.000036730304,0.00005858866,0.00040339155,0.00030357868,0.0059507014],"genre_scores_gemma":[0.9927014,0.00010816916,0.0060233837,0.00006910596,0.0000382662,0.000034100744,0.0001408137,0.000044241395,0.0008405292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969029,0.0011604349,0.00019618172,0.0007227333,0.0006073704,0.00041030024],"domain_scores_gemma":[0.96185416,0.022528877,0.0068256743,0.0036392002,0.0022045432,0.0029475272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042064264,0.00044760888,0.0011174217,0.0019620107,0.001046991,0.0021554038,0.0019271107,0.0012225424,0.002719503],"category_scores_gemma":[0.03117609,0.0008898057,0.0006629397,0.0009738244,0.0037441934,0.0058366177,0.001963578,0.0010841215,0.00032155457],"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.000717248,0.00019178387,0.029154086,0.00038025426,0.00019113331,0.00047326475,0.0010022465,0.1039728,0.021962306,0.8156834,0.0035623554,0.022709226],"study_design_scores_gemma":[0.000074405034,0.00017425416,0.006301478,0.00005647582,0.00007464967,0.0005922435,0.00021315306,0.464191,0.005521017,0.5206937,0.0020359491,0.00007161771],"about_ca_topic_score_codex":0.0012278284,"about_ca_topic_score_gemma":0.0012072179,"teacher_disagreement_score":0.0042064264,"about_ca_system_score_codex":0.0016375029,"about_ca_system_score_gemma":0.0006093511,"threshold_uncertainty_score":0.022246003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080229826,0.00023863792,0.91170406,0.000667446,0.00006142515,0.0001319253,0.00025836597,0.0012778863,0.005430478],"genre_scores_gemma":[0.53920585,0.0002111422,0.45505887,0.00021661351,0.000079406025,0.00045617635,0.0005594992,0.0004218306,0.0037906365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980337,0.00071540324,0.00007266909,0.0004377063,0.00046925968,0.00027126362],"domain_scores_gemma":[0.9917957,0.0058894064,0.0005006303,0.0010844665,0.0004328433,0.00029699702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028582637,0.0010401802,0.0014475163,0.0018509156,0.00080257026,0.0024256746,0.003474603,0.0015130976,0.004861227],"category_scores_gemma":[0.013343467,0.00087900006,0.0013040017,0.0023988283,0.0023353903,0.0067723873,0.0033812725,0.0027357945,0.00064682314],"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.0003528256,0.00013844125,0.0014582253,0.00016700207,0.0000702878,0.00009035216,0.00017007954,0.54750645,0.0037159647,0.38818216,0.005848436,0.052299667],"study_design_scores_gemma":[0.000018692732,0.000016726808,0.000077083896,0.0000107974665,0.0000067282926,0.000021439992,0.000019392559,0.8826057,0.0010562044,0.115555085,0.0006041317,0.000008168415],"about_ca_topic_score_codex":0.002730702,"about_ca_topic_score_gemma":0.002589969,"teacher_disagreement_score":0.004861227,"about_ca_system_score_codex":0.003016964,"about_ca_system_score_gemma":0.001882253,"threshold_uncertainty_score":0.021889687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18620758,0.0036419441,0.7634757,0.0022187904,0.0002185898,0.00022737807,0.0005895992,0.0007443628,0.042676024],"genre_scores_gemma":[0.9261827,0.0016124737,0.059152085,0.00038752696,0.00020219194,0.0003055238,0.0002405581,0.00029572053,0.011621304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981034,0.00053008937,0.000109763714,0.0005436261,0.00042041074,0.00029270994],"domain_scores_gemma":[0.94543505,0.044640217,0.0026537448,0.00357919,0.0021694885,0.0015222863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00477059,0.00086805667,0.0009746603,0.0025833086,0.0013461155,0.0021223985,0.0028833256,0.0015709926,0.0114242025],"category_scores_gemma":[0.043386515,0.00055206596,0.0009343877,0.0019773515,0.0037109975,0.011029335,0.0017729965,0.0031795972,0.0011122057],"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.00014705108,0.00005225506,0.0014194433,0.00017621965,0.000048465623,0.00013045732,0.00030687326,0.05532695,0.002967515,0.92326736,0.0027643195,0.013393087],"study_design_scores_gemma":[0.000032512122,0.000051669707,0.0011148329,0.000060855327,0.000038507867,0.00022215035,0.00009361915,0.22363581,0.0028518117,0.76865,0.0031941808,0.000054106964],"about_ca_topic_score_codex":0.0019951018,"about_ca_topic_score_gemma":0.0016664516,"teacher_disagreement_score":0.0114242025,"about_ca_system_score_codex":0.003339515,"about_ca_system_score_gemma":0.0014070013,"threshold_uncertainty_score":0.038217783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30509633,0.00086551666,0.66979647,0.00178981,0.00011789264,0.00021187816,0.00021446976,0.0005487395,0.021358857],"genre_scores_gemma":[0.9765421,0.00020343896,0.019285237,0.0002831369,0.000054644523,0.00012733253,0.000060715996,0.000050109928,0.003393284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974492,0.0009774717,0.00013105695,0.0005673613,0.00045977836,0.00041503838],"domain_scores_gemma":[0.96659875,0.025117645,0.0030909202,0.0016464309,0.0015617042,0.0019846512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005580222,0.00089982443,0.0015287152,0.0018865329,0.00092332886,0.0030664254,0.0017368037,0.0023944494,0.004915385],"category_scores_gemma":[0.035576645,0.0006928196,0.0012138642,0.00060923793,0.005382331,0.0038105117,0.0025220057,0.0033625145,0.00044792413],"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.00009756822,0.0000443597,0.0011916057,0.00009379653,0.00004779655,0.00025621557,0.00034568922,0.04451183,0.002857253,0.94579995,0.00079053664,0.003963558],"study_design_scores_gemma":[0.00005554933,0.000077283636,0.0006743618,0.000038230417,0.000023549888,0.00009744099,0.00010869809,0.35170195,0.0010407523,0.6454169,0.0007276925,0.000037712656],"about_ca_topic_score_codex":0.0020839423,"about_ca_topic_score_gemma":0.0012795407,"teacher_disagreement_score":0.005580222,"about_ca_system_score_codex":0.0027472982,"about_ca_system_score_gemma":0.0008101958,"threshold_uncertainty_score":0.029511333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92597526,0.0005680151,0.060583852,0.0005951736,0.000061705476,0.000046622492,0.00046123966,0.00020406734,0.011503935],"genre_scores_gemma":[0.98679787,0.00031252432,0.011235159,0.00006244135,0.000053296273,0.000056127457,0.00026146823,0.000071456765,0.001149628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901736,0.00023476602,0.00006122988,0.00025517927,0.00023483387,0.00019657289],"domain_scores_gemma":[0.9816705,0.0120827975,0.0025400417,0.0011786825,0.0013018128,0.001226189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013678871,0.00044926233,0.0005490858,0.00231204,0.00081714283,0.0028558373,0.0010489393,0.00070755434,0.0025775272],"category_scores_gemma":[0.01740154,0.0006426285,0.0004109968,0.0012607271,0.0026859753,0.0040374063,0.0010612706,0.00098324,0.00042100585],"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.0009281007,0.0001912425,0.084513985,0.00043501257,0.00006996097,0.0005155257,0.00093342306,0.06095303,0.035570275,0.764541,0.0051950538,0.04615338],"study_design_scores_gemma":[0.000079961625,0.00017189058,0.025870387,0.00013751705,0.00009684589,0.0012710893,0.00076777325,0.35692137,0.027936008,0.58095604,0.005618497,0.00017252647],"about_ca_topic_score_codex":0.0019205533,"about_ca_topic_score_gemma":0.001671105,"teacher_disagreement_score":0.0028558373,"about_ca_system_score_codex":0.001529602,"about_ca_system_score_gemma":0.00058122486,"threshold_uncertainty_score":0.011098087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47482163,0.0009271193,0.47258797,0.0012519817,0.00015454124,0.00005521142,0.00018772985,0.0004065702,0.049607307],"genre_scores_gemma":[0.96986365,0.00030741937,0.021862319,0.00025935096,0.000144124,0.00006977442,0.00012558929,0.00014399142,0.0072237463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988914,0.00033274468,0.000040014696,0.00018590425,0.00036650084,0.00018347066],"domain_scores_gemma":[0.99038553,0.006920053,0.00052833953,0.00053511857,0.0007891873,0.0008418315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019087429,0.00034859544,0.00076017744,0.0019567823,0.0010807223,0.002057358,0.00095088803,0.00086671737,0.0066667963],"category_scores_gemma":[0.011089393,0.00033769163,0.00052330736,0.00091741874,0.0030663277,0.003818796,0.0027156454,0.0024731806,0.0006961371],"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.00003854789,0.000022417726,0.00029536322,0.000031876178,0.000007391122,0.00011335745,0.0001649497,0.0039452263,0.0019232624,0.98910344,0.0009022896,0.0034520084],"study_design_scores_gemma":[0.000014621071,0.000027198652,0.0004723177,0.00002046443,0.000009623534,0.0002831393,0.00009224424,0.14056252,0.0018675202,0.85459465,0.0020374628,0.000018201787],"about_ca_topic_score_codex":0.00049165485,"about_ca_topic_score_gemma":0.00036582674,"teacher_disagreement_score":0.0066667963,"about_ca_system_score_codex":0.0007026597,"about_ca_system_score_gemma":0.00041338822,"threshold_uncertainty_score":0.022302687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86091334,0.0011283164,0.08604263,0.0011923139,0.000054966753,0.000052566375,0.0004015757,0.00029850687,0.049915668],"genre_scores_gemma":[0.9857971,0.0002641314,0.011575794,0.00009302999,0.00003981293,0.000042000658,0.00017543253,0.00002655079,0.0019859867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992908,0.0002107894,0.000034568107,0.00014975258,0.00021021604,0.000103843005],"domain_scores_gemma":[0.9968526,0.0016307448,0.00044193584,0.00041502458,0.00027701518,0.00038275754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087540934,0.00024642356,0.00047080152,0.0017214818,0.0016206693,0.0014555008,0.00076302397,0.0008735924,0.0028446852],"category_scores_gemma":[0.003938921,0.00039060498,0.00056967,0.001018551,0.0028116833,0.0032126599,0.0014529112,0.00102759,0.00016436528],"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.000027149637,0.000015930369,0.0014679462,0.00004926875,0.000009509701,0.00019539092,0.00034263096,0.0033225198,0.0007664845,0.989791,0.000848582,0.0031636595],"study_design_scores_gemma":[0.000020582202,0.000025096728,0.0015315529,0.00003244161,0.000015226901,0.0009286189,0.00029617306,0.028491622,0.001114391,0.9616287,0.005894187,0.000021445294],"about_ca_topic_score_codex":0.00077138253,"about_ca_topic_score_gemma":0.0007829164,"teacher_disagreement_score":0.0028446852,"about_ca_system_score_codex":0.001371714,"about_ca_system_score_gemma":0.00025759445,"threshold_uncertainty_score":0.009952486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8332792,0.0012327409,0.13854586,0.00080443703,0.000056596888,0.00007189399,0.00095457997,0.00031863773,0.024736142],"genre_scores_gemma":[0.98585284,0.000294101,0.011524626,0.00006068775,0.000044107383,0.00003995905,0.0002774398,0.000031648186,0.0018745763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920493,0.00013223282,0.000048542573,0.00025625248,0.00022905813,0.00012899238],"domain_scores_gemma":[0.9947267,0.0022839122,0.0010724908,0.00055833935,0.0006001881,0.00075849076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010358114,0.00026375634,0.000534724,0.002225546,0.001762347,0.0019436503,0.000736862,0.00075364293,0.003639466],"category_scores_gemma":[0.0053974106,0.00045453492,0.0005834422,0.001777705,0.002281612,0.004408832,0.0011030949,0.0009876216,0.00021394833],"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.000056182344,0.000025190264,0.0057545374,0.000073725816,0.000023825723,0.00022619925,0.0005537304,0.007713332,0.0018880892,0.9745667,0.0014126617,0.007705773],"study_design_scores_gemma":[0.000026912696,0.000051278254,0.0042760577,0.000052955675,0.00003859712,0.0015385575,0.0004949818,0.0510271,0.0025457162,0.9313194,0.00858181,0.000046706078],"about_ca_topic_score_codex":0.0014167731,"about_ca_topic_score_gemma":0.00083638716,"teacher_disagreement_score":0.003639466,"about_ca_system_score_codex":0.0019415137,"about_ca_system_score_gemma":0.00047974198,"threshold_uncertainty_score":0.014086783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48047477,0.00047406307,0.49937403,0.0015747251,0.000048626483,0.000110807225,0.00020857352,0.00033386424,0.017400537],"genre_scores_gemma":[0.973722,0.0002257632,0.020690722,0.00022478956,0.00003805092,0.000116102055,0.0000981224,0.00006380089,0.004820638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983335,0.0008733445,0.00005371314,0.00022136956,0.00027402467,0.00024398489],"domain_scores_gemma":[0.9911022,0.005378135,0.0011833754,0.0012331118,0.00048424705,0.00061889045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025128352,0.00043534805,0.0008334428,0.0010178544,0.0008648995,0.0015178806,0.0016133884,0.0015795842,0.0050955787],"category_scores_gemma":[0.011596443,0.0005324442,0.00071048987,0.0008447788,0.0030754707,0.0046570967,0.0020290492,0.0015115602,0.00045586698],"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.000093751056,0.000045963065,0.00047883467,0.000045109406,0.000018503402,0.00011460861,0.00012850462,0.074299864,0.0012998133,0.91869575,0.0009276515,0.0038516861],"study_design_scores_gemma":[0.000042438685,0.0000495739,0.00018436598,0.00001425323,0.00001023964,0.0000753668,0.00007175478,0.3581682,0.0007501901,0.63954264,0.0010711823,0.00001977318],"about_ca_topic_score_codex":0.001822836,"about_ca_topic_score_gemma":0.0015243313,"teacher_disagreement_score":0.0050955787,"about_ca_system_score_codex":0.0018237481,"about_ca_system_score_gemma":0.0009659311,"threshold_uncertainty_score":0.017046392},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6458883,0.00092801155,0.3432386,0.00041078456,0.00010025019,0.00015571437,0.00021011889,0.0016802163,0.007387972],"genre_scores_gemma":[0.9486403,0.00018449471,0.048385303,0.00010874117,0.00003312063,0.000060330007,0.0001821892,0.00015437441,0.0022510956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976164,0.0009218486,0.00010012046,0.00036604074,0.00051622576,0.00047937507],"domain_scores_gemma":[0.9775655,0.015267724,0.0013175841,0.003546154,0.0014769858,0.0008260973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038513131,0.00046302864,0.0011454643,0.0010446078,0.0013308573,0.0012746116,0.002004303,0.000835029,0.003646905],"category_scores_gemma":[0.02462959,0.0004659211,0.00051381957,0.0011407569,0.0017941163,0.002523968,0.0018877597,0.0011723489,0.00087993447],"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.002247014,0.00035039504,0.0056305043,0.0002742608,0.00016944483,0.00036868043,0.00037499378,0.77593786,0.030679764,0.07540692,0.009910387,0.09864977],"study_design_scores_gemma":[0.0000426926,0.00017702849,0.0006569035,0.000010683783,0.00002117876,0.00007411151,0.00004361118,0.9792793,0.006113853,0.01298307,0.0005837981,0.000013760545],"about_ca_topic_score_codex":0.0024273423,"about_ca_topic_score_gemma":0.0017868971,"teacher_disagreement_score":0.0038513131,"about_ca_system_score_codex":0.0015549931,"about_ca_system_score_gemma":0.0009788782,"threshold_uncertainty_score":0.02036792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19451076,0.0023787206,0.6451208,0.004778674,0.00041181015,0.0003484803,0.003737117,0.00025119036,0.14846252],"genre_scores_gemma":[0.8652199,0.0010455246,0.1180326,0.0011766982,0.00044174414,0.0004718829,0.0025317154,0.00012415597,0.010955729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944922,0.0016874863,0.0004016942,0.0013023441,0.0013515349,0.0007648453],"domain_scores_gemma":[0.9723432,0.020573208,0.0019506521,0.0012340423,0.0026152045,0.0012836538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004609804,0.000885291,0.001463889,0.0025870244,0.0019868293,0.0039103003,0.0032695977,0.0018780716,0.014199987],"category_scores_gemma":[0.023669021,0.0011197622,0.001878496,0.0027664457,0.0024770198,0.009779922,0.0037678669,0.0058248895,0.001223556],"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.0001490294,0.00005281634,0.0017081816,0.00017805671,0.000038585284,0.0002204052,0.00030357784,0.007904158,0.0015307465,0.9769116,0.0030572333,0.007945559],"study_design_scores_gemma":[0.00003610292,0.000050161147,0.0017106069,0.00009504527,0.000037684866,0.00027720234,0.00018577113,0.07713323,0.001581392,0.91365635,0.0051964098,0.000040056955],"about_ca_topic_score_codex":0.0027214692,"about_ca_topic_score_gemma":0.0032033601,"teacher_disagreement_score":0.014199987,"about_ca_system_score_codex":0.0037185752,"about_ca_system_score_gemma":0.0017658906,"threshold_uncertainty_score":0.04750371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12874037,0.0007700613,0.84550625,0.0007199681,0.0001492883,0.00009393109,0.00063453673,0.00051707006,0.022868613],"genre_scores_gemma":[0.91359675,0.00045005415,0.0751076,0.00035789053,0.00019151806,0.00020174838,0.0005435984,0.00013913783,0.009411618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991008,0.00027116158,0.00004385961,0.00023826382,0.00019021357,0.00015570893],"domain_scores_gemma":[0.99522686,0.0022413516,0.0006695098,0.00070339424,0.0008168142,0.0003420999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012697852,0.0002491876,0.0005040867,0.0011020781,0.0009347952,0.0012808212,0.0008717963,0.0008276417,0.005042212],"category_scores_gemma":[0.008025721,0.0002651446,0.00055406865,0.0010248901,0.0017761539,0.002673151,0.00095664244,0.001028422,0.00047909032],"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.000020102909,0.000010704121,0.0005039971,0.000029456825,0.000010255094,0.00006260667,0.00006576721,0.017937774,0.0010597552,0.97367823,0.0011800954,0.005441412],"study_design_scores_gemma":[0.000018821682,0.00003309075,0.000700566,0.000024545503,0.0000126676505,0.00015221222,0.000049658334,0.26288846,0.0009559825,0.72699034,0.00815655,0.000017115974],"about_ca_topic_score_codex":0.002273135,"about_ca_topic_score_gemma":0.0021122834,"teacher_disagreement_score":0.005042212,"about_ca_system_score_codex":0.0011128766,"about_ca_system_score_gemma":0.0006318992,"threshold_uncertainty_score":0.016867936},"labels":[],"label_agreement":null}]}