{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MV7R2XHPBRNWD4BYJEF5XHYQHB","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":"86ac32d3d92a6e00e4544bf34164511f0bc49d14393bca667b9d69b63e3fb5da","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-20T05:47:27Z","title_canon_sha256":"c9854edb46b17fb8d50c20e13a119c17d836e353a7c8a74d3cb81417dc83adf3"},"schema_version":"1.0","source":{"id":"2604.17838","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.17838","created_at":"2026-06-02T01:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"2604.17838v2","created_at":"2026-06-02T01:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.17838","created_at":"2026-06-02T01:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"MV7R2XHPBRNW","created_at":"2026-06-02T01:04:16Z"},{"alias_kind":"pith_short_16","alias_value":"MV7R2XHPBRNWD4BY","created_at":"2026-06-02T01:04:16Z"},{"alias_kind":"pith_short_8","alias_value":"MV7R2XHP","created_at":"2026-06-02T01:04:16Z"}],"graph_snapshots":[{"event_id":"sha256:0538c80622614945b2066f69f9ffd738ae9759bf536c23d88db699f1b0fedf15","target":"graph","created_at":"2026-06-02T01:04:16Z","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":"A key algorithmic innovation is a computationally efficient landing mechanism that replaces costly and often ill-defined projections onto Σ, ensuring feasibility without iterative Newton solves or projection failures."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The landing mechanism works for generic nonconvex feasible sets Σ and preserves the correct diffusion dynamics without introducing bias or instability."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A landing algorithm lets diffusion models sample from nonconvex constrained sets using underdamped dynamics without repeated projections or Newton solves."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A landing mechanism enables efficient diffusion models on nonconvex sets by replacing costly projections with a single-step correction."}],"snapshot_sha256":"11e80eacb8ebf5f245249de43ef5fe2592d099e51bee4c50a44a48c8510d7a28"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T04:42:19.839387Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.17838/integrity.json","findings":[],"snapshot_sha256":"94825b64b708e2ebcf26014f2cc38859f2107c7b22742f178bb71d2b4a5ded1e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Generative modeling within constrained sets is essential for scientific and engineering applications involving physical, geometric, or safety requirements (e.g., molecular generation, robotics). We present a unified framework for constrained diffusion models on generic nonconvex feasible sets $\\Sigma$ that simultaneously enforces equality and inequality constraints throughout the diffusion process. Our framework incorporates both overdamped and underdamped dynamics for forward and backward sampling. A key algorithmic innovation is a computationally efficient landing mechanism that replaces cos","authors_text":"Kijung Jeon, Michael Muehlebach, Molei Tao","cross_cats":["stat.CO","stat.ML"],"headline":"A landing mechanism enables efficient diffusion models on nonconvex sets by replacing costly projections with a single-step correction.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-20T05:47:27Z","title":"Efficient Diffusion Models under Nonconvex Equality and Inequality constraints via Landing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.17838","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T05:51:06.694675Z","id":"35494912-8e7a-444f-9a80-3f0efc107625","model_set":{"reader":"grok-4.3"},"one_line_summary":"A landing algorithm lets diffusion models sample from nonconvex constrained sets using underdamped dynamics without repeated projections or Newton solves.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A landing mechanism enables efficient diffusion models on nonconvex sets by replacing costly projections with a single-step correction.","strongest_claim":"A key algorithmic innovation is a computationally efficient landing mechanism that replaces costly and often ill-defined projections onto Σ, ensuring feasibility without iterative Newton solves or projection failures.","weakest_assumption":"The landing mechanism works for generic nonconvex feasible sets Σ and preserves the correct diffusion dynamics without introducing bias or instability."}},"verdict_id":"35494912-8e7a-444f-9a80-3f0efc107625"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:29dd52feac718967b48520b17a73116ddabbd291007c9ac67ba1fecdc4b00206","target":"record","created_at":"2026-06-02T01:04:16Z","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":"86ac32d3d92a6e00e4544bf34164511f0bc49d14393bca667b9d69b63e3fb5da","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-20T05:47:27Z","title_canon_sha256":"c9854edb46b17fb8d50c20e13a119c17d836e353a7c8a74d3cb81417dc83adf3"},"schema_version":"1.0","source":{"id":"2604.17838","kind":"arxiv","version":2}},"canonical_sha256":"657f1d5cef0c5b61f038490bdb9f103862a4d17183979ecb862ab8a693e536e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"657f1d5cef0c5b61f038490bdb9f103862a4d17183979ecb862ab8a693e536e7","first_computed_at":"2026-06-02T01:04:16.308244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:04:16.308244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vgq5M7edq1diwtY3Kx0YRjwOeLG7JtroTzp2BAFwsDMZTaybBLtnO6w3GvVteb2eQCBAQHwqZh5x0GIu7HWeDA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:04:16.308739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.17838","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29dd52feac718967b48520b17a73116ddabbd291007c9ac67ba1fecdc4b00206","sha256:0538c80622614945b2066f69f9ffd738ae9759bf536c23d88db699f1b0fedf15"],"state_sha256":"3e40aa3c845c769beea05f9a687e7d445552b7f781e5917beef008b2aa3573c5"}