{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GTBF2LWJORBKBSE3P2M2SXDLZR","short_pith_number":"pith:GTBF2LWJ","schema_version":"1.0","canonical_sha256":"34c25d2ec97442a0c89b7e99a95c6bcc5304633f4ca3adeb7e2f46696cac1777","source":{"kind":"arxiv","id":"2311.14768","version":2},"attestation_state":"computed","paper":{"title":"AdaDiff: Adaptive Step Selection for Fast Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Hui Zhang, Jie Shao, Yu-Gang Jiang, Zhen Xing, Zuxuan Wu","submitted_at":"2023-11-24T11:20:38Z","abstract_excerpt":"Diffusion models, as a type of generative model, have achieved impressive results in generating images and videos conditioned on textual conditions. However, the generation process of diffusion models involves denoising dozens of steps to produce photorealistic images/videos, which is computationally expensive. Unlike previous methods that design ``one-size-fits-all'' approaches for speed up, we argue denoising steps should be sample-specific conditioned on the richness of input texts. To this end, we introduce AdaDiff, a lightweight framework designed to learn instance-specific step usage pol"},"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":"2311.14768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-11-24T11:20:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"633a3bb58f0fed0900e6a572c264c3871e643644335ed7ac280beeafc740e038","abstract_canon_sha256":"79340e6e480f3294b6374e8c94b5c3401b0fc26772da0b2945adf03b42af427a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:43.491454Z","signature_b64":"NUXOnzUY1qa0G4olYxBFSr+p8L2sc18ap8QlrsWITJb2JhN0fjJVN4WCjSkpjAjjHUlWqOYSUVcTCAMSmk7PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34c25d2ec97442a0c89b7e99a95c6bcc5304633f4ca3adeb7e2f46696cac1777","last_reissued_at":"2026-07-05T09:54:43.490943Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:43.490943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaDiff: Adaptive Step Selection for Fast Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Hui Zhang, Jie Shao, Yu-Gang Jiang, Zhen Xing, Zuxuan Wu","submitted_at":"2023-11-24T11:20:38Z","abstract_excerpt":"Diffusion models, as a type of generative model, have achieved impressive results in generating images and videos conditioned on textual conditions. However, the generation process of diffusion models involves denoising dozens of steps to produce photorealistic images/videos, which is computationally expensive. Unlike previous methods that design ``one-size-fits-all'' approaches for speed up, we argue denoising steps should be sample-specific conditioned on the richness of input texts. To this end, we introduce AdaDiff, a lightweight framework designed to learn instance-specific step usage pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14768","kind":"arxiv","version":2},"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/2311.14768/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":"2311.14768","created_at":"2026-07-05T09:54:43.491000+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.14768v2","created_at":"2026-07-05T09:54:43.491000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14768","created_at":"2026-07-05T09:54:43.491000+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTBF2LWJORBK","created_at":"2026-07-05T09:54:43.491000+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTBF2LWJORBKBSE3","created_at":"2026-07-05T09:54:43.491000+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTBF2LWJ","created_at":"2026-07-05T09:54:43.491000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.04678","citing_title":"Reward Forcing: Efficient Streaming Video Generation with Rewarded Distribution Matching Distillation","ref_index":92,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11214","citing_title":"Enforcing Constraints in Generative Sampling via Adaptive Correction Scheduling","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR","json":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR.json","graph_json":"https://pith.science/api/pith-number/GTBF2LWJORBKBSE3P2M2SXDLZR/graph.json","events_json":"https://pith.science/api/pith-number/GTBF2LWJORBKBSE3P2M2SXDLZR/events.json","paper":"https://pith.science/paper/GTBF2LWJ"},"agent_actions":{"view_html":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR","download_json":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR.json","view_paper":"https://pith.science/paper/GTBF2LWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.14768&json=true","fetch_graph":"https://pith.science/api/pith-number/GTBF2LWJORBKBSE3P2M2SXDLZR/graph.json","fetch_events":"https://pith.science/api/pith-number/GTBF2LWJORBKBSE3P2M2SXDLZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR/action/storage_attestation","attest_author":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR/action/author_attestation","sign_citation":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR/action/citation_signature","submit_replication":"https://pith.science/pith/GTBF2LWJORBKBSE3P2M2SXDLZR/action/replication_record"}},"created_at":"2026-07-05T09:54:43.491000+00:00","updated_at":"2026-07-05T09:54:43.491000+00:00"}