{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OYH2WMTZKJJHA7UH7OMNATKBJG","short_pith_number":"pith:OYH2WMTZ","schema_version":"1.0","canonical_sha256":"760fab32795252707e87fb98d04d41498ea16be5ca6a566b6f75c7496679b88a","source":{"kind":"arxiv","id":"2406.02549","version":1},"attestation_state":"computed","paper":{"title":"Dreamguider: Improved Training free Diffusion-based Conditional Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Nithin Gopalakrishnan Nair, Vishal M Patel","submitted_at":"2024-06-04T17:59:32Z","abstract_excerpt":"Diffusion models have emerged as a formidable tool for training-free conditional generation.However, a key hurdle in inference-time guidance techniques is the need for compute-heavy backpropagation through the diffusion network for estimating the guidance direction. Moreover, these techniques often require handcrafted parameter tuning on a case-by-case basis. Although some recent works have introduced minimal compute methods for linear inverse problems, a generic lightweight guidance solution to both linear and non-linear guidance problems is still missing. To this end, we propose Dreamguider,"},"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":"2406.02549","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-06-04T17:59:32Z","cross_cats_sorted":[],"title_canon_sha256":"86e847c8af910523203ab27e8ba8fee3d318e6c975fc417bef5379d0ca958a36","abstract_canon_sha256":"f8eee21a2cfe8261f1de1a4daffe60016819df50d5a211266ba0119d9b91d1af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:21.133203Z","signature_b64":"dyKM5hm1UGvGazGLDaMHYFiNbrA5KHdpCpdvvSXgS6xrQrGxyqbGrXm8Bd3zHWLhdzsQiT+KUjjZ5wl7IKA/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"760fab32795252707e87fb98d04d41498ea16be5ca6a566b6f75c7496679b88a","last_reissued_at":"2026-07-05T08:27:21.132774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:21.132774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dreamguider: Improved Training free Diffusion-based Conditional Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Nithin Gopalakrishnan Nair, Vishal M Patel","submitted_at":"2024-06-04T17:59:32Z","abstract_excerpt":"Diffusion models have emerged as a formidable tool for training-free conditional generation.However, a key hurdle in inference-time guidance techniques is the need for compute-heavy backpropagation through the diffusion network for estimating the guidance direction. Moreover, these techniques often require handcrafted parameter tuning on a case-by-case basis. Although some recent works have introduced minimal compute methods for linear inverse problems, a generic lightweight guidance solution to both linear and non-linear guidance problems is still missing. To this end, we propose Dreamguider,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02549","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/2406.02549/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":"2406.02549","created_at":"2026-07-05T08:27:21.132828+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02549v1","created_at":"2026-07-05T08:27:21.132828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02549","created_at":"2026-07-05T08:27:21.132828+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYH2WMTZKJJH","created_at":"2026-07-05T08:27:21.132828+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYH2WMTZKJJHA7UH","created_at":"2026-07-05T08:27:21.132828+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYH2WMTZ","created_at":"2026-07-05T08:27:21.132828+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06618","citing_title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG","json":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG.json","graph_json":"https://pith.science/api/pith-number/OYH2WMTZKJJHA7UH7OMNATKBJG/graph.json","events_json":"https://pith.science/api/pith-number/OYH2WMTZKJJHA7UH7OMNATKBJG/events.json","paper":"https://pith.science/paper/OYH2WMTZ"},"agent_actions":{"view_html":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG","download_json":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG.json","view_paper":"https://pith.science/paper/OYH2WMTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02549&json=true","fetch_graph":"https://pith.science/api/pith-number/OYH2WMTZKJJHA7UH7OMNATKBJG/graph.json","fetch_events":"https://pith.science/api/pith-number/OYH2WMTZKJJHA7UH7OMNATKBJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG/action/storage_attestation","attest_author":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG/action/author_attestation","sign_citation":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG/action/citation_signature","submit_replication":"https://pith.science/pith/OYH2WMTZKJJHA7UH7OMNATKBJG/action/replication_record"}},"created_at":"2026-07-05T08:27:21.132828+00:00","updated_at":"2026-07-05T08:27:21.132828+00:00"}