{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"793d55408e16","filters":{"venue":"MIMS EPrints (University of Southampton)"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter Neal","is_ca":true},{"name":"Gareth O. Roberts","is_ca":false},{"name":"Wai Kong Yuen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02672775531838749,"gpt":0.2668259879196557,"spread":0.2400982326012682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005089776,0.0006855152,0.001179694,0.0006683666,0.000663815,0.001820361,0.001535283,0.001292207,0.002935257],"category_scores_gemma":[0.02253309,0.000593533,0.0005182402,0.0006922039,0.001799532,0.003108531,0.00188427,0.001404972,0.0006130671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001439146,"about_ca_system_score_gemma":0.001187717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001545043,"about_ca_topic_score_gemma":0.001135882,"domain_scores_codex":[0.9984115,0.0008223135,0.0000883836,0.0002544475,0.000270543,0.0001526875],"domain_scores_gemma":[0.9923801,0.005610737,0.0004890966,0.0006705196,0.0005128917,0.0003367003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002378995,0.0001444462,0.001070449,0.0001587263,0.00004271397,0.00007919112,0.0001938055,0.7265795,0.002617418,0.2197805,0.001567314,0.04752807],"study_design_scores_gemma":[0.00001491339,0.00002210015,0.00004164244,0.000006847235,0.000002978869,0.000006364322,0.000009501042,0.9702569,0.0004480348,0.02888479,0.0003005387,0.00000538934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06809768,0.00052719,0.9248439,0.0006328544,0.0000999348,0.0001334593,0.00003962404,0.0004369388,0.00518844],"genre_scores_gemma":[0.6791213,0.0005085114,0.3153837,0.0002195984,0.0001140423,0.0004525776,0.000118234,0.0002770314,0.003805012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005089776,"threshold_uncertainty_score":0.02691764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Martin Adamčík","is_ca":true},{"name":"George Wilmers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00888510744964488,"gpt":0.192987424474072,"spread":0.1841023170244271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01056844,0.0007905738,0.0008695932,0.003056149,0.001928174,0.003351425,0.002796715,0.002142123,0.006210594],"category_scores_gemma":[0.0220976,0.0005684367,0.002208108,0.002081364,0.005862236,0.01015557,0.005251525,0.002993284,0.0006048056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001676364,"about_ca_system_score_gemma":0.001479698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006850798,"about_ca_topic_score_gemma":0.000376283,"domain_scores_codex":[0.9945241,0.00185652,0.0003668976,0.001023317,0.001807678,0.0004214673],"domain_scores_gemma":[0.9875123,0.00810036,0.001533509,0.001282895,0.001064909,0.0005060352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001467569,0.000008531531,0.0001621104,0.00003736248,0.00001482929,0.00005921282,0.0001848298,0.004143099,0.0005796933,0.9855258,0.0003419168,0.008927902],"study_design_scores_gemma":[0.000009240934,0.00002556173,0.0001604448,0.00002148862,0.00001929804,0.0001290004,0.00006676909,0.04025629,0.0007774897,0.9552874,0.003227012,0.00002002204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01570522,0.000395086,0.9676111,0.0009643926,0.00006079387,0.00009111631,0.0001063926,0.0001818515,0.01488414],"genre_scores_gemma":[0.5418571,0.0008860068,0.4459733,0.0006890798,0.0005442255,0.000486908,0.0002658616,0.0001629571,0.009134607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01056844,"threshold_uncertainty_score":0.05589193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}