{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BL6HZCKTXDXUWNOX6ORB6JGBWT","short_pith_number":"pith:BL6HZCKT","schema_version":"1.0","canonical_sha256":"0afc7c8953b8ef4b35d7f3a21f24c1b4ef244ec4d70d1cb6e581825c5a2a1380","source":{"kind":"arxiv","id":"2309.00966","version":1},"attestation_state":"computed","paper":{"title":"Compositional Diffusion-Based Continuous Constraint Solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Jiajun Wu, Jiayuan Mao, Joshua B. Tenenbaum, Leslie Pack Kaelbling, Tom\\'as Lozano-P\\'erez, Yilun Du, Zhutian Yang","submitted_at":"2023-09-02T15:20:36Z","abstract_excerpt":"This paper introduces an approach for learning to solve continuous constraint satisfaction problems (CCSP) in robotic reasoning and planning. Previous methods primarily rely on hand-engineering or learning generators for specific constraint types and then rejecting the value assignments when other constraints are violated. By contrast, our model, the compositional diffusion continuous constraint solver (Diffusion-CCSP) derives global solutions to CCSPs by representing them as factor graphs and combining the energies of diffusion models trained to sample for individual constraint types. Diffusi"},"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":"2309.00966","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-09-02T15:20:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"be653ed874160ea416b33892f82250c72767c11aca4d393a3be9e5b3db21813d","abstract_canon_sha256":"fb94df573b8c9dfe92cab5116a6296c1c93405fd5027fd713e9dd860a054c744"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:30.306974Z","signature_b64":"VA9ibyaJ2Q1gLjbRgBO1hY23+1kslcA77bPB3gAz9VL1LCTonGe1m3IVD0Smv0RtoIUM1aPQRSFRW5V2tK6VDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0afc7c8953b8ef4b35d7f3a21f24c1b4ef244ec4d70d1cb6e581825c5a2a1380","last_reissued_at":"2026-07-05T06:47:30.306495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:30.306495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositional Diffusion-Based Continuous Constraint Solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Jiajun Wu, Jiayuan Mao, Joshua B. Tenenbaum, Leslie Pack Kaelbling, Tom\\'as Lozano-P\\'erez, Yilun Du, Zhutian Yang","submitted_at":"2023-09-02T15:20:36Z","abstract_excerpt":"This paper introduces an approach for learning to solve continuous constraint satisfaction problems (CCSP) in robotic reasoning and planning. Previous methods primarily rely on hand-engineering or learning generators for specific constraint types and then rejecting the value assignments when other constraints are violated. By contrast, our model, the compositional diffusion continuous constraint solver (Diffusion-CCSP) derives global solutions to CCSPs by representing them as factor graphs and combining the energies of diffusion models trained to sample for individual constraint types. Diffusi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.00966","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.00966/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":"2309.00966","created_at":"2026-07-05T06:47:30.306555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.00966v1","created_at":"2026-07-05T06:47:30.306555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.00966","created_at":"2026-07-05T06:47:30.306555+00:00"},{"alias_kind":"pith_short_12","alias_value":"BL6HZCKTXDXU","created_at":"2026-07-05T06:47:30.306555+00:00"},{"alias_kind":"pith_short_16","alias_value":"BL6HZCKTXDXUWNOX","created_at":"2026-07-05T06:47:30.306555+00:00"},{"alias_kind":"pith_short_8","alias_value":"BL6HZCKT","created_at":"2026-07-05T06:47:30.306555+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18328","citing_title":"Recover, Discover, Plan: Learning Skills and Concepts from Robot Failures","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":228,"is_internal_anchor":false},{"citing_arxiv_id":"2409.01652","citing_title":"ReKep: Spatio-Temporal Reasoning of Relational Keypoint Constraints for Robotic Manipulation","ref_index":78,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18258","citing_title":"Long-Text-to-Image Generation via Compositional Prompt Decomposition","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT","json":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT.json","graph_json":"https://pith.science/api/pith-number/BL6HZCKTXDXUWNOX6ORB6JGBWT/graph.json","events_json":"https://pith.science/api/pith-number/BL6HZCKTXDXUWNOX6ORB6JGBWT/events.json","paper":"https://pith.science/paper/BL6HZCKT"},"agent_actions":{"view_html":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT","download_json":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT.json","view_paper":"https://pith.science/paper/BL6HZCKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.00966&json=true","fetch_graph":"https://pith.science/api/pith-number/BL6HZCKTXDXUWNOX6ORB6JGBWT/graph.json","fetch_events":"https://pith.science/api/pith-number/BL6HZCKTXDXUWNOX6ORB6JGBWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT/action/storage_attestation","attest_author":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT/action/author_attestation","sign_citation":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT/action/citation_signature","submit_replication":"https://pith.science/pith/BL6HZCKTXDXUWNOX6ORB6JGBWT/action/replication_record"}},"created_at":"2026-07-05T06:47:30.306555+00:00","updated_at":"2026-07-05T06:47:30.306555+00:00"}