{"as_of":"2026-08-09T19:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d8ee86b0160cf06cc1719fd3605259209dbb0fae8306beb0e11e6c5157d4aa7e","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:30:26.749910Z","state":"measured"},{"denominator":82,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":82,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":35,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T20:56:22.970265Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-07T20:56:22.970265Z","title":"Train for the worst, plan for the best: Understanding token ordering in masked diffusions, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.09622","last_updated":"2025-06-09T02:36:10Z","snapshot_observed_at":"2026-08-09T10:13:05.522551Z","submitted_at":"2025-02-13T18:59:47Z","title":"Theoretical Benefit and Limitation of Diffusion Language Model","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T20:56:22.970265Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2502.09622"},"observation_digest":"sha256:ec9639979c7244daf83584e2d43b661dc0c961d3889acb49e6c6518b11e0cc7d","observation_id":"73e3c32e-5a1d-46d3-b944-e5ee4a85b4b8","resolution":{"observed_at":"2026-08-07T20:56:22.970265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-07T15:17:08.927585Z","title":"Train for the worst, plan for the best: Understanding token ordering in masked diffusions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15781","last_updated":"2025-05-21T17:32:10Z","snapshot_observed_at":"2026-08-07T15:09:37.600857Z","submitted_at":"2025-05-21T17:32:10Z","title":"dKV-Cache: The Cache for Diffusion Language Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:08.927585Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2505.15781"},"observation_digest":"sha256:a673e3d4688158f861d17274c69e90fbbf59f786ded34ac2aad49a70b9587a08","observation_id":"2ef2e5c8-0bcf-4e0b-8515-c33e7a294742","resolution":{"observed_at":"2026-08-07T15:17:08.927585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-07T15:08:29.031812Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16135","last_updated":"2025-05-22T02:24:35Z","snapshot_observed_at":"2026-08-09T09:48:39.463552Z","submitted_at":"2025-05-22T02:24:35Z","title":"Sudoku-Bench: Evaluating creative reasoning with Sudoku variants","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T15:08:29.031812Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2505.16135"},"observation_digest":"sha256:3878f297682d7cf4a5ccc9e10dcad24600f6040334dd6b3262265e17092c0e1d","observation_id":"43f65ed7-2bae-46c6-a305-931092ef3461","resolution":{"observed_at":"2026-08-07T15:08:29.031812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-07T12:35:39.784074Z","title":"Train for the worst, plan for the best: Understanding token ordering in masked diffusions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24857","last_updated":"2025-05-30T17:52:55Z","snapshot_observed_at":"2026-08-09T03:22:15.363687Z","submitted_at":"2025-05-30T17:52:55Z","title":"Accelerated Sampling from Masked Diffusion Models via Entropy Bounded Unmasking","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:39.784074Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2505.24857"},"observation_digest":"sha256:df46fb94ff29d46e1cadf961bfc7832e98b3263066fe124131500dedf9a77342","observation_id":"7e911319-7361-4d72-8b4a-5841c0f56d71","resolution":{"observed_at":"2026-08-07T12:35:39.784074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T13:20:05.294669Z","title":"Train for the worst, plan for the best: Understanding token ordering in masked diffusions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.01025","last_updated":"2025-09-07T22:48:13Z","snapshot_observed_at":"2026-08-06T04:06:34.224683Z","submitted_at":"2025-08-31T23:34:53Z","title":"Any-Order Flexible Length Masked Diffusion","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T13:20:05.294669Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2509.01025"},"observation_digest":"sha256:be96afbd9d4d3df056b409a06ec68687be76f3f670bce0524a579ae37b00e918","observation_id":"449b9824-08f5-4a6f-8112-d8945380d6c1","resolution":{"observed_at":"2026-08-05T13:20:05.294669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-04T22:56:05.196551Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.06949","last_updated":"2025-09-08T17:58:06Z","snapshot_observed_at":"2026-08-09T09:48:13.360348Z","submitted_at":"2025-09-08T17:58:06Z","title":"Revolutionizing Reinforcement Learning Framework for Diffusion Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T22:56:05.196551Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2509.06949"},"observation_digest":"sha256:05ceb5c3ecdd97730b001d26440aa186a9dc80c38ab1bddc8aa2df0fbf71da72","observation_id":"1553b1ed-37af-4d21-b099-ebc5fba74812","resolution":{"observed_at":"2026-08-04T22:56:05.196551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-04T13:15:31.716146Z","title":"Train for the worst, plan for the best: Understanding token ordering in masked diffusions.arXiv preprint arXiv:2502.06768,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.01384","last_updated":"2026-05-22T19:48:31Z","snapshot_observed_at":"2026-08-09T16:34:10.718069Z","submitted_at":"2025-10-01T19:15:25Z","title":"Fine-Tuning Masked Diffusion for Provable Self-Correction","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T13:15:31.716146Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2510.01384"},"observation_digest":"sha256:6239188df5ee1c10e00ab1f6696f2bd1791e2ffea954bdf23e3c8fde807570d4","observation_id":"9b6bd5dd-0b28-436a-8044-aa8bd7b12cb1","resolution":{"observed_at":"2026-08-04T13:15:31.716146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2510.03206","last_updated":"2026-05-12T17:53:41Z","snapshot_observed_at":"2026-07-06T22:31:40.462674Z","submitted_at":"2025-10-03T17:44:41Z","title":"Coevolutionary Continuous Discrete Diffusion: Make Your Diffusion Language Model a Latent Reasoner","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T10:15:10.746336Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2510.03206"},"observation_digest":"sha256:688498874a1b1abc684881b5cc0b3d1c2535712563da07cbd6c1fa1a47458d10","observation_id":"56bfbda1-683b-4fb9-8d47-3eedf29945a3","resolution":{"observed_at":"2026-05-18T10:16:14.022179Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-04T06:48:07.504557Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21759","last_updated":"2026-08-03T02:53:48Z","snapshot_observed_at":"2026-08-07T02:35:12.054616Z","submitted_at":"2025-11-24T13:36:54Z","title":"Orchestrating Dual-Boundaries: An Arithmetic Intensity Inspired Acceleration Framework for Diffusion Language Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T06:48:07.504557Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2511.21759"},"observation_digest":"sha256:d3e4817ff4bc6841927db9db456a1da06d418fa6d8c4c139fe93aa5685912677","observation_id":"fec7feb1-b6b8-4129-9369-9fee9c7b174e","resolution":{"observed_at":"2026-08-04T06:48:07.504557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-03T09:03:18.430987Z","title":"Train for the worst, plan for the best: Understanding token ordering in masked diffusions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.15165","last_updated":"2026-06-08T15:43:52Z","snapshot_observed_at":"2026-08-08T11:50:23.271252Z","submitted_at":"2026-01-21T16:41:58Z","title":"The Flexibility Trap: Rethinking the Value of Arbitrary Order in Diffusion Language Models","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T09:03:18.430987Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2601.15165"},"observation_digest":"sha256:44b5557a8785c566a891fa8809abfc26cdbcf60b6ff3f54579bbd82ca0853b9e","observation_id":"fbc823c4-a07f-4cbd-9dd9-d894542b9dca","resolution":{"observed_at":"2026-08-03T09:03:18.430987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-02T23:50:35.687236Z","title":"Train for the worst, plan for the best: Understanding token ordering in masked diffusions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-08T22:46:16.097170Z","submitted_at":"2026-02-13T03:56:22Z","title":"Can I Have Your Order? Monte-Carlo Tree Search for Slot Filling Ordering in Diffusion Language Models","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:35.687236Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:e6e696187d53b3181d95bdbae6bacb052d8ba37a419a103ff260fd3f74bb3e0c","observation_id":"8f209714-d395-4eef-9b0d-3360128e187d","resolution":{"observed_at":"2026-08-02T23:50:35.687236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2602.18176","last_updated":"2026-05-22T13:29:19Z","snapshot_observed_at":"2026-07-06T22:46:30.684694Z","submitted_at":"2026-02-20T12:26:03Z","title":"Improving Sampling for Masked Diffusion Models via Information Gain","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T07:30:59.831550Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2602.18176"},"observation_digest":"sha256:a0ea5b89aedc6319666b07efd55669f0ae46b42da95c35a168cae27b15688a18","observation_id":"27b1c985-13df-4f1d-8d20-52e66d90387f","resolution":{"observed_at":"2026-05-25T07:35:29.553802Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2604.18471","last_updated":"2026-04-26T18:45:11Z","snapshot_observed_at":"2026-07-06T23:05:21.974248Z","submitted_at":"2026-04-20T16:22:59Z","title":"NI Sampling: Accelerating Discrete Diffusion Sampling by Token Order Optimization","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-10T05:56:52.205196Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2604.18471"},"observation_digest":"sha256:b66c81722e50446ac71d74ee55bcf1f4adb06e8d40f293e031eee882d30e2d87","observation_id":"e9b30012-3594-4bb1-b7f0-c952572a09ec","resolution":{"observed_at":"2026-05-10T06:01:13.651543Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2604.22847","last_updated":"2026-04-22T00:46:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-22T00:46:12Z","title":"Dream-Cubed: Controllable Generative Modeling in Minecraft by Training on Billions of Cubes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T01:36:23.517745Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2604.22847"},"observation_digest":"sha256:beb94f1ea0801a8bcfad20a4089cfc6f2b89cf007e25244d27c71ac0c9650b5f","observation_id":"2a270bd4-ece4-49c9-9000-5c95cf327229","resolution":{"observed_at":"2026-05-11T13:31:02.693815Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.04291","last_updated":"2026-05-05T20:51:03Z","snapshot_observed_at":"2026-08-02T06:41:29.432265Z","submitted_at":"2026-05-05T20:51:03Z","title":"Leveraging Pretrained Language Models as Energy Functions for Glauber Dynamics Text Diffusion","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-08T17:59:38.981808Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.04291"},"observation_digest":"sha256:5df956a8b92a39ae734c5b29fb7a61b98f1fb8427c50b11e710a239c9ab16496","observation_id":"b73b694c-31ba-44c9-9f19-96b90f55ac1d","resolution":{"observed_at":"2026-05-09T06:55:40.945408Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.07971","last_updated":"2026-06-16T14:50:02Z","snapshot_observed_at":"2026-08-08T17:24:50.850826Z","submitted_at":"2026-05-08T16:32:17Z","title":"DVD: Discrete Voxel Diffusion for 3D Generation and Editing","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-11T03:17:23.458350Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.07971"},"observation_digest":"sha256:95c8fec1ba014400b09cfddb946edce0cf1a137783ea1cb44a2bea5af82c4bfe","observation_id":"bcf2ee0a-9d5c-43b2-8c08-3f2ac6e6a856","resolution":{"observed_at":"2026-05-11T03:20:56.041772Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.07971","last_updated":"2026-06-16T14:50:02Z","snapshot_observed_at":"2026-08-08T17:24:50.850826Z","submitted_at":"2026-05-08T16:32:17Z","title":"DVD: Discrete Voxel Diffusion for 3D Generation and Editing","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-30T23:07:55.414879Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.07971"},"observation_digest":"sha256:2354b09dc42e140cfab9431f724072b88a7543bc40bc564ea90a426848515eaf","observation_id":"562dd056-20fa-44c6-b398-6f276be30f7e","resolution":{"observed_at":"2026-07-01T13:35:45.865646Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.09397","last_updated":"2026-05-10T07:50:02Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T07:50:02Z","title":"BadDLM: Backdooring Diffusion Language Models with Diverse Targets","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-12T04:30:13.417357Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.09397"},"observation_digest":"sha256:9b1fa2dae41d9055dfb149ca16f326f7eca37b9d4ab0faf1adb125138d520dbe","observation_id":"9b467d38-df70-4eb6-80ab-ba9ba05acfc1","resolution":{"observed_at":"2026-05-12T06:11:26.021507Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.12522","last_updated":"2026-04-04T17:30:35Z","snapshot_observed_at":"2026-08-02T09:51:20.420159Z","submitted_at":"2026-04-04T17:30:35Z","title":"Differences in Text Generated by Diffusion and Autoregressive Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-14T20:59:06.804446Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.12522"},"observation_digest":"sha256:75ef2db61957f951752a753065f845fe26db75e0d50e0180abd572d5770b5619","observation_id":"53fe7f81-04c3-4510-8d9b-59349b00f96c","resolution":{"observed_at":"2026-05-14T20:59:27.216349Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.18253","last_updated":"2026-05-18T11:54:11Z","snapshot_observed_at":"2026-08-04T00:59:05.051487Z","submitted_at":"2026-05-18T11:54:11Z","title":"Machine Unlearning for Masked Diffusion Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-20T10:25:29.989996Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.18253"},"observation_digest":"sha256:13d2a243a7caab75f2a19b9cd9b02cd8dea68962c9a1207a0cd2393c46b2f9dc","observation_id":"18a23232-b700-4907-b2d2-190b480ffa37","resolution":{"observed_at":"2026-05-20T10:28:12.183936Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.22967","last_updated":"2026-05-29T16:01:35Z","snapshot_observed_at":"2026-07-06T23:33:14.457450Z","submitted_at":"2026-05-21T18:53:22Z","title":"Learned Relay Representations for Forward-Thinking Discrete Diffusion Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-25T05:58:38.285214Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.22967"},"observation_digest":"sha256:6e5ef4a9504e72b4ba84660818513ef9791abfe6d99359a17cea564a8406947d","observation_id":"3eda5b08-5efa-4399-8b57-d744b69c60dc","resolution":{"observed_at":"2026-05-25T06:00:22.949155Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.22967","last_updated":"2026-05-29T16:01:35Z","snapshot_observed_at":"2026-07-06T23:33:14.457450Z","submitted_at":"2026-05-21T18:53:22Z","title":"Learned Relay Representations for Forward-Thinking Discrete Diffusion Models","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-30T17:19:17.567336Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.22967"},"observation_digest":"sha256:b7a446a10e1a50ac88fd54825c4f505b44c64e84ab26fd4ed876eb15ae78f04d","observation_id":"cbceaca5-1261-4336-9be3-144ec8575287","resolution":{"observed_at":"2026-06-30T17:24:56.657854Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.26106","last_updated":"2026-05-25T17:58:24Z","snapshot_observed_at":"2026-07-06T23:36:01.564747Z","submitted_at":"2026-05-25T17:58:24Z","title":"Looped Diffusion Language Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T23:13:12.343355Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.26106"},"observation_digest":"sha256:0e5445baf459451e4cc3a7c0c938d15b51c02c4638e255e8f3e674aa1eb55110","observation_id":"61ab2ed5-f5e0-44d3-b4b2-8535f3cf6cc8","resolution":{"observed_at":"2026-06-29T23:14:01.233835Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2605.31215","last_updated":"2026-05-29T12:19:26Z","snapshot_observed_at":"2026-08-06T01:51:22.197760Z","submitted_at":"2026-05-29T12:19:26Z","title":"Fixed-Point Masked Generative Modeling","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T23:18:27.050697Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2605.31215"},"observation_digest":"sha256:8fdb8cad4d4a819d7ff4c217dc8506cd7e0a4749e6ef3e7d366755801bd22aab","observation_id":"723d248e-d4b7-4dc8-9b37-76a587a455f3","resolution":{"observed_at":"2026-06-28T23:22:47.311991Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2606.00295","last_updated":"2026-05-29T19:26:53Z","snapshot_observed_at":"2026-07-06T23:41:01.066075Z","submitted_at":"2026-05-29T19:26:53Z","title":"Adaptive Order Policies for Masked Diffusion","version":1},"reference_index":125,"source":"arxiv_source","source_observed_at":"2026-06-28T23:33:40.937370Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2606.00295"},"observation_digest":"sha256:8f6d0c290558c81a2ea7eb6e79c8a896ece28b42637e6167e476e1958e894992","observation_id":"3b4c2b8a-c273-4092-9b07-3132d93f3b52","resolution":{"observed_at":"2026-06-28T23:42:49.852077Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2606.15531","last_updated":"2026-06-16T14:29:31Z","snapshot_observed_at":"2026-08-08T06:11:28.037599Z","submitted_at":"2026-06-14T01:18:53Z","title":"Greedy Coordinate Diffusion: Effective and Semantically Coherent Adversarial Attacks via Diffusion Guidance","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-27T04:35:35.594085Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2606.15531"},"observation_digest":"sha256:a0596b23a782f2266e57f2d90295cc5d212fdf269c794bed3b53ccc18fde7701","observation_id":"447343f6-155d-4d50-8f20-76e34eff5d9d","resolution":{"observed_at":"2026-07-03T17:08:43.456267Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2606.17999","last_updated":"2026-06-22T14:15:54Z","snapshot_observed_at":"2026-08-07T11:50:42.443761Z","submitted_at":"2026-06-16T14:46:53Z","title":"VoidPadding: Let [VOID] Handle Padding in Masked Diffusion Language Models so that [EOS] Can Focus on Semantic Termination","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-27T00:42:43.220998Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2606.17999"},"observation_digest":"sha256:81432106c5a87427c1bca5bf9d026ff7b71a5b403ce831e4885f036d1fc33aa1","observation_id":"cc42d0f7-66a2-433b-8808-5799b9d059f8","resolution":{"observed_at":"2026-07-03T21:18:59.415750Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2606.21633","last_updated":"2026-08-03T07:03:11Z","snapshot_observed_at":"2026-08-06T23:31:34.924100Z","submitted_at":"2026-06-19T17:36:51Z","title":"HERALD: High-Throughput Block Diffusion LLM Serving via CPU-GPU Cooperative KV Cache Retrieval","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T14:44:11.281545Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2606.21633"},"observation_digest":"sha256:8764507f46e5294a7161189b500d2af6da98ed8c22a829b6f0a96c4c216d678e","observation_id":"e33f9926-e033-49e2-95dd-43c885a76833","resolution":{"observed_at":"2026-07-04T06:09:37.893553Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-04T04:42:24.004422Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.21633","last_updated":"2026-08-03T07:03:11Z","snapshot_observed_at":"2026-08-06T23:31:34.924100Z","submitted_at":"2026-06-19T17:36:51Z","title":"HERALD: High-Throughput Block Diffusion LLM Serving via CPU-GPU Cooperative KV Cache Retrieval","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T04:42:24.004422Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2606.21633"},"observation_digest":"sha256:5dfe8d3b13d46f7370f9a742746ecdac73139586b4d876a84a830f12c6deb847","observation_id":"9ca19fe0-953c-4045-87e7-55dd8ff041cd","resolution":{"observed_at":"2026-08-04T04:42:24.004422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2606.24773","last_updated":"2026-06-23T16:33:13Z","snapshot_observed_at":"2026-08-03T19:51:43.287097Z","submitted_at":"2026-06-23T16:33:13Z","title":"Posterior Refinement: Fast Language Generation via Any-Order Flow Maps","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-25T23:55:07.047233Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2606.24773"},"observation_digest":"sha256:9ae9dd5b81895fb1c182d2ab0969017de94d687428d14b3f19bab6b2390b571a","observation_id":"141d10e3-4a78-4148-b518-d503eb1b40c1","resolution":{"observed_at":"2026-07-04T17:09:58.841357Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2606.29150","last_updated":"2026-06-28T02:10:36Z","snapshot_observed_at":"2026-08-04T09:36:16.236854Z","submitted_at":"2026-06-28T02:10:36Z","title":"Flow Reasoning Models: Scaling Reasoning Through Iterative Self-Refinement","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T07:55:28.254309Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2606.29150"},"observation_digest":"sha256:2af5ad3d18469d2f4347fe38640ce746fc47b258a93288e73990b82ef1090aaa","observation_id":"c3da5f8a-1093-44ec-a48d-29ed37552aae","resolution":{"observed_at":"2026-06-30T08:04:28.391758Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":"2502.06768","doi":"10.48550/arxiv.2502.06768","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Train for the worst, plan for the best: Understand- ing token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025a","venue":"ArXiv.org","work_id":"651c93dd-9d4b-4e64-b236-ba0c05372415","year":2025},"citing_paper":{"arxiv_id":"2607.01775","last_updated":"2026-07-02T06:45:43Z","snapshot_observed_at":"2026-08-05T08:13:48.395073Z","submitted_at":"2026-07-02T06:45:43Z","title":"Set Diffusion: Interpolating Token Orderings Between Autoregression and Diffusion for Fast and Flexible Decoding","version":1},"reference_index":126,"source":"arxiv_source","source_observed_at":"2026-07-03T17:30:39.458521Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2607.01775"},"observation_digest":"sha256:0f8036f3ee38aa1f0ea681d881d546951022a73e9a7b085f6b931030f8e00d4c","observation_id":"2a17ccb4-4df9-4ffa-b53e-e7c6fda83cbc","resolution":{"observed_at":"2026-07-03T17:38:43.660283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:20.775054+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-02T14:47:38.747246Z","title":"Train for the worst, plan for the best: Understanding token ordering in masked diffusions.arXiv preprint arXiv:2502.06768, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14106","last_updated":"2026-05-07T16:23:06Z","snapshot_observed_at":"2026-08-09T09:48:28.365294Z","submitted_at":"2026-05-07T16:23:06Z","title":"Token Time Continuous Diffusion for Language Modeling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T14:47:38.747246Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2607.14106"},"observation_digest":"sha256:b31a75c7dca5913195d4571a9e340403204241d81bc7d8d1d3c918dd751c7ecf","observation_id":"adf67ca4-000e-483b-bee8-d0b37172eda4","resolution":{"observed_at":"2026-08-02T14:47:38.747246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-01T22:03:47.298320Z","title":"arXiv preprint arXiv:2502.06768 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15893","last_updated":"2026-07-20T09:15:04Z","snapshot_observed_at":"2026-08-06T03:20:22.645111Z","submitted_at":"2026-07-17T12:07:59Z","title":"Induction in Both Directions: A Mechanistic Analysis of In-Context Learning in Masked Diffusion Language Models","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T22:03:47.298320Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2607.15893"},"observation_digest":"sha256:a262a0b36dc2f209717a4dc014ab10437d5775ecbccbc34b3a6a4b235dadaac3","observation_id":"0763a10f-93ad-47f4-8df0-be35922051a6","resolution":{"observed_at":"2026-08-01T22:03:47.298320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06768","snapshot_observed_at":"2026-08-01T14:25:36.566046Z","title":"arXiv preprint arXiv:2502.06768 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26504","last_updated":"2026-07-29T06:09:12Z","snapshot_observed_at":"2026-08-06T23:53:20.383703Z","submitted_at":"2026-07-29T06:09:12Z","title":"From Interface to Inference: Eliciting Any-Order Inference from Any-Order Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T14:25:36.566046Z"},"links":{"cited_paper":"/paper/2502.06768","citing_paper":"/paper/2607.26504"},"observation_digest":"sha256:6dac2d6370ec43b9f4bc0e30e1e03bd0d90850664ebc6a8556affaf7f9775c6b","observation_id":"0ad39670-df90-4732-a662-909b84523784","resolution":{"observed_at":"2026-08-01T14:25:36.566046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.06768/citation-record","integrity":"/paper/2502.06768/integrity","json":"/paper/2502.06768/citation-record.json","paper":"/paper/2502.06768"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.16627","last_updated":"2025-07-03T16:00:09Z","snapshot_observed_at":"2026-08-09T08:24:36.486816Z","submitted_at":"2024-07-23T16:37:58Z","title":"Hardness of sampling solutions from the Symmetric Binary Perceptron","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16627","snapshot_observed_at":"2026-08-08T14:30:26.519377Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.519377Z"},"links":{"cited_paper":"/paper/2407.16627","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:c50b949deec65e272f9e92d86ddd314ea4895a93aafadf30ff62ddf81bdf0714","observation_id":"a99380a0-57d6-40b8-93f1-32d8822d3733","resolution":{"observed_at":"2026-08-08T14:30:26.519377Z","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-08T14:30:27.584957Z","title":"The masking problem in this case amounts to an instance of SLPN with input dimension N and sample size in [Ω(N log N ), O(N 0.49k)]","venue":null,"work_id":"d3048630-3e0a-4067-aa28-d2989901d9ea","year":2024},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.698170Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:ae6a25ae16d9529cd235ae07262a381bd7d25c64b8f944d29351166505406a0c","observation_id":"0537716a-70b0-4789-bd12-d079e69bda9e","resolution":{"observed_at":"2026-08-08T14:30:27.589490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08095","last_updated":"2024-02-14T05:30:46Z","snapshot_observed_at":"2026-07-06T17:29:13.310354Z","submitted_at":"2024-02-12T22:26:52Z","title":"Convergence Analysis of Discrete Diffusion Model: Exact Implementation through Uniformization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08095","snapshot_observed_at":"2026-08-08T14:30:26.531142Z","title":"and Ying, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.531142Z"},"links":{"cited_paper":"/paper/2402.08095","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:0fca2c5b655e2567e236c320be93368ddd72b5d9a90558677b821a7724be1ef7","observation_id":"09a4ea35-a5b6-47a6-8c97-537d9f784b97","resolution":{"observed_at":"2026-08-08T14:30:26.531142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17891","last_updated":"2025-05-31T07:01:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-23T14:04:22Z","title":"Scaling Diffusion Language Models via Adaptation from Autoregressive Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.17891","snapshot_observed_at":"2026-08-08T14:30:26.552074Z","title":"Scaling diffu- sion language models via adaptation from autoregressive models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.552074Z"},"links":{"cited_paper":"/paper/2410.17891","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:d99d3dc4f5b313269306cdc9671c4e21e1921dc81635144f52980999577f82ff","observation_id":"29a53bc6-7939-492a-ba15-b29b99d27b5f","resolution":{"observed_at":"2026-08-08T14:30:26.552074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09751","last_updated":"2020-02-14T21:56:30Z","snapshot_observed_at":"2026-07-06T07:47:32.745963Z","submitted_at":"2019-04-22T07:17:18Z","title":"The Curious Case of Neural Text Degeneration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09751","snapshot_observed_at":"2026-08-08T14:30:26.563081Z","title":"The curious case of neural text degeneration","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.563081Z"},"links":{"cited_paper":"/paper/1904.09751","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:06fa729d51f008f27f249b2836e10ff38b1d60a2c0a5e78eca7a1bcf62f18589","observation_id":"3576d7e9-9c8b-4982-a9e4-3edd56ab00fc","resolution":{"observed_at":"2026-08-08T14:30:26.563081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05448","last_updated":"2025-08-12T00:55:59Z","snapshot_observed_at":"2026-08-07T20:09:25.657117Z","submitted_at":"2024-10-07T19:28:59Z","title":"Task Diversity Shortens the ICL Plateau","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05448","snapshot_observed_at":"2026-08-08T14:30:26.573991Z","title":"Y ., Park, J., Cho, J., Lee, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.573991Z"},"links":{"cited_paper":"/paper/2410.05448","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:cc33c74117f914f4b8899fc516ca1d0958e0f5901902eb18c2905c2998838e72","observation_id":"8a399de3-29b5-43b9-9e8e-5aca717eba9b","resolution":{"observed_at":"2026-08-08T14:30:26.573991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01949","last_updated":"2025-03-19T08:34:29Z","snapshot_observed_at":"2026-07-06T19:26:33.330434Z","submitted_at":"2024-10-02T18:51:38Z","title":"Discrete Copula Diffusion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01949","snapshot_observed_at":"2026-08-08T14:30:26.579065Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.579065Z"},"links":{"cited_paper":"/paper/2410.01949","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:66babe093556b8467abefd38c95033464a9bde4d30fc237b3b83e13226c18573","observation_id":"8c43c252-643c-4c56-9e67-9cc13f14db8b","resolution":{"observed_at":"2026-08-08T14:30:26.579065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06264","last_updated":"2025-04-10T01:26:11Z","snapshot_observed_at":"2026-08-09T13:14:20.402647Z","submitted_at":"2024-10-08T18:03:34Z","title":"Think While You Generate: Discrete Diffusion with Planned Denoising","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06264","snapshot_observed_at":"2026-08-08T14:30:26.583976Z","title":"Think while you generate: Discrete diffusion with planned denoising","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.583976Z"},"links":{"cited_paper":"/paper/2410.06264","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:548a2af6a4daf564467ebd810704ccdf452da4fb673f1f8fb8116deb10ceff4b","observation_id":"fd094fe7-6892-41cb-8ce8-8b61edc15d6d","resolution":{"observed_at":"2026-08-08T14:30:26.583976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09992","last_updated":"2025-10-18T15:35:05Z","snapshot_observed_at":"2026-08-04T04:34:22.998376Z","submitted_at":"2025-02-14T08:23:51Z","title":"Large Language Diffusion Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09992","snapshot_observed_at":"2026-08-08T14:30:26.594373Z","title":"Large language diffusion models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.594373Z"},"links":{"cited_paper":"/paper/2502.09992","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:6b3034d96712c416d1687c6c53617084b260c09ba01f60ba26a3eddfd2e6f733","observation_id":"20e8a1e7-8bfa-46be-9fdb-ee765c32c0f1","resolution":{"observed_at":"2026-08-08T14:30:26.594373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17505","last_updated":"2024-07-24T12:57:56Z","snapshot_observed_at":"2026-08-03T23:41:19.559086Z","submitted_at":"2024-01-30T23:46:35Z","title":"Arrows of Time for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17505","snapshot_observed_at":"2026-08-08T14:30:26.604561Z","title":"Arrows of time for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.604561Z"},"links":{"cited_paper":"/paper/2401.17505","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:c1c236f43607c605979ccd92d48b505b51e99f46a4e0f91637507b1e22eedfa1","observation_id":"3913cad7-113c-4ba6-9046-e4215344753f","resolution":{"observed_at":"2026-08-08T14:30:26.604561Z","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-08T14:30:26.609706Z","title":"Z., Bezemek, Z., Patel, S., Yao, S., Rector- Brooks, J., Tong, A., and Chatterjee, P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.609706Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:7d69c412ac11a63644cdac320b8db24e662b6a14528a40cf95c9c498731773e7","observation_id":"d7d0c6ac-993e-48b9-8995-6d8c8c04bd5e","resolution":{"observed_at":"2026-08-08T14:30:26.609706Z","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-08T14:30:26.614486Z","title":"Rector-Brooks, J., Hasan, M., Peng, Z., Quinn, Z., Liu, C., Mittal, S., Dziri, N., Bronstein, M., Bengio, Y ., Chatterjee, P., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.614486Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:1c7fe696b3a6aae362c4f25b4cc56bc9f13c7e037ac8a314e6bc9134a1d209f2","observation_id":"c0d9fbef-9157-4304-882e-22ccd31abed2","resolution":{"observed_at":"2026-08-08T14:30:26.614486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05098","last_updated":"2017-06-15T21:38:12Z","snapshot_observed_at":"2026-08-04T14:30:44.904839Z","submitted_at":"2017-06-15T21:38:12Z","title":"An Overview of Multi-Task Learning in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05098","snapshot_observed_at":"2026-08-08T14:30:26.619206Z","title":"An overview of multi-task learning in deep neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.619206Z"},"links":{"cited_paper":"/paper/1706.05098","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:bac6bbad7bbccd8549ec07da8e7783035a56d3ecc0aa2eb4661bb95c33a745e6","observation_id":"8974803b-2a83-44a4-b891-b5bcd1173543","resolution":{"observed_at":"2026-08-08T14:30:26.619206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.10193","last_updated":"2025-05-27T20:06:29Z","snapshot_observed_at":"2026-07-06T20:06:35.280407Z","submitted_at":"2024-12-13T15:08:30Z","title":"Simple Guidance Mechanisms for Discrete Diffusion Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.10193","snapshot_observed_at":"2026-08-08T14:30:26.624071Z","title":"S., Phung, H., Wang, G., Boshar, S., Dalla-torre, H., de Almeida, B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.624071Z"},"links":{"cited_paper":"/paper/2412.10193","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:0c50f6ea0f5b92215910f82e6b2ddf3e04d22cf1c90e9d05818ed8a073d68d69","observation_id":"eb7ba4f9-f5bb-4b64-892e-2fc9f3e31ed4","resolution":{"observed_at":"2026-08-08T14:30:26.624071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.10502","last_updated":"2024-09-16T17:42:15Z","snapshot_observed_at":"2026-07-06T19:16:14.638445Z","submitted_at":"2024-09-16T17:42:15Z","title":"Causal Language Modeling Can Elicit Search and Reasoning Capabilities on Logic Puzzles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.10502","snapshot_observed_at":"2026-08-08T14:30:26.629118Z","title":"Causal language modeling can elicit search and rea- soning capabilities on logic puzzles","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.629118Z"},"links":{"cited_paper":"/paper/2409.10502","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:5338be8aac66697fa154d9a29ae869b71152bf69ac63ca5dd1067a8f7703ba1b","observation_id":"080dafbd-fd5b-47ee-af33-e71bfdf5d486","resolution":{"observed_at":"2026-08-08T14:30:26.629118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-08T14:30:26.634021Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.634021Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:6d2e79e485a05b96687c2760b28f6052a9e79e268c759162bddeab8e2534c7a3","observation_id":"d7718d30-0132-4a37-9a28-b545048721a7","resolution":{"observed_at":"2026-08-08T14:30:26.634021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17035","last_updated":"2025-03-16T09:13:20Z","snapshot_observed_at":"2026-07-06T18:20:27.214667Z","submitted_at":"2024-05-27T10:42:13Z","title":"Glauber Generative Model: Discrete Diffusion Models via Binary Classification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17035","snapshot_observed_at":"2026-08-08T14:30:26.638882Z","title":"Glauber gen- erative model: Discrete diffusion models via binary clas- sification","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.638882Z"},"links":{"cited_paper":"/paper/2405.17035","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:9e71a67a21ca7fef2f862c1eb7d611c99dbd6d9390be567514f229cf83bc2a27","observation_id":"747b8ab0-a13e-4921-b6cb-fb2d19336a54","resolution":{"observed_at":"2026-08-08T14:30:26.638882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21357","last_updated":"2025-03-07T04:28:45Z","snapshot_observed_at":"2026-07-06T19:41:01.525832Z","submitted_at":"2024-10-28T17:25:56Z","title":"Energy-Based Diffusion Language Models for Text Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21357","snapshot_observed_at":"2026-08-08T14:30:26.643674Z","title":"Energy-based diffusion language models for text generation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.643674Z"},"links":{"cited_paper":"/paper/2410.21357","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:a23852b92dc37908c5df3dd50c19542d3ddff42e625c9ea80d7bbf468b77b272","observation_id":"81cc45e6-46db-49a7-8546-d7f7c832866c","resolution":{"observed_at":"2026-08-08T14:30:26.643674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14157","last_updated":"2025-02-18T03:52:31Z","snapshot_observed_at":"2026-07-06T19:35:44.200337Z","submitted_at":"2024-10-18T03:48:53Z","title":"Beyond Autoregression: Discrete Diffusion for Complex Reasoning and Planning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14157","snapshot_observed_at":"2026-08-08T14:30:26.648499Z","title":"Beyond autoregression: Discrete diffusion for complex reasoning and planning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.648499Z"},"links":{"cited_paper":"/paper/2410.14157","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:a7c73c36692fb91250bc30bb9c8bc83f9a15bfc675513ff4e4c88b6682ed647e","observation_id":"db06a411-7239-4560-acec-193bc9737f02","resolution":{"observed_at":"2026-08-08T14:30:26.648499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02385","last_updated":"2024-06-04T02:05:30Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-04T17:54:59Z","title":"TinyLlama: An Open-Source Small Language Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02385","snapshot_observed_at":"2026-08-08T14:30:26.653711Z","title":"Tinyllama: An open-source small language model","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.653711Z"},"links":{"cited_paper":"/paper/2401.02385","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:01744c20de93ae2b99d1f257d4a006a883e70137f6fd3e1f22ada69a64576e40","observation_id":"e3692237-7bc8-44bc-9571-a8bb078fada1","resolution":{"observed_at":"2026-08-08T14:30:26.653711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02908","last_updated":"2025-04-30T08:39:26Z","snapshot_observed_at":"2026-08-09T12:40:33.547471Z","submitted_at":"2024-09-04T17:48:19Z","title":"Masked Diffusion Models are Secretly Time-Agnostic Masked Models and Exploit Inaccurate Categorical Sampling","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02908","snapshot_observed_at":"2026-08-08T14:30:26.658567Z","title":"Masked diffusion models are secretly time- agnostic masked models and exploit inaccurate categori- cal sampling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.658567Z"},"links":{"cited_paper":"/paper/2409.02908","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:957c3a8df077ebea3dcc5f6af760330b28bc3ed3a6925653d5ffbf4aa2cd9ece","observation_id":"f472a23a-6263-4708-a269-052cc1f7914d","resolution":{"observed_at":"2026-08-08T14:30:26.658567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05737","last_updated":"2024-08-02T16:09:14Z","snapshot_observed_at":"2026-08-06T16:42:40.001017Z","submitted_at":"2023-02-11T16:26:57Z","title":"A Reparameterized Discrete Diffusion Model for Text Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.05737","snapshot_observed_at":"2026-08-08T14:30:26.663511Z","title":"A reparameter- ized discrete diffusion model for text generation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.663511Z"},"links":{"cited_paper":"/paper/2302.05737","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:9eeda99273f76a7c2ed1d9039333c7f312a499db702497885ae296fe7cdb38dc","observation_id":"49205f45-5c7d-4a25-8f2b-013ccd93bc00","resolution":{"observed_at":"2026-08-08T14:30:26.663511Z","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-08T14:30:27.654724Z","title":"left-to-right","venue":null,"work_id":"62a5feef-28e0-4a2c-8e1d-add4f57e11f4","year":2024},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.672995Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:1e1c783530606bd5b3aeadbe20fb8b2cda52358898b0319374c7fa38d796cd9f","observation_id":"29a22153-4f1e-4320-9340-2ba4dbb5dc01","resolution":{"observed_at":"2026-08-08T14:30:27.659125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.640264Z","title":"left-to-right","venue":null,"work_id":"c1ca38bc-8e25-4e58-9ea9-fe1382836a62","year":2024},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.678031Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:68182054b485a5c3f732e5b8cf0864783401765d6f4999ba1b0c410165113e41","observation_id":"fb0c09e8-1f73-4296-b6c0-6c26eac71244","resolution":{"observed_at":"2026-08-08T14:30:27.644984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.626095Z","title":"Recently, discrete diffusion models have emerged as a promising approach for discrete data apart from autoregressive models","venue":null,"work_id":"d0e9d939-7897-4f43-8ee7-42692daad754","year":2023},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.682524Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:e8f164a25e5ad6da13bc842abcc6bac7bfddf6e39ef86f2a9704c868cd87f335","observation_id":"71d17a1d-f2ed-44dd-90b6-33477054b7ec","resolution":{"observed_at":"2026-08-08T14:30:27.630597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.612415Z","title":"Building on these intuitions, (Shih et al., 2022; Hoogeboom et al., 2021a) proposed any-order modeling, which allows a model to generate in any desired order","venue":null,"work_id":"1abe959b-ffdb-4ba8-beb7-45ac8acf9090","year":2022},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.687862Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:479fa89c8585e5dff10b423ad38c52ff770c89b769c73294db53abab5730599d","observation_id":"ba5d92fa-a074-4e4b-b9c3-e2b1ab5b581f","resolution":{"observed_at":"2026-08-08T14:30:27.616952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.598695Z","title":null,"venue":null,"work_id":"0d28f34a-6ade-4020-a97e-beb0a8cf8c41","year":2003},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.693447Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:79e6319884c2983d0ccc2a51db4fb9048288d9e7a1a81190909981ff77714f9a","observation_id":"649038e1-f737-4c0e-ac4e-e9624d1a12a0","resolution":{"observed_at":"2026-08-08T14:30:27.603035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.571130Z","title":"Theorem B.8 (Theorem 2.1 in (Alaoui & Gamarnik, 2024)4)","venue":null,"work_id":"87be5537-86f8-40f5-9495-d1e23a29cd21","year":2021},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.702985Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:b4dbf2932e9f359472a584f2bea917ca5f3aacc1592c72313f1ca0b553f97e35","observation_id":"638059af-1f93-41f3-aeaf-7ef5f4a40e76","resolution":{"observed_at":"2026-08-08T14:30:27.575645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.529116Z","title":null,"venue":null,"work_id":"2b560a9b-a767-4230-aa3c-f73c48ae8f2f","year":2019},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.717118Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:4edf15dde6a37953c9ea78f434f8999ca60a6a76e1d4ace1689aee995f6a810c","observation_id":"083c517b-5ba7-4eb5-ac7c-eeee4712e83a","resolution":{"observed_at":"2026-08-08T14:30:27.533494Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.514179Z","title":"The prediction is that in this regime, no efficient algorithm can achieve optimal recovery (Krzakala & Zdeborov´a, 2009)","venue":null,"work_id":"7b1ee588-35a3-4132-af57-3a771dbc4437","year":2009},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.721834Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:564d41134a366eb21591b02c86d9d01d3ae87d2f886a01e668c16d359e21d8ea","observation_id":"160d0c7b-964c-4ba8-9fef-eec79366d879","resolution":{"observed_at":"2026-08-08T14:30:27.519217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.496501Z","title":null,"venue":null,"work_id":"52718246-0333-4a1c-9f82-99933f27296b","year":2011},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.726409Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:14a8ee5fc2dc9a542563e6eb9b5e621dc4698de884f0d24e54add44f3b1efca5","observation_id":"160aa1b7-dfed-446a-8a18-6aa31d5e2d4f","resolution":{"observed_at":"2026-08-08T14:30:27.501477Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.480580Z","title":"In particular, we use AdamW optimizer (Loshchilov & Hutter, 2017), setting β1 = 0.9, β2 = 0.95, and a weight decay of 0.1 and L =","venue":null,"work_id":"38ae4bba-0f31-45dc-88ce-36896c0a5c70","year":2017},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.731300Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:9b3b18e1a64b98e025e3151cdf23c0bf2ee4088c3a88f286ae080b23dc847676","observation_id":"51fc588f-019f-432d-a00e-bb8147138038","resolution":{"observed_at":"2026-08-08T14:30:27.485794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.436689Z","title":"For the Sudoku dataset, we use 6M GPT-2 model, and for the Zebra dataset, we use 19M model","venue":null,"work_id":"0516b893-7aa9-4047-aca4-b44304b0db8e","year":2025},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.745300Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:4936ac7a30477218d61d915f349f0bf0342c772f872876d2985add59b943d0d3","observation_id":"e3bdcbc2-c265-4c1f-a4f6-fd06569fd117","resolution":{"observed_at":"2026-08-08T14:30:27.441627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.419972Z","title":"Let x(n) be a sequence with n tokens being masked from x0, and xi(n) denotes the ith token value of the sequence x(n)","venue":null,"work_id":"6f21b9e2-b215-4dc9-be4d-5b28ac7de2b6","year":2024},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.749910Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:bdf3da401847a15fd696314f5df8283fab999eccdf4f73eb5de279d3bfe25901","observation_id":"adc66e30-97da-4ea4-bdb6-e41e5ae78fb3","resolution":{"observed_at":"2026-08-08T14:30:27.426534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.556920Z","title":"3.3 this implies a range of masking fractions at which Ω(1) fraction of masking problems are computationally hard","venue":null,"work_id":"90721777-0129-40a2-b09a-05320dc3b90e","year":2009},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.707726Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:7f0030cbd42176ea66f17cbd99e7a48c418de5ee2422b9973c71e5ae5c84502b","observation_id":"f4311bb5-79db-4f82-9ed8-049ef7b77a57","resolution":{"observed_at":"2026-08-08T14:30:27.561832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.451401Z","title":"To attain a proxy MDM for the Bayes optimal predictor, we further train it for 5 × 104 iterations","venue":null,"work_id":"c6e9f9b4-95b2-47a1-a605-a086fe10bbbb","year":2024},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":512,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.740382Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:2accb003d221e0d65d2ca075d3cb214dbf10df4a9ef56c73f8dd7e9344bacb38","observation_id":"4ae739bd-465e-49fd-91db-70bf36db96aa","resolution":{"observed_at":"2026-08-08T14:30:27.456127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.18514","last_updated":"2025-02-28T07:02:59Z","snapshot_observed_at":"2026-08-06T04:06:21.906356Z","submitted_at":"2024-10-24T08:01:22Z","title":"Scaling up Masked Diffusion Models on Text","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.18514","snapshot_observed_at":"2026-08-08T14:30:26.589138Z","title":"Scaling up masked diffusion models on text","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.589138Z"},"links":{"cited_paper":"/paper/2410.18514","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:ee1615ae167e5a1a84780c5d325678347db36f6fedc94a074c751131ed1992cc","observation_id":"b73e98bd-08c8-49b5-921f-4760f318d6fe","resolution":{"observed_at":"2026-08-08T14:30:26.589138Z","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-08T14:30:27.542750Z","title":null,"venue":null,"work_id":"c1258577-f9f5-4e7b-a577-a50b06eb976c","year":2008},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.712370Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:3772bfc3ac01f95d3b770833cd4b919df9449807ae8285646d4e9b500fccf7b8","observation_id":"5fe1ab87-98ac-40b2-a22d-729a381255dd","resolution":{"observed_at":"2026-08-08T14:30:27.547087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T14:30:27.682217Z","title":"BERT: Pre-training of deep bidirectional transformers for lan- guage understanding","venue":null,"work_id":"185d1a70-0ce5-4edd-9211-607202e30ab4","year":2019},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.541576Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:5936ad8a82a980356af83d5af94ec0e0fa5a9267285d485dd923a496719cffea","observation_id":"ab7b43b3-8d12-47ab-806d-25df3894b371","resolution":{"observed_at":"2026-08-08T14:30:27.686837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02037","last_updated":"2022-02-01T21:32:15Z","snapshot_observed_at":"2026-07-06T11:54:31.182477Z","submitted_at":"2021-10-05T13:36:55Z","title":"Autoregressive Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.02037","snapshot_observed_at":"2026-08-08T14:30:26.568575Z","title":"A., Bastings, J., Poole, B., Berg, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.568575Z"},"links":{"cited_paper":"/paper/2110.02037","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:d095cbdc96589b0da780e1286c78e7a8064c4f73dc79850aed09cf640f1974f8","observation_id":"d98187dd-a582-42f6-8540-bbb602a7fdbd","resolution":{"observed_at":"2026-08-08T14:30:26.568575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-07-06T12:54:11.616335Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-08-08T14:30:26.557894Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.557894Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:00b9d7f9e273f3349c738a70d6ebdb991765635da85b4e0c20331d7c689bb5f0","observation_id":"7e72164c-a837-4f8b-b1ec-18f6749ab3c5","resolution":{"observed_at":"2026-08-08T14:30:26.557894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13799","last_updated":"2024-05-07T20:35:15Z","snapshot_observed_at":"2026-07-06T17:47:51.284226Z","submitted_at":"2024-03-20T17:55:35Z","title":"Reverse Training to Nurse the Reversal Curse","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13799","snapshot_observed_at":"2026-08-08T14:30:26.546360Z","title":"Reverse training to nurse the reversal curse","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.546360Z"},"links":{"cited_paper":"/paper/2403.13799","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:7f782f091c320adadb94e6da0d78a2a1af758db42ac1e42d451b41be8a23591c","observation_id":"216d8b06-891c-496d-8dda-f2f0d45217ea","resolution":{"observed_at":"2026-08-08T14:30:26.546360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.14255","last_updated":"2022-07-28T17:40:47Z","snapshot_observed_at":"2026-08-07T11:38:07.397956Z","submitted_at":"2022-07-28T17:40:47Z","title":"Efficient Training of Language Models to Fill in the Middle","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.14255","snapshot_observed_at":"2026-08-08T14:30:26.525629Z","title":"Bormashenko, O","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.525629Z"},"links":{"cited_paper":"/paper/2207.14255","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:413b1e4f22ea123cd71694749f6e892528825131daa9ba1a6f54efa4683e7620","observation_id":"c4f92b62-e5ad-434d-91f3-0d056214a6e3","resolution":{"observed_at":"2026-08-08T14:30:26.525629Z","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-08T14:30:27.668330Z","title":"Related works Discrete diffusion models","venue":null,"work_id":"457aa933-9e7e-48fd-946e-175e6aced4ae","year":2015},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.668253Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:fcedc43cf592a7a485938db65077a4daaff5d90028fb5920d1a60430d3d74f44","observation_id":"0ba1a31a-e36c-44b9-a518-7cb3b123c37c","resolution":{"observed_at":"2026-08-08T14:30:27.672921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08939","last_updated":"2024-05-28T04:32:09Z","snapshot_observed_at":"2026-08-06T03:42:39.770101Z","submitted_at":"2024-02-14T04:50:18Z","title":"Premise Order Matters in Reasoning with Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08939","snapshot_observed_at":"2026-08-08T14:30:26.536327Z","title":"A., Wang, X., and Zhou, D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.536327Z"},"links":{"cited_paper":"/paper/2402.08939","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:304c1266cf62ea6dba29ec2089bf538d9c8c49d8d134e3411aa5432f8897ba86","observation_id":"0a407f53-3870-479f-a04c-a46cc2441bd5","resolution":{"observed_at":"2026-08-08T14:30:26.536327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03736","last_updated":"2026-03-23T09:46:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-06T04:22:11Z","title":"Your Absorbing Discrete Diffusion Secretly Models the Conditional Distributions of Clean Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03736","snapshot_observed_at":"2026-08-08T14:30:26.599525Z","title":"Your absorbing discrete diffusion secretly models the conditional distributions of clean data","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.599525Z"},"links":{"cited_paper":"/paper/2406.03736","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:abee7aa07b7b8deee24b13f0332d7110c3805273451ccee1def2047f56699b61","observation_id":"e0579f42-412d-4bf4-b0e9-f001140f1390","resolution":{"observed_at":"2026-08-08T14:30:26.599525Z","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-08T14:30:27.465820Z","title":"We also note that unless otherwise specified, we maintain the same training configuration throughout the paper","venue":null,"work_id":"81a65221-c35f-4882-a1d1-3e4da3102ad2","year":2022},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":2048,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.735882Z"},"links":{"citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:d5f78c3192699bf5d654d450fd21b1a4bf9b4f5a8e1a0e726ab51d59971eed02","observation_id":"5ae789bc-d2b7-490d-a1eb-89e911c623ad","resolution":{"observed_at":"2026-08-08T14:30:27.470404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T09:47:58.662011Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":47},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 35 inbound Pith citation observations for arXiv:2502.06768."}