{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057650696,0.0014046362,0.908104,0.002378875,0.00012659702,0.000424975,0.001622452,0.0011190851,0.02716877],"genre_scores_gemma":[0.48821893,0.0012000274,0.49337694,0.0004750516,0.00014582001,0.001002524,0.0026194965,0.0003175995,0.012643575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751943,0.0012092144,0.00015901715,0.0004043898,0.00044292453,0.00026497032],"domain_scores_gemma":[0.99551433,0.003700144,0.00022763826,0.00018249152,0.0002422268,0.00013316447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018610248,0.001166564,0.0009610302,0.0008642582,0.0009330293,0.0020591384,0.0014020944,0.0015148952,0.007746434],"category_scores_gemma":[0.006719017,0.00070092885,0.0014892274,0.0021907517,0.0019850829,0.0022443186,0.0023721433,0.0019701836,0.000500051],"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.00024296419,0.0001474849,0.0007763548,0.0005474254,0.00013057294,0.00058852066,0.0006092862,0.6986155,0.0015382764,0.24146351,0.0048052487,0.050534803],"study_design_scores_gemma":[0.00010076049,0.000055991502,0.00020206896,0.000050851828,0.0000332699,0.00009195641,0.00027635676,0.6675162,0.0008229633,0.3223014,0.00852639,0.0000218918],"about_ca_topic_score_codex":0.010265206,"about_ca_topic_score_gemma":0.014482996,"teacher_disagreement_score":0.010265206,"about_ca_system_score_codex":0.0022267576,"about_ca_system_score_gemma":0.00204417,"threshold_uncertainty_score":0.025914371},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009355897,0.00017816748,0.9783261,0.00015416463,0.00009575697,0.00023109572,0.00017576561,0.004908902,0.006574198],"genre_scores_gemma":[0.10291031,0.00021632083,0.88875836,0.0001161709,0.000057464575,0.00040957626,0.00050624466,0.000539443,0.006486083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977592,0.0003636445,0.00020261708,0.00038927916,0.0009845876,0.0003006714],"domain_scores_gemma":[0.99653035,0.0016425955,0.00018126481,0.00095933717,0.00056291796,0.00012348931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015130067,0.0018460022,0.0016230791,0.001990977,0.0015020224,0.0027046623,0.0030963891,0.0015752218,0.025740145],"category_scores_gemma":[0.007701158,0.00094076415,0.0017146603,0.0021220238,0.0016015123,0.005152716,0.006002125,0.0026191606,0.0071398844],"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.00078439,0.00032127017,0.0011115366,0.0006862184,0.00007793461,0.00023353407,0.00046327896,0.109186254,0.009391277,0.20959605,0.0112630855,0.6568852],"study_design_scores_gemma":[0.00022720436,0.00021601998,0.00023456701,0.000108753215,0.0000805145,0.00025114694,0.00028297136,0.6644529,0.023966124,0.27316135,0.036945805,0.00007257028],"about_ca_topic_score_codex":0.0018330171,"about_ca_topic_score_gemma":0.003106801,"teacher_disagreement_score":0.025740145,"about_ca_system_score_codex":0.0011041148,"about_ca_system_score_gemma":0.0012727033,"threshold_uncertainty_score":0.08610934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061165236,0.002603199,0.90022355,0.00071489526,0.0003304356,0.00057339756,0.0039346647,0.013150415,0.017304188],"genre_scores_gemma":[0.44550157,0.0009830785,0.5333386,0.00037454278,0.00011465649,0.000402457,0.005067636,0.0009225793,0.013294836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977756,0.00032391187,0.00036320547,0.0007022828,0.00061426946,0.00022073161],"domain_scores_gemma":[0.9921799,0.0018953056,0.00046637718,0.00412878,0.0010414402,0.0002881852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017574056,0.0008099809,0.0013858607,0.0016506519,0.000896331,0.004391465,0.004684245,0.0010101555,0.014204473],"category_scores_gemma":[0.008861248,0.00077949197,0.00096946594,0.0041912757,0.0006109524,0.007702685,0.002795166,0.0010899081,0.0041187294],"study_design_candidate":"not_applicable","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.0016904679,0.0004536215,0.008994397,0.0010835778,0.00033100325,0.0008447637,0.00040132643,0.03162332,0.02169597,0.057206664,0.021848183,0.8538267],"study_design_scores_gemma":[0.00036195418,0.0014722723,0.0047473777,0.00038963594,0.00057587866,0.0040176995,0.0011203605,0.4117569,0.11997317,0.20511383,0.25020367,0.00026726857],"about_ca_topic_score_codex":0.0018738197,"about_ca_topic_score_gemma":0.0017687492,"teacher_disagreement_score":0.014204473,"about_ca_system_score_codex":0.0007911936,"about_ca_system_score_gemma":0.0013227888,"threshold_uncertainty_score":0.04751867},"labels":[],"label_agreement":null}]}