{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VN5LJVZYLH2ZSATMYZ7YCAWBBB","short_pith_number":"pith:VN5LJVZY","schema_version":"1.0","canonical_sha256":"ab7ab4d73859f599026cc67f8102c1085f9450fae61cf8ebbd33884f99bf895a","source":{"kind":"arxiv","id":"2606.13496","version":1},"attestation_state":"computed","paper":{"title":"Budget-Constrained Step-Level Diffusion Caching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chi Zhang, Liangyu Yuan, Mingkun Lei, Tong Zhao","submitted_at":"2026-06-11T15:45:05Z","abstract_excerpt":"Step-level caching accelerates diffusion models by exploiting temporal redundancy across denoising steps. Existing methods make per-step cache decisions using threshold-based heuristics, without directly optimizing for final output quality. As a result, their inference latency varies across inputs and is difficult to control at deployment. In this work, we propose BudCache, which inverts this formulation: rather than letting per-step error thresholds dictate the runtime cost, we fix the compute budget in advance and search for the cache policy that best preserves the final output. To tackle th"},"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":"2606.13496","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-11T15:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"edb1e6bdd19bf3c8ad8a27dcaa485deb821139ac2acd403e2fb8180b811e3f80","abstract_canon_sha256":"25ba52280a8f1a8882657aec7162e4d6453cadce3506799d9f8dd8f97c5b0c39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:06.740580Z","signature_b64":"sQqQNz9OplCy6z33s4KsZTfRT/Wk5CJ0ysqVTa3rnnxA8dUJjsUx3hcfX3ROViBx4q+MzEG4MB3s98pT/8C5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab7ab4d73859f599026cc67f8102c1085f9450fae61cf8ebbd33884f99bf895a","last_reissued_at":"2026-06-12T01:10:06.739614Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:06.739614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Budget-Constrained Step-Level Diffusion Caching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chi Zhang, Liangyu Yuan, Mingkun Lei, Tong Zhao","submitted_at":"2026-06-11T15:45:05Z","abstract_excerpt":"Step-level caching accelerates diffusion models by exploiting temporal redundancy across denoising steps. Existing methods make per-step cache decisions using threshold-based heuristics, without directly optimizing for final output quality. As a result, their inference latency varies across inputs and is difficult to control at deployment. In this work, we propose BudCache, which inverts this formulation: rather than letting per-step error thresholds dictate the runtime cost, we fix the compute budget in advance and search for the cache policy that best preserves the final output. To tackle th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13496","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/2606.13496/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":"2606.13496","created_at":"2026-06-12T01:10:06.739768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13496v1","created_at":"2026-06-12T01:10:06.739768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13496","created_at":"2026-06-12T01:10:06.739768+00:00"},{"alias_kind":"pith_short_12","alias_value":"VN5LJVZYLH2Z","created_at":"2026-06-12T01:10:06.739768+00:00"},{"alias_kind":"pith_short_16","alias_value":"VN5LJVZYLH2ZSATM","created_at":"2026-06-12T01:10:06.739768+00:00"},{"alias_kind":"pith_short_8","alias_value":"VN5LJVZY","created_at":"2026-06-12T01:10:06.739768+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/VN5LJVZYLH2ZSATMYZ7YCAWBBB","json":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB.json","graph_json":"https://pith.science/api/pith-number/VN5LJVZYLH2ZSATMYZ7YCAWBBB/graph.json","events_json":"https://pith.science/api/pith-number/VN5LJVZYLH2ZSATMYZ7YCAWBBB/events.json","paper":"https://pith.science/paper/VN5LJVZY"},"agent_actions":{"view_html":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB","download_json":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB.json","view_paper":"https://pith.science/paper/VN5LJVZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13496&json=true","fetch_graph":"https://pith.science/api/pith-number/VN5LJVZYLH2ZSATMYZ7YCAWBBB/graph.json","fetch_events":"https://pith.science/api/pith-number/VN5LJVZYLH2ZSATMYZ7YCAWBBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/action/storage_attestation","attest_author":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/action/author_attestation","sign_citation":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/action/citation_signature","submit_replication":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/action/replication_record"}},"created_at":"2026-06-12T01:10:06.739768+00:00","updated_at":"2026-06-12T01:10:06.739768+00:00"}