{"meta":{"query_hash":"b216ec680370","filters":{"venue":"International Conference on Automated Planning and Scheduling"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/b216ec680370","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Automated+Planning+and+Scheduling"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04623718749288479,"score_gpt":0.32598502249042516,"score_spread":0.27974783499754036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12713029","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.5996823,0.0002599278,0.3627729,0.0011904201,0.0010330835,0.00022907818,0.000012664576,0.002077111,0.032742515],"genre_scores_gemma":[0.9608635,0.0000063354346,0.03844847,0.0003800272,0.00009978866,0.000009744017,0.000039987102,0.00001579552,0.00013638767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790615,0.000070744325,0.00047535167,0.00058730494,0.0005189601,0.00044148316],"domain_scores_gemma":[0.9986692,0.0003598909,0.000320896,0.00021513212,0.00023440596,0.00020046954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009584041,0.0002861286,0.00023220443,0.0003753922,0.00035469746,0.0005948283,0.00048937276,0.00018530994,0.00004177764],"category_scores_gemma":[0.0001820549,0.00027888335,0.00005001864,0.00019332537,0.00007652828,0.00051447225,0.00012198319,0.0005419379,0.000049500075],"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.00039710168,0.00018721478,0.17771046,0.00015873725,0.00054809556,0.0018494069,0.021633994,0.21812797,0.058557663,0.4597526,0.0012763508,0.059800427],"study_design_scores_gemma":[0.0007819621,0.00023612966,0.018686615,0.0018298251,0.00001026004,0.0002826905,0.0010372376,0.9684923,0.0027352762,0.00495938,0.00039462262,0.00055369356],"about_ca_topic_score_codex":0.00014004772,"about_ca_topic_score_gemma":0.0000031839543,"teacher_disagreement_score":0.75036436,"about_ca_system_score_codex":0.00007113017,"about_ca_system_score_gemma":0.00014843285,"threshold_uncertainty_score":0.9999663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10068697586323345,"score_gpt":0.36205347605977206,"score_spread":0.2613665001965386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45766481","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.13191186,0.000026909333,0.8648109,0.0006391821,0.0005692799,0.00015337812,0.000016635642,0.0005951311,0.0012767109],"genre_scores_gemma":[0.5384413,0.000001591116,0.4612396,0.00018363746,0.000033439894,0.000032315562,0.00002180008,0.0000049148266,0.000041377065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989168,0.000051507133,0.00024776132,0.00033639508,0.00026806002,0.00017945211],"domain_scores_gemma":[0.99923563,0.00013027807,0.0000755695,0.00019442015,0.00029037555,0.00007371644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037895076,0.00013077792,0.00011885314,0.00019472819,0.00032116918,0.00018477837,0.0004288948,0.00007034414,0.000014966396],"category_scores_gemma":[0.00026749456,0.00012574159,0.00003857649,0.00012851505,0.00005344624,0.0001502658,0.000045586658,0.00013535538,0.000015229216],"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.000046934405,0.00010395877,0.000292803,0.000013299406,0.000035072837,0.0000177155,0.0012984023,0.69974834,0.0032112263,0.29097888,0.00015581932,0.004097558],"study_design_scores_gemma":[0.00044873488,0.00008863267,0.0011172504,0.00009851054,0.0000026811304,0.00003159655,0.00006989132,0.9948984,0.002813167,0.00019262821,0.0000878847,0.00015065659],"about_ca_topic_score_codex":0.000009569053,"about_ca_topic_score_gemma":3.9607562e-7,"teacher_disagreement_score":0.40652946,"about_ca_system_score_codex":0.00004251767,"about_ca_system_score_gemma":0.00012183079,"threshold_uncertainty_score":0.5127593},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06923126931246268,"score_gpt":0.31966380106829917,"score_spread":0.25043253175583646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96218255","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.34681815,0.00015069116,0.6435297,0.0027410479,0.00071010867,0.00009169312,0.000037187747,0.0016826882,0.0042387214],"genre_scores_gemma":[0.9534979,0.000010486435,0.04575404,0.00053323456,0.00006529952,0.000007903098,0.000076896984,0.000009698584,0.00004456373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987291,0.000038166992,0.00023476455,0.0004287689,0.00031115345,0.0002580183],"domain_scores_gemma":[0.99927783,0.00017060956,0.00011462346,0.00021857709,0.0001067983,0.000111590416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025576234,0.00018360747,0.0001456451,0.00018432774,0.00021195308,0.00036810138,0.0005285708,0.000060677063,0.000019304876],"category_scores_gemma":[0.00013611195,0.00017403581,0.000031904037,0.00011684735,0.0000341787,0.00040831394,0.0001407481,0.00027159558,0.000060942442],"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.00013655845,0.0003874721,0.11259546,0.00011077141,0.0003622887,0.0011660197,0.00880451,0.44167772,0.013683334,0.35399377,0.0008899357,0.06619215],"study_design_scores_gemma":[0.0007251328,0.00006708072,0.0036240276,0.0006915828,0.0000040612604,0.000060854396,0.00012899759,0.99116623,0.0017140502,0.0012773392,0.00027595364,0.00026471567],"about_ca_topic_score_codex":0.00014628713,"about_ca_topic_score_gemma":0.000004918665,"teacher_disagreement_score":0.60667974,"about_ca_system_score_codex":0.000038435082,"about_ca_system_score_gemma":0.000093409486,"threshold_uncertainty_score":0.7096974},"labels":[],"label_agreement":null}]}