{"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":"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.015705217,0.00039508598,0.96761113,0.00096439256,0.00006079387,0.00009111631,0.00010639255,0.00018185146,0.014884136],"genre_scores_gemma":[0.54185706,0.0008860068,0.44597328,0.00068907975,0.0005442255,0.00048690796,0.0002658616,0.00016295715,0.009134607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945241,0.0018565203,0.00036689758,0.0010233168,0.0018076778,0.00042146732],"domain_scores_gemma":[0.9875123,0.00810036,0.0015335088,0.0012828951,0.0010649093,0.0005060352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010568439,0.0007905738,0.0008695932,0.0030561485,0.0019281738,0.0033514253,0.002796715,0.0021421227,0.006210594],"category_scores_gemma":[0.022097595,0.0005684367,0.0022081083,0.0020813637,0.005862236,0.010155565,0.0052515254,0.0029932843,0.0006048056],"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.000014675686,0.0000085315305,0.00016211036,0.00003736248,0.000014829289,0.000059212824,0.00018482977,0.004143099,0.0005796933,0.9855258,0.00034191684,0.008927902],"study_design_scores_gemma":[0.000009240934,0.000025561725,0.00016044483,0.000021488622,0.00001929804,0.00012900037,0.00006676909,0.04025629,0.0007774897,0.9552874,0.0032270122,0.000020022037],"about_ca_topic_score_codex":0.00068507984,"about_ca_topic_score_gemma":0.00037628296,"teacher_disagreement_score":0.010568439,"about_ca_system_score_codex":0.0016763645,"about_ca_system_score_gemma":0.0014796983,"threshold_uncertainty_score":0.05589193},"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":"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.06809768,0.00052719004,0.9248439,0.00063285435,0.000099934805,0.00013345925,0.000039624036,0.00043693878,0.00518844],"genre_scores_gemma":[0.6791213,0.00050851144,0.31538367,0.00021959837,0.00011404235,0.00045257757,0.00011823398,0.00027703136,0.0038050117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841154,0.00082231354,0.0000883836,0.00025444754,0.00027054304,0.00015268751],"domain_scores_gemma":[0.99238014,0.005610737,0.00048909656,0.0006705196,0.00051289174,0.00033670026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050897757,0.00068551523,0.0011796936,0.00066836656,0.000663815,0.0018203607,0.0015352827,0.0012922068,0.0029352573],"category_scores_gemma":[0.022533093,0.00059353304,0.0005182402,0.0006922039,0.0017995319,0.0031085312,0.0018842696,0.0014049722,0.0006130671],"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.0002378995,0.00014444617,0.0010704492,0.00015872631,0.00004271397,0.00007919112,0.0001938055,0.72657955,0.0026174178,0.21978046,0.0015673144,0.047528066],"study_design_scores_gemma":[0.000014913392,0.00002210015,0.000041642437,0.0000068472345,0.0000029788691,0.0000063643215,0.000009501042,0.97025687,0.00044803476,0.028884793,0.00030053867,0.0000053893405],"about_ca_topic_score_codex":0.0015450432,"about_ca_topic_score_gemma":0.0011358821,"teacher_disagreement_score":0.0050897757,"about_ca_system_score_codex":0.0014391456,"about_ca_system_score_gemma":0.0011877171,"threshold_uncertainty_score":0.026917636},"labels":[],"label_agreement":null}]}