{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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"},"query_hash":"b216ec680370","filters":{"venue":"International Conference on Automated Planning and Scheduling"}},"results":[{"id":"W96218255","doi":"","title":"Multiple pattern databases","year":2004,"lang":"en","type":"article","venue":"International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Database; Heuristic; Database theory; Spatiotemporal database; Table (database); Data mining; Database index; Database design; Information retrieval; Database testing; View; Artificial intelligence; Search engine indexing","retraction":null,"screen_n_in":null,"score":{"opus":0.06923126931246268,"gpt":0.3196638010682992,"spread":0.2504325317558365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002557623,0.0001836075,0.0001456451,0.0001843277,0.0002119531,0.0003681014,0.0005285708,0.00006067706,0.00001930488],"category_scores_gemma":[0.000136112,0.0001740358,0.00003190404,0.0001168473,0.0000341787,0.0004083139,0.0001407481,0.0002715956,0.00006094244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003843508,"about_ca_system_score_gemma":0.00009340949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001462871,"about_ca_topic_score_gemma":0.000004918665,"domain_scores_codex":[0.9987291,0.00003816699,0.0002347645,0.0004287689,0.0003111534,0.0002580183],"domain_scores_gemma":[0.9992778,0.0001706096,0.0001146235,0.0002185771,0.0001067983,0.0001115904],"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.0001365584,0.0003874721,0.1125955,0.0001107714,0.0003622887,0.00116602,0.00880451,0.4416777,0.01368333,0.3539938,0.0008899357,0.06619215],"study_design_scores_gemma":[0.0007251328,0.00006708072,0.003624028,0.0006915828,0.00000406126,0.0000608544,0.0001289976,0.9911662,0.00171405,0.001277339,0.0002759536,0.0002647157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3468181,0.0001506912,0.6435297,0.002741048,0.0007101087,0.00009169312,0.00003718775,0.001682688,0.004238721],"genre_scores_gemma":[0.9534979,0.00001048643,0.04575404,0.0005332346,0.00006529952,0.000007903098,0.00007689698,0.000009698584,0.00004456373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6066797,"threshold_uncertainty_score":0.7096974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W45766481","doi":"","title":"Efficient ADD operations for point-based algorithms","year":2008,"lang":"en","type":"article","venue":"International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Representation (politics); Locality; Point (geometry); Reachability; Algorithm; Set (abstract data type); State (computer science); Set operations; State space; Current (fluid); Theoretical computer science; Backup; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1006869758632335,"gpt":0.3620534760597721,"spread":0.2613665001965386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003789508,0.0001307779,0.0001188531,0.0001947282,0.0003211692,0.0001847784,0.0004288948,0.00007034414,0.0000149664],"category_scores_gemma":[0.0002674946,0.0001257416,0.00003857649,0.0001285151,0.00005344624,0.0001502658,0.00004558666,0.0001353554,0.00001522922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004251767,"about_ca_system_score_gemma":0.0001218308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009569053,"about_ca_topic_score_gemma":3.960756e-7,"domain_scores_codex":[0.9989168,0.00005150713,0.0002477613,0.0003363951,0.00026806,0.0001794521],"domain_scores_gemma":[0.9992356,0.0001302781,0.0000755695,0.0001944202,0.0002903756,0.00007371644],"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.0000469344,0.0001039588,0.000292803,0.00001329941,0.00003507284,0.0000177155,0.001298402,0.6997483,0.003211226,0.2909789,0.0001558193,0.004097558],"study_design_scores_gemma":[0.0004487349,0.00008863267,0.00111725,0.00009851054,0.00000268113,0.00003159655,0.00006989132,0.9948984,0.002813167,0.0001926282,0.0000878847,0.0001506566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1319119,0.00002690933,0.8648109,0.0006391821,0.0005692799,0.0001533781,0.00001663564,0.0005951311,0.001276711],"genre_scores_gemma":[0.5384413,0.000001591116,0.4612396,0.0001836375,0.00003343989,0.00003231556,0.00002180008,0.000004914827,0.00004137706],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4065295,"threshold_uncertainty_score":0.5127593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W12713029","doi":"10.1385/bter:91:1:57","title":"Temporally-expressive planning as constraint satisfaction problems","year":2007,"lang":"en","type":"article","venue":"International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Planner; Semantics (computer science); Encoding (memory); Constraint programming; Constraint (computer-aided design); Automated planning and scheduling; Constraint satisfaction; Focus (optics); Scheduling (production processes); Temporal logic; Artificial intelligence; Theoretical computer science; Programming language; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04623718749288479,"gpt":0.3259850224904252,"spread":0.2797478349975404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009584041,0.0002861286,0.0002322044,0.0003753922,0.0003546975,0.0005948283,0.0004893728,0.0001853099,0.00004177764],"category_scores_gemma":[0.0001820549,0.0002788834,0.00005001864,0.0001933254,0.00007652828,0.0005144723,0.0001219832,0.0005419379,0.00004950007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007113017,"about_ca_system_score_gemma":0.0001484329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001400477,"about_ca_topic_score_gemma":0.000003183954,"domain_scores_codex":[0.9979061,0.00007074433,0.0004753517,0.0005873049,0.0005189601,0.0004414832],"domain_scores_gemma":[0.9986692,0.0003598909,0.000320896,0.0002151321,0.000234406,0.0002004695],"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.0003971017,0.0001872148,0.1777105,0.0001587373,0.0005480956,0.001849407,0.02163399,0.218128,0.05855766,0.4597526,0.001276351,0.05980043],"study_design_scores_gemma":[0.0007819621,0.0002361297,0.01868661,0.001829825,0.00001026004,0.0002826905,0.001037238,0.9684923,0.002735276,0.00495938,0.0003946226,0.0005536936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5996823,0.0002599278,0.3627729,0.00119042,0.001033084,0.0002290782,0.00001266458,0.002077111,0.03274252],"genre_scores_gemma":[0.9608635,0.000006335435,0.03844847,0.0003800272,0.00009978866,0.000009744017,0.0000399871,0.00001579552,0.0001363877],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7503644,"threshold_uncertainty_score":0.9999663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}