{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575754,0.0002183009,0.0006825914,0.0002880416,0.0001437034,0.0000104084,0.0003401677,0.0001419841,0.0002483803],"category_scores_gemma":[0.0001369801,0.0002193469,0.0002581307,0.0002540668,0.0004180633,0.0001347056,0.0002101955,0.000198076,7.85522e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006554799,"about_ca_system_score_gemma":0.00004773399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000848905,"about_ca_topic_score_gemma":0.0002076714,"domain_scores_codex":[0.9985086,0.0001051204,0.0003011686,0.0003185726,0.0003904452,0.00037607],"domain_scores_gemma":[0.9983693,0.0004018632,0.0003688055,0.000439684,0.0002721027,0.0001482506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"qualitative","study_design_scores_codex":[0.02619653,0.004848119,0.1161161,0.005169269,0.00883165,0.003091149,0.4594728,0.002401348,0.06242522,0.08523907,0.004003869,0.2222049],"study_design_scores_gemma":[0.03702886,0.001148792,0.01501566,0.001517198,0.001910993,0.0002452845,0.7207028,0.01306737,0.1896852,0.008850376,0.007387565,0.003439921],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6139188,0.00003385552,0.3818664,0.00002768367,0.0000600299,0.0001621917,0.00002789466,0.00003606777,0.003867032],"genre_scores_gemma":[0.5896956,0.000008171865,0.4084606,0.000007351106,0.00003280908,1.755586e-7,0.000005250059,0.00001928087,0.001770745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.26123,"threshold_uncertainty_score":0.8944709,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002471542,0.0002120418,0.0003673461,0.0000715054,0.0002394068,0.00003063054,0.0003540872,0.0001002306,0.006412331],"category_scores_gemma":[0.00003951595,0.0002750095,0.0001822087,0.0001894784,0.0002534613,0.0001238159,0.0002556102,0.000243034,0.0015792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006632136,"about_ca_system_score_gemma":0.00007267914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001620892,"about_ca_topic_score_gemma":0.00002014724,"domain_scores_codex":[0.9986796,0.0001124357,0.000178735,0.0004104852,0.0002015862,0.0004171717],"domain_scores_gemma":[0.9989983,0.0001216006,0.0001413653,0.0003689568,0.0001229181,0.000246806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003021234,0.0002141617,0.003934627,0.0001045943,0.0001357715,0.000005986054,0.00204921,0.0003748715,0.0002717756,0.9012687,0.0006006729,0.09100943],"study_design_scores_gemma":[0.005329885,0.000525185,0.01867679,0.0009850693,0.0008875419,0.000005606475,0.02251297,0.3970904,0.00094891,0.1724917,0.3785935,0.00195249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4305939,0.0000656071,0.5575949,0.001158042,0.0007682568,0.0002165059,0.0001879631,0.00002650758,0.009388291],"genre_scores_gemma":[0.9849032,0.00001072998,0.006316911,0.00002735871,0.0001672218,3.947383e-7,0.00002631546,0.00002103502,0.008526811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.728777,"threshold_uncertainty_score":0.9999702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}