{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Robert C. Holte","is_ca":true},{"name":"Jack Newton","is_ca":true},{"name":"Ariel Felner","is_ca":false},{"name":"Ram Meshulam","is_ca":false},{"name":"David Furcy","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001757406,0.0008099809,0.001385861,0.001650652,0.000896331,0.004391465,0.004684245,0.001010156,0.01420447],"category_scores_gemma":[0.008861248,0.000779492,0.0009694659,0.004191276,0.0006109524,0.007702685,0.002795166,0.001089908,0.004118729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007911936,"about_ca_system_score_gemma":0.001322789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00187382,"about_ca_topic_score_gemma":0.001768749,"domain_scores_codex":[0.9977756,0.0003239119,0.0003632055,0.0007022828,0.0006142695,0.0002207316],"domain_scores_gemma":[0.9921799,0.001895306,0.0004663772,0.00412878,0.00104144,0.0002881852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001690468,0.0004536215,0.008994397,0.001083578,0.0003310032,0.0008447637,0.0004013264,0.03162332,0.02169597,0.05720666,0.02184818,0.8538267],"study_design_scores_gemma":[0.0003619542,0.001472272,0.004747378,0.0003896359,0.0005758787,0.0040177,0.00112036,0.4117569,0.1199732,0.2051138,0.2502037,0.0002672686],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06116524,0.002603199,0.9002236,0.0007148953,0.0003304356,0.0005733976,0.003934665,0.01315042,0.01730419],"genre_scores_gemma":[0.4455016,0.0009830785,0.5333386,0.0003745428,0.0001146565,0.000402457,0.005067636,0.0009225793,0.01329484],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01420447,"threshold_uncertainty_score":0.04751867,"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","authors":[{"name":"Guy Shani","is_ca":false},{"name":"Pascal Poupart","is_ca":true},{"name":"Ronen I. Brafman","is_ca":false},{"name":"Solomon Eyal Shimony","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001513007,0.001846002,0.001623079,0.001990977,0.001502022,0.002704662,0.003096389,0.001575222,0.02574014],"category_scores_gemma":[0.007701158,0.0009407641,0.00171466,0.002122024,0.001601512,0.005152716,0.006002125,0.002619161,0.007139884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001104115,"about_ca_system_score_gemma":0.001272703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001833017,"about_ca_topic_score_gemma":0.003106801,"domain_scores_codex":[0.9977592,0.0003636445,0.0002026171,0.0003892792,0.0009845876,0.0003006714],"domain_scores_gemma":[0.9965304,0.001642596,0.0001812648,0.0009593372,0.000562918,0.0001234893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00078439,0.0003212702,0.001111537,0.0006862184,0.00007793461,0.0002335341,0.000463279,0.1091863,0.009391277,0.2095961,0.01126309,0.6568852],"study_design_scores_gemma":[0.0002272044,0.00021602,0.000234567,0.0001087532,0.0000805145,0.0002511469,0.0002829714,0.6644529,0.02396612,0.2731614,0.0369458,0.00007257028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009355897,0.0001781675,0.9783261,0.0001541646,0.00009575697,0.0002310957,0.0001757656,0.004908902,0.006574198],"genre_scores_gemma":[0.1029103,0.0002163208,0.8887584,0.0001161709,0.00005746457,0.0004095763,0.0005062447,0.000539443,0.006486083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02574014,"threshold_uncertainty_score":0.08610934,"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","authors":[{"name":"Yuxiao Hu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001861025,0.001166564,0.0009610302,0.0008642582,0.0009330293,0.002059138,0.001402094,0.001514895,0.007746434],"category_scores_gemma":[0.006719017,0.0007009289,0.001489227,0.002190752,0.001985083,0.002244319,0.002372143,0.001970184,0.000500051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002226758,"about_ca_system_score_gemma":0.00204417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01026521,"about_ca_topic_score_gemma":0.014483,"domain_scores_codex":[0.9975194,0.001209214,0.0001590171,0.0004043898,0.0004429245,0.0002649703],"domain_scores_gemma":[0.9955143,0.003700144,0.0002276383,0.0001824915,0.0002422268,0.0001331645],"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.0002429642,0.0001474849,0.0007763548,0.0005474254,0.0001305729,0.0005885207,0.0006092862,0.6986155,0.001538276,0.2414635,0.004805249,0.0505348],"study_design_scores_gemma":[0.0001007605,0.0000559915,0.000202069,0.00005085183,0.0000332699,0.00009195641,0.0002763568,0.6675162,0.0008229633,0.3223014,0.00852639,0.0000218918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0576507,0.001404636,0.908104,0.002378875,0.000126597,0.000424975,0.001622452,0.001119085,0.02716877],"genre_scores_gemma":[0.4882189,0.001200027,0.4933769,0.0004750516,0.00014582,0.001002524,0.002619497,0.0003175995,0.01264357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01026521,"threshold_uncertainty_score":0.02591437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}