{"as_of":"2026-08-22T03:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f83955d13dc9228631d50b0a5e3cf5ce59b9b38da9bfabb23979f315652b6f5","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:53:40.764765Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2506.14753/citation-record","integrity":"/paper/2506.14753/integrity","json":"/paper/2506.14753/citation-record.json","paper":"/paper/2506.14753"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8010.2817","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:53:40.891965Z","title":"Note that the produced image may be from a non-SDXL model (e.g., Turbo) since our approach may route to other baseline models described in Section 5.1","venue":null,"work_id":"3ea4f1ca-e439-4baa-b845-fca560ca11d4","year":2024},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.755075Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:7a5431b52985ca47b34a3e7eea761ba132f55e2bf040ce2c4905fec50a2c8257","observation_id":"017e64b6-ea23-4cf5-b7fb-84a0e77ba68b","resolution":{"observed_at":"2026-08-15T19:53:40.901945Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:53:41.785481Z","title":"Routerbench: A benchmark for multi-LLM routing system","venue":null,"work_id":"270faf40-0979-4387-90ee-4562723f62b1","year":2024},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.514214Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:98e5811f9409e6360566c5b0272aa8b2984543f66671194574cb8b2d3e63a914","observation_id":"c887f454-302a-45ea-8443-fa7bfd04deaf","resolution":{"observed_at":"2026-08-15T19:53:41.790533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:53:41.770669Z","title":"Dongfu Jiang, Xiang Ren, and Bill Yuchen Lin","venue":null,"work_id":"c3556c19-49d9-4b1a-a004-6a744925a21f","year":2023},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.519127Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:d50cd5a67f1732ce3f98e0f7b229f0eaf3306af1e4df9197874c1a7192b7c894","observation_id":"5eb5ee88-0356-4d63-bc95-d277af496ec9","resolution":{"observed_at":"2026-08-15T19:53:41.775181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08773","last_updated":"2025-07-22T15:27:33Z","snapshot_observed_at":"2026-08-18T13:29:57.105910Z","submitted_at":"2025-02-12T20:30:28Z","title":"Universal Model Routing for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08773","snapshot_observed_at":"2026-08-15T19:53:40.524743Z","title":"Lynn H Kaack, Priya L Donti, Emma Strubell, George Kamiya, Felix Creutzig, and David Rolnick","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.524743Z"},"links":{"cited_paper":"/paper/2502.08773","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:8a1215a142efceb702733716f4bf85836ae3fc6888e6fa37e230993fbcb3a4ca","observation_id":"5bab3377-aa11-473b-b9f5-d70b351f1a4e","resolution":{"observed_at":"2026-08-15T19:53:40.524743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-08-14T23:50:45.029465Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-15T19:53:40.529668Z","title":"Steven Kolawole, Don Dennis, Ameet Talwalkar, and Virginia Smith","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.529668Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:3e0d9fdda49984cdd5fbc05ea4bfa6b096c80c16c0df5da60edfe6f03546bb10","observation_id":"3809af2f-6565-4083-a814-bcfb236c2576","resolution":{"observed_at":"2026-08-15T19:53:40.529668Z","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-15T19:53:40.534409Z","title":"Lijiang Li, Huixia Li, Xiawu Zheng, Jie Wu, Xuefeng Xiao, Rui Wang, Min Zheng, Xin Pan, Fei Chao, and Rongrong Ji","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.534409Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:7d287d6e533abc029b3d2df4f1499bb2eadb3477a0d0013e1a537b5dab3783a3","observation_id":"19ab514d-a705-4a2f-ad6c-e0fa1aa42d68","resolution":{"observed_at":"2026-08-15T19:53:40.534409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13929","last_updated":"2024-03-02T09:09:32Z","snapshot_observed_at":"2026-08-12T13:08:43.602176Z","submitted_at":"2024-02-21T16:51:05Z","title":"SDXL-Lightning: Progressive Adversarial Diffusion Distillation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13929","snapshot_observed_at":"2026-08-15T19:53:40.539502Z","title":"Sdxl-lightning: Progressive adversarial diffusion distillation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.539502Z"},"links":{"cited_paper":"/paper/2402.13929","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:7521ac7102d9828ba5538baea495841819114902a05ffb4726d201967b272f5e","observation_id":"1c169b05-b5e3-4074-bcb1-2910be1d6bc0","resolution":{"observed_at":"2026-08-15T19:53:40.539502Z","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-15T19:53:41.691178Z","title":null,"venue":null,"work_id":"83e196f4-be52-4124-aef5-49b352116ec4","year":2026},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.544536Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:5429e680e517425720444e4cbe371d8124d4859d92cd378554041ce553cccb4b","observation_id":"b0b0aa46-3b77-4fa6-865b-f63b04035b01","resolution":{"observed_at":"2026-08-15T19:53:41.759114Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04378","last_updated":"2023-10-06T17:11:58Z","snapshot_observed_at":"2026-08-20T13:49:06.053430Z","submitted_at":"2023-10-06T17:11:58Z","title":"Latent Consistency Models: Synthesizing High-Resolution Images with Few-Step Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04378","snapshot_observed_at":"2026-08-15T19:53:40.554479Z","title":"Latent consistency models: Synthesizing high-resolution images with few-step inference.arXiv preprint arXiv:2310.04378,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.554479Z"},"links":{"cited_paper":"/paper/2310.04378","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:9c81ab475dd2dc0d1f1ddee1079e71e07c757820f5ab24f9849c1a3b201d79b8","observation_id":"75fd81c0-ae9d-4f9d-bb2b-9f11aa90bb64","resolution":{"observed_at":"2026-08-15T19:53:40.554479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12066","last_updated":"2023-02-23T14:43:53Z","snapshot_observed_at":"2026-08-19T21:01:42.589163Z","submitted_at":"2023-02-23T14:43:53Z","title":"Teaching CLIP to Count to Ten","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12066","snapshot_observed_at":"2026-08-15T19:53:40.559697Z","title":"Roni Paiss, Ariel Ephrat, Omer Tov, Shiran Zada, Inbar Mosseri, Michal Irani, and Tali Dekel","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.559697Z"},"links":{"cited_paper":"/paper/2302.12066","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:96204ccc254c4c6223e215921f0d4f351fbe8f10684c07a34ebad134e4499114","observation_id":"809e0a11-982e-4ad4-89ca-e5ec82421277","resolution":{"observed_at":"2026-08-15T19:53:40.559697Z","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-15T19:53:41.531630Z","title":"Local laplacian filters: Edge-aware image processing with a laplacian pyramid.ACM Trans","venue":null,"work_id":"47dbb544-0c35-4a62-8a3f-53b50dc6ded5","year":2026},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.569546Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:67ec978129659a2c7b9bb89ac3168231dda520ebf26ea9be56963b9514902728","observation_id":"4e2dafd1-569b-40f3-9720-2205d96bc179","resolution":{"observed_at":"2026-08-15T19:53:41.611379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.01952","last_updated":"2023-07-04T23:04:57Z","snapshot_observed_at":"2026-08-14T22:54:08.184266Z","submitted_at":"2023-07-04T23:04:57Z","title":"SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.01952","snapshot_observed_at":"2026-08-15T19:53:40.581147Z","title":"Konpat Preechakul, Nattanat Chatthee, Suttisak Wizadwongsa, and Supasorn Suwajanakorn","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.581147Z"},"links":{"cited_paper":"/paper/2307.01952","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:dd4bd1b34f83bfcf5592e0d38e77b0ffb6d2fdf08b85d3fa841e2f707e20a18b","observation_id":"dac75255-f690-4886-9ea4-ffa6010e17c8","resolution":{"observed_at":"2026-08-15T19:53:40.581147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11487","last_updated":"2022-05-23T17:42:53Z","snapshot_observed_at":"2026-08-17T05:51:02.087480Z","submitted_at":"2022-05-23T17:42:53Z","title":"Photorealistic Text-to-Image Diffusion Models with Deep Language Understanding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11487","snapshot_observed_at":"2026-08-15T19:53:40.622457Z","title":"Tim Salimans and Jonathan Ho","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.622457Z"},"links":{"cited_paper":"/paper/2205.11487","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:44286b7640a55c4e59ca1a0c79a1591a8645b1a4c93d00fc6b6d2eafaef6904e","observation_id":"afe1ad4d-d341-48bd-955f-b5fe51d70e93","resolution":{"observed_at":"2026-08-15T19:53:40.622457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12015","last_updated":"2024-03-18T17:51:43Z","snapshot_observed_at":"2026-08-20T12:01:11.792514Z","submitted_at":"2024-03-18T17:51:43Z","title":"Fast High-Resolution Image Synthesis with Latent Adversarial Diffusion Distillation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12015","snapshot_observed_at":"2026-08-15T19:53:40.672932Z","title":"Fasthigh- resolution image synthesis with latent adversarial diffusion distillation.arXiv preprint arXiv:2403.12015,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.672932Z"},"links":{"cited_paper":"/paper/2403.12015","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:7269ae64771722ebfa286584c165550f84849844fde96cef2de45981db6f10ad","observation_id":"29f6b961-461a-45a5-92e7-687e65420f1b","resolution":{"observed_at":"2026-08-15T19:53:40.672932Z","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-15T19:53:40.715379Z","title":"ISBN 9781713871088","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.715379Z"},"links":{"cited_paper":"/paper/2010.02502","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:4aca6245b00d6c9003f8af13fcb3ab6dfcac0839766bd17518355e8be9fc2928","observation_id":"016e84e7-fe28-437f-b47c-767904d22ba8","resolution":{"observed_at":"2026-08-15T19:53:40.715379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02683","last_updated":"2024-05-13T05:42:03Z","snapshot_observed_at":"2026-08-16T14:12:47.612564Z","submitted_at":"2024-03-05T06:10:28Z","title":"Learning to Defer to a Population: A Meta-Learning Approach","version":2},"cited_work":{"arxiv_id":"2403.02683","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.02683","snapshot_observed_at":"2026-08-15T19:53:40.969576Z","title":"Learning to Defer to a Population: A Meta-Learning Approach","venue":"cs.LG","work_id":"c3e88928-9f15-411b-93ef-96c4a8f2feac","year":2024},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.725279Z"},"links":{"cited_paper":"/paper/2403.02683","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:22504e4cca558e77a88d67064abe4afb58356271875c64e0c484d3f979a863f8","observation_id":"e81cfd5b-82cf-4b82-b1b3-d04d98b68263","resolution":{"observed_at":"2026-08-15T19:53:40.986640Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:53:41.442424Z","title":"Attention is all you need.Advances in neural information processing systems, 30,","venue":null,"work_id":"28c5cb1a-468d-42c2-ba87-fc9d93b3adae","year":2026},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.730164Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:56059d2546a6e6d31c067b53959ffa780e591c897bbe334b4b99502f5ef8a17d","observation_id":"a05beb55-e705-460f-9245-21d49db278de","resolution":{"observed_at":"2026-08-15T19:53:41.447034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14896","last_updated":"2023-07-06T11:53:19Z","snapshot_observed_at":"2026-08-16T16:20:53.427900Z","submitted_at":"2022-10-26T17:54:20Z","title":"DiffusionDB: A Large-scale Prompt Gallery Dataset for Text-to-Image Generative Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.14896","snapshot_observed_at":"2026-08-15T19:53:40.734661Z","title":"Kitani, Yair Movshovitz-Attias, and Elad Eban","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.734661Z"},"links":{"cited_paper":"/paper/2210.14896","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:21311bb77eda6a2e0698e9423c1add69a8d00d3333dfb7d01cd2137389ba4f3c","observation_id":"3833e599-92c0-4253-a492-be1577b2f1fc","resolution":{"observed_at":"2026-08-15T19:53:40.734661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03337","last_updated":"2024-05-24T09:17:29Z","snapshot_observed_at":"2026-08-16T14:54:54.138565Z","submitted_at":"2023-10-05T06:44:13Z","title":"Denoising Diffusion Step-aware Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03337","snapshot_observed_at":"2026-08-15T19:53:40.739558Z","title":"Denoising diffusion step-aware models.arXiv preprint arXiv:2310.03337,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.739558Z"},"links":{"cited_paper":"/paper/2310.03337","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:36e9ae113e8683c0ca3a004233fa58196852303d3c6c14070732f9f1adbcd06a","observation_id":"dbcd40ac-070b-4e4d-8247-f273b2ec64b1","resolution":{"observed_at":"2026-08-15T19:53:40.739558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.14768","last_updated":"2024-12-28T08:23:34Z","snapshot_observed_at":"2026-08-16T14:40:42.429197Z","submitted_at":"2023-11-24T11:20:38Z","title":"AdaDiff: Adaptive Step Selection for Fast Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.14768","snapshot_observed_at":"2026-08-15T19:53:40.744085Z","title":"Adadiff: Adaptive step selection for fast diffusion.ArXiv, abs/2311.14768,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.744085Z"},"links":{"cited_paper":"/paper/2311.14768","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:7d2fb51967b03ace537d30f169bb9fdfc066e7e2aebeef96d849d197ee487c08","observation_id":"ae61a99f-5be1-4259-a350-c15dbbd2861e","resolution":{"observed_at":"2026-08-15T19:53:40.744085Z","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-15T19:53:41.427726Z","title":null,"venue":null,"work_id":"0d8504f9-c6cc-4443-818f-4e9b83ca5e4b","year":2021},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.749113Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:9ee71df76c0d553e5d0198df6ec422f6e36eaccbfae723a85720bfdedf6c865b","observation_id":"73b43627-f937-40f1-abe4-2ac53f4ad481","resolution":{"observed_at":"2026-08-15T19:53:41.432232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:53:41.412578Z","title":"Here we can clearly see how our adaptive routing consistently achieves a higher quality score than the fixed-model baselines at every computational budget","venue":null,"work_id":"2e965efa-fb52-4641-a17c-7e9138c175c8","year":2026},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.760039Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:6ce07c48393818fcdf1bceb11067d8bd26811fb22feb8a5e34ab00da68e79240","observation_id":"2b3c47cb-d7a6-415c-a4c9-aceedc37eeef","resolution":{"observed_at":"2026-08-15T19:53:41.417341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:53:41.397250Z","title":"Indeed, it makes use of the ground-truth quality labelyto make a routing decision","venue":null,"work_id":"2b2fdc3d-c3c0-4337-893c-91946f2f2b74","year":2024},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.764765Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:a1b7f7507e653b599d4b067acfdaf8105ead69abe870b0c908511aacfc7e787f","observation_id":"772f792b-f4bb-4642-8018-51d7f42ef1b0","resolution":{"observed_at":"2026-08-15T19:53:41.402186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.09778","last_updated":"2022-10-31T09:05:25Z","snapshot_observed_at":"2026-08-16T17:20:02.890207Z","submitted_at":"2022-02-20T10:37:52Z","title":"Pseudo Numerical Methods for Diffusion Models on Manifolds","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.09778","snapshot_observed_at":"2026-08-15T19:53:40.549225Z","title":"Pseudo numerical methods for diffusion models on manifolds","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.549225Z"},"links":{"cited_paper":"/paper/2202.09778","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:df11734dc76a4d126a0ce294d400fc7f7ab5254b4ce616416eda8cb34e7ff1c5","observation_id":"62f2bbf6-e2f7-46e7-8fa5-7d1ace1332a1","resolution":{"observed_at":"2026-08-15T19:53:40.549225Z","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-15T19:53:41.799881Z","title":"Examples are grouped by the three most frequently selected models: Infinity, Turbo, and FLUX-15","venue":null,"work_id":"adbf536a-d3d1-41f4-8493-512d9352cd45","year":2026},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.504047Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:e1e6b16a44e503241573bb6235bb1e3b939b71df856623bc0f28f22f72db5c11","observation_id":"36064ff6-8088-46b2-87fa-c0e523b50f99","resolution":{"observed_at":"2026-08-15T19:53:41.804278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-08-10T11:59:11.481480Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-15T19:53:40.498441Z","title":"Frugalgpt: How to use large language models while reducing cost and improving performance, 2023a","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.498441Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:01917e41f0e24115adc57ba030e04af9511b835644b53494220b96502e982cc1","observation_id":"3c5c32ff-e3f5-4852-a88e-573b0cad05a6","resolution":{"observed_at":"2026-08-15T19:53:40.498441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.01469","last_updated":"2023-05-31T06:17:10Z","snapshot_observed_at":"2026-08-15T07:00:23.337991Z","submitted_at":"2023-03-02T18:30:16Z","title":"Consistency Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.01469","snapshot_observed_at":"2026-08-15T19:53:40.720564Z","title":"Consistency models.arXiv preprint arXiv:2303.01469,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.720564Z"},"links":{"cited_paper":"/paper/2303.01469","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:b0ace27825fa29056fa0b3d4c81f06cd9786f2a85c37f0b04285b6705668c991","observation_id":"6970a9ba-a556-464c-8dad-f6421a0f239c","resolution":{"observed_at":"2026-08-15T19:53:40.720564Z","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-15T19:53:41.813848Z","title":null,"venue":null,"work_id":"21d85421-26bb-4b37-8d7f-9ca72e68ae64","year":2022},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.487438Z"},"links":{"citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:dc3d42e78bc57b95f5f7dd0f048c51c165b793b88da2d1118c08a2c9cfd50e63","observation_id":"d3f3ddde-6bca-4eaf-80e2-a8d09ce0d220","resolution":{"observed_at":"2026-08-15T19:53:41.817929Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14167","last_updated":"2024-02-21T23:08:54Z","snapshot_observed_at":"2026-08-21T22:57:51.458176Z","submitted_at":"2024-02-21T23:08:54Z","title":"T-Stitch: Accelerating Sampling in Pre-Trained Diffusion Models with Trajectory Stitching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14167","snapshot_observed_at":"2026-08-15T19:53:40.564721Z","title":"T-stitch: Accelerating sampling in pre-trained diffusion models with trajectory stitching","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.564721Z"},"links":{"cited_paper":"/paper/2402.14167","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:f77879db02dcf8dcec990a68923a676d3d0d49f70618483c105b203c2c5dcbe4","observation_id":"36697830-0ea2-4620-a526-1a9b5719267f","resolution":{"observed_at":"2026-08-15T19:53:40.564721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04431","last_updated":"2025-06-17T15:32:20Z","snapshot_observed_at":"2026-08-15T00:31:45.808844Z","submitted_at":"2024-12-05T18:53:02Z","title":"Infinity: Scaling Bitwise AutoRegressive Modeling for High-Resolution Image Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04431","snapshot_observed_at":"2026-08-15T19:53:40.509108Z","title":"Martin Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, and Sepp Hochreiter","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.509108Z"},"links":{"cited_paper":"/paper/2412.04431","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:8ef0c40d454e8ed6f04c62cbb5b5f6ae0c0a1a33ad7fea06e94824c84fe68a5c","observation_id":"815634e2-69f7-48b8-862f-8c514f1bedff","resolution":{"observed_at":"2026-08-15T19:53:40.509108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10210","last_updated":"2024-06-14T17:46:08Z","snapshot_observed_at":"2026-08-16T13:42:52.013374Z","submitted_at":"2024-06-14T17:46:08Z","title":"Make It Count: Text-to-Image Generation with an Accurate Number of Objects","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10210","snapshot_observed_at":"2026-08-15T19:53:40.493097Z","title":"Make it count: Text-to-image generation with an accurate number of objects.arXiv preprint arXiv:2406.10210,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T19:53:40.493097Z"},"links":{"cited_paper":"/paper/2406.10210","citing_paper":"/paper/2506.14753"},"observation_digest":"sha256:2d9888e8aa9659c8673dd6ead693412b3f9faec8bac968a6351a98bfb972370b","observation_id":"de0dc7a0-55e4-412f-802e-77f6fea83c8d","resolution":{"observed_at":"2026-08-15T19:53:40.493097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.14753","last_updated":"2026-06-08T19:11:12Z","latest_version":3,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-19T21:02:02.195667Z","submitted_at":"2025-06-17T17:48:50Z","title":"Cost-Aware Routing for Efficient Text-To-Image Generation"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":22,"verified_exact":1,"verified_fuzzy":7},"total_outbound_references":31},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2506.14753."}