{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OKO5STVFFLK5UHJXH2RLC6AFMP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"056507c7f5829106a4debc534214a1260159122ea68c97565f6607e3ea225249","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-17T15:19:47Z","title_canon_sha256":"89d00a2b4306dbdc4d87ee26178f8af0ffdbb8b8b26b7c90ee9dbdbec53852a7"},"schema_version":"1.0","source":{"id":"2603.16648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.16648","created_at":"2026-06-19T16:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"2603.16648v2","created_at":"2026-06-19T16:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.16648","created_at":"2026-06-19T16:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"OKO5STVFFLK5","created_at":"2026-06-19T16:12:53Z"},{"alias_kind":"pith_short_16","alias_value":"OKO5STVFFLK5UHJX","created_at":"2026-06-19T16:12:53Z"},{"alias_kind":"pith_short_8","alias_value":"OKO5STVF","created_at":"2026-06-19T16:12:53Z"}],"graph_snapshots":[{"event_id":"sha256:152998d079cd347c0c58227c712e1d4ebd8f50a200883a5ec910ef7b8a800c4c","target":"graph","created_at":"2026-06-19T16:12:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Integrating general-purpose constraint propagation into domain-independent dynamic programming reduces state expansions and solves more instances on scheduling and TSP problems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Integrating a general-purpose CP solver into domain-independent dynamic programming prunes states and solves more scheduling instances."}],"snapshot_sha256":"3c1e4dc4965040957636b850206fa0b4cf611430f7778f59612ee59c58d2d9fa"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.16648/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Emir Demirovi\\'c, Imko Marijnissen, J. Christopher Beck, Ryo Kuroiwa","cross_cats":[],"headline":"Integrating a general-purpose CP solver into domain-independent dynamic programming prunes states and solves more scheduling instances.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-17T15:19:47Z","title":"Domain-Independent Dynamic Programming with Constraint Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.16648","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T10:03:10.425256Z","id":"fd01c52e-ecb4-4d2c-82b9-4edd83735007","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Integrating a general-purpose CP solver into domain-independent dynamic programming prunes states and solves more scheduling instances.","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","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."}},"verdict_id":"fd01c52e-ecb4-4d2c-82b9-4edd83735007"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cff6fd12f29a4153307b291cd25c92da0f2c16621c099a6eed888b974e58b2dd","target":"record","created_at":"2026-06-19T16:12:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"056507c7f5829106a4debc534214a1260159122ea68c97565f6607e3ea225249","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-17T15:19:47Z","title_canon_sha256":"89d00a2b4306dbdc4d87ee26178f8af0ffdbb8b8b26b7c90ee9dbdbec53852a7"},"schema_version":"1.0","source":{"id":"2603.16648","kind":"arxiv","version":2}},"canonical_sha256":"729dd94ea52ad5da1d373ea2b1780563c0ff9ecded0858da7e91fceec650623c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"729dd94ea52ad5da1d373ea2b1780563c0ff9ecded0858da7e91fceec650623c","first_computed_at":"2026-06-19T16:12:53.164409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:53.164409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iYbA9mJ1VosJ7ma4vH1CC023IufrS4wLA18HbRjbqAuVNdOcsfwOcB6WwINRNic0b0w0fVIwsTBjQyOqrakjBg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:53.164922Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.16648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cff6fd12f29a4153307b291cd25c92da0f2c16621c099a6eed888b974e58b2dd","sha256:152998d079cd347c0c58227c712e1d4ebd8f50a200883a5ec910ef7b8a800c4c"],"state_sha256":"21be401ec7275763f61d97418033b979c344d990db78f22f9a4814ee4e363563"}