{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OKO5STVFFLK5UHJXH2RLC6AFMP","short_pith_number":"pith:OKO5STVF","schema_version":"1.0","canonical_sha256":"729dd94ea52ad5da1d373ea2b1780563c0ff9ecded0858da7e91fceec650623c","source":{"kind":"arxiv","id":"2603.16648","version":2},"attestation_state":"computed","paper":{"title":"Domain-Independent Dynamic Programming with Constraint Propagation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Integrating a general-purpose CP solver into domain-independent dynamic programming prunes states and solves more scheduling instances.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Emir Demirovi\\'c, Imko Marijnissen, J. Christopher Beck, Ryo Kuroiwa","submitted_at":"2026-03-17T15:19:47Z","abstract_excerpt":"There are two prevalent model-based paradigms for combinatorial problems: 1) state-based representations, such as heuristic search, dynamic programming (DP), and decision diagrams, and 2) constraint and domain-based representations, such as constraint programming (CP), (mixed-)integer programming, and Boolean satisfiability. In this paper, we bridge the gap between the DP and CP paradigms by integrating constraint propagation into DP, enabling a DP solver to prune states and transitions using constraint propagation. To this end, we implement constraint propagation using a general-purpose CP so"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2603.16648","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-17T15:19:47Z","cross_cats_sorted":[],"title_canon_sha256":"89d00a2b4306dbdc4d87ee26178f8af0ffdbb8b8b26b7c90ee9dbdbec53852a7","abstract_canon_sha256":"056507c7f5829106a4debc534214a1260159122ea68c97565f6607e3ea225249"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:53.164922Z","signature_b64":"iYbA9mJ1VosJ7ma4vH1CC023IufrS4wLA18HbRjbqAuVNdOcsfwOcB6WwINRNic0b0w0fVIwsTBjQyOqrakjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"729dd94ea52ad5da1d373ea2b1780563c0ff9ecded0858da7e91fceec650623c","last_reissued_at":"2026-06-19T16:12:53.164409Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:53.164409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domain-Independent Dynamic Programming with Constraint Propagation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Integrating a general-purpose CP solver into domain-independent dynamic programming prunes states and solves more scheduling instances.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Emir Demirovi\\'c, Imko Marijnissen, J. Christopher Beck, Ryo Kuroiwa","submitted_at":"2026-03-17T15:19:47Z","abstract_excerpt":"There are two prevalent model-based paradigms for combinatorial problems: 1) state-based representations, such as heuristic search, dynamic programming (DP), and decision diagrams, and 2) constraint and domain-based representations, such as constraint programming (CP), (mixed-)integer programming, and Boolean satisfiability. In this paper, we bridge the gap between the DP and CP paradigms by integrating constraint propagation into DP, enabling a DP solver to prune states and transitions using constraint propagation. To this end, we implement constraint propagation using a general-purpose CP so"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"constraint propagation significantly reduces the number of state expansions, causing our approach to solve more instances than a DP solver for Single Machine Scheduling and RCPSP, and showing similar improvements for tightly constrained TSPTW instances","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The overhead of calling a general-purpose CP solver inside the DP loop remains acceptable relative to the pruning gains for the tested problem classes and instance sizes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Integrating general-purpose constraint propagation into domain-independent dynamic programming reduces state expansions and solves more instances on scheduling and TSP problems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Integrating a general-purpose CP solver into domain-independent dynamic programming prunes states and solves more scheduling instances.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3c1e4dc4965040957636b850206fa0b4cf611430f7778f59612ee59c58d2d9fa"},"source":{"id":"2603.16648","kind":"arxiv","version":2},"verdict":{"id":"fd01c52e-ecb4-4d2c-82b9-4edd83735007","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T10:03:10.425256Z","strongest_claim":"constraint propagation significantly reduces the number of state expansions, causing our approach to solve more instances than a DP solver for Single Machine Scheduling and RCPSP, and showing similar improvements for tightly constrained TSPTW instances","one_line_summary":"Integrating general-purpose constraint propagation into domain-independent dynamic programming reduces state expansions and solves more instances on scheduling and TSP problems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The overhead of calling a general-purpose CP solver inside the DP loop remains acceptable relative to the pruning gains for the tested problem classes and instance sizes.","pith_extraction_headline":"Integrating a general-purpose CP solver into domain-independent dynamic programming prunes states and solves more scheduling instances."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.16648/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.16648","created_at":"2026-06-19T16:12:53.164474+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.16648v2","created_at":"2026-06-19T16:12:53.164474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.16648","created_at":"2026-06-19T16:12:53.164474+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKO5STVFFLK5","created_at":"2026-06-19T16:12:53.164474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKO5STVFFLK5UHJX","created_at":"2026-06-19T16:12:53.164474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKO5STVF","created_at":"2026-06-19T16:12:53.164474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23569","citing_title":"CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP","json":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP.json","graph_json":"https://pith.science/api/pith-number/OKO5STVFFLK5UHJXH2RLC6AFMP/graph.json","events_json":"https://pith.science/api/pith-number/OKO5STVFFLK5UHJXH2RLC6AFMP/events.json","paper":"https://pith.science/paper/OKO5STVF"},"agent_actions":{"view_html":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP","download_json":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP.json","view_paper":"https://pith.science/paper/OKO5STVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.16648&json=true","fetch_graph":"https://pith.science/api/pith-number/OKO5STVFFLK5UHJXH2RLC6AFMP/graph.json","fetch_events":"https://pith.science/api/pith-number/OKO5STVFFLK5UHJXH2RLC6AFMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP/action/storage_attestation","attest_author":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP/action/author_attestation","sign_citation":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP/action/citation_signature","submit_replication":"https://pith.science/pith/OKO5STVFFLK5UHJXH2RLC6AFMP/action/replication_record"}},"created_at":"2026-06-19T16:12:53.164474+00:00","updated_at":"2026-06-19T16:12:53.164474+00:00"}