{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BWYUKDYCWLFAWWU5JTQXYQY5OB","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":"b3d4777c1f4af89cc8e7ba0b0b24b141e737a90ff68ebb98d1e26cb66123adc3","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-05-14T14:22:25Z","title_canon_sha256":"780812694d4328fb0796e8430867532ba5178ec381cd362ac732ad63cb9c5d3f"},"schema_version":"1.0","source":{"id":"2605.14876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14876","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14876v1","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14876","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"BWYUKDYCWLFA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"BWYUKDYCWLFAWWU5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"BWYUKDYC","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:13f3e5a195252f25665105956a34c7f290216eb910aa805216b25d806f1fb938","target":"graph","created_at":"2026-05-17T23:38:56Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"CLVR outperforms existing open-source baselines across multiple benchmarks and approaches the performance of proprietary commercial models, unlocking general test-time scaling capabilities for complex visual generation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The automated data engine with step-level visual verification can reliably synthesize reasoning trajectories that are free of planning hallucinations and representative of real user prompts."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CLVR couples verified logical planning with pixel diffusion, uses proxy reinforcement learning on distilled histories, and merges weights to cut inference to 4 NFEs while outperforming open-source T2I models on complex benchmarks."}],"snapshot_sha256":"c470e8d3690210acc38f4f959d4f805c48cc86fc5f456d441c3cae7e3c870fba"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Despite rapid advancements, current text-to-image (T2I) models predominantly rely on a single-step generation paradigm, which struggles with complex semantics and faces diminishing returns from parameter scaling.\n  While recent multi-step reasoning approaches show promise, they are hindered by ungrounded planning hallucinations lacking verification, monolithic post-hoc reflection, long-context optimization instabilities, and prohibitive inference latency. To overcome these bottlenecks, we propose the Closed-Loop Visual Reasoning (CLVR) framework, a comprehensive system that deeply couples visu","authors_text":"Hanbo Cheng, Jun Du, Limin Lin, Ruo Zhang, Yicheng Pan","cross_cats":["cs.AI"],"headline":"CLVR couples verified logical planning with pixel diffusion, uses proxy reinforcement learning on distilled histories, and merges weights to cut inference to 4 NFEs while outperforming open-source T2I models on complex benchmarks.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-05-14T14:22:25Z","title":"Unlocking Complex Visual Generation via Closed-Loop Verified Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14876","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:20:08.744051Z","id":"5d7aa2f4-a04e-4fe4-9df5-b8dcc4a341ad","model_set":{"reader":"grok-4.3"},"one_line_summary":"CLVR couples verified logical planning with pixel diffusion, uses proxy reinforcement learning on distilled histories, and merges weights to cut inference to 4 NFEs while outperforming open-source T2I models on complex benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"CLVR outperforms existing open-source baselines across multiple benchmarks and approaches the performance of proprietary commercial models, unlocking general test-time scaling capabilities for complex visual generation.","weakest_assumption":"The automated data engine with step-level visual verification can reliably synthesize reasoning trajectories that are free of planning hallucinations and representative of real user prompts."}},"verdict_id":"5d7aa2f4-a04e-4fe4-9df5-b8dcc4a341ad"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3054d8d0b3faea4658c9c2fbcdadcc92fb8d339b6fcbab22400d284fcf4aa132","target":"record","created_at":"2026-05-17T23:38:56Z","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":"b3d4777c1f4af89cc8e7ba0b0b24b141e737a90ff68ebb98d1e26cb66123adc3","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-05-14T14:22:25Z","title_canon_sha256":"780812694d4328fb0796e8430867532ba5178ec381cd362ac732ad63cb9c5d3f"},"schema_version":"1.0","source":{"id":"2605.14876","kind":"arxiv","version":1}},"canonical_sha256":"0db1450f02b2ca0b5a9d4ce17c431d7065930f1efb9a19aa193e7d19b3af9782","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0db1450f02b2ca0b5a9d4ce17c431d7065930f1efb9a19aa193e7d19b3af9782","first_computed_at":"2026-05-17T23:38:56.090166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:56.090166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y6uv1VpT1jHxAxb+6HH1LeheKaENq5UzlGZlt4P+KIN4tF+PYWlm9/vExD3judHVKne1yarE7BF4xjjywW/hDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:56.090898Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3054d8d0b3faea4658c9c2fbcdadcc92fb8d339b6fcbab22400d284fcf4aa132","sha256:13f3e5a195252f25665105956a34c7f290216eb910aa805216b25d806f1fb938"],"state_sha256":"9aca0f000cac6070a0728d948cdd633d1a3cfa8015d0ce2bc86432f313061977"}