{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MHIQ6BR4XOPQSB5XYMBQJ2IFJH","short_pith_number":"pith:MHIQ6BR4","schema_version":"1.0","canonical_sha256":"61d10f063cbb9f0907b7c30304e90549ea27d4ed8c131602c1ac43c3f3646425","source":{"kind":"arxiv","id":"2210.09292","version":3},"attestation_state":"computed","paper":{"title":"Efficient Diffusion Models for Vision: A Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Anwaar Ulhaq, Naveed Akhtar","submitted_at":"2022-10-07T06:46:13Z","abstract_excerpt":"Diffusion Models (DMs) have demonstrated state-of-the-art performance in content generation without requiring adversarial training. These models are trained using a two-step process. First, a forward - diffusion - process gradually adds noise to a datum (usually an image). Then, a backward - reverse diffusion - process gradually removes the noise to turn it into a sample of the target distribution being modelled. DMs are inspired by non-equilibrium thermodynamics and have inherent high computational complexity. Due to the frequent function evaluations and gradient calculations in high-dimensio"},"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":"2210.09292","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-10-07T06:46:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"50d1464f2731dc1a24d8cb57f257cce85603939480513af6cc70c9f33dd12b42","abstract_canon_sha256":"1b9afb1612082be63a3fb6fca966b775562a8312b23e7c533409a6183eb57428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:47.472258Z","signature_b64":"YVgkwL+wyWlpUEMN0vSjAUKcS+dUwiayFYgzpX6KjuFo8z8UlU8HktCizTqXHqpunF2NGcRcbhZSBMmpM4b4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61d10f063cbb9f0907b7c30304e90549ea27d4ed8c131602c1ac43c3f3646425","last_reissued_at":"2026-07-05T07:54:47.471822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:47.471822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Diffusion Models for Vision: A Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Anwaar Ulhaq, Naveed Akhtar","submitted_at":"2022-10-07T06:46:13Z","abstract_excerpt":"Diffusion Models (DMs) have demonstrated state-of-the-art performance in content generation without requiring adversarial training. These models are trained using a two-step process. First, a forward - diffusion - process gradually adds noise to a datum (usually an image). Then, a backward - reverse diffusion - process gradually removes the noise to turn it into a sample of the target distribution being modelled. DMs are inspired by non-equilibrium thermodynamics and have inherent high computational complexity. Due to the frequent function evaluations and gradient calculations in high-dimensio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.09292","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/2210.09292/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":"2210.09292","created_at":"2026-07-05T07:54:47.471879+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.09292v3","created_at":"2026-07-05T07:54:47.471879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.09292","created_at":"2026-07-05T07:54:47.471879+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHIQ6BR4XOPQ","created_at":"2026-07-05T07:54:47.471879+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHIQ6BR4XOPQSB5X","created_at":"2026-07-05T07:54:47.471879+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHIQ6BR4","created_at":"2026-07-05T07:54:47.471879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.18344","citing_title":"Improved Sample Complexity For Diffusion Model Training Without Empirical Risk Minimizer Access","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05365","citing_title":"From Clues to Generation: Language-Guided Conditional Diffusion for Cross-Domain Recommendation","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH","json":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH.json","graph_json":"https://pith.science/api/pith-number/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/graph.json","events_json":"https://pith.science/api/pith-number/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/events.json","paper":"https://pith.science/paper/MHIQ6BR4"},"agent_actions":{"view_html":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH","download_json":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH.json","view_paper":"https://pith.science/paper/MHIQ6BR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.09292&json=true","fetch_graph":"https://pith.science/api/pith-number/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/graph.json","fetch_events":"https://pith.science/api/pith-number/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/action/storage_attestation","attest_author":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/action/author_attestation","sign_citation":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/action/citation_signature","submit_replication":"https://pith.science/pith/MHIQ6BR4XOPQSB5XYMBQJ2IFJH/action/replication_record"}},"created_at":"2026-07-05T07:54:47.471879+00:00","updated_at":"2026-07-05T07:54:47.471879+00:00"}