{"meta":{"query_hash":"48084415b210","filters":{"venue":"Transportmetrica B Transport Dynamics"},"cohort_total":15,"direct_labels_cover":0,"predictions_cover":15,"exported":15,"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/48084415b210","api":"https://metacan.xera.ac/api/v1/cohort?venue=Transportmetrica+B+Transport+Dynamics"},"results":[{"id":"W2417785606","doi":"10.1080/21680566.2016.1190674","title":"Agent-based day-to-day adjustment process to evaluate dynamic flexible transport service policies","year":2016,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Process (computing); Public transport; Computer science; Service (business); Transport engineering; Transit (satellite); Operations research; Simulation; Distributed computing; Engineering; Business","score_opus":0.023646396264594294,"score_gpt":0.3187395357384431,"score_spread":0.2950931394738488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417785606","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.41744143,0.00010805055,0.5587349,0.013447633,0.0009234904,0.002505772,0.0021698105,0.0013952891,0.0032736151],"genre_scores_gemma":[0.9872629,0.00025630122,0.004943647,0.0025059371,0.00013475894,0.00037192515,0.0013948034,0.00017564514,0.0029540844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9930098,0.00020528711,0.0014455857,0.0013871912,0.0022682243,0.0016839358],"domain_scores_gemma":[0.99617314,0.00036726892,0.00029981966,0.00078053516,0.00094077043,0.0014384845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018965236,0.0008112918,0.0008967938,0.0017361314,0.0007800622,0.000050964198,0.0011917955,0.00046128625,0.00065429515],"category_scores_gemma":[0.000094957555,0.000719503,0.0004116894,0.00764365,0.00023246858,0.0006230819,0.0000045903084,0.0003044537,0.00023321118],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001725869,0.0020974497,0.40656668,0.00082451664,0.0005237568,0.00027240365,0.07399704,0.4494584,0.00081873155,0.0128846895,0.00030769824,0.05052279],"study_design_scores_gemma":[0.0044634566,0.0006040418,0.9592896,0.0008756115,0.0010359831,0.000002792101,0.0029451915,0.0044474825,0.00055309106,0.0005410922,0.022482434,0.002759194],"about_ca_topic_score_codex":0.0026495766,"about_ca_topic_score_gemma":0.04959069,"teacher_disagreement_score":0.5698215,"about_ca_system_score_codex":0.00085445173,"about_ca_system_score_gemma":0.0014602913,"threshold_uncertainty_score":0.9995256},"labels":[],"label_agreement":null},{"id":"W2979160349","doi":"10.1080/21680566.2019.1670116","title":"Evolutionary game theoretical approach for equilibrium of cross-border traffic","year":2019,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Transportation Planning and Optimization","field":"Social Sciences","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 Windsor","funders":"","keywords":"Computer science; Replicator equation; Set (abstract data type); Stability (learning theory); Game theory; Quality (philosophy); Equilibrium point; Event (particle physics); Point (geometry); Mathematical economics; Mathematics; Machine learning","score_opus":0.010897622619555293,"score_gpt":0.32570630784414084,"score_spread":0.31480868522458555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979160349","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.692986,0.00019969416,0.28280813,0.00017061796,0.0004366374,0.001516349,0.0010069904,0.00031007995,0.020565504],"genre_scores_gemma":[0.9735959,0.00009628383,0.02069826,0.000043115095,0.00006790516,0.0000582274,0.0030779666,0.00006072609,0.0023015854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9970746,0.00005814719,0.00085259153,0.00058333017,0.0008018587,0.000629465],"domain_scores_gemma":[0.9984854,0.0002415461,0.00023127529,0.00033498634,0.00048243644,0.00022439723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072711555,0.0002866833,0.00055522093,0.0004437492,0.00016306403,0.000025691903,0.00037994885,0.00040142835,0.00076283194],"category_scores_gemma":[0.0000405918,0.00030268606,0.000421477,0.0017453532,0.0008595564,0.0004153431,0.0000020013767,0.00023582281,0.000007187784],"study_design_candidate":"observational","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.00068672805,0.0006622188,0.24413285,0.00038901035,0.000116650954,0.000005040757,0.0045038103,0.3319006,0.000023608563,0.41593254,0.000023171066,0.0016237779],"study_design_scores_gemma":[0.0081492625,0.0009134045,0.5603884,0.00014886336,0.0008476092,0.000008003619,0.0035810962,0.4045551,0.000081509854,0.0037015716,0.01541763,0.002207578],"about_ca_topic_score_codex":0.00011412004,"about_ca_topic_score_gemma":0.00008836025,"teacher_disagreement_score":0.41223097,"about_ca_system_score_codex":0.00012138501,"about_ca_system_score_gemma":0.00039908773,"threshold_uncertainty_score":0.99994254},"labels":[],"label_agreement":null},{"id":"W3180552384","doi":"10.1080/21680566.2021.1954562","title":"Customizing the following behavior models to mimic the weak lane based mixed traffic conditions","year":2021,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Traffic control and management","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Homogeneous; Traffic flow (computer networking); Computer science; Three-phase traffic theory; Simulation; Traffic speed; Flow (mathematics); Transport engineering; Engineering; Traffic congestion reconstruction with Kerner's three-phase theory; Mathematics; Traffic congestion; Physics; Statistical physics; Computer security","score_opus":0.012785496745615889,"score_gpt":0.20620702720238474,"score_spread":0.19342153045676885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180552384","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.73071826,0.00078939216,0.26007396,0.0019562359,0.0012375404,0.0014026269,0.0006368719,0.001110071,0.002075063],"genre_scores_gemma":[0.9967994,0.00009426265,0.0011870003,0.0003121209,0.000056566387,0.00039545685,0.0007549379,0.00010646802,0.00029379947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976485,0.000044446675,0.0006369184,0.0004571171,0.0005409854,0.00067205343],"domain_scores_gemma":[0.99872315,0.0001988106,0.000044922162,0.000754863,0.00007146846,0.0002067954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003281024,0.0004260341,0.0004717913,0.0003034489,0.00034745055,0.00006034378,0.0005703123,0.0001362661,0.00007234077],"category_scores_gemma":[0.000005683077,0.00031910982,0.0006066715,0.002086806,0.000058115216,0.00015520869,0.0000074429486,0.00046396052,0.000022014692],"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.000015364549,0.00015550772,0.00041452452,0.00005413419,0.00021576596,0.00026592598,0.00037020503,0.98604304,0.00014470922,0.0020997974,0.0002090247,0.010012033],"study_design_scores_gemma":[0.002597437,0.00006187386,0.08688347,0.000097052216,0.002423877,0.000022963006,0.0013235137,0.8915912,0.00010123794,0.00010058968,0.013733421,0.0010633464],"about_ca_topic_score_codex":0.00005603287,"about_ca_topic_score_gemma":0.0036899364,"teacher_disagreement_score":0.26608115,"about_ca_system_score_codex":0.00017649753,"about_ca_system_score_gemma":0.00009506412,"threshold_uncertainty_score":0.9999261},"labels":[],"label_agreement":null},{"id":"W3201842040","doi":"10.1080/21680566.2021.1981485","title":"Parking design and pricing for regular and autonomous vehicles: a morning commute problem","year":2021,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Smart Parking Systems Research","field":"Engineering","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":"York University","funders":"","keywords":"Parking guidance and information; Computer science; Scheme (mathematics); Transport engineering; Operations research; Traffic congestion; Class (philosophy); Mathematical optimization; Engineering; Mathematics; Artificial intelligence","score_opus":0.018316079952629072,"score_gpt":0.228377516258997,"score_spread":0.21006143630636792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201842040","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.35173538,0.002789248,0.6434238,0.00007813393,0.0001115942,0.0009796447,0.000082904044,0.00047570962,0.00032355147],"genre_scores_gemma":[0.9211345,0.000654253,0.07752694,0.00001863317,0.000046804194,0.00016652269,0.00017864445,0.00014502305,0.00012869979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761105,0.000059709753,0.0006814194,0.0005700159,0.0003616452,0.0007161934],"domain_scores_gemma":[0.9987258,0.00042985583,0.000068254485,0.0003852553,0.00014185384,0.00024899578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008491936,0.00038438512,0.00063216983,0.00044652107,0.0002453621,0.00007959475,0.00019441992,0.00023227076,0.000006317819],"category_scores_gemma":[0.000019355683,0.00043719728,0.00012448663,0.0010109096,0.00010582279,0.00020552968,0.000010718565,0.0004041055,0.0000012502143],"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.00041450767,0.00038915887,0.3835453,0.012503437,0.0019786854,0.001870669,0.009253194,0.41215736,0.016342096,0.0065452456,0.0001703669,0.15482996],"study_design_scores_gemma":[0.0023289614,0.00017469245,0.058584996,0.00048265565,0.00032943187,0.00023855008,0.00033128046,0.9264153,0.002467221,0.00052944856,0.0070666005,0.0010508378],"about_ca_topic_score_codex":0.000038548867,"about_ca_topic_score_gemma":0.00010327472,"teacher_disagreement_score":0.56939906,"about_ca_system_score_codex":0.00019010814,"about_ca_system_score_gemma":0.00010971326,"threshold_uncertainty_score":0.99980795},"labels":[],"label_agreement":null},{"id":"W3217020849","doi":"10.1080/21680566.2021.2004954","title":"Can motorcyclist behavior in traffic conflicts be modeled? A deep reinforcement learning approach for motorcycle-pedestrian interactions","year":2021,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Traffic control and management","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Reinforcement learning; Microsimulation; Computer science; Pedestrian; Markov decision process; Function (biology); Markov process; Trajectory; Reinforcement; Artificial intelligence; Operations research; Simulation; Machine learning; Transport engineering; Engineering; Mathematics; Statistics","score_opus":0.015996337531344638,"score_gpt":0.22399018193082632,"score_spread":0.20799384439948168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217020849","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.46039462,0.000355803,0.53301793,0.00017212925,0.00042991698,0.0020569516,0.00025704358,0.00079251936,0.002523079],"genre_scores_gemma":[0.98893696,0.00040257562,0.0039341436,0.000055969507,0.00006253161,0.0011637511,0.004498451,0.0001383382,0.00080729614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970275,0.000025941175,0.0010324236,0.00066193036,0.00041536364,0.00083682215],"domain_scores_gemma":[0.9989903,0.0000840066,0.00009329283,0.0004324764,0.0001146775,0.00028526437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020537533,0.00053394696,0.000720454,0.0007225241,0.00021511824,0.000041078467,0.00030487147,0.00020908056,0.000060157847],"category_scores_gemma":[0.000013123838,0.00063358346,0.0004508239,0.0013904553,0.000052517433,0.00021546993,0.000009529781,0.0006244538,0.0000011819587],"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.00009965117,0.00050865917,0.0022455442,0.00036083805,0.00016916728,0.00015509962,0.00095835887,0.9845721,0.00009084322,0.0006477765,0.0000069893986,0.010184953],"study_design_scores_gemma":[0.003064725,0.0001316291,0.016547576,0.000031487452,0.00045082532,0.000013772649,0.00043818427,0.9718701,0.000027810158,0.000007651964,0.006745213,0.0006709776],"about_ca_topic_score_codex":0.00018891791,"about_ca_topic_score_gemma":0.0077566956,"teacher_disagreement_score":0.5290838,"about_ca_system_score_codex":0.00053404574,"about_ca_system_score_gemma":0.00008380469,"threshold_uncertainty_score":0.99961156},"labels":[],"label_agreement":null},{"id":"W4212989006","doi":"10.1080/21680566.2022.2034550","title":"‘Wild Your weekends' promotion and its effect on traffic recovery during COVID-19 pandemic","year":2022,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Aviation Industry Analysis and Trends","field":"Economics, Econometrics and Finance","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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Ticket; China; TRIPS architecture; Revenue; Promotion (chess); Market liquidity; Business; Advertising; Coronavirus disease 2019 (COVID-19); Demographic economics; Economics; Finance; Geography; Political science; Transport engineering; Engineering; Medicine","score_opus":0.04372023122339457,"score_gpt":0.2487801594428133,"score_spread":0.2050599282194187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212989006","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.9908731,0.00090814027,0.0021392596,0.0008658894,0.0003272946,0.0004822146,0.0026622328,0.00024174919,0.0015001359],"genre_scores_gemma":[0.99563706,0.00043465174,0.00003728249,0.00017514077,0.000067970876,0.00017841569,0.0013874535,0.00007274794,0.0020092684],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99692184,0.00006750601,0.0011617643,0.0010556158,0.00024309852,0.00055019354],"domain_scores_gemma":[0.998521,0.000119016004,0.0005310018,0.00040933173,0.000024882007,0.00039482708],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00112185,0.00042769482,0.00085162005,0.0015612586,0.00083177205,0.000035691897,0.00034374138,0.0002319834,0.0015648146],"category_scores_gemma":[0.000051113188,0.0005131397,0.00043291075,0.0024724994,0.00005166673,0.00028818677,0.000015334077,0.00083494885,0.000040981722],"study_design_candidate":"observational","study_design_consensus":"observational","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.00047057105,0.000675633,0.8874016,0.00025333095,0.00035962823,0.00017808832,0.0005105252,0.094082095,0.000012808427,0.012238869,0.00002265287,0.0037942387],"study_design_scores_gemma":[0.0068489457,0.0028212133,0.93831724,0.000032046097,0.00044241076,0.00017036418,0.00022321135,0.037744112,0.00002855901,0.0016109371,0.009858458,0.0019025211],"about_ca_topic_score_codex":0.000096148324,"about_ca_topic_score_gemma":0.000111330846,"teacher_disagreement_score":0.05633798,"about_ca_system_score_codex":0.00082481507,"about_ca_system_score_gemma":0.0000640193,"threshold_uncertainty_score":0.999732},"labels":[],"label_agreement":null},{"id":"W4391103897","doi":"10.1080/21680566.2024.2303042","title":"A framework for transportation and land use integration as a parallel constrained multiple discrete-continuous extreme value (PC-MDCEV) home production model","year":2024,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Urban Transport and Accessibility","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Production (economics); Discrete choice; Consumption (sociology); Computer science; Empirical research; Function (biology); Land use; Scale (ratio); Value (mathematics); Extreme value theory; Subdivision; Econometrics; Economics; Microeconomics; Operations research; Mathematics; Engineering","score_opus":0.03788527699173939,"score_gpt":0.30139893950117747,"score_spread":0.2635136625094381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391103897","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.5110351,0.00044901925,0.48334745,0.0008703185,0.0004828181,0.0016490524,0.0015038969,0.0005259569,0.00013642044],"genre_scores_gemma":[0.9574703,0.0007975132,0.03694301,0.0000744846,0.00024319514,0.00029105615,0.0031747133,0.00010976992,0.00089597586],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.995767,0.00007449966,0.0011267782,0.0013618191,0.0008147878,0.00085510564],"domain_scores_gemma":[0.9981929,0.00054403156,0.00019882004,0.00041630358,0.00025931816,0.00038863448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009619843,0.00059771875,0.0007577975,0.0007548027,0.0006387315,0.00026850254,0.0003395978,0.00062552013,0.000048477457],"category_scores_gemma":[0.00017549102,0.0005786802,0.0005042794,0.0022423973,0.00068164384,0.0017686364,0.000002162611,0.0006300667,0.0000033109588],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018071351,0.000723201,0.67200845,0.0010882764,0.0004154836,0.00016712915,0.027454749,0.007188173,0.00027854744,0.26047373,0.00003782425,0.028357284],"study_design_scores_gemma":[0.0035908823,0.000623164,0.5669498,0.0012227678,0.0026917777,0.000009553827,0.0036611957,0.27151144,0.000157684,0.1432726,0.0031898406,0.0031193153],"about_ca_topic_score_codex":0.003190101,"about_ca_topic_score_gemma":0.030343384,"teacher_disagreement_score":0.4464352,"about_ca_system_score_codex":0.00024314974,"about_ca_system_score_gemma":0.00052487606,"threshold_uncertainty_score":0.99966645},"labels":[],"label_agreement":null},{"id":"W4391896886","doi":"10.1080/21680566.2024.2314762","title":"Modelling motorized and non-motorized vehicle conflicts using multiagent inverse reinforcement learning approach","year":2024,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Traffic control and management","field":"Engineering","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 British Columbia; University Canada West","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Reinforcement; Engineering; Structural engineering","score_opus":0.0156784005057284,"score_gpt":0.2035005589986131,"score_spread":0.1878221584928847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391896886","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.34395483,0.0007362867,0.65223706,0.000013262959,0.00041350003,0.00068125996,0.000027403787,0.00091030565,0.0010261023],"genre_scores_gemma":[0.98481965,0.0013187187,0.012946151,0.00001743478,0.0000922333,0.00006931655,0.00028178954,0.00013836185,0.0003163206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975125,0.000017017615,0.00073184265,0.0006015216,0.00047953438,0.0006575862],"domain_scores_gemma":[0.9992734,0.00005361193,0.000047754085,0.00028544635,0.000048879374,0.00029088848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003303396,0.0005122291,0.000584931,0.0006643026,0.00014696183,0.000067747875,0.00020157288,0.00020672132,0.000028896031],"category_scores_gemma":[0.0000026789357,0.0005336856,0.0002535997,0.0011062599,0.00006726065,0.00031085187,0.000010304508,0.0005720751,0.0000072045727],"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.0000675571,0.000050027073,0.0004111993,0.0009035921,0.00034717054,0.00013609907,0.0012049986,0.9916438,0.0013675671,0.0005520095,0.000003745396,0.003312239],"study_design_scores_gemma":[0.0017194893,0.000063203785,0.000534893,0.0001073984,0.00045852648,0.0000059337585,0.000140929,0.98998785,0.00002833352,0.000013056579,0.006373378,0.0005670166],"about_ca_topic_score_codex":0.000303684,"about_ca_topic_score_gemma":0.000027484522,"teacher_disagreement_score":0.64086485,"about_ca_system_score_codex":0.00029979972,"about_ca_system_score_gemma":0.00004149417,"threshold_uncertainty_score":0.99971145},"labels":[],"label_agreement":null},{"id":"W4392242281","doi":"10.1080/21680566.2024.2315509","title":"Second-based queue length estimation with fusing MMW and low penetration rate CAV trajectory data","year":2024,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":2,"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 Alberta","funders":"Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Queue; Trajectory; Penetration (warfare); Computer science; Mathematics; Physics; Computer network; Operations research","score_opus":0.009545267474915995,"score_gpt":0.20850791486849685,"score_spread":0.19896264739358085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392242281","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.14149056,0.00056824915,0.8490762,0.00007893094,0.00025594127,0.0004974001,0.00065672427,0.0060023526,0.0013736412],"genre_scores_gemma":[0.9843666,0.0004455566,0.011267361,0.000048433,0.00003634759,0.000035215722,0.0036532835,0.00009859874,0.00004858828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841875,0.000018883335,0.00043364058,0.00054214825,0.0002771828,0.00030941307],"domain_scores_gemma":[0.99926084,0.000063117215,0.000034614965,0.00048202096,0.000032325785,0.00012710497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034800757,0.00034040128,0.00028253102,0.00071594404,0.00008607955,0.00008833995,0.00024933362,0.00015616509,0.000048717997],"category_scores_gemma":[0.0000028620152,0.00033472103,0.000057790483,0.0011376783,0.00007955689,0.00075813325,0.000003766053,0.00034255156,0.0000036694312],"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.0002930091,0.00039621635,0.0073373583,0.009138619,0.00095787627,0.00096777926,0.001126583,0.61782837,0.0017922119,0.0069830725,0.0020269726,0.35115194],"study_design_scores_gemma":[0.0004366008,0.00008234163,0.025629152,0.00018585334,0.00025001768,0.000009675265,0.000027803597,0.97073656,0.00027285362,0.000020202073,0.00195984,0.00038911248],"about_ca_topic_score_codex":0.000039532246,"about_ca_topic_score_gemma":0.0017408691,"teacher_disagreement_score":0.8428761,"about_ca_system_score_codex":0.00013307323,"about_ca_system_score_gemma":0.00008712773,"threshold_uncertainty_score":0.9999105},"labels":[],"label_agreement":null},{"id":"W4403451844","doi":"10.1080/21680566.2024.2416181","title":"Bayesian inference for link travel time correlation of a bus route","year":2024,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Link (geometry); Inference; Travel time; Computer science; Transport engineering; Bayesian probability; Correlation; Statistics; Engineering; Artificial intelligence; Mathematics; Computer network","score_opus":0.012818783977917126,"score_gpt":0.2818648155491053,"score_spread":0.26904603157118817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403451844","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.014997851,0.00034972717,0.97515607,0.00072795036,0.0004987873,0.0008185688,0.0015026226,0.00041585765,0.0055325744],"genre_scores_gemma":[0.9828814,0.0003565701,0.010802861,0.000029992278,0.00011631486,0.00004951533,0.0032321764,0.000054405766,0.0024767625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976862,0.00004121739,0.0008019961,0.00046493404,0.00057554885,0.00043008543],"domain_scores_gemma":[0.9987154,0.00047127582,0.00015097464,0.00019952362,0.00027434833,0.0001884703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000687053,0.0002511579,0.0004195323,0.00067585835,0.00025269773,0.000042263982,0.0002727257,0.00034170612,0.00019531224],"category_scores_gemma":[0.000053249016,0.0002713124,0.00031957254,0.0021966088,0.000212167,0.00042983962,9.099007e-7,0.00023745444,0.0000121791945],"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.00063678686,0.0004996753,0.20561424,0.0014434523,0.0005134796,0.00013251076,0.043971557,0.15451697,0.00015345735,0.5079878,0.00014935869,0.084380716],"study_design_scores_gemma":[0.0018070703,0.00043471108,0.19790764,0.00065315986,0.0012457873,0.00000372945,0.0012363861,0.7723273,0.000110521134,0.007405191,0.015573063,0.0012954337],"about_ca_topic_score_codex":0.0009261298,"about_ca_topic_score_gemma":0.0019065222,"teacher_disagreement_score":0.9678835,"about_ca_system_score_codex":0.00014634193,"about_ca_system_score_gemma":0.000574214,"threshold_uncertainty_score":0.9999739},"labels":[],"label_agreement":null},{"id":"W4413960842","doi":"10.1080/21680566.2025.2551921","title":"Coordinated dual-objective transit signal priority: a deep reinforcement learning approach","year":2025,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Reinforcement; Dual (grammatical number); Transit (satellite); Computer science; Transport engineering; SIGNAL (programming language); Engineering; Artificial intelligence; Psychology; Public transport; Social psychology","score_opus":0.007984579967808603,"score_gpt":0.226804790625728,"score_spread":0.2188202106579194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413960842","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.0859578,0.00064789335,0.86924917,0.000045061992,0.00037350363,0.0013323567,0.0000410593,0.0014669044,0.040886275],"genre_scores_gemma":[0.99535286,0.0002201523,0.001298062,0.0000228428,0.000060819242,0.00022226344,0.0008565801,0.00013616338,0.0018302357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959922,0.000090526395,0.0011382329,0.00076553633,0.0008853615,0.0011281763],"domain_scores_gemma":[0.99869066,0.00016269751,0.00008403747,0.00052745757,0.00025655594,0.00027857453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007357296,0.00065931276,0.0009343891,0.0018094535,0.0003012272,0.000060317274,0.00048258685,0.00046373755,0.00011530335],"category_scores_gemma":[0.000017416625,0.0007328341,0.00041855237,0.0055587795,0.00015848949,0.00028295012,0.000009431832,0.0013628927,0.00002266429],"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.00018513524,0.00018698488,0.042193003,0.0011337448,0.00082818,0.0001792099,0.0012119483,0.9442528,0.00042785984,0.0019053245,0.000043234428,0.0074525713],"study_design_scores_gemma":[0.0021761989,0.00016131242,0.04092883,0.00016024601,0.0003469394,0.000023059114,0.00042142835,0.95080423,0.00062645506,0.000070260656,0.0033964913,0.00088454253],"about_ca_topic_score_codex":0.00027125634,"about_ca_topic_score_gemma":0.00029254664,"teacher_disagreement_score":0.9093951,"about_ca_system_score_codex":0.0008701068,"about_ca_system_score_gemma":0.00019516202,"threshold_uncertainty_score":0.99951226},"labels":[],"label_agreement":null},{"id":"W4414033356","doi":"10.1080/21680566.2025.2551913","title":"An enhanced approximate dynamic programming approach to on-demand ride-Pooling","year":2025,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Transportation and Mobility Innovations","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Pooling; Dynamic programming; Computer science; On demand; Computer security; Artificial intelligence; Algorithm; Multimedia","score_opus":0.007258102807373965,"score_gpt":0.24661696842520117,"score_spread":0.2393588656178272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414033356","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.3268666,0.00005618308,0.6629329,0.000075252705,0.00031406927,0.0011104554,0.00029647077,0.0013870886,0.0069610365],"genre_scores_gemma":[0.9653143,0.00008091008,0.0313377,0.0002349277,0.000021396207,0.00042312295,0.0022782905,0.000117354626,0.00019199718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667543,0.000021941172,0.001137932,0.0008504793,0.00048246214,0.0008317574],"domain_scores_gemma":[0.9984893,0.000059094033,0.00006810631,0.0008590514,0.00018452831,0.0003399132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003825213,0.000614322,0.00066635816,0.0015887589,0.00023443496,0.000060238,0.0005854421,0.00030613033,0.00002254775],"category_scores_gemma":[0.000008008911,0.00067889824,0.0002541328,0.005298541,0.00009418953,0.0003177086,0.000002621434,0.00058687344,0.00001416744],"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.00021986749,0.0015393043,0.008463117,0.0008947819,0.00032624524,0.00002551683,0.0018719984,0.88010347,0.0018602845,0.037198313,0.000028790135,0.067468286],"study_design_scores_gemma":[0.0040482176,0.00049702154,0.28390244,0.0004142427,0.00082111295,0.000010684229,0.0013223356,0.6953743,0.004343511,0.0011378207,0.005065824,0.0030624806],"about_ca_topic_score_codex":0.000035181598,"about_ca_topic_score_gemma":0.00042015567,"teacher_disagreement_score":0.6384477,"about_ca_system_score_codex":0.00031204423,"about_ca_system_score_gemma":0.00010050215,"threshold_uncertainty_score":0.9995662},"labels":[],"label_agreement":null},{"id":"W4415300083","doi":"10.1080/21680566.2025.2561863","title":"Learning heuristics for transit network design and improvement with deep reinforcement learning","year":2025,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Heuristics; Learning network; Network planning and design; Public transport; Transit (satellite)","score_opus":0.009609201457943787,"score_gpt":0.246766158077909,"score_spread":0.23715695661996522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415300083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0140971,0.00022090308,0.9817715,0.0003666778,0.00016456474,0.0014451225,0.000011097367,0.00034713472,0.0015758637],"genre_scores_gemma":[0.9436359,0.0010293984,0.05206836,0.00012349039,0.0000545675,0.00014043962,0.00071462244,0.00004592775,0.00218729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755734,0.00009048321,0.00063726335,0.00053265045,0.00047657665,0.00070569385],"domain_scores_gemma":[0.9987687,0.00040942722,0.00019333848,0.00014730521,0.00027868242,0.00020252987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001130313,0.00032574832,0.00043800214,0.00036255334,0.0012945111,0.000064825,0.000199814,0.0002338435,0.000028101736],"category_scores_gemma":[0.000037950136,0.00033194828,0.00012438645,0.0016699296,0.00022502751,0.00021032576,0.0000017676946,0.00040670286,6.893768e-7],"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.00051239243,0.000053514214,0.050370086,0.00013646303,0.00013327946,0.000013375742,0.0045806975,0.9141099,0.0000030949573,0.01853008,0.000010593452,0.011546528],"study_design_scores_gemma":[0.007006247,0.0025736461,0.043290567,0.0004696048,0.0020735862,0.00000237781,0.010453163,0.9022661,0.000054859825,0.001568512,0.028543415,0.0016979473],"about_ca_topic_score_codex":0.00041860825,"about_ca_topic_score_gemma":0.0022394976,"teacher_disagreement_score":0.9297032,"about_ca_system_score_codex":0.00016387834,"about_ca_system_score_gemma":0.0003075125,"threshold_uncertainty_score":0.9999133},"labels":[],"label_agreement":null},{"id":"W4416306420","doi":"10.1080/21680566.2025.2582570","title":"Path flow reconstruction under sparse automatic vehicle identification coverage and limited probe vehicle penetration","year":2025,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Traffic control and management","field":"Engineering","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":"Ministry of Education and Child Care","funders":"National Natural Science Foundation of China","keywords":"Identification (biology); Path (computing); Penetration (warfare); Flow (mathematics); Vehicle safety; Vehicle tracking system","score_opus":0.005652245906207689,"score_gpt":0.18488393098432326,"score_spread":0.17923168507811557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416306420","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.60955656,0.00035542448,0.386981,0.0001625608,0.00042236387,0.00063698454,0.0000826489,0.0007216054,0.0010808661],"genre_scores_gemma":[0.9967804,0.00073251006,0.0016405262,0.00005683556,0.000022666107,0.00006343889,0.00040587896,0.00003962544,0.00025812132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833006,0.000021120324,0.0006729805,0.00039949105,0.00025051084,0.00032585746],"domain_scores_gemma":[0.99939597,0.00004787101,0.00007144517,0.0003213275,0.000065345026,0.00009807044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021623372,0.00028678135,0.00032933598,0.00054327486,0.00011806945,0.000056678193,0.00014519598,0.00016856883,0.000035719553],"category_scores_gemma":[0.00000552113,0.00031810076,0.00011071796,0.001304349,0.00005911622,0.00034369554,0.0000037551224,0.00022400751,0.000008549255],"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.00009454493,0.00031860723,0.029679673,0.0015519166,0.00047621148,0.00003886395,0.00037684268,0.3090232,0.002738546,0.012868594,0.000060611674,0.6427724],"study_design_scores_gemma":[0.00084056455,0.000025188652,0.43770328,0.0000574864,0.00020202715,0.0000026157531,0.00005294484,0.55995876,0.00007117118,0.0007360808,0.00013709372,0.00021278774],"about_ca_topic_score_codex":0.000037975286,"about_ca_topic_score_gemma":0.00045303695,"teacher_disagreement_score":0.6425596,"about_ca_system_score_codex":0.00019947762,"about_ca_system_score_gemma":0.00004010329,"threshold_uncertainty_score":0.9999271},"labels":[],"label_agreement":null},{"id":"W4416614509","doi":"10.1080/21680566.2025.2585060","title":"Arrival flow profile estimation and prediction for urban arterials using license plate recognition data","year":2025,"lang":"en","type":"article","venue":"Transportmetrica B Transport Dynamics","topic":"Vehicle License Plate Recognition","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Transportation of Ontario","funders":"National Natural Science Foundation of China","keywords":"License; Estimation; Arrival time; Flow network; Traffic flow (computer networking); Flow (mathematics); Time of arrival","score_opus":0.031469337495286256,"score_gpt":0.2482983386708503,"score_spread":0.21682900117556403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416614509","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.44527987,0.00013222183,0.54262376,0.00003327215,0.00054021896,0.0010458075,0.009553786,0.0005256201,0.0002654318],"genre_scores_gemma":[0.8945828,0.0003427237,0.07862362,0.000027127977,0.00010986248,0.00009413938,0.02610534,0.0000869178,0.000027440958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979629,0.000023237802,0.0007853634,0.00058289454,0.00022407393,0.0004215432],"domain_scores_gemma":[0.9990646,0.0001358318,0.00009609321,0.0004544951,0.00012481379,0.00012413909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041424233,0.00035784568,0.00045701966,0.0006649964,0.00016676451,0.000049255035,0.0002042321,0.00032251934,0.00003347821],"category_scores_gemma":[0.000029601333,0.00042481977,0.00009196194,0.0010187847,0.00005841378,0.00077020965,0.0000070632527,0.00023127046,0.0000048758297],"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.0018206913,0.0006605181,0.01863922,0.007341332,0.0017022083,0.00009048144,0.0013306326,0.17473991,0.015852837,0.00035948466,0.0009728062,0.77648985],"study_design_scores_gemma":[0.0014227658,0.000060105707,0.009696666,0.00022815318,0.0007079154,0.000016252437,0.00003591197,0.9856771,0.0010504337,0.00039935773,0.00033602698,0.00036930927],"about_ca_topic_score_codex":0.000029744808,"about_ca_topic_score_gemma":0.00010176692,"teacher_disagreement_score":0.81093717,"about_ca_system_score_codex":0.00017802799,"about_ca_system_score_gemma":0.00006468479,"threshold_uncertainty_score":0.99982035},"labels":[],"label_agreement":null}]}