{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VN5LJVZYLH2ZSATMYZ7YCAWBBB","short_pith_number":"pith:VN5LJVZY","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"},"canonical_sha256":"ab7ab4d73859f599026cc67f8102c1085f9450fae61cf8ebbd33884f99bf895a","source":{"kind":"arxiv","id":"2606.13496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13496","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13496v1","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13496","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"pith_short_12","alias_value":"VN5LJVZYLH2Z","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"pith_short_16","alias_value":"VN5LJVZYLH2ZSATM","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"pith_short_8","alias_value":"VN5LJVZY","created_at":"2026-06-12T01:10:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VN5LJVZYLH2ZSATMYZ7YCAWBBB","target":"record","payload":{"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"},"canonical_sha256":"ab7ab4d73859f599026cc67f8102c1085f9450fae61cf8ebbd33884f99bf895a","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"},"source_kind":"arxiv","source_id":"2606.13496","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-12T01:10:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYD+KEMdWG/cYsuKtw/rOjMsrtMkzIjuIFaE4y7oktJa64nN+LbTUogz0PONceW9e6ujliGUtGGr09pESkt1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:27:11.051019Z"},"content_sha256":"c75b7e11ac411b403a860855821b18101b2fe27eceff79b6308d7531e5024ba5","schema_version":"1.0","event_id":"sha256:c75b7e11ac411b403a860855821b18101b2fe27eceff79b6308d7531e5024ba5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VN5LJVZYLH2ZSATMYZ7YCAWBBB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-12T01:10:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLubaa3S/A4mPPbjPKb5GClgr4lQW/tLJkFMo+EAex/TdA1wVKHWunOaR8WrGxhe4tf3m6r7mBMXxTBQHeIYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:27:11.051393Z"},"content_sha256":"d56ac2fdafb33216ce196abc20581a1052adc481710c64db2e9b260444010de1","schema_version":"1.0","event_id":"sha256:d56ac2fdafb33216ce196abc20581a1052adc481710c64db2e9b260444010de1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/bundle.json","state_url":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T20:27:11Z","links":{"resolver":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB","bundle":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/bundle.json","state":"https://pith.science/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VN5LJVZYLH2ZSATMYZ7YCAWBBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VN5LJVZYLH2ZSATMYZ7YCAWBBB","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":"25ba52280a8f1a8882657aec7162e4d6453cadce3506799d9f8dd8f97c5b0c39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-11T15:45:05Z","title_canon_sha256":"edb1e6bdd19bf3c8ad8a27dcaa485deb821139ac2acd403e2fb8180b811e3f80"},"schema_version":"1.0","source":{"id":"2606.13496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13496","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13496v1","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13496","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"pith_short_12","alias_value":"VN5LJVZYLH2Z","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"pith_short_16","alias_value":"VN5LJVZYLH2ZSATM","created_at":"2026-06-12T01:10:06Z"},{"alias_kind":"pith_short_8","alias_value":"VN5LJVZY","created_at":"2026-06-12T01:10:06Z"}],"graph_snapshots":[{"event_id":"sha256:d56ac2fdafb33216ce196abc20581a1052adc481710c64db2e9b260444010de1","target":"graph","created_at":"2026-06-12T01:10:06Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.13496/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chi Zhang, Liangyu Yuan, Mingkun Lei, Tong Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-11T15:45:05Z","title":"Budget-Constrained Step-Level Diffusion Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13496","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c75b7e11ac411b403a860855821b18101b2fe27eceff79b6308d7531e5024ba5","target":"record","created_at":"2026-06-12T01:10:06Z","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":"25ba52280a8f1a8882657aec7162e4d6453cadce3506799d9f8dd8f97c5b0c39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-11T15:45:05Z","title_canon_sha256":"edb1e6bdd19bf3c8ad8a27dcaa485deb821139ac2acd403e2fb8180b811e3f80"},"schema_version":"1.0","source":{"id":"2606.13496","kind":"arxiv","version":1}},"canonical_sha256":"ab7ab4d73859f599026cc67f8102c1085f9450fae61cf8ebbd33884f99bf895a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab7ab4d73859f599026cc67f8102c1085f9450fae61cf8ebbd33884f99bf895a","first_computed_at":"2026-06-12T01:10:06.739614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:10:06.739614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sQqQNz9OplCy6z33s4KsZTfRT/Wk5CJ0ysqVTa3rnnxA8dUJjsUx3hcfX3ROViBx4q+MzEG4MB3s98pT/8C5CQ==","signature_status":"signed_v1","signed_at":"2026-06-12T01:10:06.740580Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c75b7e11ac411b403a860855821b18101b2fe27eceff79b6308d7531e5024ba5","sha256:d56ac2fdafb33216ce196abc20581a1052adc481710c64db2e9b260444010de1"],"state_sha256":"cb887cf71363f35d907a6f612955a2878cad08a9ea25a41943e0e6adb32940b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBPvi3Ds/FOxgkWLxNPn+vko9vE4h8JoSHws87sJf61VyKOx8kMkxaufDKHONXf9pPvx8gTAriAI7RPVJ2ydDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T20:27:11.053287Z","bundle_sha256":"cfbb9a76b7c7729f25ea8e0c30f79c4d4ba34f72fb117417cd1eb9b8d7d68252"}}