{"meta":{"query_hash":"793d55408e16","filters":{"venue":"MIMS EPrints (University of Southampton)"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/793d55408e16","api":"https://metacan.xera.ac/api/v1/cohort?venue=MIMS+EPrints+%28University+of+Southampton%29"},"results":[{"id":"W1491851281","doi":"","title":"Probabilistic Merging Operators","year":2014,"lang":"fr","type":"article","venue":"MIMS EPrints (University of Southampton)","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","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":"Assumption University","funders":"","keywords":"Pooling; Mathematics; Operator (biology); Probabilistic logic; Entropy (arrow of time); Linear map; Principle of maximum entropy; Computer science; Algorithm; Applied mathematics; Artificial intelligence; Statistics; Pure mathematics","score_opus":0.00888510744964488,"score_gpt":0.19298742447407197,"score_spread":0.1841023170244271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491851281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4305939,0.0000656071,0.5575949,0.0011580425,0.0007682568,0.00021650588,0.00018796315,0.000026507578,0.009388291],"genre_scores_gemma":[0.9849032,0.000010729977,0.0063169114,0.000027358707,0.00016722183,3.947383e-7,0.000026315458,0.00002103502,0.008526811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986796,0.000112435744,0.000178735,0.0004104852,0.00020158617,0.0004171717],"domain_scores_gemma":[0.99899834,0.00012160058,0.00014136534,0.00036895677,0.00012291814,0.00024680604],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024715418,0.00021204178,0.0003673461,0.000071505405,0.00023940679,0.000030630545,0.00035408715,0.00010023062,0.006412331],"category_scores_gemma":[0.000039515955,0.00027500954,0.00018220869,0.00018947839,0.0002534613,0.00012381586,0.00025561015,0.00024303395,0.0015792003],"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.000030212344,0.00021416172,0.0039346274,0.00010459432,0.0001357715,0.0000059860545,0.0020492098,0.00037487154,0.00027177556,0.90126866,0.00060067285,0.09100943],"study_design_scores_gemma":[0.0053298846,0.00052518497,0.018676793,0.0009850693,0.00088754186,0.0000056064755,0.022512969,0.39709038,0.00094891,0.17249167,0.3785935,0.0019524897],"about_ca_topic_score_codex":0.0016208916,"about_ca_topic_score_gemma":0.000020147243,"teacher_disagreement_score":0.728777,"about_ca_system_score_codex":0.00006632136,"about_ca_system_score_gemma":0.00007267914,"threshold_uncertainty_score":0.9999702},"labels":[],"label_agreement":null},{"id":"W3101802995","doi":"","title":"Optimal Scaling of Random Walk Metropolis algorithms with\\nDiscontinuous target densities","year":2007,"lang":"en","type":"article","venue":"MIMS EPrints (University of Southampton)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","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":"Brock University","funders":"","keywords":"Random walk; Curse of dimensionality; Mathematics; Metropolis–Hastings algorithm; Convergence (economics); Scaling; Markov chain; Sequence (biology); Algorithm; Rate of convergence; Markov process; Probability density function; Stochastic process; Diffusion process; Diffusion; Applied mathematics; Mathematical optimization; Statistical physics; Computer science; Markov chain Monte Carlo; Statistics; Monte Carlo method; Physics","score_opus":0.02672775531838749,"score_gpt":0.2668259879196557,"score_spread":0.24009823260126822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101802995","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61391884,0.00003385552,0.3818664,0.000027683674,0.0000600299,0.00016219166,0.000027894659,0.000036067766,0.0038670325],"genre_scores_gemma":[0.58969563,0.000008171865,0.4084606,0.0000073511064,0.00003280908,1.7555855e-7,0.000005250059,0.000019280867,0.0017707447],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99850863,0.00010512044,0.00030116862,0.0003185726,0.00039044523,0.00037607],"domain_scores_gemma":[0.9983693,0.00040186322,0.00036880554,0.000439684,0.0002721027,0.00014825056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015757543,0.00021830095,0.0006825914,0.0002880416,0.00014370341,0.0000104083965,0.00034016772,0.00014198406,0.00024838027],"category_scores_gemma":[0.00013698015,0.00021934694,0.00025813072,0.00025406684,0.00041806334,0.00013470562,0.00021019552,0.00019807604,7.8552205e-7],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.02619653,0.0048481193,0.11611606,0.0051692687,0.00883165,0.0030911488,0.4594728,0.0024013475,0.062425222,0.08523907,0.0040038694,0.22220491],"study_design_scores_gemma":[0.037028864,0.0011487922,0.015015656,0.0015171976,0.0019109925,0.0002452845,0.7207028,0.01306737,0.18968517,0.008850376,0.0073875645,0.003439921],"about_ca_topic_score_codex":0.00084890495,"about_ca_topic_score_gemma":0.00020767142,"teacher_disagreement_score":0.26123002,"about_ca_system_score_codex":0.00006554799,"about_ca_system_score_gemma":0.000047733985,"threshold_uncertainty_score":0.8944709},"labels":[],"label_agreement":null}]}