{"as_of":"2026-08-13T12:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2065a0859d0f8ba8929d656be41935b4067becc638ba0b81b7e4ac132531116a","coverage":[{"denominator":72,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":72,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:26:46.404857Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.21817/citation-record","integrity":"/paper/2505.21817/integrity","json":"/paper/2505.21817/citation-record.json","paper":"/paper/2505.21817"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:39.332976Z","title":"Generative modeling by estimating gradients of the data distribution.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:39.332976Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:ab424a0802db0fc4a161ad0ff448a00cbd0a4c002e3c66522cc20a35a80ac582","observation_id":"ebb7c73b-37a0-4b0c-b08c-de36b836fdbc","resolution":{"observed_at":"2026-08-07T13:26:39.332976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:39.402901Z","title":"Denoising diffusion probabilistic models.Advances in neural information processing systems, 33:6840–6851, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:39.402901Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:66612ef7c681e3622729b3650981a78d47e372e7e5972a48a51306f79811093e","observation_id":"47e60767-e29c-4e00-9bfe-9deccde0c833","resolution":{"observed_at":"2026-08-07T13:26:39.402901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.664600Z","title":"Score-based generative modeling through stochastic evolution equations in hilbert spaces","venue":null,"work_id":"c76f74cf-0fe8-4c90-a3f4-2e023e92ee6b","year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:39.504936Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:12e8c5d33f5539cb1353fcbac3dc714fc11b8826c9ce1d5c04701d2fced7ad64","observation_id":"15667fbe-526b-4986-9d0e-a26e72bc61ec","resolution":{"observed_at":"2026-08-07T13:26:50.682535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:39.632477Z","title":"High- resolution image synthesis with latent diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:39.632477Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:a23bba53480bc99be708dc114483528df4e1ba702d467e41de4fcd3f006fd242","observation_id":"0477864e-820f-4f05-8928-0d81f33aec57","resolution":{"observed_at":"2026-08-07T13:26:39.632477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.633786Z","title":"SDXL: Improving latent diffusion models for high-resolution image synthesis","venue":null,"work_id":"b778b8f9-8518-4284-9279-39c07337c06d","year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:39.718866Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:96f0c0b9fa519677ab108e642dbd8d1ae1bb6a83a7713a63b4e79c24807366c9","observation_id":"382cf3db-f595-4a4f-9aa2-cd478f96b434","resolution":{"observed_at":"2026-08-07T13:26:50.639942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.06125","last_updated":"2022-04-13T01:10:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-13T01:10:33Z","title":"Hierarchical Text-Conditional Image Generation with CLIP Latents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.06125","snapshot_observed_at":"2026-08-07T13:26:39.814870Z","title":"Hierarchical text-conditional image generation with clip latents.arXiv preprint arXiv:2204.06125, 1(2):3, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:39.814870Z"},"links":{"cited_paper":"/paper/2204.06125","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:8ff120e58cbd77ae0f9b105f42c55653b44f812e6d1aebaab884c612e8fccb58","observation_id":"3f712b03-dd8a-410a-bc4b-e26fe0578efb","resolution":{"observed_at":"2026-08-07T13:26:39.814870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:39.894207Z","title":"Scalable diffusion models with transformers","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:39.894207Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:929bee38e2cad9ca8bd574c20401626e32d04a9524b3b1a3f723e4cf37a46947","observation_id":"e8d0d899-1654-40f8-89b3-f44ab5c667ea","resolution":{"observed_at":"2026-08-07T13:26:39.894207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:39.976839Z","title":"Blended diffusion for text-driven editing of natural images","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:39.976839Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:3109cb965119e7541b01e2ecf4e649b215b9f38e81959a39242e94aa0dae9f91","observation_id":"bb7aa4f2-ec75-4533-a964-745b85a23d92","resolution":{"observed_at":"2026-08-07T13:26:39.976839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:40.113497Z","title":"Imagic: Text-based real image editing with diffusion models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.113497Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:41316213f4a9d6ce72c4b46071f39e7ac377879b820567e3a730be1e4c230c03","observation_id":"847e32c3-307c-4347-ae3a-54e477577fd2","resolution":{"observed_at":"2026-08-07T13:26:40.113497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:40.223962Z","title":"Adding conditional control to text-to-image diffusion models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.223962Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:3731e82d3f3bd595999268456fbf41e9c2a8fff0b98db9519d0a8dd04604ae2a","observation_id":"32e93927-d97b-4bab-b01f-9bd7d89833f6","resolution":{"observed_at":"2026-08-07T13:26:40.223962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:40.342405Z","title":"Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.342405Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:178d387e2717f814bdd8c9b1b52871f2f582a57e61145d47ccdafbcb14fccf19","observation_id":"56abc617-50a0-4f55-8500-b87f517c8622","resolution":{"observed_at":"2026-08-07T13:26:40.342405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02502","last_updated":"2022-10-05T20:19:21Z","snapshot_observed_at":"2026-08-11T15:38:14.931716Z","submitted_at":"2020-10-06T06:15:51Z","title":"Denoising Diffusion Implicit Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02502","snapshot_observed_at":"2026-08-07T13:26:40.460387Z","title":"Denoising diffusion implicit models.arXiv preprint arXiv:2010.02502, 2020","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.460387Z"},"links":{"cited_paper":"/paper/2010.02502","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:848a8a514ff95f558251edba97bb9cad32fb69fb01d97eca23ca1944869af147","observation_id":"8fce975f-b20f-47fa-ab4b-6b599ae4314a","resolution":{"observed_at":"2026-08-07T13:26:40.460387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.518599Z","title":"Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps.Advances in Neural Information Processing Systems, 35:5775–5787, 2022","venue":null,"work_id":"641ce08f-7111-4894-8397-b762dc9a9978","year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.581848Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:50979ae9bd79d875c0d5c80a039f900b4d4d3a8286a67e7556bcc5df2b6d7b62","observation_id":"eb9f4e96-8343-49c6-9861-32497dfb890a","resolution":{"observed_at":"2026-08-07T13:26:50.558038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:40.664773Z","title":"Consistency models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.664773Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:8f26aa18fdc00ad14f43db8ee85be14ff59b30bc9e2f774f5918fbad2580ad15","observation_id":"102b7c40-23a5-4e3c-ab49-50265bdbf628","resolution":{"observed_at":"2026-08-07T13:26:40.664773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00512","last_updated":"2022-06-07T09:17:35Z","snapshot_observed_at":"2026-08-12T01:14:44.484432Z","submitted_at":"2022-02-01T16:07:25Z","title":"Progressive Distillation for Fast Sampling of Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.00512","snapshot_observed_at":"2026-08-07T13:26:40.772189Z","title":"Progressive distillation for fast sampling of diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.772189Z"},"links":{"cited_paper":"/paper/2202.00512","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:c63bcf2e9a966c430f04112673fdb0e8de2ea5ac916bbaa5617d1cf4ba97bdaa","observation_id":"f37ca086-23be-45d6-93d6-ab7a4ce4c1f6","resolution":{"observed_at":"2026-08-07T13:26:40.772189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:40.907726Z","title":"Deepcache: Accelerating diffusion models for free","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.907726Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:9f12b0345ce3e9a1eea2af5aaed882010b973ccc773681e116da82127111c003","observation_id":"89041c26-b99f-409e-baae-26d3e6568102","resolution":{"observed_at":"2026-08-07T13:26:40.907726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15034","last_updated":"2024-11-22T16:08:03Z","snapshot_observed_at":"2026-08-12T23:54:53.929320Z","submitted_at":"2024-11-22T16:08:03Z","title":"HeadRouter: A Training-free Image Editing Framework for MM-DiTs by Adaptively Routing Attention Heads","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15034","snapshot_observed_at":"2026-08-07T13:26:40.985397Z","title":"Headrouter: A training-free image editing framework for mm-dits by adaptively routing attention heads.arXiv preprint arXiv:2411.15034, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:40.985397Z"},"links":{"cited_paper":"/paper/2411.15034","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:403a1c9a7a13a9eee64385e188daa00a7296f68fb244b7dd39c0ac3f18c42038","observation_id":"97b9aca5-a926-4063-848d-fefe4bc18a21","resolution":{"observed_at":"2026-08-07T13:26:40.985397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.404019Z","title":"Not all prompts are made equal: Prompt-based pruning of text-to-image diffusion models","venue":null,"work_id":"273ab51f-f57f-4b2e-b78f-1fffa45a0ef0","year":2025},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.077083Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:61f199efab8ddf7d65c5df5f1c88485eca2d89c839541b23f6c0116158f5eca7","observation_id":"b84fff20-f9e3-4708-a47c-44be0b9a215a","resolution":{"observed_at":"2026-08-07T13:26:50.444030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.11098","last_updated":"2025-03-05T13:28:29Z","snapshot_observed_at":"2026-08-13T00:28:34.890045Z","submitted_at":"2024-04-17T06:32:42Z","title":"LAPTOP-Diff: Layer Pruning and Normalized Distillation for Compressing Diffusion Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.11098","snapshot_observed_at":"2026-08-07T13:26:41.167442Z","title":"Laptop-diff: Layer pruning and normalized distillation for compressing diffusion models.arXiv preprint arXiv:2404.11098, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.167442Z"},"links":{"cited_paper":"/paper/2404.11098","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:5c718023c603493d508e6b9ebf0708b2a7a548bad7ceb1eb7f54345076f8fab2","observation_id":"f3a1b19b-1510-4b34-9134-36fc12b41e62","resolution":{"observed_at":"2026-08-07T13:26:41.167442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.329409Z","title":"Ld-pruner: Effi- cient pruning of latent diffusion models using task-agnostic insights, 2024","venue":null,"work_id":"c2a4e05b-a11d-40d2-961c-e8423e37aaad","year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.271172Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:5be9b89612025d110bb822ef18fc173ba820b021039f178facbf5bf6a964f7e9","observation_id":"eaaf00d3-4918-4f68-8ed6-9734ee39d3aa","resolution":{"observed_at":"2026-08-07T13:26:50.364213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.253362Z","title":"Analytic-dpm: an analytic estimate of the optimal reverse variance in diffusion probabilistic models, 2022","venue":null,"work_id":"d45e8b04-9225-4cad-bdcc-6fde63f0c7d1","year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.353213Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:bae09affec9e5bcefab9e79f9a7113c64146c727282d42c47c63f721c7a172d8","observation_id":"7af81d95-063a-44b2-b2ac-73f2d245bf18","resolution":{"observed_at":"2026-08-07T13:26:50.285349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.168733Z","title":"Pseudo numerical methods for diffusion models on manifolds","venue":null,"work_id":"22128723-5194-486e-9aad-7b83faa74cad","year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.456979Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:747da7c23e514b5b3772165909108a5de9a86dc69aecd2624bcb66062de2b73d","observation_id":"b84d84f1-7988-4148-82d3-e8e08b32fa3d","resolution":{"observed_at":"2026-08-07T13:26:50.214571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.108033Z","title":"Fast sampling of diffusion models with exponential integrator, 2023","venue":null,"work_id":"f55d48a9-4288-40ac-b5ef-e62f4ee408c2","year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.556849Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:173bb16d51d79fbf11299ad75572fc36eb30ec6522b41fb3b400674bc7abf894","observation_id":"3fbe9389-487e-48e5-a7ce-aa50f37b70c9","resolution":{"observed_at":"2026-08-07T13:26:50.135882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:50.053200Z","title":"Parallel sampling of diffusion models, 2023","venue":null,"work_id":"3e9e61cc-3e49-4aa3-8e61-87fb68c900f1","year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.645514Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:034488790c3201cc560015ecbf93403fdd43ae08a700cf76382678160066ff2e","observation_id":"fbf973cf-9b4d-4a30-9252-a20d824b7906","resolution":{"observed_at":"2026-08-07T13:26:50.075694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:41.725542Z","title":"Latent consistency models: Synthesizing high-resolution images with few-step inference, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.725542Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:4a23de1138035b87f600ace96a6bbf9ecd27b314094f1c5c1232547cacb02038","observation_id":"cd04df2a-fc4c-4653-8e2d-a6ecc034c23a","resolution":{"observed_at":"2026-08-07T13:26:41.725542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:41.827974Z","title":"Kingma, Stefano Ermon, Jonathan Ho, and Tim Salimans","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.827974Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:b89a99c4bb99f9481e6f3b696fdb8b562413b049e9ee768a9f452e7f56922295","observation_id":"bfee2a1a-56e7-4746-86bf-3527829c2e76","resolution":{"observed_at":"2026-08-07T13:26:41.827974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:41.934339Z","title":"Adversarial diffusion distillation, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:41.934339Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:7fa49215055eedc1cb0c0fa14604be5982d680bcae25228839562a66c73b7056","observation_id":"250259aa-cbb8-46f7-b2e2-c5f9261055c8","resolution":{"observed_at":"2026-08-07T13:26:41.934339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:49.932791Z","title":"Tract: Denoising diffusion models with transitive closure time-distillation, 2023","venue":null,"work_id":"163fc062-1b5e-472a-ac4a-fa67d774c3e1","year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.045635Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:421aa24cd112e156f42db58aee4c1d77a04a5f2272dc3d591cb7228b05af7936","observation_id":"f0e65431-ca3f-45b1-83e1-d2ea7fa8969b","resolution":{"observed_at":"2026-08-07T13:26:49.979183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:42.137327Z","title":"Accelerating diffusion models via early stop of the diffusion process, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.137327Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:e4d88eb9fadace7787b002c224b3b3d80a7b2c275bf6180923ed46118571a87b","observation_id":"08142e24-92d4-464d-89d3-4656676ee772","resolution":{"observed_at":"2026-08-07T13:26:42.137327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:42.222362Z","title":"Dip-go: A diffusion pruner via few-step gradient optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.222362Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:ddfd72c9799ef20bf23a74f89a2ac05b3d2806b2225f7ef1c12f2c09043a1fe5","observation_id":"ac700851-392c-47ef-9d35-e19c9ecbde12","resolution":{"observed_at":"2026-08-07T13:26:42.222362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:49.834540Z","title":"Faster diffusion: Rethinking the role of the encoder for diffusion model inference","venue":null,"work_id":"b6de8f3f-a4aa-4247-a76c-710b1e1d4dea","year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.322321Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:c3db10cd3e1ccee83ea2706688dd446d09f03897b1d7057177fa3669f30407d0","observation_id":"6f0766bd-10ef-4f34-ac5b-a0ebc69b27cd","resolution":{"observed_at":"2026-08-07T13:26:49.868050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:49.713781Z","title":"Learning-to-cache: Accelerating diffusion transformer via layer caching","venue":null,"work_id":"b446b432-224f-48fd-bb85-826f1c3c6b69","year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.435399Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:b66138b9093cdf89583d2e29954907a59369ee8bf90c1f5edb969c57097577bc","observation_id":"f1e98ef5-f4ab-40db-a069-ea413c356a5b","resolution":{"observed_at":"2026-08-07T13:26:49.801807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:49.475045Z","title":"Cache me if you can: Accelerating diffusion models through block caching","venue":null,"work_id":"d09e461b-04c3-4359-9c5d-928ff444f0ee","year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.523379Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:7c60e680b787895bb96b00789d84620efab0ccfa138c4fdf26da2a0e67d2c5c3","observation_id":"8785b09e-3769-4be6-9d8f-a110c73c3253","resolution":{"observed_at":"2026-08-07T13:26:49.576929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:42.648287Z","title":"Post-training quantization on diffusion models","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.648287Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:3a91b11152b5cdc70bd33e3cdddb3b1c870c1e28278b9adbf723e2882d1ee616","observation_id":"dc9a15b4-d3d1-486a-953a-24ca2b48dea8","resolution":{"observed_at":"2026-08-07T13:26:42.648287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:49.222792Z","title":"Temporal dynamic quantization for diffusion models.Advances in neural information processing systems, 36:48686–48698, 2023","venue":null,"work_id":"b3ff8b55-9b72-45f2-ab42-76b7ced3bfee","year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.745729Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:ea98097bd7669aa01c596da1ca4241c8955ef55eabd8a756d772daf7ebdee7f4","observation_id":"b09d6fec-f3e5-433f-8ab9-4f348bb37650","resolution":{"observed_at":"2026-08-07T13:26:49.338591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10629","last_updated":"2024-10-20T14:35:31Z","snapshot_observed_at":"2026-07-06T19:33:08.264958Z","submitted_at":"2024-10-14T15:36:42Z","title":"SANA: Efficient High-Resolution Image Synthesis with Linear Diffusion Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10629","snapshot_observed_at":"2026-08-07T13:26:42.836200Z","title":"Sana: Efficient high-resolution image synthesis with linear diffusion transformers.arXiv preprint arXiv:2410.10629, 2024","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.836200Z"},"links":{"cited_paper":"/paper/2410.10629","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:290b23c3121456de368a0ee4838df41b7b8631186a23606aadbb61fd34551995","observation_id":"d9610b3e-a0d7-4463-bf0c-9234d85c5c05","resolution":{"observed_at":"2026-08-07T13:26:42.836200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00149","last_updated":"2016-02-15T06:25:40Z","snapshot_observed_at":"2026-08-04T16:59:47.843960Z","submitted_at":"2015-10-01T09:03:44Z","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00149","snapshot_observed_at":"2026-08-07T13:26:42.932095Z","title":"Deep compression: Compressing deep neural net- works with pruning, trained quantization and huffman coding.arXiv preprint arXiv:1510.00149, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:42.932095Z"},"links":{"cited_paper":"/paper/1510.00149","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:faee30b70572e91941246584effd06dca2463f8f27f6f0afb7a574ba9f193bb2","observation_id":"9afae5dc-540b-4f92-a4c2-bded45021d1d","resolution":{"observed_at":"2026-08-07T13:26:42.932095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09574","last_updated":"2019-02-25T19:18:40Z","snapshot_observed_at":"2026-08-06T16:38:23.884750Z","submitted_at":"2019-02-25T19:18:40Z","title":"The State of Sparsity in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09574","snapshot_observed_at":"2026-08-07T13:26:43.019228Z","title":"The state of sparsity in deep neural networks.arXiv preprint arXiv:1902.09574, 2019","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.019228Z"},"links":{"cited_paper":"/paper/1902.09574","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:62516fc7adb270624467998cc64d3b82dabffcc00a0f710ca302e856fb097a1e","observation_id":"a346b8cd-a253-4c5c-9b7b-aa2e131af6ce","resolution":{"observed_at":"2026-08-07T13:26:43.019228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.06862","last_updated":"2023-06-23T05:41:26Z","snapshot_observed_at":"2026-07-06T15:02:25.281739Z","submitted_at":"2023-03-13T05:13:47Z","title":"OTOV2: Automatic, Generic, User-Friendly","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.06862","snapshot_observed_at":"2026-08-07T13:26:43.135686Z","title":"Otov2: Automatic, generic, user-friendly.arXiv preprint arXiv:2303.06862, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.135686Z"},"links":{"cited_paper":"/paper/2303.06862","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:fe440f9e19887d8c14e73da9de432ea8f4da31a10ec6a3ce509c9678bbd7e78f","observation_id":"c7a3fb70-8e7b-4539-93cd-b54cf5f4c013","resolution":{"observed_at":"2026-08-07T13:26:43.135686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:48.992876Z","title":"An accelerated doubly stochastic gradient method with faster explicit model identification","venue":null,"work_id":"755cc228-6dbb-4547-8a57-9240756bb4cb","year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.225426Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:81acc3df2b74dda32ea3818e47f697162cf04ab8e4b0355ee1e90c5ccfcdb43f","observation_id":"9ccb7383-9457-4698-a288-9fe3934f6c25","resolution":{"observed_at":"2026-08-07T13:26:49.121728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:48.792926Z","title":"Doubly sparse asynchronous learning for stochastic composite optimization","venue":null,"work_id":"4298f555-d751-4dd6-95bd-00ca90521d46","year":1916},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.353257Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:4e3d3513c8cb8d320c8a4fd8185c9da7a3dd28ede2446babe9c1ea5914cee0a2","observation_id":"28319253-eaf8-43c9-97ed-65dc204e1023","resolution":{"observed_at":"2026-08-07T13:26:48.881566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:48.532799Z","title":"Learning to prune deep neural networks via layer-wise optimal brain surgeon, 2017","venue":null,"work_id":"a957bea6-5240-4189-9347-405ef7e44dfb","year":2017},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.448064Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:8c4670a17ccc49f653277c72fba8ca6e7c613685451339b2d34e254ec93fe9ee","observation_id":"a4c6849c-0ff9-4813-a26f-25ceb34447b2","resolution":{"observed_at":"2026-08-07T13:26:48.663632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:48.333835Z","title":"Lookahead: A far-sighted alternative of magnitude-based pruning, 2020","venue":null,"work_id":"f7e0edf5-d58e-4d1e-93ca-bd23b26b5ff2","year":2020},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.564254Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:17fc7e7ee4e63dc47baac7779092a099b529b3b28c2d8cfec5b8eb687d1eba36","observation_id":"ebd6d388-d533-4ba5-99fa-7d23d02f8b78","resolution":{"observed_at":"2026-08-07T13:26:48.437114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:43.664006Z","title":"Sparsegpt: Massive language models can be accurately pruned in one-shot","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.664006Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:81b4daec61c16c53adf531869e2655b86c469441e6b52fa2090c5e8e3bbc461c","observation_id":"500cd1d1-7f4d-4835-b3fc-1bf5fdbb296c","resolution":{"observed_at":"2026-08-07T13:26:43.664006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-13T11:30:47.962636Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-08-07T13:26:43.815649Z","title":"Loraprune: Pruning meets low-rank parameter-efficient fine-tuning.arXiv preprint arXiv:2305.18403, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.815649Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:9e2d86a3fb565c9ace15cbc174c71a18c51449a436295a08a71b5208f16c465a","observation_id":"1f917454-8130-4c47-9291-100440aea80f","resolution":{"observed_at":"2026-08-07T13:26:43.815649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:48.089994Z","title":"Slicegpt: Compress large language models by deleting rows and columns","venue":null,"work_id":"35f58752-9e35-4d49-8da0-bb20617426d0","year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.916585Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:d1d36d7664cd1c300e9c8051c8d7c48939747157cf3578df05299d8b435dbb32","observation_id":"f7c14f6d-cbed-4787-a145-c0831ddd8169","resolution":{"observed_at":"2026-08-07T13:26:48.178101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:47.859858Z","title":"Structural pruning for diffusion models","venue":null,"work_id":"40e68f73-0de9-4704-b74f-ec9cbb8060ba","year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.029821Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:dde7b58b3d76c8ef93018dde57dbb28129262a61facd9de1890e84675f847aa0","observation_id":"3220ec1d-68b9-45d1-923d-ca8146724b72","resolution":{"observed_at":"2026-08-07T13:26:47.991011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:44.120121Z","title":"Snapfusion: Text-to-image diffusion model on mobile devices within two seconds.Advances in Neural Information Processing Systems, 36:20662–20678, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.120121Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:023659df39f82f514051c449ac23ea4a5d8b40ece1f1ff8a2ac608f2e5458888","observation_id":"f4721ac8-5530-4eb5-a5fa-4488cb4b98f6","resolution":{"observed_at":"2026-08-07T13:26:44.120121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:47.654002Z","title":"Diffusion probabilistic model made slim, 2022","venue":null,"work_id":"d7b6d8f8-cc12-4a93-aa4c-824daecad592","year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.237135Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:6dc1c41952369a84b778a8c13836c14e37abfbd04368354fbf6750a760bd0ca3","observation_id":"88a0caa5-2ecc-47bf-9450-6f7415e51506","resolution":{"observed_at":"2026-08-07T13:26:47.717623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.15798","last_updated":"2024-12-02T12:58:23Z","snapshot_observed_at":"2026-08-13T11:33:46.339949Z","submitted_at":"2023-05-25T07:28:28Z","title":"BK-SDM: A Lightweight, Fast, and Cheap Version of Stable Diffusion","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15798","snapshot_observed_at":"2026-08-07T13:26:44.338070Z","title":"Bk-sdm: A lightweight, fast, and cheap version of stable diffusion.arXiv preprint arXiv:2305.15798, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.338070Z"},"links":{"cited_paper":"/paper/2305.15798","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:59562ab25da64066d5a60fd10d29eea3f6c291d0bfe09ab65cb1988d46a658c8","observation_id":"b5ca6529-7e73-4874-9aa2-068d58790edf","resolution":{"observed_at":"2026-08-07T13:26:44.338070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:47.585111Z","title":"Dynamic diffusion transformer","venue":null,"work_id":"676ad301-0fff-4f4e-882f-d572eaf94134","year":2025},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.465071Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:cfe6bbde347bde164d4fea161ed47e8d360a20212dd3ca50a22fdbdecf11c07d","observation_id":"8415acf1-4361-47ea-9f33-77cdda024bed","resolution":{"observed_at":"2026-08-07T13:26:47.620967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:44.559255Z","title":"Glam: Efficient scaling of language models with mixture-of-experts","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.559255Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:6cec4e1d21e89dce81ffb9e723e2cb51f0349b4ce8b7578db9a7a3bc57468b0e","observation_id":"517206ab-ead5-4cc4-8da7-a340dfd44925","resolution":{"observed_at":"2026-08-07T13:26:44.559255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04088","last_updated":"2024-01-08T18:47:34Z","snapshot_observed_at":"2026-08-08T06:16:25.839566Z","submitted_at":"2024-01-08T18:47:34Z","title":"Mixtral of Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04088","snapshot_observed_at":"2026-08-07T13:26:44.663680Z","title":"Mixtral of experts.arXiv preprint arXiv:2401.04088, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.663680Z"},"links":{"cited_paper":"/paper/2401.04088","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:bd50d8e7460b0a2172a54e646d0c7adc50a43a9ee12f1491d56deb5d603af697","observation_id":"729758f1-ea9a-4b58-b05e-5e01bbb395ca","resolution":{"observed_at":"2026-08-07T13:26:44.663680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:47.467287Z","title":"Self-moe: Towards compositional large language models with self-specialized experts, 2024","venue":null,"work_id":"90c3b1aa-3fcc-4448-b11c-2fe7f3ae6838","year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.752778Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:04c4326dc654472dc041c55cf8a2f9cc2280cd41fb667ec5f76b072adc1d78f1","observation_id":"76799ad0-ea43-4e57-9093-ced6f4fb3363","resolution":{"observed_at":"2026-08-07T13:26:47.525593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:47.335843Z","title":"To- moe: Converting dense large language models to mixture-of-experts through dynamic structural pruning, 2025","venue":null,"work_id":"4a0f6e7b-7dce-4941-866c-5d736ecd8895","year":2025},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.861776Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:2c9f2740b0cc5952829f8fa4fcaec8e9289d2a7363eedc585c8ce1117311362d","observation_id":"aed279ae-cebe-48d6-8a43-35bc800df1c5","resolution":{"observed_at":"2026-08-07T13:26:47.394849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:47.229758Z","title":"Mixture of efficient diffusion experts through automatic interval and sub-network selection","venue":null,"work_id":"ad6d284d-9f1a-4992-aab2-c891fdbcf5e1","year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:44.938610Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:3641fb068addd3b99341a5e58843e9ba927b49fdde95459ab1b978698f878bdd","observation_id":"4a4dd355-db97-4f15-858f-7615e824fad8","resolution":{"observed_at":"2026-08-07T13:26:47.296721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:47.128889Z","title":"EC-DIT: Scaling diffusion transformers with adaptive expert-choice routing","venue":null,"work_id":"7799d920-2ab0-41ab-8f23-44d954452964","year":2025},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.053005Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:e3d8753fb278c5d4e10be5248ae955d4cab45ba2e9e5bbf5f74817baadf3e04e","observation_id":"ad660535-699d-4f80-9aea-78fb63cbb7d5","resolution":{"observed_at":"2026-08-07T13:26:47.158991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:45.152762Z","title":"Attention is all you need.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.152762Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:ec1b4b305c9bce0d45e21e396336cf7210e0d8743ad34b32bbe5c73ff94cede3","observation_id":"0319b9d7-4465-492a-a574-e6712320c5c4","resolution":{"observed_at":"2026-08-07T13:26:45.152762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:45.226652Z","title":"U-net: Convolutional networks for biomedical image segmentation","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.226652Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:0b3e749c0f8a97c5a846ea6dfd79e1c8eb36323e7c4956932b2e20682da43b20","observation_id":"f6b82647-66c4-4f0b-af31-b42270f728c0","resolution":{"observed_at":"2026-08-07T13:26:45.226652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:45.294970Z","title":"Diffusion models beat gans on image synthesis","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.294970Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:cb211dd07607e7cdd3ee72e6a500ad2016cc28f0b1c06000e31334a58dd96573","observation_id":"831eb1dd-f98f-4808-b337-483e12691831","resolution":{"observed_at":"2026-08-07T13:26:45.294970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01144","last_updated":"2017-08-05T22:45:19Z","snapshot_observed_at":"2026-08-01T18:34:23.156273Z","submitted_at":"2016-11-03T19:48:08Z","title":"Categorical Reparameterization with Gumbel-Softmax","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01144","snapshot_observed_at":"2026-08-07T13:26:45.414649Z","title":"Categorical reparameterization with gumbel-softmax","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.414649Z"},"links":{"cited_paper":"/paper/1611.01144","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:99e0e635a62067671db68d73a99d0462f3b7361349b37faca879e468ba26134a","observation_id":"2de5599e-5dd9-4a6b-831e-0343e95912d7","resolution":{"observed_at":"2026-08-07T13:26:45.414649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:46.941548Z","title":"{GS}hard: Scaling giant models with conditional computation and automatic sharding","venue":null,"work_id":"87635487-46f2-40a4-b5d4-e73718fa4fd2","year":2021},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.492684Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:2e1b4431b624cb3ab6e6ece8a71341c41f2a1f8614cd9380ceb9e03ef11f67af","observation_id":"f0ee0718-5c71-48eb-b9e0-a8cdf28ce2fa","resolution":{"observed_at":"2026-08-07T13:26:47.005382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:45.543883Z","title":"Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity.Journal of Machine Learning Research, 23(120):1–39, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.543883Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:228b792febe656881269a56caa32a23f5d306d7370eb988368b8d82f85ca1b2d","observation_id":"bf01e1a3-ed24-46e3-bd31-25450f1027e3","resolution":{"observed_at":"2026-08-07T13:26:45.543883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:45.621457Z","title":"Laion- 5b: An open large-scale dataset for training next generation image-text models.Advances in neural information processing systems, 35:25278–25294, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.621457Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:7bb4d521577c283ba938409e736acb4f8aac7bc231a325d09367b357895b5294","observation_id":"41a02c16-ae01-42f9-a6a0-0eefeb58f4e9","resolution":{"observed_at":"2026-08-07T13:26:45.621457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:46.766404Z","title":"Conceptual captions: A cleaned, hypernymed, image alt-text dataset for automatic image captioning","venue":null,"work_id":"de569ad6-e75e-45ca-9971-39b569988eeb","year":2018},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.712887Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:effc1b4629260510f33cac2cb568fe6e9a4dca276b0bfddfc184e792fcc676e8","observation_id":"4667866d-d877-4e45-8f0c-7ec4270e32b1","resolution":{"observed_at":"2026-08-07T13:26:46.858800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:45.833008Z","title":"Microsoft coco: Common objects in context","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.833008Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:b4893123561ee97842870c6090960a09b3102812414db16e987c4b1afbfa6b53","observation_id":"3a71c832-f954-4f73-9b3c-611ab2dbce7a","resolution":{"observed_at":"2026-08-07T13:26:45.833008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:45.923763Z","title":"Gans trained by a two time-scale update rule converge to a local nash equilibrium.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:45.923763Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:bb0d9738a62569a81cd48e28b82cf9d00e2bf51aca9f7e8e23e65d1483c768ab","observation_id":"e0e313c5-1a04-4230-b8a8-339cca75f731","resolution":{"observed_at":"2026-08-07T13:26:45.923763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:46.015698Z","title":"Rethinking fid: Towards a better evaluation metric for image generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:46.015698Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:2286a12d31580e932b92bcfcd007567d1b7aa55ed2f35ee44ed23b2a200a373d","observation_id":"daf4e37e-e9ba-4a2d-8b35-1c2c3fa8e5c4","resolution":{"observed_at":"2026-08-07T13:26:46.015698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08718","last_updated":"2022-03-23T19:47:21Z","snapshot_observed_at":"2026-07-06T11:01:02.207193Z","submitted_at":"2021-04-18T05:00:29Z","title":"CLIPScore: A Reference-free Evaluation Metric for Image Captioning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08718","snapshot_observed_at":"2026-08-07T13:26:46.094525Z","title":"Clipscore: A reference-free evaluation metric for image captioning.arXiv preprint arXiv:2104.08718, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:46.094525Z"},"links":{"cited_paper":"/paper/2104.08718","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:2c8cb237219c3a1060c77cc538f103ad1cd147e9ea9a189a52539ec1ce8cf8d9","observation_id":"ac1958bb-4197-4323-9ce1-e552dc9694ef","resolution":{"observed_at":"2026-08-07T13:26:46.094525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1308.3432","last_updated":"2013-08-15T15:19:34Z","snapshot_observed_at":"2026-08-11T05:54:56.124984Z","submitted_at":"2013-08-15T15:19:34Z","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.3432","snapshot_observed_at":"2026-08-07T13:26:46.190647Z","title":"Estimating or propagating gradients through stochastic neurons for conditional computation.arXiv preprint arXiv:1308.3432, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:46.190647Z"},"links":{"cited_paper":"/paper/1308.3432","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:e912720bccc4864ccab494031197c52a245fdf3bccb09bf4c0745d3a503042b7","observation_id":"142fe4fc-64ea-4950-b146-b0a3464d90a8","resolution":{"observed_at":"2026-08-07T13:26:46.190647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:26:46.295461Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:46.295461Z"},"links":{"citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:80b689f0ce43fb88bb8410764070e7dc19efdefb6d4623ec57aa6fe7964d7977","observation_id":"fa5ecffd-ffd1-48c0-b501-12809455cf9e","resolution":{"observed_at":"2026-08-07T13:26:46.295461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.12598","last_updated":"2022-07-26T01:42:07Z","snapshot_observed_at":"2026-08-12T19:28:23.372660Z","submitted_at":"2022-07-26T01:42:07Z","title":"Classifier-Free Diffusion Guidance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.12598","snapshot_observed_at":"2026-08-07T13:26:46.404857Z","title":"Classifier-free diffusion guidance.arXiv preprint arXiv:2207.12598, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:46.404857Z"},"links":{"cited_paper":"/paper/2207.12598","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:629363e90ff8d7803fddb1368a732e5b18fb91204521706de56578c13917a70d","observation_id":"701b981f-4e79-4b58-ac1e-0e2457bfa7c1","resolution":{"observed_at":"2026-08-07T13:26:46.404857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-12T23:54:59.288169Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation"},"reference_resolution":{"displayed":72,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":28},"total_outbound_references":72},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 72 of 72 outbound references and 0 inbound Pith citation observations for arXiv:2505.21817."}