{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L4C5REPST64PW2TQGO45S7WP2P","short_pith_number":"pith:L4C5REPS","schema_version":"1.0","canonical_sha256":"5f05d891f29fb8fb6a7033b9d97ecfd3c109caa4cc036f82d7c73afff20aae43","source":{"kind":"arxiv","id":"2501.00946","version":1},"attestation_state":"computed","paper":{"title":"Cached Adaptive Token Merging: Dynamic Token Reduction and Redundant Computation Elimination in Diffusion Model","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ahmad Nickabadi, Atiyeh Gh. Moghadam, Omid Saghatchian","submitted_at":"2025-01-01T20:16:27Z","abstract_excerpt":"Diffusion models have emerged as a promising approach for generating high-quality, high-dimensional images. Nevertheless, these models are hindered by their high computational cost and slow inference, partly due to the quadratic computational complexity of the self-attention mechanisms with respect to input size. Various approaches have been proposed to address this drawback. One such approach focuses on reducing the number of tokens fed into the self-attention, known as token merging (ToMe). In our method, which is called cached adaptive token merging(CA-ToMe), we calculate the similarity bet"},"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":"2501.00946","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2025-01-01T20:16:27Z","cross_cats_sorted":[],"title_canon_sha256":"d7767a4046fd4a1c76aead5a6153dcaf96b7ca8ea6b0a47fa370bf489bdc8d48","abstract_canon_sha256":"525584349f2fb84b3059d68d2b74ce22d7cebd9848a76a81b4ed8d3dea21873b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:12.318038Z","signature_b64":"5J68Ef+AJRc6FZOsGEHcEgloyrAR1VB6auGtL2BGRaAwRfnLTEw4RV3VDPYMxSgVundXiO2FsXrc0smyoVUuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f05d891f29fb8fb6a7033b9d97ecfd3c109caa4cc036f82d7c73afff20aae43","last_reissued_at":"2026-07-05T09:56:12.317481Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:12.317481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cached Adaptive Token Merging: Dynamic Token Reduction and Redundant Computation Elimination in Diffusion Model","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ahmad Nickabadi, Atiyeh Gh. Moghadam, Omid Saghatchian","submitted_at":"2025-01-01T20:16:27Z","abstract_excerpt":"Diffusion models have emerged as a promising approach for generating high-quality, high-dimensional images. Nevertheless, these models are hindered by their high computational cost and slow inference, partly due to the quadratic computational complexity of the self-attention mechanisms with respect to input size. Various approaches have been proposed to address this drawback. One such approach focuses on reducing the number of tokens fed into the self-attention, known as token merging (ToMe). In our method, which is called cached adaptive token merging(CA-ToMe), we calculate the similarity bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00946","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/2501.00946/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":"2501.00946","created_at":"2026-07-05T09:56:12.317544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00946v1","created_at":"2026-07-05T09:56:12.317544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00946","created_at":"2026-07-05T09:56:12.317544+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4C5REPST64P","created_at":"2026-07-05T09:56:12.317544+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4C5REPST64PW2TQ","created_at":"2026-07-05T09:56:12.317544+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4C5REPS","created_at":"2026-07-05T09:56:12.317544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06060","citing_title":"ReCache: Learning Budget-Aware Caching Schedules for Diffusion Models via REINFORCE","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P","json":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P.json","graph_json":"https://pith.science/api/pith-number/L4C5REPST64PW2TQGO45S7WP2P/graph.json","events_json":"https://pith.science/api/pith-number/L4C5REPST64PW2TQGO45S7WP2P/events.json","paper":"https://pith.science/paper/L4C5REPS"},"agent_actions":{"view_html":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P","download_json":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P.json","view_paper":"https://pith.science/paper/L4C5REPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00946&json=true","fetch_graph":"https://pith.science/api/pith-number/L4C5REPST64PW2TQGO45S7WP2P/graph.json","fetch_events":"https://pith.science/api/pith-number/L4C5REPST64PW2TQGO45S7WP2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P/action/storage_attestation","attest_author":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P/action/author_attestation","sign_citation":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P/action/citation_signature","submit_replication":"https://pith.science/pith/L4C5REPST64PW2TQGO45S7WP2P/action/replication_record"}},"created_at":"2026-07-05T09:56:12.317544+00:00","updated_at":"2026-07-05T09:56:12.317544+00:00"}