{"id":"W4382866785","doi":"10.1609/socs.v16i1.27309","title":"Domain-Independent Dynamic Programming (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Formalism (music); Computer science; Solver; Domain (mathematical analysis); Dynamic programming; Problem solver; Theoretical computer science; Heuristic; Programming language; Mathematical optimization; Algorithm; Artificial intelligence; Software engineering; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006821374,0.0001333521,0.0001234828,0.0001769261,0.0001868994,0.0003382709,0.001748393,0.00007152949,0.00002864158],"category_scores_gemma":[0.0000436205,0.0001089512,0.0001202222,0.000611992,0.00006362129,0.0003441948,0.0006657167,0.0002608848,0.00006898605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002695111,"about_ca_system_score_gemma":0.000062496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002574303,"about_ca_topic_score_gemma":0.000002974761,"domain_scores_codex":[0.9975938,0.000009142041,0.0003140032,0.0003461974,0.00147814,0.0002586748],"domain_scores_gemma":[0.9990498,0.0000838586,0.0001647767,0.0001549996,0.0004712607,0.00007533441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00006622708,0.0003046172,0.01303016,0.00003561976,0.0001007797,0.000003725396,0.001326491,0.0007722148,0.038002,0.9335555,0.0008661443,0.01193646],"study_design_scores_gemma":[0.01022915,0.001184822,0.5862338,0.0008460871,0.00005228504,0.0001139928,0.00256546,0.06128956,0.1491126,0.1176072,0.06884276,0.001922322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.952247,0.000004167832,0.0008524384,0.01732047,0.008822244,0.0006645346,0.000005703003,0.0003461929,0.01973725],"genre_scores_gemma":[0.9985637,0.00001979352,0.000798316,0.00006393268,0.0001279208,0.00003371671,0.000003057526,0.00001237101,0.0003771818],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8159484,"threshold_uncertainty_score":0.4442901,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01169575634310918,"score_gpt":0.2756053958978785,"score_spread":0.2639096395547693,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}