{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DJNGRJ3PF4PP7OARTWH66KFOYJ","short_pith_number":"pith:DJNGRJ3P","schema_version":"1.0","canonical_sha256":"1a5a68a76f2f1effb8119d8fef28aec25e410c22c15f7db232486cb45b1dd8fe","source":{"kind":"arxiv","id":"2312.04429","version":1},"attestation_state":"computed","paper":{"title":"Approximate Caching for Efficiently Serving Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Koyel Mukherjee, Sarthak Chakraborty, Shiv Saini, Shubham Agarwal, Srikrishna Karanam, Subrata Mitra","submitted_at":"2023-12-07T16:55:04Z","abstract_excerpt":"Text-to-image generation using diffusion models has seen explosive popularity owing to their ability in producing high quality images adhering to text prompts. However, production-grade diffusion model serving is a resource intensive task that not only require high-end GPUs which are expensive but also incurs considerable latency. In this paper, we introduce a technique called approximate-caching that can reduce such iterative denoising steps for an image generation based on a prompt by reusing intermediate noise states created during a prior image generation for similar prompts. Based on this"},"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":"2312.04429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-12-07T16:55:04Z","cross_cats_sorted":[],"title_canon_sha256":"3edc8c2099030615f1e5bd2a8d9fa70e32757c28fdbc440999435b3060e88f45","abstract_canon_sha256":"ef71677f94dd94f2f91ec6541c720d66e8a384dbea65fb30b8237295cd7d501c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:34.419363Z","signature_b64":"PDV0AuZm6ldp5ZfpRwk/JBBfGhAsplJ2CO0qG1cIsOLs6wONgbociVqh1vBPi1JGAMgugCvT1i17ShwtcwSdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a5a68a76f2f1effb8119d8fef28aec25e410c22c15f7db232486cb45b1dd8fe","last_reissued_at":"2026-07-05T07:21:34.418877Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:34.418877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Caching for Efficiently Serving Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Koyel Mukherjee, Sarthak Chakraborty, Shiv Saini, Shubham Agarwal, Srikrishna Karanam, Subrata Mitra","submitted_at":"2023-12-07T16:55:04Z","abstract_excerpt":"Text-to-image generation using diffusion models has seen explosive popularity owing to their ability in producing high quality images adhering to text prompts. However, production-grade diffusion model serving is a resource intensive task that not only require high-end GPUs which are expensive but also incurs considerable latency. In this paper, we introduce a technique called approximate-caching that can reduce such iterative denoising steps for an image generation based on a prompt by reusing intermediate noise states created during a prior image generation for similar prompts. Based on this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.04429","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/2312.04429/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":"2312.04429","created_at":"2026-07-05T07:21:34.418931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.04429v1","created_at":"2026-07-05T07:21:34.418931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.04429","created_at":"2026-07-05T07:21:34.418931+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJNGRJ3PF4PP","created_at":"2026-07-05T07:21:34.418931+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJNGRJ3PF4PP7OAR","created_at":"2026-07-05T07:21:34.418931+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJNGRJ3P","created_at":"2026-07-05T07:21:34.418931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.04335","citing_title":"GENSERVE: Efficient Co-Serving of Heterogeneous Diffusion Model Workloads","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ","json":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ.json","graph_json":"https://pith.science/api/pith-number/DJNGRJ3PF4PP7OARTWH66KFOYJ/graph.json","events_json":"https://pith.science/api/pith-number/DJNGRJ3PF4PP7OARTWH66KFOYJ/events.json","paper":"https://pith.science/paper/DJNGRJ3P"},"agent_actions":{"view_html":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ","download_json":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ.json","view_paper":"https://pith.science/paper/DJNGRJ3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.04429&json=true","fetch_graph":"https://pith.science/api/pith-number/DJNGRJ3PF4PP7OARTWH66KFOYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DJNGRJ3PF4PP7OARTWH66KFOYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ/action/storage_attestation","attest_author":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ/action/author_attestation","sign_citation":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ/action/citation_signature","submit_replication":"https://pith.science/pith/DJNGRJ3PF4PP7OARTWH66KFOYJ/action/replication_record"}},"created_at":"2026-07-05T07:21:34.418931+00:00","updated_at":"2026-07-05T07:21:34.418931+00:00"}