{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FXZCEYXC757BJ6Y7N2AJOAEOAD","short_pith_number":"pith:FXZCEYXC","schema_version":"1.0","canonical_sha256":"2df22262e2ff7e14fb1f6e8097008e00fa9f0af2874d9721b6eab37d7743d154","source":{"kind":"arxiv","id":"2511.11688","version":3},"attestation_state":"computed","paper":{"title":"Hierarchical Schedule Optimization for Fast and Robust Diffusion Model Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Aihua Zhu, Li Feng, Meng Shen, Qinglin Zhao, Rui Su, Shibo He","submitted_at":"2025-11-12T08:57:46Z","abstract_excerpt":"Diffusion probabilistic models have set a new standard for generative fidelity but are hindered by a slow iterative sampling process. A powerful training-free strategy to accelerate this process is Schedule Optimization, which aims to find an optimal distribution of timesteps for a fixed and small Number of Function Evaluations (NFE) to maximize sample quality. To this end, a successful schedule optimization method must adhere to four core principles: effectiveness, adaptivity, practical robustness, and computational efficiency. However, existing paradigms struggle to satisfy these principles "},"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":"2511.11688","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-12T08:57:46Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"320685e02701b54530e0c75a98797ea59d1c3aac74a0f3976a891a7ec1f212e3","abstract_canon_sha256":"cda08eac76d8cea1bf80185493304b9c9e15335bce2d46029eb3b681978ee1a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:06:07.065517Z","signature_b64":"OGMsyKRuNUiByB9v8gOvziz9U8WbS8Kn0KQm9TCAiMeNwOf0R6VUqFkg9T8RQd/vNhMFdgG6RzkNTx0A11CuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2df22262e2ff7e14fb1f6e8097008e00fa9f0af2874d9721b6eab37d7743d154","last_reissued_at":"2026-05-20T01:06:07.064719Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:06:07.064719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Schedule Optimization for Fast and Robust Diffusion Model Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Aihua Zhu, Li Feng, Meng Shen, Qinglin Zhao, Rui Su, Shibo He","submitted_at":"2025-11-12T08:57:46Z","abstract_excerpt":"Diffusion probabilistic models have set a new standard for generative fidelity but are hindered by a slow iterative sampling process. A powerful training-free strategy to accelerate this process is Schedule Optimization, which aims to find an optimal distribution of timesteps for a fixed and small Number of Function Evaluations (NFE) to maximize sample quality. To this end, a successful schedule optimization method must adhere to four core principles: effectiveness, adaptivity, practical robustness, and computational efficiency. However, existing paradigms struggle to satisfy these principles "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.11688","kind":"arxiv","version":3},"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/2511.11688/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":"2511.11688","created_at":"2026-05-20T01:06:07.064811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.11688v3","created_at":"2026-05-20T01:06:07.064811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.11688","created_at":"2026-05-20T01:06:07.064811+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXZCEYXC757B","created_at":"2026-05-20T01:06:07.064811+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXZCEYXC757BJ6Y7","created_at":"2026-05-20T01:06:07.064811+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXZCEYXC","created_at":"2026-05-20T01:06:07.064811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD","json":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD.json","graph_json":"https://pith.science/api/pith-number/FXZCEYXC757BJ6Y7N2AJOAEOAD/graph.json","events_json":"https://pith.science/api/pith-number/FXZCEYXC757BJ6Y7N2AJOAEOAD/events.json","paper":"https://pith.science/paper/FXZCEYXC"},"agent_actions":{"view_html":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD","download_json":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD.json","view_paper":"https://pith.science/paper/FXZCEYXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.11688&json=true","fetch_graph":"https://pith.science/api/pith-number/FXZCEYXC757BJ6Y7N2AJOAEOAD/graph.json","fetch_events":"https://pith.science/api/pith-number/FXZCEYXC757BJ6Y7N2AJOAEOAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD/action/storage_attestation","attest_author":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD/action/author_attestation","sign_citation":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD/action/citation_signature","submit_replication":"https://pith.science/pith/FXZCEYXC757BJ6Y7N2AJOAEOAD/action/replication_record"}},"created_at":"2026-05-20T01:06:07.064811+00:00","updated_at":"2026-05-20T01:06:07.064811+00:00"}